{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":438,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":438,"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":"3ef37ca07c93","filters":{"topic":"Cryptography and Residue Arithmetic"}},"results":[{"id":"W1880212920","doi":"10.1007/b97644","title":"Guide to Elliptic Curve Cryptography","year":2004,"lang":"en","type":"book","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":3089,"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":"Elliptic curve cryptography; Elliptic curve; Cryptography; Computer science; Computer security; Mathematics; Public-key cryptography; Mathematical analysis; Encryption","authors":[{"name":"Darrel Hankerson","is_ca":false},{"name":"Alfred Menezes","is_ca":true},{"name":"Scott Vanstone","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007210403771848686,"gpt":0.2367032915151741,"spread":0.2294928877433254,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004060049,0.001634205,0.001315893,0.002444182,0.0008659158,0.002019279,0.001121824,0.001126342,0.1485568],"category_scores_gemma":[0.001291067,0.0007937662,0.0004250231,0.002348273,0.000741331,0.003753288,0.00129183,0.002740267,0.1604571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009644736,"about_ca_system_score_gemma":0.001229507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007418547,"about_ca_topic_score_gemma":0.002037088,"domain_scores_codex":[0.999562,0.00003391141,0.00001606782,0.00005339248,0.0002974145,0.00003716517],"domain_scores_gemma":[0.9994727,0.0001255519,0.0000236428,0.0001130361,0.0002140643,0.000051111],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002504226,0.00008090182,0.0001101881,0.0002714381,0.000009068011,0.00008030538,0.0001137956,0.00110106,0.001787713,0.05331849,0.4858479,0.4572541],"study_design_scores_gemma":[0.000007226415,0.00002212863,0.0001442148,0.000137355,0.000005102196,0.0002663065,0.00002076175,0.0007323594,0.0007537016,0.02381696,0.9740825,0.00001131723],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.001074457,0.01554166,0.06909044,0.001493416,0.001699792,0.0001806739,0.0008828698,0.003450801,0.9065859],"genre_scores_gemma":[0.003985227,0.008141372,0.01759308,0.0005398201,0.0005443285,0.00007360814,0.0007977507,0.0005459526,0.9677788],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.1485568,"threshold_uncertainty_score":0.4969721,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013613544","doi":"10.1007/s102070100002","title":"The Elliptic Curve Digital Signature Algorithm (ECDSA)","year":2001,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2198,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Research Canada","funders":"","keywords":"Elliptic Curve Digital Signature Algorithm; Elliptic curve cryptography; Elliptic curve point multiplication; Post-quantum cryptography; Algorithm; Curve25519; Computer science; Hessian form of an elliptic curve; Digital Signature Algorithm; Tripling-oriented Doche–Icart–Kohel curve; Digital signature; Schoof's algorithm; NIST; Elliptic curve; Discrete logarithm; ElGamal signature scheme; Cryptography; Mathematics; Public-key cryptography; Hash function; Blind signature; Encryption; Pure mathematics; Computer security; Quarter period","authors":[{"name":"Don B. Johnson","is_ca":true},{"name":"Alfred Menezes","is_ca":true},{"name":"Scott A. Vanstone","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004100972361733678,"gpt":0.2268713816543628,"spread":0.2227704092926291,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00124606,0.0006536598,0.0007140053,0.00141005,0.0009365032,0.002506026,0.0007191659,0.001258084,0.006495614],"category_scores_gemma":[0.004145165,0.0002275427,0.0005262443,0.001396928,0.001048887,0.002535895,0.002232151,0.001368655,0.005492879],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006565168,"about_ca_system_score_gemma":0.0018109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002664202,"about_ca_topic_score_gemma":0.0002196323,"domain_scores_codex":[0.9983278,0.0003828467,0.0001380013,0.0002748853,0.0006826587,0.0001937798],"domain_scores_gemma":[0.9978595,0.0003501612,0.000177439,0.0009207763,0.0005555457,0.0001364715],"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.001024472,0.0001677292,0.002281684,0.0003333592,0.00006322032,0.0002148395,0.0001371363,0.009420834,0.03309106,0.3092892,0.01466884,0.6293076],"study_design_scores_gemma":[0.000354461,0.0009487035,0.002175136,0.0002496107,0.0001106693,0.003766791,0.0001797508,0.1140132,0.1355575,0.357001,0.3854795,0.0001637484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1011932,0.0053927,0.7926764,0.003527942,0.002182783,0.0005830054,0.001543928,0.005478798,0.08742123],"genre_scores_gemma":[0.657685,0.002894063,0.2977509,0.0008396994,0.0006410405,0.0002009451,0.001430332,0.0002877176,0.03827034],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006495614,"threshold_uncertainty_score":0.02173001,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1754939103","doi":"10.1023/a:1008354106356","title":"The State of Elliptic Curve Cryptography","year":2000,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":668,"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":"Discrete logarithm; Public-key cryptography; Multiplicative function; Mathematics; Modulo; Cryptosystem; Elliptic curve cryptography; Elliptic curve; Cryptography; Arithmetic; Key (lock); Diffie–Hellman key exchange; Prime (order theory); Discrete mathematics; Logarithm; Computer science; Pure mathematics; Algorithm; Combinatorics; Computer security; Key exchange; Encryption","authors":[{"name":"Neal Koblitz","is_ca":false},{"name":"Alfred Menezes","is_ca":true},{"name":"Scott A. Vanstone","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0106775203571429,"gpt":0.2186878329867931,"spread":0.2080103126296502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006006673,0.0007053165,0.001225256,0.00312519,0.002884011,0.01076369,0.00147357,0.004666646,0.005974757],"category_scores_gemma":[0.01488252,0.0009137201,0.0005760495,0.004169207,0.01606915,0.02327198,0.004436087,0.01261441,0.002709457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003607925,"about_ca_system_score_gemma":0.002720306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008980347,"about_ca_topic_score_gemma":0.0004105888,"domain_scores_codex":[0.9958287,0.001347474,0.0002866377,0.0007269275,0.001454809,0.0003553402],"domain_scores_gemma":[0.988398,0.006030548,0.0006504888,0.002749855,0.001708762,0.0004623932],"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.00007866194,0.00003983699,0.0001456228,0.0001767128,0.000009844044,0.00002629972,0.000312925,0.0007300262,0.0004483204,0.9443856,0.006840991,0.04680509],"study_design_scores_gemma":[0.00002356173,0.00004432785,0.0001197299,0.0002396098,0.00000924192,0.00006248105,0.00009382291,0.002389739,0.0008306449,0.8723568,0.1237985,0.00003149443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.03562805,0.3292655,0.1669951,0.1308384,0.01044468,0.0001753098,0.0008796202,0.0006501788,0.3251231],"genre_scores_gemma":[0.6721773,0.2015847,0.04877789,0.01171139,0.02813956,0.000267923,0.0005565085,0.000211814,0.03657301],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.01076369,"threshold_uncertainty_score":0.03176671,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1562630396","doi":"10.1017/cbo9780511546570","title":"Advances in Elliptic Curve Cryptography","year":2005,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":506,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Cryptography; Elliptic curve cryptography; Computer science; Theoretical computer science; Computer security; Field (mathematics); Elliptic curve; Mathematics; Public-key cryptography; Encryption; Pure mathematics","authors":[{"name":"Ian F. Blake","is_ca":true},{"name":"Nigel P. Smart","is_ca":false},{"name":"Daniel W. Brown","is_ca":false},{"name":"Alexander W. Dent","is_ca":false},{"name":"Elisabeth Oswald","is_ca":false},{"name":"Marc Jóye","is_ca":false},{"name":"Fréderik Vercauteren","is_ca":false},{"name":"Pierrick Gaudry","is_ca":false},{"name":"Steven D. Galbraith⋆","is_ca":false},{"name":"Kenneth G. Paterson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008789292478801355,"gpt":0.194320597010347,"spread":0.1855313045315456,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002009998,0.001272189,0.0009156046,0.003757169,0.001510071,0.004818026,0.001059983,0.001801332,0.02015278],"category_scores_gemma":[0.005001145,0.0007804701,0.0007707634,0.004505473,0.003161075,0.01414419,0.003355247,0.006462274,0.01795166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002266493,"about_ca_system_score_gemma":0.001941212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003477834,"about_ca_topic_score_gemma":0.0003172222,"domain_scores_codex":[0.9980022,0.0002975375,0.0001482637,0.0002270479,0.001179345,0.0001455816],"domain_scores_gemma":[0.9978153,0.000898019,0.00008620806,0.0004716144,0.0005692983,0.0001595289],"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.00002975826,0.00005060449,0.0001109249,0.0006269081,0.00001035525,0.0001123223,0.0004010414,0.0009007782,0.001029689,0.7143922,0.067452,0.2148835],"study_design_scores_gemma":[0.00000513042,0.00002210588,0.0000726929,0.0003425658,0.000004036533,0.000360966,0.00005307564,0.0004914684,0.000409619,0.1576219,0.8406045,0.00001201485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.002815135,0.3306951,0.055401,0.01661553,0.009369177,0.0001245992,0.000208484,0.0006487395,0.5841224],"genre_scores_gemma":[0.04762759,0.5159291,0.07046505,0.004657769,0.01598843,0.0001444284,0.0004247105,0.0005164274,0.3442466],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.02015278,"threshold_uncertainty_score":0.06741774,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021553056","doi":"10.1007/s00145-009-9048-z","title":"A Taxonomy of Pairing-Friendly Elliptic Curves","year":2009,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":467,"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":"National Defense Science and Engineering Graduate; Division of Mathematical Sciences; Directorate for Mathematical and Physical Sciences; Science Foundation Ireland; National Science Foundation","keywords":"Pairing; Embedding; Elliptic curve; Mathematics; Cryptography; Computer science; Pure mathematics; Theoretical computer science; Physics; Algorithm; Artificial intelligence; Superconductivity; Quantum mechanics","authors":[{"name":"David Mandell Freeman","is_ca":false},{"name":"Michael Scott","is_ca":false},{"name":"Edlyn Teske","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01443367674452202,"gpt":0.2395251486617141,"spread":0.2250914719171921,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002517964,0.001515537,0.0009791483,0.005322881,0.003092693,0.004636196,0.001327248,0.00213601,0.00355876],"category_scores_gemma":[0.005842295,0.0007010254,0.001091752,0.005485117,0.003117461,0.009326097,0.004007085,0.003828437,0.002016609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00101318,"about_ca_system_score_gemma":0.001573964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003391204,"about_ca_topic_score_gemma":0.0002038178,"domain_scores_codex":[0.9962255,0.0007591451,0.0005821622,0.000499872,0.001481499,0.0004518289],"domain_scores_gemma":[0.9966345,0.0006173608,0.0005078559,0.001123151,0.0007067581,0.0004102956],"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.00003864486,0.00005347929,0.00136378,0.0002060783,0.00001043498,0.0003191523,0.0007215491,0.00157786,0.002045849,0.9396433,0.002894811,0.05112524],"study_design_scores_gemma":[0.00002966184,0.000278093,0.001347492,0.0004948846,0.0000286763,0.004916003,0.0007070812,0.008386095,0.004278073,0.6644677,0.3149571,0.0001091153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09870838,0.0142872,0.7200987,0.003584358,0.0008043916,0.00123104,0.001228089,0.00204973,0.1580082],"genre_scores_gemma":[0.408436,0.02416803,0.5342545,0.001054854,0.0008186192,0.0009758609,0.00219036,0.0004171392,0.02768459],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005322881,"threshold_uncertainty_score":0.01331645,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1987475429","doi":"10.1515/jmc-2012-0015","title":"Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies","year":2014,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":398,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Isogeny; Mathematics; Cryptosystem; Supersingular elliptic curve; Endomorphism ring; Public-key cryptography; Elliptic curve; Mathematical proof; Post-quantum cryptography; Endomorphism; Commutative property; Cryptography; Scheme (mathematics); Discrete mathematics; Pure mathematics; Algebra over a field; Encryption; Computer science; Algorithm; Mathematical analysis","authors":[{"name":"Luca De Feo","is_ca":false},{"name":"David Jao","is_ca":true},{"name":"Jérôme Plût","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01353937373835186,"gpt":0.2384679318503223,"spread":0.2249285581119704,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006092033,0.0007738556,0.00122575,0.001312264,0.001522082,0.004280171,0.001909322,0.002494357,0.007163104],"category_scores_gemma":[0.01379617,0.0008547865,0.0008592047,0.00101177,0.004641324,0.01124865,0.00584874,0.006124357,0.002104621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001660968,"about_ca_system_score_gemma":0.001449029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002729727,"about_ca_topic_score_gemma":0.0001792025,"domain_scores_codex":[0.9936811,0.001933859,0.0003151269,0.0007607007,0.00266235,0.0006469765],"domain_scores_gemma":[0.9892867,0.004473957,0.001035186,0.003956366,0.0008424266,0.0004053823],"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.0004631482,0.000173608,0.000480804,0.0001589629,0.00003122884,0.0001569798,0.0005107907,0.01529482,0.0180838,0.9488492,0.001990825,0.01380583],"study_design_scores_gemma":[0.0003311549,0.0002786063,0.0002360508,0.00007470348,0.00004740339,0.0002764144,0.0002743746,0.1964601,0.06737674,0.7211623,0.01339838,0.00008367463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2372583,0.0006548404,0.7249073,0.004308775,0.0002989819,0.000783439,0.0002253105,0.001605245,0.02995777],"genre_scores_gemma":[0.8533496,0.0004791488,0.1368655,0.0004009783,0.0001674328,0.0004177343,0.0002569268,0.000247094,0.007815563],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007163104,"threshold_uncertainty_score":0.0322181,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2135205181","doi":"10.26421/qic3.4-3","title":"Shor's discrete logarithm quantum algorithm for elliptic curves","year":2003,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":327,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Post-quantum cryptography; Quantum algorithm; Quantum computer; Integer factorization; Qubit; Mathematics; Elliptic curve; Quantum Fourier transform; Schoof's algorithm; Elliptic curve cryptography; Discrete mathematics; Counting points on elliptic curves; Logarithm; Modulo; Algorithm; Cryptography; Quantum phase estimation algorithm; Quantum; Quantum error correction; Public-key cryptography; Computer science; Quantum mechanics; Pure mathematics; Encryption; Mathematical analysis; Physics","authors":[{"name":"John Proos","is_ca":true},{"name":"Ch. Zalka","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01243195162450697,"gpt":0.2534901271177673,"spread":0.2410581754932603,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001756333,0.0006672938,0.001051849,0.000935356,0.001629663,0.002168209,0.00144819,0.001199726,0.007785625],"category_scores_gemma":[0.003717802,0.0004576934,0.0009670288,0.001312499,0.002102009,0.004624823,0.002657233,0.00186867,0.002660034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001009902,"about_ca_system_score_gemma":0.002005103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008055853,"about_ca_topic_score_gemma":0.0007752876,"domain_scores_codex":[0.9978368,0.0004679883,0.0001450341,0.00023135,0.0009881522,0.0003307728],"domain_scores_gemma":[0.9991366,0.0002672087,0.00004456141,0.000335942,0.0001675255,0.00004814765],"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.0001285918,0.00005885333,0.0001862091,0.0001278773,0.00002024002,0.0001108831,0.0002157632,0.02322846,0.003285984,0.8972077,0.005960744,0.0694686],"study_design_scores_gemma":[0.000119462,0.0001010312,0.00009563938,0.00005570329,0.00001886665,0.0001394769,0.00007637022,0.1253061,0.01137048,0.8323405,0.03031977,0.00005653949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02140043,0.0006199974,0.9443083,0.001533567,0.000401834,0.0002401589,0.0001606166,0.001333887,0.03000113],"genre_scores_gemma":[0.3344362,0.001108433,0.6472998,0.0004065965,0.0002224725,0.000363233,0.0003666671,0.0003727319,0.01542381],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007785625,"threshold_uncertainty_score":0.0260455,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149204794","doi":"10.1109/tc.2004.47","title":"Low complexity bit parallel architectures for polynomial basis multiplication over GF(2m)","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":242,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite field; Trinomial; Polynomial basis; Multiplier (economics); Multiplication (music); Irreducible polynomial; GF(2); Mathematics; Finite field arithmetic; Primitive polynomial; Arithmetic; Polynomial; Matrix multiplication; Discrete mathematics; Computer science; Matrix polynomial; Combinatorics","authors":[{"name":"Arash Reyhani-Masoleh","is_ca":true},{"name":"M.A. Hasan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02133126280777332,"gpt":0.2522161742658325,"spread":0.2308849114580592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002094597,0.0004536062,0.0003109761,0.0003429454,0.0003874778,0.0006478432,0.0007305058,0.0002688097,0.003892644],"category_scores_gemma":[0.000565421,0.0001724127,0.0004242023,0.0006135932,0.0003538246,0.001219435,0.0003219131,0.0006222934,0.0009497562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005895006,"about_ca_system_score_gemma":0.0006638862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005197584,"about_ca_topic_score_gemma":0.002421245,"domain_scores_codex":[0.9997961,0.00004792116,0.00001602718,0.00003398845,0.00007810589,0.00002798556],"domain_scores_gemma":[0.999779,0.00005598958,0.00004438066,0.00006896661,0.00004390119,0.000007830081],"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.0004351528,0.0001986801,0.001052302,0.000594519,0.000104781,0.0005020892,0.0002727285,0.1787711,0.1739723,0.3449748,0.005703275,0.2934182],"study_design_scores_gemma":[0.0001267705,0.0007078957,0.0009346969,0.00006136007,0.0001112488,0.0008404683,0.00009545808,0.7385496,0.1086085,0.123298,0.02661194,0.00005397977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1054379,0.0005521302,0.8814443,0.0002211715,0.00007465675,0.0001435246,0.000108585,0.0008135666,0.01120416],"genre_scores_gemma":[0.4825441,0.0006268579,0.507748,0.0001128938,0.0000742545,0.0001584245,0.0002796905,0.00007874623,0.008377079],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003892644,"threshold_uncertainty_score":0.01302212,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3101994345","doi":"","title":"Constructing elliptic curve isogenies in quantum subexponential time","year":2010,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":235,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Isogeny; Mathematics; Quantum algorithm; Elliptic curve; Cryptosystem; Quantum; Discrete mathematics; Quantum Fourier transform; Endomorphism ring; Finite field; Cryptography; Pure mathematics; Algorithm; Endomorphism; Quantum mechanics; Quantum error correction","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.005256157962366835,"gpt":0.2073080397679782,"spread":0.2020518818056113,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002314817,0.0006259692,0.001261746,0.001043682,0.001113419,0.00368713,0.001428034,0.001184905,0.005583483],"category_scores_gemma":[0.01034313,0.0004633792,0.00121357,0.001210876,0.002153388,0.006489483,0.003922937,0.003080608,0.001746001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002096169,"about_ca_system_score_gemma":0.002360856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000739047,"about_ca_topic_score_gemma":0.0008605677,"domain_scores_codex":[0.9972917,0.0004368096,0.0001780516,0.0005629847,0.001090862,0.0004393878],"domain_scores_gemma":[0.9939007,0.002601068,0.0004005767,0.00233559,0.0005483699,0.0002137332],"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.001014372,0.0005015603,0.003898553,0.0003265068,0.0001570337,0.0002921611,0.001255566,0.03579214,0.03640866,0.6415089,0.004326839,0.2745177],"study_design_scores_gemma":[0.0003478245,0.0002483,0.001127975,0.00004438653,0.0001081587,0.0003566771,0.000437882,0.1844395,0.0587162,0.7408195,0.0132749,0.00007866121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2570634,0.0003942903,0.7212859,0.001460632,0.0001178848,0.0002350946,0.0001952204,0.002943862,0.0163037],"genre_scores_gemma":[0.6792591,0.0003488848,0.3119187,0.0002279747,0.00008956211,0.0001681766,0.0004116122,0.0004116788,0.007164375],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005583483,"threshold_uncertainty_score":0.01867867,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045890225","doi":"10.1515/jmc-2012-0016","title":"Constructing elliptic curve isogenies in quantum subexponential time","year":2013,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":187,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Isogeny; Finite field; Cardinality (data modeling); Quantum algorithm; Quantum Fourier transform; Elliptic curve; Quantum; Cryptosystem; Endomorphism; Discrete logarithm","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.0096042011635041,"gpt":0.2281385526665449,"spread":0.2185343515030408,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00249843,0.0005631294,0.001077277,0.001018307,0.001069359,0.002925898,0.001308156,0.001068361,0.006222516],"category_scores_gemma":[0.01053124,0.000392868,0.001054074,0.001217449,0.002275654,0.005528095,0.00385449,0.00248111,0.001438258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00267626,"about_ca_system_score_gemma":0.002754712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007901562,"about_ca_topic_score_gemma":0.001023165,"domain_scores_codex":[0.9970988,0.0005390177,0.0001890905,0.0005671366,0.001157923,0.0004480015],"domain_scores_gemma":[0.9932417,0.002961952,0.0004787379,0.002329775,0.0006853412,0.0003025256],"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.001626135,0.0006724847,0.008042258,0.0004632091,0.0002319508,0.000422265,0.00124859,0.05026663,0.04590002,0.6495731,0.005875594,0.2356777],"study_design_scores_gemma":[0.000459001,0.000327531,0.00173269,0.00006757706,0.0001124234,0.0004066148,0.0004379064,0.2239316,0.06494168,0.6942707,0.01322913,0.00008318036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4257253,0.0005423954,0.5479267,0.001905238,0.0001794483,0.0002704523,0.0002725917,0.002579835,0.02059801],"genre_scores_gemma":[0.8263995,0.0001981849,0.1668112,0.0001896806,0.00006933159,0.0001132045,0.0003565566,0.0002243256,0.005637957],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006222516,"threshold_uncertainty_score":0.02081639,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2540113050","doi":"10.1109/tcsi.2016.2611561","title":"Post-Quantum Cryptography on FPGA Based on Isogenies on Elliptic Curves","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":179,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Isogeny; Computer science; Key exchange; Cryptography; Supersingular elliptic curve; Software; Public-key cryptography; Parallel computing; Elliptic curve cryptography; Curve25519; Shared secret; Arithmetic; Elliptic curve; Algorithm; Operating system; Mathematics; Encryption","authors":[{"name":"Brian Koziel","is_ca":false},{"name":"Reza Azarderakhsh","is_ca":false},{"name":"Mehran Mozaffari Kermani","is_ca":false},{"name":"David Jao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01194929650327333,"gpt":0.2063620050636738,"spread":0.1944127085604005,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003136589,0.0004921521,0.0003704517,0.000561154,0.0003598208,0.0008674639,0.0007304682,0.0002561392,0.005808369],"category_scores_gemma":[0.0007451039,0.0001728288,0.0002878639,0.0005930219,0.0003944978,0.001154944,0.0003537381,0.0003981459,0.001246558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007777361,"about_ca_system_score_gemma":0.0006009421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001042073,"about_ca_topic_score_gemma":0.001293399,"domain_scores_codex":[0.9995561,0.000083091,0.000027602,0.00005707826,0.0001760695,0.00009998686],"domain_scores_gemma":[0.9995826,0.0001021462,0.00004810937,0.0001688539,0.00007984907,0.00001838958],"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.002469894,0.0003506631,0.005594373,0.0008109403,0.0001410656,0.001074527,0.000402417,0.08929309,0.216716,0.1262579,0.01261218,0.5442769],"study_design_scores_gemma":[0.0005331087,0.002354743,0.007823202,0.0002079616,0.0001699889,0.001391078,0.0001538505,0.3682535,0.4926126,0.03392352,0.09243937,0.0001370068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.650658,0.002048414,0.2793169,0.0004332908,0.0003454977,0.0002223797,0.0003058898,0.007498402,0.0591712],"genre_scores_gemma":[0.9331907,0.0004022736,0.05872885,0.00008902595,0.00004635179,0.00005270742,0.0002047272,0.00009815735,0.007187043],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005808369,"threshold_uncertainty_score":0.01943099,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1557014463","doi":"10.1007/3-540-46766-1_20","title":"New Public-Key Schemes Based on Elliptic Curves over the Ring Zn","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":173,"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":"Factoring; Public key cryptosystem; Public-key cryptography; Elliptic curve; Cryptosystem; Mathematics; Multiplier (economics); Class (philosophy); Digital signature; Computer science; Ring (chemistry); Arithmetic; Discrete mathematics; Cryptography; Computer security; Pure mathematics; Algorithm; Encryption","authors":[{"name":"Kenji Koyama","is_ca":false},{"name":"Ueli Maurer","is_ca":false},{"name":"Tatsuaki Okamoto","is_ca":false},{"name":"Scott A. Vanstone","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02363073939586826,"gpt":0.252383862852978,"spread":0.2287531234571097,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001191506,0.0007828343,0.000945925,0.00122312,0.00114944,0.002977584,0.001588196,0.001083001,0.008794907],"category_scores_gemma":[0.002620991,0.0005387961,0.0005293672,0.001393557,0.001869894,0.00989016,0.00297545,0.00232398,0.002349403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001745601,"about_ca_system_score_gemma":0.0009290082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001523208,"about_ca_topic_score_gemma":0.0003176941,"domain_scores_codex":[0.9989381,0.0001581295,0.00007464701,0.0001826225,0.0004894932,0.0001568516],"domain_scores_gemma":[0.9989236,0.0002835617,0.000138673,0.0003716483,0.0001617109,0.000120773],"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.0005151493,0.0001532703,0.0002900515,0.0003107361,0.00003636575,0.0001463989,0.0003667361,0.00346971,0.01339869,0.8790033,0.005970348,0.09633928],"study_design_scores_gemma":[0.0005637209,0.0002536008,0.0007039392,0.0002041553,0.0001202306,0.001670951,0.000152997,0.03655563,0.02757739,0.7251922,0.2068682,0.000136871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1921164,0.01450695,0.6302221,0.0051911,0.002648337,0.0006849205,0.0007283295,0.003183348,0.1507185],"genre_scores_gemma":[0.7029427,0.0079929,0.19925,0.0007046195,0.001142063,0.0003904513,0.0007493836,0.0003450518,0.08648266],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008794907,"threshold_uncertainty_score":0.02942187,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111459803","doi":"10.1109/tc.2002.1017695","title":"Bit-parallel finite field multiplier and squarer using polynomial basis","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":160,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Trinomial; Finite field; Mathematics; Polynomial basis; Irreducible polynomial; Multiplier (economics); Primitive polynomial; Polynomial; Multiplication (music); Basis (linear algebra); Normal basis; Inverse; Discrete mathematics; Modulo; Arithmetic; Matrix polynomial; Combinatorics; Galois theory; Mathematical analysis","authors":[{"name":"Huapeng Wu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02397500966732785,"gpt":0.225899180900632,"spread":0.2019241712333042,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005342143,0.000536641,0.0005795358,0.0005405886,0.0005137302,0.0009433366,0.0005275563,0.0004201528,0.003927936],"category_scores_gemma":[0.001230967,0.0002444404,0.0005797863,0.0005160816,0.0005702535,0.001900661,0.0005782808,0.0007547227,0.001365223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005553452,"about_ca_system_score_gemma":0.0009290206,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005222888,"about_ca_topic_score_gemma":0.00121836,"domain_scores_codex":[0.99943,0.00009427175,0.00003131217,0.00008583532,0.0002712884,0.00008729278],"domain_scores_gemma":[0.9995197,0.0001658069,0.00006004365,0.0001306748,0.0001032264,0.00002060219],"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.000994405,0.0002576933,0.0009612667,0.0004384737,0.00007902359,0.0005265856,0.0002737517,0.1164934,0.1633309,0.4672796,0.004321107,0.2450439],"study_design_scores_gemma":[0.000170081,0.0009583982,0.0006962368,0.00006076292,0.000087671,0.001432645,0.0001096351,0.6102065,0.1644278,0.2014828,0.02027786,0.00008960843],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2114729,0.0006886522,0.7650288,0.0003406783,0.00008572263,0.0001443405,0.00006868695,0.001046852,0.02112351],"genre_scores_gemma":[0.7439644,0.0006691816,0.2396892,0.00009797074,0.00009932411,0.0001002927,0.0002210061,0.00009659913,0.01506196],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003927936,"threshold_uncertainty_score":0.01314026,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160886236","doi":"10.1090/s0025-5718-06-01900-4","title":"A double large prime variation for small genus hyperelliptic index calculus","year":2006,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":135,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Prime (order theory); Hyperelliptic curve cryptography; Genus; Logarithm; Context (archaeology); Variation (astronomy); Discrete logarithm; Heuristic; Field (mathematics); Algorithm; Calculus (dental); Pure mathematics; Combinatorics; Computer science; Mathematical optimization; Mathematical analysis","authors":[{"name":"Pierrick Gaudry","is_ca":false},{"name":"Emmanuel Thomé","is_ca":false},{"name":"Nicolas Thériault","is_ca":true},{"name":"Claus Diem","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0146945947311421,"gpt":0.2393141835337826,"spread":0.2246195888026405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001466854,0.0006464257,0.0009932366,0.00113815,0.0007568175,0.001925439,0.001295008,0.000483755,0.004486797],"category_scores_gemma":[0.006829435,0.0002817446,0.0006027188,0.00103835,0.001836466,0.0030255,0.003434342,0.002299795,0.001289581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006567183,"about_ca_system_score_gemma":0.0007008006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002085108,"about_ca_topic_score_gemma":0.0003072092,"domain_scores_codex":[0.99858,0.0003374105,0.00006521691,0.0002372478,0.0006511117,0.0001289432],"domain_scores_gemma":[0.9978856,0.0007641781,0.0001340165,0.0008576675,0.0002394221,0.0001189802],"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.0004369788,0.00009389096,0.001848544,0.0002275597,0.000041434,0.0004284446,0.0003283201,0.02893034,0.02292778,0.5882847,0.004821859,0.3516301],"study_design_scores_gemma":[0.0001254842,0.000380079,0.001287248,0.00007335677,0.00005185261,0.001088686,0.0001168938,0.3501492,0.04179935,0.5696054,0.03519522,0.0001272632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04493378,0.0004128553,0.9456434,0.0003277749,0.0001555621,0.00007612318,0.00003779661,0.001181922,0.007230836],"genre_scores_gemma":[0.3663037,0.0004801771,0.6269546,0.0001929711,0.0003185632,0.00009145051,0.0001173072,0.0005037363,0.005037361],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004486797,"threshold_uncertainty_score":0.01500982,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114353618","doi":"10.1109/tc.2002.1004590","title":"A new construction of Massey-Omura parallel multiplier over GF(2/sup m/)","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":121,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite field; Multiplier (economics); GF(2); Mathematics; Very-large-scale integration; Primitive polynomial; Redundancy (engineering); Irreducible polynomial; Normal basis; Discrete mathematics; Arithmetic; Computer science; Polynomial; Galois theory; Mathematical analysis","authors":[{"name":"Arash Reyhani-Masoleh","is_ca":true},{"name":"M.A. Hasan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01364235175092877,"gpt":0.2101195772906375,"spread":0.1964772255397088,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001922918,0.0005263471,0.0005038792,0.0006525205,0.0006557444,0.0005409394,0.0007706566,0.0004654905,0.002737639],"category_scores_gemma":[0.0005040524,0.0003062124,0.0005204934,0.0007516351,0.0004087809,0.001156011,0.000608943,0.0007011945,0.0009576278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003873873,"about_ca_system_score_gemma":0.0006537237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000288514,"about_ca_topic_score_gemma":0.000647328,"domain_scores_codex":[0.9998382,0.00002693919,0.000011952,0.00004240256,0.00005395409,0.00002646974],"domain_scores_gemma":[0.999782,0.00002713958,0.00003840687,0.00005229475,0.00007434397,0.0000257468],"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.0008985879,0.0001976484,0.001809009,0.0005978401,0.0001604113,0.001356336,0.0003682894,0.01352892,0.2813693,0.1832736,0.01066572,0.5057743],"study_design_scores_gemma":[0.0005205871,0.00312271,0.004848768,0.0001853709,0.0005432949,0.01041185,0.0002294869,0.2184448,0.4077792,0.1303418,0.2232815,0.0002905952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1353233,0.001422526,0.8315578,0.0007552153,0.0006965442,0.0002985184,0.0002453116,0.001726932,0.02797378],"genre_scores_gemma":[0.3959662,0.0009791126,0.5863901,0.000307217,0.0002992408,0.0002526764,0.0004120017,0.00007560539,0.01531787],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002737639,"threshold_uncertainty_score":0.009158313,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978602192","doi":"10.1109/tcsi.2013.2283691","title":"Efficient algorithm and architecture for elliptic curve cryptography for extremely constrained secure applications","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Computer science; Elliptic curve cryptography; Application-specific integrated circuit; Cryptography; Multiplier (economics); Edwards curve; Elliptic curve; Affine transformation; Multiplication (music); Algorithm; Arithmetic; Theoretical computer science; Computer hardware; Encryption; Mathematics; Public-key cryptography","authors":[{"name":"Reza Azarderakhsh","is_ca":true},{"name":"Kimmo Järvinen","is_ca":false},{"name":"Mehran Mozaffari Kermani","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009798990862371267,"gpt":0.2117982830050289,"spread":0.2019992921426577,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002353078,0.0004383689,0.0003375619,0.0007455095,0.000364939,0.0005711752,0.0008055629,0.0003956663,0.002373494],"category_scores_gemma":[0.000449136,0.0001890248,0.000271443,0.0009198074,0.0003611173,0.001217635,0.0006212046,0.0005406417,0.00167943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005036269,"about_ca_system_score_gemma":0.0008476122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004773244,"about_ca_topic_score_gemma":0.0007326416,"domain_scores_codex":[0.9997256,0.00004393872,0.0000213757,0.00003480941,0.0001432923,0.00003098169],"domain_scores_gemma":[0.9998448,0.00001837028,0.00002161685,0.00005094419,0.00005535475,0.000008953882],"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.0004194278,0.0001647069,0.001250049,0.0003876717,0.00007267656,0.0002993875,0.0002142611,0.05732663,0.3041845,0.1227483,0.005921766,0.5070106],"study_design_scores_gemma":[0.0002294228,0.0008683985,0.002030757,0.0001196579,0.00009593087,0.001370011,0.0001477258,0.5954638,0.2528358,0.05468912,0.09205081,0.00009859317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04472726,0.001226035,0.9448849,0.0002490337,0.00006511604,0.0001574948,0.0000646778,0.001246313,0.007379178],"genre_scores_gemma":[0.3596253,0.001233178,0.6307254,0.0001062721,0.00006022936,0.0002101522,0.0003741551,0.00008996325,0.007575351],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002373494,"threshold_uncertainty_score":0.007940114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2604763720","doi":"10.1007/978-3-319-70972-7_9","title":"A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":96,"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":"Random oracle; Computer science; Scheme (mathematics); Digital signature; Mathematical proof; Oracle; Theoretical computer science; Key (lock); Elliptic Curve Digital Signature Algorithm; Quantum computer; Schnorr signature; Algorithm; Topology (electrical circuits); Quantum; Public-key cryptography; Mathematics; Blind signature; Elliptic curve cryptography; Programming language; Quantum mechanics; Computer network; Physics; Geometry; Operating system","authors":[{"name":"Youngho Yoo","is_ca":true},{"name":"Reza Azarderakhsh","is_ca":false},{"name":"Amir Jalali","is_ca":false},{"name":"David Jao","is_ca":true},{"name":"Vladimir Soukharev","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009965248540184131,"gpt":0.223138600505358,"spread":0.2131733519651738,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005598177,0.0005446972,0.0008675921,0.0006103506,0.001171459,0.002106101,0.0007161511,0.0008452644,0.006426753],"category_scores_gemma":[0.001023363,0.0002696143,0.0005709311,0.0009179324,0.002043624,0.003104489,0.001805868,0.001817062,0.002470521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009055152,"about_ca_system_score_gemma":0.001082992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002530355,"about_ca_topic_score_gemma":0.000216046,"domain_scores_codex":[0.9992763,0.0001387782,0.00005347128,0.0001365075,0.0002640884,0.0001307769],"domain_scores_gemma":[0.9993363,0.0001118028,0.00006440321,0.0003061584,0.0001166536,0.00006462655],"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.0002288268,0.00005110322,0.0001394963,0.00007877226,0.00001057848,0.0001185304,0.0001738611,0.001960727,0.01073134,0.9555884,0.002255097,0.02866312],"study_design_scores_gemma":[0.000148206,0.0003524692,0.0005018496,0.00004969179,0.00005545,0.0007075365,0.00009798027,0.03334872,0.03047707,0.8872201,0.04693679,0.00010414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3765179,0.001403784,0.4700381,0.002108153,0.001265211,0.0004039586,0.0009200946,0.002395143,0.1449477],"genre_scores_gemma":[0.8953104,0.0006162841,0.07132214,0.0002876165,0.0003256649,0.0001066616,0.0003868804,0.0002234033,0.03142097],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006426753,"threshold_uncertainty_score":0.02149963,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037497641","doi":"10.1016/j.jnt.2009.01.006","title":"Elliptic curve cryptography: The serpentine course of a paradigm shift","year":2009,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":96,"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":"Cryptography; Ideal (ethics); Elliptic curve cryptography; Function (biology); Computer science; Key (lock); Elliptic curve; Computer security; Mathematics; Public-key cryptography; Political science; Pure mathematics; Law; Encryption","authors":[{"name":"Ann Hibner Koblitz","is_ca":false},{"name":"Neal Koblitz","is_ca":false},{"name":"Alfred Menezes","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007320077022190979,"gpt":0.2511822582921134,"spread":0.2438621812699224,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005284303,0.000978743,0.001005296,0.001708428,0.002850937,0.007193546,0.001219859,0.0046415,0.00476174],"category_scores_gemma":[0.01122082,0.0005595845,0.0006950026,0.001458502,0.01399135,0.02271638,0.004346916,0.01146581,0.001944135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003842942,"about_ca_system_score_gemma":0.00250162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001109122,"about_ca_topic_score_gemma":0.0007370091,"domain_scores_codex":[0.9977506,0.0009202693,0.00009198776,0.000323616,0.0007393126,0.0001742879],"domain_scores_gemma":[0.9959348,0.002246886,0.0001419052,0.0006239179,0.0007518721,0.000300606],"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.00002952703,0.00001917246,0.00003655153,0.0000307833,0.000003289764,0.00002172599,0.0001234877,0.0004283218,0.0001141232,0.9774967,0.007176044,0.01452029],"study_design_scores_gemma":[0.00002041376,0.00002237252,0.00003571649,0.00005364493,0.000001842676,0.00004635605,0.00005516043,0.001267579,0.00011581,0.9558668,0.04250355,0.00001070379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.02202366,0.09081578,0.2198015,0.3389224,0.02061819,0.0001464515,0.0004315554,0.0005993202,0.306641],"genre_scores_gemma":[0.5508199,0.1088148,0.1823612,0.04075386,0.04585231,0.0003316652,0.0002657908,0.0005946114,0.07020596],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007193546,"threshold_uncertainty_score":0.02794641,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W189254053","doi":"10.1007/978-3-319-13039-2_25","title":"A Quantum Algorithm for Computing Isogenies between Supersingular Elliptic Curves","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":92,"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":"Isogeny; Supersingular elliptic curve; Quantum algorithm; Quantum computer; Elliptic curve; Finite field; Field (mathematics); Computer science; Quantum; Cryptography; Base (topology); Schoof's algorithm; Algorithm; Post-quantum cryptography; Mathematics; Discrete mathematics; Pure mathematics; Physics; Quantum mechanics; Mathematical analysis; Quarter period","authors":[{"name":"Jean‐François Biasse","is_ca":true},{"name":"David Jao","is_ca":true},{"name":"Anirudh Sankar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01731719029527132,"gpt":0.2471992145101962,"spread":0.2298820242149249,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007999098,0.0009789566,0.001258086,0.001428478,0.001620991,0.002746269,0.001783977,0.001662788,0.01035449],"category_scores_gemma":[0.002614145,0.0005664121,0.0009182456,0.002302303,0.001659863,0.004419514,0.003332975,0.001968616,0.002602865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001311062,"about_ca_system_score_gemma":0.001376752,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001066261,"about_ca_topic_score_gemma":0.001822136,"domain_scores_codex":[0.9988778,0.0001870143,0.00007909552,0.0002525453,0.0004593452,0.0001442019],"domain_scores_gemma":[0.9989312,0.0003461906,0.00006741261,0.0003648794,0.0002109047,0.00007935688],"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.0005944036,0.0002329076,0.0009764374,0.0002577543,0.0001072384,0.0001439902,0.0004096092,0.02188175,0.01965343,0.4875493,0.01187774,0.4563156],"study_design_scores_gemma":[0.0002616438,0.0002278114,0.0006633083,0.000075525,0.0000776578,0.0002416652,0.0002283193,0.2030244,0.01721979,0.7605177,0.01737258,0.00008944728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06570797,0.0006531099,0.910776,0.0006302491,0.0003455887,0.0001788482,0.0002256642,0.002263736,0.0192189],"genre_scores_gemma":[0.3790936,0.0004145435,0.6051945,0.000271127,0.0002228195,0.0002296822,0.0006099375,0.0003730012,0.01359079],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01035449,"threshold_uncertainty_score":0.03463924,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048276889","doi":"10.1090/s0025-5718-08-02066-8","title":"Fast algorithms for computing isogenies between elliptic curves","year":2008,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Isogeny; Elliptic curve; Prime (order theory); Degree (music); Algorithm; Field (mathematics); Schoof's algorithm; Power series; Finite field; Discrete mathematics; Pure mathematics; Combinatorics; Mathematical analysis; Quarter period","authors":[{"name":"Alin Bostan","is_ca":false},{"name":"François Morain","is_ca":false},{"name":"Bruno Salvy","is_ca":false},{"name":"Éric Schost","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04918734259861358,"gpt":0.2914900139444828,"spread":0.2423026713458692,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003491446,0.002568861,0.001614712,0.004493881,0.001498691,0.004951979,0.002720816,0.00175921,0.01165628],"category_scores_gemma":[0.01517916,0.000943005,0.002585183,0.004335005,0.002432906,0.01392731,0.005513641,0.004597502,0.0058715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002743893,"about_ca_system_score_gemma":0.0020019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001480814,"about_ca_topic_score_gemma":0.001490053,"domain_scores_codex":[0.9956672,0.0007294873,0.0003919726,0.001015584,0.001717993,0.0004777497],"domain_scores_gemma":[0.9932278,0.002768265,0.0004187796,0.002060731,0.001294463,0.0002300022],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004561805,0.0002147639,0.002415956,0.0006244788,0.0001213406,0.0001057929,0.0006055023,0.02552611,0.006903836,0.4574948,0.01601931,0.4895119],"study_design_scores_gemma":[0.0001485614,0.0001955962,0.0007211986,0.0001542037,0.00006046312,0.0002700817,0.0002513422,0.08683928,0.01067096,0.8713038,0.02928819,0.00009643311],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01945496,0.001736602,0.9627548,0.0006136888,0.0003506218,0.0001467384,0.0003966571,0.003319907,0.01122595],"genre_scores_gemma":[0.1957631,0.00215876,0.7817287,0.0004539357,0.000699508,0.0004571277,0.002423988,0.001781287,0.01453358],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01165628,"threshold_uncertainty_score":0.03899413,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136119832","doi":"10.1109/itcc.2004.1286701","title":"High performance FPGA based elliptic curve cryptographic co-processor","year":2004,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Scalar multiplication; Elliptic curve cryptography; Coprocessor; Field-programmable gate array; Elliptic curve; Computer science; NIST; Elliptic curve point multiplication; Finite field; Parallel computing; Binary number; Arithmetic; Mathematics; Embedded system; Discrete mathematics; Encryption; Public-key cryptography; Operating system; Pure mathematics","authors":[{"name":"Jonathan Lutz","is_ca":true},{"name":"Amit Hasan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01026675438707201,"gpt":0.2228050695944466,"spread":0.2125383152073746,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001120223,0.0004255177,0.0003523325,0.000471479,0.0002790683,0.0004490468,0.0007294276,0.0002741006,0.009544823],"category_scores_gemma":[0.0003183542,0.000125572,0.0001180963,0.0006350472,0.0001296287,0.0003889717,0.0001953952,0.0003082681,0.003219828],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003811044,"about_ca_system_score_gemma":0.0004540624,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006599693,"about_ca_topic_score_gemma":0.0007772156,"domain_scores_codex":[0.9998155,0.00002159067,0.000009776933,0.00003435869,0.00007547766,0.00004336884],"domain_scores_gemma":[0.9998373,0.00002148195,0.00001832769,0.00002531453,0.0000832717,0.00001420166],"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.00127016,0.0002857512,0.003876427,0.00061598,0.00008931768,0.001047188,0.0001232573,0.02187419,0.2540653,0.01846614,0.03504157,0.6632447],"study_design_scores_gemma":[0.000486031,0.003019881,0.01221611,0.0001587356,0.0001960565,0.00540272,0.0001199301,0.2098185,0.5485399,0.003944559,0.2159805,0.0001171424],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3030868,0.004081736,0.5550134,0.000532906,0.0006282545,0.000698745,0.0007850973,0.02338353,0.1117895],"genre_scores_gemma":[0.8122935,0.0007428177,0.1517172,0.0002289437,0.0001130948,0.0001921766,0.001002143,0.0001623339,0.03354799],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009544823,"threshold_uncertainty_score":0.03193063,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2085540322","doi":"10.1109/tvlsi.2011.2158595","title":"Efficient FPGA Implementations of Point Multiplication on Binary Edwards and Generalized Hessian Curves Using Gaussian Normal Basis","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Division of Electrical, Communications and Cyber Systems; CMC Microsystems","keywords":"Elliptic curve cryptography; Hessian matrix; Lookup table; Elliptic curve point multiplication; Multiplication (music); Elliptic curve; Binary number; Edwards curve; Mathematics; Computer science; Parallel computing; Arithmetic; Algorithm; Applied mathematics; Combinatorics; Schoof's algorithm; Pure mathematics; Encryption; Public-key cryptography","authors":[{"name":"Reza Azarderakhsh","is_ca":true},{"name":"Arash Reyhani-Masoleh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02770676403880055,"gpt":0.2670120190335478,"spread":0.2393052549947472,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001515862,0.0003807124,0.0002672531,0.0004564638,0.0001996111,0.0004506396,0.0004809978,0.0002123532,0.003682333],"category_scores_gemma":[0.000573422,0.0001369359,0.0001541135,0.0005901867,0.000209294,0.0007528896,0.0002678329,0.000270707,0.0008641462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004439866,"about_ca_system_score_gemma":0.0004378849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007886693,"about_ca_topic_score_gemma":0.001632308,"domain_scores_codex":[0.9998282,0.00002593415,0.00001291109,0.00002153266,0.00008092608,0.00003051744],"domain_scores_gemma":[0.9998341,0.00004741782,0.00001966738,0.00003927488,0.00004840024,0.00001116786],"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.0009510251,0.0001754793,0.003106891,0.0004005417,0.00006401757,0.0007206777,0.0002860757,0.07211883,0.2306629,0.06630924,0.006720813,0.6184835],"study_design_scores_gemma":[0.0003918415,0.001411338,0.004988076,0.0001158048,0.00007269258,0.001354725,0.0002070104,0.5224419,0.4002458,0.023262,0.04541594,0.00009275665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.565865,0.0009941229,0.403677,0.0002814175,0.0001162594,0.0001774221,0.0002670699,0.003540626,0.02508107],"genre_scores_gemma":[0.7965165,0.0004419083,0.1967576,0.00004711783,0.00002594315,0.00006324152,0.0003376413,0.00007517253,0.005734964],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003682333,"threshold_uncertainty_score":0.01231867,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2122183684","doi":"10.1109/tc.2007.70815","title":"Fast and Flexible Elliptic Curve Point Arithmetic over Prime Fields","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"SIMD; Atomicity; Multiplication (music); Computer science; Elliptic curve cryptography; Elliptic curve; Parallel computing; Elliptic curve point multiplication; Curve25519; Multiprocessing; Prime (order theory); Arithmetic; Mathematics; Public-key cryptography; Pure mathematics","authors":[{"name":"Patrick Longa","is_ca":true},{"name":"Ali Miri","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01401900193872338,"gpt":0.2205330533353361,"spread":0.2065140513966127,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005455209,0.000441574,0.0003965391,0.0007422662,0.0004328235,0.0007736621,0.0009175452,0.0003086698,0.002736304],"category_scores_gemma":[0.00159781,0.0002992986,0.0003913243,0.0007904152,0.0007512132,0.001807361,0.0009738309,0.0009170334,0.0009227449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003338824,"about_ca_system_score_gemma":0.000746663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003095082,"about_ca_topic_score_gemma":0.0005390325,"domain_scores_codex":[0.9994704,0.00006420677,0.00003712581,0.00006474034,0.0003025825,0.00006084229],"domain_scores_gemma":[0.9989939,0.0001656744,0.0001145007,0.0005095126,0.0001829091,0.00003352566],"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.0004448717,0.0001921524,0.002213364,0.0002451961,0.00005570753,0.0004211227,0.000333739,0.03659771,0.186519,0.2353884,0.004281995,0.5333067],"study_design_scores_gemma":[0.0002834945,0.001360462,0.001656402,0.0001045084,0.0001293309,0.00177117,0.0001234851,0.4574528,0.3585407,0.1161295,0.06235344,0.0000947704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07674944,0.0003046785,0.9125775,0.0001544764,0.00007704587,0.00009933633,0.00003302893,0.0020183,0.007986135],"genre_scores_gemma":[0.4447327,0.0003418299,0.5498755,0.00006540302,0.00009458396,0.00009058056,0.0001113273,0.0001626194,0.004525512],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002736304,"threshold_uncertainty_score":0.009153843,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136484227","doi":"10.1109/tc.2009.70","title":"Bit-Serial and Bit-Parallel Montgomery Multiplication and Squaring over GF(2^m)","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Trinomial; Finite field; Multiplication (music); Arithmetic; Cryptosystem; Mathematics; GF(2); Binary number; Cryptography; XOR gate; Normal basis; Computer science; Discrete mathematics; Galois theory; Algorithm; Logic gate; Combinatorics","authors":[{"name":"Arash Hariri","is_ca":true},{"name":"Arash Reyhani-Masoleh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009825076464437171,"gpt":0.224169664099868,"spread":0.2143445876354309,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002267083,0.0004858488,0.0002730047,0.0005206492,0.0003764206,0.0006515628,0.0003517946,0.0003506889,0.004322414],"category_scores_gemma":[0.0009801049,0.0001716254,0.0004180434,0.0005347662,0.0004974609,0.001348077,0.0004468978,0.0004456991,0.001229452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002837851,"about_ca_system_score_gemma":0.0004015622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002210226,"about_ca_topic_score_gemma":0.0006771546,"domain_scores_codex":[0.9998436,0.00002366033,0.00001394561,0.00003671272,0.00005414892,0.00002793711],"domain_scores_gemma":[0.9997303,0.00006755377,0.00006605626,0.00007275043,0.0000460016,0.00001731962],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006067932,0.0002057149,0.00254994,0.0004210912,0.00006688268,0.0006851602,0.0003578501,0.03076221,0.1471895,0.3043801,0.002409819,0.5103651],"study_design_scores_gemma":[0.0001887988,0.002157576,0.004292361,0.0001939809,0.0001566829,0.006439457,0.000386654,0.2399347,0.4169302,0.2378485,0.09132409,0.0001470055],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2902211,0.001516659,0.6609023,0.0003674858,0.0001586617,0.0001883928,0.0001113756,0.0007518203,0.045782],"genre_scores_gemma":[0.7361231,0.001263514,0.2437452,0.0001536546,0.0001203211,0.00009373853,0.0002378186,0.00007773703,0.01818494],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004322414,"threshold_uncertainty_score":0.01445991,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1798342512","doi":"10.1007/3-540-47555-9_14","title":"Public-Key Cryptosystems with Very Small Key Lengths","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":72,"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":"Cryptosystem; Key (lock); Public-key cryptography; Hybrid cryptosystem; Key size; Computer science; Public key cryptosystem; Computer security; Cryptography; Elliptic curve cryptography; Encryption","authors":[{"name":"Greg Harper","is_ca":true},{"name":"Alfred Menezes","is_ca":true},{"name":"Scott A. Vanstone","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03096137160042576,"gpt":0.2275835416561387,"spread":0.1966221700557129,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00117556,0.001069178,0.0007612986,0.001010141,0.0007415671,0.001867705,0.001062638,0.001174932,0.008767046],"category_scores_gemma":[0.005126479,0.0007567338,0.0005055105,0.001236807,0.002127425,0.008144607,0.002108845,0.003171483,0.00569884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007565115,"about_ca_system_score_gemma":0.0006097322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003712661,"about_ca_topic_score_gemma":0.00006551816,"domain_scores_codex":[0.9986066,0.0002682365,0.00009838466,0.0001663445,0.0007384588,0.000122034],"domain_scores_gemma":[0.9968065,0.001813579,0.0002015277,0.0008495614,0.0002292417,0.00009957574],"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.0003805762,0.00007329952,0.0001254182,0.0005753359,0.00003783211,0.000103919,0.0001949181,0.005017143,0.03832883,0.7921217,0.008871463,0.1541695],"study_design_scores_gemma":[0.0001486299,0.0002068012,0.0001816067,0.0001286579,0.00005850616,0.0006588771,0.0000349249,0.01642624,0.0541719,0.835327,0.09259758,0.00005918035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02893396,0.00654197,0.8759085,0.002083089,0.001013977,0.000233289,0.0002336905,0.002148896,0.08290261],"genre_scores_gemma":[0.5615221,0.009596285,0.3378825,0.001027395,0.001639986,0.0007450436,0.0005162981,0.00108964,0.08598085],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008767046,"threshold_uncertainty_score":0.02932864,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129089669","doi":"10.1016/j.jsc.2011.09.003","title":"Genus 2 point counting over prime fields","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Genus; Prime (order theory); Jacobian matrix and determinant; Twists of curves; Computation; Prime number; Twist; Discrete mathematics; Combinatorics; Elliptic curve; Algorithm; Schoof's algorithm; Pure mathematics; Applied mathematics; Geometry","authors":[{"name":"Pierrick Gaudry","is_ca":false},{"name":"Éric Schost","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01778078805688415,"gpt":0.2393396749367503,"spread":0.2215588868798661,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001165275,0.001167235,0.001246022,0.005858652,0.002455081,0.004166416,0.001229473,0.001545662,0.007772913],"category_scores_gemma":[0.005973327,0.00052684,0.0007494825,0.003978583,0.003885719,0.00572118,0.002400195,0.002172561,0.001138239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001741994,"about_ca_system_score_gemma":0.000677052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007535298,"about_ca_topic_score_gemma":0.0009413317,"domain_scores_codex":[0.9989962,0.0002233374,0.00005666651,0.0001428337,0.0003743437,0.0002066376],"domain_scores_gemma":[0.9976352,0.001088808,0.0002982513,0.0004429156,0.0003229638,0.0002117027],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001862896,0.00004087338,0.002768056,0.0001139922,0.00001974535,0.000326136,0.000578841,0.004766689,0.002433659,0.9519575,0.005603972,0.03120422],"study_design_scores_gemma":[0.00001404442,0.00002662418,0.0008895466,0.0000412365,0.00002893698,0.0003407092,0.00009231425,0.01223498,0.002234659,0.9786112,0.005461985,0.00002382483],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.6828666,0.002914603,0.1540996,0.003985941,0.0008538221,0.00009406578,0.0003913594,0.001591866,0.1532021],"genre_scores_gemma":[0.9637616,0.0008423715,0.01536575,0.0001759312,0.0004657471,0.00004740135,0.0001772874,0.0002187821,0.01894514],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.007772913,"threshold_uncertainty_score":0.026003,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2539629874","doi":"10.1007/978-3-319-48965-0_6","title":"NEON-SIDH: Efficient Implementation of Supersingular Isogeny Diffie-Hellman Key Exchange Protocol on ARM","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":71,"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":"Isogeny; Computer science; Cryptosystem; Speedup; Key exchange; Parallel computing; Supersingular elliptic curve; Affine transformation; Cryptography; Arithmetic; Encryption; Public-key cryptography; Mathematics; Algorithm; Elliptic curve; Operating system","authors":[{"name":"Brian Koziel","is_ca":false},{"name":"Amir Jalali","is_ca":false},{"name":"Reza Azarderakhsh","is_ca":false},{"name":"David Jao","is_ca":true},{"name":"Mehran Mozaffari Kermani","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01393316525482611,"gpt":0.2700190224437448,"spread":0.2560858571889186,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007353864,0.0004880076,0.0008681299,0.0006641428,0.0007385158,0.001469178,0.001572089,0.0007000807,0.009999579],"category_scores_gemma":[0.001204545,0.0003776125,0.0004408783,0.0006176617,0.000428352,0.002307311,0.002686142,0.001241838,0.00315718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007066948,"about_ca_system_score_gemma":0.001110233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004178966,"about_ca_topic_score_gemma":0.000654333,"domain_scores_codex":[0.9991398,0.0001706781,0.00007307031,0.0001186563,0.0002790449,0.0002187965],"domain_scores_gemma":[0.9995551,0.00007095385,0.00003542863,0.0002287301,0.00007666594,0.00003323558],"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.003768952,0.0004913675,0.002409227,0.0009072167,0.0001783035,0.0009834863,0.0006929174,0.01459984,0.1188839,0.205849,0.07045411,0.5807816],"study_design_scores_gemma":[0.000642166,0.001148054,0.003219291,0.0002877685,0.0002682643,0.001705007,0.0003253086,0.3887522,0.2374535,0.1543376,0.211594,0.0002669123],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1076463,0.001584543,0.8045402,0.0008465577,0.0005525021,0.0007241955,0.001422134,0.03243186,0.05025172],"genre_scores_gemma":[0.7179876,0.0004762562,0.2474865,0.0004276186,0.0001056303,0.0005198109,0.002271848,0.0009410378,0.0297837],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009999579,"threshold_uncertainty_score":0.03345191,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144693841","doi":"10.1109/tc.2008.126","title":"The Mixed-Radix Chinese Remainder Theorem and Its Applications to Residue Comparison","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Modulo; Chinese remainder theorem; Residue number system; Binary number; Mathematics; Modulo operation; Moduli; Arithmetic; Comparator; Adder; Residue (chemistry); Remainder; Discrete mathematics; Algorithm; Computer science; Voltage; Physics; Telecommunications","authors":[{"name":"Shaoqiang Bi","is_ca":false},{"name":"Warren J. Gross","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01577423187320397,"gpt":0.2544011287992291,"spread":0.2386268969260251,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001729671,0.0007491466,0.0008013407,0.001661258,0.0004366702,0.001520487,0.0009662718,0.0007699875,0.002322328],"category_scores_gemma":[0.005616289,0.0003472377,0.0006778082,0.002061132,0.001373258,0.002282914,0.0008360508,0.00115146,0.0009379748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007813546,"about_ca_system_score_gemma":0.000738808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005033299,"about_ca_topic_score_gemma":0.0004396409,"domain_scores_codex":[0.9983437,0.0003634951,0.0001757456,0.0002849114,0.0007579726,0.0000740598],"domain_scores_gemma":[0.9981839,0.000894386,0.0002116023,0.000287177,0.0003934299,0.00002957702],"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.0003604712,0.0000325205,0.0006921354,0.0004956219,0.0000699328,0.0005402537,0.0002271775,0.04589698,0.02576135,0.4834809,0.003183606,0.4392589],"study_design_scores_gemma":[0.0001510323,0.0007685772,0.001342503,0.0002346963,0.0001353213,0.004275906,0.00009005184,0.4936421,0.09838284,0.2875708,0.1131883,0.0002178908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00843509,0.007282693,0.970426,0.0003067259,0.0003870927,0.00005993205,0.00004989154,0.0004485655,0.01260405],"genre_scores_gemma":[0.249767,0.008035736,0.7342513,0.0003262682,0.0007278493,0.0001252849,0.0001279659,0.0001478147,0.006490716],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002322328,"threshold_uncertainty_score":0.009147465,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065654144","doi":"10.1016/j.jalgor.2005.01.009","title":"Refinements of Miller's algorithm for computing the Weil/Tate pairing","year":2005,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computation; Cryptography; Algorithm; Hamming weight; Integer (computer science); Hamming distance; Computer science; Field (mathematics); Binary number; Finite field; Pairing; Elliptic curve; Mathematics; Theoretical computer science; Discrete mathematics; Hamming code; Arithmetic; Programming language; Pure mathematics","authors":[{"name":"Ian F. Blake","is_ca":true},{"name":"V. Kumar Murty","is_ca":true},{"name":"Guangwu Xu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01407102858777722,"gpt":0.2615776276533546,"spread":0.2475065990655774,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00375286,0.001578177,0.002223795,0.003630513,0.001879457,0.003362714,0.002846544,0.001624477,0.01273923],"category_scores_gemma":[0.01571329,0.0007577405,0.002168798,0.003379958,0.002644253,0.006381255,0.004349663,0.004540048,0.005561013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001512472,"about_ca_system_score_gemma":0.001998162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00154086,"about_ca_topic_score_gemma":0.002356606,"domain_scores_codex":[0.995695,0.001031544,0.0003632959,0.000592078,0.001899675,0.0004182639],"domain_scores_gemma":[0.9942761,0.00137338,0.0002339111,0.002954194,0.0009463387,0.0002161734],"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.001019463,0.0002788323,0.001762325,0.0002116494,0.0001158435,0.0002245884,0.0003678067,0.01439493,0.009986611,0.6749668,0.01610069,0.2805706],"study_design_scores_gemma":[0.0002153522,0.0003072233,0.0009094361,0.00009509721,0.000120309,0.0005547003,0.0001292656,0.1158389,0.01444912,0.8296537,0.0375972,0.0001297255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04692411,0.001005678,0.9171271,0.001350104,0.001145499,0.0003448282,0.0004153988,0.003380086,0.02830726],"genre_scores_gemma":[0.2841229,0.0008120961,0.6891396,0.0005969867,0.0009347067,0.0004278864,0.0009327449,0.001103691,0.02192947],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01273923,"threshold_uncertainty_score":0.0426169,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061405134","doi":"10.1090/s0025-5718-07-02048-0","title":"The double-base number system and its application to elliptic curve cryptography","year":2007,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; University of Calgary","keywords":"Scalar multiplication; Mathematics; Elliptic curve; Elliptic curve cryptography; Elliptic curve point multiplication; Side channel attack; Edwards curve; Multiplication (music); Cryptography; Scalar (mathematics); Schoof's algorithm; Base (topology); Binary number; Point (geometry); Arithmetic; Algorithm; Pure mathematics; Combinatorics; Computer science; Public-key cryptography; Mathematical analysis; Encryption; Quarter period; Geometry","authors":[{"name":"Vassil S. Dimitrov","is_ca":true},{"name":"Laurent Imbert","is_ca":true},{"name":"Pradeep Kumar Mishra","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01174996913210005,"gpt":0.2629183333873865,"spread":0.2511683642552864,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008398123,0.0008981468,0.0006411074,0.001437505,0.001010806,0.002864428,0.001030988,0.000933252,0.008409549],"category_scores_gemma":[0.003337626,0.0004463362,0.0006029015,0.001913525,0.001569113,0.003708355,0.002505434,0.002327521,0.006100088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008812236,"about_ca_system_score_gemma":0.0008614254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004451482,"about_ca_topic_score_gemma":0.000360843,"domain_scores_codex":[0.9989573,0.0001884364,0.00009224343,0.0002184942,0.0004295465,0.0001139375],"domain_scores_gemma":[0.9993076,0.0001529911,0.0000601278,0.0002605026,0.0001656001,0.00005308385],"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.000162963,0.00003021183,0.0003168685,0.0001681341,0.000009959461,0.0002663802,0.0002081492,0.006129957,0.01359987,0.8469387,0.005864005,0.1263048],"study_design_scores_gemma":[0.00008174356,0.0002018834,0.0003075086,0.0001697132,0.00002842537,0.001614508,0.0001121812,0.09015799,0.04337376,0.6495623,0.2142742,0.0001157879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01379304,0.001081152,0.9528986,0.000429694,0.0005181573,0.0001117032,0.0001541611,0.001304649,0.02970887],"genre_scores_gemma":[0.2509769,0.002083648,0.7195783,0.0003447292,0.0004785552,0.0002763163,0.0004220472,0.0007444428,0.02509503],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008409549,"threshold_uncertainty_score":0.0281328,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070633734","doi":"10.1049/el:20020192","title":"RNS-enabled digital signal processor design","year":2002,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Council","keywords":"Computer science; Reduced instruction set computing; SIMD; Very-large-scale integration; Residue number system; Digital signal; Digital signal processor; Computer architecture; Digital signal processing; Instruction set; Signal processing; Embedded system; Logic synthesis; Computer hardware; Logic gate; Parallel computing","authors":[{"name":"Javier Ramı́rez","is_ca":false},{"name":"Antonio García","is_ca":false},{"name":"Sergio López-Buedo","is_ca":false},{"name":"A. Lloris","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01125234640413127,"gpt":0.1842898343625872,"spread":0.1730374879584559,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000181746,0.0002639194,0.0001981094,0.0002281588,0.0001923975,0.0004372431,0.0005331948,0.0002533935,0.003591561],"category_scores_gemma":[0.0004059068,0.0001100189,0.000162862,0.0001891281,0.000203757,0.0004190099,0.0002224885,0.0002706151,0.001157147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003464319,"about_ca_system_score_gemma":0.0004715543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003047376,"about_ca_topic_score_gemma":0.0005668276,"domain_scores_codex":[0.999818,0.00004555429,0.00001284021,0.00003187492,0.00006908675,0.0000225506],"domain_scores_gemma":[0.9998469,0.00002044161,0.00001565631,0.00003371801,0.00007381856,0.000009506884],"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.0005477929,0.00009423118,0.001094035,0.0004535952,0.0000548839,0.0005668627,0.0001253026,0.09365694,0.3111037,0.1281799,0.007483204,0.4566394],"study_design_scores_gemma":[0.0001420741,0.00105314,0.0008721342,0.00007649691,0.00007516347,0.001306459,0.00005240041,0.6132683,0.2540017,0.02598638,0.1031243,0.00004140729],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.137364,0.001462619,0.7927263,0.0006336634,0.0003407475,0.0002109005,0.0001884177,0.005043256,0.06203014],"genre_scores_gemma":[0.7502295,0.0006740435,0.2340223,0.0002713907,0.00008131401,0.0001234458,0.0002059676,0.00009308119,0.01429891],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003591561,"threshold_uncertainty_score":0.01201499,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1809742378","doi":"10.1023/a:1008312401197","title":"Analysis of the Xedni Calculus Attack","year":2000,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":65,"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":"Mathematics; Elliptic curve; Logarithm; Discrete logarithm; Finite field; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis; Computer science","authors":[{"name":"Michael J. Jacobson","is_ca":true},{"name":"Neal Koblitz","is_ca":true},{"name":"Joseph H. Silverman","is_ca":true},{"name":"Andreas Stein","is_ca":true},{"name":"Edlyn Teske","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01767769015688338,"gpt":0.2412242157429259,"spread":0.2235465255860425,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001339023,0.0008415177,0.0007973299,0.001882213,0.001689018,0.00270753,0.001347245,0.001788658,0.01028638],"category_scores_gemma":[0.005341158,0.0003154847,0.0007681528,0.001356206,0.003361404,0.005382706,0.002050217,0.002656425,0.001041594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002493174,"about_ca_system_score_gemma":0.001382125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00123476,"about_ca_topic_score_gemma":0.0008372719,"domain_scores_codex":[0.9987325,0.0002567523,0.0000300176,0.0001101119,0.000572536,0.0002980817],"domain_scores_gemma":[0.9978743,0.0008647084,0.0002819677,0.0004890646,0.0003236765,0.0001663559],"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.00004974467,0.00001899138,0.0001877897,0.00001772569,0.000005786289,0.00005125472,0.00006252502,0.00680263,0.0006303867,0.9872543,0.0008524789,0.004066352],"study_design_scores_gemma":[0.00001955101,0.00003190801,0.0003405407,0.00002480804,0.00001206573,0.0001380372,0.00006695362,0.1355181,0.001120517,0.8593147,0.003392189,0.00002064157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3393226,0.00253393,0.3446432,0.00560432,0.0004643263,0.0001626628,0.0002079019,0.0004872739,0.3065738],"genre_scores_gemma":[0.9668764,0.0009187754,0.008006113,0.0001914265,0.0002579928,0.00004478819,0.0000690625,0.00006727019,0.02356828],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01028638,"threshold_uncertainty_score":0.03441143,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2106876320","doi":"10.1109/12.956092","title":"Power analysis attacks and algorithmic approaches to their countermeasures for Koblitz curve cryptosystems","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Scalar multiplication; Power analysis; Elliptic curve cryptography; Cryptosystem; Elliptic curve point multiplication; Computer science; Elliptic Curve Digital Signature Algorithm; Elliptic curve; Arithmetic; Cryptography; Side channel attack; Key (lock); Hessian form of an elliptic curve; Scalar (mathematics); Public-key cryptography; Key size; Mathematics; Algorithm; Computer security; Encryption; Pure mathematics","authors":[{"name":"M.A. Hasan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05501079801963862,"gpt":0.241829707477477,"spread":0.1868189094578384,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002123885,0.001714691,0.0008260403,0.00340055,0.0008948044,0.002699553,0.001764853,0.001836364,0.002961084],"category_scores_gemma":[0.01038005,0.0005868893,0.001001464,0.001485485,0.003715545,0.004673486,0.002046277,0.002312852,0.0006965306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009421513,"about_ca_system_score_gemma":0.001002408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001369089,"about_ca_topic_score_gemma":0.0001849034,"domain_scores_codex":[0.9959149,0.001078836,0.0002907957,0.0004536912,0.002020626,0.0002411936],"domain_scores_gemma":[0.9932708,0.003478581,0.001044355,0.001429153,0.000666175,0.0001109736],"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.0004052054,0.0002217761,0.00108414,0.0006634556,0.000171217,0.0003697878,0.0003281168,0.1066036,0.02277677,0.6028388,0.002133877,0.2624032],"study_design_scores_gemma":[0.0001498835,0.0005772892,0.0007653114,0.0002956066,0.0001520372,0.001691133,0.0001550514,0.4966477,0.04958121,0.4311788,0.01866615,0.0001398593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01937513,0.003005296,0.9637799,0.0009383984,0.0002180216,0.0002160701,0.00002474615,0.0004394328,0.01200304],"genre_scores_gemma":[0.6577705,0.005635173,0.3278779,0.0005700734,0.001007892,0.0004877254,0.00008478365,0.0001374907,0.006428414],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00340055,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052917298","doi":"10.1090/s0025-5718-01-01363-1","title":"Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time","year":2001,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Waterloo","keywords":"Mathematics; Logarithm; Genus; Finite field; Combinatorics; Discrete logarithm; Field (mathematics); Binary logarithm; Discrete mathematics; Mathematical analysis; Pure mathematics; Computer science","authors":[{"name":"Andreas Enge","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008492376036877417,"gpt":0.2311297978497164,"spread":0.2226374218128389,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001983917,0.001754545,0.001921485,0.001448494,0.001482052,0.007330658,0.002890481,0.001480197,0.02297007],"category_scores_gemma":[0.01623911,0.0007343027,0.002407079,0.00233162,0.001847872,0.01275353,0.005099511,0.003989005,0.009000111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004040537,"about_ca_system_score_gemma":0.003297976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004148918,"about_ca_topic_score_gemma":0.006655243,"domain_scores_codex":[0.9966096,0.0003791277,0.0002274918,0.0009239771,0.001257836,0.0006020862],"domain_scores_gemma":[0.9924091,0.004167018,0.0004677998,0.001756386,0.0007828803,0.0004168113],"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.002778847,0.0007724381,0.01107681,0.0026465,0.0004339059,0.001422437,0.001749961,0.1229664,0.02603283,0.3286075,0.100524,0.4009884],"study_design_scores_gemma":[0.000390915,0.0001293969,0.001196311,0.00008712283,0.0001355915,0.0004799494,0.0004146174,0.2768881,0.01541627,0.6908712,0.01390599,0.0000845113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2563856,0.002250095,0.6489664,0.0088851,0.0006802136,0.0003780259,0.006153252,0.02652498,0.04977629],"genre_scores_gemma":[0.7539713,0.001033437,0.2114807,0.0009599536,0.0006899275,0.0002131019,0.007507621,0.002746986,0.02139704],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02297007,"threshold_uncertainty_score":0.07684255,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167706997","doi":"10.1109/iwsoc.2004.56","title":"RNS application for digital image processing","year":2004,"lang":"en","type":"article","venue":"IEEE International Workshop on System-on-Chip for Real-Time Applications","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; Western University","funders":"","keywords":"Very-large-scale integration; Computer science; Residue number system; MATLAB; Image processing; Digital image processing; Digital image; Coding (social sciences); Grayscale; Encoder; Binary number; Computer hardware; Binary image; Image (mathematics); Computer vision; Algorithm; Embedded system; Arithmetic; Mathematics","authors":[{"name":"Wei Wang","is_ca":true},{"name":"M. N. S. Swamy","is_ca":true},{"name":"M.O. Ahmad","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01554083003520035,"gpt":0.2918521422020731,"spread":0.2763113121668727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003259134,0.000362856,0.0002590095,0.0005412731,0.0001937953,0.0004598877,0.0003795978,0.0004790401,0.008864846],"category_scores_gemma":[0.000949626,0.0001147396,0.0003149429,0.0005808411,0.0002916811,0.0006186471,0.0004272501,0.0004496717,0.003903051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002781444,"about_ca_system_score_gemma":0.0002558734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003229269,"about_ca_topic_score_gemma":0.0003645162,"domain_scores_codex":[0.9996836,0.00006192848,0.00002334191,0.00004760019,0.0001639141,0.0000196278],"domain_scores_gemma":[0.9996504,0.0001184086,0.00002635957,0.00007938327,0.0001144233,0.00001113126],"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.0002025765,0.00004884716,0.0007763541,0.0007207616,0.00003017712,0.0005911803,0.0001796881,0.01394849,0.1586847,0.05823297,0.007429991,0.7591544],"study_design_scores_gemma":[0.00004744383,0.0006011949,0.00167494,0.0002544515,0.00007840173,0.005013669,0.0001536156,0.250827,0.2886778,0.03926769,0.4133389,0.00006491232],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02615288,0.007044385,0.9118747,0.0007298646,0.0004002243,0.0001102318,0.00009094307,0.00317568,0.05042107],"genre_scores_gemma":[0.4340572,0.009000918,0.5101956,0.0005729193,0.000353648,0.00009091019,0.0002664466,0.0002565664,0.04520575],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008864846,"threshold_uncertainty_score":0.02965587,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078731783","doi":"10.1109/tvlsi.2014.2375640","title":"Scalable Elliptic Curve Cryptosystem FPGA Processor for NIST Prime Curves","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"NIST; Elliptic curve cryptography; Field-programmable gate array; Computer science; Elliptic curve point multiplication; Elliptic curve; Scalability; Parallel computing; Hessian form of an elliptic curve; Scalar multiplication; Schoof's algorithm; Embedded system; Arithmetic; Mathematics; Encryption; Public-key cryptography; Operating system","authors":[{"name":"K.C. Cinnati Loi","is_ca":true},{"name":"Seok‐Bum Ko","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02465452726244105,"gpt":0.2566337248512674,"spread":0.2319791975888263,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001317655,0.000389498,0.0002726283,0.0004534904,0.000282354,0.0003843804,0.000651213,0.0002230579,0.005868475],"category_scores_gemma":[0.0002695547,0.0001247301,0.0001863153,0.000376355,0.0001403332,0.0007171548,0.000318918,0.000379752,0.001408103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000482062,"about_ca_system_score_gemma":0.0007507568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008889557,"about_ca_topic_score_gemma":0.001200672,"domain_scores_codex":[0.9998538,0.0000133093,0.000009880781,0.00002685793,0.00006270035,0.00003331862],"domain_scores_gemma":[0.9999069,0.00001148131,0.00001095371,0.00002146596,0.00003809752,0.00001105776],"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.001195264,0.000243084,0.003124752,0.000507761,0.00008347737,0.001011867,0.0001465927,0.04962638,0.3530123,0.03229473,0.03236487,0.5263889],"study_design_scores_gemma":[0.0004464608,0.001616997,0.005821879,0.0001178689,0.000108417,0.002183025,0.0001184457,0.4722761,0.4095418,0.008214229,0.09945139,0.0001033503],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3526191,0.002551709,0.5689766,0.0006099979,0.0004366973,0.0004862615,0.0006574325,0.01568665,0.05797544],"genre_scores_gemma":[0.8589599,0.0004453443,0.1292929,0.0001587885,0.00007388055,0.0001349557,0.0008081606,0.00009966578,0.01002638],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005868475,"threshold_uncertainty_score":0.01963198,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100201258","doi":"10.1016/j.jnt.2008.11.006","title":"Expander graphs based on GRH with an application to elliptic curve cryptography","year":2009,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":58,"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; National Institute of Standards and Technology; Alfred P. Sloan Foundation; U.S. Department of Commerce; National Science Foundation","keywords":"Mathematics; Expander graph; Cayley graph; Elliptic curve; Logarithm; Riemann hypothesis; Prime (order theory); Eigenvalues and eigenvectors; Graph; Discrete mathematics; Schoof's algorithm; Combinatorics; Pure mathematics; Mathematical analysis; Quarter period","authors":[{"name":"David Jao","is_ca":true},{"name":"Stephen D. Miller","is_ca":false},{"name":"Ramarathnam Venkatesan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006488179172410969,"gpt":0.247618420138361,"spread":0.24113024096595,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005595227,0.0005558883,0.0008724582,0.002589431,0.0009311586,0.001305656,0.0007497501,0.001028164,0.007124754],"category_scores_gemma":[0.002944758,0.0003242392,0.0005689687,0.001957886,0.001752332,0.002544585,0.001675749,0.001651941,0.0009450809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005528145,"about_ca_system_score_gemma":0.0003737547,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004377144,"about_ca_topic_score_gemma":0.000563657,"domain_scores_codex":[0.9996591,0.0001182682,0.00001206297,0.00006130194,0.000104851,0.0000445006],"domain_scores_gemma":[0.9982527,0.0009652718,0.0001812366,0.000260315,0.0001704178,0.0001700889],"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.00007689639,0.0000538612,0.0002757857,0.00004658596,0.000009073419,0.0002530685,0.0002165474,0.01067812,0.003049674,0.942807,0.003061451,0.03947194],"study_design_scores_gemma":[0.00002543675,0.00004828208,0.0003011592,0.00002035845,0.00001817659,0.0003422303,0.0000854097,0.08216343,0.002054499,0.9081973,0.006711558,0.00003211452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2210037,0.001354054,0.6896964,0.002170232,0.0006027982,0.0002019121,0.0002969218,0.001749536,0.08292444],"genre_scores_gemma":[0.8113284,0.001395016,0.1552162,0.0005420362,0.000974738,0.0001439497,0.0002513659,0.0004355645,0.02971273],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007124754,"threshold_uncertainty_score":0.02383465,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1601407566","doi":"10.1007/978-3-540-75496-1_26","title":"Efficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication Using Multibase Number Representation","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":55,"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":"Scalar multiplication; Elliptic curve point multiplication; Scalar (mathematics); Elliptic curve; Elliptic curve cryptography; Mathematics; Multiplication algorithm; Computer science; Algorithm; Arithmetic; Pure mathematics; Public-key cryptography; Geometry","authors":[{"name":"Pradeep Kumar Mishra","is_ca":true},{"name":"Vassil S. Dimitrov","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0299563786403336,"gpt":0.3021222506696207,"spread":0.272165872029287,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009215728,0.001121795,0.001127378,0.00159844,0.0008526024,0.003345051,0.001225739,0.0007142305,0.009765405],"category_scores_gemma":[0.002102721,0.0004204,0.0007278381,0.002168763,0.001203731,0.005270591,0.001858479,0.002133458,0.003713459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008836056,"about_ca_system_score_gemma":0.0004390288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002132555,"about_ca_topic_score_gemma":0.0003764857,"domain_scores_codex":[0.9992987,0.0001557271,0.00006104367,0.00009587896,0.0003015373,0.00008714307],"domain_scores_gemma":[0.9995407,0.0001468051,0.00003284399,0.0001333864,0.0001139122,0.00003240041],"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.00005578924,0.00003308059,0.0001166264,0.00008926146,0.000008297544,0.0000956078,0.0001727397,0.001821766,0.002961885,0.9107211,0.004718667,0.0792051],"study_design_scores_gemma":[0.00002288088,0.00004713794,0.0001057149,0.00004159528,0.00001719476,0.0002729784,0.00007260935,0.01414058,0.005554853,0.9554912,0.02420341,0.00002976482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05581111,0.002942634,0.8418705,0.000820844,0.0009421248,0.0001157827,0.0002745783,0.001159192,0.09606328],"genre_scores_gemma":[0.5832233,0.003510678,0.3603845,0.0005429619,0.0007382943,0.0002435637,0.0006512486,0.001045088,0.0496603],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009765405,"threshold_uncertainty_score":0.03266859,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1853876455","doi":"10.1007/3-540-36400-5_10","title":"Secure Elliptic Curve Implementations: An Analysis of Resistance to Power-Attacks in a DSP Processor","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Computer science; Elliptic curve cryptography; Very long instruction word; Power analysis; Elliptic Curve Digital Signature Algorithm; Embedded system; Cryptography; Wireless; Smart card; Computer hardware; Computer network; Computer security; Encryption; Public-key cryptography; Telecommunications","authors":[{"name":"Catherine H. Gebotys","is_ca":true},{"name":"Robert J. Gebotys","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01361785389862258,"gpt":0.2836948517287285,"spread":0.270076997830106,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001594088,0.0009197491,0.0007002726,0.001691903,0.0005157315,0.001676053,0.0008998489,0.001100777,0.004880369],"category_scores_gemma":[0.01005567,0.0003820649,0.0007328532,0.0009935111,0.001402555,0.003126254,0.00098714,0.001185341,0.0006872087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009276845,"about_ca_system_score_gemma":0.0005680948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000189668,"about_ca_topic_score_gemma":0.0002408184,"domain_scores_codex":[0.9985223,0.0003231037,0.00006695141,0.0001470068,0.0007028198,0.0002378419],"domain_scores_gemma":[0.992214,0.005144728,0.0006225255,0.001376169,0.0005273391,0.0001153198],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.003229684,0.0005464462,0.005124514,0.0004004259,0.0002182755,0.0007609419,0.0005164504,0.442679,0.09441552,0.2513328,0.003654803,0.1971211],"study_design_scores_gemma":[0.00006422884,0.0004238974,0.0006844408,0.00002814875,0.00008927137,0.0004927808,0.0000699626,0.9323825,0.02386093,0.04062456,0.001254442,0.00002487737],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7341684,0.001734536,0.2361211,0.0008823215,0.0000776139,0.0001469012,0.0001130931,0.00119124,0.02556486],"genre_scores_gemma":[0.981079,0.0003869249,0.01476678,0.00004275353,0.00005816481,0.00002360029,0.00005028899,0.00009404462,0.003498446],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004880369,"threshold_uncertainty_score":0.01632649,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080886024","doi":"10.1112/s1461157009000187","title":"The Mordell–Weil sieve: proving non-existence of rational points on curves","year":2010,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sieve (category theory); Rational point; Algebra over a field; Genus; Rational number; Simple (philosophy)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.008561974885662713,"gpt":0.2542585128835853,"spread":0.2456965379979226,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003651841,0.001294342,0.001938335,0.003920618,0.001810597,0.004563093,0.001362573,0.002065077,0.006246185],"category_scores_gemma":[0.01934015,0.0007479478,0.001335147,0.002330988,0.004833682,0.009210292,0.006736778,0.003974321,0.001623236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001107542,"about_ca_system_score_gemma":0.0009257919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003097494,"about_ca_topic_score_gemma":0.0003105246,"domain_scores_codex":[0.9972995,0.0006712695,0.0001731577,0.0003903482,0.0009669973,0.0004988007],"domain_scores_gemma":[0.992282,0.004573136,0.0004852856,0.001698015,0.0005498684,0.0004115997],"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.000428988,0.0001186029,0.008357362,0.0003886237,0.0001540056,0.001489077,0.00116278,0.01604716,0.0145302,0.8738726,0.003012347,0.08043814],"study_design_scores_gemma":[0.00006526733,0.0001410258,0.001318233,0.0001551164,0.00005179997,0.0009936838,0.0004161723,0.05770024,0.04196375,0.8903767,0.006738006,0.00007989623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.531112,0.0009064854,0.4275274,0.002153095,0.0002283526,0.0001080718,0.0002402809,0.001317027,0.03640717],"genre_scores_gemma":[0.9427683,0.0005874952,0.05137276,0.0002361119,0.000187096,0.00005161102,0.0002322309,0.0001832866,0.004381165],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006246185,"threshold_uncertainty_score":0.02089554,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1505980332","doi":"10.1007/978-3-642-15031-9_6","title":"Efficient Techniques for High-Speed Elliptic Curve Cryptography","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":53,"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":"Speedup; Scalar multiplication; Elliptic curve point multiplication; Curve25519; Hyperelliptic curve cryptography; Elliptic curve cryptography; Elliptic Curve Digital Signature Algorithm; Computer science; Elliptic curve; x86; Parallel computing; Tripling-oriented Doche–Icart–Kohel curve; Jacobian matrix and determinant; Hessian form of an elliptic curve; Cryptography; Arithmetic; Algorithm; Mathematics; Public-key cryptography; Applied mathematics; Encryption; Software; Programming language; Pure mathematics; Operating system","authors":[{"name":"Patrick Longa","is_ca":true},{"name":"Catherine H. Gebotys","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009903618559944876,"gpt":0.2346329583487652,"spread":0.2247293397888203,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006776252,0.001975687,0.0008773303,0.00227802,0.001005624,0.00219198,0.001829586,0.001027392,0.01872286],"category_scores_gemma":[0.002277819,0.0009956942,0.0008678416,0.002936296,0.0009606828,0.006450388,0.00229742,0.003064183,0.009783252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007860609,"about_ca_system_score_gemma":0.0005863301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001861514,"about_ca_topic_score_gemma":0.0003877638,"domain_scores_codex":[0.9987701,0.0001743691,0.00006359748,0.0001171232,0.0007603797,0.00011456],"domain_scores_gemma":[0.9991084,0.0002799851,0.00005603019,0.0003592684,0.0001696043,0.00002676782],"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.0002753303,0.0001424351,0.000204096,0.0008275434,0.00008850385,0.0001339704,0.0001967413,0.01231769,0.036065,0.3047616,0.02565078,0.6193362],"study_design_scores_gemma":[0.0002361785,0.0002854834,0.0005557218,0.0003884615,0.0001461219,0.001559175,0.0001322863,0.1031475,0.0855607,0.5431687,0.2647031,0.0001166877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007143899,0.0109659,0.9403958,0.0006553734,0.0005409498,0.0001424084,0.0001443267,0.001874454,0.03813696],"genre_scores_gemma":[0.1495297,0.01684177,0.7714238,0.0003976798,0.001219789,0.0002905467,0.0006687129,0.0008437191,0.05878423],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01872286,"threshold_uncertainty_score":0.06263423,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1963863611","doi":"10.1109/tc.2012.22","title":"Low-Complexity Multiplier Architectures for Single and Hybrid-Double Multiplications in Gaussian Normal Bases","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"CMC Microsystems","keywords":"Exponentiation; Modular exponentiation; Computer science; Multiplier (economics); Multiplication algorithm; Cryptography; Cryptosystem; Multiplication (music); Arithmetic; Finite field; Parallel computing; Public-key cryptography; Algorithm; Encryption; Mathematics; Discrete mathematics; Binary number","authors":[{"name":"Reza Azarderakhsh","is_ca":true},{"name":"Arash Reyhani-Masoleh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03090075671251214,"gpt":0.254870268879105,"spread":0.2239695121665928,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002105748,0.0003007654,0.0002474767,0.0004503744,0.0002689166,0.0005742854,0.0006208183,0.0002701323,0.002712564],"category_scores_gemma":[0.0004529436,0.000142835,0.0002298823,0.0005276888,0.0002433386,0.0008145533,0.0003693908,0.0003933719,0.0008760889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004204868,"about_ca_system_score_gemma":0.0004232544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003483239,"about_ca_topic_score_gemma":0.0007944139,"domain_scores_codex":[0.9998301,0.00002789661,0.00001373703,0.00003083841,0.00007177062,0.00002562008],"domain_scores_gemma":[0.9997804,0.00004435516,0.00002968457,0.00005047815,0.00007761046,0.00001759856],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001188372,0.0002318874,0.001985061,0.0003951352,0.00007751647,0.0004797014,0.0002489765,0.03475417,0.4675456,0.107067,0.00337608,0.3826505],"study_design_scores_gemma":[0.0002674512,0.002185407,0.003315414,0.00008734643,0.0001063948,0.001881909,0.0001322205,0.4333954,0.4809865,0.03718032,0.04034709,0.0001144822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4094509,0.001091616,0.5733317,0.0002087769,0.0001720964,0.000138977,0.0001441042,0.001433078,0.01402879],"genre_scores_gemma":[0.7775819,0.0003301883,0.2147249,0.00006325531,0.00004123964,0.00006912962,0.0001750272,0.00003563147,0.006978739],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002712564,"threshold_uncertainty_score":0.00907445,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094812471","doi":"10.1109/tcsi.2006.883855","title":"Fast Bit Parallel-Shifted Polynomial Basis Multipliers in <formula formulatype=\"inline\"><tex>$GF(2^{n})$</tex></formula>","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Ampere; Mathematics; Polynomial; Physics; Mathematical analysis; Quantum mechanics; Voltage","authors":[{"name":"Haining Fan","is_ca":true},{"name":"M.A. Hasan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02082547069802777,"gpt":0.250921884981296,"spread":0.2300964142832683,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002209305,0.0009238374,0.0003222994,0.0005547173,0.0004096975,0.0006501795,0.001069519,0.0003590281,0.02683656],"category_scores_gemma":[0.0006182645,0.0002873484,0.0003723138,0.0007647634,0.000245541,0.001378249,0.0005856396,0.000831651,0.007264284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006291125,"about_ca_system_score_gemma":0.001086004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007230472,"about_ca_topic_score_gemma":0.002058615,"domain_scores_codex":[0.9998211,0.00002176818,0.00001485514,0.00003997989,0.00007218375,0.00002997658],"domain_scores_gemma":[0.9998173,0.00003657746,0.00003038176,0.00004284069,0.00006008146,0.00001282149],"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.0008543998,0.0002290873,0.0005436578,0.0008071429,0.00006306382,0.0004216306,0.0001560304,0.01344523,0.2228795,0.05716916,0.034271,0.6691601],"study_design_scores_gemma":[0.0005888324,0.00177397,0.001726204,0.0002366759,0.0001352567,0.001913927,0.0001165574,0.2567448,0.4340543,0.02500429,0.2775309,0.0001742347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08463959,0.001921695,0.8616652,0.0005623662,0.0007962854,0.0003987226,0.001076203,0.01184509,0.03709485],"genre_scores_gemma":[0.312185,0.001364869,0.6281468,0.0004535595,0.0002755784,0.0004181236,0.002494246,0.0007396681,0.05392211],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02683656,"threshold_uncertainty_score":0.08977717,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1920416369","doi":"10.1007/11693383_21","title":"Accelerated Verification of ECDSA Signatures","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":49,"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":"Elliptic Curve Digital Signature Algorithm; Computer science; ElGamal encryption; Signature (topology); Digital Signature Algorithm; ElGamal signature scheme; Digital signature; Public-key cryptography; Elliptic curve cryptography; Computer security; Encryption; Mathematics; Blind signature","authors":[{"name":"Adrian Antipa","is_ca":false},{"name":"Daniel R. L. Brown","is_ca":false},{"name":"Robert Gallant","is_ca":false},{"name":"Rob Lambert","is_ca":false},{"name":"René Struik","is_ca":false},{"name":"Scott A. Vanstone","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01479910046521686,"gpt":0.2348103690615239,"spread":0.2200112685963071,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00134178,0.000941298,0.000990264,0.001033568,0.0007068282,0.001869668,0.001302317,0.001058456,0.01267292],"category_scores_gemma":[0.003597414,0.0005039686,0.0008188901,0.0008542801,0.001045721,0.00300528,0.002654816,0.001499018,0.004452736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001095352,"about_ca_system_score_gemma":0.001524505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005570331,"about_ca_topic_score_gemma":0.001014548,"domain_scores_codex":[0.9970907,0.0005970203,0.0001725013,0.0003974981,0.001294388,0.000447827],"domain_scores_gemma":[0.9955765,0.001143005,0.0001878159,0.002021051,0.0009564877,0.000115169],"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.003499862,0.0003082936,0.001841919,0.0005123251,0.0001089696,0.0005591931,0.0003233552,0.04068414,0.1590343,0.2151008,0.02174373,0.5562832],"study_design_scores_gemma":[0.0004642455,0.0006487851,0.001489531,0.0001414083,0.0001091605,0.001213538,0.0001253429,0.3899573,0.345758,0.2029618,0.05703326,0.00009774882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2038174,0.001851507,0.7300204,0.0009028274,0.0009526731,0.0002746882,0.0007387658,0.0139788,0.04746293],"genre_scores_gemma":[0.7871326,0.0003505395,0.1908606,0.0002631732,0.00021307,0.0001003294,0.0007932227,0.0006838582,0.01960252],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01267292,"threshold_uncertainty_score":0.04239517,"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":"W4299660901","doi":"10.1007/978-1-4419-5906-5_245","title":"Elliptic Curve Cryptography","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":48,"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":"Elliptic curve cryptography; Elliptic curve; Cryptography; Computer science; Mathematics; Computer security; Pure mathematics; Public-key cryptography; Encryption","authors":[{"name":"Darrel Hankerson","is_ca":false},{"name":"Alfred Menezes","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02090620744628524,"gpt":0.2027429563935639,"spread":0.1818367489472786,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003745104,0.001314737,0.0007844903,0.001940575,0.001033544,0.002660273,0.0008399516,0.0009729323,0.06095511],"category_scores_gemma":[0.001050923,0.0005559471,0.000344047,0.002580186,0.00118566,0.004124519,0.001651881,0.002638617,0.04907584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001216606,"about_ca_system_score_gemma":0.001146076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003980757,"about_ca_topic_score_gemma":0.0007420927,"domain_scores_codex":[0.999451,0.00006425845,0.00001919815,0.00007589822,0.0003430902,0.00004650157],"domain_scores_gemma":[0.9996612,0.00007688841,0.00001808757,0.00009346291,0.0001185838,0.00003170214],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003193754,0.00008091976,0.0001071215,0.0003678511,0.000009981889,0.00007749288,0.0002664886,0.001284214,0.002267824,0.2360453,0.2302305,0.5292303],"study_design_scores_gemma":[0.000005599612,0.00002331559,0.0001153315,0.0001804003,0.000005622643,0.0002385279,0.00003825534,0.0007466014,0.001196329,0.06030412,0.9371352,0.00001087867],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.001761129,0.02607249,0.04375492,0.001418215,0.002094456,0.00009867114,0.0002012004,0.0006899536,0.9239088],"genre_scores_gemma":[0.01432527,0.01934919,0.0121097,0.0004774884,0.001296385,0.00005445354,0.000384648,0.0002789104,0.9517239],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.06095511,"threshold_uncertainty_score":0.2039151,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3210270412","doi":"","title":"A taxonomy of pairing-friendly elliptic curves","year":2006,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Pairing; Embedding; Elliptic curve; Computer science; Cryptography; Mathematics; Pure mathematics; Theoretical computer science; Physics; Algorithm; Artificial intelligence","authors":[{"name":"David Mandell Freeman","is_ca":false},{"name":"Michael Scott","is_ca":false},{"name":"Edlyn Teske","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01777655156329359,"gpt":0.2360314912774119,"spread":0.2182549397141183,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002568112,0.00152574,0.0009454452,0.005282323,0.003004694,0.004886284,0.001306591,0.002203977,0.003853791],"category_scores_gemma":[0.005663897,0.0006866251,0.001026282,0.005675292,0.003205468,0.009549969,0.004076678,0.003930788,0.002061346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001040968,"about_ca_system_score_gemma":0.001433824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003177589,"about_ca_topic_score_gemma":0.0001843931,"domain_scores_codex":[0.9961137,0.0008180599,0.0005700936,0.0005424143,0.001475055,0.0004806625],"domain_scores_gemma":[0.9967243,0.0006176837,0.0004636946,0.001108037,0.0006612364,0.0004250737],"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.00003127964,0.00004086589,0.001047017,0.0001705264,0.000008179798,0.0002501261,0.0006244062,0.001266,0.001650083,0.9525014,0.002416689,0.03999345],"study_design_scores_gemma":[0.00002382179,0.000225915,0.001152174,0.0004028792,0.00002267609,0.003752233,0.0006283919,0.006530741,0.003278557,0.7166012,0.2672966,0.00008473123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1087596,0.01496509,0.6969701,0.003759781,0.0008579334,0.001138422,0.001377609,0.001862255,0.1703091],"genre_scores_gemma":[0.4575315,0.02582885,0.4811142,0.001106297,0.0009377572,0.000939131,0.002413059,0.0004200799,0.02970909],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005282323,"threshold_uncertainty_score":0.01358163,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162548688","doi":"10.1109/arith.2007.11","title":"Asymmetric Squaring Formulae","year":2007,"lang":"en","type":"article","venue":"Proceedings/Proceedings - Symposium on Computer Arithmetic","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":48,"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":"Pohang University of Science and Technology","keywords":"Pentium; Constant (computer programming); Operand; Mathematics; Division (mathematics); Interpolation (computer graphics); Multiplication (music); Algorithm; Arithmetic; Overhead (engineering); Computer science; Combinatorics; Parallel computing; Artificial intelligence","authors":[{"name":"Jaewook Chung","is_ca":true},{"name":"M.A. Hasan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00907540417949722,"gpt":0.2275200321209442,"spread":0.218444627941447,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006258747,0.0006534813,0.0005685304,0.00118327,0.0007254076,0.001495784,0.001193859,0.0007219524,0.01241523],"category_scores_gemma":[0.003200809,0.0002923183,0.0007679291,0.001425039,0.0007958307,0.00283838,0.001618061,0.001461621,0.003327736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006700621,"about_ca_system_score_gemma":0.0005604535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002972998,"about_ca_topic_score_gemma":0.0006082907,"domain_scores_codex":[0.9990362,0.0001146111,0.00009118648,0.0001378915,0.000492934,0.0001272164],"domain_scores_gemma":[0.9989987,0.000262707,0.0001254042,0.0003052772,0.0002603223,0.00004756898],"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.000222688,0.00007921141,0.0005969866,0.0002830953,0.00003991312,0.0003227404,0.0002479528,0.01076,0.04235686,0.5873148,0.009675511,0.3481002],"study_design_scores_gemma":[0.0001353991,0.0005083444,0.0009663748,0.0001728213,0.000149865,0.002258691,0.0001303687,0.1733181,0.105636,0.5630672,0.1534949,0.000161998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.050341,0.0008433222,0.8895841,0.000390276,0.0004216625,0.0001576113,0.0002299315,0.002037625,0.05599456],"genre_scores_gemma":[0.5160355,0.0009876954,0.4537326,0.0004725768,0.0003983171,0.0001895041,0.0005697661,0.0004937238,0.02712041],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01241523,"threshold_uncertainty_score":0.04153311,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127583645","doi":"10.1109/glsv.1999.757457","title":"A new algorithm for RNS magnitude comparison based on New Chinese Remainder Theorem II","year":2003,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Concordia University","funders":"","keywords":"Chinese remainder theorem; Remainder; Residue number system; Modulo; Modulo operation; Algorithm; Modulus; Computer science; Mathematics; Arithmetic; Discrete mathematics","authors":[{"name":"Yuke Wang","is_ca":true},{"name":"Xiaoyu Song","is_ca":true},{"name":"M. Aboulhamid","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01288153511888522,"gpt":0.267321806846309,"spread":0.2544402717274238,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009642733,0.001036511,0.001218294,0.002538508,0.00094527,0.001790797,0.001746631,0.0007595399,0.00729954],"category_scores_gemma":[0.00260727,0.0004148876,0.0007217547,0.001870485,0.000654078,0.003387345,0.001525394,0.001020106,0.002989914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009016083,"about_ca_system_score_gemma":0.001445069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008008689,"about_ca_topic_score_gemma":0.0008537499,"domain_scores_codex":[0.9983025,0.000185879,0.0002179337,0.00040978,0.0007444725,0.0001394432],"domain_scores_gemma":[0.9989321,0.0001756779,0.0001152972,0.0001995901,0.0005234313,0.00005390118],"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.0006143531,0.00007812192,0.0007457393,0.0003469055,0.00006835027,0.0002380273,0.0002081007,0.008668422,0.06134384,0.05286408,0.01314386,0.8616802],"study_design_scores_gemma":[0.000929614,0.001407492,0.002927447,0.0001777865,0.0002489937,0.004662435,0.0003154172,0.4290248,0.262401,0.08611389,0.2113948,0.0003963419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01059631,0.000619664,0.9801757,0.0002158442,0.000608179,0.0002271716,0.0001367954,0.002306529,0.005113747],"genre_scores_gemma":[0.08578066,0.0004108007,0.9039539,0.0002041249,0.0003178902,0.0002442768,0.0006058025,0.0002740147,0.008208531],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00729954,"threshold_uncertainty_score":0.02441943,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149110203","doi":"10.1109/tc.2009.62","title":"Concurrent Error Detection in Finite-Field Arithmetic Operations Using Pipelined and Systolic Architectures","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing; Finite field; Finite field arithmetic; Arithmetic; Field (mathematics); Algorithm; Mathematics; Cryptography; Discrete mathematics","authors":[{"name":"Siavash Bayat-Sarmadi","is_ca":true},{"name":"M.A. Hasan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0182988739172879,"gpt":0.2632636006046212,"spread":0.2449647266873333,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006537857,0.000413403,0.0003238447,0.0005334706,0.0003077401,0.0005128642,0.0006248698,0.0002642575,0.0008448705],"category_scores_gemma":[0.002347595,0.0002080328,0.0002550329,0.0004617165,0.0005119808,0.001445823,0.0004697519,0.0002828672,0.0001201867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004055458,"about_ca_system_score_gemma":0.0006969008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007614825,"about_ca_topic_score_gemma":0.001493691,"domain_scores_codex":[0.9994368,0.00009987525,0.00004186409,0.00007983141,0.0002723449,0.00006933393],"domain_scores_gemma":[0.9986703,0.000519799,0.0002768238,0.0002352734,0.0002612478,0.00003663714],"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.001890936,0.0002889996,0.01007511,0.0003056359,0.00009040943,0.00108676,0.000476809,0.2568471,0.2841811,0.04667143,0.0008789955,0.3972066],"study_design_scores_gemma":[0.0000600998,0.000649013,0.001315147,0.00002281579,0.00004636669,0.0004268849,0.00009334984,0.8110377,0.1756129,0.008925482,0.001775293,0.00003488785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.642643,0.0003499489,0.3539119,0.0001155883,0.00005495317,0.00004944815,0.0000270844,0.0007562502,0.002091881],"genre_scores_gemma":[0.9327222,0.00009919026,0.0660383,0.00001855096,0.00001701298,0.00001528265,0.00002268145,0.00002351203,0.00104319],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0008448705,"threshold_uncertainty_score":0.003457606,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}