{"meta":{"query_hash":"3ef37ca07c93","filters":{"topic":"Cryptography and Residue Arithmetic"},"cohort_total":438,"direct_labels_cover":0,"predictions_cover":438,"exported":438,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/3ef37ca07c93","api":"https://metacan.xera.ac/api/v1/cohort?topic=Cryptography+and+Residue+Arithmetic"},"results":[{"id":"W100933795","doi":"10.1007/978-3-540-24582-7_24","title":"Counting Points on an Abelian Variety over a Finite Field","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Variety (cybernetics); Abelian group; Finite field; Field (mathematics); Theoretical computer science; Artificial intelligence; Discrete mathematics; Mathematics; Combinatorics; Pure mathematics","score_opus":0.011468665275932778,"score_gpt":0.23642422726870854,"score_spread":0.22495556199277578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W100933795","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023504176,0.00017647877,0.9913718,0.0011163577,0.0018880871,0.00026866986,0.0000046885434,0.0001495414,0.004789298],"genre_scores_gemma":[0.19533557,0.00012612982,0.7599291,0.043228485,0.0008877519,0.000016717731,0.000010667902,0.0000973484,0.0003682215],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959926,0.00006031188,0.00045857244,0.0016809615,0.0010580816,0.00074949744],"domain_scores_gemma":[0.9967523,0.00090551213,0.00024268393,0.001708314,0.0001627297,0.00022844535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000987338,0.0005517858,0.0004516716,0.0009222773,0.000411142,0.0007967502,0.0027995375,0.00042496138,0.000053974254],"category_scores_gemma":[0.0001420697,0.00048451874,0.00018760847,0.00090729684,0.00041816384,0.0006345598,0.0005806829,0.0011198664,0.0000390527],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020881995,0.00019028505,0.0004508077,0.00007928587,0.00004052433,0.0003537076,0.001855437,0.02008317,0.00010760843,0.16414586,0.00024642498,0.81242603],"study_design_scores_gemma":[0.0007702882,0.001287544,0.00083284016,0.00095793523,0.000021942638,0.00010703764,3.7687994e-7,0.461815,0.0021765134,0.516834,0.013302295,0.0018942162],"about_ca_topic_score_codex":0.000040136983,"about_ca_topic_score_gemma":0.00008347735,"teacher_disagreement_score":0.8105318,"about_ca_system_score_codex":0.000108940716,"about_ca_system_score_gemma":0.00026448938,"threshold_uncertainty_score":0.9997606},"labels":[],"label_agreement":null},{"id":"W11189027","doi":"10.1016/s1566-0702(00)00220-4","title":"Low Complexity Finite Field Multiplier for a New Class of Fields","year":2009,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Institute of Mental Health","keywords":"Finite field arithmetic; Finite field; Cryptography; Computer science; Coding theory; Multiplication (music); Arithmetic; Field (mathematics); Mathematics; Theoretical computer science; Algorithm; Discrete mathematics; Pure mathematics","score_opus":0.029514140698381444,"score_gpt":0.2675612368495939,"score_spread":0.23804709615121245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11189027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043782946,0.00003801669,0.98484254,0.005876429,0.00012494165,0.00015539127,0.0000012429176,0.00006111041,0.004522035],"genre_scores_gemma":[0.79448646,0.000005835043,0.2029322,0.0020914364,0.00004406022,0.0000021586657,8.5061e-7,0.0000016823016,0.000435328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993837,0.000011191771,0.0001594763,0.00017975217,0.00010091312,0.00016497198],"domain_scores_gemma":[0.9992055,0.00030567494,0.000042543725,0.0003328178,0.000043739714,0.000069713045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007505641,0.00007548272,0.00012696024,0.00007079919,0.000050208004,0.0000312785,0.00042054354,0.00006986195,0.00003807338],"category_scores_gemma":[0.00004945916,0.000060372724,0.00012641663,0.00021470302,0.00002349808,0.00010702914,0.000046133347,0.00006871292,0.00000386324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048969567,0.00028040554,0.00038583225,0.000044588036,0.00002328491,0.0000035507353,0.0007786421,0.0003318484,0.001023528,0.6251244,0.026783664,0.3451713],"study_design_scores_gemma":[0.0031433732,0.0022783368,0.021132378,0.000087575565,0.000024152865,0.000008912643,0.000055575856,0.2288961,0.123052604,0.6063758,0.01431809,0.00062709657],"about_ca_topic_score_codex":0.000059218586,"about_ca_topic_score_gemma":0.000059145503,"teacher_disagreement_score":0.79010814,"about_ca_system_score_codex":0.0000026522437,"about_ca_system_score_gemma":0.000032222062,"threshold_uncertainty_score":0.24619283},"labels":[],"label_agreement":null},{"id":"W11672901","doi":"10.1007/978-3-0348-7865-4_26","title":"Speeding Up RSA and Elliptic Curve Systems by Choosing Suitable Moduli","year":2004,"lang":"en","type":"book-chapter","venue":"Birkhäuser Basel eBooks","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo; University of Windsor","funders":"","keywords":"Moduli; Operand; Modular equation; Elliptic curve; Modulus; Mathematics; Modular elliptic curve; Subtraction; Cryptosystem; Arithmetic; Modular arithmetic; Modular design; Discrete mathematics; Algebra over a field; Pure mathematics; Algorithm; Computer science; Quarter period; Cryptography; Geometry; Physics; Moduli of algebraic curves; Moduli space; Operating system","score_opus":0.01646597522112286,"score_gpt":0.20491492690494612,"score_spread":0.18844895168382325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11672901","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026626966,0.031326704,0.14694335,0.0002736039,0.0069695823,0.0027395491,0.00021156111,0.0017115175,0.80716145],"genre_scores_gemma":[0.20658772,0.001194062,0.010784327,0.00058795227,0.0012682657,0.00008800357,0.00006210006,0.0004506074,0.778977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968213,0.00004852907,0.0006063244,0.0011641992,0.0006524858,0.00070716324],"domain_scores_gemma":[0.9980016,0.00017495906,0.0003301276,0.000999863,0.00013875256,0.0003546975],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004991946,0.00070442836,0.00070044555,0.0004918521,0.0003984726,0.00083597685,0.0009349067,0.00054861826,0.000028730727],"category_scores_gemma":[0.000011486136,0.0006693502,0.00024773253,0.000075689204,0.00022948807,0.00030122162,0.00044534405,0.00070076314,0.000087490764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017949562,0.000042168802,0.000094397205,0.000742053,0.00033085837,0.00014068866,0.0016882943,0.000116287076,0.0011603114,0.9770259,0.0060649035,0.012576185],"study_design_scores_gemma":[0.006414601,0.0009787105,0.00024037389,0.010980127,0.000975559,0.0010127241,0.00031348996,0.025567027,0.005690512,0.19141327,0.74732065,0.0090929335],"about_ca_topic_score_codex":0.00048703217,"about_ca_topic_score_gemma":0.000023223483,"teacher_disagreement_score":0.78561264,"about_ca_system_score_codex":0.00013336701,"about_ca_system_score_gemma":0.00018336554,"threshold_uncertainty_score":0.9995758},"labels":[],"label_agreement":null},{"id":"W118363595","doi":"10.1007/978-3-642-42001-6_5","title":"Shorter Compact Representations in Real Quadratic Fields","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Logarithm; Quadratic equation; Ideal class group; Computer science; Algebraic number; Representation (politics); Polynomial; Algebra over a field; Class (philosophy); Ideal (ethics); Group (periodic table); Unit (ring theory); Algebraic number field; Theoretical computer science; Discrete mathematics; Mathematics; Pure mathematics; Artificial intelligence; Mathematical analysis","score_opus":0.02024526855554348,"score_gpt":0.2715899130760348,"score_spread":0.2513446445204913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W118363595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064979773,0.00021523563,0.97945136,0.0021511393,0.0010430355,0.00047561564,0.0000027519425,0.00011528801,0.015895754],"genre_scores_gemma":[0.77120364,0.00016861375,0.2259109,0.001390011,0.00037427584,0.00001961178,0.0000070826354,0.00003673831,0.00088915206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673593,0.000057603775,0.0005360923,0.0012860992,0.0007545462,0.0006297234],"domain_scores_gemma":[0.9974396,0.00059347536,0.00018244276,0.0014790668,0.0001337244,0.00017169755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050423853,0.0004244087,0.0004968866,0.0013053033,0.00018443145,0.00060035096,0.002513677,0.00032822063,0.00008776683],"category_scores_gemma":[0.00004543131,0.00036885147,0.00016438644,0.0009715043,0.00058562844,0.0006914367,0.000569669,0.0009164529,0.000075734155],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009040899,0.0001607794,0.0030595616,0.00009637729,0.0000408623,0.00046018048,0.004904102,0.06273317,0.00015906735,0.09943995,0.0006320026,0.8283049],"study_design_scores_gemma":[0.00043943245,0.00021751574,0.015185632,0.00050185184,0.000011799181,0.00009243405,0.0000010484649,0.61109895,0.00038216493,0.37059,0.0004858699,0.000993297],"about_ca_topic_score_codex":0.00040126088,"about_ca_topic_score_gemma":0.00094247644,"teacher_disagreement_score":0.8273116,"about_ca_system_score_codex":0.0001336625,"about_ca_system_score_gemma":0.00031152504,"threshold_uncertainty_score":0.9998763},"labels":[],"label_agreement":null},{"id":"W13911711","doi":"10.1136/bmj.1.5289.1359","title":"Efficient signature system using optimized elliptic curve cryptosystem over GF(2(n)).","year":2004,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Elliptic Curve Digital Signature Algorithm; Elliptic curve; Signature (topology); Computer science; Cryptosystem; Mathematics; Elliptic curve cryptography; Computer security; Algorithm; Cryptography; Public-key cryptography; Encryption; Mathematical analysis; Geometry","score_opus":0.009843764588983268,"score_gpt":0.2248616728817397,"score_spread":0.21501790829275644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W13911711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16923323,0.00078168337,0.8262022,0.00011619635,0.0009828659,0.0003926139,0.0000022597292,0.00053912745,0.0017498],"genre_scores_gemma":[0.83932966,0.0000033240656,0.16041818,0.0000977339,0.000085450716,0.000009442409,9.1320544e-7,0.000016636439,0.00003864803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775815,0.00011640561,0.00041290166,0.0006226544,0.00055739924,0.00053247757],"domain_scores_gemma":[0.99863714,0.00008919292,0.00014336064,0.00081415393,0.00011769647,0.0001984787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003959203,0.00028693702,0.00035343232,0.00029685957,0.00029081613,0.00029267385,0.0008678762,0.0001787154,0.000019794405],"category_scores_gemma":[0.000013802351,0.00021877508,0.0002623141,0.0011001935,0.00006236062,0.00016277666,0.00023963166,0.00025145893,0.00007080208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015812022,0.00015796929,0.00010569533,0.00017128872,0.00007344922,0.00013268317,0.000540356,0.64482015,0.0031798587,0.3505028,0.000054597298,0.00024534814],"study_design_scores_gemma":[0.0029069372,0.00010409181,0.0005098603,0.00050527055,0.000056141314,0.00026504876,0.00032728718,0.98678833,0.0068216603,0.00082693103,0.00019097212,0.0006974454],"about_ca_topic_score_codex":0.00013229703,"about_ca_topic_score_gemma":0.000004448354,"teacher_disagreement_score":0.6700964,"about_ca_system_score_codex":0.00019474888,"about_ca_system_score_gemma":0.00012954166,"threshold_uncertainty_score":0.89213884},"labels":[],"label_agreement":null},{"id":"W147270326","doi":"10.1007/978-3-642-29656-7_10","title":"On Countermeasures Against Fault Attacks on Elliptic Curve Cryptography Using Fault Detection","year":2012,"lang":"en","type":"book-chapter","venue":"Information security and cryptography","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Elliptic curve cryptography; Elliptic curve; Cryptography; Computer science; Redundancy (engineering); Elliptic Curve Digital Signature Algorithm; Curve25519; Countermeasure; Algorithm; Mathematics; Computer security; Public-key cryptography; Engineering; Pure mathematics; Encryption","score_opus":0.014210728970402054,"score_gpt":0.22635915565167586,"score_spread":0.21214842668127382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W147270326","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05351651,0.008544157,0.439054,0.0004453812,0.006198207,0.004280816,0.0006918995,0.0023338813,0.48493513],"genre_scores_gemma":[0.9885149,0.004306161,0.0031154556,0.003152638,0.00046749334,0.00006981452,0.00020112708,0.00009529831,0.000077106764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960998,0.00010306336,0.0010422714,0.0006658318,0.0013470302,0.00074198],"domain_scores_gemma":[0.9969527,0.00025067644,0.0008920278,0.0010541226,0.0004397929,0.00041064844],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062124815,0.0009620549,0.0006902141,0.002909633,0.00084141333,0.00088074035,0.00079901837,0.00081282685,0.000050310282],"category_scores_gemma":[0.0000329895,0.00090762746,0.00082770304,0.0006821864,0.0004368293,0.002488231,0.00019662896,0.001343694,0.00016249009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017703522,0.00018797573,0.00011403931,0.00049738545,0.00049811247,0.000015376268,0.0038349957,0.00048912934,0.000060453985,0.90030384,0.0006393864,0.093182296],"study_design_scores_gemma":[0.0046827416,0.0023913598,0.0019056648,0.00401087,0.0006297984,0.00027881228,0.00054948404,0.024209095,0.0016584613,0.43705204,0.5161036,0.0065280613],"about_ca_topic_score_codex":0.000026312424,"about_ca_topic_score_gemma":0.000021161857,"teacher_disagreement_score":0.9349984,"about_ca_system_score_codex":0.00007217441,"about_ca_system_score_gemma":0.000063075204,"threshold_uncertainty_score":0.99933743},"labels":[],"label_agreement":null},{"id":"W1481980077","doi":"10.1109/icassp.1982.1171387","title":"Quantization error and limit cycles analysis in residue number system coded recursive filters","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Quantization (signal processing); Residue number system; Scaling; Dynamic range; Residue (chemistry); Digital filter; Mathematics; Computer science; Algorithm; Control theory (sociology); Arithmetic; Filter (signal processing); Artificial intelligence","score_opus":0.0120692033496,"score_gpt":0.25252714633208806,"score_spread":0.24045794298248807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481980077","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6043513,0.00020451972,0.38787818,0.0026854733,0.00008538482,0.00019480569,0.0000029508158,0.0001853643,0.004412053],"genre_scores_gemma":[0.9488408,0.000034927256,0.05088143,0.00010874603,0.000024730425,0.0000072533053,0.0000035632568,0.0000042624933,0.00009429992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989434,0.00010408441,0.00023748275,0.00034734936,0.00017210384,0.00019558264],"domain_scores_gemma":[0.9993987,0.000104027145,0.000068423964,0.00031328478,0.000046626756,0.00006893151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022699354,0.00010761855,0.00019492136,0.0004046048,0.00008172329,0.000116989766,0.00026064386,0.00006505185,0.00001693891],"category_scores_gemma":[0.000016680327,0.00009088399,0.00007865577,0.0017529437,0.000044464563,0.00034086817,0.00008046376,0.000073835494,0.00002276511],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004153065,0.00017254434,0.4121125,0.000103835286,0.0005017399,0.00006449088,0.0053227255,0.014574661,0.00039655512,0.54093224,0.00097102346,0.024806138],"study_design_scores_gemma":[0.0008634743,0.000044946602,0.47981125,0.000100029785,0.00017934683,0.000034803437,0.0012458811,0.5126013,0.0029403372,0.0012903509,0.00041124385,0.00047699458],"about_ca_topic_score_codex":0.0003028627,"about_ca_topic_score_gemma":0.0018423394,"teacher_disagreement_score":0.53964186,"about_ca_system_score_codex":0.000030655243,"about_ca_system_score_gemma":0.000015600115,"threshold_uncertainty_score":0.37061414},"labels":[],"label_agreement":null},{"id":"W1489735952","doi":"10.1109/glsv.1998.665221","title":"Residue to binary number converters for (2/sup n/-1, 2/sup n/, 2/sup n/+1)","year":2002,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Concordia University","funders":"","keywords":"Adder; Converters; Binary number; Residue (chemistry); Residue number system; 8-bit; Arithmetic; Computer science; Computer hardware; Voltage; Mathematics; Chemistry; Electrical engineering; Engineering; Telecommunications","score_opus":0.01845919495413627,"score_gpt":0.23981657753812946,"score_spread":0.22135738258399318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489735952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10319546,0.00033806436,0.8372554,0.019208051,0.0008416452,0.0017299124,0.00002688828,0.0011420503,0.036262482],"genre_scores_gemma":[0.7835682,0.000058667574,0.19889307,0.006454684,0.00022670634,0.00016955729,0.00000611155,0.0000449156,0.01057809],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774945,0.000072346316,0.00036176384,0.00076098903,0.00035559337,0.00069986813],"domain_scores_gemma":[0.99822307,0.00028526265,0.000053497664,0.000961749,0.00011899415,0.00035742755],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025754335,0.00028555558,0.0002965791,0.00026411528,0.000293971,0.00023635387,0.0012085222,0.00013378765,0.0008204625],"category_scores_gemma":[0.000049961567,0.00024450436,0.0002611287,0.0009822932,0.000093671624,0.00047871663,0.0003051707,0.0001542457,0.001305813],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006988022,0.00061476376,0.0054830112,0.00012517223,0.00019040461,0.00013134447,0.0069103646,0.0022107312,0.0007534714,0.14160292,0.7794045,0.06250342],"study_design_scores_gemma":[0.0035522738,0.0011023727,0.0046429415,0.00013803046,0.00007237819,0.00022374443,0.0007190542,0.6507848,0.0048607513,0.014624007,0.31725806,0.0020215672],"about_ca_topic_score_codex":0.000078208475,"about_ca_topic_score_gemma":0.000010184043,"teacher_disagreement_score":0.6803727,"about_ca_system_score_codex":0.000033797656,"about_ca_system_score_gemma":0.00002614487,"threshold_uncertainty_score":0.9994718},"labels":[],"label_agreement":null},{"id":"W1490460472","doi":"10.1007/978-3-540-69499-1_9","title":"Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Polynomial basis; Finite field; Multiplication (music); Multiplier (economics); Basis (linear algebra); Computer science; Arithmetic; Polynomial; Normal basis; Binary number; Numerical digit; Finite field arithmetic; Computation; Mathematics; Algorithm; Discrete mathematics; Combinatorics; Galois theory","score_opus":0.016925235766146494,"score_gpt":0.2441798441510097,"score_spread":0.22725460838486322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490460472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019201445,0.00079214486,0.991793,0.0014809027,0.0029096683,0.0008259175,0.0000133967005,0.00012762053,0.00013721306],"genre_scores_gemma":[0.6780988,0.00041717722,0.3164722,0.0026200819,0.0021296188,0.00005778092,0.000019102865,0.000055099426,0.00013012801],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970197,0.00002950417,0.00043693263,0.0012999519,0.000679885,0.00053398847],"domain_scores_gemma":[0.9967227,0.0012200049,0.00025273397,0.0014942975,0.00019469453,0.00011558152],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032715322,0.00045148729,0.0003720987,0.0005489938,0.0007209265,0.00044908674,0.0027354497,0.00042147547,0.000012256767],"category_scores_gemma":[0.00010993232,0.00031189603,0.00027773756,0.0005323311,0.00077655417,0.0004286373,0.00085041765,0.0005815723,0.0000044571825],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007482582,0.00004169007,0.00007211947,0.00003229689,0.000033917833,0.000031748787,0.0010827002,0.024405567,0.0005109951,0.0050599896,0.0007603461,0.9678938],"study_design_scores_gemma":[0.0015028048,0.00058604236,0.014835399,0.0002579938,0.000047248694,0.00015984617,5.23555e-7,0.8653375,0.005807882,0.0984847,0.011558439,0.001421638],"about_ca_topic_score_codex":0.00006315476,"about_ca_topic_score_gemma":0.000080747835,"teacher_disagreement_score":0.96647215,"about_ca_system_score_codex":0.00009005006,"about_ca_system_score_gemma":0.00030661057,"threshold_uncertainty_score":0.9999333},"labels":[],"label_agreement":null},{"id":"W1491384312","doi":"10.1007/11599555_65","title":"Integer Factorization by a Parallel GNFS Algorithm for Public Key Cryptosystems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Cryptosystem; Computer science; Integer factorization; Public-key cryptography; Speedup; Algorithm; Integer (computer science); Factorization; Encryption; Factoring; Factor (programming language); Key (lock); Theoretical computer science; Cryptography; Parallel computing; Computer network","score_opus":0.01616948550478784,"score_gpt":0.23353859449138292,"score_spread":0.2173691089865951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491384312","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000051039924,0.0013865164,0.9928044,0.0014171597,0.0023008322,0.00089766306,0.000034618904,0.00024667944,0.000906995],"genre_scores_gemma":[0.024559218,0.00013659106,0.9723022,0.0011779029,0.0011068891,0.00007482373,0.000052433064,0.00006478979,0.00052516186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553037,0.0000471503,0.0006949727,0.0017624628,0.0010392859,0.0009257585],"domain_scores_gemma":[0.9971097,0.00052695884,0.00038914185,0.0012432204,0.00045089386,0.0002800471],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008103309,0.00065334956,0.00062871195,0.0011284074,0.00040823693,0.0012053056,0.0034226452,0.00051673315,0.000019098334],"category_scores_gemma":[0.00007810328,0.0005685919,0.0002828742,0.0009280734,0.0005221345,0.0010154286,0.0007034608,0.0006713371,0.000026007301],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002524607,0.000053700016,0.000021839778,0.000038086717,0.000025993715,0.000009252905,0.0004918191,0.0020683596,0.00008058747,0.03999585,0.00026269836,0.9569493],"study_design_scores_gemma":[0.00062747777,0.00027434417,0.000023986631,0.00027004955,0.000013744054,0.00005437455,4.2341162e-7,0.83191156,0.00046141588,0.10532038,0.059991032,0.0010512283],"about_ca_topic_score_codex":0.0000223323,"about_ca_topic_score_gemma":0.000054537028,"teacher_disagreement_score":0.95589805,"about_ca_system_score_codex":0.00027323345,"about_ca_system_score_gemma":0.00047087835,"threshold_uncertainty_score":0.99983156},"labels":[],"label_agreement":null},{"id":"W1493210595","doi":"10.1007/3-540-45067-x_8","title":"Generic GF(2m) Arithmetic in Software and Its Application to ECC","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Elliptic curve cryptography; Arithmetic; Operand; Context (archaeology); Multiplication (music); Elliptic curve; Cryptosystem; Field (mathematics); Public-key cryptography; Binary number; Elliptic curve point multiplication; Cryptography; Theoretical computer science; Algorithm; Computer hardware; Operating system; Encryption; Mathematics","score_opus":0.011341873299499731,"score_gpt":0.226159055574021,"score_spread":0.21481718227452126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493210595","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006122766,0.0018151175,0.99492776,0.0009768807,0.0005766442,0.0006586914,0.000003047277,0.00009876415,0.00033082024],"genre_scores_gemma":[0.17821717,0.00022866664,0.8164368,0.0046533444,0.00021281271,0.00006483488,0.000003936683,0.00004747655,0.00013492296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965862,0.00004245533,0.00044412,0.0016550613,0.00065729616,0.00061485876],"domain_scores_gemma":[0.9982058,0.00027784007,0.00014755067,0.0009855402,0.00014616747,0.00023711755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006411831,0.00045223665,0.00045144375,0.0015089624,0.00019082264,0.00032707368,0.0018962856,0.00028721945,0.000004906184],"category_scores_gemma":[0.00008548823,0.0004243695,0.00008061717,0.0016680235,0.00026784086,0.00032855655,0.00087160093,0.00058297504,0.00002829808],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003692875,0.000044855304,0.0003791106,0.00007065364,0.0000072192893,0.000068700276,0.0006660073,0.0282893,0.00024200324,0.015720071,0.00001579514,0.95449257],"study_design_scores_gemma":[0.0009003416,0.0005144479,0.006687648,0.00081805344,0.000024035045,0.00033736666,5.7623504e-7,0.58265334,0.0037445407,0.39343864,0.00838553,0.0024954507],"about_ca_topic_score_codex":0.000022841245,"about_ca_topic_score_gemma":0.00013744479,"teacher_disagreement_score":0.95199716,"about_ca_system_score_codex":0.00014763334,"about_ca_system_score_gemma":0.00019472525,"threshold_uncertainty_score":0.9998208},"labels":[],"label_agreement":null},{"id":"W1499669544","doi":"10.1109/mwscas.1997.662165","title":"Eisenstein residue number system with applications to DSP","year":2002,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Residue number system; Digital signal processing; Computer science; Arithmetic; Radix (gastropod); Eisenstein integer; Quadratic equation; Residue (chemistry); Theoretical computer science; Mathematics; Algorithm; Computer hardware","score_opus":0.012128659861604092,"score_gpt":0.21606893800214352,"score_spread":0.20394027814053944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499669544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024487567,0.00004308206,0.8606578,0.0015503175,0.00004151075,0.0003267802,9.433372e-7,0.0003822901,0.13454852],"genre_scores_gemma":[0.8550269,0.0000030858814,0.14219877,0.0003218082,0.000047391317,0.000109104665,3.224644e-7,0.0000074170525,0.00228521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910057,0.00002623207,0.00012920203,0.00032250176,0.00020502562,0.00021649738],"domain_scores_gemma":[0.9990616,0.00004160705,0.00002687391,0.0006642974,0.000059314356,0.00014630417],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007196406,0.00009867675,0.00010212582,0.00008708203,0.00014883751,0.00011629261,0.0004887329,0.000034290602,0.00006659272],"category_scores_gemma":[0.0000020078,0.00006998764,0.00003853114,0.0009472004,0.000028234574,0.00012947006,0.000088801375,0.00006321803,0.0013593434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022969823,0.00007792636,0.0017821415,0.00003175809,0.000021721118,0.000025022075,0.00035535445,0.00016649443,0.00012278593,0.97494,0.007815787,0.014658693],"study_design_scores_gemma":[0.0056387987,0.0014320862,0.06374392,0.00090301427,0.00017543827,0.0036096289,0.0031001898,0.18982048,0.030991092,0.008151405,0.6866522,0.0057817763],"about_ca_topic_score_codex":0.00007491519,"about_ca_topic_score_gemma":0.000069147165,"teacher_disagreement_score":0.9667886,"about_ca_system_score_codex":0.000017819222,"about_ca_system_score_gemma":0.000008486971,"threshold_uncertainty_score":0.9994182},"labels":[],"label_agreement":null},{"id":"W1500494440","doi":"10.1007/11958239_9","title":"Scalar Multiplication on Koblitz Curves Using Double Bases","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"","keywords":"Scalar multiplication; Mathematics; Scalar (mathematics); Arithmetic; Pure mathematics; Geometry","score_opus":0.023985346609428474,"score_gpt":0.2582738852571701,"score_spread":0.23428853864774163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500494440","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028890558,0.0015100013,0.9928524,0.00083855604,0.00091947446,0.0004827668,0.0000054714315,0.00018641625,0.00291603],"genre_scores_gemma":[0.25685385,0.00032297228,0.7363779,0.004952108,0.0009764458,0.000026379246,0.000026406899,0.000083308914,0.00038063416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963186,0.00003426338,0.00047319615,0.0015651587,0.0010251175,0.0005837111],"domain_scores_gemma":[0.9974027,0.0003905796,0.00027428172,0.0015760356,0.00021860571,0.00013776604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006305216,0.0004907715,0.00043039434,0.0011271308,0.0003651202,0.00044221373,0.0024665992,0.00026242,0.00001129415],"category_scores_gemma":[0.00003301335,0.00042973054,0.00019185827,0.0010253772,0.00063798646,0.0005235577,0.00066998956,0.0006167878,0.000027888189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029759289,0.00028301362,0.0004936849,0.0003696296,0.00003411042,0.00015862017,0.00033651208,0.27362007,0.0010654145,0.06598781,0.00043437025,0.657187],"study_design_scores_gemma":[0.0008045524,0.00026792506,0.0011061742,0.00313529,0.000027703201,0.00010264535,9.051784e-8,0.89115745,0.00838672,0.0902541,0.0033605562,0.0013967992],"about_ca_topic_score_codex":0.00012996806,"about_ca_topic_score_gemma":0.000054284632,"teacher_disagreement_score":0.6557902,"about_ca_system_score_codex":0.00017837255,"about_ca_system_score_gemma":0.00029556497,"threshold_uncertainty_score":0.99981546},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009903618559944876,"score_gpt":0.23463295834876519,"score_spread":0.22472933978882031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505980332","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035123728,0.00054414995,0.99310607,0.00072394084,0.0026892645,0.0011980368,0.00001559354,0.0004576345,0.00091407466],"genre_scores_gemma":[0.09715607,0.000046921683,0.90121555,0.0007861299,0.0006400695,0.000037535545,0.000007775753,0.0000561412,0.000053788597],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951945,0.000034562323,0.0006724452,0.0020410588,0.0010565105,0.0010009309],"domain_scores_gemma":[0.9961051,0.000829021,0.00037626264,0.001971464,0.00045919113,0.00025895686],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012164558,0.0007492652,0.00071528973,0.0021727993,0.0005371975,0.0007056806,0.00428911,0.0006842269,0.000017328552],"category_scores_gemma":[0.00008765931,0.00064555666,0.00042679146,0.001302444,0.0015156075,0.0002164753,0.0010274403,0.0012933115,0.000019417672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020463649,0.00016393271,0.000058040925,0.00014411447,0.000045495006,0.00006447111,0.0006784984,0.008913463,0.004007761,0.3519542,0.00003099784,0.6339186],"study_design_scores_gemma":[0.00055206346,0.00062200666,0.00023404218,0.0005395666,0.000038046073,0.0000808934,1.8951512e-7,0.21782413,0.034457367,0.7395291,0.0044748504,0.0016477696],"about_ca_topic_score_codex":0.00002736635,"about_ca_topic_score_gemma":0.000049625727,"teacher_disagreement_score":0.6322708,"about_ca_system_score_codex":0.00010127214,"about_ca_system_score_gemma":0.0003717601,"threshold_uncertainty_score":0.9995996},"labels":[],"label_agreement":null},{"id":"W1511491629","doi":"10.1049/iet-cdt.2010.0021","title":"Bit-serial and digit-serial GF(2 <sup> <i>m</i> </sup> ) Montgomery multipliers using linear feedback shift registers","year":2011,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Trinomial; GF(2); Arithmetic; Shift register; Multiplication (music); Computer science; Finite field; Parallel computing; Binary number; Numerical digit; Block (permutation group theory); Mathematics; Discrete mathematics; Chip; Combinatorics","score_opus":0.02419302560343754,"score_gpt":0.22997076009410644,"score_spread":0.2057777344906689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511491629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42410868,0.00019166953,0.5682952,0.00025486934,0.00090941385,0.00090317754,0.000051847226,0.00224214,0.0030430488],"genre_scores_gemma":[0.725804,0.000054686076,0.27324253,0.00040999148,0.00037004615,0.00002400186,0.000014940603,0.000056481607,0.000023340486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970067,0.00007494197,0.0006416775,0.0010614767,0.00044159807,0.0007735918],"domain_scores_gemma":[0.9981539,0.00013816537,0.00025080933,0.0009852224,0.00010154676,0.0003703559],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00022390002,0.00057070324,0.00055635336,0.00045677973,0.00028824518,0.0011010374,0.0013879137,0.0002789278,0.000003648205],"category_scores_gemma":[0.00003296052,0.00054134143,0.0003104537,0.00071992143,0.0005756825,0.0026074192,0.0010877226,0.00033708688,0.000010977197],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016698869,0.0027689703,0.020586932,0.0006126011,0.0012011752,0.0014471846,0.03155824,0.0011624362,0.005422465,0.030278224,0.017323466,0.8859684],"study_design_scores_gemma":[0.018321047,0.01132731,0.018536242,0.0045065773,0.00063851406,0.0038457273,0.0019933688,0.43993834,0.2234354,0.15092702,0.106508106,0.020022335],"about_ca_topic_score_codex":0.00017237259,"about_ca_topic_score_gemma":0.0000051195548,"teacher_disagreement_score":0.86594605,"about_ca_system_score_codex":0.000058841684,"about_ca_system_score_gemma":0.000084513704,"threshold_uncertainty_score":0.9999359},"labels":[],"label_agreement":null},{"id":"W1519142934","doi":"10.1109/wsc.2000.899780","title":"Fast combined multiple recursive generators with multipliers of the form a=±2/sup q/±2/sup r/","year":2002,"lang":"en","type":"article","venue":"2000 Winter Simulation Conference Proceedings (Cat. No.00CH37165)","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Tehran University of Medical Sciences and Health Services","keywords":"Modulo; Generator (circuit theory); Prime (order theory); Modular design; Multiplication (music); Random number generation; Arithmetic; Reduction (mathematics); Component (thermodynamics); Algorithm; Computer science; Mathematics; Discrete mathematics; Power (physics); Combinatorics; Physics","score_opus":0.015814405911877737,"score_gpt":0.20947262193742267,"score_spread":0.19365821602554492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519142934","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9276321,0.000024004554,0.06674284,0.000724876,0.0003485573,0.0011383331,0.000020190477,0.0002473678,0.0031217658],"genre_scores_gemma":[0.96572596,0.000020853971,0.03319261,0.00035768485,0.00010970912,0.00005335481,0.000006445894,0.00003602022,0.0004973502],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709636,0.00004242063,0.00065718463,0.00083676435,0.00073508424,0.00063217024],"domain_scores_gemma":[0.99713993,0.00018681162,0.0005021734,0.00060803245,0.001348943,0.00021410259],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023573896,0.00047972365,0.00044872757,0.00034024054,0.00040024676,0.0003654675,0.0016154106,0.00021011203,0.00014442782],"category_scores_gemma":[0.00017986966,0.00034218817,0.00024334819,0.0012388095,0.00038474952,0.0012243501,0.0003455698,0.00029031988,0.00008275571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011428089,0.0027613803,0.6093341,0.00061887316,0.0012987392,0.000019986323,0.13491328,0.10661035,0.022606308,0.035353478,0.00861538,0.07672529],"study_design_scores_gemma":[0.0019371314,0.00037697755,0.009757208,0.00021150468,0.000044942506,0.000009996499,0.00053846143,0.98107404,0.0043037073,0.00087252987,0.0003676444,0.0005058799],"about_ca_topic_score_codex":0.000038279537,"about_ca_topic_score_gemma":0.00001293418,"teacher_disagreement_score":0.8744637,"about_ca_system_score_codex":0.00011486081,"about_ca_system_score_gemma":0.00010766203,"threshold_uncertainty_score":0.999903},"labels":[],"label_agreement":null},{"id":"W1521374744","doi":"10.1007/3-540-46885-4_72","title":"A Fast Elliptic Curve Cryptosystem","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Exponentiation; Cryptosystem; Very-large-scale integration; Multiplier (economics); Cryptography; Computer science; Modular exponentiation; Arithmetic; Elliptic curve cryptography; Embedded system; Parallel computing; Computer hardware; Encryption; Mathematics; Algorithm; Public-key cryptography; Computer network","score_opus":0.017826534189639434,"score_gpt":0.24424299836398206,"score_spread":0.22641646417434264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521374744","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008929172,0.0014130187,0.98436975,0.00032449627,0.0025126515,0.0004484568,0.0000039082106,0.00026922615,0.010569207],"genre_scores_gemma":[0.18169077,0.00015529411,0.8139795,0.002010132,0.0013249918,0.000015686126,0.0000064270444,0.000092466325,0.00072472036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994872,0.000045745324,0.0007181685,0.0018794504,0.0014329504,0.0010517089],"domain_scores_gemma":[0.9965433,0.00059188483,0.0003349861,0.0019326821,0.00028864396,0.0003085024],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014059505,0.00068517396,0.00066898664,0.0018890912,0.000352975,0.00072536856,0.004411341,0.00048544933,0.000028237946],"category_scores_gemma":[0.000053002732,0.0005966079,0.0002932484,0.0014525867,0.0009137656,0.0005441223,0.0013408068,0.0011244926,0.00015680805],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007221076,0.00005479311,0.00015848757,0.00011475883,0.000029483683,0.00045213755,0.0010428432,0.00947016,0.00010293907,0.15054098,0.000025433295,0.8380008],"study_design_scores_gemma":[0.0010183078,0.00068456365,0.0009418506,0.0022220572,0.00004387834,0.0008175452,0.0000010694357,0.5412822,0.0030978357,0.43614882,0.010546429,0.0031954446],"about_ca_topic_score_codex":0.00002710037,"about_ca_topic_score_gemma":0.00011761218,"teacher_disagreement_score":0.8348053,"about_ca_system_score_codex":0.00023881726,"about_ca_system_score_gemma":0.00046070592,"threshold_uncertainty_score":0.9996485},"labels":[],"label_agreement":null},{"id":"W1525019419","doi":"10.1007/978-3-642-04159-4_23","title":"Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Trinomial; Computer science; Multiplication (music); Arithmetic; GF(2); Polynomial; Discrete mathematics; Parallel computing; Mathematics; Finite field; Combinatorics","score_opus":0.013453789454613254,"score_gpt":0.2494412450916692,"score_spread":0.23598745563705595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525019419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02211358,0.00070765347,0.9752646,0.00027537887,0.00073971704,0.000390345,0.0000025724005,0.00012958993,0.00037653375],"genre_scores_gemma":[0.7061418,0.000054931108,0.29251367,0.0006214331,0.000597759,0.0000035106768,0.0000024123374,0.000024142375,0.00004030611],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970201,0.00003839819,0.00047588657,0.0013393593,0.0005945282,0.0005317227],"domain_scores_gemma":[0.9980986,0.00040478967,0.00025935975,0.00096564216,0.000092477574,0.00017913105],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051546894,0.0004988131,0.00048665007,0.0009948425,0.0003846088,0.0006113213,0.0013697121,0.0002818411,0.000006311392],"category_scores_gemma":[0.000070358175,0.00043162293,0.00013818564,0.0006702046,0.0005407545,0.0006615753,0.00067793037,0.00056097895,0.0000031309348],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020207604,0.000050865303,0.0010340831,0.00005466508,0.000015643165,0.00009288901,0.00079743733,0.018654432,0.0023507462,0.0028489486,0.0000053248373,0.9740748],"study_design_scores_gemma":[0.000752723,0.0001578096,0.012040903,0.00035996776,0.000018305462,0.00023051586,1.7799861e-7,0.9462305,0.0007687565,0.0383001,0.00023922054,0.00090105704],"about_ca_topic_score_codex":0.000061839775,"about_ca_topic_score_gemma":0.0000839549,"teacher_disagreement_score":0.9731737,"about_ca_system_score_codex":0.00016367274,"about_ca_system_score_gemma":0.00028705708,"threshold_uncertainty_score":0.99981356},"labels":[],"label_agreement":null},{"id":"W1527584030","doi":"10.1109/iscas.2006.1692640","title":"A FPGA Implementation of an Elliptic Curve Cryptosystem","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Cryptosystem; Hybrid cryptosystem; Computer science; Curve25519; Elliptic curve cryptography; Elliptic curve point multiplication; Field-programmable gate array; Elliptic curve; Arithmetic; Key (lock); Public-key cryptography; Cryptography; Parallel computing; Mathematics; Algorithm; Encryption; Embedded system; Computer security; Pure mathematics","score_opus":0.007387802073879539,"score_gpt":0.25313385967943713,"score_spread":0.2457460576055576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527584030","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5680966,0.0000734007,0.4287314,0.00011936015,0.000105400046,0.00013876439,0.0000016993979,0.00009816038,0.0026352054],"genre_scores_gemma":[0.96516794,0.0000018495971,0.03472173,0.000026561434,0.00003213899,0.000006054471,0.0000033070844,0.0000031707223,0.000037239868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99923503,0.000050473485,0.00021875063,0.00017763335,0.0001751063,0.00014299415],"domain_scores_gemma":[0.9995145,0.00002687241,0.000071165014,0.00030133885,0.00005245276,0.000033633343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015843373,0.00006669877,0.00009132994,0.000118336764,0.000047426627,0.000051236926,0.0003091023,0.000024372011,0.00004121652],"category_scores_gemma":[0.0000010736125,0.000054068754,0.000053880543,0.0003695832,0.000021226246,0.00031298428,0.00004380761,0.000029285306,0.000011339446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040235154,0.00023651034,0.014497539,0.000068499336,0.00002605484,0.000011949128,0.0006194695,0.00024613866,0.00964465,0.9004852,0.0005879896,0.07357194],"study_design_scores_gemma":[0.0019711438,0.00077133154,0.43800494,0.000040968338,0.00003508902,0.000060549686,0.0012945668,0.025025912,0.45936123,0.07063197,0.0021669853,0.0006352965],"about_ca_topic_score_codex":0.0010108575,"about_ca_topic_score_gemma":0.00041523058,"teacher_disagreement_score":0.82985324,"about_ca_system_score_codex":0.000007652032,"about_ca_system_score_gemma":0.000024524223,"threshold_uncertainty_score":0.22048599},"labels":[],"label_agreement":null},{"id":"W1528972180","doi":"10.1109/ccece.1995.528116","title":"Double-basis inversion in GF(2/sup m/)","year":2002,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"GF(2); Finite field; Computer science; Cryptosystem; Computation; Galois theory; Normal basis; Inversion (geology); Multiplication (music); Theoretical computer science; Algorithm; Arithmetic; Mathematics; Cryptography; Discrete mathematics; Combinatorics","score_opus":0.023250740361961026,"score_gpt":0.21279795369617047,"score_spread":0.18954721333420943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528972180","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6856333,0.0009098039,0.119050816,0.011564311,0.00053196464,0.00036615683,5.778729e-7,0.0005491972,0.18139385],"genre_scores_gemma":[0.98041236,0.00006830562,0.018227816,0.00048885023,0.00001730749,0.0000042360766,2.2717002e-7,0.0000029158027,0.0007779965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993202,0.000021520287,0.00011024424,0.00021603191,0.00014611128,0.00018590162],"domain_scores_gemma":[0.9995773,0.000033046283,0.00001636078,0.00030123896,0.000014415022,0.000057638485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008946335,0.00006854244,0.00007465905,0.00021886159,0.000052538115,0.000060626724,0.00041953838,0.000043978114,0.00025577238],"category_scores_gemma":[0.0000033056933,0.00005524167,0.00005181659,0.0007827846,0.00002746804,0.00027003526,0.000120182725,0.00008446136,0.00025446474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029295928,0.0009011301,0.06341131,0.000051782354,0.00003755829,0.00024187684,0.0065359995,0.0009997262,0.0011145673,0.51543325,0.044016287,0.3672272],"study_design_scores_gemma":[0.009391356,0.00039338405,0.04012575,0.00012249686,0.000015966643,0.00006787936,0.00039561425,0.8350035,0.030258924,0.022669049,0.06017836,0.0013777227],"about_ca_topic_score_codex":0.00013472384,"about_ca_topic_score_gemma":0.00004666524,"teacher_disagreement_score":0.83400375,"about_ca_system_score_codex":0.000012613869,"about_ca_system_score_gemma":0.0000046346295,"threshold_uncertainty_score":0.32707143},"labels":[],"label_agreement":null},{"id":"W1529567625","doi":"10.1007/978-3-642-04159-4_2","title":"Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hyperelliptic curve cryptography; Elliptic curve; Pairing; Supersingular elliptic curve; Computation; Homogeneous coordinates; Mathematics; Finite field; Hyperelliptic curve; Edwards curve; Cryptography; Prime (order theory); Genus; Context (archaeology); Schoof's algorithm; Pure mathematics; Computer science; Discrete mathematics; Algorithm; Elliptic curve cryptography; Combinatorics; Public-key cryptography; Quarter period","score_opus":0.013301836878603621,"score_gpt":0.24651526017122735,"score_spread":0.23321342329262373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529567625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011789856,0.0015522568,0.9912937,0.0010817623,0.0008525066,0.0009996746,0.0000027439753,0.00017285174,0.002865484],"genre_scores_gemma":[0.8314157,0.00015866135,0.16539805,0.0026006831,0.00025915404,0.00003465166,0.000007185063,0.000041346757,0.000084543986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99615717,0.000076265365,0.000528537,0.0015871056,0.0009737362,0.00067716726],"domain_scores_gemma":[0.99807084,0.0006119549,0.00026054168,0.0007427372,0.00019337871,0.000120545796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009697002,0.0005296432,0.00054077856,0.0018634826,0.00022135636,0.00030242302,0.0018050639,0.00024303589,0.0000034469556],"category_scores_gemma":[0.00008498563,0.00047016193,0.000155552,0.0014863998,0.00047147178,0.00019355076,0.00050904346,0.00093422463,0.000019754512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007437322,0.000089043984,0.00008044739,0.00006569246,0.0000064869223,0.00013310208,0.0006751964,0.3269126,0.000019904799,0.006130096,0.000011381517,0.6658686],"study_design_scores_gemma":[0.00047610147,0.00054000114,0.0037757566,0.0032081637,0.000008188659,0.00005935189,4.7111348e-7,0.9102591,0.0006551402,0.07999921,0.0001804593,0.00083801],"about_ca_topic_score_codex":0.000039190483,"about_ca_topic_score_gemma":0.00007129143,"teacher_disagreement_score":0.83023673,"about_ca_system_score_codex":0.00031899285,"about_ca_system_score_gemma":0.0003207748,"threshold_uncertainty_score":0.999775},"labels":[],"label_agreement":null},{"id":"W1535504912","doi":"10.1007/978-3-540-30574-3_25","title":"New Minimal Weight Representations for Left-to-Right Window Methods","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer (computer science); Mathematics; Window (computing); Arithmetic; Elliptic curve; Combinatorics; Discrete mathematics; Representation (politics); Elliptic curve cryptography; Point (geometry); Radix (gastropod); Simple (philosophy); Computer science; Pure mathematics; Geometry; Public-key cryptography; Encryption","score_opus":0.018566890992097556,"score_gpt":0.31059878868942725,"score_spread":0.2920318976973297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535504912","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007334907,0.00073169504,0.98676604,0.0050774375,0.002576116,0.0008707902,0.00000872304,0.00017759604,0.0037842407],"genre_scores_gemma":[0.0012514105,0.000028755074,0.99374646,0.0017862979,0.001243235,0.00001824548,0.0000051999814,0.000037312897,0.0018830863],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956662,0.00006247599,0.0006369615,0.0020017852,0.00078947644,0.00084310415],"domain_scores_gemma":[0.9959859,0.0013469938,0.00023945367,0.0017138575,0.00026464625,0.00044915313],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009938461,0.0005710598,0.00060070725,0.0015508702,0.0005159432,0.00065461977,0.00391912,0.00034130522,0.000074909374],"category_scores_gemma":[0.00014071395,0.0004983521,0.00034515958,0.0009792756,0.00045581974,0.00060678757,0.0010871239,0.0005981371,0.000040709692],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010097147,0.000025509173,0.000029578187,0.000019879562,0.000023855964,0.000023702656,0.0008970932,0.007730802,0.00044763536,0.05374952,0.00041177362,0.93663055],"study_design_scores_gemma":[0.0012494548,0.0006483115,0.0010986874,0.00051566685,0.00006861078,0.00026657435,5.1971614e-7,0.17720032,0.024140792,0.690677,0.10196539,0.0021686964],"about_ca_topic_score_codex":0.0000308716,"about_ca_topic_score_gemma":0.00014831315,"teacher_disagreement_score":0.93446183,"about_ca_system_score_codex":0.00015037286,"about_ca_system_score_gemma":0.00072930445,"threshold_uncertainty_score":0.9997468},"labels":[],"label_agreement":null},{"id":"W1554799384","doi":"10.26421/qic5.6-6","title":"Optimized quantum implementation of elliptic curve arithmetic over binary fields","year":2005,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Qubit; Quantum computer; Elliptic curve; Discrete logarithm; Cryptosystem; Mathematics; Realization (probability); Elliptic curve point multiplication; Quantum algorithm; Schoof's algorithm; Elliptic curve cryptography; Finite field; Discrete mathematics; Field (mathematics); Algorithm; Quantum; Arithmetic; Cryptography; Computer science; Public-key cryptography; Pure mathematics; Encryption; Quantum mechanics; Physics","score_opus":0.010816864080518932,"score_gpt":0.27422330407311585,"score_spread":0.26340643999259694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554799384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31046018,0.00010890056,0.68831295,0.0005879084,0.00013958251,0.00017932754,0.0000032623873,0.00006951923,0.00013836965],"genre_scores_gemma":[0.96618587,0.00010718941,0.033310793,0.00031465213,0.000023742576,0.000011624634,0.00003940222,0.0000035535825,0.000003147104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998819,0.00006201694,0.00054854655,0.00013427826,0.00027102893,0.0001651322],"domain_scores_gemma":[0.99926627,0.00009378349,0.00028868936,0.00015675917,0.00013153041,0.00006295854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028384704,0.00012561491,0.00015999506,0.00035680487,0.00012474635,0.00014277578,0.00017373283,0.00006771128,0.00002585158],"category_scores_gemma":[0.000011561532,0.00011733343,0.000066869434,0.00043199706,0.000045488643,0.0019975181,0.000069152906,0.00009480219,0.000020917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005783994,0.00014898184,0.0011352737,0.0002119005,0.000072738214,0.0000016456208,0.00982245,0.0913156,0.00017304791,0.43380472,0.0011305969,0.4621252],"study_design_scores_gemma":[0.001148445,0.0001857211,0.024707245,0.000019997511,0.000013281384,0.00001053647,0.00044985718,0.96699774,0.00042271143,0.0052081347,0.00068068894,0.00015560954],"about_ca_topic_score_codex":0.00007665422,"about_ca_topic_score_gemma":0.0000054006364,"teacher_disagreement_score":0.8756822,"about_ca_system_score_codex":0.000019352608,"about_ca_system_score_gemma":0.000049159335,"threshold_uncertainty_score":0.47847185},"labels":[],"label_agreement":null},{"id":"W1556186246","doi":"10.1007/3-540-45537-x","title":"Selected Areas in Cryptography: 8th Annual International Workshop, SAC 2001 Toronto, Ontario, Canada, August 16-17, 2001. Revised Papers","year":2001,"lang":"en","type":"book","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Scalar multiplication; Cryptanalysis; Key size; Public-key cryptography; Linear cryptanalysis; Cryptography; Exponentiation; Elliptic curve cryptography; Discrete mathematics; Arithmetic; Elliptic curve; Computer science; Encryption; Algorithm; Pure mathematics","score_opus":0.008200144232156628,"score_gpt":0.21332449392381275,"score_spread":0.20512434969165613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556186246","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001749778,0.0016945868,0.0065664435,0.00091872236,0.0018803922,0.0007810498,0.00009628926,0.00030705263,0.9875805],"genre_scores_gemma":[0.0008551257,0.001282248,0.011157974,0.0021629499,0.00057484757,0.000080278034,0.0006334335,0.0000875471,0.9831656],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.994687,0.00013391732,0.0009839336,0.0014659693,0.0013951936,0.0013339506],"domain_scores_gemma":[0.9970842,0.00028903678,0.00039235235,0.0011496957,0.0005158632,0.0005688527],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040876807,0.00089069246,0.0008874308,0.00065528793,0.00019765874,0.00031631693,0.00284472,0.00064735697,0.016403157],"category_scores_gemma":[0.00006720274,0.0008536761,0.00040548487,0.0011364848,0.00015345727,0.0006695928,0.00043405758,0.0012098907,0.000012948166],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.00004821543,0.00015416963,0.005148697,0.000022788334,0.00032219235,0.00036460574,0.00027014394,0.00006418864,0.0000033625388,0.003851604,0.9813321,0.008417923],"study_design_scores_gemma":[0.0011211993,0.00008789791,0.024205321,0.00046189333,0.00006011312,0.00008950103,0.00012572891,0.00026768076,0.0000038623307,0.0013961827,0.9708985,0.0012820947],"about_ca_topic_score_codex":0.94055635,"about_ca_topic_score_gemma":0.9992801,"teacher_disagreement_score":0.058723755,"about_ca_system_score_codex":0.0044743633,"about_ca_system_score_gemma":0.007426302,"threshold_uncertainty_score":0.9993914},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023630739395868256,"score_gpt":0.252383862852978,"score_spread":0.2287531234571097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557014463","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038426195,0.0025177817,0.984196,0.003865708,0.0015945772,0.0004027288,0.000001785227,0.00018919856,0.007193763],"genre_scores_gemma":[0.11441366,0.00045358352,0.8548449,0.027733091,0.001743613,0.000015062692,0.000007474117,0.00010204302,0.00068652397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954154,0.000051517913,0.0004928197,0.0014706753,0.0016635143,0.0009061026],"domain_scores_gemma":[0.99597347,0.0012249048,0.0002651177,0.0020750975,0.0001740971,0.00028733804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014606065,0.0005957481,0.0004436449,0.0012393899,0.00047595202,0.0009591915,0.00494657,0.0002931794,0.00006905277],"category_scores_gemma":[0.00014404482,0.00041005702,0.0002727356,0.0015345707,0.00076473225,0.00051646074,0.00093914487,0.0012514797,0.000047178084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007646081,0.00005384486,0.00024198106,0.000102869446,0.0000246707,0.00010655051,0.0003143599,0.013824911,0.000031294512,0.16295728,0.0002980616,0.8220365],"study_design_scores_gemma":[0.00070531067,0.00037551275,0.002065564,0.0026601588,0.00002824985,0.00006559181,2.3825663e-7,0.8362015,0.0013844148,0.118765734,0.036205005,0.0015427488],"about_ca_topic_score_codex":0.000037657013,"about_ca_topic_score_gemma":0.00009606207,"teacher_disagreement_score":0.82237655,"about_ca_system_score_codex":0.00014604387,"about_ca_system_score_gemma":0.00079904875,"threshold_uncertainty_score":0.99983513},"labels":[],"label_agreement":null},{"id":"W1558243220","doi":"10.1007/0-387-23483-7_134","title":"Elliptic Curve Keys","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mathematics","score_opus":0.004513138651551544,"score_gpt":0.18876043700833964,"score_spread":0.1842472983567881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558243220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023380622,0.00027671357,0.8689765,0.00088458357,0.00022280982,0.00005772576,2.125485e-7,0.00026591582,0.10593492],"genre_scores_gemma":[0.94423354,0.0000063384227,0.0536815,0.00017722072,0.00006335148,0.0000029486282,5.957883e-7,0.000002864742,0.0018316249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994468,0.00001789769,0.00009065117,0.00016689432,0.00011792933,0.00015984208],"domain_scores_gemma":[0.99961305,0.000036137808,0.000016579641,0.00028282971,0.000020577581,0.000030812273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007474294,0.000057917085,0.000054914603,0.00007167953,0.00006277672,0.000085579995,0.00035724405,0.000024980714,0.0000481192],"category_scores_gemma":[0.0000025955185,0.000043966174,0.000054506465,0.0003438806,0.000027987435,0.00014978425,0.00006679103,0.00004565737,0.00021681115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.77924e-7,0.00005258512,0.0039225393,0.0000030647925,0.000003682597,0.000012490324,0.000027268714,0.000074694806,0.00038149033,0.9841054,0.005250608,0.0061657666],"study_design_scores_gemma":[0.0009981671,0.00018694629,0.280403,0.000023626533,0.000016190248,0.00008969055,0.00003264984,0.06370604,0.025655791,0.5187938,0.10919249,0.00090159156],"about_ca_topic_score_codex":0.00015046354,"about_ca_topic_score_gemma":0.000029125802,"teacher_disagreement_score":0.92085296,"about_ca_system_score_codex":0.0000042686893,"about_ca_system_score_gemma":0.000011047083,"threshold_uncertainty_score":0.2786741},"labels":[],"label_agreement":null},{"id":"W1558666880","doi":"10.1007/3-540-36492-7_25","title":"On Some Attacks on Multi-prime RSA","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptosystem; Computer science; Public-key cryptography; Encryption; Prime (order theory); Cryptography; Integer factorization; Integer (computer science); Modulus; Prime factor; Factorization; Theoretical computer science; Key (lock); Arithmetic; Algorithm; Mathematics; Computer security; Combinatorics","score_opus":0.018156853772574855,"score_gpt":0.2520601455424164,"score_spread":0.23390329176984154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558666880","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016547769,0.00049610826,0.9907268,0.0011632404,0.003065181,0.00041826896,0.000005073608,0.00019788732,0.0037619264],"genre_scores_gemma":[0.1667844,0.0002511257,0.7997152,0.030437097,0.0008820193,0.000032445194,0.000009570351,0.00015594171,0.0017321525],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952635,0.00006519892,0.00048884563,0.00207025,0.0012403233,0.0008718809],"domain_scores_gemma":[0.9965321,0.00070605095,0.00025035976,0.0021122857,0.00013653706,0.00026271067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006988881,0.0007215143,0.0005822647,0.0014760713,0.0003889742,0.00053383096,0.0036058535,0.0004550192,0.000026716494],"category_scores_gemma":[0.000097590935,0.0006023631,0.00027878289,0.0007883041,0.00079635845,0.0004162196,0.00068572845,0.0013318475,0.00021900053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001661404,0.00025572308,0.000035382276,0.000039752562,0.000034224224,0.00036062417,0.0006024069,0.03613381,0.00016214102,0.35175654,0.0002146957,0.6103881],"study_design_scores_gemma":[0.0013860012,0.0014453968,0.00052181823,0.0012410812,0.000021616057,0.00012747706,1.7475895e-7,0.24619868,0.0074220416,0.7335276,0.00575341,0.00235468],"about_ca_topic_score_codex":0.000010587424,"about_ca_topic_score_gemma":0.000018713397,"teacher_disagreement_score":0.6080334,"about_ca_system_score_codex":0.00022239602,"about_ca_system_score_gemma":0.00027883914,"threshold_uncertainty_score":0.9996428},"labels":[],"label_agreement":null},{"id":"W1561312569","doi":"10.1007/978-3-642-04117-4_3","title":"Elliptic Curve Cryptography","year":2010,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Elliptic curve cryptography; Curve25519; Key size; Public-key cryptography; Cryptosystem; Elliptic curve; Computer science; Cryptography; Elliptic Curve Digital Signature Algorithm; Mathematics; Encryption; Elliptic curve point multiplication; Key (lock); Theoretical computer science; Computer security; Pure mathematics","score_opus":0.009492629534310782,"score_gpt":0.2018943447372967,"score_spread":0.1924017152029859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561312569","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000073438227,0.0008681993,0.21134552,0.00033451177,0.0010224209,0.00019196856,0.000004233322,0.0003925207,0.7858333],"genre_scores_gemma":[0.0021283536,0.0013498453,0.37155664,0.0014737487,0.0008080677,0.000025991369,0.000025187928,0.00013847397,0.6224937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99812555,0.000012720572,0.00033225614,0.00072220876,0.0004479348,0.00035934313],"domain_scores_gemma":[0.9980032,0.000114335926,0.00015745172,0.0014042524,0.000117830976,0.00020293308],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017173366,0.0004259098,0.00036509204,0.00063190964,0.0001703317,0.0002399237,0.0015638621,0.00059701747,0.0009128636],"category_scores_gemma":[0.000006395329,0.00035062432,0.00056603557,0.00015171779,0.00024214684,0.00019297055,0.00035243324,0.00095955,0.0008538808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010711462,0.00001566765,0.000015328516,0.000016607506,0.00006108052,0.000033045497,0.000040251307,4.01183e-7,0.00007694557,0.9867028,0.0013397594,0.011697033],"study_design_scores_gemma":[0.00012225006,0.00006025944,0.0000844425,0.00004365008,0.000027527836,0.000031681633,9.0903615e-7,0.00008565233,0.00024422922,0.47647157,0.5223319,0.0004959411],"about_ca_topic_score_codex":0.000012124061,"about_ca_topic_score_gemma":0.00003777805,"teacher_disagreement_score":0.5209921,"about_ca_system_score_codex":0.000008242115,"about_ca_system_score_gemma":0.00006904434,"threshold_uncertainty_score":0.99992406},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008789292478801355,"score_gpt":0.194320597010347,"score_spread":0.18553130453154565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562630396","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037953272,0.0043784417,0.033799596,0.000025092919,0.0003717972,0.0003945747,0.000034229866,0.00024703433,0.9607113],"genre_scores_gemma":[0.000514686,0.003935855,0.0058223484,0.00010870971,0.00022088925,0.0000029432647,0.000024501962,0.000038573962,0.9893315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99778074,0.00013005683,0.00027565294,0.0008737959,0.00040338657,0.0005363452],"domain_scores_gemma":[0.998329,0.00015050282,0.00022988008,0.0009856683,0.000105196326,0.00019976677],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001597005,0.00044981742,0.0004945401,0.0009926911,0.00016886204,0.00011687005,0.0020394379,0.0003880961,0.0000015398605],"category_scores_gemma":[0.0000065811228,0.00051259226,0.0003962497,0.00014799727,0.00031549693,0.00054343825,0.00062064733,0.0007376169,0.00001656397],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021065745,0.000042692565,0.000028768081,0.000111189656,0.000041299052,0.00038749218,0.00009763187,0.000042548632,0.000004683268,0.9648593,0.01538237,0.01898093],"study_design_scores_gemma":[0.00063635106,0.000059675996,0.00014844189,0.0002573743,0.000047614514,0.000016894404,0.000014429623,0.0005134287,0.00006353779,0.00018266602,0.99744475,0.0006148315],"about_ca_topic_score_codex":0.000041394873,"about_ca_topic_score_gemma":0.000016445572,"teacher_disagreement_score":0.9820624,"about_ca_system_score_codex":0.00018364578,"about_ca_system_score_gemma":0.0002535626,"threshold_uncertainty_score":0.99973255},"labels":[],"label_agreement":null},{"id":"W1566391339","doi":"10.1007/978-3-540-24654-1_5","title":"On Randomizing Private Keys to Counteract DPA Attacks","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cryptosystem; Scalar multiplication; Computer science; Integer (computer science); Theoretical computer science; Cryptanalysis; Binary number; Public-key cryptography; Power analysis; Discrete mathematics; Scalar (mathematics); Cryptography; Algorithm; Arithmetic; Mathematics; Computer security; Encryption; Programming language","score_opus":0.010846529898640055,"score_gpt":0.24557133814475468,"score_spread":0.23472480824611464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566391339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069366855,0.00021368296,0.990192,0.0016078025,0.002426523,0.00070798816,0.0000043775967,0.00019890131,0.0039550564],"genre_scores_gemma":[0.51312655,0.00007225907,0.4766379,0.009055834,0.0007924507,0.00002833736,0.0000049497885,0.00007675976,0.0002049504],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99531484,0.000045013374,0.00058935443,0.0018814047,0.0012928373,0.0008765686],"domain_scores_gemma":[0.996665,0.00087542366,0.00024592353,0.0017188092,0.00017759071,0.00031727337],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009489031,0.0006769136,0.00071350246,0.0015789336,0.0003800905,0.0008740789,0.003925753,0.00029883618,0.00003728049],"category_scores_gemma":[0.00013700491,0.0005685809,0.00027984747,0.0010160785,0.00045009478,0.00047240208,0.0012182392,0.0010607769,0.00018506208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011948019,0.00011168097,0.00004588288,0.00007690531,0.000045738514,0.0004890093,0.0018550815,0.23959404,0.00034632877,0.2632709,0.00007233652,0.4939726],"study_design_scores_gemma":[0.0038332827,0.0009673889,0.00041452618,0.0031956255,0.000025693045,0.00015691263,2.0727275e-7,0.08359817,0.0046009645,0.8965509,0.004430934,0.0022254304],"about_ca_topic_score_codex":0.000026517067,"about_ca_topic_score_gemma":0.000038140533,"teacher_disagreement_score":0.63328,"about_ca_system_score_codex":0.00037132323,"about_ca_system_score_gemma":0.00043053212,"threshold_uncertainty_score":0.9996766},"labels":[],"label_agreement":null},{"id":"W1569847413","doi":"10.1109/arith.2015.11","title":"New Bit-Level Serial GF (2^m) Multiplication Using Polynomial Basis","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Multiplication (music); GF(2); Polynomial basis; Computer science; Arithmetic; Basis (linear algebra); Polynomial; Bit (key); Mathematics; Finite field; Discrete mathematics; Combinatorics","score_opus":0.08321446368958185,"score_gpt":0.2804852278508189,"score_spread":0.19727076416123707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569847413","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06521214,0.00005167962,0.9314651,0.0008719582,0.0007755579,0.000115436735,0.0000015806847,0.0001540607,0.0013524706],"genre_scores_gemma":[0.39150456,0.000002685954,0.6075932,0.00019242836,0.00039197513,0.0000023432442,0.0000015863978,0.0000067421483,0.00030452313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991072,0.000036767826,0.00015878695,0.00028285128,0.00020755257,0.00020684263],"domain_scores_gemma":[0.999211,0.000031453503,0.000049850147,0.00040968857,0.0000685333,0.00022948503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016944837,0.00010063613,0.00010128784,0.00013375883,0.00008369103,0.00015380183,0.00047780966,0.000066958295,0.000021782409],"category_scores_gemma":[0.000029902601,0.00008522012,0.000065752916,0.00048565847,0.000023269455,0.00039444267,0.000171259,0.0000633441,0.000057404563],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017314636,0.0004223021,0.01324276,0.000025811394,0.00015083757,0.00002792531,0.0062450087,0.003316145,0.07085923,0.07605707,0.10297639,0.7265034],"study_design_scores_gemma":[0.01106665,0.00056797976,0.06837473,0.00007163568,0.000101215155,0.00024700374,0.00058331154,0.67031646,0.17202234,0.018999176,0.055346183,0.0023033388],"about_ca_topic_score_codex":0.001689124,"about_ca_topic_score_gemma":0.00009297287,"teacher_disagreement_score":0.7242,"about_ca_system_score_codex":0.000032839343,"about_ca_system_score_gemma":0.00021260497,"threshold_uncertainty_score":0.34751758},"labels":[],"label_agreement":null},{"id":"W1574299633","doi":"10.1007/978-3-642-01957-9_5","title":"Novel Precomputation Schemes for Elliptic Curve Cryptosystems","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Precomputation; Scalar multiplication; Elliptic curve point multiplication; Hessian form of an elliptic curve; Elliptic curve; Computer science; Elliptic curve cryptography; Tripling-oriented Doche–Icart–Kohel curve; Edwards curve; Scalar (mathematics); Cryptosystem; Schoof's algorithm; Curve25519; Supersingular elliptic curve; Algorithm; Arithmetic; Mathematics; Cryptography; Public-key cryptography; Pure mathematics; Computation; Encryption; Geometry; Operating system; Quarter period","score_opus":0.01812452495670169,"score_gpt":0.25107168928246587,"score_spread":0.23294716432576418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574299633","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052894815,0.0010011647,0.9940898,0.00059895776,0.0020083708,0.0009963979,0.000009089599,0.00023321532,0.0010101376],"genre_scores_gemma":[0.059077077,0.000045610454,0.9391074,0.0007418692,0.0007324264,0.000029820885,0.000013335433,0.000040774725,0.00021164464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959615,0.000025870891,0.0006742667,0.0017059216,0.000866557,0.00076586986],"domain_scores_gemma":[0.9971401,0.00072642893,0.00039812873,0.0011490409,0.0003983961,0.00018790126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009308786,0.000596336,0.0006196342,0.0011895864,0.0003640053,0.00076613884,0.0028203588,0.00039603555,0.000004896282],"category_scores_gemma":[0.00008611354,0.0005410504,0.00029913156,0.0008198961,0.00041543375,0.00064357277,0.00045904273,0.00056559005,0.000019656294],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074422132,0.00006436104,0.000018126844,0.000105253326,0.00002155184,0.000011392387,0.00040666317,0.02608799,0.0003550323,0.08760837,0.000020497331,0.8852933],"study_design_scores_gemma":[0.0005891148,0.00038723866,0.00014371765,0.00059956126,0.000018167586,0.00009013489,1.6947924e-7,0.7252823,0.0015148696,0.26312795,0.0073836176,0.000863134],"about_ca_topic_score_codex":0.000012585535,"about_ca_topic_score_gemma":0.000032701675,"teacher_disagreement_score":0.88443017,"about_ca_system_score_codex":0.00018095794,"about_ca_system_score_gemma":0.0004393587,"threshold_uncertainty_score":0.9997041},"labels":[],"label_agreement":null},{"id":"W1583217291","doi":"10.1007/978-1-4419-5906-5_249","title":"Elliptic Curve Point Multiplication Using Halving","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiplication (music); Mathematics; Elliptic curve point multiplication; Elliptic curve; Arithmetic; Pure mathematics; Combinatorics","score_opus":0.04123075263606576,"score_gpt":0.2360190592176594,"score_spread":0.19478830658159363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583217291","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025930669,0.0005173101,0.5896796,0.000049381597,0.00024769237,0.00017020921,0.0000010850716,0.00016647874,0.40914232],"genre_scores_gemma":[0.05051956,0.00072326546,0.56730044,0.00065558584,0.00056559616,0.000018423747,0.0000182633,0.00014689023,0.38005197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987034,0.000014939097,0.0002914795,0.0005374158,0.0002247467,0.00022801521],"domain_scores_gemma":[0.9986552,0.00007728731,0.00018844643,0.0008788702,0.000105173014,0.0000950228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017330282,0.00025855575,0.00022619171,0.00029200717,0.00013248266,0.0001122547,0.00071707164,0.00022342034,0.00020834849],"category_scores_gemma":[0.0000100371135,0.00022566275,0.00021449401,0.00006773076,0.00007406333,0.00025295521,0.00029959154,0.0002479791,0.00023374421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010921182,0.000013771493,0.0000151868835,0.000020789874,0.000035540554,0.000010284744,0.00020784883,0.000012092338,0.00012987344,0.98185986,0.000097873635,0.017595788],"study_design_scores_gemma":[0.00051428884,0.0001427593,0.0005233291,0.00066144567,0.00015676637,0.00019933573,0.000014187792,0.07686143,0.001697307,0.847956,0.06930168,0.0019714395],"about_ca_topic_score_codex":0.00008145297,"about_ca_topic_score_gemma":0.000014832186,"teacher_disagreement_score":0.13390383,"about_ca_system_score_codex":0.000041668012,"about_ca_system_score_gemma":0.000053514075,"threshold_uncertainty_score":0.920226},"labels":[],"label_agreement":null},{"id":"W1587701049","doi":"10.1007/3-540-45311-3_19","title":"Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Elliptic curve; Hessian form of an elliptic curve; Mathematics; Schoof's algorithm; Supersingular elliptic curve; Degree (music); Finite field; Tripling-oriented Doche–Icart–Kohel curve; Modular elliptic curve; Twists of curves; Discrete logarithm; Descent (aeronautics); Elliptic curve point multiplication; Discrete mathematics; Pure mathematics; Computer science; Physics; Public-key cryptography; Quarter period","score_opus":0.03161947789062102,"score_gpt":0.26082458541528575,"score_spread":0.22920510752466472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587701049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014646476,0.00021207912,0.9810427,0.001051912,0.0008796136,0.0003464483,0.000018391307,0.000029380917,0.0017730043],"genre_scores_gemma":[0.9888422,0.00006917735,0.009376698,0.0015098419,0.00010667326,0.000004277483,0.000002939561,0.000013911798,0.00007431587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969038,0.00010355231,0.0006262583,0.00085500407,0.0010855658,0.00042582778],"domain_scores_gemma":[0.9954009,0.001605966,0.0005867683,0.0021115215,0.00021375621,0.000081078106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006932656,0.00040530637,0.00066646526,0.0009406175,0.00025525584,0.00017173086,0.0041285264,0.00019651845,0.00004738431],"category_scores_gemma":[0.00007615782,0.00023404691,0.0005467588,0.002469935,0.0010942166,0.00013683632,0.0011030303,0.00074744684,0.000004576942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006947592,0.00041812158,0.016428156,0.00016325446,0.0010452362,0.00010221127,0.0041646766,0.39988083,0.0008005203,0.06562211,0.00007841025,0.511227],"study_design_scores_gemma":[0.00044685372,0.0002931601,0.08312042,0.0009137026,0.0003777067,0.000020823458,5.236786e-7,0.8855738,0.0026707787,0.025204217,0.0006488151,0.0007291981],"about_ca_topic_score_codex":0.00008233737,"about_ca_topic_score_gemma":0.0002526361,"teacher_disagreement_score":0.97419566,"about_ca_system_score_codex":0.00007007866,"about_ca_system_score_gemma":0.00018084771,"threshold_uncertainty_score":0.95441556},"labels":[],"label_agreement":null},{"id":"W1591294525","doi":"10.1109/newcas.2005.1496750","title":"A Hardware Architecture for the Generation of wNAF Random Integers","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Omega; Integer (computer science); Representation (politics); Elliptic curve cryptography; Computer science; Multiplication (music); Cryptography; Point (geometry); Elliptic curve; Discrete mathematics; Architecture; Arithmetic; Parallel computing; Computer hardware; Mathematics; Algorithm; Public-key cryptography; Combinatorics; Encryption; Pure mathematics; Physics; Operating system; Geometry","score_opus":0.01898336148073837,"score_gpt":0.24005204317266474,"score_spread":0.22106868169192637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591294525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035522105,0.00033797353,0.9886682,0.0065825903,0.00011646294,0.00022420735,0.000001671132,0.000033204265,0.00048346876],"genre_scores_gemma":[0.8414812,0.000019017478,0.15750283,0.0005836586,0.00017126267,0.000029113568,0.0000016369858,0.0000033379838,0.000207956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995757,0.000020360763,0.00010579887,0.000115501934,0.000091712485,0.00009093186],"domain_scores_gemma":[0.9994914,0.0001765878,0.00003184074,0.00023621088,0.000044914603,0.00001905779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016445712,0.000051410065,0.000068829424,0.000051018193,0.00008436251,0.000038987775,0.00033598684,0.000022915887,0.000012592035],"category_scores_gemma":[0.000024989049,0.00002683672,0.00010523473,0.00015819677,0.00003617154,0.000073590265,0.0000362314,0.000046559064,0.0000015661064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004407027,0.00006362915,0.00006163388,0.000017172977,0.000074535674,4.2558926e-7,0.0024759527,0.01717435,0.0071802363,0.14128184,0.012208854,0.8194173],"study_design_scores_gemma":[0.0028242685,0.00016170992,0.00066549936,0.000018799536,0.00003537734,0.000016243688,0.00010241238,0.8041255,0.0961391,0.006727083,0.08896009,0.00022389856],"about_ca_topic_score_codex":0.000018580484,"about_ca_topic_score_gemma":0.0001315653,"teacher_disagreement_score":0.837929,"about_ca_system_score_codex":0.0000035005153,"about_ca_system_score_gemma":0.000016672022,"threshold_uncertainty_score":0.109436974},"labels":[],"label_agreement":null},{"id":"W1596927786","doi":"10.1007/978-3-540-77360-3_11","title":"Efficient Explicit Formulae for Genus 2 Hyperelliptic Curves over Prime Fields and Their Implementations","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hyperelliptic curve cryptography; Scalar multiplication; Mathematics; Hyperelliptic curve; Prime (order theory); Genus; Inversion (geology); Field (mathematics); Finite field; Arithmetic; Scalar (mathematics); Elliptic curve; Divisor (algebraic geometry); Algebra over a field; Pure mathematics; Discrete mathematics; Computer science; Combinatorics; Geometry; Public-key cryptography; Elliptic curve cryptography","score_opus":0.023933025065771857,"score_gpt":0.2753110897530602,"score_spread":0.2513780646872883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596927786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002410866,0.0026973686,0.99224114,0.00040916094,0.0006918686,0.0008206582,0.000012057246,0.00008137994,0.0006354867],"genre_scores_gemma":[0.60148215,0.00032370133,0.39403433,0.0034741883,0.0004070229,0.000057238234,0.000014737933,0.000049754522,0.0001568855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974614,0.000014055717,0.00043872066,0.0010341472,0.00043460992,0.00061709504],"domain_scores_gemma":[0.99793404,0.00077400054,0.00018190788,0.00080178556,0.00015267526,0.00015558119],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006840195,0.00040901662,0.00038102485,0.00068908674,0.0003632323,0.00026922082,0.0013131008,0.00020838305,0.000015438336],"category_scores_gemma":[0.00003714331,0.00032518303,0.00017081594,0.00046252445,0.00027894066,0.00016350661,0.00052114355,0.00037841155,0.0000033372398],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012221193,0.000063970874,0.0000658344,0.00021476572,0.000039023787,0.000018554078,0.0021034002,0.0056440253,0.0003364619,0.06445334,0.000031829248,0.92701656],"study_design_scores_gemma":[0.0010758241,0.0006415429,0.0016386928,0.0011330809,0.00004422345,0.0001336756,0.0000025580518,0.76199627,0.0067489455,0.22179832,0.0033230183,0.0014638584],"about_ca_topic_score_codex":0.000021630689,"about_ca_topic_score_gemma":0.00015834827,"teacher_disagreement_score":0.9255527,"about_ca_system_score_codex":0.00008087301,"about_ca_system_score_gemma":0.00019468839,"threshold_uncertainty_score":0.99992},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.029956378640333604,"score_gpt":0.3021222506696207,"score_spread":0.27216587202928705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601407566","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010676975,0.0011771613,0.98557323,0.0002269375,0.00077649846,0.0013066017,0.000007941062,0.00011119592,0.00014343411],"genre_scores_gemma":[0.34069273,0.00008748965,0.658398,0.0005153901,0.00021070222,0.00002344527,0.000010614164,0.00003589149,0.000025739928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632144,0.000033774155,0.00060322933,0.0015677509,0.0008256086,0.0006482092],"domain_scores_gemma":[0.99714696,0.0008773008,0.00034771013,0.0010460041,0.00038173367,0.00020029857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012167178,0.00045071726,0.000437217,0.00074990775,0.00045146825,0.00031209804,0.001087707,0.0002574254,0.0000050253166],"category_scores_gemma":[0.00015736616,0.0004093749,0.00018208331,0.0008155657,0.00064458494,0.00017923868,0.0006073821,0.00038756113,0.000008144528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028335005,0.00015914987,0.00034627985,0.00042207932,0.000024975818,0.000025104355,0.0012943086,0.62631875,0.0013095344,0.013828801,0.000008061931,0.3562346],"study_design_scores_gemma":[0.0004876352,0.000074697244,0.0004410357,0.0008475684,0.000024367278,0.000069361566,6.490494e-7,0.986341,0.0030069875,0.0081190355,0.00009935638,0.00048830156],"about_ca_topic_score_codex":0.000059913666,"about_ca_topic_score_gemma":0.000032612104,"teacher_disagreement_score":0.36002225,"about_ca_system_score_codex":0.00018811443,"about_ca_system_score_gemma":0.00017688188,"threshold_uncertainty_score":0.9998358},"labels":[],"label_agreement":null},{"id":"W1602878314","doi":"10.1109/isit.1991.695401","title":"Division And Bit-serial Multiplication Over GF(q/sup m/)","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Multiplication (music); Division (mathematics); Arithmetic; Bit (key); Computer science; Mathematics; Computer network; Combinatorics","score_opus":0.006915362419178537,"score_gpt":0.23008982853226315,"score_spread":0.2231744661130846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602878314","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.592658,0.00016764249,0.40311837,0.0017032247,0.000112876405,0.00012541497,6.526982e-7,0.00016342268,0.00195037],"genre_scores_gemma":[0.93262655,0.00003277086,0.06686883,0.00025342987,0.000085331405,0.000004509532,8.2297146e-7,0.0000028384625,0.00012493882],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99941593,0.000018119152,0.00009913785,0.00022715081,0.00011782772,0.00012182073],"domain_scores_gemma":[0.99959445,0.000044101627,0.00002291935,0.00026036712,0.000018903935,0.000059248985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000094993295,0.00006515057,0.00005870206,0.00007530619,0.000092277696,0.000103118546,0.00020381337,0.00003972443,0.00003182082],"category_scores_gemma":[0.0000094706365,0.00004965938,0.000029574501,0.0001925727,0.000030319638,0.000354305,0.00013981783,0.000045559336,0.000034460933],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008864717,0.00015162131,0.010095413,0.000009383559,0.000013959598,0.0000018131121,0.00086063455,0.00025969942,0.009889903,0.13851851,0.0020668716,0.8381233],"study_design_scores_gemma":[0.0016935704,0.00014014331,0.52340597,0.000020908667,0.000008625073,0.0000157193,0.00002592883,0.40669307,0.012939831,0.0075478214,0.0470798,0.00042858272],"about_ca_topic_score_codex":0.00003543738,"about_ca_topic_score_gemma":0.00002190431,"teacher_disagreement_score":0.83769476,"about_ca_system_score_codex":0.0000057948732,"about_ca_system_score_gemma":0.000007069453,"threshold_uncertainty_score":0.20250507},"labels":[],"label_agreement":null},{"id":"W1604225203","doi":"10.1109/ccece.1995.528117","title":"Division-and-accumulation in GF(2/sup m/)","year":2002,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Division (mathematics); Pipeline (software); GF(2); Throughput; Computer science; Arithmetic; Finite field; Parallel computing; Field (mathematics); Galois theory; Division algorithm; Mathematics; Discrete mathematics; Operating system; Pure mathematics","score_opus":0.03246315922622509,"score_gpt":0.2508258705048337,"score_spread":0.2183627112786086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604225203","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53172976,0.0005875212,0.4485824,0.0026329097,0.00012808164,0.00014042185,2.2954084e-7,0.00017071958,0.016027955],"genre_scores_gemma":[0.9850426,0.000037716687,0.0146092335,0.0001496848,0.000007962422,0.0000021098701,1.4695685e-7,0.000001617695,0.00014892792],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995328,0.000020725805,0.000090871625,0.00015665863,0.00009223055,0.00010671223],"domain_scores_gemma":[0.99972284,0.00005542516,0.000012291857,0.00016638244,0.000008986672,0.000034078294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000082043945,0.000046272573,0.00005262204,0.00012291066,0.00004143178,0.000060804312,0.00015345677,0.000026411033,0.0000807721],"category_scores_gemma":[0.000010876401,0.000036434267,0.000019850097,0.0003448119,0.000017477738,0.0002429894,0.00008185397,0.00004748122,0.00003954449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014434613,0.00018249829,0.117940366,0.00001319551,0.000008141203,0.000026630083,0.0026306768,0.0010580143,0.00026908546,0.2880797,0.0012220783,0.58856815],"study_design_scores_gemma":[0.0002930912,0.000033246146,0.28256163,0.0000107806745,8.7222696e-7,0.000005512317,0.000017116672,0.7034484,0.00014009378,0.012051344,0.00132251,0.000115400544],"about_ca_topic_score_codex":0.000037793245,"about_ca_topic_score_gemma":0.000015546251,"teacher_disagreement_score":0.7023904,"about_ca_system_score_codex":0.0000037978375,"about_ca_system_score_gemma":0.0000015245912,"threshold_uncertainty_score":0.14857464},"labels":[],"label_agreement":null},{"id":"W160574436","doi":"10.1007/978-1-4419-5906-5_872","title":"Koblitz Elliptic Curves","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics","score_opus":0.024735145372546036,"score_gpt":0.20225685539867383,"score_spread":0.1775217100261278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W160574436","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.4780475e-7,0.011920833,0.0814241,0.00033773933,0.00039510347,0.00014022017,0.0000017744954,0.00024832343,0.90553147],"genre_scores_gemma":[0.00030987491,0.008812601,0.01379767,0.0012488861,0.00010797846,0.000005786188,0.000003585907,0.00002798935,0.97568566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881214,0.000010098703,0.0002312498,0.0004608707,0.00026375303,0.00022187603],"domain_scores_gemma":[0.9987488,0.000051629584,0.00009777352,0.0009213583,0.00006805106,0.00011240566],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00012035857,0.00025801582,0.00025797542,0.00022573666,0.000065206455,0.000063876556,0.0011150725,0.00019416271,0.0013241839],"category_scores_gemma":[0.0000043671967,0.00020268201,0.00024937716,0.000061201696,0.0001005444,0.00015593175,0.0002847218,0.00026503933,0.0011972565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.342239e-7,0.0000095772275,0.0000029746343,0.000067617526,0.000037081634,0.00002495852,0.00003485459,8.8899725e-8,0.0000013900969,0.9707575,0.010576311,0.018487144],"study_design_scores_gemma":[0.000082475904,0.00007520808,0.0000745073,0.00056255516,0.000036323254,0.00003517612,5.3768116e-7,0.000051836625,0.000057489906,0.52210176,0.47645384,0.00046832778],"about_ca_topic_score_codex":0.00001874038,"about_ca_topic_score_gemma":0.000010393044,"teacher_disagreement_score":0.46587753,"about_ca_system_score_codex":0.000008870571,"about_ca_system_score_gemma":0.000052645544,"threshold_uncertainty_score":0.9995887},"labels":[],"label_agreement":null},{"id":"W1606166759","doi":"10.1007/978-3-642-04138-9_22","title":"Elliptic Curve Scalar Multiplication Combining Yao’s Algorithm and Double Bases","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scalar multiplication; Base (topology); Binary number; Elliptic curve; Scalar (mathematics); Mathematics; Representation (politics); Integer (computer science); Point (geometry); Algorithm; Multiplication (music); Multiplication algorithm; Set (abstract data type); Discrete mathematics; Combinatorics; Arithmetic; Computer science; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.01392801273236698,"score_gpt":0.23830948094146565,"score_spread":0.22438146820909866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606166759","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016599822,0.0017758351,0.99480826,0.0007792945,0.0006769085,0.00043225742,0.0000032855494,0.00018859231,0.0011695642],"genre_scores_gemma":[0.083557144,0.00034488266,0.9142787,0.0012510523,0.00032886714,0.000013520873,0.000009520993,0.000033392902,0.0001829492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965684,0.000035516776,0.00046513273,0.0015606462,0.0007656994,0.0006046257],"domain_scores_gemma":[0.99773324,0.00042929233,0.00024751888,0.0011727567,0.00019822169,0.00021896524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007204178,0.0004994697,0.0004833533,0.00092707545,0.0004051709,0.0007051582,0.0019061866,0.0003015184,0.0000067225697],"category_scores_gemma":[0.000028641633,0.00045287545,0.00012682658,0.00075692305,0.0007627118,0.00063265295,0.00076631294,0.0007018236,0.000019606507],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003862028,0.00003886117,0.00007531911,0.000022045038,0.000008984524,0.00004038117,0.00038237832,0.0029763612,0.00006789639,0.01602461,0.000007918176,0.9803514],"study_design_scores_gemma":[0.00087870355,0.0003104559,0.0013610903,0.0005356613,0.00002066015,0.00016841882,3.500887e-7,0.82708335,0.0018591683,0.16487157,0.0019567136,0.00095383276],"about_ca_topic_score_codex":0.000038150367,"about_ca_topic_score_gemma":0.000022226699,"teacher_disagreement_score":0.97939754,"about_ca_system_score_codex":0.00009693137,"about_ca_system_score_gemma":0.00020434057,"threshold_uncertainty_score":0.9997923},"labels":[],"label_agreement":null},{"id":"W1606363966","doi":"10.1007/978-3-540-79456-1_6","title":"On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Elliptic curve; Prime (order theory); Embedding; Order (exchange); Diophantine equation; Mathematics; Discriminant; Schoof's algorithm; Heuristic; Edwards curve; Discrete mathematics; Computer science; Pure mathematics; Combinatorics; Mathematical optimization; Quarter period; Artificial intelligence","score_opus":0.011372701910279307,"score_gpt":0.22806061472064015,"score_spread":0.21668791281036084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606363966","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000345584,0.0040148897,0.991547,0.0007482704,0.00042991154,0.0003441074,0.0000026613918,0.00013722139,0.0024303512],"genre_scores_gemma":[0.1298683,0.0029564442,0.8634248,0.0030073894,0.00028707687,0.000013323061,0.0000051651496,0.00006295395,0.00037458856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966421,0.000030943324,0.00035374783,0.0014789831,0.00092876615,0.00056543096],"domain_scores_gemma":[0.99768233,0.00066486554,0.00021097482,0.0010873372,0.00017739003,0.00017710624],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004051409,0.0005215218,0.00047000538,0.0008377208,0.00036325495,0.00031829224,0.0016695308,0.00019950783,0.0000058975047],"category_scores_gemma":[0.0000662411,0.00038421026,0.000077547884,0.0008036902,0.0011921927,0.0003921786,0.00061079016,0.0007277977,0.000013713151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051458373,0.00013470608,0.0002566248,0.0002869249,0.00007565473,0.00078962074,0.0024844445,0.08799562,0.00005520131,0.031742312,0.00020728228,0.8759202],"study_design_scores_gemma":[0.0017192003,0.0023989137,0.0018974037,0.008862833,0.00005684415,0.001770207,5.509517e-7,0.8953283,0.0015710471,0.080229245,0.00300179,0.0031636867],"about_ca_topic_score_codex":0.000013594408,"about_ca_topic_score_gemma":0.000038311453,"teacher_disagreement_score":0.8727565,"about_ca_system_score_codex":0.000064626496,"about_ca_system_score_gemma":0.0003179268,"threshold_uncertainty_score":0.999861},"labels":[],"label_agreement":null},{"id":"W1609212254","doi":"10.1007/978-3-642-04103-7_6","title":"Code Generation for Polynomial Multiplication","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Multiplication (music); Polynomial; Parallel computing; Arithmetic; Programming language; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.021907586001719367,"score_gpt":0.2556619763726521,"score_spread":0.2337543903709327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1609212254","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006386987,0.00036026756,0.99545264,0.0017550824,0.0011077526,0.0006327134,0.000010152567,0.000120159886,0.0004973743],"genre_scores_gemma":[0.075755455,0.00005584197,0.920301,0.0020930655,0.0014152376,0.000029414927,0.000023186356,0.000024927986,0.00030184677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743485,0.000017633722,0.00038592258,0.0012431253,0.0004824681,0.00043601415],"domain_scores_gemma":[0.99821347,0.00024073073,0.00021105507,0.0010100693,0.00021293618,0.00011174123],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005406695,0.00033643903,0.0003077221,0.00069143076,0.00031912516,0.00043916635,0.0018411363,0.00028422943,0.0000033071249],"category_scores_gemma":[0.00005197598,0.00031031392,0.00016210391,0.00040147014,0.00029067454,0.00040053204,0.0002694814,0.00032865437,0.000010579428],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004574657,0.000024120118,0.0000063730126,0.00001141559,0.0000053697513,0.000004549913,0.00022029396,0.011125527,0.0018927406,0.01499279,0.0001448678,0.9715674],"study_design_scores_gemma":[0.00039682016,0.00022198327,0.00016504891,0.0000846529,0.000009106803,0.000025672796,2.7766989e-8,0.9060181,0.0057430123,0.07929335,0.007528347,0.00051390356],"about_ca_topic_score_codex":0.0000126209425,"about_ca_topic_score_gemma":0.000118008844,"teacher_disagreement_score":0.9710535,"about_ca_system_score_codex":0.00013844945,"about_ca_system_score_gemma":0.0002823813,"threshold_uncertainty_score":0.9999349},"labels":[],"label_agreement":null},{"id":"W162865231","doi":"10.1007/s00145-002-0107-y","title":"A Probable Prime Test with Very High Confidence for n ≡ 3 mod 4","year":2003,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Austrian Science Fund","keywords":"Precomputation; Mathematics; Mod; Modulo; Prime (order theory); Arithmetic; Primality test; Square root; Discrete mathematics; Combinatorics; Prime number; Algorithm; Computer science","score_opus":0.008341506126372444,"score_gpt":0.22202805433775705,"score_spread":0.2136865482113846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W162865231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048075017,0.0005215818,0.9489082,0.0013168815,0.000384826,0.00017535282,8.389871e-7,0.00001945928,0.0005978185],"genre_scores_gemma":[0.68624467,0.000028918494,0.31341922,0.00021159394,0.00004955961,0.0000074547797,1.2871847e-7,0.000006729385,0.000031724936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989485,0.00007016583,0.00032755086,0.00017158833,0.00019517523,0.00028702713],"domain_scores_gemma":[0.9984888,0.000477732,0.00033914836,0.00024823673,0.00034006164,0.00010601217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004063792,0.000116328556,0.00029642737,0.00019515524,0.00009475825,0.000062661195,0.000510573,0.000078920355,0.000011701222],"category_scores_gemma":[0.00023840411,0.00008022709,0.000101109385,0.0003168435,0.00012119455,0.00033917095,0.000026647347,0.00018335514,0.0000040498912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009067771,0.0002855202,0.0059839874,0.000033901437,0.00009251528,0.0001473961,0.00021833369,0.00029204614,0.0024270958,0.98805094,0.0008327024,0.0015448792],"study_design_scores_gemma":[0.0068959817,0.00874105,0.011736414,0.00023785984,0.00015470343,0.01083122,0.00011726829,0.0014099041,0.05968527,0.85704607,0.04245929,0.00068496173],"about_ca_topic_score_codex":0.0000032829066,"about_ca_topic_score_gemma":0.000007731048,"teacher_disagreement_score":0.63816965,"about_ca_system_score_codex":0.000020779833,"about_ca_system_score_gemma":0.00030283435,"threshold_uncertainty_score":0.32715657},"labels":[],"label_agreement":null},{"id":"W1632631493","doi":"10.1007/11894063_35","title":"FPGA Implementation of Point Multiplication on Koblitz Curves Using Kleinian Integers","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Field-programmable gate array; Multiplication (music); Point (geometry); Arithmetic; Floating point; Algorithm; Computer hardware; Mathematics; Combinatorics; Geometry","score_opus":0.018609947089646493,"score_gpt":0.2810992868724549,"score_spread":0.2624893397828084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1632631493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000789236,0.00043830858,0.9961495,0.0006825613,0.000586602,0.00047047215,0.000009132986,0.00006996848,0.0008042454],"genre_scores_gemma":[0.6856485,0.00010145637,0.31290543,0.0010695069,0.00019308546,0.000009543133,0.000017104145,0.000029441122,0.000025942283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971573,0.00004211112,0.0006022023,0.0010034633,0.0008013765,0.00039355384],"domain_scores_gemma":[0.997936,0.00028531323,0.00046180497,0.000998136,0.00023485211,0.000083875806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006470687,0.00035673537,0.0003816143,0.001146534,0.00016156133,0.0001540845,0.0016017839,0.0001657069,0.00001270993],"category_scores_gemma":[0.00002726185,0.00032077386,0.00016529347,0.0008231812,0.0004917058,0.00041758077,0.000420032,0.00040490762,0.0000051752286],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007426328,0.00007889605,0.00035655865,0.00021054642,0.000022821665,0.000019503956,0.00090813776,0.042265687,0.0013310633,0.017495366,0.00007862568,0.93722534],"study_design_scores_gemma":[0.0015240525,0.0011255192,0.009339509,0.005592702,0.000071738774,0.00010761902,0.000003974539,0.64222455,0.09170859,0.24510847,0.0009017703,0.0022915062],"about_ca_topic_score_codex":0.00028645693,"about_ca_topic_score_gemma":0.00013294496,"teacher_disagreement_score":0.93493384,"about_ca_system_score_codex":0.00018121144,"about_ca_system_score_gemma":0.000294084,"threshold_uncertainty_score":0.9999244},"labels":[],"label_agreement":null},{"id":"W1695582736","doi":"10.1007/3-540-45537-x_18","title":"Fast Normal Basis Multiplication Using General Purpose Processors","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Normal basis; Multiplication (music); Basis (linear algebra); Finite field; Multiplication algorithm; Flexibility (engineering); Software; Cryptography; Parallel computing; Field (mathematics); Binary number; Arithmetic; Algorithm; Galois theory; Mathematics; Operating system","score_opus":0.017131413844928674,"score_gpt":0.24579148593496353,"score_spread":0.22866007209003486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1695582736","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018454372,0.00045560068,0.9938908,0.00033981586,0.0009226734,0.00044289537,0.0000041105536,0.0001726514,0.0019259873],"genre_scores_gemma":[0.13750474,0.000119414355,0.8602408,0.00096821116,0.0008127576,0.000017728884,0.00000773508,0.000050117058,0.000278452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961927,0.00003366974,0.0005139412,0.0015624022,0.00094974024,0.0007475752],"domain_scores_gemma":[0.9977693,0.00015998678,0.00030911935,0.0012573889,0.00029609498,0.00020810058],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053420477,0.000526737,0.00043630347,0.0012097104,0.00043945314,0.00060554245,0.0029984883,0.00034376892,0.000018271341],"category_scores_gemma":[0.000038840968,0.00047919227,0.00018582019,0.0013858511,0.00066094636,0.0008362092,0.0010073106,0.00068177684,0.00002213803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064493834,0.00005763888,0.00042277423,0.000050412207,0.00001471311,0.00008892671,0.0008829344,0.099375084,0.0007810444,0.00882411,0.0000063045595,0.8894896],"study_design_scores_gemma":[0.0003175745,0.000105955194,0.00055365765,0.00026766115,0.000016196615,0.00023805752,2.5427622e-7,0.95273477,0.003553998,0.040263295,0.0011127698,0.0008358113],"about_ca_topic_score_codex":0.00006769467,"about_ca_topic_score_gemma":0.00008260668,"teacher_disagreement_score":0.8886538,"about_ca_system_score_codex":0.00020143998,"about_ca_system_score_gemma":0.00043050584,"threshold_uncertainty_score":0.999766},"labels":[],"label_agreement":null},{"id":"W1710386418","doi":"10.1007/978-3-642-35999-6_10","title":"Efficient Arithmetic on Elliptic Curves over Fields of Characteristic Three","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Elliptic curve point multiplication; Hessian matrix; Elliptic curve; Multiplication (music); Edwards curve; Arithmetic; Schoof's algorithm; Constant (computer programming); Tripling-oriented Doche–Icart–Kohel curve; Hessian form of an elliptic curve; Point (geometry); Mathematics; Field (mathematics); Finite field; Elliptic curve cryptography; Homogeneous coordinates; Computer science; Pure mathematics; Discrete mathematics; Applied mathematics; Geometry; Combinatorics; Quarter period; Encryption","score_opus":0.011772244013764047,"score_gpt":0.22372672588842044,"score_spread":0.21195448187465638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1710386418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028287184,0.0015311469,0.9906492,0.0005220119,0.0016223444,0.00057113694,0.000006200803,0.00009232887,0.0021768725],"genre_scores_gemma":[0.8542735,0.00039710186,0.14129393,0.0032402228,0.00043153216,0.000030225094,0.0000057348957,0.000060177626,0.00026759077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614316,0.00003624332,0.0006650291,0.0013101861,0.0012147764,0.0006306292],"domain_scores_gemma":[0.9967285,0.0007493819,0.00040416382,0.001713792,0.00022734731,0.00017681654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005542366,0.00055230706,0.00070357363,0.0010608976,0.00015896729,0.00022981147,0.002891073,0.00032567696,0.00010671496],"category_scores_gemma":[0.0000927172,0.0004494551,0.00025770624,0.000777167,0.000868461,0.00014677807,0.000829189,0.0008610562,0.00008532059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016491822,0.00031680943,0.00030330315,0.0008061283,0.000068252426,0.0001565151,0.0006772464,0.051804326,0.0003000847,0.10308429,0.000105486506,0.8423611],"study_design_scores_gemma":[0.00042159634,0.00074143306,0.006637861,0.0039829602,0.000037402246,0.000049502552,9.851018e-8,0.85306287,0.0010111032,0.13258392,0.00038000508,0.0010912463],"about_ca_topic_score_codex":0.000051319494,"about_ca_topic_score_gemma":0.000034559052,"teacher_disagreement_score":0.8514448,"about_ca_system_score_codex":0.000091177164,"about_ca_system_score_gemma":0.00024865882,"threshold_uncertainty_score":0.99979573},"labels":[],"label_agreement":null},{"id":"W1732813225","doi":"10.1007/978-3-642-33481-8_12","title":"Improved Exponentiation and Key Agreement in the Infrastructure of a Real Quadratic Field","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Exponentiation; Computer science; Key (lock); Binary number; Quadratic equation; Protocol (science); Field (mathematics); Diffie–Hellman key exchange; Modular exponentiation; Public-key cryptography; Theoretical computer science; Algorithm; Arithmetic; Computer security; Encryption; Mathematics; Key exchange","score_opus":0.00867932684524461,"score_gpt":0.22247808840594696,"score_spread":0.21379876156070235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1732813225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004253819,0.0008427213,0.9927377,0.0007115529,0.0004903308,0.00037679976,0.0000016611745,0.000016996,0.0005684327],"genre_scores_gemma":[0.90001154,0.00020809207,0.09905119,0.0005674545,0.0001347274,0.000007833846,0.0000019814145,0.0000072353714,0.000009915476],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981535,0.00005349434,0.000390021,0.0005478652,0.00052056904,0.00033457184],"domain_scores_gemma":[0.9984326,0.0004652163,0.00023271,0.0007415778,0.000070221155,0.00005767006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007917804,0.00025231644,0.00028573637,0.00052283815,0.00010475166,0.00017115113,0.0014115241,0.00019640065,0.000008637707],"category_scores_gemma":[0.000040325736,0.00017330286,0.00007003817,0.00047687348,0.00031240002,0.00032833923,0.00048489045,0.00047536712,9.572201e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012178426,0.00005786845,0.0016940997,0.00013227158,0.000017365175,0.00001986715,0.013721946,0.0015202202,0.0011389826,0.050795604,0.000017504572,0.9308721],"study_design_scores_gemma":[0.0013352782,0.0011636036,0.054493643,0.0010395531,0.000056731533,0.0001632328,0.00001092931,0.45997113,0.005709591,0.47404483,0.00058251293,0.0014289528],"about_ca_topic_score_codex":0.00010529002,"about_ca_topic_score_gemma":0.0002679075,"teacher_disagreement_score":0.9294431,"about_ca_system_score_codex":0.00004265504,"about_ca_system_score_gemma":0.00012383448,"threshold_uncertainty_score":0.70670855},"labels":[],"label_agreement":null},{"id":"W1751845220","doi":"","title":"Gpu and asic acceleration of elliptic curve scalar point multiplication","year":2012,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Scalar multiplication; Elliptic curve cryptography; Elliptic Curve Digital Signature Algorithm; Elliptic curve point multiplication; Counting points on elliptic curves; Computer science; Curve25519; Cryptography; Public-key cryptography; Elliptic curve; Arithmetic; Mathematics; Theoretical computer science; Parallel computing; Algorithm; Encryption; Computer security","score_opus":0.015070683673748456,"score_gpt":0.23867514307433918,"score_spread":0.22360445940059073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1751845220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41634458,0.0004934268,0.581372,0.00043663246,0.00009447731,0.00012834909,3.3830918e-7,0.000050303413,0.0010798782],"genre_scores_gemma":[0.9581509,0.00004331296,0.041687228,0.00005570375,0.000028143724,0.000005670327,0.0000010250234,0.000002350969,0.0000256446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99949586,0.000031212276,0.0001273496,0.00012112222,0.00010214989,0.00012230147],"domain_scores_gemma":[0.9995706,0.000053067382,0.000047846886,0.00022817987,0.000042002335,0.000058270238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020874145,0.00005479165,0.00006841277,0.00007827253,0.000049013972,0.00003467721,0.00013819135,0.00003326147,0.000011022714],"category_scores_gemma":[0.000014277537,0.00004318282,0.000028380067,0.00021522104,0.000035637062,0.00052733184,0.00006535959,0.000039109313,0.000012637945],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007609959,0.00046824806,0.13243106,0.000075176635,0.00003752645,5.006751e-7,0.003445086,0.000042477186,0.05159311,0.63870203,0.00039969903,0.17279747],"study_design_scores_gemma":[0.00044146442,0.00009473171,0.8542609,0.000019494488,0.000014933296,0.000017840042,0.00008539621,0.04143551,0.09654553,0.0061419844,0.0007273327,0.00021483695],"about_ca_topic_score_codex":0.000022305961,"about_ca_topic_score_gemma":0.00000365265,"teacher_disagreement_score":0.7218299,"about_ca_system_score_codex":0.000004797758,"about_ca_system_score_gemma":0.0000065272948,"threshold_uncertainty_score":0.17609443},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010677520357142905,"score_gpt":0.21868783298679312,"score_spread":0.20801031262965022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1754939103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46115187,0.018739482,0.51326007,0.00063356216,0.0003031685,0.0007051441,0.000027722022,0.000337496,0.004841458],"genre_scores_gemma":[0.95023865,0.011521136,0.03786011,0.00021366015,0.00003998049,0.000050410938,0.0000031334448,0.000024209257,0.000048702943],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780405,0.00021989094,0.00048027863,0.0005049793,0.00041949697,0.0005713096],"domain_scores_gemma":[0.99825525,0.00046472542,0.000145731,0.0008194829,0.000118955366,0.00019582766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006021254,0.00029826604,0.00032219797,0.00038090337,0.00060838816,0.0003315289,0.0009891054,0.00007515667,0.00003673139],"category_scores_gemma":[0.000010712456,0.00020323008,0.00038190416,0.0020932453,0.0007393414,0.00030436914,0.00009236912,0.00021859647,0.000011271137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104167746,0.00025485863,0.007782164,0.00006424931,0.00034906258,0.000022074868,0.0015092104,0.00019523359,0.0018123345,0.2916914,0.0009121015,0.69530314],"study_design_scores_gemma":[0.0023639014,0.001675181,0.10760177,0.00021939064,0.00018388405,0.00012514909,0.00031460187,0.01184244,0.009489758,0.77942276,0.08497875,0.0017824392],"about_ca_topic_score_codex":0.00006571151,"about_ca_topic_score_gemma":0.000026816888,"teacher_disagreement_score":0.6935207,"about_ca_system_score_codex":0.000003683677,"about_ca_system_score_gemma":0.000033081255,"threshold_uncertainty_score":0.8287482},"labels":[],"label_agreement":null},{"id":"W1764137175","doi":"10.1007/978-3-642-13797-6_3","title":"A Modified Low Complexity Digit-Level Gaussian Normal Basis Multiplier","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Multiplier (economics); Finite field; Arithmetic; NIST; Normal basis; Mathematics; Elliptic curve cryptography; Polynomial basis; Gaussian; GF(2); Algorithm; Computer science; Binary number; Discrete mathematics; Public-key cryptography; Galois theory; Encryption; Speech recognition","score_opus":0.03032124743674676,"score_gpt":0.2421403502562331,"score_spread":0.21181910281948635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1764137175","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006445351,0.00012412929,0.98872155,0.0009645798,0.0023676371,0.00050199573,0.000033833385,0.00026195997,0.006379758],"genre_scores_gemma":[0.4058569,0.000025696067,0.5919089,0.0013208672,0.00052775803,0.000015073897,0.000012020457,0.00004847611,0.00028435708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946006,0.000045183504,0.0007050544,0.002116092,0.0013813518,0.0011517263],"domain_scores_gemma":[0.99610126,0.00048174028,0.00034948185,0.0023546736,0.0002811791,0.00043165454],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000688615,0.0008269838,0.0007531914,0.0013535,0.00066087535,0.0010418923,0.0052763405,0.0006838696,0.000054570817],"category_scores_gemma":[0.00008551246,0.00071718806,0.00036058144,0.0010468925,0.00239204,0.0008579073,0.0021375215,0.0019994595,0.000073548166],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020841186,0.00016938729,0.00019969016,0.0001133607,0.000035301684,0.00025343063,0.0012761807,0.010160686,0.0007182839,0.0750789,0.000021591728,0.9119524],"study_design_scores_gemma":[0.001305858,0.00029433455,0.0054587335,0.00066129846,0.00003058359,0.00029979402,3.6983937e-7,0.49458277,0.011197917,0.4815366,0.002013859,0.002617884],"about_ca_topic_score_codex":0.00009990776,"about_ca_topic_score_gemma":0.00058841694,"teacher_disagreement_score":0.9093345,"about_ca_system_score_codex":0.00013857735,"about_ca_system_score_gemma":0.00057116157,"threshold_uncertainty_score":0.9999951},"labels":[],"label_agreement":null},{"id":"W1797017151","doi":"10.5555/2011814.2011818","title":"An O(m 2 )-depth quantum algorithm for the elliptic curve discrete logarithm problem over GF(2 m ) a","year":2009,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"Mathematics; Elliptic curve point multiplication; Elliptic curve; Discrete logarithm; Logarithm; Quantum algorithm; Homogeneous coordinates; Algorithm; Quantum; Polynomial; Discrete mathematics; Quantum computer; Post-quantum cryptography; Tripling-oriented Doche–Icart–Kohel curve; Schoof's algorithm; Mathematical analysis; Pure mathematics; Computer science; Public-key cryptography; Physics; Quantum mechanics; Quarter period","score_opus":0.011349961371549014,"score_gpt":0.26865371187899145,"score_spread":0.2573037505074424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1797017151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048327805,0.00014637235,0.992499,0.0012076545,0.00030386078,0.00065397116,0.000009787507,0.00019065652,0.00015593563],"genre_scores_gemma":[0.9100833,0.00008790881,0.08830441,0.0012907953,0.00007770766,0.000048170437,0.00009179841,0.00000661652,0.000009290922],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987559,0.00006243934,0.00041871192,0.00020947777,0.00028997974,0.0002635435],"domain_scores_gemma":[0.9990867,0.0001619315,0.0002181983,0.00026912303,0.00016484883,0.00009924711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046102714,0.00017477824,0.00014869128,0.00019964654,0.0004695929,0.0006768528,0.00035494717,0.000076175995,0.0000023735013],"category_scores_gemma":[0.000013344918,0.00012378872,0.00008357874,0.00043413573,0.000060736398,0.0025528565,0.00003651254,0.00013000677,0.000012329875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012419937,0.00004794676,0.00003208712,0.00002115643,0.000016729775,5.5447697e-7,0.0021433437,0.0047970507,0.0000118804355,0.2505537,0.0004053879,0.7419578],"study_design_scores_gemma":[0.0006388427,0.0004608145,0.011843079,0.000016726623,0.00001556041,0.000018758787,0.00023140931,0.93040556,0.000027193775,0.05325678,0.002895661,0.00018964075],"about_ca_topic_score_codex":0.00003383893,"about_ca_topic_score_gemma":0.000005143271,"teacher_disagreement_score":0.92560846,"about_ca_system_score_codex":0.000018926587,"about_ca_system_score_gemma":0.00004718143,"threshold_uncertainty_score":0.6526907},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030961371600425756,"score_gpt":0.22758354165613867,"score_spread":0.19662217005571292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1798342512","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002339267,0.0011291985,0.9753943,0.00091077207,0.002015908,0.000539314,0.0000045208512,0.00034334915,0.019428704],"genre_scores_gemma":[0.18679494,0.00013613855,0.80915487,0.0022565178,0.0011517131,0.000020783651,0.0000092387,0.00010405657,0.00037172216],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99411845,0.00006189089,0.0007113123,0.0021765912,0.0016055214,0.0013262372],"domain_scores_gemma":[0.9956582,0.0007439924,0.00040932812,0.0022281648,0.0005187275,0.00044156905],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015973287,0.0008394724,0.0007677347,0.0022224705,0.0004800798,0.0013956191,0.0051039034,0.00055431627,0.000019999019],"category_scores_gemma":[0.00007931334,0.0006593989,0.00024338638,0.001851422,0.0012659101,0.0008345609,0.0013466693,0.0013614566,0.00006429819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024423578,0.00011544427,0.00064831425,0.00016444732,0.00007781684,0.0007635402,0.0015699437,0.0061150715,0.0000701946,0.29390004,0.000033338903,0.6965174],"study_design_scores_gemma":[0.0037078098,0.003114163,0.0023317297,0.004958829,0.00011433622,0.0023258536,0.0000040847876,0.37502873,0.004566407,0.49441808,0.100875355,0.008554594],"about_ca_topic_score_codex":0.000065756205,"about_ca_topic_score_gemma":0.0007227882,"teacher_disagreement_score":0.68796283,"about_ca_system_score_codex":0.00027526822,"about_ca_system_score_gemma":0.00091149367,"threshold_uncertainty_score":0.999641},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01767769015688338,"score_gpt":0.24122421574292593,"score_spread":0.22354652558604254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1809742378","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7532316,0.0018536045,0.23975219,0.00046670978,0.0001118168,0.00024056622,0.000020600604,0.000104127335,0.004218783],"genre_scores_gemma":[0.992092,0.00037616008,0.0072045913,0.00025790435,0.00001307971,0.00000966304,0.000001829996,0.000005706401,0.000039039194],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99875605,0.00012595834,0.00025025246,0.00034039633,0.00027207338,0.00025525637],"domain_scores_gemma":[0.9989992,0.00010907782,0.00007731236,0.00066978676,0.000053000935,0.00009167018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002206359,0.00015453158,0.00028400365,0.00042901622,0.00023432057,0.000099908546,0.00069000054,0.00006976848,0.00010744632],"category_scores_gemma":[0.000005351608,0.000100492194,0.0005162055,0.004696368,0.0002831941,0.00013697827,0.000082735554,0.00010756124,0.0000028115805],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000714583,0.00067500107,0.2351714,0.000086012995,0.005016072,0.000026468751,0.0043555093,0.0049116733,0.0035632143,0.35455015,0.0021276125,0.38944542],"study_design_scores_gemma":[0.0009009444,0.0002891534,0.88699025,0.00006368266,0.0017294097,0.000024384502,0.00016263366,0.07780282,0.0031372898,0.009822682,0.01829905,0.0007776933],"about_ca_topic_score_codex":0.00008858378,"about_ca_topic_score_gemma":0.000050775772,"teacher_disagreement_score":0.6518189,"about_ca_system_score_codex":0.0000031161458,"about_ca_system_score_gemma":0.000017904262,"threshold_uncertainty_score":0.40979528},"labels":[],"label_agreement":null},{"id":"W1829892363","doi":"10.1007/3-540-47555-9_44","title":"On the Development of a Fast Elliptic Curve Cryptosystem","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Coprocessor; Smart card; Block (permutation group theory); Computer science; Elliptic Curve Digital Signature Algorithm; Cryptosystem; Embedded system; Development (topology); Key (lock); Arithmetic; Computer hardware; Elliptic curve cryptography; Mathematics; Operating system; Cryptography; Algorithm; Public-key cryptography; Geometry; Encryption","score_opus":0.023228337697772043,"score_gpt":0.2429639614934167,"score_spread":0.21973562379564465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1829892363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084166555,0.00031315492,0.99147516,0.00026095528,0.0009966329,0.00040840133,0.0000016387391,0.00006806954,0.0056342985],"genre_scores_gemma":[0.50354534,0.000015163995,0.49528953,0.000777085,0.00019605157,0.000011145575,0.0000015754921,0.000031500273,0.00013258457],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963456,0.00004534847,0.00070983364,0.0010198927,0.0013017523,0.00057760446],"domain_scores_gemma":[0.9966511,0.0012495364,0.00036986725,0.0013879518,0.00022112182,0.000120397526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017568897,0.00046246115,0.0004673483,0.0010109803,0.00033114047,0.00022881012,0.0036556488,0.00024054167,0.000018415027],"category_scores_gemma":[0.000063154956,0.0002929289,0.00017662557,0.0009885594,0.00071989483,0.00016242437,0.0008612921,0.0007140142,0.00004591549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009036977,0.00006447687,0.000045445136,0.00009275549,0.00003514913,0.000043320728,0.00398638,0.005117063,0.00013782168,0.3622556,0.000012339727,0.6282006],"study_design_scores_gemma":[0.0009917974,0.00092367997,0.0017688858,0.005571176,0.00003882459,0.00017575518,0.000005569176,0.29586688,0.03486583,0.65195864,0.0048723863,0.0029605879],"about_ca_topic_score_codex":0.0000051499433,"about_ca_topic_score_gemma":0.00007894167,"teacher_disagreement_score":0.62524,"about_ca_system_score_codex":0.00014712721,"about_ca_system_score_gemma":0.000556153,"threshold_uncertainty_score":0.99995226},"labels":[],"label_agreement":null},{"id":"W1832756347","doi":"10.1007/11894063_28","title":"Unified Point Addition Formulæ and Side-Channel Attacks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Side channel attack; Affine transformation; Computer science; Point (geometry); Elliptic curve; Cryptography; Channel (broadcasting); Arithmetic; Mathematics; Algorithm; Pure mathematics; Geometry; Computer network","score_opus":0.01128440881028721,"score_gpt":0.21986617519881588,"score_spread":0.20858176638852866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1832756347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010509413,0.0006640252,0.9885565,0.0008733841,0.0009424248,0.00034082518,0.000012110392,0.00016989844,0.008335722],"genre_scores_gemma":[0.59609157,0.00022674663,0.39937168,0.0025588528,0.00094660994,0.000024647818,0.000042635536,0.00007467696,0.00066256284],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967669,0.00002929448,0.00046041698,0.0013857036,0.00073221745,0.00062541984],"domain_scores_gemma":[0.998001,0.00041238285,0.00023439016,0.000999447,0.0001776064,0.00017519582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005529026,0.0004995362,0.00044518217,0.0010475434,0.00035347894,0.00057024014,0.0015938671,0.0003494503,0.000009585678],"category_scores_gemma":[0.000036184774,0.00044003566,0.00014468814,0.00062680914,0.0007843862,0.0006848045,0.0009845678,0.00067657925,0.000017239587],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012631863,0.00007393285,0.000033385644,0.000115681905,0.000028167555,0.00028223472,0.0009362714,0.022347461,0.00018525381,0.08421392,0.00044279866,0.8913283],"study_design_scores_gemma":[0.00048553656,0.00027379772,0.00084598566,0.00047205715,0.00001578096,0.00021740656,3.1010617e-7,0.2831665,0.0010637747,0.7106393,0.0018645779,0.0009549717],"about_ca_topic_score_codex":0.000060206254,"about_ca_topic_score_gemma":0.00014287191,"teacher_disagreement_score":0.8903733,"about_ca_system_score_codex":0.00010851644,"about_ca_system_score_gemma":0.00020009982,"threshold_uncertainty_score":0.99980515},"labels":[],"label_agreement":null},{"id":"W184408225","doi":"","title":"An Optimal Bound for Sum of Square Roots of Special Type of Integers","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Integer (computer science); Combinatorics; Square (algebra); Square number; Order (exchange); Upper and lower bounds; Discrete mathematics; Square-free integer; Integer sequence; Generating function","score_opus":0.013988539370128944,"score_gpt":0.26427108978911446,"score_spread":0.2502825504189855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W184408225","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72347397,0.000091727146,0.27134717,0.000059070106,0.00028285067,0.00015102736,0.000008276608,0.000019440753,0.0045664525],"genre_scores_gemma":[0.94183356,0.0000019139543,0.058016106,0.0000060159828,0.00009769791,0.0000011586858,0.0000026783932,0.0000031841796,0.000037667585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993769,0.000015394988,0.00022473717,0.00013571962,0.00013406473,0.00011320707],"domain_scores_gemma":[0.99941176,0.000054050168,0.00009357422,0.0002520327,0.00016380181,0.00002475885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011507128,0.0000604623,0.00015094949,0.00011803685,0.000021684456,0.00001267341,0.00035396998,0.00004020826,0.0000355518],"category_scores_gemma":[0.000009073857,0.00004917107,0.000092978786,0.0003244712,0.00010421302,0.00012971382,0.000037549187,0.000028895376,5.7157234e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003667231,0.0015080889,0.019325694,0.00038375676,0.00012299768,0.0000050678955,0.0011373344,0.0061244573,0.07414692,0.86106014,0.006474396,0.029344423],"study_design_scores_gemma":[0.0025133,0.004471893,0.17604649,0.00012898464,0.000069825546,0.00001052469,0.00069734885,0.047387574,0.7277682,0.036742248,0.0035797458,0.0005838644],"about_ca_topic_score_codex":0.00017561053,"about_ca_topic_score_gemma":0.000121030964,"teacher_disagreement_score":0.8243179,"about_ca_system_score_codex":0.0000040249574,"about_ca_system_score_gemma":0.000045435143,"threshold_uncertainty_score":0.20051381},"labels":[],"label_agreement":null},{"id":"W1850182876","doi":"10.1109/icassp.1985.1168491","title":"A VLSI implementation of an FFT/NTT computational unit","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Very-large-scale integration; Modularity (biology); Computer science; Interconnection; Fast Fourier transform; Residue number system; Table (database); Block (permutation group theory); Parallel computing; Computer architecture; Embedded system; Algorithm; Mathematics; Telecommunications","score_opus":0.013876443721498901,"score_gpt":0.3017866378917182,"score_spread":0.28791019417021935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1850182876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45763722,0.000024730318,0.53969735,0.0010130161,0.000043288383,0.00008299732,0.0000030473145,0.00007075483,0.00142757],"genre_scores_gemma":[0.7365619,0.0000013612538,0.2631977,0.00018775606,0.000020790916,0.0000019979586,0.000007278526,0.0000016968485,0.000019532761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99941504,0.000030495414,0.00015207773,0.00013162105,0.00017131204,0.000099425866],"domain_scores_gemma":[0.9996563,0.000033612774,0.000044918845,0.00015506291,0.00006484517,0.000045234246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011114612,0.000049736896,0.00005790072,0.000114846065,0.000050972674,0.000035717152,0.00025469117,0.00001720022,0.00013630147],"category_scores_gemma":[0.0000014259098,0.000043055665,0.00003402306,0.0003032664,0.000026452632,0.00039930653,0.00004796022,0.0000313175,0.000014709421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037028453,0.00020103106,0.0060938364,0.000012433887,0.000030484309,0.0000024506533,0.0017032527,0.005302133,0.0009596379,0.5475274,0.00039611806,0.43776754],"study_design_scores_gemma":[0.0017320184,0.0004197641,0.49614957,0.000010628821,0.0000197403,0.000036748483,0.00080973795,0.43420896,0.014530374,0.04669759,0.0050368756,0.00034799462],"about_ca_topic_score_codex":0.0000972162,"about_ca_topic_score_gemma":0.00020408457,"teacher_disagreement_score":0.5008298,"about_ca_system_score_codex":0.0000049359983,"about_ca_system_score_gemma":0.000037235233,"threshold_uncertainty_score":0.17557591},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013617853898622584,"score_gpt":0.28369485172872855,"score_spread":0.27007699783010597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1853876455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003613131,0.0006966423,0.99342084,0.00065822096,0.00034781775,0.00057565764,0.000024888259,0.000050242354,0.00061254454],"genre_scores_gemma":[0.6082142,0.000057074867,0.38990882,0.0015969716,0.00004888963,0.000033506938,0.000013915993,0.000028633756,0.00009799226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580437,0.00008714016,0.00083081186,0.0016126009,0.0010169857,0.00064807315],"domain_scores_gemma":[0.9972366,0.00035474196,0.00036772608,0.0014655137,0.0003647552,0.00021066846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011041041,0.00045763914,0.000768384,0.003951085,0.00015929276,0.00030303263,0.0027703631,0.0002209733,0.000031201416],"category_scores_gemma":[0.00008989683,0.0004282583,0.00021710346,0.0062426827,0.0003925523,0.0005726093,0.0004251182,0.0005022651,0.0000048490847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011197671,0.000962262,0.017005764,0.0006243087,0.00074467144,0.00047665866,0.04719664,0.50720847,0.0010909418,0.24603969,0.00016403188,0.17837457],"study_design_scores_gemma":[0.0024931184,0.0025297003,0.039878424,0.0028398896,0.0006688282,0.00006049344,0.00003825254,0.48107576,0.0073850458,0.45265627,0.004673045,0.005701191],"about_ca_topic_score_codex":0.00004416951,"about_ca_topic_score_gemma":0.0037845098,"teacher_disagreement_score":0.6046011,"about_ca_system_score_codex":0.00018713725,"about_ca_system_score_gemma":0.0003793664,"threshold_uncertainty_score":0.9998169},"labels":[],"label_agreement":null},{"id":"W1860659301","doi":"10.1109/newcas.2004.1359074","title":"A high speed 512-bit modular multiplier for a RSA chip","year":2004,"lang":"en","type":"article","venue":"The 2nd Annual IEEE Northeast Workshop on Circuits and Systems, 2004. NEWCAS 2004.","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Modular exponentiation; Computer science; Encryption; Arithmetic; Multiplier (economics); Modular design; Chip; Modular arithmetic; Binary number; Parallel computing; Exponentiation; Cryptography; Computer hardware; Algorithm; Public-key cryptography; Mathematics","score_opus":0.02642108040271294,"score_gpt":0.2502967153229758,"score_spread":0.22387563492026288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1860659301","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70155174,0.011269274,0.2693599,0.0054871733,0.0054339045,0.00466734,0.00040547,0.00075447164,0.001070768],"genre_scores_gemma":[0.9962607,0.000099167606,0.00055237423,0.0005840703,0.0010905641,0.00011495396,0.000016188009,0.00007009294,0.0012119063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959364,0.00021133966,0.00082312047,0.0011340141,0.00076595787,0.0011291837],"domain_scores_gemma":[0.99717593,0.00039596367,0.0003299021,0.0013529038,0.00030182782,0.00044348525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010108721,0.0006632489,0.0007834823,0.0003423748,0.001001154,0.00061303197,0.0012738965,0.00031769965,0.000008484159],"category_scores_gemma":[0.00006237559,0.00045881936,0.00034888138,0.0009878412,0.00028969249,0.00048735863,0.000111775764,0.0005291807,0.00007439879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005170312,0.0028071345,0.0014785844,0.00090529805,0.0013976156,0.00053101464,0.024865342,0.5829934,0.0023746707,0.20438372,0.010302497,0.16744372],"study_design_scores_gemma":[0.11234773,0.012540105,0.071042426,0.019382313,0.0027627228,0.010529244,0.042397223,0.29884368,0.0064413333,0.14365825,0.2519981,0.02805685],"about_ca_topic_score_codex":0.00065484404,"about_ca_topic_score_gemma":0.00016972945,"teacher_disagreement_score":0.29470897,"about_ca_system_score_codex":0.00010169968,"about_ca_system_score_gemma":0.00017557551,"threshold_uncertainty_score":0.9997864},"labels":[],"label_agreement":null},{"id":"W1862624742","doi":"10.1109/icassp.1979.1170664","title":"Hardware implementation of convolution using number theoretic transforms","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Flexibility (engineering); Field (mathematics); Gaussian; Binary number; Algorithm; Arithmetic; Discrete mathematics; Mathematics; Pure mathematics; Statistics; Physics","score_opus":0.012218738546936152,"score_gpt":0.28810971244790146,"score_spread":0.2758909739009653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1862624742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29789832,0.00003555684,0.69978166,0.00028711374,0.00005157972,0.000089307236,0.0000014201881,0.000041409574,0.0018136419],"genre_scores_gemma":[0.9438884,0.000013291367,0.055996094,0.00006647623,0.000015950265,0.0000020203217,0.0000013904503,0.0000026651373,0.000013692098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994268,0.000021166206,0.00016839444,0.00012191929,0.00013574272,0.00012599191],"domain_scores_gemma":[0.9997084,0.000016623446,0.000041202446,0.00015079085,0.000053901065,0.000029041637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012286792,0.000057088753,0.00007188348,0.00005456197,0.000054122076,0.000023438923,0.00017365978,0.000025102941,0.00025839097],"category_scores_gemma":[0.0000014411283,0.000043698918,0.000055161458,0.00026903255,0.000045528304,0.0003381192,0.000021002319,0.000033409808,0.000012711703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039598267,0.000056021356,0.010027613,0.00002675311,0.000024977038,9.131161e-7,0.0018700489,0.00028516114,0.0049819415,0.827071,0.00007875846,0.15557282],"study_design_scores_gemma":[0.0035834757,0.00024843257,0.15991896,0.0000838783,0.000099569275,0.00013623766,0.002136914,0.2841386,0.47552127,0.070421144,0.002844001,0.00086750655],"about_ca_topic_score_codex":0.00021861785,"about_ca_topic_score_gemma":0.00008143903,"teacher_disagreement_score":0.7566499,"about_ca_system_score_codex":0.000015260171,"about_ca_system_score_gemma":0.000031801574,"threshold_uncertainty_score":0.28292},"labels":[],"label_agreement":null},{"id":"W1866966051","doi":"10.1007/978-3-540-85538-5_17","title":"Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Supersingular elliptic curve; Hyperelliptic curve cryptography; Hyperelliptic curve; Automorphism; Pairing; Genus; Edwards curve; Elliptic curve; Computer science; Cryptography; Computation; Prime (order theory); Mathematics; Embedding; Finite field; Discrete mathematics; Schoof's algorithm; Algorithm; Pure mathematics; Elliptic curve cryptography; Combinatorics; Public-key cryptography; Encryption; Artificial intelligence","score_opus":0.020285270443268888,"score_gpt":0.2272133664758297,"score_spread":0.20692809603256082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1866966051","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010820945,0.0023741038,0.9900146,0.0008518696,0.0019979684,0.0006517669,0.0000072080966,0.00043405723,0.0025862958],"genre_scores_gemma":[0.4250722,0.00095245114,0.56847274,0.0040872497,0.00068792613,0.000022779788,0.000022942848,0.00013635289,0.0005453414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945722,0.00005638403,0.00064250396,0.001994776,0.0017068175,0.0010273132],"domain_scores_gemma":[0.9966745,0.0009240786,0.0003815196,0.0013646203,0.0003471785,0.00030812743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006293338,0.00080546504,0.0007985882,0.001582178,0.0008503329,0.00054680556,0.00297705,0.00026567842,0.000016427326],"category_scores_gemma":[0.00004707283,0.00067232345,0.00022105113,0.0017235798,0.0013052541,0.00048366789,0.0008381109,0.0012126162,0.000086794455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014698868,0.00013137939,0.000118654345,0.00019129518,0.000052031137,0.0005713552,0.0012583183,0.77712744,0.00003614768,0.009219559,0.00031520633,0.2109639],"study_design_scores_gemma":[0.0007906124,0.0008272447,0.0005231859,0.0041173096,0.000036018846,0.00088347716,5.64734e-7,0.97952175,0.00060832064,0.008852338,0.0024099532,0.0014291977],"about_ca_topic_score_codex":0.000031367996,"about_ca_topic_score_gemma":0.000025275081,"teacher_disagreement_score":0.4239901,"about_ca_system_score_codex":0.00025687928,"about_ca_system_score_gemma":0.0005828948,"threshold_uncertainty_score":0.9995728},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007210403771848686,"score_gpt":0.23670329151517405,"score_spread":0.22949288774332538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1880212920","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000011491123,0.0009333841,0.4498116,0.00048201767,0.0005256636,0.0002908255,0.0000042359975,0.00033286,0.54761827],"genre_scores_gemma":[0.00002921389,0.00014270526,0.24470213,0.0020777378,0.00029367855,0.00003174108,0.000012248717,0.00004554721,0.752665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973629,0.000034945744,0.00047498243,0.00094871025,0.0006181233,0.0005602985],"domain_scores_gemma":[0.99773,0.00010740824,0.000111047506,0.0015195005,0.00015789762,0.00037410288],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002351316,0.00047680974,0.000449284,0.0010478392,0.00014945219,0.0003091182,0.002250283,0.00034379069,0.00018398065],"category_scores_gemma":[0.000016956323,0.00040897125,0.00055158994,0.0008597066,0.00010949811,0.00019079605,0.0005432816,0.00041366045,0.0009725675],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020141847,0.00004577527,0.0000106067155,0.000042993677,0.00006575361,0.00007118703,0.00020510406,0.00009667646,0.000008955535,0.8045745,0.1791205,0.015755946],"study_design_scores_gemma":[0.00020090883,0.00017195105,0.000076765224,0.0001714935,0.000024101604,0.000023130471,0.000002791579,0.000051982617,0.00007739868,0.13422741,0.86439747,0.00057462737],"about_ca_topic_score_codex":0.00006703436,"about_ca_topic_score_gemma":0.00006534314,"teacher_disagreement_score":0.6852769,"about_ca_system_score_codex":0.00018988807,"about_ca_system_score_gemma":0.0011122844,"threshold_uncertainty_score":0.9998362},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017317190295271317,"score_gpt":0.24719921451019622,"score_spread":0.2298820242149249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W189254053","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008965838,0.004422442,0.99170554,0.000918854,0.0016476632,0.000752346,0.000016325339,0.0002450356,0.00020211175],"genre_scores_gemma":[0.040910926,0.00020972574,0.95570755,0.001635384,0.0013391324,0.000011645736,0.000021794613,0.000067494184,0.00009634041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995295,0.00006382857,0.00072853075,0.0018579188,0.0010110212,0.0010437309],"domain_scores_gemma":[0.9961386,0.0015263341,0.0003334832,0.0014001814,0.00035409565,0.0002473454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001539517,0.000702544,0.00093959214,0.0011080629,0.0006067456,0.0005814959,0.003726234,0.00037862247,0.0000056052186],"category_scores_gemma":[0.000103362014,0.00064244325,0.0004214858,0.0008076387,0.0010593075,0.00033097342,0.0010711732,0.00074387394,0.000018414632],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001750517,0.000020213249,0.00008241208,0.0002553932,0.000044212145,0.000023353328,0.0005470939,0.0022177899,0.000032905697,0.019912397,0.000062964384,0.9767995],"study_design_scores_gemma":[0.00039800594,0.00038609566,0.00015475164,0.0018144889,0.000051288927,0.000060580453,3.369055e-7,0.8490806,0.0006954744,0.14331193,0.003021956,0.0010244765],"about_ca_topic_score_codex":0.000021680007,"about_ca_topic_score_gemma":0.000011380628,"teacher_disagreement_score":0.97577506,"about_ca_system_score_codex":0.00013447001,"about_ca_system_score_gemma":0.00035594136,"threshold_uncertainty_score":0.9996027},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014799100465216864,"score_gpt":0.23481036906152394,"score_spread":0.22001126859630707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1920416369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036693216,0.0009906103,0.9931827,0.00027915247,0.00084953464,0.0002664277,0.000005219102,0.000110212844,0.0039492203],"genre_scores_gemma":[0.7735946,0.00006235723,0.2255111,0.00036758426,0.00024117432,0.0000060543075,0.000012792497,0.000025573267,0.00017876049],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724716,0.000030291934,0.0004966299,0.0010420016,0.0007779904,0.0004059015],"domain_scores_gemma":[0.997853,0.00027058634,0.00033585794,0.0011613322,0.0002964606,0.00008280011],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045003908,0.00036510208,0.00041524996,0.001043315,0.00015392374,0.00024756006,0.0026678056,0.00034910417,0.000012161902],"category_scores_gemma":[0.000032575357,0.00031993058,0.00014998646,0.0010363854,0.00068928936,0.0003741948,0.0005027451,0.0005824957,0.000009297363],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011798752,0.000114078575,0.00016529197,0.000109769724,0.000028885444,0.00007066971,0.00064919627,0.08909379,0.004607207,0.08003943,0.00017569591,0.8249342],"study_design_scores_gemma":[0.00068594824,0.0004119822,0.0058136247,0.0007435012,0.00002955791,0.000049711027,1.9077775e-7,0.51190764,0.046334766,0.42912835,0.003368802,0.0015259064],"about_ca_topic_score_codex":0.00004771481,"about_ca_topic_score_gemma":0.000029944244,"teacher_disagreement_score":0.8234083,"about_ca_system_score_codex":0.00007823771,"about_ca_system_score_gemma":0.00031912563,"threshold_uncertainty_score":0.99992526},"labels":[],"label_agreement":null},{"id":"W1939102949","doi":"10.1109/icassp.1986.1169076","title":"Computation of complex number theoretic transforms using quadratic residue number systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Residue number system; Chinese remainder theorem; Mathematics; Quadratic residue; Computation; Complex conjugate; Multiplication (music); Discrete mathematics; Moduli; Finite field; Arithmetic; Algorithm; Combinatorics; Mathematical analysis","score_opus":0.025355567953593564,"score_gpt":0.28780282312332506,"score_spread":0.2624472551697315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1939102949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14980711,0.00006886191,0.8343612,0.000387542,0.00014963097,0.0002478375,0.0000019204047,0.000122279,0.014853595],"genre_scores_gemma":[0.9173748,0.000009202084,0.082407475,0.000090510424,0.000042692856,0.000004761853,0.000002540054,0.000010837326,0.0000571844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845123,0.00012691053,0.00049068657,0.00028904327,0.0003652285,0.00027688395],"domain_scores_gemma":[0.9991859,0.00012036971,0.00012737286,0.0003369714,0.00014331934,0.00008605537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003323904,0.00016507004,0.0002755403,0.0000913127,0.0001302801,0.00012475983,0.00042858376,0.00007672477,0.00013455837],"category_scores_gemma":[0.0000085446845,0.00012656157,0.0001139814,0.00061289786,0.00014895425,0.00034137678,0.000049196387,0.000102672246,0.000112442474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018151939,0.00029383978,0.0063711344,0.00028407315,0.00009196767,0.000010029259,0.0024383273,0.040758777,0.0017466283,0.9339913,0.00057324616,0.013422505],"study_design_scores_gemma":[0.0006855466,0.000044059463,0.009646605,0.00011652185,0.000031859767,0.00018064879,0.0001955337,0.9757984,0.0018950737,0.010752551,0.00032996674,0.0003231927],"about_ca_topic_score_codex":0.00056870485,"about_ca_topic_score_gemma":0.00005059591,"teacher_disagreement_score":0.93503964,"about_ca_system_score_codex":0.000030128711,"about_ca_system_score_gemma":0.000047734236,"threshold_uncertainty_score":0.5161031},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03090075671251214,"score_gpt":0.25487026887910497,"score_spread":0.22396951216659283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963863611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1773042,0.000046129568,0.82109034,0.00041911798,0.0005201676,0.0004034174,0.00002085688,0.000121435056,0.00007434441],"genre_scores_gemma":[0.88962513,0.000004067584,0.10995561,0.00023801767,0.000054643468,0.00009768484,0.0000022181268,0.000012174486,0.000010449697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987791,0.000047043166,0.00023250909,0.00036152644,0.00014129432,0.00043849656],"domain_scores_gemma":[0.99901366,0.000331797,0.00005143718,0.00038807717,0.000030058925,0.00018496803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014659716,0.00019006648,0.00017472173,0.00038377807,0.00033498486,0.00009288094,0.00033723286,0.00005118069,0.0000050090944],"category_scores_gemma":[0.0000023149485,0.0001807274,0.00012574602,0.00035131688,0.00014434007,0.00021044095,0.0000072651887,0.00019458093,0.000005939242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049159257,0.007895916,0.0029200935,0.00034002063,0.00022223078,0.000018740355,0.0105987,0.24058528,0.013617499,0.008225444,0.00043883338,0.7146457],"study_design_scores_gemma":[0.009299259,0.00074344786,0.03863967,0.0002901357,0.00008104941,0.0002912184,0.00018113811,0.6384623,0.30625805,0.0024575274,0.0016099721,0.0016862391],"about_ca_topic_score_codex":0.000094843796,"about_ca_topic_score_gemma":0.0001357743,"teacher_disagreement_score":0.7129594,"about_ca_system_score_codex":0.000034991863,"about_ca_system_score_gemma":0.00002075037,"threshold_uncertainty_score":0.7369849},"labels":[],"label_agreement":null},{"id":"W1964973855","doi":"10.1109/tc.2010.138","title":"Hybrid Binary-Ternary Number System for Elliptic Curve Cryptosystems","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Bulgarian Academy of Sciences; Centre National de la Recherche Scientifique; Nanyang Technological University","keywords":"Scalar multiplication; Elliptic curve cryptography; Binary number; Hessian form of an elliptic curve; Elliptic curve; Ternary operation; Mathematics; Cryptosystem; Arithmetic; Integer (computer science); Scalar (mathematics); Elliptic curve point multiplication; Algorithm; Schoof's algorithm; Computer science; Discrete mathematics; Cryptography; Public-key cryptography; Pure mathematics; Encryption; Quarter period; Geometry","score_opus":0.010001962168924737,"score_gpt":0.23005373325235662,"score_spread":0.22005177108343188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964973855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073274344,0.000016701877,0.9136802,0.00026498965,0.011382635,0.0005430621,0.000028159557,0.0005836633,0.000226244],"genre_scores_gemma":[0.93224,0.0000063055268,0.06720634,0.00011901062,0.00020584169,0.00011978529,0.0000023036926,0.00002966891,0.00007072292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980995,0.00008352481,0.00038651927,0.00063858135,0.00032249527,0.0004694015],"domain_scores_gemma":[0.99831337,0.00037056667,0.000113414244,0.0008701867,0.00011376401,0.00021872],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026861028,0.00029601762,0.000301486,0.0002822554,0.00045011402,0.00025912438,0.0010119643,0.00011241555,0.00001338298],"category_scores_gemma":[0.0000015620652,0.0002761309,0.0003938501,0.00039607278,0.000089081914,0.00038410732,0.0000064941023,0.00042347563,0.00018742985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006637137,0.0055740084,0.0010142637,0.0030876165,0.0024598676,0.0011207177,0.0044600773,0.25295016,0.061791196,0.15533486,0.019300597,0.4922429],"study_design_scores_gemma":[0.0019869716,0.0004908345,0.00022826986,0.00030619424,0.000079458,0.0008943542,0.00005963718,0.9484392,0.039196536,0.00058295,0.006824876,0.00091074355],"about_ca_topic_score_codex":0.000055934637,"about_ca_topic_score_gemma":0.000013166306,"teacher_disagreement_score":0.8589657,"about_ca_system_score_codex":0.000047638696,"about_ca_system_score_gemma":0.000061011924,"threshold_uncertainty_score":0.99996907},"labels":[],"label_agreement":null},{"id":"W1965196198","doi":"10.1002/rsa.10011","title":"Analysis of Rabin's irreducibility test for polynomials over finite fields","year":2001,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"University of Waterloo","keywords":"Irreducibility; Mathematics; Degree (music); Combinatorics; Prime (order theory); Prime factor; Finite field; Divisor (algebraic geometry); Polynomial; Discrete mathematics; Expected value; Irreducible polynomial; Pure mathematics; Statistics; Matrix polynomial","score_opus":0.0115574254576437,"score_gpt":0.26212360890644865,"score_spread":0.25056618344880494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965196198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4155715,0.0011522982,0.58187395,0.00040492855,0.000320793,0.0003920621,0.00009415511,0.00004957129,0.00014069917],"genre_scores_gemma":[0.9832722,0.00019834987,0.016245306,0.00011877505,0.00008915728,0.0000132434725,0.00001012071,0.000005061104,0.00004777801],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99881864,0.00004494101,0.00031914155,0.00042250194,0.00016371794,0.0002310614],"domain_scores_gemma":[0.99810565,0.0011472877,0.00012735155,0.00046282765,0.00006936646,0.00008753723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034042937,0.00015202764,0.00047636405,0.00027927783,0.00013642607,0.000087994216,0.0003149911,0.000097834025,0.000037708334],"category_scores_gemma":[0.00017996278,0.00011254064,0.00033505214,0.00082607823,0.00010541418,0.00013536359,0.00008278525,0.000082082224,1.4208993e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008153413,0.0004375939,0.12679626,0.0002191685,0.0034888734,0.000032799377,0.0030810933,0.0074389777,0.0029575494,0.015468903,0.0010111306,0.8382523],"study_design_scores_gemma":[0.0107371155,0.00042969146,0.54112065,0.000026161486,0.0011100608,0.000023055743,0.00008641381,0.39298955,0.0031143222,0.046418823,0.0032971383,0.0006470164],"about_ca_topic_score_codex":0.00013527645,"about_ca_topic_score_gemma":0.000038425635,"teacher_disagreement_score":0.8376053,"about_ca_system_score_codex":0.0000055185815,"about_ca_system_score_gemma":0.000023149085,"threshold_uncertainty_score":0.45892742},"labels":[],"label_agreement":null},{"id":"W1965877647","doi":"10.1090/s0025-5718-01-01298-4","title":"The index calculus method using non-smooth polynomials","year":2001,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Toronto","funders":"","keywords":"Mathematics; Logarithm; Limit (mathematics); Interval (graph theory); Upper and lower bounds; Combinatorics; Degree (music); Heuristic; Variable (mathematics); Prime (order theory); Discrete mathematics; Calculus (dental); Mathematical analysis; Mathematical optimization","score_opus":0.020102899231603057,"score_gpt":0.30791873626531036,"score_spread":0.2878158370337073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965877647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06366875,0.00008257268,0.9350999,0.00019869131,0.00015294914,0.00015938096,3.955931e-7,0.000031766845,0.0006055863],"genre_scores_gemma":[0.5867613,0.000008561739,0.41316006,0.000022523376,0.000023106559,0.0000025592956,3.586905e-7,0.000005844634,0.000015705637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897695,0.0000696918,0.00035619971,0.00014413489,0.00028041936,0.000172597],"domain_scores_gemma":[0.9987655,0.0005351792,0.0002496205,0.00029676425,0.00011246395,0.000040416347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067349937,0.00009939964,0.00017187613,0.00011969715,0.00019993796,0.00011610145,0.0004405131,0.000045582725,0.0000015601628],"category_scores_gemma":[0.0000402519,0.0000700014,0.00009083753,0.0005174621,0.000056126555,0.00015370948,0.00011033528,0.00007107425,0.0000042376564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003157564,0.00071541825,0.00080976833,0.00032308407,0.00025109676,0.000028947032,0.01358123,0.32509565,0.013942228,0.24867205,0.0006016093,0.3959473],"study_design_scores_gemma":[0.00018924134,0.000027213728,0.00093436666,0.00003444595,0.0000113697615,0.000025086745,0.00015084844,0.9416228,0.0016282822,0.055201914,0.00008931601,0.000085112544],"about_ca_topic_score_codex":0.000037072965,"about_ca_topic_score_gemma":0.0000082099305,"teacher_disagreement_score":0.61652714,"about_ca_system_score_codex":0.00001642296,"about_ca_system_score_gemma":0.00004273477,"threshold_uncertainty_score":0.28545743},"labels":[],"label_agreement":null},{"id":"W1969682901","doi":"10.1109/iscas.2013.6572409","title":"A GPU implementation of the Montgomery multiplication algorithm for elliptic curve cryptography","year":2013,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Elliptic curve cryptography; Parallel computing; Multiplication (music); Elliptic Curve Digital Signature Algorithm; Throughput; Cryptography; Elliptic curve; Algorithm; Acceleration; General-purpose computing on graphics processing units; Computational science; Public-key cryptography; Encryption; Mathematics; Graphics; Computer graphics (images); Operating system","score_opus":0.009416615870264128,"score_gpt":0.2524335386676513,"score_spread":0.24301692279738715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969682901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0433467,0.00010095611,0.95440125,0.0008293328,0.0001602713,0.00096734514,0.0000049246964,0.000055135653,0.0001340988],"genre_scores_gemma":[0.6530233,0.000020442381,0.34641722,0.00016515987,0.000027911317,0.00031375277,0.000003343636,0.0000061899423,0.000022681763],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99913156,0.00003936726,0.00024607053,0.00022249126,0.00017665623,0.00018384545],"domain_scores_gemma":[0.999082,0.000113622154,0.0001295578,0.00046237954,0.00017165003,0.000040741965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001413542,0.000092151306,0.00009778072,0.00012828842,0.00012237068,0.00006645294,0.00053294166,0.000036770885,0.00003086667],"category_scores_gemma":[0.000006266735,0.00005921866,0.00019057715,0.00065364974,0.00005813718,0.00032845873,0.00009124639,0.00004570806,0.000008903818],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.996562e-7,0.00010764997,0.009914164,0.000025288216,0.000057062836,5.757128e-8,0.0007453839,0.000020360949,0.005896768,0.0658458,0.0015604444,0.915826],"study_design_scores_gemma":[0.0015927922,0.0002342611,0.6352921,0.00002541727,0.000043842774,0.0000052180926,0.00091346307,0.21731701,0.072179854,0.06988412,0.0021170063,0.00039491174],"about_ca_topic_score_codex":0.0004888608,"about_ca_topic_score_gemma":0.000040388088,"teacher_disagreement_score":0.9154311,"about_ca_system_score_codex":0.000007435877,"about_ca_system_score_gemma":0.00002344244,"threshold_uncertainty_score":0.24148668},"labels":[],"label_agreement":null},{"id":"W1969742447","doi":"10.1049/iet-ifs.2010.0271","title":"On the generalisation of special moduli for faster interleaved montgomery modular multiplication","year":2013,"lang":"en","type":"article","venue":"IET Information Security","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Instituto de Sistemas Complejos de Ingeniería","keywords":"Moduli; Elliptic curve cryptography; Modular arithmetic; Elliptic curve; Multiplication (music); Mathematics; Modular equation; Integer (computer science); Arithmetic; Cryptography; Prime (order theory); Elliptic curve point multiplication; Modular design; Discrete mathematics; Algebra over a field; Computer science; Algorithm; Pure mathematics; Public-key cryptography; Moduli of algebraic curves; Moduli space; Combinatorics","score_opus":0.011574760582755084,"score_gpt":0.2114745024822962,"score_spread":0.19989974189954113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969742447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49755192,0.000007040362,0.49788466,0.002179133,0.00031355664,0.0008177862,0.000014329475,0.000046099893,0.0011854796],"genre_scores_gemma":[0.99499327,0.0000053623885,0.0040651374,0.00063028105,0.00012020401,0.00014768029,0.000027243406,0.0000027162835,0.0000081091675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916345,0.00004261307,0.0003420876,0.00010409436,0.0002213365,0.00012639225],"domain_scores_gemma":[0.9989766,0.00012689737,0.00021196365,0.0003943735,0.00025649174,0.00003366691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025033377,0.00009152169,0.000096190764,0.00013005278,0.000108911205,0.00014131167,0.0003832005,0.00006000913,0.0000344211],"category_scores_gemma":[0.00006820137,0.000063951295,0.000098282326,0.00022404293,0.000043122964,0.0016735794,0.000057158097,0.00007867388,0.000068173504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004162892,0.00015275342,0.00021162686,0.00009511968,0.000052825457,6.795694e-8,0.027491538,0.0030008678,0.0017173105,0.8693331,0.017688066,0.08021513],"study_design_scores_gemma":[0.00066863373,0.0001392877,0.013169243,0.000023672355,0.0000069566436,0.0000016218056,0.0003829478,0.8506668,0.011793788,0.11743395,0.0055221347,0.00019092378],"about_ca_topic_score_codex":0.000060994716,"about_ca_topic_score_gemma":0.0000066539233,"teacher_disagreement_score":0.84766597,"about_ca_system_score_codex":0.000018649493,"about_ca_system_score_gemma":0.000014274114,"threshold_uncertainty_score":0.26078582},"labels":[],"label_agreement":null},{"id":"W1970247635","doi":"10.1016/j.ipl.2010.12.014","title":"Using 5-isogenies to quintuple points on elliptic curves","year":2010,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Elliptic curve; Supersingular elliptic curve; Computer science; Pure mathematics","score_opus":0.01480046710351335,"score_gpt":0.2552411734903963,"score_spread":0.24044070638688297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970247635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47313267,0.000031216696,0.51460814,0.010809574,0.00050393224,0.00016948787,0.0000014035251,0.00019937352,0.00054415915],"genre_scores_gemma":[0.86965156,0.0000037825412,0.09729653,0.03296319,0.00005827613,0.000012061278,0.000003693362,0.0000062379727,0.0000046686796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904716,0.000015253022,0.00025891513,0.00013684231,0.0003094346,0.0002323951],"domain_scores_gemma":[0.99939686,0.000030815143,0.00011831108,0.00028070624,0.0000841623,0.00008913548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022995882,0.00012030886,0.00009571933,0.0003356046,0.0002428149,0.0004202412,0.00047201893,0.000039866958,0.000009218546],"category_scores_gemma":[0.00006836635,0.000105892635,0.000047854384,0.00060156896,0.00004729778,0.0022849103,0.000074498865,0.00019232956,0.00013764489],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007948464,0.0002705773,0.0040687323,0.0022324321,0.000095332056,0.000023895434,0.03597381,0.015268616,0.25078878,0.048924208,0.025496883,0.61677724],"study_design_scores_gemma":[0.0034662657,0.0006932169,0.048761155,0.0048931893,0.00012415343,0.00057233917,0.0009091805,0.53962684,0.23807155,0.008423945,0.14950563,0.0049525145],"about_ca_topic_score_codex":0.000011291694,"about_ca_topic_score_gemma":0.0000023368418,"teacher_disagreement_score":0.61182475,"about_ca_system_score_codex":0.00001548122,"about_ca_system_score_gemma":0.00004375289,"threshold_uncertainty_score":0.43181762},"labels":[],"label_agreement":null},{"id":"W1972898603","doi":"10.1007/s10440-011-9620-z","title":"Cubic Curves, Finite Geometry and Cryptography","year":2011,"lang":"en","type":"article","venue":"Acta Applicandae Mathematicae","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; University of Calgary","funders":"","keywords":"Elliptic curve; Schoof's algorithm; Cryptography; Group (periodic table); Finite field; Finite geometry; Counting points on elliptic curves; Construct (python library)","score_opus":0.018672192672072825,"score_gpt":0.21278175413781925,"score_spread":0.19410956146574643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972898603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09002053,0.00390297,0.867452,0.0015121909,0.00015865642,0.0010510632,0.000013796658,0.0007338734,0.035154913],"genre_scores_gemma":[0.8495852,0.00092008786,0.14839616,0.00086109946,0.000032351345,0.00013168891,0.000002356123,0.000024208355,0.000046867583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984771,0.000039420807,0.0003167843,0.0004792102,0.00029214588,0.00039532638],"domain_scores_gemma":[0.99845743,0.00027271154,0.00012205708,0.00087980274,0.00004853518,0.0002194715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003648706,0.00023561962,0.00031734537,0.00029023952,0.00015811244,0.00009103578,0.0008468846,0.000084542975,0.00013690286],"category_scores_gemma":[0.000045241908,0.00019049927,0.0001319124,0.001089896,0.00021438039,0.00027764202,0.00034515897,0.0001873339,0.000054248372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001565776,0.0007189112,0.0021552285,0.0011841491,0.00023086958,0.000051536543,0.0031516794,2.7968386e-7,0.0014785746,0.9515656,0.0076520015,0.031795472],"study_design_scores_gemma":[0.0016279266,0.00039753775,0.024886644,0.0009162837,0.00020882861,0.00037088746,0.00024301681,0.0038095324,0.009536085,0.92829263,0.027927896,0.0017827066],"about_ca_topic_score_codex":0.000020964597,"about_ca_topic_score_gemma":0.00000408392,"teacher_disagreement_score":0.75956464,"about_ca_system_score_codex":0.000005736008,"about_ca_system_score_gemma":0.000021661728,"threshold_uncertainty_score":0.7768335},"labels":[],"label_agreement":null},{"id":"W1974748699","doi":"10.2478/v10127-010-0030-9","title":"Cryptographic aspects of real hyperelliptic curves","year":2010,"lang":"en","type":"article","venue":"Tatra Mountains Mathematical Publications","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Hyperelliptic curve cryptography; Hyperelliptic curve; Cryptographic protocol; Cryptography; Discrete logarithm; Mathematics; Divisor (algebraic geometry); Logarithm; Cryptographic primitive; Arithmetic; Theoretical computer science; Algebra over a field; Elliptic curve cryptography; Discrete mathematics; Public-key cryptography; Algorithm; Computer science; Pure mathematics; Encryption; Computer security; Mathematical analysis","score_opus":0.013965796770943029,"score_gpt":0.25973252318464424,"score_spread":0.2457667264137012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974748699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2040511,0.00031829765,0.577221,0.018760115,0.00032621878,0.0009802454,0.000022454335,0.00096552743,0.19735506],"genre_scores_gemma":[0.91728747,0.00015794285,0.0821014,0.0002190677,0.00004577133,0.00008496581,0.000007930312,0.000015439153,0.000080035556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983029,0.000050690265,0.00049043837,0.0003633555,0.00043786244,0.0003547804],"domain_scores_gemma":[0.9975962,0.00044379896,0.00016947309,0.0012858419,0.000274203,0.00023047853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047710325,0.00017397996,0.00027215134,0.0004234797,0.00017016313,0.00012951235,0.001276956,0.000105806015,0.00019798585],"category_scores_gemma":[0.0003276189,0.00014661081,0.00019959216,0.0017853765,0.00039009814,0.00050245045,0.0001525147,0.00035558364,0.00008014749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.265578e-7,0.00040098958,0.00033095907,0.00014749332,0.000026991145,7.373153e-7,0.00018533078,0.0000019786971,0.0033974461,0.9943709,0.00043689416,0.00069965934],"study_design_scores_gemma":[0.00027340083,0.000087771645,0.033543576,0.000095639036,0.00005575544,0.00007189608,0.000056494,0.0041063665,0.0011993614,0.958505,0.0016780159,0.00032675578],"about_ca_topic_score_codex":0.000025236724,"about_ca_topic_score_gemma":0.000046230503,"teacher_disagreement_score":0.71323633,"about_ca_system_score_codex":0.000009339734,"about_ca_system_score_gemma":0.00014278953,"threshold_uncertainty_score":0.5978615},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009798990862371267,"score_gpt":0.21179828300502893,"score_spread":0.20199929214265766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978602192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011655154,0.00086149765,0.9950203,0.00030722603,0.0003783119,0.0018638246,0.00011160374,0.00012891533,0.00016286023],"genre_scores_gemma":[0.96625274,0.000062611995,0.03219696,0.00012927808,0.00010819596,0.0011596015,0.000005976341,0.000028989056,0.00005564058],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984117,0.000092559916,0.0003046836,0.00062785763,0.00021147559,0.00035169875],"domain_scores_gemma":[0.9986777,0.00044692412,0.00010122836,0.00042098993,0.00010849495,0.0002446866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004081156,0.00025439722,0.0003124481,0.00030551665,0.000642824,0.00020851368,0.00023796671,0.0001487338,0.000001291162],"category_scores_gemma":[0.000006490272,0.00021711584,0.00022316756,0.00037813393,0.00022005984,0.000046663226,0.000002136288,0.00014176025,7.355309e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014088631,0.00020205221,0.0000067197234,0.0005175567,0.00023406708,0.0000010870672,0.0010028124,0.016533451,0.005343295,0.0926151,0.00005156215,0.8834782],"study_design_scores_gemma":[0.0054125837,0.0014340858,0.00020554198,0.0004135508,0.00038834944,0.00034729694,0.0008545231,0.87046903,0.002128168,0.009214109,0.10762878,0.001504],"about_ca_topic_score_codex":0.000009789639,"about_ca_topic_score_gemma":0.000007954694,"teacher_disagreement_score":0.96508723,"about_ca_system_score_codex":0.000012971321,"about_ca_system_score_gemma":0.00003753357,"threshold_uncertainty_score":0.8853727},"labels":[],"label_agreement":null},{"id":"W1978673726","doi":"10.1145/1015047.1015053","title":"Efficient digit-serial normal basis multipliers over binary extension fields","year":2004,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Numerical digit; Computer science; Redundancy (engineering); Binary number; Arithmetic; Parallel computing; Basis (linear algebra); Normal basis; Extension (predicate logic); Algorithm; Computer hardware; Mathematics; Galois theory; Discrete mathematics; Programming language","score_opus":0.01261738900410144,"score_gpt":0.2400863413994231,"score_spread":0.22746895239532164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978673726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35191724,0.000070333415,0.6441902,0.0002969498,0.0026955262,0.00027711067,0.000004240184,0.00038016663,0.00016827],"genre_scores_gemma":[0.9754377,0.000008705928,0.024135128,0.0001753809,0.00016606462,0.000016304099,0.00000237521,0.000022941704,0.000035380443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975706,0.000120974284,0.0005041097,0.00072570966,0.0005285277,0.0005501274],"domain_scores_gemma":[0.9979476,0.00028442903,0.00014719547,0.0013243685,0.00010133679,0.00019510217],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030638973,0.00030979098,0.0003240555,0.00039435102,0.00070476485,0.00030261386,0.0010252607,0.00020487257,0.000010415541],"category_scores_gemma":[0.000029189758,0.00028396596,0.00029260875,0.0008603714,0.00008295856,0.00013743331,0.000056518882,0.0004096504,0.00006974108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037925394,0.0003451622,0.00002065228,0.000040015326,0.00006162929,0.00004544293,0.0016704663,0.9814413,0.000712752,0.0010962551,0.00005310686,0.014475295],"study_design_scores_gemma":[0.005783368,0.0010026767,0.003530329,0.0008579328,0.00009318908,0.0003418068,0.0010217802,0.97720474,0.007338024,0.00074856606,0.000700781,0.0013768345],"about_ca_topic_score_codex":0.00027026644,"about_ca_topic_score_gemma":0.000008466751,"teacher_disagreement_score":0.6235205,"about_ca_system_score_codex":0.00011178137,"about_ca_system_score_gemma":0.000076819415,"threshold_uncertainty_score":0.99996126},"labels":[],"label_agreement":null},{"id":"W1980718426","doi":"10.3934/amc.2014.8.459","title":"Smoothness testing of polynomials over finite fields","year":2014,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique","keywords":"Smoothness; Mathematics; Degree (music); Integer (computer science); Finite field; Factorization; Function (biology); Field (mathematics); Bernstein polynomial; Point (geometry); Applied mathematics; Pure mathematics; Discrete mathematics; Mathematical analysis; Algorithm; Geometry","score_opus":0.025847021541919042,"score_gpt":0.3034912473268492,"score_spread":0.27764422578493014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980718426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027011828,0.0029980247,0.9391347,0.00044078808,0.00008454519,0.00018959217,0.0000042554784,0.000048099137,0.030088136],"genre_scores_gemma":[0.602714,0.0002688397,0.39698368,0.000014642247,0.000002998211,0.0000073094766,5.384639e-7,0.0000026256203,0.000005379093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992094,0.0000730956,0.0004143888,0.000085764324,0.00011964557,0.000097711905],"domain_scores_gemma":[0.9948855,0.003184718,0.00027416178,0.0015739731,0.000062414416,0.000019221496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042291766,0.000066376044,0.00019732506,0.00014078098,0.000052748153,0.000011820621,0.0016410856,0.0000363872,0.0000025830134],"category_scores_gemma":[0.0005613734,0.000060929266,0.000047108668,0.0005484393,0.00017309765,0.00026942356,0.00038024646,0.00009934076,9.825786e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010950245,0.00035675883,0.0038261702,0.00022377835,0.000010283787,1.3128926e-7,0.001869441,0.0025456985,0.00056114246,0.94543236,0.000009174824,0.045163985],"study_design_scores_gemma":[0.00033634735,0.00007724387,0.0046350835,0.0004744975,0.000012146359,0.0000020854002,0.00013040796,0.19972207,0.0032318018,0.78923136,0.0019771764,0.00016978556],"about_ca_topic_score_codex":0.000019460396,"about_ca_topic_score_gemma":0.00005384417,"teacher_disagreement_score":0.57570213,"about_ca_system_score_codex":0.0000040772975,"about_ca_system_score_gemma":0.000016448488,"threshold_uncertainty_score":0.30495727},"labels":[],"label_agreement":null},{"id":"W1981349468","doi":"10.1016/j.ffa.2005.05.001","title":"Algebraic curves and cryptography","year":2005,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Cryptography; Mathematics; Elliptic curve cryptography; Hyperelliptic curve cryptography; Elliptic curve; Counting points on elliptic curves; Algebraic number; Post-quantum cryptography; Finite field; Public-key cryptography; Key size; Key (lock); Algebra over a field; Algebraic curve; Logarithm; Discrete mathematics; Theoretical computer science; Computer science; Algorithm; Pure mathematics; Schoof's algorithm; Encryption; Computer security; Mathematical analysis","score_opus":0.006436452121446332,"score_gpt":0.20538693882008718,"score_spread":0.19895048669864085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981349468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041719717,0.009365083,0.9739497,0.008674137,0.000021237172,0.00023010542,0.0000091635575,0.00011374889,0.0034648718],"genre_scores_gemma":[0.973905,0.0036135383,0.020009845,0.0021999476,0.00007824081,0.00014340784,0.000005548198,0.0000050309127,0.000039423547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994786,0.000014674805,0.00010756089,0.00022456475,0.000048552847,0.00012604524],"domain_scores_gemma":[0.9994132,0.00015773157,0.00003044242,0.00029898906,0.000023733928,0.000075925585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000076482866,0.000088901186,0.00008652679,0.00009338521,0.00018883619,0.0000703897,0.00021084162,0.00005219287,0.000013839967],"category_scores_gemma":[0.000004526706,0.00006853075,0.00004195009,0.00033652445,0.00007311169,0.0001391664,0.00009885097,0.000100642486,0.000008126862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001020846,0.00007186888,0.00073858944,0.000048523907,0.000027827144,3.8899367e-7,0.000679483,0.0000053429376,0.000087811226,0.67511445,0.001267457,0.32195723],"study_design_scores_gemma":[0.0006034971,0.00014901061,0.020975115,0.00012660515,0.000028887702,0.00006120945,0.00012718975,0.010919246,0.0010974718,0.3886649,0.57661617,0.0006306955],"about_ca_topic_score_codex":0.0000076098954,"about_ca_topic_score_gemma":0.000014731094,"teacher_disagreement_score":0.96973306,"about_ca_system_score_codex":0.0000011191877,"about_ca_system_score_gemma":0.000007726264,"threshold_uncertainty_score":0.2794603},"labels":[],"label_agreement":null},{"id":"W1985205186","doi":"10.1109/iscas.2014.6865262","title":"FPGA implementation of low latency scalable Elliptic Curve Cryptosystem processor in GF(2&lt;sup&gt;m&lt;/sup&gt;)","year":2014,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Finite field; Elliptic curve cryptography; NIST; Computer science; Scalability; Field-programmable gate array; Parallel computing; Elliptic curve; Arithmetic; Binary number; Latency (audio); Elliptic curve point multiplication; Curve25519; Cryptosystem; Cryptography; Computer hardware; Algorithm; Mathematics; Public-key cryptography; Discrete mathematics; Operating system; Encryption","score_opus":0.007931987127970937,"score_gpt":0.2388408832877274,"score_spread":0.23090889615975646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985205186","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6035102,0.0005602437,0.38898456,0.0006384489,0.00033635244,0.0009738403,0.0000100956195,0.00025961362,0.00472667],"genre_scores_gemma":[0.9822693,0.00005949238,0.017145004,0.000102741586,0.00006095114,0.00006771283,0.000007530932,0.000019441248,0.0002678196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971736,0.00020835988,0.00079938275,0.0006385611,0.0005728889,0.00060718943],"domain_scores_gemma":[0.99851626,0.00017213877,0.00024747086,0.0006978451,0.00021892924,0.00014737986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009279664,0.00027644192,0.00042147594,0.0005005708,0.0001355081,0.00015685862,0.0009424534,0.0001293815,0.0001598502],"category_scores_gemma":[0.000034489967,0.00023193072,0.00014986756,0.0016622626,0.00008448865,0.00074605737,0.00021245022,0.00016065236,0.00009487987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105490435,0.002197371,0.13265428,0.004537184,0.00032046795,0.00005988564,0.014439705,0.008105599,0.031319674,0.44651493,0.0037379533,0.35600746],"study_design_scores_gemma":[0.011603416,0.0023832466,0.20129097,0.001816671,0.00016253663,0.00011850416,0.0022706261,0.4338329,0.2893869,0.042766992,0.010982224,0.0033850009],"about_ca_topic_score_codex":0.00025827019,"about_ca_topic_score_gemma":0.000560251,"teacher_disagreement_score":0.42572734,"about_ca_system_score_codex":0.000046353445,"about_ca_system_score_gemma":0.00012699616,"threshold_uncertainty_score":0.945786},"labels":[],"label_agreement":null},{"id":"W1985273268","doi":"10.1515/jmc.2008.006","title":"On the security of multi-prime RSA","year":2008,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Prime (order theory); Factoring; Exponent; Public-key cryptography; Mathematics; Cryptography; Algebraic number; Arithmetic; Discrete mathematics; Computer science; Computer security; Combinatorics; Algorithm; Encryption; Business","score_opus":0.029800146658772037,"score_gpt":0.2613415051658113,"score_spread":0.23154135850703925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985273268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42305064,0.00021880915,0.57044035,0.0049255886,0.00022489004,0.00009175792,6.281184e-7,0.000014528067,0.0010328201],"genre_scores_gemma":[0.939787,0.000032248605,0.05991672,0.00021531426,0.000036534857,0.0000011461207,2.9882283e-8,0.0000042646184,0.0000067906462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986547,0.00019161595,0.0005396521,0.00010425818,0.00032589657,0.00018386255],"domain_scores_gemma":[0.99815756,0.00087815704,0.0003697963,0.00035358995,0.00015710156,0.00008381353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006188429,0.000102711565,0.0003583301,0.00014383087,0.00008833481,0.000011121832,0.0008567806,0.000085733154,0.000045672918],"category_scores_gemma":[0.0005534776,0.00005469794,0.00023855749,0.0002536776,0.0001988813,0.000094085146,0.00010437429,0.00034692648,0.000031113916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024083272,0.0006398139,0.0001694462,0.000027948085,0.00006735406,0.0001377109,0.001623507,0.00001382442,0.0007089302,0.9947127,0.0013810989,0.00049354683],"study_design_scores_gemma":[0.0008936528,0.0007610981,0.0025588134,0.00009474038,0.000031106294,0.0032151528,0.00017737209,0.0065226783,0.009064719,0.976318,0.00021782806,0.00014483734],"about_ca_topic_score_codex":8.38892e-7,"about_ca_topic_score_gemma":4.039012e-7,"teacher_disagreement_score":0.5167363,"about_ca_system_score_codex":0.000009636894,"about_ca_system_score_gemma":0.00006245102,"threshold_uncertainty_score":0.22305171},"labels":[],"label_agreement":null},{"id":"W1985589545","doi":"10.1017/s0013091508000771","title":"Bilinear character sums and sum-product problems on elliptic curves","year":2010,"lang":"en","type":"article","venue":"Proceedings of the Edinburgh Mathematical Society","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Character (mathematics); Bilinear interpolation; Multiplicative function; Mathematics; Finite field; Product (mathematics); Bilinear form; Elliptic curve; Pure mathematics; Discrete mathematics; Mathematical analysis; Statistics; Geometry","score_opus":0.010258874749555206,"score_gpt":0.21821478295591035,"score_spread":0.20795590820635515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985589545","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9825767,0.00030875742,0.00084702694,0.012409973,0.00058096217,0.00076917384,0.0000026896055,0.00016476221,0.0023399459],"genre_scores_gemma":[0.966702,0.00036300145,0.031084293,0.00075581943,0.00042807657,0.000056067285,4.517077e-7,0.00002406166,0.000586235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983827,0.000004780879,0.00033931353,0.00042769627,0.0005193956,0.00032612556],"domain_scores_gemma":[0.99898654,0.00018504476,0.0001901163,0.0003273361,0.00019375565,0.000117215764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009320939,0.00020592172,0.00029195024,0.00003483115,0.00019199516,0.00012891594,0.0009577627,0.00010340473,0.000045670535],"category_scores_gemma":[0.0003236891,0.00011937212,0.00028303897,0.00049804524,0.0004269665,0.00031529748,0.00041409497,0.00053211517,0.000005085524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019323814,0.0018122871,0.012491542,0.005349006,0.0003377855,8.290311e-7,0.010544572,0.0000031758916,0.2951948,0.6074377,0.059719946,0.007089037],"study_design_scores_gemma":[0.0016267713,0.00054294575,0.017826188,0.0036773246,0.00029967036,0.0001877202,0.00047891334,0.04078295,0.21573271,0.706418,0.010777787,0.0016490729],"about_ca_topic_score_codex":0.0000021219494,"about_ca_topic_score_gemma":1.7616752e-7,"teacher_disagreement_score":0.098980255,"about_ca_system_score_codex":0.0000078841895,"about_ca_system_score_gemma":0.000020595407,"threshold_uncertainty_score":0.48678538},"labels":[],"label_agreement":null},{"id":"W1986982576","doi":"10.1109/tit.2015.2409833","title":"Common Subexpression Algorithms for Space-Complexity Reduction of Gaussian Normal Basis Multiplication","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Institute of Standards and Technology","keywords":"Finite field; Binary number; Computer science; Multiplication (music); Algorithm; Reduction (mathematics); NIST; Gaussian; Computational complexity theory; Arithmetic; Multiplier (economics); Mathematics; Discrete mathematics","score_opus":0.03180169573059666,"score_gpt":0.269284744914897,"score_spread":0.23748304918430035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986982576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008528838,0.000014349603,0.9886974,0.00040716087,0.00074458774,0.00048264614,0.000047043926,0.00016128265,0.0009166579],"genre_scores_gemma":[0.9397324,0.000012577263,0.05997755,0.000059611986,0.000030834737,0.000117262185,0.000020032558,0.000006771259,0.00004300342],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987906,0.0001197331,0.00044337907,0.00015666652,0.00030266558,0.00018695064],"domain_scores_gemma":[0.9987657,0.00012396663,0.00025473008,0.00047380436,0.00025836605,0.00012343275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007147261,0.00014256599,0.00016497419,0.00043603516,0.00024983787,0.000069689326,0.00035029973,0.000109907036,0.000012553818],"category_scores_gemma":[0.000013292489,0.0001291358,0.00014983998,0.0004915448,0.00012492748,0.0020554226,0.000003918948,0.0001480401,0.000025826013],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084127643,0.000628236,0.000025006064,0.00019064508,0.00010726378,3.2218526e-7,0.014751826,0.038177844,0.0032411353,0.19191007,0.000875299,0.74925107],"study_design_scores_gemma":[0.0038241737,0.0008605817,0.0010784238,0.00014497912,0.000079312296,0.00005492113,0.0025861056,0.2561253,0.6398231,0.09159135,0.0032006293,0.0006311274],"about_ca_topic_score_codex":0.000044606706,"about_ca_topic_score_gemma":0.000004842065,"teacher_disagreement_score":0.93120354,"about_ca_system_score_codex":0.000058484922,"about_ca_system_score_gemma":0.00006513063,"threshold_uncertainty_score":0.52660054},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.01353937373835186,"score_gpt":0.23846793185032228,"score_spread":0.22492855811197043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987475429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24287827,0.00096517755,0.75181586,0.002550386,0.00073839,0.00009155259,0.0000022223599,0.000047097863,0.0009110697],"genre_scores_gemma":[0.8619688,0.000032493925,0.13750699,0.00015549417,0.00030965428,0.0000027508183,6.008739e-7,0.000016372633,0.0000068501117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970293,0.00049057254,0.0010898612,0.00030015822,0.0006339776,0.00045612745],"domain_scores_gemma":[0.99763876,0.00069981697,0.0004931267,0.0005966424,0.00029241157,0.00027924933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012213548,0.00026001074,0.00086109515,0.00032775378,0.00013840527,0.00016234585,0.0012966418,0.00020918244,0.000060383576],"category_scores_gemma":[0.000680181,0.00018606384,0.000439582,0.00036676158,0.00015095923,0.00031782629,0.00017276841,0.00041129667,0.00009938988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006030841,0.00029247045,0.00025252107,0.0001113728,0.00019731416,0.00012716108,0.0012644427,0.00002867005,0.00689372,0.98818874,0.0006127975,0.0019705072],"study_design_scores_gemma":[0.0009865756,0.00087876536,0.0013523875,0.00023444851,0.000118751625,0.00071455474,0.0005007332,0.017191732,0.003112915,0.97164506,0.0029279436,0.00033610698],"about_ca_topic_score_codex":0.000015298745,"about_ca_topic_score_gemma":0.00000355316,"teacher_disagreement_score":0.6190905,"about_ca_system_score_codex":0.0000402773,"about_ca_system_score_gemma":0.000105266925,"threshold_uncertainty_score":0.7587464},"labels":[],"label_agreement":null},{"id":"W1988051973","doi":"10.1109/ised.2012.15","title":"Improvements for High Performance Elliptic Curve Cryptosystem Processor over GF(2^163)","year":2012,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Computer science; Elliptic curve cryptography; Parallel computing; Finite field; GF(2); Field-programmable gate array; Elliptic curve; Affine transformation; Cryptosystem; Multiplier (economics); Matrix multiplication; Elliptic curve point multiplication; Arithmetic; Computer hardware; Algorithm; Encryption; Mathematics; Cryptography; Public-key cryptography; Operating system; Discrete mathematics","score_opus":0.011790448617153091,"score_gpt":0.23446843700542574,"score_spread":0.22267798838827266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988051973","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55719995,0.0003613645,0.43854186,0.00018678833,0.0010257494,0.00074709463,0.000004661053,0.00024039263,0.0016921544],"genre_scores_gemma":[0.9631825,0.00002021043,0.035404053,0.00029026886,0.00020881355,0.0001605789,0.0000031156853,0.000014503902,0.0007159305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9984476,0.000024409639,0.00027825692,0.00032745415,0.00029318986,0.00062909635],"domain_scores_gemma":[0.9990746,0.000077640616,0.000108229106,0.00047403408,0.000105414816,0.00016012217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038525774,0.00018918124,0.00018536279,0.00013194904,0.00020714207,0.00013184753,0.00065761566,0.00007602564,0.000038417373],"category_scores_gemma":[0.000011794669,0.00014229903,0.00009021878,0.0004190025,0.000035338882,0.0011520049,0.00015324884,0.00009047082,0.000077045675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080044934,0.001229172,0.11097372,0.001942365,0.00026871878,0.000002814106,0.0023918825,0.00006509156,0.010908489,0.7450384,0.0049625244,0.12213682],"study_design_scores_gemma":[0.008592109,0.002310048,0.4552843,0.00043832933,0.00019701623,0.000071151146,0.00031245267,0.10305279,0.35644585,0.011005197,0.0588437,0.0034470693],"about_ca_topic_score_codex":0.000022393479,"about_ca_topic_score_gemma":0.000002922055,"teacher_disagreement_score":0.73403317,"about_ca_system_score_codex":0.000028495651,"about_ca_system_score_gemma":0.00003823072,"threshold_uncertainty_score":0.5802786},"labels":[],"label_agreement":null},{"id":"W1992096905","doi":"10.1109/mdt.2007.204","title":"Security-Performance Trade-offs in Embedded Systems Using Flexible ECC Hardware","year":2007,"lang":"en","type":"article","venue":"IEEE Design & Test of Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Division of Electrical, Communications and Cyber Systems; CMC Microsystems","keywords":"Coprocessor; Computer science; Cryptography; Embedded system; Elliptic curve cryptography; Computation; Computer hardware; Computer architecture; Public-key cryptography; Operating system; Encryption; Computer security; Algorithm","score_opus":0.02885568368236606,"score_gpt":0.2547353386458567,"score_spread":0.2258796549634906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992096905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1798637,0.00041556006,0.81780267,0.000042060223,0.0011958998,0.00035934398,0.0000020362074,0.00016341504,0.00015530139],"genre_scores_gemma":[0.9305716,0.00002766287,0.06917804,0.00008932235,0.0001050947,0.000005141987,9.2490353e-7,0.000017326134,0.0000048988404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767953,0.0001474196,0.00064320833,0.00047227333,0.00045726122,0.0006003103],"domain_scores_gemma":[0.9981418,0.0007993343,0.00022938299,0.00060606806,0.00007283893,0.00015055967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013436329,0.00026641533,0.0004207429,0.0006358496,0.00011887443,0.00012475248,0.001076555,0.00013194565,0.0000010907753],"category_scores_gemma":[0.000021998747,0.00026390652,0.00012319876,0.0014924806,0.000116452524,0.0005436446,0.00008425993,0.00026138636,0.0000055310784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022510781,0.0021705413,0.038118243,0.0016101629,0.000258572,0.00089042186,0.013135132,0.794008,0.06957199,0.01125813,0.0036229833,0.065130726],"study_design_scores_gemma":[0.0009456006,0.000348518,0.008317521,0.00058838894,0.000014690701,0.00013746362,0.00007296235,0.93626094,0.05212,0.0005077211,0.00021937262,0.00046683673],"about_ca_topic_score_codex":0.00006239921,"about_ca_topic_score_gemma":0.000004083997,"teacher_disagreement_score":0.75070786,"about_ca_system_score_codex":0.00007396818,"about_ca_system_score_gemma":0.00012080367,"threshold_uncertainty_score":0.99998134},"labels":[],"label_agreement":null},{"id":"W1992787549","doi":"10.1109/iscas.2010.5537486","title":"A high performance pseudo-multi-core ECC processor over GF(2&lt;sup&gt;163&lt;/sup&gt;)","year":2010,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Division of Electrical, Communications and Cyber Systems; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Elliptic curve cryptography; Parallel computing; Field-programmable gate array; Pipeline (software); Scalar multiplication; Reduced instruction set computing; Finite field; Instructions per cycle; Elliptic curve point multiplication; Elliptic curve; Instruction set; Algorithm; Embedded system; Mathematics; Computer hardware; Discrete mathematics; Public-key cryptography; Operating system; Central processing unit; Encryption","score_opus":0.011162347446742615,"score_gpt":0.2288786610064093,"score_spread":0.2177163135596667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992787549","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9590961,0.00015088641,0.034878433,0.00087775104,0.0008840846,0.00048665013,0.000009228741,0.00065806037,0.0029588134],"genre_scores_gemma":[0.8794463,0.00008018602,0.117124215,0.0006048962,0.0002583051,0.00007455762,0.0000062665335,0.000034052813,0.0023712157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99686384,0.000039243085,0.0005053615,0.0009901826,0.000700172,0.00090118975],"domain_scores_gemma":[0.9977597,0.00012022887,0.00016343515,0.0013746198,0.00025088954,0.00033109772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042994527,0.0004577766,0.0004003268,0.00037319172,0.00049192755,0.00040206278,0.0018514135,0.00029398402,0.00038205413],"category_scores_gemma":[0.00006387174,0.00035282676,0.0002228187,0.0013732703,0.0002735998,0.0011903591,0.0005279541,0.00066358637,0.0004296408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000261302,0.005098974,0.084039375,0.0013013161,0.0006180998,0.0003845981,0.0110108685,0.0028852252,0.14692125,0.4568823,0.038859513,0.25173718],"study_design_scores_gemma":[0.0044622123,0.00064178987,0.21220917,0.00017600556,0.00008754276,0.00032517686,0.00007472152,0.7067161,0.028587282,0.004342521,0.04013046,0.002247029],"about_ca_topic_score_codex":0.00008134478,"about_ca_topic_score_gemma":0.00021330935,"teacher_disagreement_score":0.70383084,"about_ca_system_score_codex":0.000024814617,"about_ca_system_score_gemma":0.00017293177,"threshold_uncertainty_score":0.99989235},"labels":[],"label_agreement":null},{"id":"W1993819992","doi":"10.1016/j.ffa.2014.10.009","title":"Weakness of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">F</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mn>3</mml:mn></mml:mrow><mml:mrow><mml:mn>6</mml:mn><mml:mo>⋅</mml:mo><mml:mn>1429</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:msub></mml:math> and <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">F</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mn>4</mml:mn><mml:mo>⋅</mml:mo><mml:mn>3041</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:msub></mml:math> for discrete logarithm cryptography","year":2014,"lang":"lv","type":"article","venue":"Finite Fields and Their Applications","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Electrical, Communications and Cyber Systems; Consejo Nacional de Ciencia y Tecnología","keywords":"Discrete logarithm; Mathematics; Cryptography; Logarithm; Algorithm; Scroll; Finite field; Discrete mathematics; Bilinear interpolation; Security parameter; Degree (music); Computer science; Statistics; Public-key cryptography; Computer security; Mathematical analysis","score_opus":0.01674343111415439,"score_gpt":0.23519998467455402,"score_spread":0.21845655356039964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993819992","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18827495,0.0062416717,0.01109993,0.003230568,0.009535103,0.00033974386,0.004603816,0.0014880947,0.7751861],"genre_scores_gemma":[0.9390538,0.007919399,0.0122038545,0.0053094286,0.008196598,0.011340469,0.010063057,0.0045329863,0.0013804534],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.95813584,0.0025530914,0.00885264,0.009179379,0.009952903,0.011326172],"domain_scores_gemma":[0.9621126,0.00907331,0.010136862,0.011139214,0.001289203,0.0062488285],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.008534542,0.0048860135,0.0018952561,0.003941927,0.008849794,0.009157203,0.01238584,0.012407088,0.8149587],"category_scores_gemma":[0.005496882,0.009881229,0.009772011,0.00776223,0.010003133,0.0074880207,0.011083824,0.00863707,0.0052712043],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0062809223,0.0013880627,0.000044226123,0.0044033793,0.007105892,0.0033351458,0.004970148,0.0033397875,0.0038096209,0.45901418,0.50066286,0.0056458064],"study_design_scores_gemma":[0.009786752,0.0065975157,0.00027683604,0.004486235,0.0074996287,0.008073716,0.00628362,0.06191953,0.85869944,0.0007216061,0.027227182,0.0084279645],"about_ca_topic_score_codex":0.008501459,"about_ca_topic_score_gemma":0.007981901,"teacher_disagreement_score":0.8548898,"about_ca_system_score_codex":0.00008519373,"about_ca_system_score_gemma":0.007474287,"threshold_uncertainty_score":0.99815243},"labels":[],"label_agreement":null},{"id":"W1995833618","doi":"10.1016/j.jda.2004.04.011","title":"Efficient algorithms for Koblitz curves over fields of characteristic three","year":2004,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Algorithm; Finite field; Computation; Arithmetic; Mathematics; Point (geometry); Field (mathematics); Computer science; Multiplication (music); Window (computing); Discrete mathematics; Combinatorics; Pure mathematics; Geometry","score_opus":0.0169061173818016,"score_gpt":0.2731545774228335,"score_spread":0.2562484600410319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995833618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052301228,0.003246676,0.9411852,0.0017983692,0.001058283,0.00027542087,0.00003528906,0.000023804061,0.00007574162],"genre_scores_gemma":[0.760555,0.00057048054,0.23785034,0.00041040176,0.0005397796,0.0000145778,0.0000049750442,0.000027609494,0.000026823065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978786,0.00003910977,0.00083087874,0.00025768764,0.0006307521,0.00036294645],"domain_scores_gemma":[0.9981031,0.00019507493,0.00070816616,0.00042876965,0.00038116562,0.00018373066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067046075,0.00021669817,0.00050342176,0.00031679787,0.00010910318,0.000077325254,0.0009803426,0.00010800008,0.00001462856],"category_scores_gemma":[0.00011449238,0.0001617818,0.00053802214,0.0005424477,0.00012418603,0.00026141063,0.0001334213,0.00027948534,0.0000021661845],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010730075,0.007466215,0.0061786934,0.005692096,0.004553254,0.0013820927,0.012105802,0.05524527,0.018502109,0.15020703,0.008080558,0.7295139],"study_design_scores_gemma":[0.028275868,0.015495243,0.27259567,0.010034545,0.0013844792,0.0024897368,0.00053595175,0.40010372,0.038232364,0.21997093,0.006987042,0.0038944336],"about_ca_topic_score_codex":0.00003937966,"about_ca_topic_score_gemma":0.000007412205,"teacher_disagreement_score":0.72561944,"about_ca_system_score_codex":0.000040595158,"about_ca_system_score_gemma":0.00017894199,"threshold_uncertainty_score":0.65972704},"labels":[],"label_agreement":null},{"id":"W1996684168","doi":"10.1080/01611190508951303","title":"HISTORY AND ROLE OF INFORMATION SECURITY IN POSTAGE EVIDENCING AND PAYMENT","year":2005,"lang":"en","type":"article","venue":"Cryptologia","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Authentication (law); Computer security; Computer science; Cryptography; Postage Stamps; Payment; Database transaction; Cryptographic primitive; Message authentication code; Information security; Cryptographic protocol; World Wide Web; Database; Business","score_opus":0.006168902864045755,"score_gpt":0.20158941901870628,"score_spread":0.19542051615466052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996684168","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9887019,0.0048449603,0.0050457586,0.0003870428,0.00004667559,0.00009178629,6.0906086e-7,0.00002807413,0.00085322646],"genre_scores_gemma":[0.98839307,0.00015152557,0.011318858,0.00012519077,0.0000057076627,0.0000030636324,4.3714655e-7,9.527865e-7,0.0000012029951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9995171,0.000029557885,0.00016695407,0.00010116068,0.000080860926,0.0001043934],"domain_scores_gemma":[0.9996986,0.000052507028,0.000063866515,0.00013123041,0.000021143922,0.000032688626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020325946,0.000056811445,0.00009492061,0.00014934952,0.000023110495,0.000018076378,0.00012493342,0.00004470723,0.0000052350388],"category_scores_gemma":[0.00003082194,0.000049673872,0.000014806025,0.00010520258,0.000071577095,0.0006034457,0.00011413154,0.000075764816,0.0000016709824],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032352713,0.0001332484,0.17320032,0.00020832056,0.000020711816,0.000009085339,0.038767,0.00006439358,0.0054821665,0.44560838,0.00060911954,0.3358649],"study_design_scores_gemma":[0.0009566219,0.0002225668,0.917971,0.00011354111,0.00001042573,0.000045793076,0.00096621836,0.029166395,0.005739568,0.028843945,0.015630813,0.00033309197],"about_ca_topic_score_codex":0.000052461804,"about_ca_topic_score_gemma":0.000029651304,"teacher_disagreement_score":0.7447707,"about_ca_system_score_codex":0.000037884438,"about_ca_system_score_gemma":0.000023680686,"threshold_uncertainty_score":0.20256416},"labels":[],"label_agreement":null},{"id":"W1996714756","doi":"10.1515/jmc.2008.011","title":"Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formulæ","year":2008,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Universidad de Talca","keywords":"Hyperelliptic curve cryptography; Arithmetic; Jacobian matrix and determinant; Binary number; Mathematics; Genus; Field (mathematics); Pure mathematics; Computer science; Applied mathematics; Biology; Zoology","score_opus":0.016394329432625573,"score_gpt":0.2547704709577174,"score_spread":0.2383761415250918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996714756","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64516586,0.00064673607,0.35201392,0.0014396753,0.00025796783,0.000103324026,5.80462e-7,0.000018748762,0.00035315045],"genre_scores_gemma":[0.8810002,0.00022623828,0.11826897,0.00039909116,0.00007521604,0.00000315894,1.5951736e-7,0.000011808249,0.000015127592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978156,0.00014943283,0.0009997884,0.00025492025,0.00041563463,0.0003646434],"domain_scores_gemma":[0.997599,0.001108914,0.0005009593,0.00042187455,0.00017444196,0.00019483293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005722675,0.00022434037,0.00073648297,0.00046637846,0.00012438727,0.000040114006,0.00075101113,0.00026893144,0.000052131178],"category_scores_gemma":[0.00050059636,0.00017006765,0.0002784245,0.00036710166,0.0001609543,0.00032357825,0.0002639305,0.00063509244,0.000008646444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006692267,0.0040562646,0.010833047,0.0032589359,0.0013750651,0.0067214435,0.0429027,0.00026298937,0.015892556,0.85984194,0.005598686,0.048587114],"study_design_scores_gemma":[0.003013241,0.0048572193,0.007967371,0.0013376017,0.0002459294,0.024090651,0.0005861097,0.032383494,0.011194942,0.91322356,0.00029931348,0.00080053374],"about_ca_topic_score_codex":0.000006472347,"about_ca_topic_score_gemma":0.000002784137,"teacher_disagreement_score":0.23583435,"about_ca_system_score_codex":0.00001934078,"about_ca_system_score_gemma":0.00008124842,"threshold_uncertainty_score":0.6935158},"labels":[],"label_agreement":null},{"id":"W1997508056","doi":"10.1145/2790282.2790291","title":"A parallel implementation for polynomial multiplication modulo a prime","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Modulo; Modular arithmetic; Prime (order theory); Computer science; Multiplication (music); Parallel computing; Fast Fourier transform; Integer (computer science); Modular design; Polynomial; Discrete mathematics; Arithmetic; Mathematics; Combinatorics; Algorithm; Programming language","score_opus":0.03695766263736489,"score_gpt":0.31346929877528223,"score_spread":0.27651163613791735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997508056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010370569,0.00003371544,0.9866112,0.0019487464,0.00012459379,0.0004038068,0.0000018472641,0.000111647256,0.00039386397],"genre_scores_gemma":[0.6161658,0.0000017002666,0.38336077,0.00021566701,0.000055602486,0.000107023996,0.000008028114,0.0000033250192,0.00008208529],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994168,0.000016982493,0.00012241337,0.00019425637,0.00010711503,0.0001423965],"domain_scores_gemma":[0.999542,0.00003029823,0.00004214197,0.0002308191,0.00007575809,0.00007896065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017198612,0.00005814259,0.000057871548,0.000069705144,0.00005651305,0.000069091235,0.00025218562,0.000025886711,0.0000035996509],"category_scores_gemma":[0.000011521917,0.00004866327,0.000048737133,0.00016018053,0.000012734229,0.00025143658,0.00005401101,0.0000221822,0.0000144791775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010473058,0.00033173128,0.004398853,0.000020702006,0.00007571652,0.0000015654064,0.0050309044,0.0006849836,0.008254961,0.28312683,0.06402158,0.63394743],"study_design_scores_gemma":[0.014256376,0.0011851585,0.047931086,0.0000124975595,0.000038820508,0.000031260537,0.0012577331,0.7244947,0.046933077,0.06891581,0.093916945,0.0010265409],"about_ca_topic_score_codex":0.00014425053,"about_ca_topic_score_gemma":0.00006562005,"teacher_disagreement_score":0.7238097,"about_ca_system_score_codex":0.00001862206,"about_ca_system_score_gemma":0.000053837408,"threshold_uncertainty_score":0.19844306},"labels":[],"label_agreement":null},{"id":"W1997771347","doi":"10.1088/1742-6596/385/1/012014","title":"Plain Polynomial Arithmetic on GPU","year":2012,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Multiplication (music); Polynomial; Computer science; Parallel computing; Fast Fourier transform; Degree (music); Code (set theory); Arithmetic; Algorithm; Mathematics; Combinatorics","score_opus":0.021459877858036595,"score_gpt":0.24112980037904871,"score_spread":0.2196699225210121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997771347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24523075,0.0006376986,0.73820335,0.0037831462,0.0039080996,0.00017693052,0.0000074269897,0.00008603063,0.007966579],"genre_scores_gemma":[0.9864512,0.00005827215,0.012545728,0.00017225073,0.00069525244,0.0000013389498,3.5989035e-7,0.000007116555,0.00006849983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99880356,0.00008299654,0.0003013408,0.00011392309,0.0003780376,0.0003201418],"domain_scores_gemma":[0.99896365,0.00010417539,0.00029202862,0.00027683936,0.0001863722,0.00017693022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031433668,0.00015279818,0.0002526923,0.00012785626,0.000120486235,0.00017310935,0.00064456003,0.000052689516,0.000016915661],"category_scores_gemma":[0.00003699982,0.000117403935,0.00016976007,0.00031291248,0.00012038374,0.0014500658,0.000092195114,0.00031166026,0.00002518695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076782504,0.00041095266,0.0017453113,0.000021754777,0.000093880815,0.00002508054,0.0029814963,0.000059489896,0.0053291777,0.7519536,0.0014388871,0.23586357],"study_design_scores_gemma":[0.0027621107,0.003815068,0.067403644,0.0005139774,0.00014999317,0.00094271183,0.0014255329,0.00077164406,0.71252024,0.17555802,0.03264191,0.001495127],"about_ca_topic_score_codex":0.0000043479204,"about_ca_topic_score_gemma":0.000001446588,"teacher_disagreement_score":0.7412204,"about_ca_system_score_codex":0.000021402997,"about_ca_system_score_gemma":0.00012981973,"threshold_uncertainty_score":0.47875935},"labels":[],"label_agreement":null},{"id":"W1998438348","doi":"10.1049/el:20010378","title":"Fault tolerant computation of large inner products","year":2001,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computation; Fault tolerance; Redundancy (engineering); Computer science; Overhead (engineering); Replication (statistics); Product (mathematics); Parallel computing; Distributed computing; Algorithm; Mathematics","score_opus":0.006317953481910144,"score_gpt":0.22608349324468477,"score_spread":0.21976553976277463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998438348","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55821145,0.0007932553,0.4297074,0.010801104,0.00015924692,0.00012276962,5.845556e-7,0.00007546856,0.00012873343],"genre_scores_gemma":[0.99043113,0.000052253683,0.0078547085,0.0015798323,0.000050669234,0.000004934801,0.0000038494823,0.0000071430777,0.00001546475],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988919,0.000051252737,0.00018477348,0.00026629597,0.00022750352,0.00037826624],"domain_scores_gemma":[0.99951035,0.000025975136,0.000083191844,0.00027916153,0.00006733101,0.000033998367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020839952,0.00010104487,0.0001267803,0.0001441627,0.000078169294,0.000037432295,0.0003587112,0.00003285582,0.0000027989356],"category_scores_gemma":[0.000012840519,0.00009109838,0.00005796944,0.00079859036,0.000032505388,0.0001943447,0.00005892429,0.00015322838,0.000009513268],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009755217,0.0012261576,0.006390718,0.00020225268,0.0003306096,0.00018901845,0.005749546,0.018949404,0.5515267,0.2854196,0.024281958,0.10563644],"study_design_scores_gemma":[0.007802938,0.0017126764,0.04965041,0.00027459353,0.00013192788,0.0006090705,0.00014210951,0.36456117,0.31148452,0.02592076,0.23490489,0.002804941],"about_ca_topic_score_codex":0.000009109636,"about_ca_topic_score_gemma":0.000010304153,"teacher_disagreement_score":0.4322197,"about_ca_system_score_codex":0.000027288128,"about_ca_system_score_gemma":0.00004880515,"threshold_uncertainty_score":0.37148842},"labels":[],"label_agreement":null},{"id":"W1999613060","doi":"10.1007/s13389-011-0017-8","title":"Speeding scalar multiplication over binary elliptic curves using the new carry-less multiplication instruction","year":2011,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Consejo Nacional de Ciencia y Tecnología; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; University of Waterloo; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Scalar multiplication; Elliptic curve cryptography; Edwards curve; Arithmetic; Elliptic curve; Elliptic curve point multiplication; Parallel computing; Computer science; Binary number; Side channel attack; Multiplication (music); Curve25519; Mathematics; Cryptography; Algorithm; Public-key cryptography; Encryption; Pure mathematics","score_opus":0.026526956020350424,"score_gpt":0.2340954477578505,"score_spread":0.20756849173750005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999613060","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5071194,0.0022768243,0.48977944,0.00013559677,0.00050452753,0.00011648044,2.818113e-7,0.00004913579,0.000018282779],"genre_scores_gemma":[0.88656694,0.0008832482,0.11221539,0.000049221322,0.00026227676,0.0000029205787,4.081525e-7,0.000018286655,0.0000012917941],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99850214,0.000046551733,0.0005563395,0.00021556343,0.00041531379,0.00026412186],"domain_scores_gemma":[0.99869,0.00008846505,0.00043943647,0.000423698,0.00020131927,0.0001570698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053447386,0.00019756528,0.0002283398,0.00069184427,0.00015810666,0.00008847602,0.00076395075,0.00009511761,0.0000053875947],"category_scores_gemma":[0.00006385953,0.00014954436,0.0002706105,0.0014971496,0.000057374742,0.00096001406,0.00008948102,0.00040753686,9.161196e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013691114,0.0006207106,0.14689809,0.0010149482,0.0010831525,0.00009093747,0.0091709485,0.10406159,0.59392667,0.057168156,0.0005503571,0.08527755],"study_design_scores_gemma":[0.0014761233,0.00021542699,0.52897066,0.0013613343,0.00021158106,0.0007571293,0.00019668373,0.4467318,0.01621336,0.002430273,0.00082512805,0.0006104718],"about_ca_topic_score_codex":0.000060317827,"about_ca_topic_score_gemma":0.0000027107042,"teacher_disagreement_score":0.5777133,"about_ca_system_score_codex":0.00003868046,"about_ca_system_score_gemma":0.00005597488,"threshold_uncertainty_score":0.6098242},"labels":[],"label_agreement":null},{"id":"W2001360294","doi":"10.1134/s0361768807020053","title":"Cunningham numbers in modular arithmetic","year":2007,"lang":"en","type":"article","venue":"Programming and Computer Software","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Wilfrid Laurier University","funders":"","keywords":"Moduli; Modular design; Arithmetic; Modular arithmetic; Representation (politics); Selection (genetic algorithm); Mathematics; Acceleration; Algebra over a field; Modular equation; Computer science; Algorithm; Moduli space; Pure mathematics; Programming language; Artificial intelligence; Moduli of algebraic curves","score_opus":0.006998153397685619,"score_gpt":0.22525558421506822,"score_spread":0.2182574308173826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001360294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14320685,0.0007794912,0.85503334,0.000114684604,0.00028947153,0.00016240326,2.5565774e-7,0.00037811635,0.00003538239],"genre_scores_gemma":[0.53267556,0.000013083189,0.46707922,0.00014066907,0.000060979353,0.000008733359,0.0000016489525,0.000008740442,0.000011344272],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9983756,0.000039608112,0.00027955766,0.00051944616,0.00023482853,0.00055097986],"domain_scores_gemma":[0.99920803,0.00015828283,0.00005998464,0.0003643713,0.000043660635,0.0001656843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005912653,0.00019103651,0.00021254265,0.00031430082,0.00014677933,0.00027429365,0.00047645418,0.00009554669,0.000001099298],"category_scores_gemma":[0.000015216256,0.00017992988,0.00008018389,0.0008117616,0.000075323005,0.00025134734,0.00029733244,0.00024753492,0.000005428306],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034414625,0.000090542235,0.11492231,0.00003568751,0.000013775185,0.00013499138,0.0008822161,0.000050063234,0.000002311669,0.00520755,0.000019961817,0.87863714],"study_design_scores_gemma":[0.0024021538,0.0006609981,0.90640277,0.0004534021,0.000030101715,0.00055260834,0.00018132589,0.045697626,0.00024234007,0.019231165,0.022565033,0.0015804752],"about_ca_topic_score_codex":0.00018123565,"about_ca_topic_score_gemma":0.000056967107,"teacher_disagreement_score":0.87705666,"about_ca_system_score_codex":0.000021880081,"about_ca_system_score_gemma":0.000016236392,"threshold_uncertainty_score":0.73373276},"labels":[],"label_agreement":null},{"id":"W2002871885","doi":"10.1109/tc.2010.218","title":"High-Speed Architectures for Multiplication Using Reordered Normal Basis","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; University of Waterloo","funders":"","keywords":"Normal basis; Basis (linear algebra); Multiplication (music); Permutation (music); Elliptic curve cryptography; Binary number; Mathematics; Cryptography; Polynomial basis; Computer science; Multiplication algorithm; Arithmetic; Finite field; Algorithm; Basis function; Discrete mathematics; Encryption; Combinatorics; Galois theory","score_opus":0.014609132770273623,"score_gpt":0.24505338279394429,"score_spread":0.23044425002367067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002871885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25290006,0.0000039314546,0.74429226,0.00046162005,0.0018466196,0.00028645762,0.000011763389,0.00018698654,0.000010266572],"genre_scores_gemma":[0.6507419,0.0000012336394,0.34898293,0.00017109163,0.00006811047,0.000016095966,0.0000010979127,0.000010439142,0.0000071450986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885136,0.00003904588,0.00021847758,0.00042231704,0.00018306324,0.00028574397],"domain_scores_gemma":[0.9989018,0.00027974605,0.00007287717,0.000552067,0.000082511426,0.00011100951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001363593,0.00017580103,0.00015592501,0.00034494902,0.0004155214,0.00012528441,0.0005621189,0.00009948135,0.000007854628],"category_scores_gemma":[0.0000034631792,0.00016765393,0.00020329028,0.00044979516,0.00008115624,0.00011192015,0.000003794856,0.00029629396,0.000006439121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007829375,0.00037566587,0.000029664669,0.000031150477,0.00011113377,0.0000035951282,0.0008915921,0.5039308,0.059029236,0.0018429222,0.000102309146,0.43357366],"study_design_scores_gemma":[0.0010850008,0.00015586104,0.0008266727,0.00002290498,0.000030441202,0.000036979094,0.000010088051,0.88311845,0.11302979,0.0010676736,0.0003000317,0.0003161092],"about_ca_topic_score_codex":0.00011208018,"about_ca_topic_score_gemma":0.00009659112,"teacher_disagreement_score":0.43325755,"about_ca_system_score_codex":0.000017725542,"about_ca_system_score_gemma":0.000043966305,"threshold_uncertainty_score":0.68367285},"labels":[],"label_agreement":null},{"id":"W2005895372","doi":"10.1515/jmc.2007.015","title":"Minimal weight and colexicographically minimal integer representations","year":2007,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Dimension (graph theory); Integer (computer science); Discrete mathematics; Set (abstract data type); Representation (politics); Minimal models; Arithmetic; Combinatorics; Algebra over a field; Pure mathematics; Computer science","score_opus":0.012608873498279837,"score_gpt":0.27983659282903395,"score_spread":0.2672277193307541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005895372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19193448,0.0003274129,0.79962796,0.0052443435,0.00027814682,0.000080247424,4.8569524e-7,0.000024155346,0.0024827758],"genre_scores_gemma":[0.7005167,0.000028589871,0.2991148,0.00021482972,0.000104215505,0.0000013512267,1.2955991e-7,0.000006225909,0.00001316719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982443,0.00009872596,0.00080297055,0.00019869389,0.0003333343,0.00032201526],"domain_scores_gemma":[0.99813586,0.00081632973,0.0003180505,0.00024878708,0.00022257926,0.0002584015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011113607,0.00013760808,0.00037579914,0.00046978358,0.00010986422,0.00006973399,0.00051817996,0.00014534855,0.00003126229],"category_scores_gemma":[0.00038877837,0.00009965879,0.00019296218,0.0004781518,0.00026699406,0.000257001,0.00015340233,0.0003684729,0.000011040284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095155665,0.00039274458,0.0035792121,0.00004753995,0.000115463634,0.0004772819,0.000812178,0.000001255665,0.0018719577,0.9843369,0.0011093674,0.0071609286],"study_design_scores_gemma":[0.0018794489,0.0014033866,0.0715209,0.00013290397,0.00013111222,0.009480582,0.0010271155,0.0015024538,0.0026403756,0.9083299,0.0015687904,0.00038302463],"about_ca_topic_score_codex":8.7655667e-7,"about_ca_topic_score_gemma":0.0000029624202,"teacher_disagreement_score":0.50858223,"about_ca_system_score_codex":0.000010106929,"about_ca_system_score_gemma":0.000047052585,"threshold_uncertainty_score":0.40639678},"labels":[],"label_agreement":null},{"id":"W2007733358","doi":"10.1016/j.compeleceng.2007.05.006","title":"On efficient implementation of FPGA-based hyperelliptic curve cryptosystems","year":2007,"lang":"en","type":"article","venue":"Computers & Electrical Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hyperelliptic curve cryptography; Hyperelliptic curve; Cryptosystem; Computer science; Field-programmable gate array; Field (mathematics); Arithmetic; Cryptography; Coordinate system; Exponentiation; Transformation (genetics); Representation (politics); Implementation; Finite field; Parallel computing; Theoretical computer science; Elliptic curve cryptography; Embedded system; Algorithm; Mathematics; Public-key cryptography; Encryption; Discrete mathematics; Pure mathematics; Artificial intelligence","score_opus":0.005632031987279896,"score_gpt":0.22614233019588695,"score_spread":0.22051029820860704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007733358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20275874,0.00014586524,0.79632396,0.000044732817,0.00038002135,0.0001582735,5.118227e-7,0.00014952006,0.000038376067],"genre_scores_gemma":[0.9672568,0.0000019738436,0.032600965,0.00006783518,0.00005273543,0.0000047169683,0.0000018267332,0.000012248781,9.005388e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849266,0.000026745949,0.00036975183,0.00030991487,0.00036071983,0.000440195],"domain_scores_gemma":[0.99889034,0.00051278487,0.000086626926,0.0003205742,0.000060069175,0.0001296264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037984885,0.00017166838,0.00022283444,0.000517793,0.000055479482,0.00004558477,0.00046261068,0.000059776026,0.0000025888965],"category_scores_gemma":[0.000022090231,0.00016184119,0.00013451585,0.0012707633,0.000016065971,0.000052859934,0.00005017076,0.00017815546,0.0000070300084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002297787,0.00027710194,0.0003735038,0.000112546615,0.000068966285,0.000050016595,0.00029164844,0.7391088,0.013548591,0.13555588,0.00015917573,0.11043079],"study_design_scores_gemma":[0.00059576816,0.000356337,0.0053897034,0.00005348513,0.00000855186,0.0000091139345,0.000004701765,0.9531417,0.03993571,0.000115479874,0.00017366697,0.00021577842],"about_ca_topic_score_codex":0.0000197544,"about_ca_topic_score_gemma":0.0000010988805,"teacher_disagreement_score":0.76449805,"about_ca_system_score_codex":0.00007786089,"about_ca_system_score_gemma":0.000039914506,"threshold_uncertainty_score":0.6599692},"labels":[],"label_agreement":null},{"id":"W2008786784","doi":"10.1145/1277548.1277587","title":"Computing the eigenvalue in the schoof-elkies-atkin algorithm using abelian lifts","year":2007,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Abelian group; Mathematics; Eigenvalues and eigenvectors; Finite field; Algorithm; Division (mathematics); Elliptic curve; Division polynomials; Field (mathematics); Discrete mathematics; Schoof's algorithm; Pure mathematics; Arithmetic; Quarter period","score_opus":0.02068701876425005,"score_gpt":0.28175570946880524,"score_spread":0.2610686907045552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008786784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06520405,0.00048492607,0.92782056,0.0019583039,0.00039940482,0.00026004156,4.2605356e-7,0.00009421823,0.0037780646],"genre_scores_gemma":[0.78003496,0.0000139588155,0.21770637,0.0020306124,0.0001805373,0.0000015378089,4.3524253e-7,0.000008105717,0.000023490446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822646,0.00018654265,0.00032052377,0.000324631,0.0004213356,0.0005204907],"domain_scores_gemma":[0.99866503,0.0004843244,0.00007719116,0.00066594087,0.000046458037,0.000061050865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002680873,0.000156167,0.0001304773,0.00021724508,0.0004984432,0.0003252126,0.001559141,0.000058472866,0.000006579022],"category_scores_gemma":[0.000032629225,0.00008090866,0.00010782996,0.0017600489,0.00012242132,0.00021991762,0.00025541158,0.00040215574,0.000020646135],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032785672,0.00014267526,0.0044766306,0.000008725307,0.000029658037,0.00012967814,0.0054917713,0.0010850701,0.00033277838,0.04815141,0.000416149,0.9397322],"study_design_scores_gemma":[0.0009873839,0.0001360291,0.22599179,0.00012225185,0.00002482099,0.0003081027,0.0025426948,0.7349683,0.0028359094,0.020182885,0.011175566,0.0007242658],"about_ca_topic_score_codex":0.00058649783,"about_ca_topic_score_gemma":0.00020411507,"teacher_disagreement_score":0.93900794,"about_ca_system_score_codex":0.000026190502,"about_ca_system_score_gemma":0.0000584951,"threshold_uncertainty_score":0.38336727},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.004100972361733678,"score_gpt":0.22687138165436282,"score_spread":0.22277040929262915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013613544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022005143,0.0006487983,0.9597526,0.008689934,0.003820628,0.00010978264,0.000019908748,0.000050517265,0.0049026893],"genre_scores_gemma":[0.99343175,0.0005750403,0.0051390445,0.00048971386,0.00032922457,0.0000015389749,0.0000070884867,0.0000028750396,0.00002370415],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99833745,0.000032482607,0.0005663498,0.000058923102,0.00085698254,0.00014780431],"domain_scores_gemma":[0.997987,0.00020479762,0.0005075847,0.00016471645,0.0010518014,0.000084135674],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004991014,0.000095581185,0.00009627147,0.00023696537,0.00013796671,0.0011199699,0.0014586243,0.00005832359,0.000013210885],"category_scores_gemma":[0.00016761587,0.000061789244,0.00016974268,0.00029216814,0.00006204489,0.004704982,0.00013801958,0.000322388,0.000048391186],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073434865,0.00012740162,0.0015611678,0.0000050703084,0.0002723102,0.0000960811,0.0046617533,0.00028013127,0.000011941409,0.1371631,0.006566596,0.849181],"study_design_scores_gemma":[0.0016847602,0.00024433172,0.010914516,0.00009244442,0.000015416024,0.0029409062,0.0007557034,0.06586606,0.00043938242,0.13430285,0.7823927,0.00035092566],"about_ca_topic_score_codex":0.0000034011873,"about_ca_topic_score_gemma":0.0000013532166,"teacher_disagreement_score":0.9714266,"about_ca_system_score_codex":0.000046974958,"about_ca_system_score_gemma":0.000084810374,"threshold_uncertainty_score":0.999917},"labels":[],"label_agreement":null},{"id":"W2015499977","doi":"10.1145/2516930.2516946","title":"Securing ZigBee smart energy profile 1.x with OpenECC library","year":2013,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Computer science; Energy (signal processing); Embedded system; Physics","score_opus":0.003384787205908374,"score_gpt":0.155678693776119,"score_spread":0.15229390657021064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015499977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09221457,0.00045414382,0.50791883,0.0059088077,0.00043063247,0.00049309904,0.0000011538558,0.0013659035,0.39121285],"genre_scores_gemma":[0.85544735,0.000020519652,0.13731389,0.0010903978,0.0000462401,0.00007818256,0.0000024634119,0.000014394399,0.005986535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991229,0.00002957373,0.0001164407,0.00030314454,0.00016349756,0.00026442047],"domain_scores_gemma":[0.9993546,0.000031125706,0.000031815478,0.00043900133,0.000025126761,0.00011831909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003330756,0.00011669465,0.00010511059,0.00011112473,0.0001064729,0.00038102546,0.00069064414,0.00003814654,0.0006540035],"category_scores_gemma":[0.0000016756842,0.00007583767,0.000042694322,0.00048650918,0.000043362015,0.0015858861,0.00030974025,0.00006983837,0.00015087525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008024407,0.00017981128,0.01169734,0.000032632975,0.00007236671,0.000060781604,0.00044669112,0.00004734259,0.0011209964,0.84362847,0.0417143,0.10099126],"study_design_scores_gemma":[0.0037196826,0.0016766415,0.17670141,0.00035594683,0.000043164324,0.00050470897,0.00048259803,0.14095894,0.28913406,0.11637827,0.2666237,0.0034208815],"about_ca_topic_score_codex":0.00026834683,"about_ca_topic_score_gemma":0.00002013865,"teacher_disagreement_score":0.7632328,"about_ca_system_score_codex":0.0000030367132,"about_ca_system_score_gemma":0.00004510192,"threshold_uncertainty_score":0.716088},"labels":[],"label_agreement":null},{"id":"W2016433047","doi":"10.1007/s11265-009-0376-x","title":"Efficient FPGA Implementation of a Programmable Architecture for GF(p) Elliptic Curve Crypto Computations","year":2009,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Jordan University of Science and Technology; Dalhousie University","keywords":"Elliptic curve cryptography; Elliptic curve point multiplication; Elliptic Curve Digital Signature Algorithm; Field-programmable gate array; Tripling-oriented Doche–Icart–Kohel curve; Computation; Computer science; Elliptic curve; Hessian form of an elliptic curve; Parallel computing; Multiplication (music); Cryptography; Prime (order theory); Arithmetic; Mathematics; Algorithm; Computer hardware; Public-key cryptography; Combinatorics; Encryption; Pure mathematics","score_opus":0.014614736333982997,"score_gpt":0.28849556446516805,"score_spread":0.2738808281311851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016433047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041275922,0.0022000074,0.9553137,0.00056304934,0.00017379757,0.00041343493,0.0000030863819,0.000026299207,0.000030734245],"genre_scores_gemma":[0.93997353,0.0000032401585,0.059822615,0.000033190096,0.00014539673,0.000008066783,0.0000012008045,0.000006906017,0.000005836739],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982248,0.000082579405,0.0007882417,0.00017087277,0.00047824794,0.00025523466],"domain_scores_gemma":[0.9980151,0.00011550236,0.000988289,0.00011562503,0.0006668064,0.00009868134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007717722,0.00013757234,0.00031865915,0.0003608593,0.0001854182,0.0002631709,0.00042110434,0.000050891853,0.0000016599496],"category_scores_gemma":[0.000012585469,0.00010467485,0.00018808177,0.0006018894,0.000048555445,0.00015174388,0.000018232353,0.00015310074,6.3216083e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007409157,0.00048162614,0.000226605,0.00088054425,0.000109328095,0.000018511582,0.0047245286,0.40054432,0.0063559064,0.0045909192,0.00031538252,0.5816783],"study_design_scores_gemma":[0.0076295557,0.0084787235,0.008228683,0.004213995,0.0004177795,0.0017028133,0.0046645147,0.9083402,0.021194192,0.029198611,0.0047875457,0.0011433656],"about_ca_topic_score_codex":0.000011901594,"about_ca_topic_score_gemma":0.0000013092825,"teacher_disagreement_score":0.8986976,"about_ca_system_score_codex":0.000036730533,"about_ca_system_score_gemma":0.00021027957,"threshold_uncertainty_score":0.42685166},"labels":[],"label_agreement":null},{"id":"W2020189493","doi":"10.1090/s0025-5718-2011-02555-x","title":"The distance to an irreducible polynomial, II","year":2011,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University","keywords":"Mathematics; Combinatorics; Polynomial; Integer (computer science); Degree (music); Irreducible polynomial; Reciprocal polynomial; Discrete mathematics; Matrix polynomial; Mathematical analysis; Physics","score_opus":0.03058943922189559,"score_gpt":0.26009430080941054,"score_spread":0.22950486158751496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020189493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11120367,0.000045924022,0.8859405,0.00019800277,0.00016440023,0.00014263655,7.4470734e-7,0.000053069616,0.0022510886],"genre_scores_gemma":[0.6836644,0.0000028306047,0.31625137,0.000023122942,0.000011346947,0.000005899341,4.3356073e-7,0.0000040050472,0.00003660307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928534,0.00002673598,0.0002345194,0.00014322695,0.00017875759,0.00013140641],"domain_scores_gemma":[0.9992609,0.000097132404,0.00011514684,0.00038145253,0.00008620538,0.00005918194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000292334,0.00007243038,0.00009877736,0.000073472685,0.00022881672,0.000057843794,0.00055874867,0.000021509277,0.0000026934567],"category_scores_gemma":[0.000027132286,0.000051425577,0.00004306189,0.0003430906,0.0000503519,0.00019482986,0.000118412434,0.000039671937,0.000013917913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021142612,0.0008823452,0.00008283253,0.00009435268,0.000046806712,0.000003698051,0.04594296,0.0027296373,0.0014360185,0.86974996,0.0027204072,0.07628985],"study_design_scores_gemma":[0.00042586413,0.00086605956,0.0066936514,0.00011912064,0.000024074643,0.000023297902,0.00096670975,0.42992228,0.015826901,0.54309624,0.0016219129,0.00041390615],"about_ca_topic_score_codex":0.000014793905,"about_ca_topic_score_gemma":0.0000091394,"teacher_disagreement_score":0.5724607,"about_ca_system_score_codex":0.0000068886548,"about_ca_system_score_gemma":0.00002244361,"threshold_uncertainty_score":0.20970742},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014433676744522023,"score_gpt":0.23952514866171412,"score_spread":0.2250914719171921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021553056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1304608,0.0094707785,0.85005546,0.0068155206,0.00065707794,0.00013349314,5.840767e-7,0.000028041299,0.0023782237],"genre_scores_gemma":[0.8926212,0.00047904009,0.106256604,0.0005490644,0.00008107111,0.0000010845945,1.008457e-7,0.0000029358694,0.000008872351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881464,0.00010180159,0.00053680234,0.00012016788,0.00021632915,0.00021024878],"domain_scores_gemma":[0.9987715,0.00014265058,0.0005174169,0.00026436738,0.00021006778,0.00009399952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040361815,0.00010005896,0.00035809682,0.0003087908,0.000037885875,0.000017177552,0.0007478212,0.000065669745,0.000023084573],"category_scores_gemma":[0.000085095766,0.00007733605,0.00021603602,0.0003864318,0.000102019694,0.0002773457,0.000044690023,0.00021710935,0.000004864093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016685661,0.0013178083,0.0133541785,0.00027955286,0.00034261047,0.0007821125,0.0009056068,0.0004314292,0.011716582,0.7484346,0.026741456,0.19552723],"study_design_scores_gemma":[0.007494398,0.019346526,0.31443,0.0022184672,0.0004314538,0.012993447,0.0003156297,0.0036561145,0.045586973,0.3818406,0.2100942,0.001592188],"about_ca_topic_score_codex":0.0000016208929,"about_ca_topic_score_gemma":0.0000010383892,"teacher_disagreement_score":0.7621604,"about_ca_system_score_codex":0.00001002116,"about_ca_system_score_gemma":0.00009932247,"threshold_uncertainty_score":0.31536725},"labels":[],"label_agreement":null},{"id":"W2025305695","doi":"10.1109/ccece.2014.6901023","title":"LFSR based low complexity montgomery multiplier in GF(2&lt;sup&gt;m&lt;/sup&gt;) for a class of fields","year":2014,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multiplier (economics); Cryptography; Discrete mathematics; Computer science; Polynomial; Irreducible polynomial; Arithmetic; Mathematics; Combinatorics; Algorithm","score_opus":0.0190310495187982,"score_gpt":0.23688917140660254,"score_spread":0.21785812188780435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025305695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13772324,0.00009593271,0.8556917,0.0015294612,0.00021546264,0.0005576293,0.000015346182,0.00013486331,0.00403637],"genre_scores_gemma":[0.88080114,0.0000064809674,0.11815494,0.0007273497,0.000056670928,0.00005862292,0.000007256982,0.00001368777,0.00017384082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979037,0.00013431539,0.0005163197,0.0005735181,0.00035224287,0.00051991176],"domain_scores_gemma":[0.9979622,0.00070655986,0.00012720558,0.00090468983,0.00014996591,0.00014942331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006410415,0.00024836755,0.00043823002,0.0003919553,0.00012355876,0.000078731326,0.0009700063,0.0002023301,0.00006610778],"category_scores_gemma":[0.00012343389,0.0002103668,0.00029225255,0.0007385058,0.00020837216,0.00025058188,0.00020713898,0.00019635669,0.00001603652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005775215,0.004394902,0.02843153,0.0016747327,0.00024059301,0.000043213186,0.004136325,0.039029878,0.013913457,0.7187638,0.02651754,0.16227648],"study_design_scores_gemma":[0.0023926382,0.00029612426,0.022364752,0.00007707151,0.000013888582,0.0000030573851,0.000031012427,0.9521203,0.0045478293,0.012008596,0.0057561365,0.00038859202],"about_ca_topic_score_codex":0.00017590202,"about_ca_topic_score_gemma":0.0009268384,"teacher_disagreement_score":0.9130904,"about_ca_system_score_codex":0.000023439661,"about_ca_system_score_gemma":0.00007367979,"threshold_uncertainty_score":0.8578509},"labels":[],"label_agreement":null},{"id":"W2025482144","doi":"10.1109/tc.2011.87","title":"A Fast Hardware Architecture for Integer to \\tauNAF Conversion for Koblitz Curves","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"Elliptic curve cryptography; Computer science; Integer (computer science); Cryptography; Elliptic curve; Cryptosystem; Parallel computing; Discrete mathematics; Arithmetic; Algorithm; Mathematics; Theoretical computer science; Public-key cryptography; Encryption; Operating system; Pure mathematics","score_opus":0.02585099325267172,"score_gpt":0.23782888346254275,"score_spread":0.211977890209871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025482144","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064583874,0.00004936751,0.99420357,0.0017188255,0.0019799606,0.0010324541,0.00006155898,0.00024157428,0.000066869674],"genre_scores_gemma":[0.42092842,0.000035766818,0.5739316,0.004409524,0.00008642129,0.00040024714,0.000005931064,0.000036261332,0.00016584147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987208,0.000039047976,0.00021307408,0.0005083649,0.0001695303,0.0003491728],"domain_scores_gemma":[0.9989164,0.00025556624,0.00004990503,0.0004632029,0.00012747165,0.00018745806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014391981,0.00021159751,0.00021232902,0.00038464047,0.00027101033,0.000064925254,0.0007132049,0.00007625766,0.000014341013],"category_scores_gemma":[0.0000039064607,0.00018815031,0.0003472486,0.0004616392,0.000054968106,0.00018462243,0.0000062870326,0.00015911441,0.000018651772],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007169672,0.0013993733,0.000030447272,0.0010669702,0.0005555843,0.000019414307,0.015117241,0.036588624,0.0011982393,0.0056301234,0.04182429,0.89585274],"study_design_scores_gemma":[0.014304803,0.014839919,0.0014319957,0.0051516397,0.0006407731,0.0002803318,0.0009005176,0.45915753,0.31444967,0.016833799,0.16652334,0.005485683],"about_ca_topic_score_codex":0.000031430573,"about_ca_topic_score_gemma":0.000026886739,"teacher_disagreement_score":0.89036703,"about_ca_system_score_codex":0.000028702852,"about_ca_system_score_gemma":0.000041272906,"threshold_uncertainty_score":0.7672547},"labels":[],"label_agreement":null},{"id":"W2027028382","doi":"10.1007/bfb0030345","title":"The implementation of elliptic curve cryptosystems","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hessian form of an elliptic curve; Elliptic curve cryptography; Curve25519; ElGamal encryption; Elliptic curve; Elliptic Curve Digital Signature Algorithm; Elliptic curve point multiplication; Schoof's algorithm; Tripling-oriented Doche–Icart–Kohel curve; Cryptosystem; Arithmetic; Factoring; Computation; Mathematics; Counting points on elliptic curves; Computer science; Supersingular elliptic curve; Cryptography; Algorithm; Pure mathematics; Public-key cryptography; Encryption; Quarter period; Computer security","score_opus":0.009510247810006096,"score_gpt":0.2485987547670173,"score_spread":0.2390885069570112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027028382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029602816,0.0014352042,0.9942912,0.0004096696,0.0013965286,0.00039886707,0.000004667956,0.000057600882,0.0017102363],"genre_scores_gemma":[0.8749629,0.00019759212,0.12373284,0.00026159085,0.0005476452,0.000020683648,0.0000073324586,0.000038657643,0.00023072111],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711585,0.00005007211,0.00063287525,0.000785686,0.00092485244,0.0004906705],"domain_scores_gemma":[0.99750465,0.00061319413,0.0004307151,0.0011479786,0.00023275983,0.00007072743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009774948,0.0003243581,0.00034486805,0.00052794314,0.00035809516,0.00039562903,0.0027176593,0.00015810295,0.0000060756183],"category_scores_gemma":[0.000016563898,0.00022624509,0.00017082875,0.00070857676,0.0007529682,0.00028276752,0.0005987918,0.0003917208,0.000010197614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035710218,0.000025519203,0.00059360825,0.00007747268,0.000027737775,0.000026508831,0.0007228763,0.010575378,0.00026420143,0.17514373,0.00011765127,0.81242174],"study_design_scores_gemma":[0.001034949,0.0006907731,0.0055322787,0.00083864335,0.000047627273,0.00013722666,0.0000039177226,0.25458997,0.013688238,0.70938283,0.012373222,0.001680318],"about_ca_topic_score_codex":0.00016102976,"about_ca_topic_score_gemma":0.0003956234,"teacher_disagreement_score":0.8746669,"about_ca_system_score_codex":0.000097141696,"about_ca_system_score_gemma":0.00034277808,"threshold_uncertainty_score":0.9226007},"labels":[],"label_agreement":null},{"id":"W2029686497","doi":"10.1109/tcsii.2002.1013871","title":"A note on \"A high-speed residue-to-binary converter for three-moduli (2/sup k/ 2/sup k/ - 1, 2/sup k-1/ - 1) RNS and a scheme for its VLSI implementation\"","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Binary number; Moduli; Converters; Residue (chemistry); Mathematics; Product (mathematics); Very-large-scale integration; Residue number system; Square root; Algorithm; Arithmetic; Discrete mathematics; Physics; Voltage; Electrical engineering; Chemistry; Engineering; Quantum mechanics; Organic chemistry","score_opus":0.03180795134612079,"score_gpt":0.26332150123868925,"score_spread":0.23151354989256845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029686497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11361747,0.00080740784,0.88346595,0.00044927516,0.00012307451,0.0010636512,0.00022382043,0.00010319369,0.00014618135],"genre_scores_gemma":[0.9988139,0.00002774438,0.00043484237,0.00023150834,0.00011518537,0.0001321247,0.000009835214,0.000026457166,0.00020838436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979784,0.000030333464,0.0004546632,0.0007727828,0.0002941634,0.00046966964],"domain_scores_gemma":[0.99897957,0.00023855668,0.0001165379,0.00018930055,0.00019135691,0.0002846579],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00022475113,0.00032680648,0.00038325237,0.00031744246,0.0012713531,0.0010834922,0.00019585803,0.00013179162,0.000009182393],"category_scores_gemma":[0.0000067583583,0.00028227572,0.00010857825,0.0004123496,0.00011670661,0.0010204917,0.00000946806,0.0001410253,0.0000033362314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018162692,0.00059912645,0.00022762065,0.0014169301,0.0002635423,0.000021294369,0.0068264464,0.0041562975,0.003017183,0.004221329,0.000756731,0.9783119],"study_design_scores_gemma":[0.0034269327,0.0032199791,0.00029914628,0.0005784036,0.000116412404,0.000116840296,0.00068804267,0.9861542,0.0013378669,0.0018280122,0.001434089,0.0008000835],"about_ca_topic_score_codex":0.000029635261,"about_ca_topic_score_gemma":0.000022071148,"teacher_disagreement_score":0.9819979,"about_ca_system_score_codex":0.000028765637,"about_ca_system_score_gemma":0.000042647243,"threshold_uncertainty_score":0.9999629},"labels":[],"label_agreement":null},{"id":"W2029804632","doi":"10.1007/s10845-009-0248-z","title":"RETRACTED ARTICLE: An integrated parallel GNFS algorithm for integer factorization based on Linbox Montgomery’s block Lanczos method over GF(2)","year":2009,"lang":"en","type":"article","venue":"Journal of Intelligent Manufacturing","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":true,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University; St. Francis Xavier University","funders":"","keywords":"Lanczos resampling; Factorization; Block (permutation group theory); Integer (computer science); Algorithm; Computer science; Mathematics; Parallel computing; Combinatorics; Physics","score_opus":0.016557363676827624,"score_gpt":0.28642449542524867,"score_spread":0.26986713174842103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029804632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059481394,0.000082677376,0.93882465,0.00051314477,0.0006786569,0.0002743686,0.0000050378785,0.00008134311,0.00005871867],"genre_scores_gemma":[0.62311894,0.000045810208,0.37591708,0.0005657303,0.00028410647,0.000004132212,0.000006490515,0.00001784359,0.000039868508],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975963,0.00018179555,0.00083584856,0.00037475905,0.0005930557,0.00041823924],"domain_scores_gemma":[0.99804,0.00035086856,0.0005564213,0.00044151058,0.00034135027,0.00026981995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088807597,0.0003111928,0.00041821,0.00068062963,0.00014957758,0.00029809185,0.0007615299,0.00021910707,0.000035174497],"category_scores_gemma":[0.00012340909,0.00023264927,0.00035481772,0.00039813525,0.00002469397,0.0007017418,0.000031353866,0.0007513787,0.000005251318],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027106472,0.00087030977,0.00017219492,0.000021304579,0.00013559748,0.00008641044,0.001366291,0.059256755,0.0030161578,0.00074224605,0.00036988387,0.9336918],"study_design_scores_gemma":[0.0010981577,0.0017460316,0.010173044,0.00021922847,0.00006238607,0.00006559136,0.00015252686,0.64716876,0.33100584,0.0037202355,0.0041436334,0.0004445538],"about_ca_topic_score_codex":0.00001891862,"about_ca_topic_score_gemma":0.00000589525,"teacher_disagreement_score":0.9332472,"about_ca_system_score_codex":0.00012901661,"about_ca_system_score_gemma":0.00008764477,"threshold_uncertainty_score":0.94871616},"labels":[],"label_agreement":null},{"id":"W2030413992","doi":"10.1016/j.micpro.2013.03.003","title":"High performance scalable elliptic curve cryptosystem processor for Koblitz curves","year":2013,"lang":"en","type":"article","venue":"Microprocessors and Microsystems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Elliptic curve cryptography; Scalability; NIST; Field-programmable gate array; Elliptic Curve Digital Signature Algorithm; Lookup table; Elliptic curve; Elliptic curve point multiplication; Cryptography; Parallel computing; Arithmetic; Computer hardware; Clock rate; Embedded system; Algorithm; Public-key cryptography; Encryption; Operating system; Mathematics; Chip","score_opus":0.006696608146247947,"score_gpt":0.19538096837374205,"score_spread":0.1886843602274941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030413992","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92339766,0.025799492,0.046453577,0.00086658663,0.00076439715,0.0022004596,0.000032467255,0.00031475822,0.00017060996],"genre_scores_gemma":[0.9858183,0.0011779371,0.010376859,0.00038661648,0.00014943072,0.00069337134,0.000015551956,0.000041726795,0.0013401936],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997457,0.000054727734,0.00062498235,0.0008377856,0.00026180915,0.00076369074],"domain_scores_gemma":[0.99831444,0.00010767831,0.0002837476,0.0005498312,0.0005334031,0.00021088921],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050247693,0.00039619257,0.0005510198,0.00022147657,0.0005269358,0.0006931796,0.00090716017,0.00016426339,0.000014839469],"category_scores_gemma":[0.00002401148,0.00031508904,0.00012011969,0.000741363,0.00012946122,0.001048808,0.00018127832,0.00017514278,0.0000943852],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001295922,0.0011890474,0.02934476,0.10348576,0.00065794785,0.000021463573,0.005940713,0.0001769009,0.69436914,0.029844346,0.05369606,0.08114429],"study_design_scores_gemma":[0.00984934,0.002293003,0.025711928,0.015682666,0.00033668446,0.001435474,0.0014031506,0.03838515,0.7587845,0.0050957785,0.13490918,0.006113165],"about_ca_topic_score_codex":0.00031741773,"about_ca_topic_score_gemma":0.000016018681,"teacher_disagreement_score":0.087803096,"about_ca_system_score_codex":0.000032604865,"about_ca_system_score_gemma":0.000096423515,"threshold_uncertainty_score":0.99993014},"labels":[],"label_agreement":null},{"id":"W2031838948","doi":"10.5539/jmr.v6n1p70","title":"Attack on ``Strong Diffie-Hellman-DSA KE\" and Improvement","year":2014,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Diffie–Hellman key exchange; Computer security; Computer science; Public-key cryptography; Key exchange","score_opus":0.09726815427541152,"score_gpt":0.38163107695663495,"score_spread":0.28436292268122343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031838948","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75419784,0.00032003736,0.23603073,0.0034460372,0.00026755015,0.00024061796,7.538869e-7,0.000020420843,0.0054760445],"genre_scores_gemma":[0.9533139,0.00019858115,0.045962855,0.00007270418,0.00017619274,0.0000032919793,8.917242e-8,0.000011597231,0.0002607947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978881,0.00013885771,0.00039028932,0.00015462692,0.0010951303,0.00033300585],"domain_scores_gemma":[0.9980939,0.00085946475,0.00017401735,0.00039819596,0.00028800743,0.00018640667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033904351,0.00010028047,0.0002285625,0.00044293684,0.00016682656,0.0002500077,0.0007630061,0.000053056225,0.000012533721],"category_scores_gemma":[0.0002819542,0.000068097565,0.00009299662,0.00030768657,0.00011532222,0.00017389424,0.00027024542,0.0005275391,0.000023779496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007821178,0.0031533542,0.0011352721,0.0012131664,0.0003532102,0.00018150237,0.0076242057,0.00041597916,0.02156001,0.58846706,0.018126616,0.35769144],"study_design_scores_gemma":[0.008255584,0.018340979,0.012485985,0.002643692,0.00009253607,0.0010347586,0.0034830382,0.34200367,0.048120655,0.51438785,0.047750212,0.0014010501],"about_ca_topic_score_codex":0.0000023154253,"about_ca_topic_score_gemma":0.000002110444,"teacher_disagreement_score":0.35629037,"about_ca_system_score_codex":0.000031478252,"about_ca_system_score_gemma":0.000047567803,"threshold_uncertainty_score":0.2776938},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0073200770221909794,"score_gpt":0.2511822582921134,"score_spread":0.2438621812699224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037497641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41942617,0.006257348,0.5550335,0.012597332,0.0012997543,0.0003209097,0.00001775063,0.00006967765,0.0049775583],"genre_scores_gemma":[0.9932908,0.00014404187,0.00593704,0.0004585963,0.00014479736,9.0877023e-7,4.4212277e-7,0.0000063088337,0.000017089504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983688,0.00032140015,0.00052922836,0.00013945728,0.0003921833,0.0002489329],"domain_scores_gemma":[0.9982152,0.0005238104,0.0005512628,0.00049587217,0.00010257197,0.00011126089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014451875,0.0001523628,0.00029777756,0.00013787326,0.00010966456,0.00007736752,0.0012129218,0.00005788959,0.00018538845],"category_scores_gemma":[0.000040794843,0.00008802921,0.00046237715,0.00070001686,0.00019213988,0.00035193196,0.000056641802,0.0003456426,0.000013828547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010917681,0.0005934442,0.004348092,0.000015819267,0.0002405585,0.00008209772,0.002257688,0.00009077713,0.00020847036,0.9683654,0.0027728223,0.0209157],"study_design_scores_gemma":[0.00054348196,0.00026609818,0.09980829,0.00011317003,0.00007318033,0.00041355815,0.000113809525,0.0001722196,0.00061574834,0.89308107,0.0046491832,0.00015020286],"about_ca_topic_score_codex":0.0000022218571,"about_ca_topic_score_gemma":0.0000013458815,"teacher_disagreement_score":0.5738646,"about_ca_system_score_codex":0.000007644913,"about_ca_system_score_gemma":0.00008351748,"threshold_uncertainty_score":0.3589727},"labels":[],"label_agreement":null},{"id":"W2038828464","doi":"10.1007/s10623-007-9101-6","title":"On τ-adic representations of integers","year":2007,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptosystem; Base (topology); Mathematics; Representation (politics); Computation; Key (lock); Hamming code; Arithmetic; Hamming distance; Hamming weight; Cryptography; Discrete mathematics; Elliptic curve; Computer science; Algorithm; Pure mathematics; Mathematical analysis","score_opus":0.016921586223117943,"score_gpt":0.26685874590883013,"score_spread":0.24993715968571217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038828464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106846154,0.00044959874,0.88707584,0.00013542113,0.00011710039,0.0001327483,0.0000031250352,0.00007797265,0.005162019],"genre_scores_gemma":[0.949586,0.00012496448,0.050072934,0.00017963581,0.000015903055,0.000005753361,0.0000017683707,0.0000063504467,0.000006718566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890727,0.000049197555,0.0002548927,0.0003092961,0.00022759174,0.00025174758],"domain_scores_gemma":[0.99891573,0.0003999572,0.00009152762,0.00040116816,0.00006875686,0.00012283781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044076802,0.00013018935,0.00016513206,0.0006397136,0.0001429853,0.000059609003,0.00033864236,0.000062224164,0.000011170849],"category_scores_gemma":[0.000026231233,0.000109794106,0.00015588915,0.0012283897,0.00022651395,0.00014446671,0.000055835662,0.000118279,0.0000027228114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032207834,0.0001440974,0.0064663356,0.000024155153,0.00006440783,0.000018753884,0.00072898937,0.000042794167,0.004477336,0.9595055,0.000544416,0.027951038],"study_design_scores_gemma":[0.002328863,0.002125875,0.25872883,0.0002602986,0.000112500864,0.00009512925,0.0015669246,0.003471343,0.06838949,0.65806705,0.0036854183,0.001168316],"about_ca_topic_score_codex":0.000046179783,"about_ca_topic_score_gemma":0.000013002574,"teacher_disagreement_score":0.8427398,"about_ca_system_score_codex":0.0000036998063,"about_ca_system_score_gemma":0.000014665276,"threshold_uncertainty_score":0.44772735},"labels":[],"label_agreement":null},{"id":"W2039117743","doi":"10.1137/s0895480103437651","title":"Alternative Digit Sets for Nonadjacent Representations","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer (computer science); Mathematics; Set (abstract data type); Representation (politics); Combinatorics; Discrete mathematics; Numerical digit; Arithmetic; Computer science","score_opus":0.027856050169179917,"score_gpt":0.3162148602328879,"score_spread":0.288358810063708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039117743","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012020696,0.000111176865,0.97492313,0.005517454,0.0003597387,0.00033765179,0.000015712323,0.00006640935,0.006648037],"genre_scores_gemma":[0.47010735,0.00014642799,0.5281843,0.0005803985,0.00038573318,0.00003581896,0.000003987055,0.000028176755,0.00052783155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986283,0.00003708856,0.00040182096,0.00021578636,0.00041649173,0.00030051678],"domain_scores_gemma":[0.9986921,0.0003394795,0.00026086185,0.0004014871,0.0001297595,0.00017633747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002838716,0.00016022143,0.00019262145,0.00018446326,0.0002985039,0.0003841442,0.00069174485,0.000041341937,0.000026418224],"category_scores_gemma":[0.0001145455,0.00011804675,0.00024197147,0.00023290755,0.000049179784,0.00044362352,0.00008917747,0.00021364458,0.000047301557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027414548,0.00074194814,0.00008986601,0.00009102232,0.00027844045,0.000054946042,0.0076112007,0.008287209,0.00025502295,0.90204763,0.007704546,0.07281078],"study_design_scores_gemma":[0.0020758596,0.0006144243,0.0004920856,0.00037056368,0.00006930759,0.00060636137,0.00057100743,0.27225226,0.008877366,0.6888581,0.024565062,0.00064757303],"about_ca_topic_score_codex":0.0000011284617,"about_ca_topic_score_gemma":0.0000037276504,"teacher_disagreement_score":0.45808664,"about_ca_system_score_codex":0.000050169034,"about_ca_system_score_gemma":0.000046238787,"threshold_uncertainty_score":0.48138067},"labels":[],"label_agreement":null},{"id":"W2039539413","doi":"10.1088/1742-6596/256/1/012009","title":"Fast polynomial multiplication on a GPU","year":2010,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Multiplication (music); CUDA; Speedup; Univariate; Polynomial; Computer science; Parallel computing; Computation; Symbolic computation; Fast Fourier transform; Arithmetic; Mathematics; Algorithm; Combinatorics","score_opus":0.013096729564846503,"score_gpt":0.23708461448310994,"score_spread":0.22398788491826344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039539413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47186077,0.0000226909,0.52013266,0.003697421,0.0017071166,0.000112967595,0.0000039560173,0.00005000084,0.0024124426],"genre_scores_gemma":[0.9812238,0.000017953478,0.018249877,0.00008001924,0.00037980604,0.0000016074135,4.016314e-7,0.0000044275844,0.000042092495],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992486,0.00002716212,0.00022140556,0.00012316306,0.00024245429,0.00013720272],"domain_scores_gemma":[0.9990254,0.000055524084,0.00026712773,0.00028611277,0.00028272337,0.00008312765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013803357,0.000101157486,0.00015167483,0.000082267914,0.00010002456,0.00018288198,0.0006064476,0.000047879916,0.000009899646],"category_scores_gemma":[0.00003099792,0.00007855465,0.00011231055,0.00021363361,0.00010619166,0.000765919,0.000059422087,0.00037708995,0.000013374035],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004557903,0.00016754704,0.00047930362,0.000007947219,0.00002921342,0.000009651134,0.0013704296,0.000041665786,0.14533876,0.4083103,0.00034865458,0.44385093],"study_design_scores_gemma":[0.0011346916,0.0011159482,0.036121316,0.00009612079,0.000027499224,0.00020175597,0.0002921715,0.0017887533,0.8625141,0.08841901,0.007841998,0.00044663093],"about_ca_topic_score_codex":0.0000052222026,"about_ca_topic_score_gemma":0.000011297074,"teacher_disagreement_score":0.71717536,"about_ca_system_score_codex":0.0000065181175,"about_ca_system_score_gemma":0.00013339399,"threshold_uncertainty_score":0.32033658},"labels":[],"label_agreement":null},{"id":"W2041025829","doi":"10.1007/s11265-013-0791-x","title":"Design and Implementation of a Polynomial Basis Multiplier Architecture Over GF(2m)","year":2013,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); Terry Fox Research Institute","funders":"","keywords":"Polynomial basis; Parameterized complexity; Finite field; Multiplier (economics); Multiplication (music); Mathematics; Primitive polynomial; Polynomial; Irreducible polynomial; Galois theory; Computer science; Architecture; Arithmetic; GF(2); Discrete mathematics; Algorithm; Combinatorics; Matrix polynomial","score_opus":0.010566772267949831,"score_gpt":0.24820924818032028,"score_spread":0.23764247591237045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041025829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18702401,0.0017619965,0.81060386,0.00023751806,0.00013166553,0.00021150836,6.325227e-7,0.000010521293,0.000018254075],"genre_scores_gemma":[0.9575675,0.000011348558,0.042232085,0.000033271244,0.00013393065,0.0000054569628,1.1568138e-7,0.00000719094,0.000009083165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986617,0.00012651703,0.00053741253,0.00013822116,0.0003651532,0.00017101674],"domain_scores_gemma":[0.99878645,0.00011945885,0.00065867207,0.0000936339,0.00024428032,0.000097484415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054162316,0.00011632342,0.0002525039,0.00028174894,0.00010066914,0.00027670318,0.00029037378,0.000056085795,0.00001526719],"category_scores_gemma":[0.0000070288684,0.00008222861,0.00007502765,0.00025876806,0.000061068095,0.0005013975,0.000045715762,0.00015738484,0.0000011550264],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011580971,0.00021431224,0.010829252,0.001094403,0.00030161053,0.000043291468,0.015692942,0.009656301,0.17450863,0.00028363944,0.0029881906,0.7842716],"study_design_scores_gemma":[0.020416502,0.006810449,0.25712523,0.0071442164,0.0006770374,0.0064763958,0.014478148,0.51509106,0.15593292,0.009384525,0.0035023883,0.0029611518],"about_ca_topic_score_codex":0.00011989376,"about_ca_topic_score_gemma":0.0000011078479,"teacher_disagreement_score":0.7813105,"about_ca_system_score_codex":0.000021334365,"about_ca_system_score_gemma":0.00011491285,"threshold_uncertainty_score":0.33531854},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Isogeny; Finite field; Cardinality (data modeling); Quantum algorithm; Quantum Fourier transform; Elliptic curve; Quantum; Cryptosystem; Endomorphism; Discrete logarithm","score_opus":0.0096042011635041,"score_gpt":0.2281385526665449,"score_spread":0.2185343515030408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045890225","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72202784,0.00023017189,0.27383655,0.0027363363,0.00031634266,0.00012028999,3.1570752e-7,0.000022921862,0.0007092394],"genre_scores_gemma":[0.8626419,0.000012270462,0.13717048,0.00007122349,0.00008172056,0.0000037502966,1.6017417e-7,0.000007682998,0.000010859047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818367,0.00019894322,0.000827746,0.00016103462,0.0002788909,0.00034969219],"domain_scores_gemma":[0.9986447,0.00048106347,0.000353732,0.00023251578,0.00015934285,0.00012865181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057825766,0.00014261427,0.0004914841,0.00037758859,0.000047265094,0.00009968667,0.0006684976,0.000121258,0.00021888112],"category_scores_gemma":[0.00032171907,0.00010591675,0.0001865223,0.0003502695,0.0001335951,0.00043772988,0.00013434705,0.0003664798,0.00033496137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023116372,0.0004325335,0.0041111954,0.00010688481,0.0001068963,0.00027074912,0.0011801261,0.000033891367,0.006959332,0.9796296,0.0009724178,0.0061732833],"study_design_scores_gemma":[0.0011063623,0.00040825,0.0036033622,0.0001552658,0.0000322418,0.0042746933,0.0007909066,0.050183516,0.0016583201,0.9374172,0.00008200917,0.0002878751],"about_ca_topic_score_codex":0.0000050455733,"about_ca_topic_score_gemma":0.000001403978,"teacher_disagreement_score":0.14061402,"about_ca_system_score_codex":0.000027748327,"about_ca_system_score_gemma":0.000059134407,"threshold_uncertainty_score":0.43191597},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04918734259861358,"score_gpt":0.29149001394448276,"score_spread":0.2423026713458692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048276889","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07772832,0.00039760233,0.9210101,0.00018240037,0.00010044479,0.00031862265,0.000005362724,0.00010333403,0.00015384817],"genre_scores_gemma":[0.48176843,0.000030663334,0.518104,0.000024817446,0.000040319057,0.000004638128,0.000008288127,0.000007662641,0.000011180802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988524,0.00002958972,0.00044457018,0.00019909981,0.00028619193,0.00018819791],"domain_scores_gemma":[0.99863714,0.0006258401,0.0002685123,0.00022063522,0.00019976065,0.000048127138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002864839,0.00012937219,0.0002924003,0.00016119267,0.00017765674,0.00002992766,0.00039680934,0.000044786255,0.0000010656331],"category_scores_gemma":[0.00005100951,0.000120061086,0.00013968656,0.00037343364,0.00009263838,0.00017806904,0.000090211295,0.000061022576,0.0000058558617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030308054,0.0032565296,0.009673555,0.021105116,0.0015314667,0.000046668658,0.08779833,0.14747487,0.0038260843,0.31575617,0.009674973,0.39982593],"study_design_scores_gemma":[0.0004957641,0.00018749146,0.0038660008,0.00038375155,0.000041990344,0.000035521916,0.00009828119,0.9412798,0.0043889573,0.048927937,0.00004186077,0.0002525871],"about_ca_topic_score_codex":0.0000035238877,"about_ca_topic_score_gemma":3.2250466e-7,"teacher_disagreement_score":0.793805,"about_ca_system_score_codex":0.000009480763,"about_ca_system_score_gemma":0.000034151082,"threshold_uncertainty_score":0.4895949},"labels":[],"label_agreement":null},{"id":"W2048290165","doi":"10.1007/3-540-44499-8_21","title":"Montgomery Multiplier and Squarer in GF(2m)","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Trinomial; GF(2); Multiplier (economics); Finite field; Primitive polynomial; Mathematics; Multiplication (music); Polynomial basis; Arithmetic; Discrete mathematics; Basis (linear algebra); Irreducible polynomial; Standard basis; Combinatorics; Polynomial; Matrix polynomial; Mathematical analysis","score_opus":0.009078973731472182,"score_gpt":0.21648151473383287,"score_spread":0.2074025410023607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048290165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019818493,0.0024330926,0.98854756,0.0006976684,0.0008273313,0.00041365402,0.0000037971918,0.000117790776,0.004977247],"genre_scores_gemma":[0.6908848,0.0007255637,0.30564508,0.002005039,0.00036982162,0.000020500553,0.0000038478533,0.000054289656,0.0002910363],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965237,0.000037207403,0.00048056568,0.0015762594,0.0006933155,0.0006889813],"domain_scores_gemma":[0.9981169,0.00040458702,0.00013019393,0.0010952512,0.00006966491,0.000183406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005631359,0.0004974753,0.00051437353,0.0015465408,0.000187069,0.00043931906,0.001965288,0.00036051928,0.000029550316],"category_scores_gemma":[0.00002797676,0.00043872913,0.00011852788,0.0009117031,0.0008529156,0.00052291126,0.0008714222,0.00088096515,0.00002871486],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008706473,0.000045784618,0.0008044776,0.000032682856,0.000008628459,0.00023841564,0.0013151594,0.009204279,0.000049752354,0.010490349,0.000011225601,0.97779053],"study_design_scores_gemma":[0.0012267857,0.00030679937,0.013452361,0.0010168091,0.000014517341,0.00024120939,6.4882056e-7,0.43293735,0.00058596814,0.54354686,0.004783204,0.0018874871],"about_ca_topic_score_codex":0.000080711594,"about_ca_topic_score_gemma":0.0002645443,"teacher_disagreement_score":0.97590303,"about_ca_system_score_codex":0.00009886623,"about_ca_system_score_gemma":0.0002135014,"threshold_uncertainty_score":0.99980646},"labels":[],"label_agreement":null},{"id":"W2049790467","doi":"10.1109/conielecomp.2013.6525770","title":"A performance comparison of elliptic curve scalar multiplication algorithms on smartphones","year":2013,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Scalar multiplication; Elliptic curve cryptography; Computer science; Cryptography; Elliptic curve; Elliptic Curve Digital Signature Algorithm; Algorithm; Binary number; Scalar (mathematics); Encryption; Arithmetic; Prime (order theory); Public-key cryptography; Mathematics; Operating system","score_opus":0.017460933315884566,"score_gpt":0.254121612914921,"score_spread":0.23666067959903647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049790467","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81674445,0.0001022394,0.17991643,0.0004537585,0.00017500417,0.00028441806,4.94266e-7,0.000114446404,0.0022087407],"genre_scores_gemma":[0.94895655,0.00002716726,0.050787684,0.00006545422,0.000021513788,0.00003358945,0.0000015248867,0.0000046660266,0.000101858546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990048,0.000035307363,0.00025782507,0.00025498815,0.0002376599,0.00020941338],"domain_scores_gemma":[0.9991264,0.000101481164,0.00009615205,0.0004971984,0.00011280677,0.00006600194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012900658,0.00010867885,0.00016335226,0.00014453533,0.000096302305,0.00005311635,0.0004900914,0.000051473256,0.00004140607],"category_scores_gemma":[0.000011000858,0.000081714345,0.00006792878,0.00045316658,0.00006847471,0.00031715108,0.000090479,0.0000940454,0.00030763244],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001060421,0.0009586123,0.15341271,0.00009797629,0.000046455865,6.394669e-7,0.0017659699,0.0014151067,0.008350798,0.023492897,0.0017091419,0.80873907],"study_design_scores_gemma":[0.00024083347,0.0002039468,0.24960083,0.000026862295,0.0000037460038,0.0000018828727,0.000047494694,0.712326,0.036761098,0.0004214683,0.00023546763,0.00013038625],"about_ca_topic_score_codex":0.00010678624,"about_ca_topic_score_gemma":0.0000042181837,"teacher_disagreement_score":0.8086087,"about_ca_system_score_codex":0.000009233417,"about_ca_system_score_gemma":0.000013566232,"threshold_uncertainty_score":0.39540952},"labels":[],"label_agreement":null},{"id":"W2051417138","doi":"10.1117/12.506144","title":"High-performance finite field multiplier for cryptographic applications","year":2003,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Finite field; Elliptic Curve Digital Signature Algorithm; Computer science; Finite field arithmetic; Elliptic curve cryptography; NIST; Field-programmable gate array; Multiplier (economics); Parallel computing; Cryptography; Binary number; Multiplication (music); Arithmetic; Lookup table; Computational science; Mathematics; Computer hardware; Algorithm; Public-key cryptography; Discrete mathematics; Encryption","score_opus":0.008559537215350646,"score_gpt":0.21454831399185675,"score_spread":0.20598877677650612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051417138","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9691436,0.00012736049,0.0267295,0.0016593521,0.00026810868,0.000924235,0.000020545533,0.000116051895,0.0010112341],"genre_scores_gemma":[0.4342583,0.00013575047,0.56448215,0.0001767185,0.00017525387,0.00067065493,0.0000032097896,0.000030308745,0.00006763569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981095,1.528308e-8,0.0005607346,0.00044703585,0.00046968245,0.00041303082],"domain_scores_gemma":[0.99784184,0.00040950926,0.00029062195,0.00011086102,0.0012333514,0.000113832735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000553457,0.00027098288,0.00031582723,0.00017047628,0.0001786491,0.00014853723,0.0014015093,0.00018107689,0.00000492999],"category_scores_gemma":[0.000379566,0.00022601208,0.00060973293,0.0007011739,0.00016157814,0.0005890399,0.00012768977,0.0002516167,0.0000013287308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025855565,0.00012776033,0.0004526026,0.00034996474,0.00022595668,2.050206e-8,0.00010603462,0.0003225228,0.076660424,0.919637,0.00087777775,0.0012140321],"study_design_scores_gemma":[0.0047246544,0.0015621346,0.003680841,0.0005929632,0.00035643787,0.000034159933,0.0008235084,0.21692125,0.66424996,0.055679206,0.049824953,0.0015499303],"about_ca_topic_score_codex":0.0000039560637,"about_ca_topic_score_gemma":1.0401244e-7,"teacher_disagreement_score":0.8639578,"about_ca_system_score_codex":0.000040082152,"about_ca_system_score_gemma":0.000032877404,"threshold_uncertainty_score":0.9216505},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.008492376036877417,"score_gpt":0.23112979784971635,"score_spread":0.22263742181283894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052917298","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50043595,0.000032546093,0.4988671,0.00014166231,0.000074466654,0.00019409112,7.3207246e-7,0.000040239633,0.00021323506],"genre_scores_gemma":[0.8218463,0.000007705693,0.17806937,0.000015266405,0.000019909225,0.0000041229036,0.0000059621957,0.000010640265,0.000020717831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843,0.00008510302,0.0006062474,0.0002790132,0.00031721187,0.00028242587],"domain_scores_gemma":[0.99917424,0.00024272586,0.0002171733,0.00025495427,0.000065887056,0.000045028504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047089637,0.00015657382,0.0003257221,0.00048251043,0.000048283327,0.000073921175,0.0004261533,0.00007769776,0.0000058748924],"category_scores_gemma":[0.00003712939,0.00015284636,0.00007272125,0.0009780764,0.000059710637,0.0002458827,0.00013246216,0.00015127023,0.000028969807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008552998,0.003901027,0.013223568,0.0012370049,0.00013863364,0.0005017782,0.03308444,0.73643786,0.01193425,0.10267767,0.0001822257,0.096596],"study_design_scores_gemma":[0.0008016802,0.00009282313,0.012794669,0.00020078085,0.000008036871,0.00003634198,0.00008741951,0.9496947,0.00035226846,0.035734326,0.000010277195,0.0001866658],"about_ca_topic_score_codex":0.000107579035,"about_ca_topic_score_gemma":0.000049705242,"teacher_disagreement_score":0.32141036,"about_ca_system_score_codex":0.000036764708,"about_ca_system_score_gemma":0.00003842995,"threshold_uncertainty_score":0.62328935},"labels":[],"label_agreement":null},{"id":"W2054624343","doi":"10.1007/978-3-540-73074-3_8","title":"Software Implementation of Arithmetic in","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Computer science; Arithmetic; Software; Programming language; Parallel computing; Operating system; Mathematics","score_opus":0.01772805092297768,"score_gpt":0.28099584037428516,"score_spread":0.26326778945130747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054624343","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006703938,0.000648787,0.99688774,0.00016770702,0.00070004154,0.00032806778,0.0000038395806,0.000059088117,0.00053432235],"genre_scores_gemma":[0.2243599,0.00009000352,0.7748561,0.00048441085,0.00014416999,0.000006159695,0.0000045065863,0.000023869643,0.00003089961],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697405,0.000026650056,0.00065300177,0.00096349686,0.00084609527,0.0005366753],"domain_scores_gemma":[0.99816394,0.00042187268,0.00028385184,0.00086741196,0.00016599851,0.000096928095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010582,0.00033351092,0.00043616717,0.002149403,0.00008411569,0.00013224978,0.0019945616,0.00023321256,0.000025634035],"category_scores_gemma":[0.000039134015,0.00031204944,0.00013108997,0.0014609069,0.0005347408,0.0003552199,0.0006752631,0.0005459449,0.0000072300822],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026577354,0.000026136042,0.0014621662,0.00004823961,0.000006181924,0.00007062447,0.00078054785,0.0033430594,0.000038701888,0.01373481,0.0000024758858,0.9804844],"study_design_scores_gemma":[0.0019640673,0.0008614701,0.041504454,0.0015337103,0.0000299803,0.00018451773,0.000003689196,0.0983572,0.013516075,0.8386599,0.001279891,0.002105051],"about_ca_topic_score_codex":0.0001460371,"about_ca_topic_score_gemma":0.00096227264,"teacher_disagreement_score":0.97837937,"about_ca_system_score_codex":0.00014388277,"about_ca_system_score_gemma":0.0003794126,"threshold_uncertainty_score":0.9999332},"labels":[],"label_agreement":null},{"id":"W2055581003","doi":"10.1090/s0025-5718-07-01980-1","title":"Efficient CM-constructions of elliptic curves over finite fields","year":2007,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Finite field; Elliptic curve; Order (exchange); Factorization; Omega; Combinatorics; Prime (order theory); Integer (computer science); Schoof's algorithm; Polynomial; Prime factor; Discrete mathematics; Quarter period; Mathematical analysis; Algorithm; Physics","score_opus":0.01107338181952988,"score_gpt":0.2570914250786089,"score_spread":0.246018043259079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055581003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22633849,0.00016300012,0.772361,0.000059121023,0.00012634747,0.000101182304,0.000001194881,0.000028216426,0.00082146056],"genre_scores_gemma":[0.7806173,0.000011496941,0.21933053,0.000020168483,0.000008891518,0.0000010235492,0.0000010861266,0.0000030981737,0.0000063929638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990826,0.000017097263,0.00040818012,0.00011140917,0.00026564716,0.00011503169],"domain_scores_gemma":[0.99885076,0.00052521605,0.0002426781,0.00021646052,0.00013187001,0.000032996613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037771068,0.00007502056,0.00016233412,0.00020753336,0.000041336454,0.000012981157,0.00021646464,0.00004211196,0.00000766739],"category_scores_gemma":[0.000059557187,0.000068037014,0.000089247784,0.00048556243,0.000080394835,0.000049120492,0.00005514247,0.00006196245,0.0000033240417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000104856135,0.0011694602,0.0007477427,0.0026916827,0.00013308584,0.000007459791,0.008103526,0.38185152,0.002176092,0.57449603,0.00032579445,0.028287081],"study_design_scores_gemma":[0.0002762543,0.000089247995,0.0046723206,0.00039917766,0.000027816399,0.000013172044,0.00012055861,0.9279404,0.006345742,0.05997894,0.0000126568775,0.00012365905],"about_ca_topic_score_codex":0.000006226239,"about_ca_topic_score_gemma":0.0000024043236,"teacher_disagreement_score":0.5542788,"about_ca_system_score_codex":0.000006194626,"about_ca_system_score_gemma":0.00002162458,"threshold_uncertainty_score":0.2774469},"labels":[],"label_agreement":null},{"id":"W2057734830","doi":"10.1109/pacrim.2013.6625466","title":"New and improved word-based unified and scalable architecture for radix 2 Montgomery modular multiplication algorithm","year":2013,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Adder; Computer science; Scalability; Operand; Parallel computing; Modular arithmetic; Application-specific integrated circuit; Throughput; Arithmetic; Word (group theory); Critical path method; Modular design; Multiplication (music); Architecture; Multiplication algorithm; Algorithm; Computer hardware; Binary number; Mathematics; Latency (audio); Engineering; Cryptography","score_opus":0.005954661384605956,"score_gpt":0.20119214380271125,"score_spread":0.1952374824181053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057734830","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021633504,0.00062140456,0.9742991,0.0025010563,0.000057092355,0.00071176427,0.0000019689505,0.00012024747,0.00005387932],"genre_scores_gemma":[0.1271225,0.000021214153,0.8721603,0.00029453714,0.000041124684,0.00008467206,0.000004515073,0.000009133137,0.00026198843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991336,0.000020491876,0.00013890683,0.00039067696,0.000086781445,0.0002295543],"domain_scores_gemma":[0.9992394,0.00013344533,0.00004434555,0.00034811246,0.0000588924,0.0001758149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000099133285,0.00013342497,0.00013374099,0.000135868,0.00013402116,0.00021428273,0.00021958872,0.00007476416,0.000008981824],"category_scores_gemma":[0.000014124123,0.000103515784,0.00004531937,0.00025645227,0.000050734885,0.00023097981,0.00007098292,0.00007877715,0.0000020535742],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000545946,0.000027216165,0.00012647294,0.000017372608,0.000019210785,3.2998003e-7,0.00012610645,0.00012343972,0.010678342,0.0015124512,0.00051661977,0.986847],"study_design_scores_gemma":[0.0012699177,0.00010327446,0.010835725,0.0000113162805,0.000013131298,0.0000059016975,0.000017227287,0.959805,0.007243703,0.01875788,0.0017261276,0.00021075939],"about_ca_topic_score_codex":0.0005992807,"about_ca_topic_score_gemma":0.000029841429,"teacher_disagreement_score":0.9866362,"about_ca_system_score_codex":0.000005483256,"about_ca_system_score_gemma":0.00003500445,"threshold_uncertainty_score":0.4221251},"labels":[],"label_agreement":null},{"id":"W2059714621","doi":"10.1109/dictap.2012.6215379","title":"Fast modular reduction for large-integer multiplication for cryptosystem application","year":2012,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Mersenne prime; Reduction (mathematics); Modular arithmetic; Speedup; Multiplication (music); Cryptosystem; Modular design; Integer (computer science); Public-key cryptography; Multiplication algorithm; Computer science; Arithmetic; Algorithm; Mathematics; Parallel computing; Cryptography; Discrete mathematics; Encryption","score_opus":0.012930608970742238,"score_gpt":0.26065177690422286,"score_spread":0.24772116793348062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059714621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052495487,0.00013588098,0.9917822,0.0006494986,0.0003853058,0.0013679629,0.000007561124,0.00020684993,0.00021522619],"genre_scores_gemma":[0.7996918,0.000003757276,0.19880693,0.00004940352,0.0002698478,0.00102718,0.000023193397,0.000009305323,0.00011861219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990492,0.000021237118,0.00020319074,0.00029237068,0.00011436963,0.00031964196],"domain_scores_gemma":[0.99913174,0.00006471209,0.00009293752,0.00046030135,0.00016598523,0.000084340914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044497475,0.00010387115,0.00010754264,0.00010956108,0.00020946948,0.000058413094,0.0002922755,0.00007946545,0.000002062961],"category_scores_gemma":[0.000020714757,0.00008823152,0.0001269847,0.00025755054,0.000011642615,0.0005228112,0.000040625142,0.000039745555,0.00001685774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015593912,0.00023370128,0.000447802,0.00008453013,0.000025225445,1.2595244e-8,0.00060373475,0.0001225311,0.030676842,0.922273,0.0009864288,0.044530597],"study_design_scores_gemma":[0.0016802639,0.00014955449,0.005333538,0.00002618714,0.000044092838,0.000024598357,0.00047847634,0.792871,0.09249511,0.018789997,0.087587856,0.00051932165],"about_ca_topic_score_codex":0.000009350229,"about_ca_topic_score_gemma":0.0000028576894,"teacher_disagreement_score":0.90348303,"about_ca_system_score_codex":0.000029867802,"about_ca_system_score_gemma":0.000012208706,"threshold_uncertainty_score":0.35979772},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.011749969132100052,"score_gpt":0.2629183333873865,"score_spread":0.25116836425528644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061405134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14775601,0.00017496054,0.8505381,0.00015287692,0.000090208545,0.00044166032,6.708756e-7,0.00008118066,0.00076435297],"genre_scores_gemma":[0.880784,0.000007817996,0.11913741,0.00001794351,0.000021331369,0.000018782786,0.0000011357953,0.000007267955,0.000004369998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989183,0.000025958561,0.00038241732,0.00019175875,0.0003012854,0.00018030187],"domain_scores_gemma":[0.9988272,0.00043450607,0.00018485602,0.0002711896,0.00019774809,0.00008445281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000879121,0.00010873751,0.0001405646,0.00014177508,0.00018952505,0.00009856753,0.00031964862,0.000043191925,3.6645005e-7],"category_scores_gemma":[0.000014374993,0.00008093512,0.000058519003,0.00073509617,0.00004032045,0.0001224918,0.00008479853,0.00006147693,0.000025686712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013730996,0.00007785434,0.0001873287,0.00024427322,0.000021105336,0.0000013324321,0.0016277451,0.0015813147,0.0008635341,0.980492,0.000032219647,0.0148575455],"study_design_scores_gemma":[0.0012518297,0.00018684052,0.006727315,0.00029435285,0.00005760686,0.00007483737,0.0010171089,0.8697045,0.01657752,0.10327284,0.00038326794,0.0004519926],"about_ca_topic_score_codex":0.0000064354626,"about_ca_topic_score_gemma":0.000006376189,"teacher_disagreement_score":0.8772192,"about_ca_system_score_codex":0.000014302051,"about_ca_system_score_gemma":0.000013068454,"threshold_uncertainty_score":0.33004385},"labels":[],"label_agreement":null},{"id":"W2061425254","doi":"10.1112/s1461157000000681","title":"Computing Zeta Functions of Artin–schreier Curves over Finite Fields","year":2002,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Lorentz Center; National Natural Science Foundation of China; Engineering and Physical Sciences Research Council; Division of Mathematical Sciences; National University of Singapore; National Science Foundation","keywords":"Mathematics; Supersingular elliptic curve; Elliptic curve; Finite field; Affine transformation; Edwards curve; Hyperelliptic curve cryptography; Riemann zeta function; Jacobian matrix and determinant; Hyperelliptic curve; Polynomial; Schoof's algorithm; Pure mathematics; Applied mathematics; Mathematical analysis; Discrete mathematics; Quarter period","score_opus":0.02303519082560573,"score_gpt":0.2517827562746768,"score_spread":0.22874756544907104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061425254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05457515,0.001170294,0.9424945,0.0006220164,0.00019713573,0.000051336992,7.094368e-7,0.000014382659,0.0008744834],"genre_scores_gemma":[0.8582369,0.00028151256,0.14122462,0.00014289338,0.00003967451,2.2554815e-7,3.1656768e-7,0.000004233491,0.00006961396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990738,0.00003659746,0.00048359975,0.00007353719,0.00023713085,0.000095309304],"domain_scores_gemma":[0.9988069,0.00039483223,0.0004530084,0.00010574805,0.00017686335,0.00006267483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027806233,0.00007916011,0.00020704218,0.00016664116,0.0000744251,0.000050777067,0.00016346796,0.00003679547,0.00002832125],"category_scores_gemma":[0.00007238182,0.00006297065,0.00009810514,0.00027757493,0.000046289017,0.00021039789,0.000053000364,0.00013484972,0.0000029045475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004294412,0.0046827598,0.008761255,0.0063064387,0.00140988,0.00019927858,0.06170496,0.151109,0.0018154781,0.21017736,0.07969042,0.47410023],"study_design_scores_gemma":[0.0006912571,0.0002577212,0.0027957435,0.00070759957,0.00006383519,0.00026395117,0.00022344766,0.97104293,0.00019425098,0.02294934,0.00065345946,0.00015643639],"about_ca_topic_score_codex":8.2251967e-7,"about_ca_topic_score_gemma":4.786229e-7,"teacher_disagreement_score":0.81993395,"about_ca_system_score_codex":0.0000034146592,"about_ca_system_score_gemma":0.00001169534,"threshold_uncertainty_score":0.25678685},"labels":[],"label_agreement":null},{"id":"W2064281699","doi":"10.1007/s002000100092","title":"Isomorphism Classes of Genus-2 Hyperelliptic Curves Over Finite Fields","year":2002,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Isomorphism (crystallography); Genus; Mathematics; Finite field; Pure mathematics; Discrete mathematics; Zoology; Biology; Crystallography; Chemistry","score_opus":0.010714150781214234,"score_gpt":0.20335172854452843,"score_spread":0.1926375777633142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064281699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33419234,0.025632774,0.6374168,0.0010814613,0.000077586075,0.00028000984,9.736982e-7,0.0002095447,0.0011085538],"genre_scores_gemma":[0.9703408,0.0033011094,0.026103497,0.00021385006,0.0000103422635,0.000010006194,0.0000016768452,0.000007985466,0.000010741315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919957,0.00003560764,0.00028300832,0.00018683718,0.000113576214,0.00018137856],"domain_scores_gemma":[0.99873817,0.0004769914,0.00007891361,0.00063405826,0.000027001497,0.0000448819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020169995,0.000113165,0.00018326128,0.0001435322,0.00007194345,0.00004130331,0.0006118734,0.00006095869,0.0000114986],"category_scores_gemma":[0.00003060393,0.0001192675,0.000041508538,0.00054095645,0.000042772353,0.00013851903,0.00031907004,0.00022235388,0.0000035931678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008223677,0.0010315967,0.029349633,0.0024816007,0.00020595705,0.000019630754,0.006278875,0.16353168,0.0051757265,0.52821547,0.0020430158,0.2616586],"study_design_scores_gemma":[0.00026757366,0.000025013122,0.008301482,0.00032340817,0.000005990997,0.000009544061,0.000017113896,0.9879426,0.00045898464,0.0010210932,0.0014539874,0.00017325568],"about_ca_topic_score_codex":0.000054192362,"about_ca_topic_score_gemma":0.0000036230722,"teacher_disagreement_score":0.82441086,"about_ca_system_score_codex":0.000008647517,"about_ca_system_score_gemma":0.0000046374503,"threshold_uncertainty_score":0.48635873},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014071028587777224,"score_gpt":0.2615776276533546,"score_spread":0.2475065990655774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065654144","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00960762,0.0013754764,0.9854995,0.0024150698,0.00075848855,0.00015615477,0.000003883957,0.000020200358,0.00016363093],"genre_scores_gemma":[0.08474067,0.00015028233,0.91401994,0.00027235426,0.0007339377,0.0000021378505,4.4210668e-7,0.000013172091,0.00006705099],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829215,0.00006944085,0.000719336,0.0001629722,0.00045973004,0.0002963521],"domain_scores_gemma":[0.9982922,0.00029417212,0.0006669588,0.00029205278,0.0003621456,0.00009245629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012400565,0.00014317995,0.0002976006,0.00021938431,0.0001988225,0.0000794293,0.0010200721,0.000050032417,0.000006287328],"category_scores_gemma":[0.000039257968,0.00009124276,0.00033390347,0.00041784893,0.00007983023,0.00031152484,0.00015338101,0.0002308017,0.0000020628613],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000668715,0.00011495831,0.00009316044,0.00001499342,0.00013370643,0.000008254715,0.00080984074,0.001216727,0.00023140383,0.000604343,0.0013250428,0.9954409],"study_design_scores_gemma":[0.0031997887,0.00090292626,0.005318552,0.00029047264,0.00009869975,0.0004548057,0.00039610424,0.92718244,0.010871202,0.0033220581,0.047594883,0.00036810088],"about_ca_topic_score_codex":0.000009144029,"about_ca_topic_score_gemma":0.0000021864594,"teacher_disagreement_score":0.9950728,"about_ca_system_score_codex":0.00002949866,"about_ca_system_score_gemma":0.00007061672,"threshold_uncertainty_score":0.37207717},"labels":[],"label_agreement":null},{"id":"W2067628956","doi":"10.1109/tc.2013.213","title":"New Regular Radix-8 Scheme for Elliptic Curve Scalar Multiplication without Pre-Computation","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Scalar multiplication; Elliptic curve point multiplication; Elliptic curve; Hessian form of an elliptic curve; Mathematics; Scalar (mathematics); Edwards curve; Elliptic curve cryptography; Arithmetic; Computation; Tripling-oriented Doche–Icart–Kohel curve; Finite field; Complex multiplication; Schoof's algorithm; Elliptic Curve Digital Signature Algorithm; Computer science; Multiplication (music); Algorithm; Discrete mathematics; Pure mathematics; Public-key cryptography; Geometry; Combinatorics; Encryption","score_opus":0.011926601736346616,"score_gpt":0.24268761861042998,"score_spread":0.23076101687408337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067628956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011572937,0.000056934543,0.9839339,0.0011467424,0.0016501608,0.0011919019,0.0000029700839,0.0004156353,0.000028786635],"genre_scores_gemma":[0.5070856,0.000013492843,0.49231035,0.00018549974,0.00008130075,0.00013520487,0.0000044416465,0.000020160118,0.00016393009],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982765,0.000075092874,0.0003526023,0.00062994956,0.00029657767,0.0003692865],"domain_scores_gemma":[0.99862343,0.00027958112,0.00012274383,0.00058737915,0.00015724458,0.00022959262],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015115093,0.00025602872,0.00022885321,0.00033630122,0.00032031653,0.00029300782,0.00061227696,0.00012380538,0.000012805485],"category_scores_gemma":[0.000003771372,0.00025075988,0.00024671687,0.0006055648,0.00005938685,0.0007044871,0.0000046239675,0.00020555734,0.000100360216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043145174,0.0003690983,0.000095513,0.00005696535,0.00018348303,0.0000014714454,0.0010602353,0.2275336,0.004755391,0.0016039379,0.0067739002,0.7575233],"study_design_scores_gemma":[0.0011442325,0.00023891912,0.0018419467,0.00007048254,0.000026698304,0.000015588832,0.000010713744,0.9811154,0.012397502,0.0021073727,0.00069818087,0.00033294322],"about_ca_topic_score_codex":0.00014035842,"about_ca_topic_score_gemma":0.000009273536,"teacher_disagreement_score":0.75719035,"about_ca_system_score_codex":0.00006163366,"about_ca_system_score_gemma":0.00007499865,"threshold_uncertainty_score":0.99999446},"labels":[],"label_agreement":null},{"id":"W2069859460","doi":"10.1007/s00145-010-9087-5","title":"Fault-Based Attack on Montgomery’s Ladder Algorithm","year":2010,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"NIST; Elliptic curve cryptography; Elliptic curve; Scalar multiplication; Algorithm; Elliptic curve point multiplication; Elliptic Curve Digital Signature Algorithm; Computer science; Cryptography; Tripling-oriented Doche–Icart–Kohel curve; Curve25519; Mathematics; Arithmetic; Discrete mathematics; Computer security; Public-key cryptography; Pure mathematics; Speech recognition; Encryption","score_opus":0.015049916811778414,"score_gpt":0.2784208209006182,"score_spread":0.2633709040888398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069859460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24242212,0.00025578053,0.74199,0.008589478,0.004331267,0.00010158447,0.0000024619296,0.00005980094,0.0022475582],"genre_scores_gemma":[0.6272635,0.000017092485,0.37038314,0.0018371019,0.00044409026,0.0000027640976,5.485158e-7,0.00001422412,0.000037528178],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986236,0.00010205097,0.0004265879,0.00019751121,0.00034264225,0.0003075782],"domain_scores_gemma":[0.99851847,0.00029854127,0.00034549576,0.0004190586,0.00024174851,0.00017666342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041693798,0.00015181968,0.0003140027,0.00044956402,0.000099323704,0.00006900588,0.00092721486,0.00017529266,0.000090291855],"category_scores_gemma":[0.000094189294,0.000112497575,0.00024555868,0.00036259656,0.00014798858,0.00022132075,0.000058346828,0.00077626365,0.000052165473],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017565655,0.0015320529,0.004217833,0.00003439028,0.00032232047,0.0018528382,0.0006538568,0.00169792,0.015312964,0.16923413,0.03216134,0.7728047],"study_design_scores_gemma":[0.013691626,0.010693154,0.119344264,0.00020938266,0.00022933149,0.0076927347,0.00017484484,0.11994583,0.0463004,0.099989615,0.5795788,0.0021499984],"about_ca_topic_score_codex":0.0000041356157,"about_ca_topic_score_gemma":0.000012432486,"teacher_disagreement_score":0.7706547,"about_ca_system_score_codex":0.000010947238,"about_ca_system_score_gemma":0.00014188566,"threshold_uncertainty_score":0.4587518},"labels":[],"label_agreement":null},{"id":"W2070532428","doi":"10.1007/s13389-011-0003-1","title":"Algorithm-level error detection for Montgomery ladder-based ECSM","year":2011,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Correctness; Scalar multiplication; Computer science; Elliptic curve cryptography; Cryptography; Algorithm; Elliptic curve; Fault detection and isolation; Computation; Arithmetic; Mathematics; Public-key cryptography; Computer security; Artificial intelligence","score_opus":0.03866171637910226,"score_gpt":0.22259061327719776,"score_spread":0.1839288968980955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070532428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02219768,0.00063189527,0.9757245,0.000058060315,0.0011139851,0.00014103448,0.0000033572678,0.000092994946,0.000036466274],"genre_scores_gemma":[0.52865386,0.00002072341,0.4711355,0.00003512219,0.00012535494,0.000010762152,2.2052188e-7,0.00001650339,0.000001921919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985949,0.000025858102,0.00051316206,0.00019902215,0.00031764846,0.00034943956],"domain_scores_gemma":[0.9988053,0.0001666996,0.00028013115,0.00029133854,0.0002730986,0.00018345118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054641487,0.00020625717,0.00028984682,0.0011793192,0.0001029259,0.000068245936,0.00062856707,0.00011715638,0.0000068113964],"category_scores_gemma":[0.000078785764,0.00018172518,0.00050617906,0.0009790619,0.00003746064,0.0005029674,0.000036908103,0.00030282096,0.0000011033416],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029530554,0.0014044294,0.0035543425,0.00067918125,0.0015943564,0.00037608857,0.003178543,0.028632252,0.0695676,0.024379382,0.00035217023,0.86598635],"study_design_scores_gemma":[0.005793058,0.0044590537,0.11952904,0.0008546164,0.00038290385,0.00082179665,0.00022212112,0.73147225,0.10845735,0.019510176,0.006549205,0.0019484145],"about_ca_topic_score_codex":0.000009860328,"about_ca_topic_score_gemma":0.0000055730616,"teacher_disagreement_score":0.86403793,"about_ca_system_score_codex":0.000019185936,"about_ca_system_score_gemma":0.000053501724,"threshold_uncertainty_score":0.74105376},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.011252346404131272,"score_gpt":0.18428983436258717,"score_spread":0.1730374879584559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070633734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016567236,0.0015539502,0.9724683,0.0078615025,0.00009690915,0.00022160109,8.2963555e-7,0.00029330832,0.00093636714],"genre_scores_gemma":[0.9874305,0.000061815954,0.009721253,0.0024575982,0.000087124674,0.000026744923,0.0000014995264,0.000017638575,0.00019582402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839276,0.000046265046,0.0001764926,0.00040172134,0.00030815546,0.0006745946],"domain_scores_gemma":[0.9993472,0.00010008594,0.00006419173,0.00035690152,0.000033544733,0.00009806448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014434263,0.0001764678,0.00014191144,0.00015456571,0.00017515202,0.00042249812,0.0008209459,0.000052800773,0.000047500198],"category_scores_gemma":[0.000015628562,0.00015870392,0.0001046218,0.0006971961,0.00005737872,0.0006719405,0.0000773131,0.00026561212,0.00014337599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010580597,0.0017272327,0.0014912265,0.00017969942,0.0007673839,0.0007931248,0.0059436597,0.015413154,0.16643138,0.12286028,0.21563691,0.46865013],"study_design_scores_gemma":[0.004469835,0.0020670206,0.00062737416,0.0001153801,0.00009633774,0.0006025744,0.000047871945,0.70954055,0.11326822,0.038205206,0.12758298,0.0033766537],"about_ca_topic_score_codex":0.000001281191,"about_ca_topic_score_gemma":7.7659695e-7,"teacher_disagreement_score":0.9708633,"about_ca_system_score_codex":0.00005339392,"about_ca_system_score_gemma":0.000036028214,"threshold_uncertainty_score":0.6471758},"labels":[],"label_agreement":null},{"id":"W2070823145","doi":"10.1515/jmc.2011.007","title":"Compact elliptic curve representations","year":2011,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Elliptic curve; Isomorphism (crystallography); Prime (order theory); Upper and lower bounds; Combinatorics; Reduction (mathematics); Discrete mathematics; Jacobian curve; Pure mathematics; Schoof's algorithm; Mathematical analysis; Quarter period; Geometry; Crystallography; Chemistry","score_opus":0.04824862023982155,"score_gpt":0.28889269733479933,"score_spread":0.2406440770949778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070823145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04755655,0.00020261534,0.93803984,0.0016690954,0.00036984903,0.00007651135,4.1286862e-7,0.000033178432,0.012051958],"genre_scores_gemma":[0.772788,0.000019014396,0.22700603,0.000104902036,0.000056768702,8.684342e-7,9.063172e-8,0.0000055811533,0.000018781906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866444,0.00015196913,0.00058225065,0.00012890871,0.00024549774,0.00022692143],"domain_scores_gemma":[0.99873126,0.0002671794,0.00032445416,0.0003448194,0.00017163172,0.00016063167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048134767,0.0001054321,0.00033197424,0.00024545862,0.0000648941,0.000035079323,0.0007562562,0.00007496509,0.00013596428],"category_scores_gemma":[0.00024153298,0.00007425329,0.00021528515,0.00031652153,0.00009138113,0.00029083356,0.00006877343,0.0002592023,0.00010827663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016695232,0.00040359658,0.0016022219,0.000027431197,0.00008536689,0.00019105396,0.0018232462,0.000007719771,0.00026486846,0.99313766,0.0015383982,0.00090173923],"study_design_scores_gemma":[0.0004968486,0.0004093578,0.014375146,0.000046549518,0.00005114342,0.002565488,0.00033141742,0.0015080728,0.0018255878,0.9779579,0.000289713,0.00014277677],"about_ca_topic_score_codex":0.0000024302674,"about_ca_topic_score_gemma":6.9660626e-7,"teacher_disagreement_score":0.7252314,"about_ca_system_score_codex":0.000011618783,"about_ca_system_score_gemma":0.00005182288,"threshold_uncertainty_score":0.30279613},"labels":[],"label_agreement":null},{"id":"W2071302523","doi":"10.1007/s00200-005-0187-7","title":"On the low hamming weight discrete logarithm problem for nonadjacent representations","year":2005,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Discrete logarithm; Logarithm; Mathematics; Elliptic curve cryptography; Cryptography; Cryptosystem; Elliptic curve; Post-quantum cryptography; Hyperelliptic curve cryptography; Discrete mathematics; Algorithm; Computer science; Public-key cryptography; Pure mathematics; Encryption","score_opus":0.006295475143209721,"score_gpt":0.22291019344553092,"score_spread":0.2166147183023212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071302523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03222356,0.0005136046,0.95944804,0.0064443727,0.000033940192,0.00057627127,9.770645e-7,0.00014727884,0.0006119534],"genre_scores_gemma":[0.8236972,0.00007652167,0.17578173,0.00026697596,0.000029721421,0.00011890907,0.000004859016,0.000010517814,0.00001353971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906945,0.000042216398,0.0002585723,0.00026440818,0.00011624039,0.00024909817],"domain_scores_gemma":[0.9981469,0.0009741769,0.000070965856,0.0007249388,0.000033631244,0.000049377944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004668995,0.00012833225,0.00012442312,0.0001171971,0.00032836822,0.00015638107,0.00072213804,0.000043919874,0.0000019504878],"category_scores_gemma":[0.000033677643,0.00010530016,0.00004920473,0.00041589362,0.00003926691,0.00015087235,0.00031037081,0.00023204192,0.000003449736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031751795,0.000069992064,0.00018999689,0.00003580378,0.000018565059,3.7508997e-7,0.0009011872,0.076989494,0.00037171654,0.8741733,0.00017953038,0.047066905],"study_design_scores_gemma":[0.00035627052,0.00001962516,0.0015158083,0.0001163657,0.0000042051342,0.000005694395,0.000055273205,0.9835761,0.0011478802,0.008589569,0.0044458406,0.0001673692],"about_ca_topic_score_codex":0.00002837758,"about_ca_topic_score_gemma":0.000012562309,"teacher_disagreement_score":0.9065866,"about_ca_system_score_codex":0.000029666273,"about_ca_system_score_gemma":0.000012487005,"threshold_uncertainty_score":0.42940158},"labels":[],"label_agreement":null},{"id":"W2075797354","doi":"10.4153/cjm-2008-054-1","title":"Nonadjacent Radix-τ Expansions of Integers in Euclidean Imaginary Quadratic Number Fields","year":2008,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Radix (gastropod); Quadratic field; Euclidean geometry; Quadratic equation; Arithmetic; Window (computing); Ring of integers; Combinatorics; Algebraic number field; Discrete mathematics; Quadratic function; Geometry; Computer science","score_opus":0.017997202978161698,"score_gpt":0.23237082069287288,"score_spread":0.21437361771471117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075797354","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8688793,0.00059071166,0.12466186,0.002103472,0.00048385665,0.00012761173,0.0000032339865,0.000008097847,0.0031418456],"genre_scores_gemma":[0.9367044,0.000062338615,0.0630641,0.00010189121,0.000024046127,8.452138e-7,2.0407235e-7,0.0000068819627,0.000035325273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886894,0.000049888124,0.0005503976,0.00009001616,0.00020306934,0.00023768411],"domain_scores_gemma":[0.99882734,0.00017465588,0.00024004004,0.00029058865,0.00013154313,0.00033585532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032801932,0.000104166174,0.00027748515,0.00039232153,0.00007545301,0.000023985567,0.0006019252,0.00005774909,0.000055648867],"category_scores_gemma":[0.0001332521,0.000087921544,0.00013662188,0.00047435935,0.00014663333,0.00021749124,0.00002407246,0.00021141912,0.000008606433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037677204,0.0025295375,0.2166811,0.0016244156,0.0006897562,0.023766499,0.26700947,0.0064933235,0.0018600182,0.38147146,0.07286574,0.024971],"study_design_scores_gemma":[0.010600218,0.0025030114,0.15492973,0.00937803,0.00037266014,0.0550527,0.023815008,0.106612384,0.014552124,0.6082973,0.009864596,0.004022259],"about_ca_topic_score_codex":0.0010411113,"about_ca_topic_score_gemma":0.004728535,"teacher_disagreement_score":0.24319448,"about_ca_system_score_codex":0.000055602028,"about_ca_system_score_gemma":0.0008328076,"threshold_uncertainty_score":0.35853365},"labels":[],"label_agreement":null},{"id":"W2078293442","doi":"10.1515/jmc.2010.001","title":"Factor-4 and 6 compression of cyclotomic subgroups of and","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pairing; Exponentiation; Mathematics; Discrete logarithm; Finite field; Multiplicative group; Prime (order theory); Elliptic curve; Cryptography; Order (exchange); Embedding; Prime factor; Discrete mathematics; Multiplicative function; Combinatorics; Pure mathematics; Algorithm; Public-key cryptography; Computer science; Mathematical analysis","score_opus":0.01011419312858089,"score_gpt":0.2554686893593438,"score_spread":0.24535449623076291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078293442","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90766567,0.00019602108,0.09147183,0.000396065,0.0001045481,0.00004373322,7.6847954e-7,0.000004190634,0.00011716517],"genre_scores_gemma":[0.9030739,0.000039350274,0.09685141,0.000013428999,0.000017721857,2.9870102e-7,2.983506e-8,0.0000029009802,9.41747e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911535,0.00005663572,0.000470585,0.00008821914,0.0001612809,0.0001079371],"domain_scores_gemma":[0.99890107,0.00037109916,0.0003696089,0.00016403655,0.00010196203,0.000092213035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028562214,0.00007715954,0.00038568402,0.00016359854,0.000024481358,0.000012180727,0.00027482412,0.000098112556,0.000013097413],"category_scores_gemma":[0.00014090636,0.000050907653,0.00006935662,0.00009570716,0.00020173007,0.00012008015,0.00012559384,0.00024538115,5.257113e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056776156,0.00036550974,0.013149419,0.00040470847,0.00007785731,0.000032451557,0.0014701486,0.0000019757772,0.2651183,0.7077324,0.00007608636,0.011514414],"study_design_scores_gemma":[0.0017853345,0.0009489477,0.13736339,0.00025080077,0.000065857545,0.0031577502,0.00021061146,0.005414052,0.047022272,0.80344445,0.00012429965,0.00021224849],"about_ca_topic_score_codex":0.0000013074583,"about_ca_topic_score_gemma":0.0000012385714,"teacher_disagreement_score":0.21809603,"about_ca_system_score_codex":0.0000015397954,"about_ca_system_score_gemma":0.000021313392,"threshold_uncertainty_score":0.20759538},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02465452726244105,"score_gpt":0.2566337248512674,"score_spread":0.23197919758882635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078731783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032759858,0.0014131466,0.9865239,0.000672339,0.004782426,0.0018966887,0.00016070186,0.00055241206,0.0007224021],"genre_scores_gemma":[0.9901062,0.00009924568,0.005280228,0.00021307226,0.00021669666,0.0010740834,0.000029237843,0.000051738367,0.002929478],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964343,0.00033588219,0.000875412,0.00085885933,0.00082975684,0.0006657992],"domain_scores_gemma":[0.9972858,0.0002569111,0.0003022363,0.0009244134,0.00085685815,0.00037377965],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012969096,0.0004470015,0.0005766052,0.00045323957,0.0005823627,0.0005883661,0.0008636894,0.00026527347,0.000017894048],"category_scores_gemma":[0.000037927108,0.0003770857,0.00037522925,0.0011239228,0.000095348245,0.0010352205,0.000006386144,0.0003872937,0.00023866718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0042615435,0.035024203,0.0021478604,0.032927785,0.0055746892,0.0002829154,0.062031627,0.20986924,0.043988727,0.13471203,0.32091197,0.14826743],"study_design_scores_gemma":[0.007168159,0.0026080532,0.00015760155,0.006388092,0.00042048006,0.00039220968,0.005061499,0.7289105,0.17576963,0.0015154791,0.06879968,0.0028086444],"about_ca_topic_score_codex":0.00015171876,"about_ca_topic_score_gemma":0.00025478654,"teacher_disagreement_score":0.98683023,"about_ca_system_score_codex":0.00022071418,"about_ca_system_score_gemma":0.00028614615,"threshold_uncertainty_score":0.9998681},"labels":[],"label_agreement":null},{"id":"W2080415500","doi":"10.1016/j.camwa.2010.01.020","title":"An integrated parallel GNFS algorithm for integer factorization based on Linbox Montgomery block Lanczos method over GF(2)","year":2010,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University; St. Francis Xavier University","funders":"","keywords":"Integer factorization; Lanczos resampling; Algorithm; Cryptosystem; Mathematics; Factorization; Integer (computer science); Block (permutation group theory); Cryptography; Computer science; Public-key cryptography; Encryption; Combinatorics","score_opus":0.009640130900433596,"score_gpt":0.2730850366606396,"score_spread":0.263444905760206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080415500","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006560623,0.000010108729,0.9969044,0.00030164915,0.00019147796,0.0013802445,0.000030105542,0.00038770033,0.00013830606],"genre_scores_gemma":[0.026564103,0.000003378394,0.9719893,0.00031639865,0.00012854185,0.00084640173,0.0000863786,0.00003739766,0.000028145847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832207,0.000048822807,0.0003774955,0.0006078615,0.0003157805,0.0003279416],"domain_scores_gemma":[0.9973564,0.00061442575,0.00023689421,0.0013029026,0.0002838363,0.00020552617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032157777,0.00030771343,0.00031221454,0.000316361,0.00028137892,0.00028247738,0.001036481,0.000152175,0.000007540898],"category_scores_gemma":[0.000016985883,0.00023720332,0.00012528944,0.0008699099,0.00008459474,0.00023841915,0.00005979152,0.00034252804,0.000013897811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034328405,0.0034754856,0.00026329,0.00021154375,0.0002183935,0.0000059237714,0.0037806102,0.02363446,0.0022472132,0.37429658,0.0012149127,0.59061724],"study_design_scores_gemma":[0.0006823302,0.00021263518,0.0002953023,0.00004637193,0.00003712487,0.000009476566,0.000049132672,0.9795517,0.0005677601,0.012182173,0.0060355505,0.00033045764],"about_ca_topic_score_codex":0.000013933929,"about_ca_topic_score_gemma":0.000018559169,"teacher_disagreement_score":0.95591724,"about_ca_system_score_codex":0.000026504193,"about_ca_system_score_gemma":0.00010921068,"threshold_uncertainty_score":0.96728706},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.008561974885662713,"score_gpt":0.2542585128835853,"score_spread":0.2456965379979226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080886024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.171459,0.00019487584,0.82537544,0.0018472394,0.00040993726,0.00011925155,6.7998343e-7,0.000009037641,0.00058451237],"genre_scores_gemma":[0.7587404,0.0001573175,0.24085914,0.0001582385,0.000051299205,9.98952e-7,2.899142e-7,0.0000043123355,0.00002799262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909586,0.000027355702,0.00038965428,0.00006741833,0.00033730167,0.00008241965],"domain_scores_gemma":[0.9985656,0.00051790784,0.00046366462,0.00011891444,0.00028314508,0.000050766765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006340114,0.00007043234,0.00013660517,0.000081929866,0.00011194071,0.00008332545,0.0002870049,0.000026517782,0.0000019354754],"category_scores_gemma":[0.00013872478,0.000043450662,0.000062141065,0.00016441572,0.00009259119,0.0001797487,0.00004301908,0.00018263777,0.0000012020096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056542176,0.0008816512,0.00044287747,0.0009660524,0.0001687932,0.000026484606,0.007983275,0.0030909681,0.009862925,0.8721175,0.003066116,0.101336814],"study_design_scores_gemma":[0.001409183,0.0007639309,0.010838618,0.0012331016,0.000056210796,0.00066766154,0.0004986203,0.4391126,0.006706796,0.53757745,0.000821651,0.00031417733],"about_ca_topic_score_codex":6.853135e-7,"about_ca_topic_score_gemma":0.000001968754,"teacher_disagreement_score":0.5872814,"about_ca_system_score_codex":0.000003022244,"about_ca_system_score_gemma":0.0000665221,"threshold_uncertainty_score":0.17718665},"labels":[],"label_agreement":null},{"id":"W2082081063","doi":"10.1016/j.ffa.2014.10.008","title":"A survey of some recent bit-parallel<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"normal\">GF</mml:mi><mml:mo stretchy=\"false\">(</mml:mo><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo stretchy=\"false\">)</mml:mo></mml:math>multipliers","year":2014,"lang":"lv","type":"article","venue":"Finite Fields and Their Applications","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Finite field; Quadratic equation; Mathematics; Generalization; Polynomial; Multiplication (music); Field (mathematics); Discrete mathematics; Arithmetic; Algorithm; Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.01790630992802925,"score_gpt":0.23118940225261408,"score_spread":0.21328309232458484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082081063","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72161204,0.004943013,0.025937632,0.0030873257,0.0038004592,0.00024982405,0.0022148325,0.0006613654,0.23749352],"genre_scores_gemma":[0.9824897,0.0042737266,0.0050648353,0.001800051,0.0017046441,0.0021631743,0.0017128563,0.0006308245,0.00016020927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98858756,0.0007722696,0.0025917205,0.0026973074,0.0024126014,0.0029385216],"domain_scores_gemma":[0.98841447,0.0035436545,0.0025442173,0.0035429127,0.00039827253,0.0015564905],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["research_integrity","insufficient_payload"],"category_scores_codex":[0.0029055153,0.0012467556,0.00058620534,0.0008870377,0.0025786408,0.0020764535,0.003734244,0.0032198157,0.06902523],"category_scores_gemma":[0.0014100228,0.0021576378,0.0020648194,0.0023978169,0.0022466455,0.0016861185,0.0029192735,0.0024088006,0.001448508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010049231,0.0006969356,0.000058847392,0.0011437925,0.002040361,0.0003135411,0.0035681669,0.0028447583,0.0009030791,0.8795236,0.096198745,0.011703266],"study_design_scores_gemma":[0.004044719,0.0033433954,0.0006793707,0.0015995826,0.0019190491,0.001297006,0.002889163,0.20529129,0.75488985,0.0059354817,0.014671021,0.0034400567],"about_ca_topic_score_codex":0.0038400716,"about_ca_topic_score_gemma":0.0023663498,"teacher_disagreement_score":0.8735881,"about_ca_system_score_codex":0.000017941516,"about_ca_system_score_gemma":0.0016092439,"threshold_uncertainty_score":0.9998927},"labels":[],"label_agreement":null},{"id":"W2082450393","doi":"10.1049/iet-cds.2008.0331","title":"High-speed hardware implementation of a serial-in parallel-out finite field multiplier using reordered normal basis","year":2010,"lang":"en","type":"article","venue":"IET Circuits Devices & Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"CMC Microsystems","keywords":"Normal basis; Multiplier (economics); Elliptic curve cryptography; Finite field; Domino logic; NIST; Arithmetic; Computer science; Clock rate; Very-large-scale integration; Parallel computing; Mathematics; Computer hardware; Algorithm; Logic synthesis; Discrete mathematics; Galois theory; Chip; Embedded system; Logic gate; Encryption","score_opus":0.018804406529700158,"score_gpt":0.27218444501829187,"score_spread":0.2533800384885917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082450393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94543976,0.00021635559,0.050180078,0.00023079231,0.0029001653,0.0006695155,0.00002909565,0.00009350184,0.00024076655],"genre_scores_gemma":[0.9955704,0.000009754158,0.0040775584,0.0000898643,0.00017901612,0.000023967783,0.00001076851,0.000015175724,0.000023478198],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.997928,0.00014922342,0.0006851274,0.00045293718,0.0003826299,0.00040204704],"domain_scores_gemma":[0.9985018,0.00027148388,0.00036542828,0.0006083804,0.00015575848,0.00009715652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005258156,0.00021256233,0.00038230955,0.00030241357,0.000120245466,0.00021116604,0.0006904948,0.00016527179,0.000058188667],"category_scores_gemma":[0.00003490056,0.0002009669,0.00012387607,0.000562616,0.000037024343,0.0004859642,0.00011660143,0.00023245341,0.000017462826],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009975864,0.00069269084,0.56548625,0.0026368657,0.0006574919,0.00023021389,0.04131418,0.032665715,0.20484863,0.02610382,0.0007748782,0.12448951],"study_design_scores_gemma":[0.020317942,0.0014072638,0.5648914,0.0023843844,0.0004153168,0.00032334638,0.0110588055,0.26794496,0.102138355,0.0016799299,0.022509916,0.004928398],"about_ca_topic_score_codex":0.0049212645,"about_ca_topic_score_gemma":0.005635378,"teacher_disagreement_score":0.23527926,"about_ca_system_score_codex":0.000021197757,"about_ca_system_score_gemma":0.00008896027,"threshold_uncertainty_score":0.8195192},"labels":[],"label_agreement":null},{"id":"W2084002332","doi":"10.1109/tcsii.2012.2234916","title":"High-Performance Implementation of Point Multiplication on Koblitz Curves","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits & Systems II Express Briefs","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Waterloo","funders":"","keywords":"Stratix; Elliptic curve cryptography; Finite field; Computer science; Multiplication (music); Arithmetic; Field-programmable gate array; Parallel computing; Scalar multiplication; Multiplication algorithm; Multiplier (economics); Elliptic curve point multiplication; Elliptic curve; Mathematics; Binary number; Computer hardware; Discrete mathematics; Encryption; Public-key cryptography","score_opus":0.013037451458002386,"score_gpt":0.23606181387773456,"score_spread":0.22302436241973217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084002332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31342924,0.00018967452,0.6836056,0.00038172558,0.00092954555,0.0010965784,0.000035619843,0.0001935302,0.00013849225],"genre_scores_gemma":[0.9981866,0.00020448478,0.0006692804,0.00017516677,0.000048232203,0.0005803579,0.000005666328,0.000020022388,0.00011020846],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978446,0.00014734347,0.00062696624,0.00051534036,0.0005391576,0.00032661064],"domain_scores_gemma":[0.99831593,0.00014509812,0.00027830582,0.00090883713,0.00023590057,0.00011591949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026168916,0.00023668117,0.0003034974,0.0003534036,0.0003506597,0.000104871906,0.0006174454,0.00009522806,0.000051194358],"category_scores_gemma":[0.0000029825599,0.0002188887,0.00012856044,0.00061609276,0.00006815155,0.0009325654,0.000005497851,0.00020108899,0.0000696645],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035928973,0.0023982462,0.0008417152,0.0027062867,0.0005253461,0.0000061416845,0.008990786,0.07405873,0.18305326,0.017927531,0.005839624,0.70361644],"study_design_scores_gemma":[0.0043279603,0.0024446512,0.057585426,0.0034097137,0.00013459679,0.00008456814,0.0008762951,0.036022715,0.89106214,0.00047572085,0.0019482737,0.0016279551],"about_ca_topic_score_codex":0.0017949101,"about_ca_topic_score_gemma":0.000019390602,"teacher_disagreement_score":0.7080089,"about_ca_system_score_codex":0.000047558933,"about_ca_system_score_gemma":0.00005878646,"threshold_uncertainty_score":0.8926022},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02770676403880055,"score_gpt":0.26701201903354777,"score_spread":0.23930525499474722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085540322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17691882,0.00015530645,0.82078516,0.00022285094,0.0007911043,0.0006040579,0.00013638758,0.00010675303,0.00027954107],"genre_scores_gemma":[0.98907036,0.00008748692,0.010467392,0.000122063,0.000033762084,0.00013603426,0.000012939526,0.00001903541,0.00005090099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977809,0.0003108757,0.0006703339,0.00049762015,0.0004261829,0.0003140764],"domain_scores_gemma":[0.99874896,0.00008703457,0.00025726444,0.00057321746,0.00018789122,0.00014563481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050014484,0.0002623208,0.00031145822,0.0005873707,0.00046943873,0.00008950717,0.00029981873,0.000118129756,0.000057074343],"category_scores_gemma":[0.000005514912,0.00022512347,0.00020334523,0.0007085874,0.00009593721,0.00030272055,0.000006426014,0.00021439462,0.000012104169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021534045,0.023304174,0.0063686366,0.0046704914,0.0026398092,0.0001140152,0.10405538,0.38023657,0.24205607,0.075651035,0.004158005,0.1545924],"study_design_scores_gemma":[0.002767296,0.00097241055,0.012928093,0.0015219812,0.00022796626,0.00010403637,0.0030375724,0.78780174,0.18933986,0.00013901181,0.00027525064,0.0008847645],"about_ca_topic_score_codex":0.0008598232,"about_ca_topic_score_gemma":0.00026564766,"teacher_disagreement_score":0.81215155,"about_ca_system_score_codex":0.00008899107,"about_ca_system_score_gemma":0.000063828375,"threshold_uncertainty_score":0.91802686},"labels":[],"label_agreement":null},{"id":"W2091959569","doi":"10.4153/cmb-2003-016-6","title":"Torsion Points on Certain Families of Elliptic Curves","year":2003,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Torsion (gastropod); Elliptic curve; Pure mathematics; Hessian form of an elliptic curve; Supersingular elliptic curve; Schoof's algorithm; Mathematical analysis; Quarter period; Surgery","score_opus":0.00953126991982302,"score_gpt":0.20448470701951368,"score_spread":0.19495343709969065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091959569","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35377064,0.00408597,0.13088863,0.051777896,0.0010024509,0.0019920215,0.000040214643,0.00037446685,0.4560677],"genre_scores_gemma":[0.97516054,0.00010894787,0.02178268,0.0022632198,0.000015362219,0.000014457486,0.0000015544264,0.000014746606,0.0006384727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885714,0.00010861844,0.00024541543,0.00023282769,0.0002283405,0.00032763366],"domain_scores_gemma":[0.9988458,0.00024783736,0.000048830057,0.0004694038,0.000047591282,0.0003405024],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00035358567,0.00012952677,0.00020680008,0.00021608618,0.000082952654,0.00003081422,0.00041243038,0.00006578756,0.0017085792],"category_scores_gemma":[0.000430209,0.00010690879,0.00009829685,0.00032169957,0.000100927784,0.000028370896,0.000022539874,0.00011563713,0.0017203825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012820353,0.00006968446,0.00007343743,0.00020755878,0.0000120933955,0.000025326965,0.00020509024,0.00000554993,0.000049845425,0.98596054,0.012601636,0.0007879307],"study_design_scores_gemma":[0.0014720694,0.000934662,0.0032639757,0.004153624,0.00008318653,0.00017436789,0.0006530492,0.0027299444,0.020041028,0.5860001,0.3788118,0.0016822009],"about_ca_topic_score_codex":0.00029147815,"about_ca_topic_score_gemma":0.00015464851,"teacher_disagreement_score":0.6213899,"about_ca_system_score_codex":0.000035593974,"about_ca_system_score_gemma":0.0001121932,"threshold_uncertainty_score":0.999204},"labels":[],"label_agreement":null},{"id":"W2092202686","doi":"10.1515/jmc.2009.008","title":"Another look at some fast modular arithmetic methods","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"Arithmetic; Modular arithmetic; Modular design; Computer science; Algebra over a field; Saturation arithmetic; Mathematics; Programming language; Arbitrary-precision arithmetic; Pure mathematics","score_opus":0.01735023518713309,"score_gpt":0.3037783712800312,"score_spread":0.28642813609289813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092202686","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022982715,0.0009314331,0.9663944,0.00801603,0.0003205993,0.00009777967,3.9927258e-7,0.00004283193,0.0012138156],"genre_scores_gemma":[0.16049814,0.00004663749,0.8377877,0.0014085267,0.0001654876,0.0000017098702,1.2999666e-7,0.000011689511,0.00008001089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977664,0.0003703795,0.00079794676,0.00024736644,0.00039648314,0.0004214613],"domain_scores_gemma":[0.9983754,0.0003621707,0.0004117822,0.00050160906,0.00015524027,0.00019380923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001210031,0.00021109554,0.00065294444,0.0003726829,0.0001080141,0.000074146374,0.0010261306,0.00018158536,0.00008301773],"category_scores_gemma":[0.00026712075,0.00014864416,0.000368042,0.0003647608,0.00010797445,0.00036604228,0.00015044685,0.00038112266,0.00008512928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032266387,0.00064932846,0.00007070025,0.000051237712,0.00012680286,0.00030729434,0.00068790343,0.00009165205,0.01520826,0.9290536,0.0014543642,0.052266575],"study_design_scores_gemma":[0.00073584117,0.00070930773,0.0015908319,0.000059409922,0.000058272355,0.0030426162,0.000052459152,0.0063984124,0.0059847306,0.97965825,0.0014857375,0.00022411036],"about_ca_topic_score_codex":3.1340895e-7,"about_ca_topic_score_gemma":2.0587966e-7,"teacher_disagreement_score":0.13751544,"about_ca_system_score_codex":0.00004780332,"about_ca_system_score_gemma":0.000054883916,"threshold_uncertainty_score":0.60615325},"labels":[],"label_agreement":null},{"id":"W2092948697","doi":"10.1090/s0025-5718-2013-02715-9","title":"Taking roots over high extensions of finite fields","year":2013,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Finite field; Pure mathematics; Algebra over a field; Discrete mathematics","score_opus":0.014579519165931502,"score_gpt":0.24877991118498216,"score_spread":0.23420039201905066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092948697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31698212,0.00002467357,0.6822582,0.00011294384,0.000076048695,0.00009970657,5.475184e-7,0.000024386281,0.00042140097],"genre_scores_gemma":[0.7287705,0.0000027554825,0.27118006,0.000023229964,0.000007516599,0.0000034845757,0.0000010639948,0.0000032921337,0.000008131621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992484,0.000022076438,0.0003125278,0.00010747439,0.00021337983,0.00009615658],"domain_scores_gemma":[0.99885756,0.00040564663,0.00030716695,0.00023273469,0.00016851723,0.000028382503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011384436,0.000071593786,0.00016381177,0.00014491743,0.000037740512,0.0000312417,0.00023881318,0.000045607583,0.000035678124],"category_scores_gemma":[0.000073865755,0.00006109421,0.00006787833,0.0002961023,0.00003740416,0.00019101881,0.00008930781,0.00005399232,0.0000103363645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042164947,0.00097432855,0.00081839075,0.00094200956,0.00013829146,0.0000060416983,0.008887627,0.15311758,0.010033335,0.7232701,0.0012131636,0.10059491],"study_design_scores_gemma":[0.0001798067,0.00005982958,0.029712444,0.00011124647,0.0000096410295,0.0000026451883,0.000039909428,0.6762255,0.0025342861,0.29104117,0.000003695493,0.0000798801],"about_ca_topic_score_codex":0.00006659306,"about_ca_topic_score_gemma":0.000002712323,"teacher_disagreement_score":0.5231079,"about_ca_system_score_codex":0.0000035257688,"about_ca_system_score_gemma":0.00001448073,"threshold_uncertainty_score":0.24913494},"labels":[],"label_agreement":null},{"id":"W2094812471","doi":"10.1109/tcsi.2006.883855","title":"Fast Bit Parallel-Shifted Polynomial Basis Multipliers in &amp;lt;formula formulatype=\"inline\"&amp;gt;&amp;lt;tex&amp;gt;$GF(2^{n})$&amp;lt;/tex&amp;gt;&amp;lt;/formula&amp;gt;","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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ampere; Mathematics; Polynomial; Physics; Mathematical analysis; Quantum mechanics; Voltage","score_opus":0.020825470698027766,"score_gpt":0.25092188498129603,"score_spread":0.23009641428326827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094812471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26018062,0.0030461238,0.7270656,0.00039432084,0.0011602085,0.0034266957,0.0013010851,0.0006733815,0.0027519409],"genre_scores_gemma":[0.97983795,0.00076143217,0.009290916,0.0003281479,0.0006273493,0.0017140892,0.000766629,0.0002025433,0.0064709447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9904645,0.00082226994,0.0025913825,0.0026809785,0.0013619643,0.0020788833],"domain_scores_gemma":[0.99347454,0.0013647837,0.0008971023,0.0028902683,0.0003291693,0.0010441529],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0021136529,0.001690472,0.0016935263,0.0017085084,0.0031454926,0.0013679168,0.0016756542,0.0010259402,0.00030742632],"category_scores_gemma":[0.000043238888,0.0016150317,0.0009282913,0.0028990011,0.0010562773,0.0013932657,0.00010562801,0.0013842449,0.00072240434],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023596247,0.015677646,0.0038551246,0.0027606313,0.0037316293,0.00003922536,0.021583477,0.059992015,0.24073097,0.37273005,0.007629979,0.26890963],"study_design_scores_gemma":[0.010497802,0.00042603468,0.005148339,0.0013545646,0.00109875,0.0009906978,0.0007577262,0.0026954873,0.00094670214,0.014041828,0.95650566,0.005536439],"about_ca_topic_score_codex":0.0006000513,"about_ca_topic_score_gemma":0.007890922,"teacher_disagreement_score":0.94887567,"about_ca_system_score_codex":0.00047939707,"about_ca_system_score_gemma":0.00024139666,"threshold_uncertainty_score":0.9996688},"labels":[],"label_agreement":null},{"id":"W2096889687","doi":"10.1109/icassp.2004.1327067","title":"New modulo decomposed residue-to-binary algorithm for general moduli sets","year":2004,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Concordia University","funders":"","keywords":"Modulo; Chinese remainder theorem; Modulo operation; Moduli; Mathematics; Binary number; Primitive root modulo n; Residue number system; Discrete mathematics; Arithmetic; Algorithm; Combinatorics; Physics","score_opus":0.012254311397649481,"score_gpt":0.260338924532536,"score_spread":0.2480846131348865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096889687","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023584627,0.0001500658,0.96975297,0.0043634516,0.0005445062,0.00050753675,0.0000065138793,0.00033305367,0.0007572791],"genre_scores_gemma":[0.023072233,0.000010064596,0.97429293,0.0015022182,0.00019847753,0.000035144916,0.000006864938,0.000019365261,0.00086269405],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825156,0.000026688811,0.00026900644,0.0006343128,0.00028768022,0.0005307678],"domain_scores_gemma":[0.9987153,0.0000563488,0.000046751924,0.00069849234,0.00008346464,0.00039964035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001700603,0.00022479601,0.00022354188,0.00027093248,0.00022548335,0.00021704497,0.0010100367,0.00009676283,0.000021211084],"category_scores_gemma":[0.000011642811,0.00019466509,0.00019827594,0.00070886745,0.000027267164,0.00033918032,0.00026081514,0.00010684462,0.00006984889],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028793394,0.00031175264,0.00009138546,0.000022892536,0.00009686908,0.00008435166,0.00090687105,0.017331207,0.006004546,0.2255483,0.020890685,0.72868234],"study_design_scores_gemma":[0.007241055,0.0018658177,0.021922369,0.000087968,0.00004666542,0.00014914629,0.000055326276,0.4315734,0.06373247,0.45262736,0.018960293,0.0017381484],"about_ca_topic_score_codex":0.00041691618,"about_ca_topic_score_gemma":0.000060579707,"teacher_disagreement_score":0.7269442,"about_ca_system_score_codex":0.00004664135,"about_ca_system_score_gemma":0.00017510766,"threshold_uncertainty_score":0.79382116},"labels":[],"label_agreement":null},{"id":"W2097771880","doi":"10.1109/tvlsi.2010.2066994","title":"Digit-Level Semi-Systolic and Systolic Structures for the Shifted Polynomial Basis Multiplication Over Binary Extension Fields","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Systolic array; Polynomial basis; Finite field; Finite field arithmetic; Multiplier (economics); Mathematics; Multiplication (music); Arithmetic; Application-specific integrated circuit; Binary number; Polynomial; Multiplication algorithm; Very-large-scale integration; Discrete mathematics; Computer science; Algorithm; Combinatorics; Mathematical analysis; Computer hardware","score_opus":0.016219916403515208,"score_gpt":0.2491040589217064,"score_spread":0.23288414251819117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097771880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22549902,0.00014692025,0.7693735,0.00066694827,0.0030114204,0.0009433773,0.00015431325,0.00017256159,0.000031937925],"genre_scores_gemma":[0.99684423,0.000054895398,0.002041026,0.00018927717,0.0002267572,0.00038164653,0.0000148914405,0.00002553189,0.00022174684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802905,0.0001336725,0.0004956776,0.0006195552,0.00036329732,0.00035873396],"domain_scores_gemma":[0.9980171,0.00057612127,0.00018315414,0.0008692937,0.00021349151,0.0001408418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003776647,0.00030768028,0.00029490818,0.0003472089,0.0009027393,0.00044651414,0.00049921015,0.00034055623,0.00001748245],"category_scores_gemma":[0.000026302521,0.00021537128,0.00024329184,0.0004811797,0.0001122455,0.0005204129,0.000008350241,0.00053031807,0.000010841968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017052565,0.003206999,0.0014624124,0.0013976771,0.0014684851,0.000037982743,0.022296693,0.03665057,0.37467644,0.041190896,0.023416612,0.49248996],"study_design_scores_gemma":[0.0027594399,0.0004472337,0.024697417,0.00031876736,0.0002056182,0.0002714083,0.0010282226,0.9059361,0.05333055,0.0005398715,0.009502075,0.00096325576],"about_ca_topic_score_codex":0.00048446577,"about_ca_topic_score_gemma":0.0010839009,"teacher_disagreement_score":0.8692856,"about_ca_system_score_codex":0.00004772969,"about_ca_system_score_gemma":0.000061023482,"threshold_uncertainty_score":0.8782586},"labels":[],"label_agreement":null},{"id":"W2098583040","doi":"10.1007/978-3-642-23951-9_8","title":"Software Implementation of Binary Elliptic Curves: Impact of the Carry-Less Multiplier on Scalar Multiplication","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; 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; Computer science; Edwards curve; Arithmetic; Elliptic curve point multiplication; Elliptic curve cryptography; Elliptic curve; Parallel computing; Binary number; Curve25519; Side channel attack; Multiplier (economics); Multiplication (music); Algorithm; Mathematics; Cryptography; Public-key cryptography; Encryption; Operating system; Pure mathematics","score_opus":0.019906092385966717,"score_gpt":0.2741551563047373,"score_spread":0.25424906391877056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098583040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01580326,0.00093062996,0.9815395,0.00017335518,0.0005580577,0.00081506826,0.000032889508,0.00004750912,0.00009976126],"genre_scores_gemma":[0.9395486,0.00020205704,0.05987531,0.0002458329,0.0000691673,0.000013060524,0.000006099528,0.0000226856,0.000017169017],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9973244,0.00006424516,0.0005865562,0.0008467394,0.0008133568,0.00036470775],"domain_scores_gemma":[0.99698323,0.00037912428,0.0006249461,0.0016057326,0.00032136645,0.000085575375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053953426,0.00037374377,0.00043396195,0.000626011,0.00015902857,0.000051224317,0.0026819783,0.0001935995,0.000017813269],"category_scores_gemma":[0.000050808576,0.00025108276,0.0003709535,0.00093106006,0.00076182827,0.0002718593,0.00071586156,0.0004367752,0.0000041132307],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022049395,0.00018055766,0.009260311,0.00041805708,0.0000817215,0.000008256156,0.0030035535,0.024625693,0.0022137882,0.0061469176,0.000044021326,0.95399505],"study_design_scores_gemma":[0.00264088,0.0031149767,0.5730837,0.009595236,0.00018755904,0.00009257784,0.0000054582597,0.19818023,0.078082055,0.13213946,0.00016964987,0.0027081908],"about_ca_topic_score_codex":0.00032526237,"about_ca_topic_score_gemma":0.00009342563,"teacher_disagreement_score":0.9512869,"about_ca_system_score_codex":0.00013807819,"about_ca_system_score_gemma":0.0004318207,"threshold_uncertainty_score":0.99999416},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.006488179172410969,"score_gpt":0.247618420138361,"score_spread":0.24113024096595004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100201258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09689355,0.0000708475,0.89978784,0.00077221554,0.000117467505,0.00016396194,0.0000023149776,0.00005179577,0.0021400356],"genre_scores_gemma":[0.9401143,0.000008572481,0.057447467,0.002314491,0.00008963064,0.0000057242037,0.0000012575919,0.000010084608,0.000008468613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998558,0.00017949469,0.00030216973,0.0002444313,0.00047658634,0.00023936151],"domain_scores_gemma":[0.9985939,0.00019820308,0.00022242965,0.00052965345,0.00019287618,0.00026289345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000719985,0.0001690118,0.00021041745,0.0004504493,0.00011775638,0.00011981654,0.00071714586,0.00005929845,0.00006119609],"category_scores_gemma":[0.000018210063,0.000116376155,0.00018228937,0.0010787003,0.00005702544,0.00040315208,0.000015716661,0.00024800462,0.00002295689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001396834,0.002217432,0.008931094,0.00002001091,0.000120062075,0.0001555263,0.0017664502,0.0051503563,0.0020177963,0.75219536,0.002343804,0.22368528],"study_design_scores_gemma":[0.0024262988,0.00678156,0.12588108,0.00029802084,0.00009217378,0.0004038524,0.00025674098,0.0045519043,0.002282943,0.85117906,0.0050658826,0.0007804841],"about_ca_topic_score_codex":0.0000015935117,"about_ca_topic_score_gemma":0.000001877348,"teacher_disagreement_score":0.8432208,"about_ca_system_score_codex":0.000016686425,"about_ca_system_score_gemma":0.000052991112,"threshold_uncertainty_score":0.4745682},"labels":[],"label_agreement":null},{"id":"W2100570185","doi":"10.1007/978-3-540-24654-1_24","title":"More Generalized Mersenne Numbers","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mersenne prime; Mathematics; Modular arithmetic; Integer (computer science); Arithmetic; Moduli; Modular design; Discrete mathematics; Algorithm; Computer science; Cryptography; Physics","score_opus":0.011402160427876925,"score_gpt":0.23700942566528713,"score_spread":0.2256072652374102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100570185","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018933312,0.00082160404,0.9897588,0.0020859656,0.0020915281,0.00034714665,0.000004050715,0.00025443637,0.0044471165],"genre_scores_gemma":[0.10708516,0.00022028037,0.8880016,0.0034932278,0.00064020697,0.000013290773,0.0000083098685,0.00006508149,0.00047279944],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99579763,0.0000289968,0.0005052236,0.0017072543,0.0011200581,0.0008408298],"domain_scores_gemma":[0.9974317,0.00020686517,0.00024255968,0.0016679427,0.00018163555,0.00026928927],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054164365,0.0006144419,0.00058368704,0.001083841,0.00032541653,0.0005121065,0.003640715,0.0003901348,0.00005602191],"category_scores_gemma":[0.000037160335,0.00053863943,0.0002932964,0.0010809287,0.0012269067,0.00050441234,0.0011317241,0.00085433794,0.00006212667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010807575,0.00007666055,0.0000752563,0.00007773924,0.00005500162,0.0006546742,0.0027466808,0.07765207,0.0003142177,0.33820054,0.000064537075,0.5800718],"study_design_scores_gemma":[0.001115684,0.00020925116,0.000293557,0.00064288446,0.000028175325,0.00027011332,4.761348e-7,0.11287934,0.0023295423,0.8768964,0.0036469474,0.0016876279],"about_ca_topic_score_codex":0.000112936905,"about_ca_topic_score_gemma":0.00009768311,"teacher_disagreement_score":0.5783842,"about_ca_system_score_codex":0.00027846792,"about_ca_system_score_gemma":0.00067573524,"threshold_uncertainty_score":0.9997065},"labels":[],"label_agreement":null},{"id":"W2100848782","doi":"10.1109/ccece.1999.807251","title":"A comprehensive study of three moduli sets for residue arithmetic","year":2003,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Modulo; Moduli; Chinese remainder theorem; Binary number; Residue number system; Arithmetic; Modulo operation; Residue (chemistry); Mathematics; Converters; Adder; Very-large-scale integration; Discrete mathematics; Computer science; Algorithm; Voltage","score_opus":0.04036583193000956,"score_gpt":0.28095915865279997,"score_spread":0.2405933267227904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100848782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46936592,0.00021458683,0.52738804,0.00013465114,0.00021381438,0.00094661623,0.000002247138,0.00008924325,0.001644895],"genre_scores_gemma":[0.8889603,0.0000041737812,0.110833995,0.00008615687,0.000007821892,0.000051435465,4.3894576e-7,0.000007844285,0.000047807956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987139,0.00008941741,0.0002869523,0.00039193177,0.00025515578,0.00026264446],"domain_scores_gemma":[0.9986666,0.00028387975,0.000083825216,0.0006829329,0.00020698312,0.00007581122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015983483,0.0001459112,0.00025683895,0.00019648668,0.00012416528,0.000049961825,0.0005385261,0.000049649352,0.00001127359],"category_scores_gemma":[0.000042464046,0.000116758725,0.00011251604,0.00061412546,0.000057598758,0.00014504777,0.00009475546,0.00007942322,0.0000051126176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008314783,0.005500694,0.029176136,0.00028200206,0.00059674936,0.000059595444,0.006251665,0.002293133,0.0029850607,0.9133222,0.0026001325,0.036849476],"study_design_scores_gemma":[0.015910352,0.009193188,0.3979282,0.00010315274,0.00022592301,0.00013401588,0.005247943,0.07603722,0.02622484,0.46031126,0.0068577966,0.0018260858],"about_ca_topic_score_codex":0.00011575406,"about_ca_topic_score_gemma":0.00023761703,"teacher_disagreement_score":0.45301095,"about_ca_system_score_codex":0.000007689702,"about_ca_system_score_gemma":0.00004190954,"threshold_uncertainty_score":0.47612825},"labels":[],"label_agreement":null},{"id":"W2100879064","doi":"10.1109/itcc.2004.1286717","title":"Area efficient high speed elliptic curve cryptoprocessor for random curves","year":2004,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Division (mathematics); Parallel computing; Elliptic curve; Multiplication (music); Elliptic Curve Digital Signature Algorithm; Scalability; Binary number; Finite field; Clock rate; Scalar multiplication; Elliptic curve cryptography; Elliptic curve point multiplication; Arithmetic; Computer hardware; Mathematics; Discrete mathematics; Chip; Public-key cryptography; Mathematical analysis","score_opus":0.013186173685507582,"score_gpt":0.2319521820407177,"score_spread":0.21876600835521012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100879064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058577757,0.0014335217,0.93414414,0.0033515908,0.00044968503,0.0006859932,0.0000048949105,0.00029219541,0.0010602208],"genre_scores_gemma":[0.92196536,0.00016234937,0.07646367,0.0010245071,0.00008253154,0.00005030779,0.0000068457903,0.000014868309,0.00022958279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984577,0.00002585458,0.00028739724,0.00048478172,0.0003178324,0.00042643846],"domain_scores_gemma":[0.9989138,0.0002183496,0.000083342085,0.00049306854,0.00015545476,0.00013597001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034943974,0.00019848016,0.00026697438,0.00016119865,0.00019918526,0.00013941737,0.00076666,0.00006459807,0.00003383573],"category_scores_gemma":[0.00008243683,0.00014697254,0.00021055852,0.0006543949,0.000085851105,0.00017104766,0.00010657255,0.000098494456,0.000047753212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019311988,0.0013182658,0.0003093599,0.0007617361,0.00018356854,0.000043324493,0.001120141,0.044334147,0.0030009353,0.93676716,0.0031557234,0.008812521],"study_design_scores_gemma":[0.05723735,0.0021729257,0.012768339,0.0021012237,0.00034831846,0.00023476858,0.00029816484,0.2117116,0.20985836,0.48838487,0.010800929,0.0040831473],"about_ca_topic_score_codex":0.00006232921,"about_ca_topic_score_gemma":0.000014551481,"teacher_disagreement_score":0.8633876,"about_ca_system_score_codex":0.000026165182,"about_ca_system_score_gemma":0.00008692704,"threshold_uncertainty_score":0.5993366},"labels":[],"label_agreement":null},{"id":"W2100891661","doi":"10.1109/arith.2005.11","title":"Arithmetic Operations in the Polynomial Modular Number System","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"University of Calgary","keywords":"Modular arithmetic; Modular design; Arithmetic; Modulo; Polynomial; Saturation arithmetic; Set (abstract data type); Mathematics; Representation (politics); Computer science; Discrete mathematics; Arbitrary-precision arithmetic; Algebra over a field; Pure mathematics; Programming language","score_opus":0.007164941213894422,"score_gpt":0.22559781634807696,"score_spread":0.21843287513418255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100891661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3643289,0.00019829308,0.57533586,0.012760183,0.00037784857,0.00046348266,0.0000015764862,0.00026966672,0.04626419],"genre_scores_gemma":[0.95447135,0.0000038289963,0.044650804,0.0005893747,0.000109919936,0.000024539428,5.3660733e-7,0.0000031769587,0.00014644205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991404,0.000102361984,0.00017331976,0.0002028322,0.00018809816,0.00019303364],"domain_scores_gemma":[0.9994228,0.000053318225,0.000012302793,0.00045421187,0.000022087414,0.00003532031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031057926,0.0000819307,0.0000845062,0.0000823277,0.00013864749,0.00022046661,0.0007218881,0.000039772505,0.000022970633],"category_scores_gemma":[0.000007113275,0.00005017798,0.000060822906,0.00053913833,0.00003259875,0.00028436945,0.00007121589,0.00011532331,0.00020461109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025472427,0.00025964397,0.0026519038,0.000015583024,0.000019685589,0.00004011294,0.0031444975,0.0131210275,0.0002859924,0.95877147,0.0025985357,0.019089011],"study_design_scores_gemma":[0.00080055156,0.000041728297,0.029178584,0.000030924308,0.000012107267,0.00032129363,0.00075011584,0.95157015,0.00082005525,0.00047503135,0.015659267,0.0003402171],"about_ca_topic_score_codex":0.00027105282,"about_ca_topic_score_gemma":0.00035016242,"teacher_disagreement_score":0.9582964,"about_ca_system_score_codex":0.000023568968,"about_ca_system_score_gemma":0.000028128525,"threshold_uncertainty_score":0.26299298},"labels":[],"label_agreement":null},{"id":"W2101597358","doi":"10.1109/iscas.2002.1010820","title":"Efficient digit-serial normal basis multipliers over GF(2/sup m/)","year":2003,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Redundancy (engineering); Numerical digit; Arithmetic; Computer science; GF(2); Gate count; Parallel computing; Algorithm; Mathematics; Finite field; Computer hardware; Discrete mathematics","score_opus":0.006642187208585729,"score_gpt":0.2065547553396491,"score_spread":0.19991256813106337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101597358","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.613049,0.00007410354,0.3349251,0.0002092509,0.0010896692,0.0002323716,0.000002985534,0.00030596447,0.050111625],"genre_scores_gemma":[0.9598233,0.0000048576917,0.039425887,0.00031881643,0.000051316103,0.000009016755,7.6341166e-7,0.000008355182,0.00035766416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986062,0.000060903716,0.00020424636,0.00039479518,0.00031541265,0.00041844096],"domain_scores_gemma":[0.99914634,0.000092606584,0.000040984818,0.0005129082,0.000039900864,0.00016723007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018700409,0.00015919376,0.00014024862,0.00015402297,0.00018823669,0.00019917374,0.0004934542,0.000073689676,0.0002306915],"category_scores_gemma":[0.000047726673,0.00012637259,0.00015630275,0.0006069012,0.000079815676,0.00015241452,0.00012684119,0.000112709226,0.00011120502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006634113,0.0012931305,0.02184962,0.000049215156,0.00019223134,0.00012858109,0.0032207062,0.055570334,0.0034351572,0.8416936,0.007860914,0.06464021],"study_design_scores_gemma":[0.011241893,0.00079053955,0.089216836,0.00008293317,0.000092867216,0.00021769264,0.00069315947,0.6199727,0.12292639,0.008919055,0.14225394,0.0035919754],"about_ca_topic_score_codex":0.000040865783,"about_ca_topic_score_gemma":0.000010667154,"teacher_disagreement_score":0.8327745,"about_ca_system_score_codex":0.000019925536,"about_ca_system_score_gemma":0.00005363266,"threshold_uncertainty_score":0.51533246},"labels":[],"label_agreement":null},{"id":"W2102271599","doi":"10.1109/iscas.2013.6572407","title":"High performance scalable elliptic curve cryptosystem processor in GF(2&lt;sup&gt;m&lt;/sup&gt;)","year":2013,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Elliptic curve cryptography; NIST; Computer science; Scalability; Elliptic curve; Elliptic curve point multiplication; Field-programmable gate array; Multiplication (music); Parallel computing; Hessian form of an elliptic curve; Cryptography; Elliptic Curve Digital Signature Algorithm; Arithmetic; Finite field; Cryptosystem; Embedded system; Computer hardware; Public-key cryptography; Algorithm; Mathematics; Operating system; Encryption; Discrete mathematics","score_opus":0.0074766083205659,"score_gpt":0.19541178040891513,"score_spread":0.18793517208834923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102271599","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93021935,0.00104707,0.058556005,0.0011023615,0.00047931267,0.001065778,0.0000032547132,0.0005025588,0.007024295],"genre_scores_gemma":[0.9663194,0.00018013883,0.030272456,0.0002702152,0.00012118455,0.0002451578,0.000003834012,0.000030255795,0.0025573527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653184,0.0001345818,0.0007185084,0.0009042021,0.0006857001,0.0010251607],"domain_scores_gemma":[0.99808025,0.00016092301,0.0001630098,0.0010644844,0.00025840843,0.00027293045],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00057440985,0.00041941402,0.0005004309,0.0005429779,0.00028761546,0.00055109296,0.0016762093,0.00021231742,0.00037339237],"category_scores_gemma":[0.000032941505,0.00033097365,0.00014257699,0.0022231569,0.00014218228,0.0018925694,0.00039452026,0.0003508463,0.0015882679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014048176,0.004042368,0.14180985,0.0050340383,0.0004949542,0.00025811797,0.0114444895,0.035445113,0.019393584,0.46023893,0.028975785,0.29272225],"study_design_scores_gemma":[0.0035534082,0.0008319893,0.120172866,0.0010147239,0.000048133003,0.00017696604,0.00032539832,0.82428366,0.02492969,0.007880257,0.014374512,0.0024083895],"about_ca_topic_score_codex":0.00031498526,"about_ca_topic_score_gemma":0.00009622452,"teacher_disagreement_score":0.78883857,"about_ca_system_score_codex":0.00007696418,"about_ca_system_score_gemma":0.0001442507,"threshold_uncertainty_score":0.9999142},"labels":[],"label_agreement":null},{"id":"W2102324711","doi":"10.1109/spl.2011.5782650","title":"A reconfigurable GF(2&lt;sup&gt;M&lt;/sup&gt;) elliptic curve cryptographic coprocessor","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Coprocessor; Computer science; Elliptic curve cryptography; Cryptography; Public-key cryptography; Elliptic Curve Digital Signature Algorithm; Advanced Encryption Standard; Encryption; Interoperability; Embedded system; Cryptographic protocol; IPsec; Operating system; Computer security; The Internet","score_opus":0.0218565981847904,"score_gpt":0.21603016785933454,"score_spread":0.19417356967454413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102324711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17722285,0.0066373087,0.40768987,0.0014941411,0.0016424292,0.0016809014,0.000025863903,0.002703862,0.40090278],"genre_scores_gemma":[0.9264328,0.0006622615,0.06934338,0.0008106305,0.00014933191,0.00013124595,0.0000070298743,0.00005870284,0.0024046013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99597055,0.00018063358,0.000737244,0.0012420249,0.00068396964,0.0011855665],"domain_scores_gemma":[0.9971053,0.00020899677,0.00022979143,0.0016141369,0.00035866114,0.00048310062],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00077565364,0.0005549166,0.00056851626,0.0008396103,0.00050645723,0.00038936947,0.002354329,0.00029799077,0.0014367916],"category_scores_gemma":[0.00007770318,0.00046337245,0.00046032955,0.002910056,0.00035844374,0.0011233077,0.00024490798,0.00044672366,0.000917992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015609614,0.0021706065,0.009346562,0.0004806863,0.0006977838,0.00036595514,0.010760096,0.0002011546,0.0074465317,0.89033216,0.024658445,0.053383894],"study_design_scores_gemma":[0.009898484,0.0043435046,0.069301754,0.001093365,0.00065922854,0.0013292352,0.0014552186,0.12391716,0.08048241,0.45917934,0.2386778,0.009662498],"about_ca_topic_score_codex":0.00020734925,"about_ca_topic_score_gemma":0.00016189962,"teacher_disagreement_score":0.74921,"about_ca_system_score_codex":0.000029892628,"about_ca_system_score_gemma":0.00017043926,"threshold_uncertainty_score":0.9998599},"labels":[],"label_agreement":null},{"id":"W2104596554","doi":"10.1109/mcas.2003.1242832","title":"Loading the bases: a new number representation with applications","year":2003,"lang":"en","type":"article","venue":"IEEE Circuits and Systems Magazine","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Logarithm; Discrete logarithm; Cryptography; Representation (politics); Computer science; Base (topology); Theoretical computer science; Digital filter; Property (philosophy); Simple (philosophy); Arithmetic; Mathematics; Algorithm; Filter (signal processing); Public-key cryptography; Encryption","score_opus":0.02228877709529028,"score_gpt":0.24962611963738907,"score_spread":0.22733734254209878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104596554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008420038,0.0007759405,0.9714014,0.00033080275,0.00025750857,0.00055855286,0.0000015434402,0.00008447062,0.018169777],"genre_scores_gemma":[0.99745494,0.00003767097,0.0008462977,0.00010384917,0.000106226435,0.000080493846,8.809739e-7,0.000007829694,0.0013618249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990836,0.000090886155,0.00017097688,0.0002929969,0.00018937151,0.00017221937],"domain_scores_gemma":[0.99918115,0.00011707883,0.00008287437,0.00046185785,0.00006111559,0.000095928466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002315014,0.000102526516,0.00012366186,0.000050620387,0.00022335551,0.0002890471,0.0002196299,0.000032508255,0.0000070495003],"category_scores_gemma":[0.00001108871,0.00006208601,0.00003147589,0.0005927714,0.00005006584,0.00020561217,0.000013440892,0.000080529106,0.000052184456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045200886,0.00012910423,0.029184911,0.00016609867,0.00015120993,0.00004087629,0.0027407757,0.0012412483,0.0048639993,0.8999444,0.015035429,0.04649743],"study_design_scores_gemma":[0.006055744,0.0004494073,0.06321048,0.0007354333,0.00030000912,0.0062491638,0.0020628006,0.031633098,0.004273842,0.03020931,0.85245526,0.0023654413],"about_ca_topic_score_codex":0.00007702887,"about_ca_topic_score_gemma":0.000018060478,"teacher_disagreement_score":0.9890349,"about_ca_system_score_codex":0.000008842946,"about_ca_system_score_gemma":0.000049793227,"threshold_uncertainty_score":0.2787288},"labels":[],"label_agreement":null},{"id":"W2105248505","doi":"10.1109/ccece.1999.807262","title":"The applications of the new Chinese Remainder Theorems for three moduli sets","year":2003,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Chinese remainder theorem; Remainder; Moduli; Binary number; Converters; Residue number system; Mathematics; Combinatorics; Discrete mathematics; Arithmetic; Physics; Voltage; Quantum mechanics","score_opus":0.007388576182538561,"score_gpt":0.24037680104487402,"score_spread":0.23298822486233547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105248505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017021133,0.0003072921,0.9855806,0.003465523,0.00013790444,0.0005709431,0.0000010033895,0.000031963737,0.008202631],"genre_scores_gemma":[0.9603621,0.000015285183,0.038491305,0.00023626446,0.000032938624,0.000087172724,2.5500748e-7,0.0000062224885,0.0007684911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993877,0.000033889544,0.00013225526,0.00015740674,0.00014011173,0.00014867025],"domain_scores_gemma":[0.99873847,0.00029788603,0.000057700727,0.0008139335,0.00005345217,0.00003857266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002955295,0.00007219673,0.00006722001,0.000023606108,0.00032851,0.000054407334,0.0008741233,0.000030575873,0.000005761288],"category_scores_gemma":[0.00004923514,0.000029532115,0.00012927744,0.00054271304,0.000103956016,0.00006334497,0.000075661876,0.00005674216,0.000002739331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010422734,0.000019032115,0.00079888775,0.000002782817,0.000012405717,2.3209108e-8,0.00011104208,0.0000674827,0.00009366729,0.97603095,0.0009502571,0.021912415],"study_design_scores_gemma":[0.00019231155,0.0000146891525,0.009067619,0.0000028949626,0.000005145943,0.0000042736424,0.00002284385,0.0052838484,0.00086106325,0.96786904,0.016613245,0.00006299301],"about_ca_topic_score_codex":0.00001843695,"about_ca_topic_score_gemma":0.00022701452,"teacher_disagreement_score":0.95865995,"about_ca_system_score_codex":0.0000038696344,"about_ca_system_score_gemma":0.000064391825,"threshold_uncertainty_score":0.25266665},"labels":[],"label_agreement":null},{"id":"W2105469151","doi":"","title":"New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields (full version).","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Waterloo","funders":"","keywords":"Precomputation; Scalar multiplication; Cryptosystem; Scalar (mathematics); Elliptic curve; Computer science; Mathematics; Scheme (mathematics); Integer (computer science); Algorithm; Arithmetic; Cryptography; Pure mathematics; Mathematical analysis; Geometry; Computation","score_opus":0.013658149343092615,"score_gpt":0.25966409044013494,"score_spread":0.24600594109704232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105469151","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11447151,0.00058124046,0.8802577,0.0012539092,0.0013722177,0.0014287676,0.000052243387,0.0002164608,0.00036589467],"genre_scores_gemma":[0.088309854,0.0004069345,0.91042155,0.00018797272,0.00028909763,0.00018038494,0.0001618476,0.000033190237,0.000009151693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683875,0.00031975834,0.00068378804,0.0013087788,0.00028929356,0.0005596467],"domain_scores_gemma":[0.99751794,0.00074746454,0.00027720447,0.0009773369,0.00017543146,0.00030464458],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025882846,0.00051546015,0.00070540933,0.0004976142,0.0004845021,0.0002580896,0.0010888691,0.00050275016,0.000023141954],"category_scores_gemma":[0.00007596316,0.00051539997,0.0003590515,0.00021730257,0.00023946902,0.00024122027,0.0018187035,0.0008947166,0.00005178109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022434672,0.0003135877,0.0054067182,0.00048901513,0.00078610214,0.00006520667,0.008482008,0.03091476,0.0037813128,0.93096685,0.0045831376,0.013986945],"study_design_scores_gemma":[0.002242361,0.00045163915,0.0195911,0.0003504978,0.00012267414,0.0003090468,0.000053099684,0.50435066,0.0015671683,0.4658023,0.0040106922,0.0011487753],"about_ca_topic_score_codex":0.00025373517,"about_ca_topic_score_gemma":0.00016292722,"teacher_disagreement_score":0.47343588,"about_ca_system_score_codex":0.000060329374,"about_ca_system_score_gemma":0.00044233643,"threshold_uncertainty_score":0.99972975},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.055010798019638624,"score_gpt":0.24182970747747698,"score_spread":0.18681890945783836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106876320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026712235,0.00010509956,0.97053736,0.00094455667,0.00082254974,0.0005561969,0.00003488706,0.00019269994,0.00009440832],"genre_scores_gemma":[0.9597234,0.00002740697,0.039696384,0.00033923285,0.000046873265,0.0001116521,0.0000020703774,0.000016088563,0.000036905894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982739,0.00009910093,0.00029932303,0.00067214604,0.0002647562,0.00039075396],"domain_scores_gemma":[0.998743,0.00029758006,0.000068341884,0.00059230556,0.00008050449,0.0002182581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033008333,0.0002712455,0.00036226842,0.0008527586,0.00035537838,0.00032517957,0.0005822828,0.00009475082,0.000005593145],"category_scores_gemma":[0.0000018403837,0.00023199915,0.0003694346,0.0016207191,0.00007421437,0.00027578068,0.0000067017827,0.00015660936,0.000007630946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033189126,0.001584766,0.001930753,0.00015588614,0.005935135,0.000051326377,0.013262319,0.4720022,0.00065282977,0.0056312713,0.0019830912,0.49647853],"study_design_scores_gemma":[0.0014705524,0.0008513908,0.004981503,0.00010384873,0.00029414336,0.00010088571,0.00033075054,0.98092467,0.0019806663,0.00071969227,0.0072994977,0.0009423781],"about_ca_topic_score_codex":0.000043499756,"about_ca_topic_score_gemma":0.00007746677,"teacher_disagreement_score":0.9330112,"about_ca_system_score_codex":0.000042333773,"about_ca_system_score_gemma":0.000029809618,"threshold_uncertainty_score":0.94606507},"labels":[],"label_agreement":null},{"id":"W2106916437","doi":"10.1109/tdsc.2008.21","title":"Error Detection and Fault Tolerance in ECSM Using Input Randomization","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Electrical, Communications and Cyber Systems; Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología","keywords":"Computer science; Elliptic curve cryptography; Cryptosystem; Fault tolerance; Scalar multiplication; Fault detection and isolation; Error detection and correction; Cryptography; Algorithm; Elliptic curve; Parallel computing; Computer engineering; Public-key cryptography; Mathematics; Distributed computing; Encryption; Artificial intelligence","score_opus":0.017692184813403455,"score_gpt":0.2371697182894762,"score_spread":0.21947753347607274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106916437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47466213,0.00016646615,0.5247909,0.000026720341,0.00017886401,0.00010461739,7.088905e-7,0.00004746625,0.00002212654],"genre_scores_gemma":[0.98834765,0.00014296119,0.0113871405,0.00007212513,0.000028647257,0.0000035875996,3.1773098e-7,0.000009084978,0.000008489201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989008,0.000095460695,0.000247168,0.00037260933,0.00014974778,0.00023424833],"domain_scores_gemma":[0.99953705,0.00013219002,0.00006560002,0.00015653443,0.000038014747,0.000070591756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019974567,0.00015155366,0.0002053099,0.00030290603,0.00058125635,0.00007842324,0.00011697155,0.000105055755,0.0000022221607],"category_scores_gemma":[0.000004393981,0.00014740416,0.000046459052,0.0005621743,0.000059108457,0.00036758548,0.000005033308,0.00029085157,0.0000011849138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017809679,0.00021315344,0.00060017256,0.000085929794,0.00004434543,0.00011310707,0.006985112,0.8558602,0.009515805,0.000223517,0.000003932727,0.12617667],"study_design_scores_gemma":[0.0020541355,0.000062992774,0.00084133947,0.000070345464,0.000010361455,0.0003708651,0.000070727074,0.9854959,0.010638194,0.00015412788,0.000038060214,0.00019289939],"about_ca_topic_score_codex":0.00015659958,"about_ca_topic_score_gemma":0.00017589993,"teacher_disagreement_score":0.5136855,"about_ca_system_score_codex":0.000022609953,"about_ca_system_score_gemma":0.00002710779,"threshold_uncertainty_score":0.60109675},"labels":[],"label_agreement":null},{"id":"W2107715286","doi":"10.1109/acssc.2008.5074514","title":"The double-base number system in elliptic curve cryptography","year":2008,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Elliptic curve cryptography; Scalar multiplication; Elliptic curve; Elliptic Curve Digital Signature Algorithm; Mathematics; Elliptic curve point multiplication; Cryptography; Base (topology); Arithmetic; Multiplication (music); Discrete mathematics; Computer science; Public-key cryptography; Algorithm; Combinatorics; Pure mathematics; Encryption; Mathematical analysis; Computer security","score_opus":0.01646807947563744,"score_gpt":0.22580709790783607,"score_spread":0.20933901843219863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107715286","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58414227,0.0017159387,0.3205961,0.0016348083,0.001494813,0.0008272449,0.0000013634564,0.00089684874,0.08869062],"genre_scores_gemma":[0.9897652,0.00013814316,0.009759098,0.000099396726,0.000042413973,0.000038733513,4.475989e-7,0.000007901514,0.00014865905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985605,0.00009281796,0.0002876292,0.00033890666,0.0003144593,0.00040567777],"domain_scores_gemma":[0.9988489,0.00021522524,0.000056916804,0.0007198569,0.00005781889,0.000101260186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036705544,0.00015025334,0.0001487503,0.00015425646,0.00042519296,0.00013493025,0.0009010823,0.000062216786,0.000012210954],"category_scores_gemma":[0.000005400131,0.00009187213,0.0001613552,0.0015256223,0.00017686647,0.00023973145,0.00013428203,0.00018125567,0.0002056748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021416945,0.000094809104,0.0584568,0.000022343704,0.000024693156,0.00016076329,0.0005448138,0.000095722906,0.000038942217,0.93739176,0.0012521114,0.0018958288],"study_design_scores_gemma":[0.020614056,0.00065042556,0.6932035,0.0007085474,0.000085973865,0.0045068613,0.003500985,0.11469161,0.013967495,0.04762109,0.095714286,0.0047351406],"about_ca_topic_score_codex":0.0002615327,"about_ca_topic_score_gemma":0.00012558878,"teacher_disagreement_score":0.8897707,"about_ca_system_score_codex":0.000022292767,"about_ca_system_score_gemma":0.00005075342,"threshold_uncertainty_score":0.37464368},"labels":[],"label_agreement":null},{"id":"W2108669494","doi":"10.1109/tvlsi.2008.2003005","title":"A High-Speed Word Level Finite Field Multiplier in ${\\BBF}_{2^m}$ Using Redundant Representation","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Multiplier (economics); Very-large-scale integration; Finite field; CMOS; Critical path method; Computer science; Representation (politics); Word (group theory); Mathematics; Arithmetic; Algorithm; Discrete mathematics; Electronic engineering; Engineering; Embedded system","score_opus":0.034707471790076654,"score_gpt":0.2788890413605979,"score_spread":0.24418156957052123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108669494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105209045,0.000073275056,0.8909877,0.0006434731,0.0021557386,0.0005489302,0.000033522974,0.0001862755,0.00016206311],"genre_scores_gemma":[0.98871636,0.00003820564,0.01036108,0.0002587144,0.0001027368,0.000036883353,0.000009377643,0.000016577584,0.0004600745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973086,0.0002967937,0.00075428217,0.00067900505,0.0005134625,0.0004478382],"domain_scores_gemma":[0.99855,0.00031172534,0.00019250133,0.0006468222,0.00016997874,0.00012894519],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046961821,0.00030404504,0.0003810838,0.0007952652,0.00036160182,0.0003594919,0.00042025858,0.00024937015,0.00003341593],"category_scores_gemma":[0.000026264262,0.0002792271,0.00023754324,0.0014052565,0.000039715793,0.0008154776,0.000003864226,0.00051893626,0.0000487005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072372536,0.0037791282,0.0004735359,0.0001398466,0.00023712334,0.00020606877,0.01680404,0.6733562,0.087490715,0.0071804407,0.0014401842,0.20816901],"study_design_scores_gemma":[0.0021665317,0.00037190682,0.002403885,0.0006327859,0.000043376014,0.00007040521,0.0013817024,0.9220866,0.06913206,0.0006460928,0.00040954517,0.0006551148],"about_ca_topic_score_codex":0.001010801,"about_ca_topic_score_gemma":0.0007182285,"teacher_disagreement_score":0.8835073,"about_ca_system_score_codex":0.00017484672,"about_ca_system_score_gemma":0.00007035599,"threshold_uncertainty_score":0.99996597},"labels":[],"label_agreement":null},{"id":"W2109643804","doi":"10.1145/1454586.1454608","title":"An efficient security algorithm in mobile computing for resource constrained mobile devices.","year":2008,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Key (lock); Mobile device; Extension (predicate logic); Focus (optics); Key exchange; Mobile computing; Resource (disambiguation); Polynomial; Field (mathematics); Distributed computing; Mobile telephony; Finite field; Theoretical computer science; Computer network; Public-key cryptography; Mobile radio; Computer security; Mathematics; Operating system; Discrete mathematics; Programming language; Encryption","score_opus":0.009582834939218242,"score_gpt":0.25165133525275485,"score_spread":0.2420685003135366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109643804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44940743,0.00028667593,0.5486539,0.0000336986,0.00009829154,0.00065717526,0.000006014937,0.00020674689,0.00065010064],"genre_scores_gemma":[0.84218216,0.0000063236985,0.15746434,0.00020379611,0.000050748877,0.00006472065,0.000006667765,0.000008692421,0.000012529883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832714,0.00008942318,0.0003384426,0.0005517293,0.00023632881,0.00045694938],"domain_scores_gemma":[0.99894166,0.0002586477,0.000077302786,0.0004923407,0.00007867893,0.0001513524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048789883,0.0001732417,0.00023610602,0.00023111675,0.00029032055,0.00007689704,0.0006988618,0.000088282395,0.000011945414],"category_scores_gemma":[0.000010355323,0.00015385379,0.00011606213,0.00073286117,0.0001681013,0.00014535664,0.00013353897,0.00015607916,0.000006146614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005759805,0.005351525,0.018746864,0.00023666666,0.000108766326,0.00043774693,0.042584006,0.2035323,0.0010693751,0.038745604,0.0015769793,0.6875526],"study_design_scores_gemma":[0.0009808914,0.00034552848,0.0032168566,0.000022248323,0.0000036910908,0.00008842043,0.0005701224,0.989011,0.0011078619,0.0004252462,0.0039423634,0.0002857977],"about_ca_topic_score_codex":0.00006963226,"about_ca_topic_score_gemma":0.00003367387,"teacher_disagreement_score":0.78547865,"about_ca_system_score_codex":0.000027849876,"about_ca_system_score_gemma":0.000074658805,"threshold_uncertainty_score":0.62739754},"labels":[],"label_agreement":null},{"id":"W2110237983","doi":"10.1007/s13369-014-1363-5","title":"Low-Power, High-Speed Unified and Scalable Word-Based Radix 8 Architecture for Montgomery Modular Multiplication in GF(P) and GF(2 n )","year":2014,"lang":"en","type":"article","venue":"Arabian Journal for Science and Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Adder; Scalability; Computer science; Multiplication (music); Modular design; Word (group theory); Application-specific integrated circuit; Throughput; Ranging; Parallel computing; Arithmetic; Speedup; Field-programmable gate array; Computer hardware; Mathematics; Telecommunications","score_opus":0.005957615908394863,"score_gpt":0.20628601171432728,"score_spread":0.20032839580593242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110237983","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54128057,0.00023405599,0.45746046,0.000702296,0.00014509221,0.00015373026,9.997551e-7,0.000019289857,0.0000034962238],"genre_scores_gemma":[0.9287581,0.000041573207,0.071067885,0.00007270983,0.00003587252,0.00001135979,4.5695003e-7,0.0000075054236,0.000004570756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989335,0.000012824121,0.0001872712,0.00032782523,0.00017948021,0.0003591031],"domain_scores_gemma":[0.9993052,0.00016901262,0.00005477638,0.00017757788,0.00008645944,0.0002070067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010808541,0.00012820885,0.00015967047,0.0004601479,0.0003357838,0.00033768252,0.00029856476,0.00004597593,2.3192254e-7],"category_scores_gemma":[0.00017789136,0.000109826404,0.000034021465,0.000570443,0.00013399968,0.00048112503,0.000046951624,0.00014884432,1.18720756e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110242465,0.00014689905,0.0037517562,0.00044132426,0.00003784308,0.000012528924,0.0029055667,0.29284874,0.28275353,0.036638517,0.00006855928,0.38028452],"study_design_scores_gemma":[0.0012646157,0.00018681966,0.031306453,0.00012562645,0.000006262893,0.00005718509,0.00002822711,0.95602864,0.0055932323,0.0044897855,0.00069597433,0.00021716412],"about_ca_topic_score_codex":0.000008452615,"about_ca_topic_score_gemma":0.0000064442756,"teacher_disagreement_score":0.66317993,"about_ca_system_score_codex":0.00002035245,"about_ca_system_score_gemma":0.000042565112,"threshold_uncertainty_score":0.44785908},"labels":[],"label_agreement":null},{"id":"W2110692871","doi":"10.1109/tc.2006.136","title":"Arithmetic Operations in Finite Fields of Medium Prime Characteristic Using the Lagrange Representation","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Representation (politics); Prime (order theory); Finite field; Mathematics; Set (abstract data type); Field (mathematics); Arithmetic; Elliptic curve; Discrete mathematics; Elliptic curve cryptography; Algorithm; Computer science; Algebra over a field; Combinatorics; Pure mathematics; Public-key cryptography","score_opus":0.020109500927512666,"score_gpt":0.2534701662797203,"score_spread":0.23336066535220762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110692871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113941856,0.000025789728,0.8842965,0.00071611995,0.0007258301,0.00020777498,0.000005524003,0.000045235553,0.000035385885],"genre_scores_gemma":[0.9798421,0.0000124922535,0.01992826,0.00013201627,0.00004261709,0.000016815055,0.0000021440817,0.0000066123207,0.000016888805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988821,0.00012928352,0.00033001637,0.00025793235,0.00022204155,0.00017859523],"domain_scores_gemma":[0.99909246,0.0003371316,0.00006176171,0.00042011263,0.000057341982,0.00003118462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001522582,0.000120624216,0.00015647215,0.0003240832,0.0001766959,0.00008531339,0.0004060593,0.00006404292,0.000007103564],"category_scores_gemma":[0.000003478126,0.00009721274,0.00011192733,0.0008954855,0.00008977225,0.0002350239,0.0000044784897,0.00020730127,0.00000346154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015565469,0.0004043101,0.00030950995,0.000019140422,0.000035452016,0.000022070733,0.0012859459,0.97902125,0.0030948531,0.0011051208,0.000029292287,0.014657474],"study_design_scores_gemma":[0.0005394269,0.00009214515,0.01573379,0.00007967954,0.000028190763,0.000022553882,0.00004177525,0.9650842,0.017652323,0.00052383624,0.00002476622,0.00017731143],"about_ca_topic_score_codex":0.001071505,"about_ca_topic_score_gemma":0.00049635884,"teacher_disagreement_score":0.8659003,"about_ca_system_score_codex":0.000025926794,"about_ca_system_score_gemma":0.000047522728,"threshold_uncertainty_score":0.39642203},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023975009667327848,"score_gpt":0.22589918090063205,"score_spread":0.2019241712333042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111459803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024204286,0.000087135144,0.97319233,0.0008968933,0.001193076,0.00013408648,0.0000040827576,0.00014840474,0.00013972857],"genre_scores_gemma":[0.87533903,0.00006274605,0.12353901,0.00093194976,0.000055858363,0.0000069567777,1.7393639e-7,0.000010959667,0.000053296968],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887353,0.00005488522,0.00019804444,0.0004090538,0.00018072498,0.00028373653],"domain_scores_gemma":[0.99905604,0.0003562881,0.000043538723,0.00038116108,0.000027273833,0.00013569629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000064840504,0.00018457475,0.0001664838,0.00032917934,0.0003294556,0.00016064817,0.00033385959,0.00009746928,0.00004752124],"category_scores_gemma":[0.0000019846564,0.00017746023,0.00014603895,0.00043362263,0.00006785679,0.00029278276,0.0000062661256,0.00023428208,0.000027666722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054170087,0.0006328535,0.00019669927,0.000039455987,0.0002121667,0.000077111785,0.0031520885,0.31500092,0.0009826857,0.00032291774,0.0027414975,0.6765874],"study_design_scores_gemma":[0.00081883033,0.00017841377,0.00020945212,0.000043553435,0.000022824996,0.000042205098,0.000017924813,0.99467987,0.0026837317,0.00004820543,0.0009667879,0.00028820705],"about_ca_topic_score_codex":0.00007721198,"about_ca_topic_score_gemma":0.000015141678,"teacher_disagreement_score":0.8511348,"about_ca_system_score_codex":0.000020579848,"about_ca_system_score_gemma":0.000010623695,"threshold_uncertainty_score":0.72366184},"labels":[],"label_agreement":null},{"id":"W2112566740","doi":"10.1007/s00200-005-0186-8","title":"Cryptographic implications of Hess' generalized GHS attack","year":2005,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Finite field; Generalization; Logarithm; Elliptic curve; Mathematics; Cryptography; Field (mathematics); Pure mathematics; Discrete mathematics; Computer science; Mathematical analysis; Public-key cryptography; Algorithm; Encryption; Computer security","score_opus":0.010676443347573252,"score_gpt":0.238737300977275,"score_spread":0.22806085762970174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112566740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4588228,0.0024862078,0.53634876,0.0013829186,0.000022088478,0.0002134908,7.839293e-7,0.0001829197,0.0005400711],"genre_scores_gemma":[0.80653006,0.0003606077,0.192946,0.00010747391,0.000015791371,0.000024682153,0.0000034657096,0.000009221821,0.0000026881967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989762,0.000045398545,0.0003904106,0.00024998502,0.00010404734,0.00023399894],"domain_scores_gemma":[0.99863935,0.00022724614,0.0001088703,0.00090564846,0.000050697454,0.00006818831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034331545,0.00013609347,0.00020798265,0.00028050845,0.00012165622,0.000064557345,0.00085670815,0.00006560981,0.0000031180948],"category_scores_gemma":[0.000013981685,0.00014588772,0.000059854985,0.0010034424,0.00005844478,0.0001932934,0.00038617512,0.00020236151,0.0000026336543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029512528,0.0001945949,0.0077985604,0.00008710531,0.00004109757,3.198469e-7,0.0009595323,0.09339289,0.007828376,0.7831854,0.00008444453,0.10642469],"study_design_scores_gemma":[0.00092187687,0.000031400632,0.11583006,0.00014313901,0.000012378781,0.000023679404,0.0000483853,0.8661386,0.0035259114,0.0066003855,0.006292618,0.00043157005],"about_ca_topic_score_codex":0.000047166788,"about_ca_topic_score_gemma":0.000012910198,"teacher_disagreement_score":0.77658504,"about_ca_system_score_codex":0.000016532704,"about_ca_system_score_gemma":0.000014649814,"threshold_uncertainty_score":0.5949129},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.01364235175092877,"score_gpt":0.21011957729063752,"score_spread":0.19647722553970876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114353618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008817822,0.000065032444,0.98845863,0.0004984614,0.0013662413,0.00018561614,0.0000053362237,0.00019467926,0.00040820046],"genre_scores_gemma":[0.67229855,0.00007169209,0.3272614,0.00017293374,0.000047431382,0.0000076080837,4.0513197e-7,0.0000117000955,0.00012829626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985993,0.00006002623,0.00032383777,0.00041376607,0.00032152998,0.00028152592],"domain_scores_gemma":[0.9989808,0.00015590397,0.000100893114,0.00054898794,0.00005000114,0.00016337127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006860971,0.00020557713,0.00023153567,0.00037577402,0.0001620639,0.00008002317,0.0005106534,0.00010564508,0.00015874938],"category_scores_gemma":[0.000001149071,0.00019796912,0.00025832784,0.0007339425,0.00011049112,0.00035691593,0.000003792935,0.00024286233,0.00005626782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004401739,0.0005355663,0.00018282919,0.000041045554,0.0002657357,0.00002719984,0.0019979617,0.16846877,0.0010057009,0.007456385,0.004616653,0.81535816],"study_design_scores_gemma":[0.0033730448,0.00048515448,0.0016888008,0.0001558189,0.00007103776,0.00016500147,0.000071717935,0.9780891,0.009962717,0.002032985,0.0031809139,0.00072371616],"about_ca_topic_score_codex":0.00008023509,"about_ca_topic_score_gemma":0.0000098325745,"teacher_disagreement_score":0.81463444,"about_ca_system_score_codex":0.000030480749,"about_ca_system_score_gemma":0.000027254438,"threshold_uncertainty_score":0.80729467},"labels":[],"label_agreement":null},{"id":"W2114535050","doi":"10.1515/jmc.2010.007","title":"On the asymptotic effectiveness of Weil descent attacks","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo; National Science Foundation","keywords":"Descent (aeronautics); Generalization; Mathematics; Discrete logarithm; Logarithm; Genus; Gradient descent; Pure mathematics; Discrete mathematics; Applied mathematics; Combinatorics; Mathematical analysis; Computer science; Public-key cryptography; Artificial intelligence; Artificial neural network; Computer security","score_opus":0.009872256274622604,"score_gpt":0.2513074244030055,"score_spread":0.24143516812838292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114535050","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6675806,0.000034099194,0.3289383,0.0019425834,0.00052111625,0.00012065304,3.0290093e-7,0.00001008271,0.0008522503],"genre_scores_gemma":[0.9745952,0.000004505158,0.02524746,0.00009528351,0.000046452835,0.0000029809057,3.8676585e-8,0.000005953957,0.0000021075507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848497,0.0003623669,0.000480034,0.00012320736,0.00034267546,0.00020671745],"domain_scores_gemma":[0.9960027,0.0029691749,0.00032963618,0.00041301863,0.00019072379,0.00009479314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018189179,0.00012001086,0.00039214402,0.0001581188,0.00006559825,0.000030816944,0.0009370522,0.00011186649,0.00004604566],"category_scores_gemma":[0.00090507447,0.00006286414,0.00023966478,0.00025678865,0.00017034415,0.000091004746,0.000104786326,0.00058414007,0.000028205466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043188087,0.0003648191,0.00026238765,0.00009636764,0.000059147464,0.00003112986,0.00013836115,0.00001658259,0.008626561,0.98919535,0.00015628421,0.0010098345],"study_design_scores_gemma":[0.00063354225,0.0007225015,0.009976446,0.00020138924,0.000040596533,0.0009162946,0.00004598451,0.0011710436,0.019955466,0.96614146,0.00008109597,0.00011418867],"about_ca_topic_score_codex":4.709352e-7,"about_ca_topic_score_gemma":6.32019e-7,"teacher_disagreement_score":0.3070146,"about_ca_system_score_codex":0.000009768285,"about_ca_system_score_gemma":0.00006589468,"threshold_uncertainty_score":0.2563525},"labels":[],"label_agreement":null},{"id":"W2114896656","doi":"10.1007/978-3-642-13797-6_9","title":"On the Efficiency and Security of Pairing-Based Protocols in the Type 1 and Type 4 Settings","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Type (biology); Computer science; Cryptographic protocol; Protocol (science); Cryptographic primitive; Cryptography; Elliptic curve; Security analysis; Theoretical computer science; Hash function; Signature (topology); Focus (optics); Genus; Computer security; Mathematics; Pure mathematics; Physics; Geometry","score_opus":0.012356515870563987,"score_gpt":0.2477839964129268,"score_spread":0.23542748054236282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114896656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034562934,0.00052717474,0.94721276,0.00651228,0.00073509413,0.008966498,0.0000044340004,0.000079716345,0.0013991286],"genre_scores_gemma":[0.9757111,0.000010640465,0.021970684,0.0021427106,0.000066273955,0.000080447535,5.5262467e-7,0.000011668036,0.000005909875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816847,0.000072664814,0.0002611469,0.00066286,0.0005456683,0.00028919388],"domain_scores_gemma":[0.9973648,0.0014266699,0.00016487774,0.0008497715,0.0001468081,0.00004708222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016457873,0.00024847643,0.00024711376,0.00035519086,0.00021343748,0.00025051585,0.0017501218,0.00017953092,0.000004254977],"category_scores_gemma":[0.00023685084,0.00013704822,0.000039733426,0.0009392296,0.0012060903,0.000099487865,0.0004127994,0.00091127265,0.0000015012597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017068029,0.00065349054,0.00587503,0.0008675368,0.00003814045,0.00026674647,0.027853543,0.01062709,0.0024176105,0.55752057,0.00013109873,0.39357847],"study_design_scores_gemma":[0.0007550785,0.0018061841,0.0051905173,0.0017117097,0.000013664417,0.00010113143,0.0000021861815,0.35826623,0.0047480245,0.6246269,0.0019077767,0.0008706606],"about_ca_topic_score_codex":0.00001718886,"about_ca_topic_score_gemma":0.00006794924,"teacher_disagreement_score":0.94114816,"about_ca_system_score_codex":0.000015446103,"about_ca_system_score_gemma":0.00022512545,"threshold_uncertainty_score":0.55886644},"labels":[],"label_agreement":null},{"id":"W2116936848","doi":"10.1109/tc.2010.258","title":"Concurrent Error Detection in Montgomery Multiplication over Binary Extension Fields","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scalar multiplication; Multiplication (music); Error detection and correction; Elliptic curve cryptography; Finite field; Arithmetic; Cryptography; Finite field arithmetic; Elliptic Curve Digital Signature Algorithm; Binary number; Elliptic curve; Parallel computing; Algorithm; Mathematics; Public-key cryptography; Discrete mathematics; Encryption","score_opus":0.013944739712713568,"score_gpt":0.2519873307034088,"score_spread":0.23804259099069522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116936848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3253727,0.000013271091,0.67107505,0.0002742764,0.0029490069,0.00016449035,0.0000013295577,0.0001319655,0.000017919707],"genre_scores_gemma":[0.99296004,0.000022919612,0.006701223,0.00021282274,0.000043115964,0.000038604252,8.4698434e-7,0.000009197138,0.00001122387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883175,0.000057602752,0.00023749545,0.0004445588,0.00020217286,0.00022641452],"domain_scores_gemma":[0.9991556,0.0001515628,0.000059726917,0.00049714313,0.00004472016,0.0000912934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014109623,0.00015785357,0.00013747158,0.00046274666,0.00016956082,0.000067463334,0.0003457425,0.00014194369,0.0000109123575],"category_scores_gemma":[0.0000024484093,0.00015329504,0.00013053117,0.0006412815,0.000056563586,0.00033640486,0.0000050420263,0.0005449918,0.000023687004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019553574,0.00051849755,0.00007459267,0.000014278372,0.00001911043,0.000017232756,0.0005299566,0.03789384,0.04042378,0.00023200364,0.00009224191,0.9201649],"study_design_scores_gemma":[0.0009638314,0.00022940931,0.026546331,0.000050671926,0.000010302389,0.000029791327,0.000016548418,0.93574166,0.035473213,0.00019930035,0.00043255533,0.00030639287],"about_ca_topic_score_codex":0.00013105308,"about_ca_topic_score_gemma":0.00044778053,"teacher_disagreement_score":0.9198585,"about_ca_system_score_codex":0.000029885607,"about_ca_system_score_gemma":0.000023593018,"threshold_uncertainty_score":0.62511903},"labels":[],"label_agreement":null},{"id":"W2118490439","doi":"10.1109/icassp.1985.1168141","title":"An efficient VLSI adder for DSP architectures based on RNS","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Adder; Very-large-scale integration; Computer science; Residue number system; Binary number; Computer architecture; Digital signal processing; Context (archaeology); Carry-save adder; Table (database); Parallel computing; Arithmetic; Computer hardware; Embedded system; Latency (audio); Algorithm; Mathematics; Telecommunications","score_opus":0.0082122397087518,"score_gpt":0.2516121304168826,"score_spread":0.24339989070813078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118490439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05046778,0.000026469103,0.94285387,0.002558488,0.00012484094,0.00025115194,0.000003302187,0.00021204844,0.003502025],"genre_scores_gemma":[0.8125813,2.8290398e-7,0.18528502,0.0019551057,0.000092576825,0.000021905398,0.000001631541,0.0000056969225,0.000056486064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908197,0.00003249802,0.00011166549,0.00032607437,0.00019123295,0.00025655216],"domain_scores_gemma":[0.9991824,0.00015093885,0.0000238565,0.00050426536,0.00003223364,0.00010627859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015334146,0.000109011286,0.000086490705,0.00018065271,0.00013456173,0.000095974356,0.0005085793,0.0000396047,0.00004748726],"category_scores_gemma":[0.00001269158,0.00007673884,0.00010810449,0.00023221388,0.00003573587,0.000035601395,0.00002840029,0.00007229665,0.000019253126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054880715,0.0008752704,0.00020406925,0.00001675006,0.000016671871,0.000003994268,0.0006569626,0.65642023,0.00089382584,0.09168345,0.0020752281,0.24709865],"study_design_scores_gemma":[0.00051389285,0.00042118898,0.0036790506,0.0000083024315,0.0000041624903,0.0000017781728,0.000009948459,0.9785993,0.009002913,0.0009663599,0.006632138,0.00016093322],"about_ca_topic_score_codex":0.000008093314,"about_ca_topic_score_gemma":0.000035235855,"teacher_disagreement_score":0.7621135,"about_ca_system_score_codex":0.00000890392,"about_ca_system_score_gemma":0.000029119543,"threshold_uncertainty_score":0.3129319},"labels":[],"label_agreement":null},{"id":"W2120019782","doi":"10.1109/iscas.1999.780162","title":"A high-speed residue-to-binary converter and a scheme for its VLSI implementation","year":2003,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Concordia University","funders":"","keywords":"Very-large-scale integration; Microelectronics; Binary number; Residue number system; Moduli; CMOS; Residue (chemistry); Converters; Computer science; Electronic engineering; Voltage; Electrical engineering; Engineering; Mathematics; Algorithm; Arithmetic; Chemistry; Physics","score_opus":0.016188377734364,"score_gpt":0.2760072757397813,"score_spread":0.2598188980054173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120019782","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5229249,0.00016311058,0.47101936,0.0033024403,0.00035591976,0.0009686558,0.000006856117,0.00016157815,0.0010972044],"genre_scores_gemma":[0.7498054,0.00000888604,0.24839266,0.0013230824,0.000031466214,0.00003692247,0.0000030877923,0.000007720666,0.00039080952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991429,0.000035477307,0.00015188886,0.00031745026,0.00011880788,0.0002334893],"domain_scores_gemma":[0.9995065,0.000064920976,0.000030303994,0.00021194821,0.00008407537,0.0001022912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020936994,0.000098411714,0.0001025035,0.00013695595,0.00013495637,0.000107195745,0.00018056031,0.00003505676,0.00009340307],"category_scores_gemma":[0.000019103047,0.000082749815,0.000038421993,0.00032657266,0.00002408508,0.00024108644,0.00006745387,0.000033160304,0.000024037623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032442902,0.00008787476,0.0025949758,0.000059872626,0.000059290847,0.000008379169,0.0013326588,0.0000030290882,0.032436475,0.9334541,0.021305693,0.008625234],"study_design_scores_gemma":[0.011994317,0.0037878358,0.08197058,0.00008739188,0.0001025397,0.000119172946,0.0014427634,0.02853091,0.70618075,0.07385085,0.09002084,0.0019120759],"about_ca_topic_score_codex":0.000023368004,"about_ca_topic_score_gemma":0.000036758393,"teacher_disagreement_score":0.8596032,"about_ca_system_score_codex":0.000008685006,"about_ca_system_score_gemma":0.000031806358,"threshold_uncertainty_score":0.33744395},"labels":[],"label_agreement":null},{"id":"W2120658908","doi":"10.3217/jucs-014-03-0481","title":"Parallel Formulations of Scalar Multiplication on Koblitz Curves","year":2008,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scalar multiplication; Computer science; Speedup; Elliptic curve; Parallel computing; NIST; Scalar (mathematics); Software; Algorithm; Arithmetic; Mathematics; Programming language","score_opus":0.04186291314202028,"score_gpt":0.24578730725082854,"score_spread":0.20392439410880825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120658908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062766396,0.00056595384,0.83932084,0.0044746967,0.00014672756,0.0011506112,0.00009955929,0.0016776271,0.08979761],"genre_scores_gemma":[0.9894254,0.00045034089,0.009329083,0.00018534026,0.00003430793,7.7857386e-8,0.0002080957,0.00022530097,0.00014201038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987907,0.00015333453,0.00022183976,0.00029441368,0.00033855528,0.00020119485],"domain_scores_gemma":[0.99878824,0.000040740637,0.0001018938,0.00058782124,0.00038373948,0.000097580676],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029672353,0.00009009148,0.00010693773,0.0002615089,0.0013310065,0.00010803886,0.0010615143,0.000039011316,0.00042558677],"category_scores_gemma":[0.00023171467,0.000087320135,0.00006702187,0.0008500823,0.00014283818,0.00031962115,0.00046247378,0.00013208635,0.0008789602],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009184684,0.0014121328,0.00017657515,0.00033337862,0.0001244002,0.000024340618,0.0046483893,0.0014595968,0.009165508,0.6097905,0.17335683,0.19941649],"study_design_scores_gemma":[0.001731478,0.00090348866,0.06559673,0.00026912277,0.000021965348,0.0002928818,0.00008519641,0.016793296,0.004404535,0.006346598,0.9029989,0.00055580196],"about_ca_topic_score_codex":0.000008804814,"about_ca_topic_score_gemma":1.15771094e-7,"teacher_disagreement_score":0.92665905,"about_ca_system_score_codex":0.000027670205,"about_ca_system_score_gemma":0.0000036261504,"threshold_uncertainty_score":0.9999691},"labels":[],"label_agreement":null},{"id":"W2121585309","doi":"10.1109/ccece.1998.682718","title":"A low power algorithm for division in residue number system (RNS)","year":2002,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Division algorithm; Residue number system; Quotient; Division (mathematics); Divisor (algebraic geometry); Algorithm; Computer science; Greatest common divisor; Residue (chemistry); Zero divisor; Mathematics; Arithmetic; Discrete mathematics; Combinatorics","score_opus":0.009391948133790276,"score_gpt":0.2229887080888367,"score_spread":0.21359675995504643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121585309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008430934,0.00013938958,0.9770215,0.0004265917,0.00038431762,0.00035475282,0.0000030734982,0.00022090912,0.013018507],"genre_scores_gemma":[0.8263439,0.0000105551935,0.17263222,0.00014441292,0.00003102571,0.000043568387,7.4952726e-7,0.0000099199,0.0007836356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987762,0.0000477731,0.00023944944,0.00038314855,0.00022093483,0.00033247567],"domain_scores_gemma":[0.9992363,0.00013695781,0.000042511616,0.00044957802,0.00005218561,0.000082467726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025058395,0.00012828964,0.00016736577,0.00015684379,0.00009491239,0.000116617564,0.0005068403,0.00008325972,0.000087773704],"category_scores_gemma":[0.0000127378,0.000100831494,0.00011366637,0.000617697,0.00002675776,0.00027189052,0.0001272743,0.00009207201,0.00017182533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008730105,0.0009241401,0.006031135,0.00020539951,0.000057032703,0.00022030018,0.0026530311,0.000120292956,0.00023134751,0.29209307,0.021706726,0.67574877],"study_design_scores_gemma":[0.0022910405,0.00023535185,0.015143638,0.00031123616,0.000008099673,0.00009151451,0.00027321203,0.96832067,0.0034399563,0.003869058,0.005352224,0.000663991],"about_ca_topic_score_codex":0.000059171212,"about_ca_topic_score_gemma":0.000028138496,"teacher_disagreement_score":0.9682004,"about_ca_system_score_codex":0.00003032846,"about_ca_system_score_gemma":0.000008845543,"threshold_uncertainty_score":0.4111789},"labels":[],"label_agreement":null},{"id":"W2121765971","doi":"10.1109/mwscas.2001.986125","title":"Low power FIR filter FPGA implementation based on distributed arithmetic and residue number system","year":2002,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lookup table; Field-programmable gate array; Residue number system; Computer science; Finite impulse response; Power consumption; Computer hardware; Binary number; Partition (number theory); Parallel computing; Embedded system; Power (physics); Arithmetic; Algorithm; Mathematics; Operating system","score_opus":0.00940927418722875,"score_gpt":0.23035785119529772,"score_spread":0.22094857700806897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121765971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10310417,0.000098713586,0.87467635,0.0043685837,0.00055970217,0.00076358404,0.00007897351,0.00070946314,0.015640458],"genre_scores_gemma":[0.9904022,0.000004935705,0.008900882,0.00050144474,0.000023044466,0.000024781812,0.000013523354,0.000009328506,0.000119844786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859154,0.000099488054,0.00025106923,0.00043165358,0.00031366965,0.00031260637],"domain_scores_gemma":[0.9991029,0.00015019209,0.00006649941,0.0004962395,0.00005779643,0.0001263946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017762488,0.00017586484,0.00015915318,0.00012697668,0.0001817354,0.00023279099,0.00029622114,0.00006725135,0.0005691574],"category_scores_gemma":[0.000010998839,0.0001397168,0.00007683489,0.0005037224,0.000049009766,0.0002267657,0.00008050708,0.00011081454,0.00013838387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017844967,0.0033592163,0.11022713,0.0013524747,0.00053070136,0.0012104275,0.0044103423,0.0024642816,0.0018567292,0.37631148,0.25732026,0.24077852],"study_design_scores_gemma":[0.006809141,0.0010834378,0.35961267,0.0004376395,0.000086857806,0.00023985775,0.0009239608,0.58367074,0.035342745,0.0019942163,0.00794866,0.0018500678],"about_ca_topic_score_codex":0.000071336915,"about_ca_topic_score_gemma":0.00003177986,"teacher_disagreement_score":0.88729805,"about_ca_system_score_codex":0.00003687425,"about_ca_system_score_gemma":0.000011393276,"threshold_uncertainty_score":0.6231874},"labels":[],"label_agreement":null},{"id":"W2122177483","doi":"10.1016/j.tcs.2003.06.002","title":"The generalized Weil pairing and the discrete logarithm problem on elliptic curves","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Discrete logarithm; Mathematics; Elliptic curve; Pairing; Logarithm; TRACE (psycholinguistics); Reduction (mathematics); Generalization; Modulo; Pure mathematics; Edwards curve; Simple (philosophy); Discrete mathematics; Finite field; Schoof's algorithm; Mathematical analysis; Public-key cryptography; Computer science; Geometry; Quarter period; Physics","score_opus":0.0056954008353222035,"score_gpt":0.22177431581755602,"score_spread":0.2160789149822338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122177483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015028136,0.0011573127,0.947245,0.033742867,0.0004245602,0.00046942264,6.3859017e-7,0.00016744931,0.0017646423],"genre_scores_gemma":[0.93503916,0.00046337539,0.062097006,0.002265303,0.000092618226,0.000024361221,1.90231e-7,0.0000075029643,0.000010507152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974767,0.0002428229,0.00027614058,0.0006339016,0.00075257866,0.00061787275],"domain_scores_gemma":[0.99789125,0.0008089339,0.00007447018,0.0009415981,0.000094215444,0.00018951796],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0028727008,0.0002083664,0.00020524948,0.00009002465,0.0017312735,0.00091495266,0.0025746294,0.000036603036,0.000002814344],"category_scores_gemma":[0.00008773518,0.0000943956,0.00010569605,0.0010378483,0.009404722,0.00031848325,0.0010421376,0.00030804134,0.000019465037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018115012,0.0000217472,0.000010538485,0.000010207262,0.0000073495785,0.0000065776844,0.00036982182,0.00046195075,0.000028187567,0.98458445,0.000021361318,0.014459709],"study_design_scores_gemma":[0.0012218392,0.00021083638,0.0007616301,0.00018387173,0.000012263818,0.00007723292,0.000009438137,0.1348934,0.0009081415,0.86121696,0.0002745217,0.00022983823],"about_ca_topic_score_codex":0.000012876565,"about_ca_topic_score_gemma":0.00000282085,"teacher_disagreement_score":0.920011,"about_ca_system_score_codex":0.000028126473,"about_ca_system_score_gemma":0.00009268187,"threshold_uncertainty_score":0.99956834},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","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","score_opus":0.014019001938723376,"score_gpt":0.22053305333533613,"score_spread":0.20651405139661275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122183684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035129495,0.000117542564,0.9623333,0.00060353446,0.0011067983,0.00018134544,0.0000034769364,0.00028301982,0.00024144095],"genre_scores_gemma":[0.95072293,0.00015923992,0.048264235,0.0006054985,0.000044763747,0.00001407209,5.4227854e-7,0.00001381432,0.00017488831],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985848,0.00007109103,0.000238919,0.0004927798,0.00027704047,0.0003353525],"domain_scores_gemma":[0.99901384,0.00019675096,0.000052290758,0.00051861844,0.00004199295,0.00017648411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010773152,0.00022140623,0.0002168943,0.00034317208,0.00039771062,0.000109411296,0.00042818894,0.000104464285,0.000022264567],"category_scores_gemma":[0.0000013737485,0.00020748038,0.00016171832,0.0005724892,0.00016975842,0.00035196432,0.0000085552765,0.0003281901,0.0000410618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016941698,0.0029200953,0.0010849785,0.0001894083,0.0008256142,0.0007503737,0.013489343,0.20925483,0.0023377505,0.01186695,0.005050764,0.7520605],"study_design_scores_gemma":[0.0039766976,0.0018008745,0.017551485,0.00029059802,0.00011258738,0.0016562688,0.000087839355,0.9171302,0.050005738,0.0032756543,0.0022375071,0.0018745534],"about_ca_topic_score_codex":0.00007657188,"about_ca_topic_score_gemma":0.000011541746,"teacher_disagreement_score":0.91559345,"about_ca_system_score_codex":0.000030156116,"about_ca_system_score_gemma":0.00005131015,"threshold_uncertainty_score":0.8460805},"labels":[],"label_agreement":null},{"id":"W2122503665","doi":"10.1007/s10291-007-0063-y","title":"MILES: MATLAB package for solving Mixed Integer LEast Squares problems","year":2007,"lang":"en","type":"article","venue":"GPS Solutions","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Integer (computer science); Least-squares function approximation; MATLAB; Mathematical optimization; Mathematics; Integer programming; Ordinary least squares; Process (computing); Algorithm; Applied mathematics; Computer science; Statistics","score_opus":0.02838736224521222,"score_gpt":0.2520006352134833,"score_spread":0.2236132729682711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122503665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061614104,0.0007473272,0.98977363,0.000975684,0.0006164586,0.00036104632,0.0000158173,0.0002557484,0.0010928927],"genre_scores_gemma":[0.94956535,0.000020338846,0.04985099,0.00013024574,0.00012869625,0.000061289466,0.000010430226,0.000013313787,0.00021932171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985609,0.000023619414,0.00027058847,0.00034124043,0.00018130442,0.0006223406],"domain_scores_gemma":[0.99896896,0.00023209392,0.00007225215,0.00047742596,0.00012316518,0.00012609246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056346727,0.00014356078,0.00014041907,0.0002400816,0.00060737715,0.00015004457,0.0005605855,0.000087145105,0.000013062298],"category_scores_gemma":[0.00007216844,0.0001282432,0.00018613433,0.0005869617,0.00012373032,0.000293316,0.00017825389,0.00014713564,0.000050209575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022824923,0.0007136307,0.002471906,0.0002341593,0.00016155114,0.000028239678,0.0064073713,0.00089488225,0.019118287,0.8876054,0.037717026,0.04462469],"study_design_scores_gemma":[0.0073649185,0.001693257,0.15689787,0.0014600811,0.00033269133,0.0004988927,0.0074026217,0.17704405,0.030749734,0.3658432,0.24589409,0.004818565],"about_ca_topic_score_codex":0.00007144699,"about_ca_topic_score_gemma":0.00041599246,"teacher_disagreement_score":0.94340396,"about_ca_system_score_codex":0.000038838545,"about_ca_system_score_gemma":0.000055421388,"threshold_uncertainty_score":0.5229606},"labels":[],"label_agreement":null},{"id":"W2125116885","doi":"10.1109/newcas.2005.1496674","title":"Hardware Implementation of Large Number-Multiplication by FFT with Modular Arithmetic","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Operand; Modular arithmetic; Fast Fourier transform; Multiplication (music); Arithmetic; Computer science; Multiplication algorithm; Cryptosystem; Parallel computing; Scalability; Field-programmable gate array; Elliptic curve; Public-key cryptography; Modular design; Cryptography; Algorithm; Mathematics; Computer hardware; Encryption; Binary number","score_opus":0.005025800593118179,"score_gpt":0.2625555474473782,"score_spread":0.25752974685426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125116885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15409227,0.00008263429,0.8433905,0.0013294459,0.000024228342,0.0002178262,0.000012269135,0.00010033264,0.0007504566],"genre_scores_gemma":[0.86339635,0.000016555836,0.13626398,0.00017288998,0.000016967271,0.00002038257,0.000015228717,0.000005896428,0.000091785194],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999042,0.000031618998,0.0002037125,0.00026585476,0.00025355714,0.00020326069],"domain_scores_gemma":[0.99933696,0.000027005804,0.00009236472,0.00038750822,0.00009806933,0.000058121288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014536009,0.0001001969,0.000110959416,0.000070471804,0.00007930029,0.00004505925,0.00033509114,0.00003516511,0.000103671766],"category_scores_gemma":[0.0000029102869,0.00007789277,0.00004797626,0.00041806654,0.000028863215,0.00038236522,0.00006359201,0.000055973083,0.000029911214],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036115827,0.0015627434,0.15391172,0.00014878217,0.0002933409,0.000007041528,0.0046864897,0.00053112686,0.062415447,0.3788627,0.014848244,0.38269624],"study_design_scores_gemma":[0.0076736896,0.00064784085,0.23286581,0.000079649646,0.000107781045,0.00008215355,0.0015260631,0.16711718,0.50817,0.004606253,0.07581809,0.0013054486],"about_ca_topic_score_codex":0.00012076202,"about_ca_topic_score_gemma":0.00012149389,"teacher_disagreement_score":0.70930403,"about_ca_system_score_codex":0.000016187332,"about_ca_system_score_gemma":0.000026075844,"threshold_uncertainty_score":0.3176375},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012881535118885224,"score_gpt":0.267321806846309,"score_spread":0.2544402717274238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127583645","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063072745,0.00012548803,0.98374146,0.001645934,0.00039875336,0.0004045644,0.0000017983709,0.00021086069,0.012840396],"genre_scores_gemma":[0.11128563,0.000003453311,0.8846985,0.001548637,0.00012366989,0.000013594154,0.000003365072,0.00001684991,0.0023063098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984493,0.000075272714,0.00025643408,0.0004908656,0.00031653652,0.00041155587],"domain_scores_gemma":[0.9986281,0.00027956846,0.00007056584,0.00067109696,0.00005782518,0.00029288814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031089038,0.00023947495,0.0002584347,0.00020674222,0.00026869966,0.00015198863,0.0006314524,0.00009353266,0.00017119435],"category_scores_gemma":[0.00006801096,0.00016854338,0.00022156724,0.00071215205,0.000032078446,0.00016289316,0.00006947706,0.00015348702,0.000027709651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030467207,0.0005851504,0.0017680967,0.00001763097,0.000058908427,0.000011793382,0.00084076397,0.001260125,0.00012024997,0.5121789,0.042267397,0.4408605],"study_design_scores_gemma":[0.005260174,0.0013497757,0.0064731813,0.000055169094,0.000037949387,0.000021378492,0.000072423834,0.7484467,0.003399818,0.18242809,0.051586363,0.0008689829],"about_ca_topic_score_codex":0.00008913873,"about_ca_topic_score_gemma":0.00006746148,"teacher_disagreement_score":0.74718654,"about_ca_system_score_codex":0.000019515865,"about_ca_system_score_gemma":0.00026096872,"threshold_uncertainty_score":0.68729997},"labels":[],"label_agreement":null},{"id":"W2127977400","doi":"10.1109/tc.2006.152","title":"Relationship between GF(2^m) Montgomery and Shifted Polynomial Basis Multiplication Algorithms","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Trinomial; GF(2); Polynomial basis; Mathematics; Multiplier (economics); Multiplication algorithm; Multiplication (music); Matrix multiplication; Primitive polynomial; Arithmetic; Algorithm; Finite field; Basis (linear algebra); Discrete mathematics; Combinatorics; Binary number","score_opus":0.01905342482322375,"score_gpt":0.23340013779788626,"score_spread":0.2143467129746625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127977400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113354154,0.00005889687,0.88454944,0.0009521523,0.0004934742,0.00020730522,0.000014876953,0.0002830796,0.00008659762],"genre_scores_gemma":[0.9158638,0.0000063924176,0.083827764,0.00009447579,0.000117544936,0.000026182694,0.0000056919907,0.000013315328,0.00004480159],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99859554,0.00009619833,0.00030566595,0.00049495354,0.00023842136,0.000269227],"domain_scores_gemma":[0.9987165,0.0005996539,0.00008108385,0.00044261722,0.00004331752,0.00011686894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015352182,0.00019785535,0.00018286916,0.00044738653,0.0004296935,0.0001715569,0.00035355816,0.00012454379,0.0000026627306],"category_scores_gemma":[0.0000023309294,0.0002014758,0.00013240107,0.0007478119,0.00010293275,0.0003962863,0.000005243323,0.00026467358,0.000022256703],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006598299,0.00090179045,0.051504217,0.00007159902,0.00020306416,0.000030351839,0.001244868,0.043176167,0.000738601,0.0053849723,0.0023472726,0.8943311],"study_design_scores_gemma":[0.0018391248,0.00023676372,0.8049464,0.000058825597,0.00008875893,0.000033414857,0.000024046469,0.1823902,0.0065546827,0.0023531555,0.0007534862,0.0007211412],"about_ca_topic_score_codex":0.00029202996,"about_ca_topic_score_gemma":0.000040877465,"teacher_disagreement_score":0.89361,"about_ca_system_score_codex":0.000045115306,"about_ca_system_score_gemma":0.000028647242,"threshold_uncertainty_score":0.82159454},"labels":[],"label_agreement":null},{"id":"W2128504838","doi":"10.1109/tc.2003.1244936","title":"Fast normal basis multiplication using general purpose processors","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Normal basis; Computer science; Multiplication (music); Basis (linear algebra); Finite field; Software; Parallel computing; Multiplication algorithm; Cryptography; Flexibility (engineering); Binary number; Arithmetic; Algorithm; Computer hardware; Galois theory; Mathematics; Discrete mathematics","score_opus":0.01719488378731872,"score_gpt":0.23907187753019768,"score_spread":0.22187699374287895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128504838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07881231,0.000025599233,0.9194635,0.00012590815,0.0009957638,0.00021617988,0.0000035473147,0.00020221941,0.00015496569],"genre_scores_gemma":[0.77106774,0.000013349696,0.22859095,0.0002264755,0.000028985973,0.000021877502,5.8730825e-7,0.000012427599,0.00003760687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863064,0.00009919355,0.00023598204,0.00045143804,0.00025897473,0.00032374676],"domain_scores_gemma":[0.99918526,0.00006866155,0.00007066441,0.0004594897,0.000078969046,0.00013695596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013734054,0.0001936649,0.00015000452,0.00033293996,0.0003899015,0.00015258358,0.00045282155,0.000080111895,0.0000116783995],"category_scores_gemma":[0.0000018249619,0.0001911244,0.00016266765,0.0009001385,0.00006488684,0.00045977614,0.0000026366922,0.00020129296,0.0000246763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019930707,0.00065610977,0.00014741755,0.00003750972,0.0001018725,0.000018315219,0.0014692721,0.7516319,0.006329118,0.0033035283,0.00009566364,0.23618937],"study_design_scores_gemma":[0.0009367748,0.00015247265,0.00046308382,0.000050931572,0.000036176625,0.000121841134,0.000044415974,0.8845976,0.11200637,0.00029135888,0.00079831947,0.00050063175],"about_ca_topic_score_codex":0.00003755079,"about_ca_topic_score_gemma":0.000012392057,"teacher_disagreement_score":0.69225544,"about_ca_system_score_codex":0.000053009648,"about_ca_system_score_gemma":0.0000683225,"threshold_uncertainty_score":0.77938265},"labels":[],"label_agreement":null},{"id":"W2128802035","doi":"10.1090/fic/060/05","title":"Pairings on hyperelliptic curves","year":2011,"lang":"en","type":"preprint","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Calgary; University of Waterloo","funders":"","keywords":"Hyperelliptic curve; Hyperelliptic curve cryptography; Mathematics; Computer science; Pure mathematics; Algebra over a field; Operating system; Elliptic curve cryptography","score_opus":0.03619271811729972,"score_gpt":0.23264440641067707,"score_spread":0.19645168829337736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128802035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024465337,0.010438409,0.575388,0.006447301,0.0049552834,0.0011709197,0.000006026744,0.0024114898,0.37471724],"genre_scores_gemma":[0.86990744,0.005344024,0.11175714,0.008057033,0.00026592697,0.00012214946,0.00000985072,0.000051415835,0.0044850516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986282,0.00004833587,0.00019814177,0.00062348344,0.0002542768,0.0002475689],"domain_scores_gemma":[0.99843836,0.00007647323,0.000085167,0.0012441616,0.00005688953,0.00009893485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018001634,0.00023092548,0.00023302763,0.00018693878,0.00005748645,0.000103641345,0.0015810631,0.00016259689,0.00010705862],"category_scores_gemma":[0.000022435475,0.00017691239,0.00022735939,0.00017495238,0.000053480537,0.000084936306,0.0012295545,0.0004946497,0.00030719372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001087792,0.00073274283,0.0008835893,0.001670916,0.00023934853,0.00012449163,0.0011083782,0.00022145579,0.000078994824,0.86002624,0.05515769,0.07974529],"study_design_scores_gemma":[0.0010191938,0.0009484424,0.039627846,0.00835785,0.00018893667,0.00008856236,0.000030064628,0.020770375,0.012991112,0.8772234,0.034707095,0.0040471675],"about_ca_topic_score_codex":0.00014629807,"about_ca_topic_score_gemma":0.000008382955,"teacher_disagreement_score":0.84544206,"about_ca_system_score_codex":0.000011640199,"about_ca_system_score_gemma":0.000063258,"threshold_uncertainty_score":0.7214278},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017780788056884152,"score_gpt":0.23933967493675026,"score_spread":0.2215588868798661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129089669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30110168,0.0001611436,0.6969822,0.00016365078,0.00047095594,0.000039348488,1.3485963e-7,0.000020507443,0.0010603487],"genre_scores_gemma":[0.94809335,0.000016104379,0.051576044,0.00016422058,0.00013765934,4.3659568e-7,1.8585185e-7,0.0000044188705,0.0000076010374],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9990719,0.000047754453,0.00036521716,0.000104523875,0.00027012135,0.00014049093],"domain_scores_gemma":[0.9992057,0.000064201704,0.00034985805,0.000120453005,0.00019005872,0.00006973411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003809896,0.00008045394,0.00014996443,0.00023502666,0.00007188778,0.000070329406,0.00033041008,0.000049668786,0.00002027826],"category_scores_gemma":[0.000025025398,0.00006683704,0.00012209556,0.00030420843,0.000023977156,0.00046751017,0.000062611834,0.00017213845,0.000007989123],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012850255,0.0011151949,0.021426419,0.00013047969,0.00053033046,0.0006531927,0.056234434,0.0064103687,0.003245598,0.08983021,0.004521675,0.8157736],"study_design_scores_gemma":[0.00228369,0.0009841616,0.70069176,0.00026503115,0.00009307531,0.0015268503,0.00032210338,0.1728571,0.005959429,0.112768106,0.0016502877,0.0005984002],"about_ca_topic_score_codex":0.000029939754,"about_ca_topic_score_gemma":0.0000024671308,"teacher_disagreement_score":0.8151752,"about_ca_system_score_codex":0.000020696407,"about_ca_system_score_gemma":0.00006304046,"threshold_uncertainty_score":0.27255353},"labels":[],"label_agreement":null},{"id":"W2132296708","doi":"10.1007/3-540-46885-4_36","title":"Cryptanalysis of Short RSA Secret Exponents","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Exponent; Cryptanalysis; Mathematics; Fraction (chemistry); Discrete mathematics; Cryptography; Combinatorics; Algorithm","score_opus":0.021641674141118165,"score_gpt":0.25785824164665744,"score_spread":0.23621656750553927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132296708","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005551556,0.00084271363,0.99207956,0.00015796014,0.0009809879,0.00024204749,0.000005201267,0.000095375806,0.0050409813],"genre_scores_gemma":[0.38007692,0.00013901954,0.61873245,0.00057823356,0.00029742735,0.00000431735,0.0000065876425,0.000035182125,0.0001298885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99551946,0.000034151795,0.0007787237,0.0014264636,0.0015489304,0.00069226697],"domain_scores_gemma":[0.9969544,0.00043238592,0.00028544123,0.0017851308,0.0003235323,0.00021913517],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012530237,0.0005123554,0.00073988317,0.0022513894,0.00018319678,0.00018915451,0.0035548168,0.0003874655,0.000038610757],"category_scores_gemma":[0.000054737375,0.000450585,0.0003787144,0.0017282822,0.0010142649,0.00040649454,0.0012340811,0.0007159357,0.000015485504],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010951483,0.00008344867,0.0008602381,0.000076869204,0.000088708475,0.0002263554,0.00088149094,0.0100556025,0.0006792887,0.042323194,0.000016127107,0.94469774],"study_design_scores_gemma":[0.0008671699,0.000765409,0.0059493417,0.0015651323,0.00016938035,0.00024736894,0.000001298699,0.5507469,0.022249024,0.41039968,0.0039421655,0.0030971186],"about_ca_topic_score_codex":0.000041556956,"about_ca_topic_score_gemma":0.000113389804,"teacher_disagreement_score":0.9416006,"about_ca_system_score_codex":0.00012903991,"about_ca_system_score_gemma":0.00030295743,"threshold_uncertainty_score":0.9997946},"labels":[],"label_agreement":null},{"id":"W2133956949","doi":"10.1007/978-3-642-00468-1_25","title":"Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scalar multiplication; Scalar (mathematics); Computer science; Window (computing); Elliptic curve; Elliptic curve point multiplication; Point (geometry); Multiplication (music); Algorithm; Parallel computing; Applied mathematics; Mathematics; Geometry; Mathematical analysis","score_opus":0.01859475332476348,"score_gpt":0.2981308735236749,"score_spread":0.27953612019891144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133956949","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017769487,0.0006389498,0.99686176,0.00082140043,0.0004261158,0.0007649756,0.000015188307,0.0001204459,0.00033337838],"genre_scores_gemma":[0.004257345,0.000052795065,0.99378633,0.0015099063,0.00018247879,0.00002398271,0.0000058246956,0.000025468631,0.00015586671],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736375,0.000065047934,0.00041314482,0.0013118982,0.00036958794,0.00047656838],"domain_scores_gemma":[0.9976584,0.00077598647,0.00021728918,0.00095253735,0.00022539431,0.0001704015],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009120641,0.00041206658,0.0003936418,0.00075981696,0.0003810636,0.00045441723,0.0013834916,0.00028022128,0.0000051381708],"category_scores_gemma":[0.00010486177,0.00036680678,0.0001458444,0.00057539344,0.0005595584,0.0003956934,0.00038415304,0.00038868812,0.0000041927447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056830004,0.000044019092,0.000035344274,0.00003307393,0.000012984037,0.0000043789123,0.0006313007,0.121652626,0.00017915582,0.018702738,0.000014060779,0.85868466],"study_design_scores_gemma":[0.0003690076,0.00012440493,0.00022054647,0.0001400256,0.000015384956,0.0000336425,1.4819821e-7,0.9190271,0.00078999356,0.07648969,0.0023365559,0.00045350508],"about_ca_topic_score_codex":0.000021315269,"about_ca_topic_score_gemma":0.000032483815,"teacher_disagreement_score":0.8582311,"about_ca_system_score_codex":0.000078380916,"about_ca_system_score_gemma":0.00016245115,"threshold_uncertainty_score":0.9998784},"labels":[],"label_agreement":null},{"id":"W2134203259","doi":"10.1109/depend.2009.10","title":"An Algorithm Based Fault Tolerant Scheme for Elliptic Curve Public-Key Cryptography","year":2009,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Cryptography; Public-key cryptography; Computer science; Elliptic curve cryptography; Key (lock); Fault tolerance; Scheme (mathematics); Algorithm; Cipher; Process (computing); Elliptic curve; Error detection and correction; Computation; Theoretical computer science; Computer engineering; Arithmetic; Mathematics; Encryption; Distributed computing; Computer network; Computer security; Operating system","score_opus":0.016272393868502624,"score_gpt":0.26076503910802146,"score_spread":0.24449264523951883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134203259","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050378973,0.0002282795,0.9884948,0.0036983844,0.0002749905,0.00047323163,0.000009674301,0.0005638358,0.0012188825],"genre_scores_gemma":[0.24232636,0.000010537121,0.7552134,0.0022518502,0.00011108558,0.000038148937,0.00001771675,0.000012020109,0.000018877756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977263,0.0000810904,0.00035874444,0.00072632194,0.0004135963,0.00069392356],"domain_scores_gemma":[0.9981289,0.00013046616,0.000092428425,0.001011981,0.00027446158,0.00036174894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046027405,0.00028661374,0.00027747452,0.0005435747,0.00032052692,0.0006110227,0.0013227963,0.00013867498,0.000046117202],"category_scores_gemma":[0.000023998087,0.00023500175,0.00035759938,0.0014222605,0.000083982486,0.0009402522,0.000041788688,0.00017093595,0.000019961231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021033607,0.0013547642,0.00079279277,0.000027136019,0.00006331175,0.0000213233,0.00035476708,0.00022095989,0.0029768916,0.5411768,0.002718075,0.45027214],"study_design_scores_gemma":[0.0014514995,0.0010305113,0.0043893675,0.000020288917,0.000015206139,0.000011716681,0.000052613883,0.9414749,0.004238615,0.02594887,0.020745024,0.00062138936],"about_ca_topic_score_codex":0.000024221823,"about_ca_topic_score_gemma":0.000012580675,"teacher_disagreement_score":0.94125396,"about_ca_system_score_codex":0.000015362035,"about_ca_system_score_gemma":0.00009764099,"threshold_uncertainty_score":0.95830935},"labels":[],"label_agreement":null},{"id":"W2134219141","doi":"10.1109/iscas.2012.6272196","title":"High performance prime field multiplication for GPU","year":2012,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Graphics processing unit; Multiplication (music); NIST; Modular arithmetic; Parallel computing; Modular design; Prime (order theory); Finite field; Field (mathematics); Multiplication algorithm; Graphics; General-purpose computing on graphics processing units; Computational science; Arithmetic; Computer graphics (images); Programming language; Mathematics","score_opus":0.012355822368527654,"score_gpt":0.23680765596009914,"score_spread":0.2244518335915715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134219141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14099501,0.00007818595,0.8564723,0.00095137703,0.00027631962,0.00016046189,2.8715797e-7,0.000102933984,0.00096313504],"genre_scores_gemma":[0.83450973,0.000010783694,0.16485086,0.0003082654,0.000084035164,0.00003288443,9.29439e-7,0.0000022142208,0.00020028403],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99955064,0.0000068144022,0.000080559694,0.00011035303,0.0000681169,0.00018348813],"domain_scores_gemma":[0.9995329,0.000097896635,0.000024873114,0.0002656357,0.000029510027,0.000049181253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012420655,0.00005022456,0.000049417242,0.00004387711,0.00008641425,0.00002764987,0.00025773316,0.000034714743,0.000012606338],"category_scores_gemma":[0.000013428728,0.000038628565,0.00003504293,0.00013874192,0.000009579195,0.0003791397,0.00005054896,0.000034803215,0.000033237877],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001293174,0.00020896348,0.026652692,0.000039566054,0.000020472902,1.05794356e-7,0.0006752645,0.0000299783,0.005060766,0.42007548,0.0033856728,0.54383814],"study_design_scores_gemma":[0.0009454061,0.00033790848,0.30846775,0.00001982364,0.000014433841,0.000012651763,0.000024632247,0.0688043,0.582299,0.003939411,0.034677222,0.00045746524],"about_ca_topic_score_codex":0.00001540839,"about_ca_topic_score_gemma":0.0000010915616,"teacher_disagreement_score":0.69351476,"about_ca_system_score_codex":0.00000477856,"about_ca_system_score_gemma":0.0000070637943,"threshold_uncertainty_score":0.15752272},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012431951624506965,"score_gpt":0.2534901271177673,"score_spread":0.24105817549326033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135205181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017030095,0.00062767614,0.995652,0.0005734826,0.000423187,0.00042156305,0.000010105275,0.00015427604,0.00043470983],"genre_scores_gemma":[0.68479025,0.0008652827,0.3118315,0.0021076777,0.00005366497,0.00012014424,0.00018666986,0.000015186097,0.000029581382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882853,0.00006719334,0.00044454026,0.00018236475,0.00023803177,0.0002393332],"domain_scores_gemma":[0.99922925,0.0001449656,0.0001857742,0.0001681739,0.00017563534,0.000096201096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044580386,0.00015554848,0.00016251697,0.00022319974,0.00027595807,0.00028585613,0.00018064698,0.00006692736,0.0000045155084],"category_scores_gemma":[0.00005468096,0.0001394497,0.00008046361,0.00039135595,0.00005635751,0.0017415237,0.000035537112,0.00009263041,0.000022991982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050280723,0.00003987625,0.000044083445,0.000200665,0.00002761104,9.00162e-7,0.00085967925,0.0011969288,0.000008870349,0.7240327,0.0015254949,0.2720582],"study_design_scores_gemma":[0.0005606254,0.00015592908,0.0005655373,0.00006024872,0.000013369014,0.00003128211,0.00016262797,0.94771594,0.000102960206,0.038995575,0.011424915,0.00021098774],"about_ca_topic_score_codex":0.0000103110815,"about_ca_topic_score_gemma":0.0000010663651,"teacher_disagreement_score":0.946519,"about_ca_system_score_codex":0.000015969295,"about_ca_system_score_gemma":0.00005379566,"threshold_uncertainty_score":0.5686593},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010266754387072013,"score_gpt":0.2228050695944466,"score_spread":0.2125383152073746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136119832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49130625,0.0001862193,0.50437105,0.0011008444,0.00026588966,0.00017464752,0.0000015684031,0.00043432473,0.002159185],"genre_scores_gemma":[0.92121017,0.00006455487,0.07776042,0.0008173149,0.00005322646,0.000025859012,0.000003376699,0.000012707291,0.000052391235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982728,0.00003416461,0.00027499063,0.0005066844,0.00042747785,0.00048390252],"domain_scores_gemma":[0.99889004,0.000069025715,0.00008124506,0.00069043733,0.000103871185,0.00016535209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025463148,0.00022943682,0.00020717908,0.00039148334,0.00028602043,0.00019299255,0.0010325172,0.00009661665,0.000077050216],"category_scores_gemma":[0.000013821072,0.00018381164,0.00014077665,0.0015194095,0.0001592726,0.00054346025,0.0000727735,0.00021172651,0.00021815697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008744169,0.0017848836,0.021479733,0.00059645536,0.0001990408,0.00015980104,0.0012710423,0.046673805,0.0057211933,0.86267453,0.0009243977,0.058427688],"study_design_scores_gemma":[0.011995749,0.002536163,0.35482547,0.00055246596,0.00011602012,0.00017006202,0.00013222618,0.09049007,0.41792506,0.108465664,0.008956003,0.0038350376],"about_ca_topic_score_codex":0.00007815338,"about_ca_topic_score_gemma":0.000013440777,"teacher_disagreement_score":0.75420886,"about_ca_system_score_codex":0.000023396411,"about_ca_system_score_gemma":0.00013525394,"threshold_uncertainty_score":0.74956214},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.009825076464437171,"score_gpt":0.22416966409986805,"score_spread":0.21434458763543088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136484227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17128803,0.00010147446,0.8270371,0.00068372523,0.0005121563,0.0001673141,0.0000020783323,0.00016380167,0.00004434826],"genre_scores_gemma":[0.94239736,0.00014163338,0.056947324,0.00042887186,0.000052444728,0.000009759497,6.3498754e-7,0.000007162519,0.000014807293],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989145,0.00004245723,0.00019374934,0.00045274728,0.00016735744,0.0002291912],"domain_scores_gemma":[0.9993458,0.000106344894,0.000050599025,0.00033837726,0.000025981399,0.0001329361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009690155,0.00017404901,0.00016102944,0.00028987176,0.00027724935,0.00020011164,0.0002379209,0.00008160526,0.0000023919215],"category_scores_gemma":[0.0000010214247,0.00016804386,0.000076438606,0.0003625466,0.00007034235,0.0004059741,0.000004601361,0.00017658895,0.000004933606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010343908,0.000458136,0.000223312,0.000029598687,0.00009188295,0.000020036186,0.0017931118,0.04473786,0.0075018425,0.004065007,0.0002728239,0.940703],"study_design_scores_gemma":[0.00392195,0.0009306147,0.07525023,0.00014730793,0.000063998945,0.00013035737,0.000048909773,0.9072695,0.0068533733,0.0034945891,0.00093833724,0.0009508816],"about_ca_topic_score_codex":0.00005973,"about_ca_topic_score_gemma":0.000019154708,"teacher_disagreement_score":0.93975204,"about_ca_system_score_codex":0.000018534716,"about_ca_system_score_gemma":0.000015165755,"threshold_uncertainty_score":0.685263},"labels":[],"label_agreement":null},{"id":"W2137324680","doi":"10.1109/newcas.2005.1496665","title":"Multipath Greedy Algorithm-for Canonical Representation of Numbers-in the Double Base Number System","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Greedy algorithm; Algorithm; Computer science; Redundancy (engineering); Canonical form; Representation (politics); Base (topology); Theoretical computer science; Mathematics","score_opus":0.024262782400242017,"score_gpt":0.291241795515566,"score_spread":0.266979013115324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137324680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055818383,0.000060416187,0.92944765,0.0014497193,0.00026326426,0.0007950792,0.0000064410306,0.000107200314,0.012051867],"genre_scores_gemma":[0.7875773,0.0000035915368,0.21205044,0.000101059886,0.00007435412,0.000056554876,0.0000023597493,0.0000044214185,0.00012994875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887216,0.00008399724,0.00029593028,0.00027604867,0.00026241256,0.00020945257],"domain_scores_gemma":[0.99906135,0.00025102048,0.000076190474,0.0004962117,0.00007164105,0.000043573196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004733014,0.00009201197,0.00015087142,0.00006581881,0.00007202529,0.000057057714,0.0005787479,0.000053964515,0.000014780726],"category_scores_gemma":[0.000009763478,0.000059798458,0.00012566024,0.0005622191,0.000047763308,0.000250524,0.00006284896,0.00008261554,0.000018763301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009116919,0.0011051238,0.022953628,0.00018084518,0.00009792145,0.00006187929,0.008041606,0.002082779,0.00069486035,0.6549446,0.0053190337,0.30442652],"study_design_scores_gemma":[0.0048592114,0.00010297774,0.016213117,0.000076753364,0.0000322306,0.00015734864,0.0020748759,0.96347374,0.009639103,0.0007416911,0.002279639,0.00034928462],"about_ca_topic_score_codex":0.0015567762,"about_ca_topic_score_gemma":0.00058977184,"teacher_disagreement_score":0.961391,"about_ca_system_score_codex":0.000027159238,"about_ca_system_score_gemma":0.000046522146,"threshold_uncertainty_score":0.24385104},"labels":[],"label_agreement":null},{"id":"W2137465039","doi":"10.1016/j.ffa.2007.03.002","title":"Polynomial approximation of bilinear Diffie–Hellman maps","year":2007,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Bilinear interpolation; Diagonal; Degree (music); Polynomial; Bilinear map; Interpolation (computer graphics); Discrete mathematics; Set (abstract data type); Matrix polynomial; Combinatorics; Image (mathematics); Mathematical analysis; Geometry; Computer science","score_opus":0.008432818511571577,"score_gpt":0.21843358827766687,"score_spread":0.2100007697660953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137465039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016993314,0.00022240092,0.9793292,0.00040515736,0.00003853367,0.00019390511,0.000011267011,0.000045809677,0.0027603589],"genre_scores_gemma":[0.98374075,0.000047190595,0.01597481,0.000094176976,0.000060699756,0.000019706362,0.000011063503,0.0000035608307,0.000048028764],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99945885,0.000010826046,0.00018095277,0.00016917886,0.000059720554,0.000120498844],"domain_scores_gemma":[0.99931604,0.00020722846,0.000065883076,0.00032238674,0.000037481357,0.00005101023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017962657,0.0000722176,0.00009072372,0.00011189906,0.0001062657,0.00002622618,0.00023413506,0.00007361503,0.0000052164614],"category_scores_gemma":[0.0000072805583,0.000056215125,0.000049604314,0.00033587014,0.000058093254,0.00007365008,0.00007376375,0.00008782122,0.0000046991377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021631624,0.00042990793,0.0015290035,0.00010789139,0.00005939422,0.0000012691756,0.004685854,0.00006979475,0.005899766,0.35495448,0.00087445223,0.63136655],"study_design_scores_gemma":[0.003689472,0.0010356155,0.06288254,0.00015693929,0.00009051855,0.000078082114,0.0022999363,0.1167426,0.16137257,0.28727114,0.36241302,0.001967566],"about_ca_topic_score_codex":0.000017988163,"about_ca_topic_score_gemma":0.000012263647,"teacher_disagreement_score":0.96674746,"about_ca_system_score_codex":0.0000025566737,"about_ca_system_score_gemma":0.000011592527,"threshold_uncertainty_score":0.22923863},"labels":[],"label_agreement":null},{"id":"W2139596645","doi":"10.1109/tc.2007.13","title":"Low-Weight Polynomial Form Integers for Efficient Modular Multiplication","year":2007,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Modular arithmetic; Mathematics; Moduli; Elliptic curve; Mersenne prime; Integer (computer science); Polynomial; Prime (order theory); Discrete mathematics; Finite field; Multiplication (music); Arithmetic; Cryptosystem; Cryptography; Combinatorics; Pure mathematics; Computer science; Algorithm","score_opus":0.007493870952711963,"score_gpt":0.23573728953738748,"score_spread":0.22824341858467553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139596645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112636425,0.000038773444,0.8846637,0.00043552095,0.00034947137,0.00032701975,0.0000010653774,0.00013621553,0.0014118253],"genre_scores_gemma":[0.89001495,0.0000026330686,0.109572664,0.00020061807,0.00008646294,0.000019079378,0.0000026448104,0.000005875001,0.00009506111],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990308,0.0000071456316,0.00020173163,0.00029987772,0.00015293647,0.0003074565],"domain_scores_gemma":[0.9992667,0.00012684995,0.000050053604,0.0003841527,0.000075596785,0.00009668942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004039096,0.000099561934,0.0000919317,0.00017737264,0.00013797516,0.000058944337,0.00045923312,0.00006290799,0.000005679298],"category_scores_gemma":[0.000022632314,0.000078145975,0.00013000405,0.00034835306,0.000041926793,0.00011820722,0.00007876082,0.000061563216,0.000017243214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013263302,0.00093965756,0.0008925603,0.0000770127,0.00008044361,0.000009493574,0.002623478,0.0021752655,0.05817577,0.36517724,0.0037288554,0.5659876],"study_design_scores_gemma":[0.0016770748,0.00021771422,0.014190771,0.00002430588,0.000013787797,0.000013933844,0.00011047005,0.62672955,0.33994138,0.003496014,0.013126142,0.00045885405],"about_ca_topic_score_codex":0.000023353039,"about_ca_topic_score_gemma":0.000019577521,"teacher_disagreement_score":0.77737856,"about_ca_system_score_codex":0.000033482982,"about_ca_system_score_gemma":0.000021259988,"threshold_uncertainty_score":0.31867003},"labels":[],"label_agreement":null},{"id":"W2140357064","doi":"10.1109/fdtc.2009.35","title":"Securing the Elliptic Curve Montgomery Ladder against Fault Attacks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada)","funders":"","keywords":"Scalar multiplication; Side channel attack; Countermeasure; Elliptic curve cryptography; Computer science; Elliptic curve; Curve25519; Elliptic curve point multiplication; Point (geometry); Computer security; Embedded system; Algorithm; Cryptography; Public-key cryptography; Mathematics; Engineering; Encryption; Pure mathematics","score_opus":0.008944035630343378,"score_gpt":0.22749316971128541,"score_spread":0.21854913408094204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140357064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38977024,0.0029096827,0.46803555,0.016033813,0.00095083547,0.0005557317,0.0000017728522,0.0009291873,0.120813176],"genre_scores_gemma":[0.9909473,0.0000911033,0.005574362,0.0028106729,0.000092226706,0.0000047182666,7.610543e-7,0.0000049811083,0.00047388827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988746,0.000056611825,0.00017757744,0.00030093276,0.00025639392,0.0003338687],"domain_scores_gemma":[0.99909455,0.00010003185,0.000044376015,0.0006367773,0.000043943804,0.000080331796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021911661,0.00013886057,0.000115101226,0.00009332283,0.00024340018,0.00021956998,0.0008869929,0.00005378358,0.000019762105],"category_scores_gemma":[0.000013750858,0.00008248095,0.00012874637,0.0005648677,0.000053681844,0.00029439825,0.00011150502,0.0001943727,0.00009931621],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000116303645,0.00043431294,0.0025651148,0.00002351879,0.00013055163,0.00015062685,0.0055503966,0.0042313216,0.0024615622,0.38992712,0.015435588,0.57907826],"study_design_scores_gemma":[0.0030907306,0.0011232541,0.26501974,0.00024231581,0.00009997811,0.00022521157,0.0015681606,0.44794106,0.019892098,0.118818484,0.13873692,0.0032420557],"about_ca_topic_score_codex":0.000014271183,"about_ca_topic_score_gemma":0.000013907137,"teacher_disagreement_score":0.60117704,"about_ca_system_score_codex":0.000009829899,"about_ca_system_score_gemma":0.000021275486,"threshold_uncertainty_score":0.33634755},"labels":[],"label_agreement":null},{"id":"W2141371985","doi":"10.1109/mwscas.2005.1594422","title":"Efficient residue comparison algorithm for general moduli sets","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Residue (chemistry); Modulo; Comparator; Moduli; Residue number system; Binary number; Algorithm; Mathematics; Modulus; Computer science; Discrete mathematics; Arithmetic; Voltage; Physics; Chemistry; Engineering; Geometry; Electrical engineering; Organic chemistry","score_opus":0.015896518960432992,"score_gpt":0.2770102843604318,"score_spread":0.2611137653999988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141371985","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02826551,0.00031280937,0.9670262,0.0018319528,0.0002949592,0.00028669194,0.0000052018336,0.00023247444,0.0017442029],"genre_scores_gemma":[0.18274486,0.0000037417933,0.8161436,0.00044638314,0.00017104545,0.00003089321,0.0000034683671,0.00000831013,0.00044772323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867266,0.000033747277,0.00025697172,0.00040856475,0.0002446081,0.00038345173],"domain_scores_gemma":[0.9992,0.00008182882,0.00005511898,0.00046132828,0.00007617344,0.00012554594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022767605,0.000145652,0.00018090142,0.00014469978,0.00019939177,0.00015586623,0.00060733844,0.0000673582,0.000020724847],"category_scores_gemma":[0.000008109321,0.00011825102,0.0001429705,0.00034454098,0.000046167035,0.000087905224,0.00013876459,0.000092016926,0.00005211272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004368269,0.00032783646,0.00017306568,0.000008641014,0.000029580047,0.0000032124915,0.0004523133,0.026770968,0.0002856604,0.08854363,0.011182089,0.8722186],"study_design_scores_gemma":[0.0004904828,0.0000842111,0.0018523679,0.0000051087704,0.000006280623,0.00000916258,0.000014547164,0.976167,0.00537242,0.001307389,0.0145004485,0.0001905619],"about_ca_topic_score_codex":0.0000421516,"about_ca_topic_score_gemma":0.000029999745,"teacher_disagreement_score":0.9493961,"about_ca_system_score_codex":0.000024884908,"about_ca_system_score_gemma":0.00003339518,"threshold_uncertainty_score":0.48221365},"labels":[],"label_agreement":null},{"id":"W2142005615","doi":"10.1109/arith.2007.23","title":"Montgomery Reduction Algorithm for Modular Multiplication Using Low-Weight Polynomial Form Integers","year":2007,"lang":"en","type":"article","venue":"Proceedings/Proceedings - Symposium on Computer Arithmetic","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reduction (mathematics); Modular arithmetic; Algorithm; Polynomial; Mathematics; Multiplication (music); Modular design; Arithmetic; Computer science; Combinatorics; Cryptography","score_opus":0.011483169382318864,"score_gpt":0.24100293752232482,"score_spread":0.22951976814000596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142005615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20785032,0.0001111201,0.785606,0.0008116772,0.0022698678,0.0016817196,0.000009516839,0.0008338128,0.0008259172],"genre_scores_gemma":[0.5077279,0.00004455374,0.48933533,0.00036245497,0.002189267,0.00015437306,0.000012181964,0.0001089489,0.00006497583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941452,0.00001034151,0.0012435275,0.0020331226,0.0010071881,0.0015605848],"domain_scores_gemma":[0.99687606,0.00015455471,0.00070438866,0.00041025336,0.001293708,0.0005610485],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016562894,0.00088645204,0.0007621642,0.0017625575,0.0009461779,0.0010713444,0.0017191247,0.00047989836,0.0000035916207],"category_scores_gemma":[0.000045868303,0.00087603263,0.0005676617,0.0021891207,0.00025677844,0.0021971788,0.00047714353,0.0006860062,0.000021353611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057990954,0.0025732208,0.0016406025,0.0011507316,0.0006636817,0.000026984962,0.01075493,0.00067808095,0.3755118,0.048848875,0.005531092,0.5520401],"study_design_scores_gemma":[0.0025399174,0.00095708255,0.001466446,0.0003913604,0.0001395142,0.000454766,0.0003011922,0.8882418,0.09882645,0.003169422,0.0021073835,0.0014046646],"about_ca_topic_score_codex":0.000042138432,"about_ca_topic_score_gemma":8.296101e-7,"teacher_disagreement_score":0.8875637,"about_ca_system_score_codex":0.0005224181,"about_ca_system_score_gemma":0.00009604224,"threshold_uncertainty_score":0.99996567},"labels":[],"label_agreement":null},{"id":"W2142883049","doi":"10.1017/s0004972700035048","title":"Finding the group structure of elliptic curves over finite fields","year":2005,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts; National Science Foundation","keywords":"Mathematics; Schoof's algorithm; Finite field; Elliptic curve; Division polynomials; Divisor (algebraic geometry); Prime (order theory); Supersingular elliptic curve; Group (periodic table); Hessian form of an elliptic curve; Field (mathematics); Polynomial; Twists of curves; Pure mathematics; Discrete mathematics; Combinatorics; Mathematical analysis; Quarter period","score_opus":0.015199644639077914,"score_gpt":0.24342403137920948,"score_spread":0.22822438674013157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142883049","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5974538,0.0014109571,0.16667967,0.22867554,0.00068628875,0.0018652509,0.00006494749,0.00020832266,0.0029552265],"genre_scores_gemma":[0.95812887,0.000048105798,0.039829932,0.0010304116,0.000060420858,0.0000034940654,5.278513e-7,0.000007394986,0.00089083996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987537,0.00008305353,0.00035792103,0.00017971074,0.0003888603,0.00023675499],"domain_scores_gemma":[0.99848753,0.00054380816,0.00019762754,0.0006898673,0.000035123343,0.000046021323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033442865,0.0001379899,0.00022021908,0.000012757419,0.0001366992,0.00003464415,0.0012979064,0.00011284359,0.0007364372],"category_scores_gemma":[0.00010331862,0.00007146788,0.00047732348,0.00027554715,0.000308932,0.000036780657,0.0002873762,0.00028542115,0.000015099413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012419905,0.0007016222,0.0020901475,0.0031697454,0.0005465056,0.0000017522589,0.008935322,0.0018990659,0.0060929796,0.55875486,0.41384366,0.0039519127],"study_design_scores_gemma":[0.0034855597,0.0005974824,0.09059216,0.0068992064,0.0008823927,0.00015240682,0.0016556858,0.035280187,0.105053045,0.5400319,0.21306628,0.0023036653],"about_ca_topic_score_codex":0.000013546809,"about_ca_topic_score_gemma":0.00000157574,"teacher_disagreement_score":0.36067507,"about_ca_system_score_codex":0.000010771753,"about_ca_system_score_gemma":0.000013085354,"threshold_uncertainty_score":0.8063471},"labels":[],"label_agreement":null},{"id":"W2143141569","doi":"10.1109/icecs.2006.379835","title":"A Parallel-In Serial-Out Multiplier Using Redundant Representation for A Class of Finite Fields","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Multiplier (economics); Field-programmable gate array; Finite field; Computer science; Representation (politics); Parallel computing; Realization (probability); Arithmetic; Computer hardware; Mathematics; Discrete mathematics","score_opus":0.030954372514499954,"score_gpt":0.28770521558881235,"score_spread":0.2567508430743124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143141569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13852443,0.000035403362,0.8597599,0.0003007413,0.00017208274,0.00024133746,0.0000015336302,0.000028830118,0.0009357205],"genre_scores_gemma":[0.75059885,0.0000034587877,0.2491169,0.000040218307,0.00003779948,0.000013846985,0.0000020721222,0.0000033795375,0.00018347931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992178,0.00003219594,0.0002607588,0.0002213108,0.00010634896,0.00016156737],"domain_scores_gemma":[0.9994149,0.00018270467,0.00007621882,0.00025905992,0.000047057867,0.000020055842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014575725,0.000069938156,0.00012907574,0.00014141711,0.000042826454,0.000040372153,0.00020169125,0.00006145349,0.0000058715636],"category_scores_gemma":[0.0000274404,0.000060102207,0.00008851003,0.00028637506,0.00003116393,0.0001640168,0.00005559578,0.000044401208,0.0000010161191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045474607,0.0012173258,0.037086125,0.00029880818,0.000107236105,0.00005536899,0.0066625904,0.408496,0.10021754,0.41555518,0.003093362,0.026755713],"study_design_scores_gemma":[0.0017756461,0.000099151315,0.012444705,0.000045167744,0.000010671325,0.0000050780213,0.00008441714,0.9195541,0.02385699,0.041381393,0.00053548464,0.00020718972],"about_ca_topic_score_codex":0.0007162641,"about_ca_topic_score_gemma":0.00062104734,"teacher_disagreement_score":0.61207443,"about_ca_system_score_codex":0.000010244125,"about_ca_system_score_gemma":0.00002909607,"threshold_uncertainty_score":0.2450897},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01577423187320397,"score_gpt":0.2544011287992291,"score_spread":0.23862689692602512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144693841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034409545,0.00026148534,0.96099037,0.002763771,0.00067876256,0.00048519988,0.0000049440446,0.0002112592,0.00019466295],"genre_scores_gemma":[0.9815542,0.00017259103,0.017554803,0.00045157847,0.000059823564,0.00011098137,5.3969495e-7,0.000013877464,0.00008159296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985382,0.000117662894,0.00027305415,0.0004628387,0.00028750318,0.00032071603],"domain_scores_gemma":[0.9983271,0.0006796889,0.000057854908,0.00065085624,0.00007309889,0.0002114099],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00020238922,0.00020767584,0.00018954733,0.00021723086,0.0014473182,0.00014149076,0.000779069,0.000066792825,0.0000022694296],"category_scores_gemma":[0.0000039057218,0.00014718328,0.00011789495,0.00096562185,0.00014229807,0.00017845734,0.000011204453,0.00027655988,0.00005485378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020159906,0.0015608707,0.00086488895,0.000074340256,0.0005551898,0.00007897415,0.012871295,0.2087567,0.0018527781,0.10194374,0.012373819,0.6588658],"study_design_scores_gemma":[0.0043702098,0.0017332083,0.056775913,0.0002670938,0.00014163989,0.0014441817,0.0005114465,0.8163079,0.032942526,0.017986502,0.06433866,0.0031807371],"about_ca_topic_score_codex":0.000017819935,"about_ca_topic_score_gemma":0.00009986531,"teacher_disagreement_score":0.9471447,"about_ca_system_score_codex":0.00002695848,"about_ca_system_score_gemma":0.000041414118,"threshold_uncertainty_score":0.99985266},"labels":[],"label_agreement":null},{"id":"W2147757577","doi":"10.1109/fccm.2006.36","title":"Design of a Reconfigurable Processor for NIST Prime Field ECC","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"NIST; Elliptic curve cryptography; Computer science; Modular arithmetic; Modular design; Cryptography; Prime (order theory); Subtraction; Parallel computing; Finite field; Elliptic curve; Arithmetic; Embedded system; Operating system; Mathematics; Public-key cryptography; Algorithm; Discrete mathematics; Encryption","score_opus":0.013594323194227027,"score_gpt":0.22712486914165986,"score_spread":0.21353054594743284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147757577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006483563,0.00011644049,0.98162735,0.00074672885,0.000069364236,0.00029374423,6.7682197e-7,0.00006804387,0.016429316],"genre_scores_gemma":[0.64702797,0.0000059944587,0.3507734,0.00017980412,0.000035401594,0.00005182519,9.743669e-7,0.000005251665,0.0019193977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99939024,0.000015436752,0.00016475844,0.0001814408,0.00008725716,0.00016085531],"domain_scores_gemma":[0.9993947,0.00022122142,0.00005829976,0.00022482954,0.000077748155,0.000023203085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016746772,0.00006641236,0.00010639409,0.000069930546,0.00006504146,0.000047030306,0.00035293217,0.000043573433,0.000029170014],"category_scores_gemma":[0.000020583597,0.000051759496,0.000056855893,0.00024346664,0.000022308404,0.00013134546,0.000017146775,0.000033295553,0.0000042154397],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017718128,0.0011375904,0.0012526249,0.0005137473,0.00010963024,0.000012135747,0.00088081957,0.0023706693,0.10840548,0.6616974,0.05755737,0.16588537],"study_design_scores_gemma":[0.0005883767,0.00046854652,0.00047548156,0.000030979936,0.000010624078,0.000009103601,0.000012804038,0.031249398,0.90071076,0.06214478,0.004092063,0.00020706379],"about_ca_topic_score_codex":0.00010112032,"about_ca_topic_score_gemma":0.000010715508,"teacher_disagreement_score":0.7923053,"about_ca_system_score_codex":0.0000034671139,"about_ca_system_score_gemma":0.000051253846,"threshold_uncertainty_score":0.21106909},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing; Finite field; Finite field arithmetic; Arithmetic; Field (mathematics); Algorithm; Mathematics; Cryptography; Discrete mathematics","score_opus":0.0182988739172879,"score_gpt":0.26326360060462123,"score_spread":0.24496472668733332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149110203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14325616,0.000077763594,0.8549391,0.00061610126,0.00075981,0.00022010655,0.0000021962821,0.0001160559,0.000012694553],"genre_scores_gemma":[0.97683275,0.000019409188,0.022508861,0.0005850157,0.000033338765,0.00001022782,3.5311763e-7,0.000006414165,0.00000365642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987857,0.00010951154,0.0002758252,0.00039588835,0.00017620236,0.0002569004],"domain_scores_gemma":[0.9993069,0.00023918526,0.000034592736,0.00027823428,0.000036317648,0.000104782484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011927395,0.00018572119,0.00019071034,0.00065780804,0.00026706012,0.00015779622,0.00025868457,0.00008338489,0.0000022766646],"category_scores_gemma":[0.000006491963,0.00017806752,0.00009459082,0.00072240666,0.000047379686,0.00015303702,0.0000032181479,0.00033438197,0.0000029448875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009064168,0.00016529951,0.00000912088,0.000010310793,0.00001422052,0.00001322947,0.0006277355,0.5875343,0.0012929771,0.00021975147,0.0000032289506,0.41010076],"study_design_scores_gemma":[0.0005950738,0.0003554713,0.00066095806,0.0000964847,0.000016508293,0.000072588344,0.000021935417,0.9866518,0.011002447,0.00028928643,0.000021131522,0.00021633926],"about_ca_topic_score_codex":0.00013128111,"about_ca_topic_score_gemma":0.00029378184,"teacher_disagreement_score":0.83357656,"about_ca_system_score_codex":0.000041626477,"about_ca_system_score_gemma":0.00003899715,"threshold_uncertainty_score":0.7261383},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.021331262807773324,"score_gpt":0.2522161742658325,"score_spread":0.23088491145805917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149204794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062332217,0.00001814767,0.9340206,0.0016454543,0.0010752253,0.0005410055,0.000035110097,0.00030378503,0.000028481056],"genre_scores_gemma":[0.7646026,0.000006126675,0.23458116,0.0006243513,0.000081368475,0.000077250945,0.0000029738221,0.000014463226,0.00000969774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848187,0.00004993699,0.0002762181,0.0005683577,0.00025011922,0.00037352336],"domain_scores_gemma":[0.9988847,0.00022594977,0.00008332726,0.0005945611,0.00005617458,0.00015533376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000111811285,0.00024320018,0.0002169571,0.0003503959,0.00045568348,0.00013973602,0.00068640447,0.00010030351,0.000007645794],"category_scores_gemma":[0.0000022563102,0.0002311176,0.0003470175,0.0004759012,0.00015907513,0.00012020208,0.0000059231807,0.00022726349,0.000019102428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012120311,0.0007048628,0.000020306905,0.000043952434,0.00009976063,0.000004598626,0.00083887693,0.86386764,0.0009770012,0.0020758165,0.0003674298,0.13087857],"study_design_scores_gemma":[0.012431855,0.0014754588,0.017642092,0.0002783984,0.0001252487,0.00010149123,0.000044601038,0.8355883,0.10947174,0.019311912,0.0017117688,0.001817185],"about_ca_topic_score_codex":0.00018199977,"about_ca_topic_score_gemma":0.00015855064,"teacher_disagreement_score":0.7022704,"about_ca_system_score_codex":0.00008121479,"about_ca_system_score_gemma":0.00006851986,"threshold_uncertainty_score":0.94247025},"labels":[],"label_agreement":null},{"id":"W2149916978","doi":"10.1109/arith.2003.1207678","title":"Low complexity sequential normal basis multipliers over GF(2/sup m/)","year":2004,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiplier (economics); Finite field; Arithmetic; Mathematics; GF(2); Adder; Multiplication algorithm; Discrete mathematics; Computer science","score_opus":0.019040183078314343,"score_gpt":0.2416494959281031,"score_spread":0.22260931284978874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149916978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2395459,0.000028332297,0.7525913,0.0008121286,0.00036522554,0.00014449222,0.0000047082403,0.00029911846,0.006208792],"genre_scores_gemma":[0.8753732,0.0000069444836,0.123823725,0.00062633055,0.000068996036,0.0000052584564,0.0000029756573,0.000006882798,0.0000857089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998666,0.000035392422,0.00019746018,0.00038558172,0.000321263,0.0003942971],"domain_scores_gemma":[0.9992041,0.000033592976,0.00004364864,0.0005030193,0.000050570132,0.00016506888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014252176,0.00015914647,0.00014647718,0.00014916481,0.0002340119,0.00018057854,0.00070598477,0.000075471624,0.00021887885],"category_scores_gemma":[0.000009772747,0.0001344014,0.00017573731,0.0005168351,0.00019774926,0.0005288743,0.00027526874,0.00015811743,0.00013392408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004934793,0.0010073918,0.0072199036,0.0000876539,0.00015598672,0.00021728456,0.0031205867,0.012789429,0.005247743,0.9131131,0.002026236,0.054965314],"study_design_scores_gemma":[0.016813967,0.00091956113,0.35590854,0.0001911752,0.00011267367,0.0003623362,0.00038529147,0.18394542,0.2281788,0.19909254,0.010263851,0.0038258464],"about_ca_topic_score_codex":0.0005230641,"about_ca_topic_score_gemma":0.00014179853,"teacher_disagreement_score":0.7140206,"about_ca_system_score_codex":0.000041896732,"about_ca_system_score_gemma":0.000071011826,"threshold_uncertainty_score":0.548073},"labels":[],"label_agreement":null},{"id":"W2151228277","doi":"10.1109/pacrim.2009.5291345","title":"New processor array architecture for scalable radix 2 Montgomery modular multiplication algorithm","year":2009,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Scalability; Parallel computing; Architecture; Modular arithmetic; Multiplication (music); Modular design; Multiplier (economics); Radix (gastropod); Arithmetic; Algorithm; Computer architecture; Computer hardware; Mathematics","score_opus":0.007186333732359518,"score_gpt":0.22778757556330234,"score_spread":0.22060124183094282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151228277","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006905209,0.00046044134,0.99191356,0.0052730837,0.00010571883,0.0005181395,0.0000022306517,0.0002856211,0.0007507078],"genre_scores_gemma":[0.040072076,0.000018661574,0.9579445,0.0006164736,0.00016090983,0.00003783912,0.000006592912,0.000007936753,0.0011350232],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880904,0.000015970587,0.00018741071,0.00045934904,0.00020128995,0.00032692656],"domain_scores_gemma":[0.9991399,0.000056089153,0.000061342966,0.000500685,0.00008202164,0.00015993438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013236789,0.00015563633,0.00015619036,0.00016331852,0.00015986127,0.00014250787,0.00062954554,0.00008249054,0.00000948225],"category_scores_gemma":[0.000021461366,0.0001223095,0.00012599965,0.00059824437,0.0000197133,0.00029343247,0.000025676214,0.00010493533,0.000010716325],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070742135,0.000087177534,0.0000190272,0.000011033642,0.000014214977,0.0000010653076,0.0003212948,0.0007614817,0.010789638,0.0068634977,0.002600733,0.9785238],"study_design_scores_gemma":[0.0029172902,0.0007470162,0.008589012,0.00006796924,0.00004169052,0.00006425199,0.00004383988,0.41277766,0.16095552,0.3423754,0.07037684,0.0010435103],"about_ca_topic_score_codex":0.000036341393,"about_ca_topic_score_gemma":0.0000073111246,"teacher_disagreement_score":0.97748023,"about_ca_system_score_codex":0.000013558662,"about_ca_system_score_gemma":0.00006475384,"threshold_uncertainty_score":0.49876368},"labels":[],"label_agreement":null},{"id":"W2158616534","doi":"10.1145/1057661.1057701","title":"Two-prime RSA immune cryptosystem and its FPGA implementation","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Cryptosystem; Field-programmable gate array; Computer science; Prime (order theory); Embedded system; Cryptography; Prime number; Arithmetic; Computer hardware; Computer security; Mathematics; Discrete mathematics","score_opus":0.010090945813417494,"score_gpt":0.26951658203009676,"score_spread":0.25942563621667925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158616534","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65964377,0.0045418763,0.31565467,0.0064047645,0.0004514976,0.00068687083,0.0000058155997,0.0005820276,0.012028712],"genre_scores_gemma":[0.9812408,0.00004167453,0.018372156,0.00018018474,0.000056190238,0.000009495968,0.000001983637,0.0000033487088,0.00009416734],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991568,0.000042068925,0.00020495536,0.0002377966,0.00015594198,0.00020246704],"domain_scores_gemma":[0.9995672,0.0000368797,0.000051296873,0.00023421469,0.000041453204,0.00006891587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020286036,0.000093824114,0.0001023899,0.000111002,0.00012598785,0.00012750445,0.00027136077,0.000025922309,0.000089803056],"category_scores_gemma":[0.0000031939762,0.000076585464,0.000045164605,0.00026227123,0.000014127809,0.00045175853,0.00014328003,0.000055345812,0.00008801169],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006745832,0.000099188546,0.0013984101,0.000035187248,0.00007017134,0.000009947337,0.0018279345,0.000057038607,0.03676718,0.40861592,0.00075183,0.55036044],"study_design_scores_gemma":[0.004925811,0.00035711745,0.062354986,0.000056484037,0.0000489444,0.00021754461,0.0010746372,0.04148426,0.8624749,0.0052236314,0.020707965,0.0010736766],"about_ca_topic_score_codex":0.00006285783,"about_ca_topic_score_gemma":0.000069561545,"teacher_disagreement_score":0.82570773,"about_ca_system_score_codex":0.000013627407,"about_ca_system_score_gemma":0.000019950186,"threshold_uncertainty_score":0.31230646},"labels":[],"label_agreement":null},{"id":"W2159336276","doi":"10.1109/icassp.1987.1169597","title":"Systolic ROM arrays for implementing RNS FIR filters","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Systolic array; Residue number system; Very-large-scale integration; Computer science; Finite impulse response; Modular design; Digital filter; Digital signal processing; Parallel computing; Linear filter; Computer hardware; Filter (signal processing); Embedded system; Algorithm","score_opus":0.01819628148236481,"score_gpt":0.2570465735149044,"score_spread":0.2388502920325396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159336276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025634333,0.00010131277,0.96646225,0.0024240168,0.00018723188,0.0002408151,0.0000038435187,0.00021760035,0.00472858],"genre_scores_gemma":[0.71605116,0.00000583073,0.28292346,0.00056654256,0.00015047524,0.000032663753,0.0000025072907,0.000005985059,0.00026140703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905515,0.000014858649,0.00017435405,0.0002566362,0.0001205868,0.00037843513],"domain_scores_gemma":[0.99943775,0.0000906097,0.00004559323,0.0003230351,0.000032546835,0.00007049495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019959784,0.00009335941,0.00010049181,0.000103110615,0.00020164675,0.00012884702,0.0004927654,0.000028879074,0.000049835682],"category_scores_gemma":[0.000010505293,0.00007674905,0.00012308026,0.00023313936,0.000018217483,0.0002670471,0.00011880682,0.000047659825,0.000027791091],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072711414,0.00018565706,0.0016964893,0.0000999527,0.00012599447,0.000006791228,0.0025290428,0.0005637102,0.00916215,0.59895927,0.036576904,0.35008678],"study_design_scores_gemma":[0.0023862862,0.00030793782,0.014864733,0.000077114564,0.00004853193,0.00006836734,0.0005325722,0.21156119,0.028357731,0.015538219,0.7251892,0.001068096],"about_ca_topic_score_codex":0.000036079462,"about_ca_topic_score_gemma":0.00014095184,"teacher_disagreement_score":0.6904168,"about_ca_system_score_codex":0.000013987783,"about_ca_system_score_gemma":0.000019827568,"threshold_uncertainty_score":0.31297356},"labels":[],"label_agreement":null},{"id":"W2160151462","doi":"10.1109/ccece.2006.277323","title":"Reconfigurable RSA Cryptography for Embedded Devices","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Cryptography; Modular exponentiation; Modular arithmetic; Modular design; Encryption; Field-programmable gate array; Embedded system; Public-key cryptography; Multiplication (music); Elliptic curve cryptography; Software; Nios II; Computer hardware; Algorithm; Operating system; Mathematics","score_opus":0.008416807149255993,"score_gpt":0.22250505160281203,"score_spread":0.21408824445355604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160151462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007738461,0.00038049236,0.8966267,0.0015189623,0.00025973827,0.00026403167,0.0000025092288,0.00033929537,0.09286977],"genre_scores_gemma":[0.6143595,0.000014464303,0.3838638,0.0010484348,0.00008022885,0.0000660313,0.0000063679763,0.000010384404,0.00055077154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903053,0.000029783836,0.00019342832,0.00032300345,0.00013228445,0.0002909428],"domain_scores_gemma":[0.999281,0.00016739972,0.000056333552,0.00036308655,0.00008007777,0.000052112187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023583432,0.00011985111,0.00012898563,0.00020367804,0.00015110015,0.00023061446,0.00050696905,0.000053633365,0.00004070868],"category_scores_gemma":[0.000007587596,0.000095537536,0.000184905,0.00057260256,0.000037489113,0.00038534735,0.000029461058,0.000057876034,0.000021642158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041868498,0.00008599456,0.0011574466,0.000019698133,0.00001879506,0.0000019526444,0.00006828186,0.000067546825,0.0012956402,0.97618717,0.011394363,0.0096989125],"study_design_scores_gemma":[0.001638773,0.00030288997,0.032200668,0.000045180124,0.00003209342,0.000027828246,0.00011779585,0.01387022,0.040870573,0.67201847,0.23802578,0.0008496939],"about_ca_topic_score_codex":0.00014862663,"about_ca_topic_score_gemma":0.00020265902,"teacher_disagreement_score":0.606621,"about_ca_system_score_codex":0.0000043681252,"about_ca_system_score_gemma":0.000029187548,"threshold_uncertainty_score":0.38959077},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014694594731142097,"score_gpt":0.2393141835337826,"score_spread":0.2246195888026405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160886236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13606462,0.00004809714,0.86291176,0.00009796158,0.000108161614,0.00038144345,0.000003154415,0.00007690899,0.0003079113],"genre_scores_gemma":[0.6667925,9.712181e-7,0.33309773,0.000012844427,0.00003320171,0.000018544852,0.000008931393,0.000007684403,0.000027556385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902815,0.000020512285,0.0003668134,0.00018853505,0.00020453507,0.00019148261],"domain_scores_gemma":[0.999083,0.00019879291,0.000280221,0.00022399118,0.0001846833,0.000029300416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003409777,0.00010921595,0.00019371121,0.00017607442,0.00009021877,0.000077612334,0.00026064945,0.00005288514,0.0000012100095],"category_scores_gemma":[0.00001602715,0.00010260196,0.00010140741,0.00037531296,0.000027551176,0.00013091289,0.000056059118,0.000048733105,0.0000068360955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026034952,0.00096490094,0.00022244999,0.00042486834,0.000056151937,0.0000022791662,0.0024144247,0.037868474,0.0017390567,0.94728243,0.00012674523,0.008872201],"study_design_scores_gemma":[0.00099346,0.00007991727,0.003946462,0.000028413397,0.000021558397,0.0000058299975,0.000019042513,0.8494511,0.0016534191,0.14359277,0.00008848859,0.000119503726],"about_ca_topic_score_codex":0.00006477145,"about_ca_topic_score_gemma":0.000029340154,"teacher_disagreement_score":0.8115827,"about_ca_system_score_codex":0.000019256155,"about_ca_system_score_gemma":0.00003694401,"threshold_uncertainty_score":0.41839865},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00907540417949722,"score_gpt":0.22752003212094424,"score_spread":0.218444627941447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162548688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22819775,0.00053741876,0.61924994,0.0035241083,0.0038715014,0.001941299,0.0000051529532,0.003938117,0.1387347],"genre_scores_gemma":[0.8499635,0.000078270845,0.14680247,0.0015704782,0.0012070084,0.000058617465,0.0000029757377,0.00010738741,0.00020930763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927505,0.0000110018655,0.00128157,0.0021389988,0.0016931278,0.0021247633],"domain_scores_gemma":[0.9967937,0.00033048686,0.00055684824,0.0004980971,0.00097479986,0.00084607553],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0023962592,0.001009236,0.0008537266,0.0031935214,0.00088863634,0.0018961827,0.0031247586,0.00043631266,0.000011567141],"category_scores_gemma":[0.00010103556,0.00094904867,0.0005428863,0.0059136916,0.0002191807,0.0020964227,0.0011501344,0.0011248488,0.0002289314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001974683,0.0016113677,0.020829644,0.0007587701,0.00035466626,0.00013834814,0.0042261034,0.00009390712,0.013232029,0.79056484,0.0092534665,0.15873937],"study_design_scores_gemma":[0.015056063,0.012443228,0.18066631,0.002640176,0.0006626194,0.004374602,0.0010599775,0.37928,0.20793544,0.08032769,0.1027714,0.012782479],"about_ca_topic_score_codex":0.000027853239,"about_ca_topic_score_gemma":0.0000019828171,"teacher_disagreement_score":0.71023715,"about_ca_system_score_codex":0.00029254283,"about_ca_system_score_gemma":0.00007215811,"threshold_uncertainty_score":0.999296},"labels":[],"label_agreement":null},{"id":"W2162940666","doi":"10.1109/enics.2008.18","title":"A Handel-C Implementation of a Computationally Intensive Problem in GF(3)","year":2008,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Task (project management); Computation; Software; Parallel computing; Work (physics); Programming language; Theoretical computer science; Computer architecture; Engineering","score_opus":0.016028266313133543,"score_gpt":0.26516613008141865,"score_spread":0.24913786376828512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162940666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43446973,0.00005252292,0.56316817,0.0010454131,0.00004367228,0.00020779854,0.0000010837027,0.00003937456,0.00097222405],"genre_scores_gemma":[0.88968414,0.000010885094,0.11000291,0.00026751796,0.0000045600564,0.0000079709225,0.000002148206,0.0000017399773,0.000018125278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99936706,0.000028663162,0.00020644222,0.000141661,0.0001512506,0.00010489722],"domain_scores_gemma":[0.99957496,0.000054018044,0.000056445115,0.00010341747,0.00018720304,0.000023928911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000092419665,0.000051851057,0.00008951218,0.00019330451,0.00003517123,0.000010018477,0.0001775275,0.000020168944,0.000017698803],"category_scores_gemma":[0.0000057202315,0.00004388368,0.000038290535,0.00048725857,0.00004403857,0.00017147644,0.0000625487,0.00004639951,0.000004508849],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031067088,0.00043326724,0.25552624,0.00009025025,0.0001074218,0.0001573321,0.040649407,0.0036977124,0.004630611,0.60731953,0.004844832,0.08251234],"study_design_scores_gemma":[0.0022415966,0.00031282025,0.918822,0.000041332158,0.0000050301483,0.0001424555,0.0017423221,0.026146349,0.008644312,0.04141251,0.00023159398,0.00025770374],"about_ca_topic_score_codex":0.00031984324,"about_ca_topic_score_gemma":0.00021639852,"teacher_disagreement_score":0.66329575,"about_ca_system_score_codex":0.000009198149,"about_ca_system_score_gemma":0.000073121206,"threshold_uncertainty_score":0.17895246},"labels":[],"label_agreement":null},{"id":"W2164336166","doi":"10.1109/tc.2003.1190584","title":"Efficient multiplication beyond optimal normal bases","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Iran University of Science and Technology; University of Tehran","keywords":"Multiplication (music); Finite field; Cryptography; Computer science; Normal basis; Multiplication algorithm; Arithmetic; Basis (linear algebra); Class (philosophy); Field (mathematics); Mathematics; Theoretical computer science; Algorithm; Discrete mathematics; Combinatorics; Galois theory; Pure mathematics","score_opus":0.009442735712164141,"score_gpt":0.21863528165083485,"score_spread":0.2091925459386707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164336166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035466928,0.000030592677,0.96194804,0.00025662145,0.0013298797,0.00018944994,0.000004497661,0.00024068977,0.00053332315],"genre_scores_gemma":[0.84682375,0.0000070865303,0.15276758,0.00031698824,0.000017752875,0.000024446164,6.1217315e-7,0.000009090732,0.000032656575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987028,0.00009568743,0.00021126386,0.00042592472,0.00026502513,0.00029926206],"domain_scores_gemma":[0.9990519,0.00018466875,0.00005200728,0.000517266,0.00005772362,0.00013640086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015582933,0.00017401755,0.00013097502,0.00028680608,0.00033317215,0.00011223003,0.00042014185,0.000062952844,0.000020975947],"category_scores_gemma":[0.000002255684,0.00016734032,0.00017119903,0.0006481221,0.000072266674,0.00012901283,0.000002481261,0.0001885463,0.00007430429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009584865,0.0004360114,0.000013133555,0.0000072768344,0.000034314377,0.000009370495,0.00037916837,0.93820935,0.00058364525,0.005249977,0.000167022,0.05490112],"study_design_scores_gemma":[0.00094776734,0.00024105761,0.00042545114,0.000030843014,0.000022789893,0.00007732134,0.000037955895,0.9501572,0.045725923,0.00012666607,0.0018034222,0.00040354795],"about_ca_topic_score_codex":0.000014046273,"about_ca_topic_score_gemma":0.0000041516155,"teacher_disagreement_score":0.81135684,"about_ca_system_score_codex":0.000036078156,"about_ca_system_score_gemma":0.000045368422,"threshold_uncertainty_score":0.682394},"labels":[],"label_agreement":null},{"id":"W2164594959","doi":"10.1109/acssc.1996.599104","title":"Design and FPGA implementation of systolic FIR filters using the Fermat number ALU","year":2002,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Field-programmable gate array; Finite impulse response; Computer science; Parallel computing; Digital signal processing; Computation; Throughput; Residue number system; Fermat's Last Theorem; Adder; FLOPS; Arithmetic; Computer hardware; Algorithm; Mathematics; Discrete mathematics","score_opus":0.04186719116779418,"score_gpt":0.2840313158914343,"score_spread":0.24216412472364013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164594959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19610661,0.00013570595,0.8026713,0.00049739727,0.00006606818,0.0001724948,4.5914518e-7,0.000029224813,0.00032073184],"genre_scores_gemma":[0.9498474,0.000037914793,0.049920216,0.00015842657,0.0000083139485,0.0000035817582,1.4479518e-7,0.0000025379586,0.000021478429],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946237,0.00007065893,0.00012214578,0.00011448522,0.0001145501,0.00011576819],"domain_scores_gemma":[0.9996371,0.00008206294,0.00004635585,0.00018748481,0.000021400032,0.000025548727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012901134,0.000057477217,0.000065007785,0.000039291695,0.00010590589,0.000058408226,0.00019325981,0.00001695409,0.00010831449],"category_scores_gemma":[0.0000018327469,0.000036262038,0.000028563332,0.00023274997,0.000046196554,0.00017777664,0.00006459281,0.000031828007,0.000004865534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026130234,0.00048916525,0.04279204,0.00052551756,0.00063150114,0.00007195934,0.060740564,0.00913162,0.05230825,0.12372486,0.031096447,0.67846197],"study_design_scores_gemma":[0.0015563732,0.00016099676,0.038303,0.000086188345,0.000083955274,0.00044143785,0.0021870402,0.85761535,0.09193292,0.006294671,0.0007898006,0.00054828526],"about_ca_topic_score_codex":0.00014933494,"about_ca_topic_score_gemma":0.000006965017,"teacher_disagreement_score":0.84848374,"about_ca_system_score_codex":0.0000060184198,"about_ca_system_score_gemma":0.0000058097116,"threshold_uncertainty_score":0.1478723},"labels":[],"label_agreement":null},{"id":"W2164774316","doi":"10.1109/asap.2014.6868630","title":"Pipelined modular multiplier supporting multiple standard prime fields","year":2014,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"NIST; Multiplier (economics); Datapath; Computer science; Field-programmable gate array; Prime (order theory); Cryptography; Arithmetic; Elliptic curve cryptography; Modular arithmetic; Modular design; Parallel computing; Computer hardware; Public-key cryptography; Mathematics; Algorithm; Programming language; Encryption","score_opus":0.00650711918028245,"score_gpt":0.22582751399770498,"score_spread":0.21932039481742252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164774316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06001496,0.000026832058,0.93514025,0.0008477083,0.00026434247,0.00013708527,0.0000010654975,0.00030311235,0.0032646195],"genre_scores_gemma":[0.83196986,0.0000029051848,0.16723453,0.00041663626,0.00007460288,0.0000066448733,0.0000017531636,0.0000075852295,0.00028548168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986083,0.00006256707,0.00028517848,0.00038985081,0.0002832098,0.0003709299],"domain_scores_gemma":[0.9988733,0.00018896644,0.0000794783,0.00064032513,0.00008792131,0.00012998635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005112598,0.00014145365,0.00018018123,0.00011306589,0.00016316643,0.00012846374,0.0006054397,0.00009132957,0.00005866506],"category_scores_gemma":[0.0001989198,0.000112203874,0.00012413993,0.00028952854,0.00003846342,0.00024301013,0.00022337372,0.00014857642,0.00005117137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000789549,0.000402191,0.04095995,0.00009587069,0.00013868997,0.000056875164,0.0036741963,0.0039156303,0.024512528,0.16136044,0.0056652185,0.7591394],"study_design_scores_gemma":[0.0014827694,0.000217184,0.009468778,0.000021460373,0.000010963087,0.000013589931,0.000059213293,0.9035483,0.053022828,0.0116870515,0.019992687,0.0004751537],"about_ca_topic_score_codex":0.000053607386,"about_ca_topic_score_gemma":0.000056761983,"teacher_disagreement_score":0.8996327,"about_ca_system_score_codex":0.000011159965,"about_ca_system_score_gemma":0.00003195915,"threshold_uncertainty_score":0.4575541},"labels":[],"label_agreement":null},{"id":"W2167556014","doi":"10.1090/s0025-5718-02-01479-5","title":"The twenty-fourth Fermat number is composite","year":2002,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Reed College; Division of Mathematical Sciences; University of Southern Mississippi; University of Georgia; Case Western Reserve University; Dalhousie University; Northern Illinois University; Microsoft Research","keywords":"Mathematics; Primality test; Modulo; Fast Fourier transform; Piecewise; Fermat number; Arithmetic; Discrete mathematics; Algorithm; Composite number; Fermat's Last Theorem; Combinatorics; Prime number; Mathematical analysis","score_opus":0.016375134560647993,"score_gpt":0.24592599945827465,"score_spread":0.22955086489762666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167556014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052994348,0.00015944635,0.93931437,0.0015225617,0.0001840059,0.00015566497,0.0000013367326,0.00008106295,0.0055871983],"genre_scores_gemma":[0.806102,0.000047668775,0.19357483,0.00011180132,0.00001883959,0.0000046198215,8.780605e-7,0.00000721798,0.0001321786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999034,0.00004050859,0.00030942148,0.00013123977,0.0003295032,0.00015534963],"domain_scores_gemma":[0.99901545,0.00032667367,0.0001902338,0.00031974452,0.0001078175,0.00004010122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018924163,0.00009877543,0.0001357279,0.000054699743,0.00020695283,0.0001478604,0.00047904465,0.000033520104,0.000019351577],"category_scores_gemma":[0.000013428134,0.000069242255,0.00009508203,0.00034513322,0.00007384001,0.00016696552,0.00010296586,0.000075279706,0.00013469432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008040127,0.0013254404,0.0012740331,0.00054365734,0.00029874296,0.000016742213,0.037057497,0.010541963,0.0010238963,0.7703789,0.027656533,0.14987455],"study_design_scores_gemma":[0.00022524406,0.000024460356,0.00070673233,0.000044761804,0.000012160632,0.000027225175,0.00006026997,0.87673783,0.0012115845,0.120077044,0.00076112774,0.000111577574],"about_ca_topic_score_codex":0.0000029073517,"about_ca_topic_score_gemma":7.5059035e-7,"teacher_disagreement_score":0.86619586,"about_ca_system_score_codex":0.0000083805235,"about_ca_system_score_gemma":0.0000052132586,"threshold_uncertainty_score":0.28236172},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015540830035200346,"score_gpt":0.29185214220207306,"score_spread":0.2763113121668727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167706997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002050922,0.000016651573,0.9736685,0.0028959124,0.00031313926,0.0031241658,0.0002846622,0.00052060484,0.017125448],"genre_scores_gemma":[0.9568694,0.000010358116,0.031947643,0.00026632138,0.0007473388,0.0091368845,0.00026375765,0.00006378283,0.00069450215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759346,0.000017818373,0.0005665521,0.0009078001,0.00052853266,0.00038584298],"domain_scores_gemma":[0.9976188,0.0006128324,0.000351096,0.0008484609,0.00040811457,0.00016070496],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027163053,0.0003208114,0.00027378686,0.00041837,0.0005133282,0.000583323,0.0013804827,0.00014223706,0.0000031187485],"category_scores_gemma":[0.00004203355,0.00029664818,0.00032022287,0.0005959215,0.00009085358,0.00043549974,0.000053945638,0.0001624204,0.00039470213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015074972,0.0009302444,0.000024715702,0.00015458194,0.00013370096,0.0000020322066,0.000253654,0.008572235,0.0051186155,0.91695505,0.0018406406,0.06586378],"study_design_scores_gemma":[0.022643812,0.003087774,0.0030809871,0.006492407,0.0004034154,0.0004246077,0.0018633807,0.28923684,0.06881925,0.3285098,0.26834103,0.0070966776],"about_ca_topic_score_codex":0.000010246469,"about_ca_topic_score_gemma":0.000003047846,"teacher_disagreement_score":0.9548185,"about_ca_system_score_codex":0.00027919267,"about_ca_system_score_gemma":0.000117867094,"threshold_uncertainty_score":0.99994856},"labels":[],"label_agreement":null},{"id":"W2168839239","doi":"10.1109/tc.2007.1084","title":"Hardware Complexity of Modular Multiplication and Exponentiation","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Modular exponentiation; Modular arithmetic; Exponentiation; Multiplication (music); Cryptosystem; Computer science; Multiplication algorithm; Arithmetic; Public-key cryptography; Fast Fourier transform; Cryptography; Modular design; Parallel computing; Mathematics; Algorithm; Encryption","score_opus":0.0246899663490851,"score_gpt":0.24330902170566754,"score_spread":0.21861905535658244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168839239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10080648,0.000030061969,0.8982918,0.00020662071,0.000389742,0.00013945228,0.0000038419316,0.00009462625,0.00003736698],"genre_scores_gemma":[0.89082783,0.000016883823,0.10906106,0.000067741414,0.0000125948645,0.0000036563172,0.0000012079421,0.0000045759834,0.000004456295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991657,0.000033569264,0.0002133123,0.00025729145,0.00018337551,0.00014675745],"domain_scores_gemma":[0.9993649,0.000104982166,0.000074742784,0.00031763222,0.00006531983,0.00007239815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020051972,0.00009790804,0.000115507406,0.00025586667,0.00014160408,0.000033696455,0.00023078296,0.00005010232,0.0000025626855],"category_scores_gemma":[0.0000011155806,0.00009871084,0.000077664125,0.0003649378,0.00011819688,0.00021821937,0.0000032178577,0.000099829886,0.0000034390002],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009079167,0.0009750244,0.00050041196,0.00011399741,0.00018138542,0.00001210359,0.0034938324,0.0505137,0.037606787,0.024469357,0.000097331606,0.88194525],"study_design_scores_gemma":[0.0015646078,0.00034572973,0.08278539,0.000110391564,0.000038412963,0.0000406881,0.00009326124,0.6770464,0.23343357,0.0038111275,0.00027689335,0.0004534931],"about_ca_topic_score_codex":0.00004435663,"about_ca_topic_score_gemma":0.00002239015,"teacher_disagreement_score":0.8814918,"about_ca_system_score_codex":0.000017526932,"about_ca_system_score_gemma":0.0000100045745,"threshold_uncertainty_score":0.40253115},"labels":[],"label_agreement":null},{"id":"W2168975319","doi":"10.1007/978-3-642-14518-6_19","title":"A Subexponential Algorithm for Evaluating Large Degree Isogenies","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Isogeny; Degree (music); Elliptic curve; Morphism; Endomorphism ring; Prime ideal; Prime (order theory); Principal ideal; Supersingular elliptic curve; Kernel (algebra); Modular elliptic curve; Homomorphism; Discrete mathematics; Pure mathematics; Combinatorics; Endomorphism","score_opus":0.0306241494359271,"score_gpt":0.2842703214134102,"score_spread":0.25364617197748307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168975319","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001368984,0.0007044704,0.9938918,0.00037827555,0.0035137844,0.00076679426,0.000028033355,0.00018358763,0.00039636286],"genre_scores_gemma":[0.0100405775,0.000025383264,0.9883424,0.0005795308,0.000775177,0.000038517966,0.000010369847,0.000041004925,0.00014701654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99554473,0.000037813224,0.0005664011,0.0017113684,0.0011304579,0.0010092377],"domain_scores_gemma":[0.9969142,0.00074563164,0.00031418007,0.0014019173,0.00042568252,0.00019841002],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001789905,0.0005768467,0.0005611947,0.0010480245,0.00070775545,0.00071602914,0.0035338136,0.000516012,0.00002675634],"category_scores_gemma":[0.00013317433,0.00051472516,0.00036302445,0.0006311912,0.00070097076,0.0005062874,0.001365887,0.0010474949,0.000020455262],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046085756,0.00003890745,0.000013429997,0.000030550254,0.000019852821,0.000027805661,0.0005761239,0.00040319952,0.0010204369,0.011255076,0.000007848338,0.9866022],"study_design_scores_gemma":[0.0007200814,0.00037202216,0.00011577376,0.00019492442,0.000026207028,0.0000911428,2.5312852e-7,0.7492003,0.004002994,0.24193802,0.0025261326,0.0008121309],"about_ca_topic_score_codex":0.000017295577,"about_ca_topic_score_gemma":0.00015521795,"teacher_disagreement_score":0.98579,"about_ca_system_score_codex":0.00008761148,"about_ca_system_score_gemma":0.00056664285,"threshold_uncertainty_score":0.9997304},"labels":[],"label_agreement":null},{"id":"W2169059124","doi":"10.1109/cjece.2009.5599422","title":"High-performance, low-power architecture for scalable radix 2 montgomery modular multiplication algorithm","year":2009,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Scalability; Parallel computing; Modular arithmetic; Multiplication (music); Architecture; Modular design; Radix (gastropod); Arithmetic; Multiplier (economics); Power consumption; Adder; Algorithm; Computer architecture; Power (physics); Mathematics; Latency (audio); Telecommunications","score_opus":0.00235668763110896,"score_gpt":0.1563857854713812,"score_spread":0.15402909784027224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169059124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1343478,0.0010046043,0.86391,0.0003895319,0.000235863,0.00008729804,0.0000014262052,0.00001961602,0.0000038738094],"genre_scores_gemma":[0.7842824,0.000030225541,0.21531138,0.00016241192,0.00019967071,0.0000021695457,9.430999e-7,0.0000061957317,0.0000046096925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991337,0.000009838021,0.00023337982,0.00016382558,0.000107287335,0.00035195463],"domain_scores_gemma":[0.999237,0.000064049855,0.000062151856,0.00013831446,0.000096106385,0.00040240027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012223398,0.00013074523,0.00019724057,0.00045136755,0.00010661983,0.00012139937,0.0003344968,0.000066378496,8.631686e-7],"category_scores_gemma":[0.000012470359,0.00011237855,0.00008145178,0.00046941638,0.000014716029,0.00021216764,0.000010206227,0.00022713096,4.659204e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070562,0.000034071145,0.00011704515,0.000020346226,0.00005218805,0.000044863707,0.00017244721,0.10174114,0.0007955791,0.005678241,0.00048153233,0.8908555],"study_design_scores_gemma":[0.0004872903,0.0005406963,0.019039962,0.000052455052,0.000009749587,0.00023083392,4.7668493e-7,0.9741798,0.0011202774,0.0010745093,0.0030762735,0.00018767956],"about_ca_topic_score_codex":0.00003552566,"about_ca_topic_score_gemma":0.000006994833,"teacher_disagreement_score":0.8906678,"about_ca_system_score_codex":0.00003874784,"about_ca_system_score_gemma":0.00010526291,"threshold_uncertainty_score":0.45826644},"labels":[],"label_agreement":null},{"id":"W2169884625","doi":"10.1109/acssc.2005.1599981","title":"High Speed Word-parallel Bit-Serial Normal Basis Finite Field Multiplier and Its FPGA Implementation","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Multiplier (economics); Field-programmable gate array; Finite field; Computer science; Parallel computing; Arithmetic; Normal basis; Basis (linear algebra); Analog multiplier; Computer hardware; Mathematics; Discrete mathematics; Digital signal processing","score_opus":0.009993813061564976,"score_gpt":0.2414265810917365,"score_spread":0.23143276803017154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169884625","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79848623,0.00014523792,0.19567889,0.0024711585,0.0006594403,0.00034076214,0.000007958581,0.00019347561,0.0020168165],"genre_scores_gemma":[0.95161474,0.00002547939,0.047396947,0.00041104303,0.00018492622,0.000007636038,0.000009956076,0.000005828954,0.00034347456],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9989964,0.000033986198,0.00022690484,0.00029743643,0.00017830552,0.000266996],"domain_scores_gemma":[0.999489,0.00015007502,0.000056041124,0.0001997858,0.000042183547,0.00006293095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011845806,0.00012849954,0.00012068356,0.0001459739,0.00015420569,0.00016843545,0.00024990583,0.000063387604,0.00025193178],"category_scores_gemma":[0.000009370784,0.000108909946,0.00005888112,0.00032336707,0.000019524785,0.0004044206,0.00015263843,0.00007901134,0.00002767745],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038379634,0.0008153401,0.049297474,0.00014335742,0.00026301114,0.00015581286,0.0024154393,0.008054605,0.026411256,0.41922677,0.032415073,0.46041808],"study_design_scores_gemma":[0.011642002,0.00083545316,0.58264154,0.00004301725,0.00008964659,0.000051660398,0.0003402031,0.07110591,0.29996637,0.022308035,0.009201355,0.0017748219],"about_ca_topic_score_codex":0.0010392839,"about_ca_topic_score_gemma":0.00064317574,"teacher_disagreement_score":0.5333441,"about_ca_system_score_codex":0.0000067335914,"about_ca_system_score_gemma":0.000018371271,"threshold_uncertainty_score":0.4441219},"labels":[],"label_agreement":null},{"id":"W2170943789","doi":"10.1109/ccece.2004.1345228","title":"An improved FPGA implementation of a hyperelliptic cryptosystem coprocessor","year":2004,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Cryptosystem; Coprocessor; Discrete logarithm; Field-programmable gate array; Computer science; Finite field; Hyperelliptic curve; Scalar multiplication; Polynomial; Arithmetic; Hyperelliptic curve cryptography; Multiplication (music); Timing attack; Polynomial basis; Cryptography; Field (mathematics); Parallel computing; Mathematics; Algorithm; Public-key cryptography; Elliptic curve cryptography; Discrete mathematics; Encryption; Elliptic curve; Side channel attack; Computer hardware; Pure mathematics; Combinatorics","score_opus":0.00825427857181271,"score_gpt":0.26538313841923844,"score_spread":0.25712885984742573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170943789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43756014,0.00006620831,0.56141686,0.00021816051,0.000097394804,0.00019259995,0.0000016328249,0.00011451243,0.0003324607],"genre_scores_gemma":[0.94321334,0.000007231921,0.05664678,0.000085624924,0.000019521449,0.000013703324,0.0000017162779,0.0000050941053,0.000007004472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991273,0.00002322142,0.00024904916,0.00024510245,0.0001709644,0.00018435353],"domain_scores_gemma":[0.99933785,0.000017329221,0.00009164947,0.00038126,0.00009511456,0.000076793825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014642646,0.00009270573,0.00012763344,0.00012439274,0.00006712747,0.000063640284,0.00047224178,0.00003728046,0.000024002702],"category_scores_gemma":[0.0000031232664,0.00007414156,0.000059487218,0.00046101806,0.00003027067,0.000418506,0.000043743137,0.00004632498,0.00001020231],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027390246,0.00081935886,0.0039910735,0.0004242614,0.00013604248,0.000018693127,0.007838252,0.0010012726,0.30474314,0.4924345,0.000058838665,0.18850717],"study_design_scores_gemma":[0.0037202188,0.0015196151,0.023711607,0.00006129974,0.0000385808,0.000057428577,0.0029627215,0.007854053,0.9229569,0.036399066,0.0001792351,0.000539288],"about_ca_topic_score_codex":0.0004386342,"about_ca_topic_score_gemma":0.00018540568,"teacher_disagreement_score":0.6182137,"about_ca_system_score_codex":0.000017532802,"about_ca_system_score_gemma":0.000093942544,"threshold_uncertainty_score":0.30234048},"labels":[],"label_agreement":null},{"id":"W2171203387","doi":"10.1109/mwscas.1996.593166","title":"An efficient 3-modulus residue to binary converter","year":2002,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Binary number; Residue (chemistry); Moduli; Residue number system; Critical path method; Modulus; Algorithm; Mathematics; Computer science; Arithmetic; Chemistry; Physics; Engineering; Organic chemistry","score_opus":0.012835127945284753,"score_gpt":0.2271060275434807,"score_spread":0.21427089959819595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171203387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30682603,0.00020140476,0.6668048,0.005828411,0.0008140949,0.00031713012,0.0000015431373,0.0005860581,0.018620532],"genre_scores_gemma":[0.9642574,0.0000048505294,0.033136375,0.0018367452,0.00004174623,0.000009680227,3.7556805e-7,0.0000064620194,0.00070636056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988658,0.000052327585,0.00014273297,0.00040636215,0.00023265339,0.00030012795],"domain_scores_gemma":[0.99890476,0.00002775998,0.000018609373,0.0007717932,0.000043577656,0.0002334677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012831145,0.00011330559,0.00010596932,0.00020950544,0.00012838878,0.00013429733,0.00077058707,0.000044730517,0.00030514513],"category_scores_gemma":[0.0000072134153,0.00008868377,0.000060493476,0.00066226005,0.00003641504,0.00016264766,0.00014674227,0.00007654045,0.00072203344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038067952,0.003338904,0.005142034,0.000054076325,0.00009566644,0.0006359723,0.014547328,0.011995826,0.022936836,0.48879835,0.13548899,0.31692797],"study_design_scores_gemma":[0.00049700215,0.0006643076,0.028970873,0.000017540147,0.00000671949,0.000044925477,0.0000810054,0.95309347,0.0071305074,0.0009381391,0.008088097,0.00046739852],"about_ca_topic_score_codex":0.0000553391,"about_ca_topic_score_gemma":0.000014674957,"teacher_disagreement_score":0.9410977,"about_ca_system_score_codex":0.000012209508,"about_ca_system_score_gemma":0.000007692221,"threshold_uncertainty_score":0.928052},"labels":[],"label_agreement":null},{"id":"W2171626127","doi":"10.1109/ccece.2011.6030653","title":"Efficient architectures for modular exponentiation using Montgomery powering ladder","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Modular exponentiation; Scalar multiplication; Exponentiation; Side channel attack; Computer science; Cryptosystem; Modular arithmetic; Curve25519; Public-key cryptography; Parallel computing; Arithmetic; Elliptic curve cryptography; Cryptography; Modular design; Elliptic curve; Multiplication (music); Mathematics; Algorithm; Encryption; Operating system; Pure mathematics","score_opus":0.036253084466847926,"score_gpt":0.2346735408745752,"score_spread":0.19842045640772726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171626127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44659275,0.00009662315,0.55258965,0.000017351247,0.00015022683,0.00010992601,4.0092021e-7,0.000069510985,0.0003735577],"genre_scores_gemma":[0.764064,6.546398e-7,0.23583563,0.000050529477,0.000021885118,0.000008784143,3.0127552e-7,0.0000053487547,0.0000128214115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992617,0.000018971574,0.0001315882,0.00024365893,0.00012791026,0.00021617203],"domain_scores_gemma":[0.999562,0.000030200077,0.0000419649,0.00027633272,0.00003834752,0.00005114141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001352382,0.0000896534,0.000082894076,0.00013622227,0.00013090343,0.000043722714,0.00027490404,0.000034866196,0.000015770884],"category_scores_gemma":[0.000010483418,0.00007280538,0.00010134258,0.00021709237,0.000023830595,0.000032090957,0.00009053254,0.000044374643,0.0000029725697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119588956,0.0012287891,0.00518941,0.00020860098,0.00038607875,0.00004593418,0.024967412,0.441285,0.20663622,0.22695222,0.0001731273,0.092807606],"study_design_scores_gemma":[0.0002633713,0.000053563977,0.012932782,0.000013529884,0.000011247049,0.00001112238,0.000056151992,0.9477501,0.031996645,0.0066735893,0.000054536576,0.00018337379],"about_ca_topic_score_codex":0.00006397548,"about_ca_topic_score_gemma":0.0000053976073,"teacher_disagreement_score":0.5064651,"about_ca_system_score_codex":0.0000083641535,"about_ca_system_score_gemma":0.000013117396,"threshold_uncertainty_score":0.29689172},"labels":[],"label_agreement":null},{"id":"W2172130454","doi":"10.1080/10586458.2001.10504448","title":"Finding the Eigenvalue in Elkies' Algorithm","year":2001,"lang":"en","type":"article","venue":"Experimental Mathematics","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Algorithm; Algebra over a field; Pure mathematics","score_opus":0.020898117924038343,"score_gpt":0.27750543714869896,"score_spread":0.2566073192246606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172130454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3686434,0.0027495718,0.6110823,0.00095642044,0.0007037974,0.0006039845,0.0000015521503,0.0002364541,0.01502252],"genre_scores_gemma":[0.7667097,0.000045535264,0.2327405,0.00019066472,0.00006215211,0.000046906713,6.9375113e-7,0.000012579429,0.0001912793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990484,0.000037330818,0.00022362948,0.0001905936,0.00024196257,0.00025809303],"domain_scores_gemma":[0.99933964,0.00011171145,0.000056064586,0.00043779318,0.000010105021,0.00004469325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024024169,0.00012358066,0.00012646957,0.000100517966,0.00015024736,0.000119204684,0.0006733031,0.000040042178,0.000041308485],"category_scores_gemma":[0.00001193793,0.00008390012,0.00007247988,0.0005209197,0.0000688765,0.00018714857,0.00021570956,0.000119866636,0.0000686685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008177935,0.0027643975,0.0015522883,0.000052948377,0.00009137189,0.00046029003,0.09332621,0.00021560254,0.01856008,0.7994512,0.0013833656,0.0821341],"study_design_scores_gemma":[0.0028172364,0.00047665896,0.004757266,0.00035373808,0.000021595568,0.0012664793,0.023679145,0.54552877,0.23573983,0.17401497,0.009748691,0.0015956134],"about_ca_topic_score_codex":0.000018375751,"about_ca_topic_score_gemma":0.000003254889,"teacher_disagreement_score":0.6254362,"about_ca_system_score_codex":0.000036837086,"about_ca_system_score_gemma":0.000014699592,"threshold_uncertainty_score":0.34213477},"labels":[],"label_agreement":null},{"id":"W2185919891","doi":"10.1007/978-3-642-27739-9_256-2","title":"Pairing-Friendly Elliptic Curves","year":2021,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pairing; Elliptic curve; Mathematics; Physics; Pure mathematics; Quantum mechanics","score_opus":0.013342150471804627,"score_gpt":0.2103533834123868,"score_spread":0.19701123294058218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185919891","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000001920823,0.017897777,0.112292156,0.0011279531,0.00056447764,0.00013091753,0.0000027638678,0.0002844457,0.8676976],"genre_scores_gemma":[0.00028681493,0.005306534,0.026440613,0.0013136353,0.00016374663,0.0000068768813,0.000014157761,0.000033702527,0.96643394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99844664,0.00001700992,0.0002687309,0.00061525614,0.00039203736,0.00026033964],"domain_scores_gemma":[0.99855083,0.0000981373,0.00009706105,0.0010233935,0.00010771624,0.00012288772],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013505704,0.00029018905,0.00032393838,0.00017558777,0.00009342536,0.00014536214,0.00091703655,0.00019365213,0.000942837],"category_scores_gemma":[0.000011661754,0.00024752488,0.00033544656,0.0001019261,0.00008643611,0.00014520582,0.000440753,0.00033863288,0.00035522805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.593433e-7,0.000012490149,0.0000041277067,0.00012671878,0.000056861234,0.00014777697,0.000019162128,0.0000016886609,0.0000054787065,0.97247547,0.016063828,0.011086022],"study_design_scores_gemma":[0.00015343746,0.00010654468,0.000068907466,0.0012616214,0.00005910102,0.00011119185,0.000004589722,0.00035395494,0.0001787737,0.063110165,0.9338197,0.00077202875],"about_ca_topic_score_codex":0.000007740252,"about_ca_topic_score_gemma":0.000017594219,"teacher_disagreement_score":0.91775584,"about_ca_system_score_codex":0.000015723945,"about_ca_system_score_gemma":0.00010818072,"threshold_uncertainty_score":0.9999977},"labels":[],"label_agreement":null},{"id":"W2186201378","doi":"","title":"Solving Discrete Logarithms in Smooth-Order Groups with CUDA 1","year":2012,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; CUDA; Parallel computing; Computer science; Logarithm; Modular arithmetic; Cryptography; Multiplication (music); Modular design; Arithmetic; Theoretical computer science; Mathematics; Public-key cryptography; Algorithm; Encryption; Combinatorics","score_opus":0.008551316037730643,"score_gpt":0.2206038181974752,"score_spread":0.21205250215974455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186201378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12072677,0.00041380952,0.8608462,0.0009018172,0.0002739986,0.00015766373,4.3745146e-7,0.00017683156,0.016502425],"genre_scores_gemma":[0.8828659,0.000012937897,0.11665187,0.00025941845,0.00005172742,0.000010867507,7.066265e-7,0.000007699651,0.00013883588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988867,0.000042020427,0.00014416325,0.00024235957,0.0002041437,0.0004805805],"domain_scores_gemma":[0.9993638,0.00006978554,0.000034577162,0.00038397888,0.000028869445,0.00011903186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025053314,0.00012942488,0.00012914602,0.00017475635,0.00008374869,0.000099553494,0.00043479216,0.00005105879,0.000045610646],"category_scores_gemma":[0.000010984555,0.0000860275,0.000039208917,0.00083555904,0.00006679253,0.0008138126,0.00017577523,0.0001542047,0.000033648594],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019797995,0.0003946169,0.43049005,0.000037707818,0.000047624653,0.000053249503,0.0048247357,0.00024347963,0.0005718018,0.53077954,0.00054524833,0.03199213],"study_design_scores_gemma":[0.0024576013,0.00035725287,0.9462153,0.00015323785,0.000025726658,0.00014923526,0.0008041725,0.024599092,0.0027594003,0.011321073,0.009754264,0.0014036846],"about_ca_topic_score_codex":0.00019940553,"about_ca_topic_score_gemma":0.0002572327,"teacher_disagreement_score":0.76213914,"about_ca_system_score_codex":0.000014780587,"about_ca_system_score_gemma":0.00002305182,"threshold_uncertainty_score":0.35081},"labels":[],"label_agreement":null},{"id":"W2187022892","doi":"","title":"Fast computation of Tate pairing on general divisors of genus 3 hyperelliptic curves.","year":2006,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Pairing; Pointwise; Computation; Mathematics; Divisor (algebraic geometry); Generalization; Degenerate energy levels; Genus; Hyperelliptic curve cryptography; Hyperelliptic curve; Algebra over a field; Pure mathematics; Discrete mathematics; Algorithm; Computer science; Mathematical analysis","score_opus":0.01528944342629144,"score_gpt":0.24983086574990987,"score_spread":0.23454142232361844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187022892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36533794,0.0005672295,0.63165945,0.00027884613,0.0005396331,0.00036988786,0.000037034413,0.00007698112,0.0011330129],"genre_scores_gemma":[0.6081387,0.0003374196,0.39122057,0.00010174498,0.00007184679,0.00004254448,0.00005859374,0.000026500997,0.0000021186781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967251,0.0004851388,0.0009437533,0.00093290594,0.0004375984,0.00047549215],"domain_scores_gemma":[0.99745685,0.00043399565,0.00084807567,0.000990617,0.00016242912,0.00010801654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037939288,0.0004405736,0.0009075849,0.00067268225,0.000090901616,0.000028529497,0.0013431164,0.00024119014,0.000006538996],"category_scores_gemma":[0.000056431207,0.00042791868,0.000497853,0.00032426594,0.0005974609,0.00006690839,0.0017080497,0.00084484415,0.000020184441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008256896,0.0008177429,0.021801796,0.002111527,0.0005152891,0.00012245183,0.0025688894,0.28321365,0.0019342616,0.625438,0.00065953325,0.06073432],"study_design_scores_gemma":[0.00085430243,0.00040091918,0.1993926,0.0017363513,0.00012722814,0.00005218656,0.000027218852,0.122831665,0.004649719,0.6690487,0.00009849769,0.00078057806],"about_ca_topic_score_codex":0.00032657626,"about_ca_topic_score_gemma":0.000044271845,"teacher_disagreement_score":0.2428007,"about_ca_system_score_codex":0.00003285796,"about_ca_system_score_gemma":0.0001562522,"threshold_uncertainty_score":0.99981725},"labels":[],"label_agreement":null},{"id":"W2252701011","doi":"10.1007/978-3-642-42001-6_7","title":"Solving the Elliptic Curve Discrete Logarithm Problem Using Semaev Polynomials, Weil Descent and Gröbner Basis Methods – An Experimental Study","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Discrete logarithm; Logarithm; Basis (linear algebra); Elliptic curve; Polynomial; Descent (aeronautics); Applied mathematics; Pure mathematics; Mathematical analysis; Computer science; Geometry","score_opus":0.02964404166457602,"score_gpt":0.3045504317449756,"score_spread":0.2749063900803996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2252701011","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007353893,0.002281198,0.98731995,0.00030476865,0.0010686088,0.0013283218,0.0000025133486,0.00011292037,0.000227829],"genre_scores_gemma":[0.2854315,0.00003535814,0.71378565,0.00037244894,0.00026969955,0.000024842171,0.0000011103663,0.000039303304,0.00004008686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995246,0.00041357873,0.0006565913,0.0019408957,0.00089556904,0.0008473986],"domain_scores_gemma":[0.99694943,0.00065172656,0.00035197052,0.0016074269,0.00016262326,0.00027682935],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0023053554,0.00072288775,0.00067056774,0.00069296866,0.000950418,0.0017364745,0.0029200672,0.00025487522,0.000022943637],"category_scores_gemma":[0.000037400554,0.0004906402,0.00016666732,0.000678534,0.0012274819,0.0010575481,0.0023641812,0.0008907805,0.0000059153153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023093586,0.0007327042,0.0013317412,0.00010847764,0.00016772085,0.0001747746,0.023918873,0.021050144,0.006214954,0.012801251,0.000017617645,0.9334586],"study_design_scores_gemma":[0.00065238593,0.0010037799,0.0009385216,0.00041005848,0.00007089663,0.00025896882,0.000028450113,0.958327,0.0065498278,0.03017544,0.00020990186,0.0013747779],"about_ca_topic_score_codex":0.00032783285,"about_ca_topic_score_gemma":0.00010238676,"teacher_disagreement_score":0.93727684,"about_ca_system_score_codex":0.00020303312,"about_ca_system_score_gemma":0.00028838078,"threshold_uncertainty_score":0.99975455},"labels":[],"label_agreement":null},{"id":"W2289940563","doi":"10.1002/sec.1462","title":"Binary field multiplication on ARMv8","year":2016,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Electrical, Communications and Cyber Systems; Institute for Information and Communications Technology Promotion","keywords":"Multiplication (music); Computer science; Binary number; Arithmetic; Field (mathematics); Polynomial; Parallel computing; Mathematics; Combinatorics; Pure mathematics","score_opus":0.007696747809404457,"score_gpt":0.22526052389978984,"score_spread":0.21756377609038538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289940563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15473841,0.010720706,0.75405395,0.06837714,0.00037330957,0.0006030822,0.0000035160401,0.00060968555,0.01052022],"genre_scores_gemma":[0.9923447,0.004542399,0.002172221,0.00085900945,0.000029393374,0.00002164132,0.0000023858026,0.0000034404395,0.000024808434],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993368,0.00012874938,0.00012722587,0.00019236657,0.00008520521,0.00012968574],"domain_scores_gemma":[0.99839723,0.0005043966,0.000060729562,0.0009426403,0.00003737193,0.000057649253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020928922,0.000078868296,0.00007435146,0.00005781584,0.0002317863,0.000056424924,0.000599848,0.00008548446,0.000009620851],"category_scores_gemma":[0.000022664673,0.000055580596,0.000037112648,0.00019983674,0.00006824065,0.00021551063,0.00024288397,0.00014350626,0.000011492637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002576276,0.00015523034,0.0013192426,0.000006108818,0.000017247108,0.0000010452094,0.0007648163,0.00005666586,0.00015570858,0.4483153,0.0026040324,0.5465789],"study_design_scores_gemma":[0.0033313672,0.0011249497,0.0749157,0.000830156,0.000036028916,0.00004042169,0.00022253554,0.4080868,0.0030248458,0.41284984,0.09421066,0.0013266843],"about_ca_topic_score_codex":0.000016808632,"about_ca_topic_score_gemma":0.000018986022,"teacher_disagreement_score":0.8376063,"about_ca_system_score_codex":0.0000079684405,"about_ca_system_score_gemma":0.000007146737,"threshold_uncertainty_score":0.22665109},"labels":[],"label_agreement":null},{"id":"W2300226053","doi":"10.1016/j.micpro.2016.02.013","title":"Parallelization of scalable elliptic curve cryptosystem processors in GF (2 m )","year":2016,"lang":"en","type":"article","venue":"Microprocessors and Microsystems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing; Scalability; Elliptic curve; GF(2); Cryptosystem; Elliptic curve point multiplication; Algorithm; Cryptography; Operating system; Discrete mathematics; Finite field; Mathematics","score_opus":0.005634894004171119,"score_gpt":0.19922009293166104,"score_spread":0.19358519892748993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2300226053","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9153817,0.0058041066,0.07771638,0.00022364219,0.00022478554,0.00038100427,0.0000103129105,0.00007487488,0.00018318152],"genre_scores_gemma":[0.9973691,0.00042618162,0.0017936304,0.0000252205,0.000028770975,0.00003286236,0.0000014507168,0.000015835347,0.00030691177],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99821,0.00008177828,0.0005897755,0.00052524364,0.00020252836,0.00039064127],"domain_scores_gemma":[0.9990294,0.0000808645,0.00026034022,0.00035567614,0.00018340361,0.000090329704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046728348,0.000215722,0.0003900988,0.0003271969,0.00009124653,0.000100223326,0.00051246624,0.00013272987,0.000005066253],"category_scores_gemma":[0.000033918062,0.00014291427,0.000065485634,0.000868875,0.0001221165,0.00044095903,0.0001228014,0.00007516128,0.000013892504],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055459393,0.0003054132,0.11567068,0.0029606235,0.000059187158,0.000024673654,0.0038779057,0.000050850616,0.84129846,0.018470386,0.0002988553,0.016927509],"study_design_scores_gemma":[0.008819727,0.00068697025,0.036873955,0.00816527,0.0000671486,0.0004956128,0.0012812981,0.0046604937,0.91034275,0.007613054,0.018719774,0.0022739256],"about_ca_topic_score_codex":0.00015377227,"about_ca_topic_score_gemma":0.00010193587,"teacher_disagreement_score":0.081987426,"about_ca_system_score_codex":0.00003207082,"about_ca_system_score_gemma":0.000074203075,"threshold_uncertainty_score":0.5827875},"labels":[],"label_agreement":null},{"id":"W2320611135","doi":"10.5176/2251-1911_cmcgs20","title":"Evaluation of Modular Algorithms for High-precision Evaluation of Hypergeometric Constants","year":2012,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Modular design; Computer science; Hypergeometric distribution; Algorithm; Constant (computer programming); Mathematics; Programming language; Statistics","score_opus":0.0966606312107324,"score_gpt":0.3442095636796171,"score_spread":0.24754893246888468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2320611135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4636906,0.0014634469,0.5331832,0.00003325039,0.00046902333,0.00060004136,0.000005998165,0.000018052986,0.0005363752],"genre_scores_gemma":[0.9101676,0.000021608634,0.08970989,0.000008091931,0.00003492305,0.000042664153,0.0000048718857,0.0000046311898,0.0000057418456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968804,0.00030108893,0.0003664637,0.00020511585,0.0020431834,0.00020376086],"domain_scores_gemma":[0.99684954,0.00028832676,0.00019983733,0.0004321035,0.00216933,0.000060866914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010324052,0.00009326182,0.0001873171,0.00059053075,0.00005280263,0.000014121699,0.00031872652,0.00007198633,0.00007476063],"category_scores_gemma":[0.0007389619,0.00007498262,0.000095773634,0.0014336734,0.000047876525,0.00044953372,0.00007351168,0.00003637,0.0000037753825],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007741653,0.00031822576,0.0013674529,0.000020828806,0.00006860453,2.6995059e-8,0.00024223693,0.00264479,0.0077250954,0.026319057,0.00009816925,0.9611878],"study_design_scores_gemma":[0.0020094577,0.00017657629,0.0676974,0.000027144302,0.00033244397,0.0000023616137,0.00006023397,0.8093257,0.081689805,0.038497597,0.00003721235,0.00014410548],"about_ca_topic_score_codex":0.000039414295,"about_ca_topic_score_gemma":0.000002674065,"teacher_disagreement_score":0.96104366,"about_ca_system_score_codex":0.000047142337,"about_ca_system_score_gemma":0.00014101133,"threshold_uncertainty_score":0.3578131},"labels":[],"label_agreement":null},{"id":"W2331953275","doi":"10.1112/s1461157000000723","title":"Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree","year":2002,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Hessian form of an elliptic curve; Elliptic Curve Digital Signature Algorithm; Supersingular elliptic curve; Elliptic curve; Tripling-oriented Doche–Icart–Kohel curve; Schoof's algorithm; Elliptic curve point multiplication; Twists of curves; Degree (music); Modular elliptic curve; Discrete mathematics; Elliptic curve cryptography; Pure mathematics; Computer science; Public-key cryptography; Quarter period; Encryption; Physics; Computer security","score_opus":0.05634830878611276,"score_gpt":0.2802508666782338,"score_spread":0.22390255789212105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2331953275","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60591614,0.00010568706,0.39297897,0.00063600513,0.000102011676,0.00006480387,0.000002213455,0.0000036458873,0.00019054212],"genre_scores_gemma":[0.9884901,0.00006782997,0.011217084,0.00019165686,0.00001507962,4.0144468e-7,2.536142e-7,0.0000030603137,0.000014530758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989538,0.000085261585,0.0004819719,0.00006937207,0.00032836382,0.00008118348],"domain_scores_gemma":[0.99821985,0.0006978202,0.0006855278,0.00020512822,0.00015434087,0.000037351765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030109024,0.00008523617,0.0002678327,0.00019284134,0.00007753781,0.00004897233,0.0003467752,0.000028631724,0.000020644367],"category_scores_gemma":[0.000049348993,0.000045276218,0.00021176864,0.00058686774,0.00007991298,0.00007555136,0.000062496954,0.00013783103,8.680702e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015401731,0.0061479956,0.03366742,0.0014804283,0.008766942,0.00007789757,0.096894905,0.44724298,0.00561746,0.2199961,0.00393876,0.17601511],"study_design_scores_gemma":[0.0004507955,0.00014630219,0.049784645,0.00020944736,0.00037595918,0.00002833047,0.0000896778,0.9427454,0.0005776261,0.0054548634,0.000051592557,0.00008534866],"about_ca_topic_score_codex":0.0000020266332,"about_ca_topic_score_gemma":0.0000027972558,"teacher_disagreement_score":0.49550244,"about_ca_system_score_codex":0.000006306305,"about_ca_system_score_gemma":0.000010329565,"threshold_uncertainty_score":0.18463106},"labels":[],"label_agreement":null},{"id":"W2336885185","doi":"10.1142/9789812772022_0013","title":"Fast arithmetic on hyperelliptic curves via continued fraction expansions","year":2007,"lang":"en","type":"book-chapter","venue":"Series on coding theory and cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Hyperelliptic curve cryptography; Hyperelliptic curve; Divisor (algebraic geometry); Fraction (chemistry); Genus; Continued fraction; Finite field; Reduction (mathematics); Irrational number; Binary number; Arithmetic; Algebra over a field; Applied mathematics; Discrete mathematics; Pure mathematics; Geometry; Computer science","score_opus":0.01934164649824088,"score_gpt":0.24803350744985506,"score_spread":0.22869186095161417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336885185","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001941627,0.0069517787,0.4313781,0.0024358928,0.003354142,0.000924193,0.000035523946,0.0007508505,0.5522279],"genre_scores_gemma":[0.5285361,0.073392965,0.03864995,0.04307419,0.0030311912,0.0002875179,0.00031647953,0.0008088219,0.3119028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978575,0.00021742856,0.00041655794,0.000794944,0.00027877523,0.00043479007],"domain_scores_gemma":[0.99741143,0.0013431804,0.00026441814,0.0007302329,0.00009491835,0.00015580135],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076822937,0.0004936307,0.0006371937,0.0005137034,0.00046903893,0.00008510471,0.0005036939,0.0005278075,0.00018416069],"category_scores_gemma":[0.00009722477,0.00043686168,0.00020123043,0.00011363369,0.0006308082,0.00019627283,0.00016457355,0.00086498074,0.00012977383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019010219,0.000046782756,0.000005174922,0.000095597934,0.00009168041,0.000111121466,0.00014285016,0.0000035977662,0.00013498834,0.94980556,0.00026524195,0.049107324],"study_design_scores_gemma":[0.0004873425,0.0013873399,0.00020033076,0.0012525049,0.00013092063,0.00042183156,0.000080812475,0.000073900046,0.00064802746,0.9372978,0.05721002,0.00080917677],"about_ca_topic_score_codex":0.0000030495269,"about_ca_topic_score_gemma":0.000014953346,"teacher_disagreement_score":0.52659446,"about_ca_system_score_codex":0.00003184998,"about_ca_system_score_gemma":0.000040028546,"threshold_uncertainty_score":0.9998083},"labels":[],"label_agreement":null},{"id":"W2340523122","doi":"10.1049/el.2015.3091","title":"Formulas for <i>p</i> th root computations in finite fields of characteristic <i>p</i>","year":2015,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Finite field; Root (linguistics); Computation; Field (mathematics); Mathematics; Algebra over a field; Physics; Pure mathematics; Discrete mathematics; Algorithm; Philosophy; Linguistics","score_opus":0.014446545973262786,"score_gpt":0.23788890088044914,"score_spread":0.22344235490718636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2340523122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19227102,0.00030585247,0.8023411,0.00450358,0.0001856408,0.00023387822,0.0000047072945,0.000041822823,0.00011236986],"genre_scores_gemma":[0.9852201,0.000012553298,0.013108945,0.0015566194,0.00003757474,0.000033508975,0.000011884865,0.000008605528,0.000010213369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989515,0.000038402235,0.00025961155,0.00022404679,0.00016416243,0.00036227453],"domain_scores_gemma":[0.99923486,0.0002613853,0.000098231,0.000278136,0.00006177141,0.00006562025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027430354,0.000111539586,0.00017993858,0.00018425706,0.000043286916,0.000040674193,0.0004504064,0.000051683295,7.725714e-7],"category_scores_gemma":[0.000053723103,0.000108422,0.00009171694,0.00047950004,0.0000354087,0.00019623456,0.00005802343,0.00016024798,0.0000030280498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044180496,0.0017144202,0.021044156,0.0005649039,0.0004061185,0.000097941425,0.017885076,0.13860376,0.03993911,0.67615616,0.03486037,0.06828617],"study_design_scores_gemma":[0.012518619,0.0032120412,0.020908907,0.00028148314,0.00012007698,0.00007835992,0.00014013643,0.6710756,0.04113354,0.18773098,0.06059838,0.0022018899],"about_ca_topic_score_codex":0.000018616318,"about_ca_topic_score_gemma":0.00011765016,"teacher_disagreement_score":0.7929491,"about_ca_system_score_codex":0.000041977008,"about_ca_system_score_gemma":0.000121250414,"threshold_uncertainty_score":0.4421321},"labels":[],"label_agreement":null},{"id":"W2343346041","doi":"10.1109/tdsc.2015.2507120","title":"Fast Software Implementations of Bilinear Pairings","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Affine transformation; Parallel computing; Computation; Exponentiation; Software; Computer engineering; Theoretical computer science; Computational science; Algorithm; Mathematics; Programming language","score_opus":0.02342511708385293,"score_gpt":0.257891111118662,"score_spread":0.23446599403480906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343346041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10013301,0.00016624066,0.8989359,0.0001642667,0.00027593327,0.000111568996,0.000010234529,0.00012114064,0.00008169716],"genre_scores_gemma":[0.9168696,0.000017181239,0.08299526,0.000060788527,0.000021809401,0.0000029919443,0.0000010793603,0.000008061454,0.00002327404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989639,0.000051626317,0.00025879723,0.00028192624,0.0002209467,0.00022278201],"domain_scores_gemma":[0.99927014,0.00014814945,0.00007867887,0.0002486716,0.00011858895,0.00013575924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025080994,0.00012701435,0.00016424104,0.00020707506,0.00024010685,0.00007323231,0.0002500259,0.000052356907,0.000008421783],"category_scores_gemma":[0.0000064976634,0.000116487354,0.000082808714,0.0004957563,0.000053298932,0.00022766889,0.00000847458,0.0001731783,0.000005669846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065980246,0.0009104686,0.00377751,0.00031289787,0.00032475212,0.00007032938,0.019404331,0.16998039,0.0015542312,0.008500684,0.0008423841,0.79425603],"study_design_scores_gemma":[0.0066378955,0.0021515158,0.0035739392,0.00054644083,0.00022342046,0.0005072047,0.0051910547,0.85223365,0.11281982,0.009503386,0.004875127,0.0017365636],"about_ca_topic_score_codex":0.00009401788,"about_ca_topic_score_gemma":0.00006264837,"teacher_disagreement_score":0.8167365,"about_ca_system_score_codex":0.000014154245,"about_ca_system_score_gemma":0.000077981895,"threshold_uncertainty_score":0.47502166},"labels":[],"label_agreement":null},{"id":"W2344960176","doi":"10.1109/rsp.2007.16","title":"Codesign of a Computationally Intensive Problem in GF(3)","year":2007,"lang":"en","type":"article","venue":"Proceedings","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of New Brunswick","funders":"","keywords":"Computer science; Field-programmable gate array; Galois theory; Computer architecture; Software; Overhead (engineering); Embedded system; Parallelism (grammar); Reconfigurable computing; Transformation (genetics); Parallel computing; Operating system; Mathematics","score_opus":0.010048995120229273,"score_gpt":0.23858888352236174,"score_spread":0.22853988840213246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344960176","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35006332,0.000206586,0.6336738,0.0014072311,0.000113211674,0.000433124,8.4551226e-7,0.00013174901,0.013970161],"genre_scores_gemma":[0.85580003,0.0000045608026,0.1439251,0.00023392799,0.0000136179515,0.000004337692,3.3321953e-7,0.0000037222887,0.000014354555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99913305,0.0000035080666,0.00025270757,0.0002045404,0.0002080911,0.00019810228],"domain_scores_gemma":[0.9992308,0.00007817272,0.000099957724,0.00005479052,0.00048965955,0.000046642388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051685894,0.00007669672,0.00012543952,0.0003056278,0.000028726381,0.00003314858,0.00034425905,0.000041901756,0.0000020040925],"category_scores_gemma":[0.000055803714,0.000069548194,0.00004113635,0.00088407594,0.000061821884,0.0002404412,0.000086481945,0.00010192502,0.000004366536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055276105,0.00022776696,0.051709056,0.000195748,0.000032735865,0.000027347898,0.014438937,0.000107137814,0.01845837,0.87822783,0.0013266065,0.035193168],"study_design_scores_gemma":[0.0026682073,0.00075320527,0.49705195,0.0005997281,0.000020337733,0.00017887577,0.002513957,0.04358974,0.0643484,0.38538,0.002058026,0.0008375778],"about_ca_topic_score_codex":0.000020760097,"about_ca_topic_score_gemma":0.000005649796,"teacher_disagreement_score":0.5057367,"about_ca_system_score_codex":0.00001577039,"about_ca_system_score_gemma":0.00003237547,"threshold_uncertainty_score":0.2836093},"labels":[],"label_agreement":null},{"id":"W2365198473","doi":"","title":"Rapidly Updating Algorithm of Primitive Root in Key Exchange Protocol","year":2010,"lang":"en","type":"article","venue":"Jisuanji gongcheng","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Alberta Paraplegic Foundation","funders":"","keywords":"Computer science; Root (linguistics); Key (lock); Prime (order theory); Key exchange; Primitive root modulo n; Protocol (science); Cryptography; Algorithm; Diffie–Hellman key exchange; Theoretical computer science; Cryptographic protocol; Public-key cryptography; Computer security; Encryption; Mathematics; Combinatorics","score_opus":0.009554392436907332,"score_gpt":0.2693930319138028,"score_spread":0.2598386394768955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2365198473","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53273576,0.00013404078,0.34619159,0.0015049165,0.0019090875,0.087216906,0.000027504442,0.00074852153,0.029531708],"genre_scores_gemma":[0.7539302,0.0000027716974,0.23057774,0.00008701855,0.00020780519,0.015098428,0.000003717014,0.000027845437,0.00006445178],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9983081,0.00010020338,0.0004286171,0.00044225994,0.00032229975,0.00039851805],"domain_scores_gemma":[0.9988332,0.00015968295,0.00020538144,0.0005781157,0.00012120328,0.00010242118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068915496,0.00019060099,0.0002717679,0.00036187423,0.000086346125,0.00007516498,0.0007912499,0.00014662968,0.00005900784],"category_scores_gemma":[0.00009767487,0.0001706988,0.00012212944,0.00096644333,0.00011630301,0.00043867715,0.0003132742,0.0005040692,0.000014749735],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037442656,0.0013007675,0.04376741,0.00042174672,0.00008035904,0.00011923729,0.009806644,0.000028437884,0.051348355,0.0879268,0.00036233268,0.80480045],"study_design_scores_gemma":[0.008320172,0.0010921693,0.6526693,0.0006028611,0.000040476007,0.00011572329,0.000827986,0.087072894,0.20536843,0.020686924,0.021161856,0.0020411736],"about_ca_topic_score_codex":0.0001128306,"about_ca_topic_score_gemma":0.00034077786,"teacher_disagreement_score":0.8027593,"about_ca_system_score_codex":0.000018182513,"about_ca_system_score_gemma":0.00008430125,"threshold_uncertainty_score":0.69608945},"labels":[],"label_agreement":null},{"id":"W2370451518","doi":"","title":"Notes on an Algorithm for Finding Primitive Roots of Finite Field F_p~2","year":2005,"lang":"en","type":"article","venue":"Journal of Sichuan University","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Finite field; Field (mathematics); Zhàng; Root (linguistics); Mathematics; Algorithm; Arithmetic; Order (exchange); Quarter (Canadian coin); Computer science; Discrete mathematics; Pure mathematics","score_opus":0.016952551524944983,"score_gpt":0.24288991624198725,"score_spread":0.22593736471704226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2370451518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2142546,0.000033693064,0.78408176,0.0009248285,0.00015145329,0.00006912547,0.000007655056,0.000010923229,0.00046598364],"genre_scores_gemma":[0.84745646,0.000025057545,0.15225291,0.00011806376,0.000106421125,3.907473e-8,4.0666404e-7,0.0000027011702,0.000037916107],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993656,0.000043190797,0.00015262277,0.00011462131,0.00017876022,0.00014518198],"domain_scores_gemma":[0.998734,0.00058610406,0.0002569725,0.00014540348,0.00018887348,0.00008864941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025775115,0.00007706757,0.00016386913,0.00029547617,0.00012560945,0.000021246375,0.0004827124,0.00005584227,0.0000069965436],"category_scores_gemma":[0.000054936067,0.00006848438,0.00017237493,0.00024171863,0.0000351421,0.0005354826,0.000060994058,0.000144483,0.0000010062118],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021987308,0.0006876311,0.0017523316,0.000026718102,0.00019670479,0.00012320836,0.002765065,0.0027563171,0.0029741907,0.032468345,0.0005517071,0.9554779],"study_design_scores_gemma":[0.017429307,0.02486554,0.24603583,0.0013280434,0.0006509269,0.0002961853,0.004987594,0.26588082,0.3655473,0.015859189,0.055024378,0.0020948919],"about_ca_topic_score_codex":0.000009456449,"about_ca_topic_score_gemma":0.000013996485,"teacher_disagreement_score":0.953383,"about_ca_system_score_codex":0.00003497457,"about_ca_system_score_gemma":0.000058958532,"threshold_uncertainty_score":0.27927122},"labels":[],"label_agreement":null},{"id":"W2375637228","doi":"","title":"A New Radix-4 Representation Based Multiple Scalar Multiplication Algorithm","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Scalar multiplication; Computer science; Elliptic curve cryptography; Elliptic Curve Digital Signature Algorithm; Algorithm; Arithmetic; Scalar (mathematics); Subtraction; Multiplication (music); Operand; Elliptic curve point multiplication; Elliptic curve; Multiplication algorithm; Floating point; Hamming weight; Mathematics; Binary number; Public-key cryptography; Hamming code","score_opus":0.014458401802857547,"score_gpt":0.2357803368942696,"score_spread":0.22132193509141207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2375637228","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011057396,0.00020386594,0.9954939,0.0015323807,0.00003904436,0.00094696635,0.000007412987,0.00051136,0.00015936134],"genre_scores_gemma":[0.03247203,0.000029626524,0.9661611,0.0005330873,0.00019469854,0.00040117308,0.00006218827,0.000018235163,0.00012790588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828297,0.000060758608,0.00035508137,0.0007337166,0.00025496897,0.0003124788],"domain_scores_gemma":[0.9983689,0.0001802735,0.00013578722,0.000961113,0.00013908866,0.00021479632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009895109,0.00020544631,0.00018428348,0.0002848371,0.0004990551,0.000117080905,0.0009969207,0.000099805045,0.00001225756],"category_scores_gemma":[0.0000018652512,0.00021113596,0.00017252643,0.0013061534,0.00007783389,0.0003656113,0.00016909692,0.00016136673,0.00020762606],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003475866,0.00026804052,0.00228031,0.000009271881,0.000029001936,0.000006451175,0.0005376724,0.0007219581,0.010836971,0.002868466,0.009611597,0.9728268],"study_design_scores_gemma":[0.002199908,0.000057475776,0.04611672,0.000020294969,0.000021701782,0.00018116922,0.0000126574305,0.49081635,0.048014086,0.0034970336,0.408413,0.0006496211],"about_ca_topic_score_codex":0.00014985699,"about_ca_topic_score_gemma":0.000007627527,"teacher_disagreement_score":0.97217715,"about_ca_system_score_codex":0.0000440077,"about_ca_system_score_gemma":0.00013542421,"threshold_uncertainty_score":0.8609875},"labels":[],"label_agreement":null},{"id":"W2376208633","doi":"","title":"A Fast Implementation of Montgomery Algorithm on ARM","year":2006,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Modular arithmetic; Multiplication (music); ElGamal encryption; Modular design; Multiplication algorithm; Algorithm; Cryptography; Key (lock); Public-key cryptography; ARM architecture; Arithmetic; Embedded system; Encryption; Mathematics; Computer security; Operating system","score_opus":0.004190091640178911,"score_gpt":0.23671421942922846,"score_spread":0.23252412778904955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2376208633","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005121371,0.000093763076,0.9931486,0.00033585145,0.000019879193,0.0004230263,0.000017391858,0.000107117616,0.0007329986],"genre_scores_gemma":[0.16214424,0.000009860521,0.8371429,0.00020363455,0.00014909953,0.00025838715,0.00003436079,0.000010311023,0.000047216898],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990595,0.000021264774,0.00027449758,0.00031378953,0.00014875192,0.00018217388],"domain_scores_gemma":[0.99935365,0.000043846892,0.00011150862,0.00038369073,0.00006974767,0.000037562982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007293343,0.00011397014,0.00011986904,0.00021260619,0.00011570944,0.000059170874,0.00049903087,0.000036708396,0.000009694177],"category_scores_gemma":[4.423869e-8,0.000109677225,0.00009614488,0.00060380134,0.000042640244,0.00011415748,0.000104785846,0.000070537084,0.00003890222],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.553268e-7,0.00030007306,0.00032296265,0.000010313273,0.000015963271,9.623434e-7,0.000137027,0.00016411372,0.0043690037,0.07526191,0.0016324213,0.9177846],"study_design_scores_gemma":[0.0029765395,0.0005829822,0.17753091,0.00006454218,0.00006781894,0.000082205865,0.00023943711,0.021726763,0.29520202,0.07707189,0.42317304,0.0012818652],"about_ca_topic_score_codex":0.00017826869,"about_ca_topic_score_gemma":0.00001975236,"teacher_disagreement_score":0.9165027,"about_ca_system_score_codex":0.000018093087,"about_ca_system_score_gemma":0.000027146643,"threshold_uncertainty_score":0.44725072},"labels":[],"label_agreement":null},{"id":"W2397122158","doi":"","title":"Setting Speed Records with the (Fractional) Multibase Non-Adjacent Form Method for Efficient Elliptic Curve Scalar Multiplication.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scalar multiplication; Precomputation; Scalar (mathematics); Elliptic curve; Complex multiplication; Jacobian matrix and determinant; Mathematics; Computer science; Generalization; Speedup; Algorithm; Arithmetic; Applied mathematics; Pure mathematics; Parallel computing; Mathematical analysis; Geometry","score_opus":0.014745225472079307,"score_gpt":0.27993204636132785,"score_spread":0.26518682088924855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397122158","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032675,0.00018621315,0.95551157,0.006895991,0.00090842805,0.0030960764,0.000087826855,0.00023335156,0.0004055687],"genre_scores_gemma":[0.048453473,0.00019193922,0.9495874,0.00046403793,0.00027196284,0.0008670871,0.000098576005,0.000058683636,0.0000068301497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995347,0.0005654396,0.0007726514,0.001827921,0.0005496099,0.0009373768],"domain_scores_gemma":[0.9927636,0.003563481,0.0008669943,0.002115919,0.0004325236,0.00025752917],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012634064,0.00070973684,0.0007672574,0.0004932049,0.00095567503,0.00016373821,0.002233513,0.00036294016,0.00001068429],"category_scores_gemma":[0.00024436682,0.0004996516,0.00064526056,0.00044304266,0.0006024614,0.000108887856,0.0019513349,0.0016495147,0.00005712834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078839535,0.0017378898,0.007554922,0.00063162955,0.0016301485,0.00016756775,0.021208668,0.4548529,0.0019498898,0.43440074,0.003010011,0.07206724],"study_design_scores_gemma":[0.001504715,0.00019991821,0.019959623,0.00018333558,0.00013910721,0.00032244125,0.00027450593,0.8815754,0.0018484335,0.089574866,0.0036022908,0.00081533974],"about_ca_topic_score_codex":0.0001794134,"about_ca_topic_score_gemma":0.00015220848,"teacher_disagreement_score":0.4267225,"about_ca_system_score_codex":0.00016460796,"about_ca_system_score_gemma":0.0005088133,"threshold_uncertainty_score":0.9997455},"labels":[],"label_agreement":null},{"id":"W2407031230","doi":"10.1145/2890502","title":"Hybrid Montgomery Reduction","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Institute for Information and Communications Technology Promotion","keywords":"Reduction (mathematics); Computer science; Multiplication (music); Arithmetic; Parallel computing; Mathematics","score_opus":0.014510141854372495,"score_gpt":0.23619975103775503,"score_spread":0.22168960918338254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407031230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038156196,0.00017345289,0.9558817,0.0012462994,0.003153365,0.00025054408,0.000004930728,0.0006987741,0.0004347336],"genre_scores_gemma":[0.9835705,0.000034147142,0.015727092,0.00005006569,0.0001776712,0.00002082884,6.1061314e-7,0.00001975857,0.00039933092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798125,0.00018584119,0.00041469617,0.00061732286,0.00038047918,0.00042041534],"domain_scores_gemma":[0.9979007,0.00030838675,0.00014191351,0.0014028948,0.000106175634,0.00013988858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038150162,0.00022649595,0.0002460691,0.00036904108,0.00042404703,0.00018206032,0.0010490845,0.00007913654,0.000015331841],"category_scores_gemma":[0.000023847753,0.00016300533,0.00019712979,0.0004795365,0.00007476739,0.0003000097,0.000023964822,0.00018412582,0.0002090822],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046658446,0.0005329768,0.000049791044,0.00009397962,0.00031057626,0.00006286274,0.0016096944,0.020431802,0.0125652375,0.016411219,0.0025384768,0.9453467],"study_design_scores_gemma":[0.024042757,0.0061424347,0.0069114175,0.01008642,0.00071469287,0.014971187,0.004794774,0.47425163,0.27588665,0.07977216,0.08989676,0.012529122],"about_ca_topic_score_codex":0.000053594755,"about_ca_topic_score_gemma":7.7537493e-7,"teacher_disagreement_score":0.9454143,"about_ca_system_score_codex":0.0000824473,"about_ca_system_score_gemma":0.00003705246,"threshold_uncertainty_score":0.6647164},"labels":[],"label_agreement":null},{"id":"W2415997389","doi":"10.1109/arith.2016.11","title":"Random Digit Representation of Integers","year":2016,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Modular exponentiation; Exponentiation; Precomputation; Modular arithmetic; Number theory; Discrete mathematics; Mathematics; Cryptography; Generalization; Scalar multiplication; Public-key cryptography; Computer science; Arithmetic; Scalar (mathematics); Algorithm; Computation; Encryption","score_opus":0.011816881338156325,"score_gpt":0.24124493902270472,"score_spread":0.22942805768454838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2415997389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032147843,0.000015081596,0.9533192,0.0011376849,0.000103252634,0.000049640108,3.017195e-7,0.000051993302,0.013175007],"genre_scores_gemma":[0.98875064,0.000019967096,0.010789324,0.000036818426,0.00000865351,0.00000224757,9.178427e-8,0.0000012457463,0.00039104332],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99959666,0.00001971752,0.00010304123,0.00011386981,0.000098444834,0.00006826348],"domain_scores_gemma":[0.99951315,0.00015835279,0.000032334487,0.00023753491,0.000034000186,0.00002460616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000046520563,0.000032399243,0.00006501643,0.00006845544,0.000015030826,0.000015604523,0.00022873888,0.0000147659775,0.00003259676],"category_scores_gemma":[0.00003898082,0.000016639371,0.00005774142,0.00024214697,0.000043840868,0.00023135735,0.000051791078,0.0000126419445,0.000015897578],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003553667,0.000065900276,0.010958446,0.000008123051,0.000037720092,0.000004669806,0.0003803529,0.000013883487,0.03443786,0.26032904,0.0021817053,0.6915468],"study_design_scores_gemma":[0.0034912585,0.00011915564,0.017487345,0.00006489247,0.000008368856,0.0000118893,0.000067999346,0.0010962719,0.903022,0.07194223,0.0024878387,0.00020076838],"about_ca_topic_score_codex":0.000021806525,"about_ca_topic_score_gemma":0.000003131841,"teacher_disagreement_score":0.95660275,"about_ca_system_score_codex":0.000002809217,"about_ca_system_score_gemma":0.000008998615,"threshold_uncertainty_score":0.06785338},"labels":[],"label_agreement":null},{"id":"W2416076575","doi":"10.1109/acssc.1995.540841","title":"An algorithm for multiplication module (2/sup n/+1)","year":2002,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multiplication algorithm; Multiplication (music); Modular arithmetic; Binary operation; Binary number; Binary tree; Very-large-scale integration; Modulo; Arithmetic; Computer science; Modular design; Reduction (mathematics); Algorithm; Parallel computing; Mathematics; Discrete mathematics; Combinatorics; Cryptography","score_opus":0.01815538533416858,"score_gpt":0.24473075452982013,"score_spread":0.22657536919565155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2416076575","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015767469,0.00008006336,0.9962901,0.0005504353,0.00007446371,0.00019329356,0.000002200087,0.00021598412,0.0010167388],"genre_scores_gemma":[0.23950893,0.000013675969,0.7598389,0.00022641082,0.000059475744,0.0000477404,0.000002589248,0.0000047456238,0.00029758032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993648,0.00001555506,0.000098112345,0.00026378396,0.00009471307,0.00016302495],"domain_scores_gemma":[0.9993528,0.000042302647,0.000022604618,0.00045569366,0.00005335547,0.00007323207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008591478,0.000066326356,0.000061354534,0.00007526016,0.00011897847,0.00008915806,0.0004403973,0.00003824083,0.000036267134],"category_scores_gemma":[0.0000052137975,0.00005515183,0.00005600856,0.00023160673,0.000020723004,0.000363398,0.000029090943,0.000033885433,0.00004282194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.9532413e-7,0.00013466619,0.000062180734,0.0000023749812,0.000005165416,4.8080784e-7,0.00020676575,0.000107002474,0.00035126187,0.030239996,0.0011509063,0.9677389],"study_design_scores_gemma":[0.00024225515,0.00008092325,0.0008667146,0.0000013753751,0.0000021136627,0.000003903044,0.000011212605,0.98740286,0.0019243016,0.0046888064,0.004679584,0.000095945594],"about_ca_topic_score_codex":0.000014412065,"about_ca_topic_score_gemma":0.0000026863709,"teacher_disagreement_score":0.98729587,"about_ca_system_score_codex":0.0000059411022,"about_ca_system_score_gemma":0.0000029885064,"threshold_uncertainty_score":0.22490264},"labels":[],"label_agreement":null},{"id":"W2467362426","doi":"10.1109/tc.2015.2481408","title":"New Architectures for Digit-Level Single, Hybrid-Double, Hybrid-Triple Field Multiplications and Exponentiation Using Gaussian Normal Bases","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Division of Administrative Services; Natural Sciences and Engineering Research Council of Canada","keywords":"Exponentiation; Mathematics; Arithmetic; Multiplication (music); Finite field; Multiplier (economics); Discrete mathematics; Combinatorics","score_opus":0.058153709370258044,"score_gpt":0.2651781174924571,"score_spread":0.20702440812219908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2467362426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07182157,0.00004408283,0.92563695,0.0008686383,0.0009774885,0.0004069808,0.000030110657,0.00017112245,0.0000430637],"genre_scores_gemma":[0.7675559,0.0000035748133,0.23199344,0.00028489492,0.00007924903,0.00002399283,0.0000038275966,0.000012945033,0.00004220006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872464,0.000038700713,0.00026461695,0.0004484145,0.00022649605,0.00029716035],"domain_scores_gemma":[0.998863,0.0002862863,0.00008708987,0.0004007332,0.00008273153,0.0002802023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000096963005,0.00020409375,0.00017659814,0.00038948967,0.0003403891,0.0002633958,0.00036464946,0.0000455981,0.0000028261327],"category_scores_gemma":[0.0000067948235,0.00020139937,0.00014933111,0.00033958844,0.000045623005,0.00027629422,0.000008951553,0.00014835593,0.0000027671208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028281144,0.00051700906,0.00017440457,0.000055534754,0.00019803345,0.000015153978,0.0013721975,0.2979273,0.0020740945,0.0007201683,0.0030778279,0.69358546],"study_design_scores_gemma":[0.005267702,0.00070991105,0.0008391337,0.00012325465,0.00010295596,0.0002455485,0.000054321135,0.78885,0.19957832,0.0022034228,0.0013041275,0.00072128716],"about_ca_topic_score_codex":0.00032889313,"about_ca_topic_score_gemma":0.00008780674,"teacher_disagreement_score":0.6957343,"about_ca_system_score_codex":0.000042405023,"about_ca_system_score_gemma":0.000108868866,"threshold_uncertainty_score":0.82128274},"labels":[],"label_agreement":null},{"id":"W2515270739","doi":"10.1112/s1461157016000358","title":"Fast heuristic algorithms for computing relations in the class group of a quadratic order, with applications to isogeny evaluation","year":2016,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Ideal class group; Isogeny; Ideal (ethics); Prime (order theory); Quadratic equation; Heuristic; Group (periodic table); Elliptic curve; Prime ideal; Order (exchange); Class (philosophy); Bounded function; Computation; Endomorphism; Discrete mathematics; Algorithm; Algebraic number field; Pure mathematics; Mathematical optimization; Combinatorics; Computer science","score_opus":0.03062737945523717,"score_gpt":0.31242767587510234,"score_spread":0.28180029641986515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515270739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0284449,0.000092698785,0.96942055,0.0013406095,0.000039510982,0.00059983897,0.000001982049,0.0000071483,0.000052748583],"genre_scores_gemma":[0.5510712,0.000006464572,0.44884077,0.00004037791,0.000018743487,0.000015563113,6.199329e-7,0.0000036589915,0.0000025979755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887156,0.00008773126,0.0004969212,0.00010242695,0.0003407805,0.0001005983],"domain_scores_gemma":[0.9979029,0.0010224975,0.00042031825,0.00013419193,0.00047582586,0.000044237306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001118387,0.00008123456,0.0001743622,0.00023103117,0.00009592571,0.000055710057,0.00023808856,0.000027250138,0.0000010569951],"category_scores_gemma":[0.000112634894,0.00004393622,0.000043272317,0.0005779553,0.00004762401,0.00015604161,0.000024446223,0.00006141156,8.390064e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045263565,0.0010496146,0.00077987654,0.00037882803,0.00014605072,0.00000451963,0.027567375,0.052806552,0.0013601799,0.42407447,0.0003532278,0.49143404],"study_design_scores_gemma":[0.002205137,0.00074852945,0.004979537,0.00051091315,0.000112716014,0.00020440732,0.0014939483,0.81700087,0.00008167927,0.17226484,0.00022238695,0.00017504142],"about_ca_topic_score_codex":0.000001324739,"about_ca_topic_score_gemma":0.000010646305,"teacher_disagreement_score":0.7641943,"about_ca_system_score_codex":0.000017965205,"about_ca_system_score_gemma":0.00006754802,"threshold_uncertainty_score":0.1791667},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01393316525482611,"score_gpt":0.27001902244374476,"score_spread":0.25608585718891863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2539629874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042206363,0.00009877782,0.98082787,0.000799798,0.0008079963,0.014633627,0.000013747343,0.000101763944,0.0022943553],"genre_scores_gemma":[0.5453597,0.00009713359,0.43531346,0.004698457,0.002663476,0.01072101,0.000021370293,0.0002846691,0.00084076205],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99584144,0.00006451722,0.0006487802,0.0014373433,0.0012936954,0.00071422744],"domain_scores_gemma":[0.99742067,0.00034265438,0.00039796744,0.0014176989,0.0002422006,0.00017881417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000745255,0.0005484749,0.00052488863,0.001342435,0.00026645645,0.00022062635,0.0024495204,0.00025816125,0.00008675128],"category_scores_gemma":[0.000024052773,0.0004137123,0.00025330018,0.00070846255,0.00074109127,0.0002218915,0.0008551044,0.0004315421,0.000027939115],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002568382,0.00016057071,0.00010934163,0.0001949102,0.000026472984,0.000059058206,0.002924343,0.003506362,0.0011887816,0.036234263,0.000041731353,0.9555285],"study_design_scores_gemma":[0.011683002,0.011769901,0.005156423,0.008912511,0.00014263931,0.00032890897,0.000015751151,0.2510349,0.22692646,0.43554777,0.040678266,0.0078034583],"about_ca_topic_score_codex":0.000028155395,"about_ca_topic_score_gemma":0.000065883694,"teacher_disagreement_score":0.947725,"about_ca_system_score_codex":0.00020369465,"about_ca_system_score_gemma":0.00034124719,"threshold_uncertainty_score":0.9998315},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011949296503273333,"score_gpt":0.20636200506367383,"score_spread":0.1944127085604005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2540113050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09946921,0.0023279453,0.87744,0.00700251,0.0048634843,0.0018741175,0.00021513883,0.00083447056,0.005973148],"genre_scores_gemma":[0.9973881,0.00055812026,0.000060124552,0.001570147,0.000060198414,0.00009147884,0.0000014475318,0.00003368815,0.00023666817],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99724746,0.00030594826,0.00039445204,0.00083854265,0.00072416215,0.00048941764],"domain_scores_gemma":[0.9979216,0.00054889923,0.00012460184,0.0009969717,0.000097835575,0.0003101287],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037917428,0.00041099358,0.00039809963,0.0007287421,0.00052282546,0.00018231958,0.00048347717,0.00017713805,0.000027841623],"category_scores_gemma":[0.000015167875,0.0002702254,0.00038408168,0.0006329477,0.00021147741,0.00018819273,0.0000020831617,0.000242406,0.0000664332],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056034495,0.0044142953,0.00025195323,0.0020610616,0.0014684085,0.00035095107,0.0019590843,0.02933347,0.19748393,0.16890776,0.003138822,0.59006995],"study_design_scores_gemma":[0.044906896,0.08298218,0.036753416,0.080577955,0.0021710708,0.0013389183,0.003634994,0.12579687,0.4521087,0.008788543,0.13952556,0.021414878],"about_ca_topic_score_codex":0.00003061835,"about_ca_topic_score_gemma":0.000009874474,"teacher_disagreement_score":0.89791894,"about_ca_system_score_codex":0.000046652705,"about_ca_system_score_gemma":0.00006761361,"threshold_uncertainty_score":0.99997497},"labels":[],"label_agreement":null},{"id":"W2543679212","doi":"10.1109/icm.2007.4497662","title":"A high-speed, low-area processor array architecture for multiplication over GF(2m)","year":2007,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Architecture; NIST; Multiplication (music); Computer science; Cryptography; Arithmetic; Parallel computing; Algorithm; Mathematics; Combinatorics; Speech recognition","score_opus":0.009597401631931795,"score_gpt":0.24306651547075303,"score_spread":0.23346911383882124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2543679212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0604283,0.000067958186,0.93643075,0.0012663462,0.000176124,0.0005011975,0.0000036203144,0.0002315941,0.0008940798],"genre_scores_gemma":[0.76652664,0.000004122286,0.23245169,0.0005917877,0.00011257743,0.000029120745,0.000006323984,0.000010281842,0.0002674578],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987602,0.000011603969,0.00021600377,0.00043005068,0.00022344268,0.00035868934],"domain_scores_gemma":[0.9990333,0.00019978556,0.00007785351,0.00046365007,0.00011315048,0.00011226222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002987486,0.00014950182,0.00013465372,0.0001926971,0.0001534783,0.00010187532,0.00057413714,0.00009195014,0.000017171396],"category_scores_gemma":[0.000042200183,0.00011111801,0.00011617461,0.00056849205,0.000050024213,0.00019065454,0.000058819485,0.000113737566,0.000013117549],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032261686,0.0012858515,0.004823999,0.00049087266,0.00018516993,0.00002079808,0.0058908523,0.0017928262,0.22082837,0.3070684,0.0064902455,0.45079997],"study_design_scores_gemma":[0.006226684,0.0006994117,0.10761418,0.00018114959,0.000063228406,0.000084695246,0.00018665439,0.02786576,0.66627437,0.14095426,0.04801489,0.0018347414],"about_ca_topic_score_codex":0.000045327648,"about_ca_topic_score_gemma":0.00012282895,"teacher_disagreement_score":0.7060983,"about_ca_system_score_codex":0.000017136646,"about_ca_system_score_gemma":0.000031581512,"threshold_uncertainty_score":0.4531261},"labels":[],"label_agreement":null},{"id":"W2544450317","doi":"10.1109/acssc.2006.355051","title":"A Serial-In Parallel-Out Multiplier Using Redundant Representation For A Class of Finite Fields","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Multiplier (economics); Finite field; Computer science; Basis (linear algebra); Parallel computing; Architecture; Representation (politics); Parallel architecture; Arithmetic; Mathematics; Computational science; Discrete mathematics; Geometry","score_opus":0.03088204109008269,"score_gpt":0.2877318116179456,"score_spread":0.2568497705278629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2544450317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14172648,0.00003639545,0.85658216,0.00029877046,0.00017150298,0.00024045401,0.0000014973963,0.000028759954,0.00091399386],"genre_scores_gemma":[0.7635236,0.0000035120463,0.23620668,0.000040075414,0.000037715694,0.000013859417,0.0000020950172,0.0000033824442,0.00016908228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921894,0.0000321639,0.00026041293,0.0002208725,0.00010626195,0.000161349],"domain_scores_gemma":[0.9994154,0.00018263697,0.00007616322,0.00025870232,0.00004704519,0.000020031954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014550587,0.000069851194,0.00012859612,0.0001412749,0.000042755608,0.000040359853,0.00020156085,0.000061314546,0.0000057922393],"category_scores_gemma":[0.000027403388,0.000060043447,0.00008842711,0.000285979,0.00003110944,0.00016391517,0.00005555138,0.000044325094,0.0000010151355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045383873,0.0012515783,0.034648087,0.00030955835,0.00010044334,0.00005698579,0.0067753517,0.4141023,0.1119494,0.39463606,0.003092789,0.032623615],"study_design_scores_gemma":[0.0017207625,0.00009882353,0.013351043,0.00004570792,0.000010478332,0.0000041328185,0.00008369687,0.9215483,0.020467004,0.04183714,0.00062608364,0.00020683304],"about_ca_topic_score_codex":0.000730388,"about_ca_topic_score_gemma":0.0006243358,"teacher_disagreement_score":0.62179714,"about_ca_system_score_codex":0.000010238546,"about_ca_system_score_gemma":0.00002902941,"threshold_uncertainty_score":0.24485007},"labels":[],"label_agreement":null},{"id":"W2546167071","doi":"10.1109/ispacs.2005.1595443","title":"Low power design techniques for a Montgomery modular multiplier","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Multiplier (economics); Modular design; Computer science; FLOPS; Baud; Computation; Power consumption; Electronic engineering; Computer architecture; Power (physics); Parallel computing; Engineering; Telecommunications; Algorithm","score_opus":0.012000809405488297,"score_gpt":0.2344121181239623,"score_spread":0.22241130871847398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546167071","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014670871,0.00014929498,0.9949317,0.0010573351,0.00006850401,0.00044587156,8.717572e-7,0.00042291256,0.0014563969],"genre_scores_gemma":[0.36558312,0.000010376831,0.63350433,0.00048761585,0.000037255562,0.00007654257,3.1734265e-7,0.0000068371364,0.00029363815],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999115,0.00002553066,0.00015230673,0.0003033079,0.00013748204,0.00026639577],"domain_scores_gemma":[0.99929357,0.000106456435,0.000031954547,0.00043062487,0.000064175125,0.000073240626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024673683,0.00011742687,0.00011588085,0.00015062137,0.00010265189,0.000089635956,0.00049856503,0.00007114262,0.000021188298],"category_scores_gemma":[0.000017505005,0.0000913493,0.00012330976,0.00025060514,0.000035980414,0.00033788162,0.00008504249,0.00006248636,0.000023933106],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004929842,0.00081010076,0.00015060692,0.000035269288,0.0001015672,0.00001564631,0.0012135457,0.0018784729,0.044590246,0.14079711,0.02054117,0.789817],"study_design_scores_gemma":[0.0008152496,0.00041467662,0.0010956568,0.000037152113,0.000013214941,0.000023323948,0.000032903998,0.32408917,0.5895687,0.019959185,0.06329492,0.00065587007],"about_ca_topic_score_codex":0.000005512979,"about_ca_topic_score_gemma":0.0000033531423,"teacher_disagreement_score":0.7891611,"about_ca_system_score_codex":0.0000138297,"about_ca_system_score_gemma":0.000023248895,"threshold_uncertainty_score":0.37251163},"labels":[],"label_agreement":null},{"id":"W2566880782","doi":"10.1145/2967103","title":"Efficient Elliptic Curve Cryptography for Embedded Devices","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Computer science; Elliptic curve cryptography; Scalar multiplication; Curve25519; Elliptic curve; Elliptic Curve Digital Signature Algorithm; Encryption; Public-key cryptography; Operand; Cryptography; Parallel computing; Arithmetic; Algorithm; Computer hardware; Operating system; Mathematics","score_opus":0.01831077850967127,"score_gpt":0.25903235993597684,"score_spread":0.24072158142630556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566880782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031309776,0.00037228275,0.9631879,0.0010792151,0.0021886204,0.00086908124,0.000020776506,0.00071879127,0.00025355845],"genre_scores_gemma":[0.9125534,0.000016826209,0.086888276,0.00022203077,0.0001126165,0.00010505909,0.0000015457283,0.000036977814,0.00006325152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968682,0.00030268432,0.00066351856,0.000933621,0.00051463366,0.00071734487],"domain_scores_gemma":[0.99575675,0.0019187407,0.00026633733,0.0015908823,0.0002520542,0.00021523506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090962317,0.0003983163,0.0004399879,0.00063329487,0.00061591325,0.00034508065,0.0016010113,0.00016307672,0.000009645215],"category_scores_gemma":[0.000060410213,0.00028408653,0.00050127803,0.0010578497,0.00011680892,0.00014911052,0.000036602156,0.00021050914,0.00008722311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024900972,0.0025019238,0.0005642452,0.0009233043,0.0014839519,0.00004451981,0.010449936,0.4152104,0.00837428,0.25556943,0.0013145306,0.30331448],"study_design_scores_gemma":[0.010393787,0.0023287244,0.0028134251,0.0037015567,0.00037113015,0.0003527384,0.0021762627,0.9356648,0.010147852,0.012525465,0.015810577,0.00371372],"about_ca_topic_score_codex":0.000027718657,"about_ca_topic_score_gemma":0.0000068068002,"teacher_disagreement_score":0.88124365,"about_ca_system_score_codex":0.00006478229,"about_ca_system_score_gemma":0.00007114372,"threshold_uncertainty_score":0.99996114},"labels":[],"label_agreement":null},{"id":"W2577487606","doi":"","title":"Faster individual discrete logarithms in non-prime finite fields with the NFS and FFS algorithms","year":2016,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; University of Calgary","funders":"","keywords":"Finite field; Discrete logarithm; Mathematics; Algorithm; Logarithm; Polynomial; Exponent; Field (mathematics); Discrete mathematics; Computer science; Pure mathematics; Mathematical analysis; Encryption","score_opus":0.010758184280191353,"score_gpt":0.23940175702582236,"score_spread":0.22864357274563102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577487606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047042515,0.0002580514,0.93968385,0.009612476,0.0005212809,0.0007761522,0.000068217596,0.00009476156,0.0019426931],"genre_scores_gemma":[0.69311637,0.00024416787,0.30500636,0.0009878713,0.00023249713,0.00032407584,0.000028747454,0.000045796216,0.000014107055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963526,0.00048730616,0.00050576887,0.0014139042,0.00041079207,0.00082964386],"domain_scores_gemma":[0.99653155,0.0013319922,0.00032279541,0.0015565997,0.00006653178,0.00019055566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006035341,0.0006077202,0.00070439297,0.0005414972,0.0002351108,0.00026565438,0.0023424113,0.00047859037,0.000022089202],"category_scores_gemma":[0.00005280334,0.00035426306,0.00020393102,0.00028400743,0.0011900964,0.00017919268,0.005505325,0.0019176478,0.000036718553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003213696,0.0003833235,0.06740982,0.00026141392,0.0013377569,0.001408142,0.040576782,0.0014753086,0.00022241512,0.72073764,0.00077627506,0.16508976],"study_design_scores_gemma":[0.0017227117,0.00035555978,0.20769615,0.00043677006,0.00008642192,0.00021489832,0.0002536288,0.011083741,0.00031756933,0.7760101,0.0008324607,0.0009899936],"about_ca_topic_score_codex":0.00012662387,"about_ca_topic_score_gemma":0.0005678638,"teacher_disagreement_score":0.6460739,"about_ca_system_score_codex":0.00002633225,"about_ca_system_score_gemma":0.0001850909,"threshold_uncertainty_score":0.9998909},"labels":[],"label_agreement":null},{"id":"W2581283014","doi":"10.1109/synasc.2016.024","title":"Parallel Integer Polynomial Multiplication","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Integer (computer science); Multiplication (music); Polynomial; Computer science; Parallel computing; Time complexity; Mathematics; Discrete mathematics; Arithmetic; Algorithm; Combinatorics","score_opus":0.01626948505440187,"score_gpt":0.25320465272860865,"score_spread":0.23693516767420678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2581283014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010379462,0.00018675724,0.9780058,0.004705391,0.0009414011,0.00024595682,0.0000037053794,0.00032978214,0.0145432325],"genre_scores_gemma":[0.78905094,0.00011045506,0.20821115,0.00045669894,0.00039376284,0.000118382406,0.000007854689,0.000015751664,0.0016349797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987256,0.00004831418,0.00022732702,0.00059506536,0.00018171172,0.00022199303],"domain_scores_gemma":[0.9985115,0.00007808351,0.00011073725,0.0011414348,0.0000699127,0.00008836329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014584958,0.00018717274,0.0001754711,0.00017715973,0.00006401313,0.00016679514,0.0013769111,0.00023030154,0.00004200221],"category_scores_gemma":[0.000017904254,0.00012331961,0.000192553,0.00011352935,0.000060454655,0.0001303631,0.0015109762,0.0002675973,0.00020120034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003587749,0.0003699206,0.0026566053,0.00013085076,0.000245542,0.000021611644,0.0011849893,0.00033926938,0.0021951834,0.5551205,0.063747324,0.3739523],"study_design_scores_gemma":[0.0035201851,0.00022237793,0.07179124,0.000757148,0.00008867203,0.000068996815,0.000052525458,0.12611711,0.01139937,0.6581588,0.12387625,0.0039473325],"about_ca_topic_score_codex":0.00006311894,"about_ca_topic_score_gemma":0.000011605511,"teacher_disagreement_score":0.78801304,"about_ca_system_score_codex":0.00002790741,"about_ca_system_score_gemma":0.00008559443,"threshold_uncertainty_score":0.5028828},"labels":[],"label_agreement":null},{"id":"W2582073004","doi":"10.1109/tvlsi.2016.2646479","title":"Digit-Level Serial-In Parallel-Out Multiplier Using Redundant Representation for a Class of Finite Fields","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Multiplier (economics); Computer science; Finite field; Representation (politics); Field (mathematics); Redundancy (engineering); Algorithm; Arithmetic; Artificial intelligence; Theoretical computer science; Discrete mathematics; Mathematics; Pure mathematics","score_opus":0.06259422336551854,"score_gpt":0.3119121623034176,"score_spread":0.24931793893789908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582073004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053137563,0.000028813152,0.94249654,0.0002554313,0.0028870134,0.0007948167,0.00013279972,0.00006003562,0.00020702025],"genre_scores_gemma":[0.9867014,0.000025712396,0.012424142,0.000028942583,0.00008644709,0.00016465825,0.00000905112,0.00001682779,0.00054278836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980679,0.00013999765,0.0006653456,0.0004917131,0.00032287656,0.00031216253],"domain_scores_gemma":[0.9981052,0.0002738611,0.00037365837,0.0009422162,0.00022405159,0.00008096814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041929775,0.00021491115,0.0003574404,0.0003458792,0.000534458,0.00041172537,0.0005652327,0.00022009072,0.000007972153],"category_scores_gemma":[0.000045436325,0.00019376214,0.00027717627,0.00021065741,0.00008607988,0.0008370454,0.0000067453416,0.00023092653,0.000008529403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015660379,0.003356496,0.0023623211,0.0008716359,0.00059632567,0.000049826354,0.023998013,0.8229853,0.06179123,0.011321822,0.0010998123,0.07000118],"study_design_scores_gemma":[0.002474392,0.00022985325,0.0013823694,0.0005852763,0.00004729572,0.000016438142,0.00081986276,0.9321227,0.060678158,0.0006261594,0.0006194253,0.00039803603],"about_ca_topic_score_codex":0.0006355853,"about_ca_topic_score_gemma":0.001992174,"teacher_disagreement_score":0.9335639,"about_ca_system_score_codex":0.00007967518,"about_ca_system_score_gemma":0.00007887036,"threshold_uncertainty_score":0.7901391},"labels":[],"label_agreement":null},{"id":"W2584805892","doi":"10.1109/icassp.1985.1168328","title":"Complex digital signal processing using quadratic residue number systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Residue number system; Quadratic residue; Quadratic equation; Residue (chemistry); Digital signal processing; Binary number; Arithmetic; Computer science; Moduli; Digital filter; Multiplication (music); Signal processing; Algorithm; Mathematics; Computer hardware; Filter (signal processing); Combinatorics","score_opus":0.031636647261868225,"score_gpt":0.2703395292272513,"score_spread":0.23870288196538308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2584805892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027678035,0.00019744839,0.95346653,0.00047360142,0.00007888255,0.00015739667,0.0000015250669,0.00028747285,0.017659102],"genre_scores_gemma":[0.9419135,0.0000012109373,0.057460926,0.00014269588,0.00015983771,0.0000039801835,0.0000015480095,0.000010024348,0.0003063052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986687,0.00004037008,0.0002915349,0.00033516815,0.0003282281,0.0003360501],"domain_scores_gemma":[0.99937195,0.00006048099,0.0000822122,0.00028889088,0.00008197514,0.000114505114],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00014095377,0.00015411267,0.00017389658,0.00009547375,0.00025340353,0.0011377794,0.00050654996,0.00005559261,0.000083894505],"category_scores_gemma":[0.000005652275,0.0001238563,0.0000762036,0.0004927662,0.00007402835,0.0010019627,0.00013555725,0.00010666615,0.00017836975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037737995,0.0012129722,0.029843155,0.00063726614,0.0002120216,0.00022037857,0.0047273273,0.052595172,0.006825481,0.25607762,0.011526839,0.636084],"study_design_scores_gemma":[0.000265675,0.000024154586,0.0016089075,0.00007388865,0.000008619011,0.00024270653,0.00012959477,0.990215,0.00026305433,0.00081863924,0.006044631,0.00030514778],"about_ca_topic_score_codex":0.00007025744,"about_ca_topic_score_gemma":0.00001143724,"teacher_disagreement_score":0.9376198,"about_ca_system_score_codex":0.000034285902,"about_ca_system_score_gemma":0.000067079454,"threshold_uncertainty_score":0.99989915},"labels":[],"label_agreement":null},{"id":"W2594864105","doi":"10.1007/s13389-017-0154-9","title":"Montgomery reduction within the context of residue number system arithmetic","year":2017,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Residue number system; Arithmetic; Computer science; Reduction (mathematics); Cryptography; Implementation; Context (archaeology); Parallel computing; Theoretical computer science; Mathematics; Algorithm; Programming language; History","score_opus":0.00809598719957067,"score_gpt":0.21958840218044023,"score_spread":0.21149241498086957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594864105","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7149822,0.0017083219,0.2776663,0.0010103367,0.0036891417,0.00021696239,0.0000018861267,0.00008504164,0.00063976797],"genre_scores_gemma":[0.9780057,0.0000994313,0.02163947,0.000010218752,0.00022021693,0.000003906322,9.1412815e-8,0.000015054649,0.0000059260997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99826556,0.000065701526,0.00074482267,0.00016984653,0.0005240687,0.00023001018],"domain_scores_gemma":[0.9974744,0.00012554791,0.0011040439,0.0008920212,0.00028888235,0.00011514686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012402178,0.00018276078,0.00038279864,0.00040800738,0.00030398482,0.0002551045,0.0015625072,0.00009611802,0.0000019387387],"category_scores_gemma":[0.00014432851,0.0001237253,0.00038099338,0.0004603485,0.00017442284,0.00070356956,0.00013200687,0.00046658807,0.0000016735534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013302789,0.00028529658,0.021863865,0.0009104707,0.0014148583,0.00032527538,0.0055279587,0.018845076,0.03788568,0.89632505,0.00062656985,0.015856883],"study_design_scores_gemma":[0.009871125,0.0020033275,0.61738867,0.01019161,0.0013049108,0.021286367,0.011631976,0.15896873,0.1368592,0.022986645,0.004250376,0.0032570555],"about_ca_topic_score_codex":0.00005951328,"about_ca_topic_score_gemma":0.0000052568894,"teacher_disagreement_score":0.8733384,"about_ca_system_score_codex":0.000023646868,"about_ca_system_score_gemma":0.000062094834,"threshold_uncertainty_score":0.5045371},"labels":[],"label_agreement":null},{"id":"W2602778734","doi":"10.1145/3145573","title":"Simultaneous Conversions with the Residue Number System Using Linear Algebra","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Agence Nationale de la Recherche","keywords":"Residue number system; Linear algebra; Matrix multiplication; Multiplication (music); Residue (chemistry); Mathematics; Algorithm; Matrix (chemical analysis); Computer science; Arithmetic; Algebra over a field; Combinatorics; Pure mathematics; Chemistry","score_opus":0.01572939922200747,"score_gpt":0.2522958969816194,"score_spread":0.23656649775961194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602778734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02188093,0.000009851106,0.9759408,0.0011877478,0.000116110976,0.00027167934,0.000008006294,0.0004350803,0.00014977717],"genre_scores_gemma":[0.52193534,0.0000015019539,0.47765592,0.00021939512,0.000045735746,0.000014471104,4.386511e-7,0.000016572192,0.00011061957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998592,0.00009577699,0.0002171257,0.0003564449,0.0004074319,0.0003311921],"domain_scores_gemma":[0.99701387,0.001434057,0.000065113425,0.0011879202,0.00015937188,0.00013969954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018339402,0.00019988831,0.00020597904,0.00007303964,0.0008996797,0.000112616515,0.0009814418,0.00010282349,0.00016777497],"category_scores_gemma":[0.00009166119,0.0001163854,0.00012874695,0.00071238,0.00035562666,0.00017266063,0.000031080457,0.0002830983,0.00052210497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012276107,0.0075062276,0.0013542308,0.0043172864,0.004181476,0.0023539849,0.051596344,0.06478869,0.0015217512,0.3848861,0.0016738243,0.47459248],"study_design_scores_gemma":[0.0058377315,0.0032665278,0.0005340512,0.003880843,0.0016024183,0.0063618943,0.0076822992,0.63716274,0.026980676,0.2944157,0.008132004,0.0041431184],"about_ca_topic_score_codex":0.000020821513,"about_ca_topic_score_gemma":0.000012510973,"teacher_disagreement_score":0.57237405,"about_ca_system_score_codex":0.000044786524,"about_ca_system_score_gemma":0.000059505222,"threshold_uncertainty_score":0.69197},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009965248540184131,"score_gpt":0.22313860050535797,"score_spread":0.21317335196517384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604763720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032761306,0.0007316394,0.990353,0.0020603158,0.0018114436,0.0003835882,0.000031188887,0.00021543693,0.0040857615],"genre_scores_gemma":[0.7947944,0.000027064676,0.20061602,0.0034387491,0.00065182074,0.000009273769,0.000023181738,0.000071803835,0.00036770347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955565,0.000026113603,0.00039437306,0.0018394965,0.0013602305,0.00082329387],"domain_scores_gemma":[0.99609035,0.00046712055,0.00027064417,0.002582038,0.00034274743,0.00024711745],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004746626,0.0007121561,0.00058088504,0.0013507063,0.00074170344,0.0022448003,0.0051759216,0.0005390129,0.000018138413],"category_scores_gemma":[0.00020728375,0.00060024665,0.00038107592,0.00035999433,0.0014142834,0.0009483815,0.0010108288,0.0012697853,0.000053637334],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000831718,0.0003018228,0.0003376425,0.00019209832,0.000083730236,0.0015293268,0.0017392308,0.024328306,0.0015292715,0.09698766,0.00011551812,0.8727722],"study_design_scores_gemma":[0.00071869773,0.0009870407,0.00041495566,0.0012617421,0.000018305422,0.00011383578,4.4924795e-7,0.81819445,0.0020516377,0.17024173,0.0043022092,0.0016949482],"about_ca_topic_score_codex":0.000012649912,"about_ca_topic_score_gemma":0.000017790955,"teacher_disagreement_score":0.8710773,"about_ca_system_score_codex":0.000138705,"about_ca_system_score_gemma":0.0006719258,"threshold_uncertainty_score":0.9996449},"labels":[],"label_agreement":null},{"id":"W2614842594","doi":"10.1109/tcsi.2017.2691353","title":"Scalable and Unified Digit-Serial Processor Array Architecture for Multiplication and Inversion Over GF( $2^{m}$ )","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Scalability; Parallel computing; GF(2); Ranging; Critical path method; Computer hardware; Algorithm; Finite field; Mathematics","score_opus":0.01575748084390703,"score_gpt":0.22977290943341921,"score_spread":0.2140154285895122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614842594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2879997,0.00037580117,0.70851517,0.0007762754,0.00070568215,0.0010557557,0.00003505207,0.000096190255,0.0004403742],"genre_scores_gemma":[0.9988775,0.00014226949,0.0005410458,0.0000483009,0.00005263028,0.00007551018,0.0000014702534,0.000011974619,0.00024926403],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99894065,0.000040765455,0.00017316507,0.00047273145,0.00016561395,0.00020704872],"domain_scores_gemma":[0.99911135,0.000088097746,0.00011686543,0.00045998706,0.000052025924,0.00017166493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017904596,0.00016669118,0.00020455412,0.00012385455,0.0010699751,0.0006011304,0.00022958773,0.00012989203,9.383519e-7],"category_scores_gemma":[0.000013895377,0.00013665002,0.000057873116,0.0000855413,0.00017981832,0.00034634117,0.000003946844,0.00010966536,4.915296e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015317221,0.000257257,0.0007713295,0.0014299881,0.0003010116,0.0000078167495,0.0043507623,0.0019438975,0.31347886,0.007898431,0.00016479398,0.6692427],"study_design_scores_gemma":[0.05346865,0.006133286,0.100225784,0.00565911,0.0014114839,0.0014668738,0.0046462147,0.25940442,0.39915526,0.01849564,0.14089411,0.009039151],"about_ca_topic_score_codex":0.00007897075,"about_ca_topic_score_gemma":0.000052941603,"teacher_disagreement_score":0.71087784,"about_ca_system_score_codex":0.000013084203,"about_ca_system_score_gemma":0.00003174701,"threshold_uncertainty_score":0.8229491},"labels":[],"label_agreement":null},{"id":"W2626220413","doi":"","title":"Random Number Generators Based on Linear Recurrences in F 2 w","year":2003,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Random number generation; Mathematics; Finite field; Computation; Integer (computer science); Pseudorandom number generator; Field (mathematics); Implementation; Discrete mathematics; Algorithm; Arithmetic; Computer science; Pure mathematics; Programming language","score_opus":0.007120415479881766,"score_gpt":0.21636412026788557,"score_spread":0.2092437047880038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626220413","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72208375,0.00040982745,0.2620774,0.0014094216,0.00129158,0.000301317,0.0000032228447,0.00017980751,0.0122436695],"genre_scores_gemma":[0.911923,0.000052057625,0.08710085,0.000780835,0.00005988307,0.000019825084,0.0000017729482,0.00000812722,0.000053637887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987077,0.00024658363,0.00019331477,0.00034669213,0.00023313815,0.0002725317],"domain_scores_gemma":[0.9992782,0.00021518236,0.000049242015,0.000340791,0.000028903534,0.00008771859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038981068,0.00014774852,0.00017060284,0.00018310364,0.00016651335,0.000077204146,0.00035789097,0.000112149566,0.000043034746],"category_scores_gemma":[0.00009758284,0.00012228027,0.0001047297,0.0007983956,0.00012611644,0.0001218176,0.000014271136,0.00027143437,0.00004365652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115615185,0.0006514465,0.116508365,0.000048403497,0.000046373363,0.00034015285,0.0035457525,0.0059100986,0.00023673556,0.8146292,0.0031573393,0.05481054],"study_design_scores_gemma":[0.038047545,0.0012861241,0.051947635,0.00049743266,0.00007926921,0.00021941843,0.00084311643,0.34460312,0.0546387,0.20234515,0.30013493,0.0053575616],"about_ca_topic_score_codex":0.000028306307,"about_ca_topic_score_gemma":0.000021535598,"teacher_disagreement_score":0.612284,"about_ca_system_score_codex":0.000031328967,"about_ca_system_score_gemma":0.00006147976,"threshold_uncertainty_score":0.49864444},"labels":[],"label_agreement":null},{"id":"W2742596270","doi":"10.1145/3115936.3115946","title":"Plain, and Somehow Sparse, Univariate Polynomial Division on Graphics Processing Units","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"CUDA; Division (mathematics); Computer science; Euclidean geometry; Univariate; Graphics; Parallel computing; General-purpose computing on graphics processing units; Graphics processing unit; Euclidean distance; Theoretical computer science; Computer graphics (images); Computational science; Mathematics; Artificial intelligence; Arithmetic; Machine learning","score_opus":0.029524878286307985,"score_gpt":0.25406137843469073,"score_spread":0.22453650014838275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742596270","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75356174,0.00035370665,0.21188633,0.00644241,0.0008761068,0.00035424886,0.000004914952,0.0004163246,0.02610421],"genre_scores_gemma":[0.995018,0.000044464174,0.004447503,0.00026681507,0.00004881119,0.0000018964145,7.3505265e-7,0.00000681254,0.00016498694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9990626,0.000033781198,0.000120536526,0.00034574754,0.00020629955,0.00023106216],"domain_scores_gemma":[0.9990194,0.000058187943,0.00010779125,0.0006271595,0.00007087873,0.00011662543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002263909,0.0001342076,0.00012524672,0.0001876642,0.0011025069,0.0008491347,0.00076557335,0.00007593456,0.000002501957],"category_scores_gemma":[0.00005808102,0.00010192654,0.000031691874,0.00025002283,0.00016019189,0.0006110312,0.00036246967,0.00015614516,0.000005787503],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003373817,0.00015289747,0.013813714,0.00005320908,0.000034951965,0.00007107685,0.0008499099,0.000039806433,0.0007588849,0.68457794,0.0011534751,0.29846042],"study_design_scores_gemma":[0.0030450898,0.0006878305,0.83653027,0.00040046303,0.0000340869,0.000050658924,0.00011927289,0.09824956,0.0055277254,0.044398542,0.009806855,0.0011496473],"about_ca_topic_score_codex":0.0001065481,"about_ca_topic_score_gemma":0.00004760575,"teacher_disagreement_score":0.82271653,"about_ca_system_score_codex":0.0000056565054,"about_ca_system_score_gemma":0.00005206874,"threshold_uncertainty_score":0.8479703},"labels":[],"label_agreement":null},{"id":"W2751965811","doi":"10.1109/arith.2017.37","title":"A New Multiplicative Inverse Architecture in Normal Basis Using Novel Concurrent Serial Squaring and Multiplication","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"CMC Microsystems","keywords":"Computer science; Multiplication (music); Latency (audio); Application-specific integrated circuit; Finite field; Multiplicative inverse; Stochastic computing; Multiplicative function; Normal basis; CMOS; Parallel computing; Algorithm; Computation; Inverse; Arithmetic; Mathematics; Galois theory; Computer hardware; Discrete mathematics","score_opus":0.030484989713045443,"score_gpt":0.27993473602345986,"score_spread":0.24944974631041442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751965811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3121595,0.000026164204,0.6867727,0.00043323816,0.00013470338,0.00018936822,0.0000014423665,0.000035372035,0.00024748273],"genre_scores_gemma":[0.7472949,0.0000066221132,0.2525761,0.000043546872,0.000054497898,0.0000062821646,6.0595266e-7,0.0000040351015,0.000013404279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991258,0.000021389185,0.00015945015,0.0003717199,0.000116909534,0.00020475368],"domain_scores_gemma":[0.9991518,0.000056275745,0.000119805554,0.0005259039,0.00003021325,0.00011599001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013134295,0.0001223928,0.00012881833,0.00013952793,0.00027731174,0.00026355425,0.0005403706,0.00006161807,0.0000050804492],"category_scores_gemma":[0.00005371802,0.00010609547,0.00004338453,0.00013278364,0.00008517281,0.00044675998,0.00043341276,0.00014607601,0.0000022187492],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005492257,0.00025099298,0.1185362,0.000059107682,0.000052008636,0.00000832677,0.009835309,0.0034307158,0.09178961,0.044769276,0.000043797634,0.73116976],"study_design_scores_gemma":[0.003635805,0.000063892345,0.48099354,0.00009150136,0.000013906875,0.000035530917,0.00011399453,0.49976707,0.012596529,0.0017494854,0.0005041909,0.00043456972],"about_ca_topic_score_codex":0.0022019974,"about_ca_topic_score_gemma":0.0015842991,"teacher_disagreement_score":0.7307352,"about_ca_system_score_codex":0.000020931657,"about_ca_system_score_gemma":0.000052037132,"threshold_uncertainty_score":0.43264475},"labels":[],"label_agreement":null},{"id":"W2753002193","doi":"10.1007/978-1-4939-6969-2_13","title":"Computing Elliptic Curves over $$\\mathbb{Q}$$ : Bad Reduction at One Prime","year":2017,"lang":"en","type":"book-chapter","venue":"Fields Institute communications","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Prime (order theory); Reduction (mathematics); Elliptic curve; Mathematics; Computer science; Arithmetic; Pure mathematics; Combinatorics; Geometry","score_opus":0.06468870381046503,"score_gpt":0.2950169151132916,"score_spread":0.23032821130282655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753002193","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008107331,0.022944521,0.07437879,0.009410399,0.0021621091,0.00082683243,0.00003219111,0.0005168449,0.88964725],"genre_scores_gemma":[0.15889122,0.11025779,0.19164735,0.0018453188,0.0012535506,0.000109250715,0.00080995215,0.0001733762,0.5350122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982745,0.00005476792,0.0005063587,0.0005229392,0.00035627952,0.00028517027],"domain_scores_gemma":[0.9919432,0.00014575398,0.00055667624,0.007055047,0.00017428675,0.00012503045],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00028901224,0.00034247915,0.000421289,0.00025016646,0.0017157008,0.00022855175,0.0048729875,0.00045138926,0.000084946296],"category_scores_gemma":[0.00005963065,0.00036743822,0.00029464925,0.00007031451,0.00065906247,0.0005491096,0.0032385625,0.0010101966,0.00021418341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029881764,0.00009256373,0.000019539175,0.00012729628,0.00017994373,0.000007443078,0.00053869176,0.000029212259,0.00003931053,0.96559304,0.007247644,0.026122315],"study_design_scores_gemma":[0.0004170714,0.0000929705,0.0009425312,0.0038827886,0.00022807771,0.00013130251,0.0000048731486,0.0040394287,0.000108917986,0.058100466,0.9309879,0.0010636616],"about_ca_topic_score_codex":0.000112271766,"about_ca_topic_score_gemma":0.00033322812,"teacher_disagreement_score":0.92374027,"about_ca_system_score_codex":0.00010573447,"about_ca_system_score_gemma":0.00018763506,"threshold_uncertainty_score":0.99987775},"labels":[],"label_agreement":null},{"id":"W2768096866","doi":"10.1007/978-3-319-70697-9_1","title":"Kummer for Genus One over Prime Order Fields","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Scalar multiplication; SIMD; Elliptic curve; Intrinsics; Mathematics; Scalar (mathematics); Computer science; Arithmetic; Parallel computing; Pure mathematics; Geometry","score_opus":0.02159310684091215,"score_gpt":0.26097260597280836,"score_spread":0.2393794991318962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768096866","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006283116,0.00076991436,0.9913035,0.0012579713,0.002251326,0.0006010465,0.00000797806,0.00011040355,0.0036350463],"genre_scores_gemma":[0.08044286,0.00012703796,0.9132794,0.0028148359,0.0012840169,0.000040467723,0.000008204504,0.000060868275,0.0019423174],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965913,0.00001852638,0.0004026691,0.0014866913,0.00076842314,0.00073238305],"domain_scores_gemma":[0.9965434,0.00046369404,0.00031969175,0.002183754,0.00031419794,0.00017524773],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063843664,0.0004797096,0.00053445494,0.0006690805,0.00057409075,0.0008174559,0.0042619286,0.00047738265,0.00003357175],"category_scores_gemma":[0.00012905028,0.00042740328,0.0002433839,0.00026771252,0.00076270837,0.0005304615,0.0011946119,0.0006772959,0.000025002768],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010653958,0.00005644092,0.00006230442,0.000062597486,0.00003966472,0.000045115827,0.0005184268,0.001983185,0.00009139405,0.037350442,0.0001233459,0.9596564],"study_design_scores_gemma":[0.0012637987,0.00060539506,0.0013409724,0.0008090019,0.00005282174,0.00007900984,1.02961884e-7,0.27179444,0.0040187663,0.68376327,0.0343227,0.0019497299],"about_ca_topic_score_codex":0.00004745609,"about_ca_topic_score_gemma":0.00014834563,"teacher_disagreement_score":0.9577067,"about_ca_system_score_codex":0.00008475734,"about_ca_system_score_gemma":0.0004924455,"threshold_uncertainty_score":0.9998178},"labels":[],"label_agreement":null},{"id":"W2768333611","doi":"10.1109/tcsii.2017.2695531","title":"A Fully Serial-In Parallel-Out Digit-Level Finite Field Multiplier in $\\mathbb {F}_{2^{m}}$ Using Redundant Representation","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits & Systems II Express Briefs","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Finite field; Numerical digit; Multiplier (economics); Representation (politics); Arithmetic; Mathematics; Field (mathematics); Computer science; Discrete mathematics; Pure mathematics","score_opus":0.07022816247133805,"score_gpt":0.29880330303520786,"score_spread":0.2285751405638698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768333611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13548632,0.000101014346,0.8597034,0.00025516283,0.002836532,0.0008120276,0.000038665305,0.00013034392,0.00063651626],"genre_scores_gemma":[0.99700665,0.000053690732,0.002014049,0.00007267744,0.00012565122,0.00019064816,0.0000020609195,0.000031829077,0.00050271366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968566,0.00024494555,0.0008282169,0.00092694187,0.00052833883,0.00061496894],"domain_scores_gemma":[0.9972038,0.00036987875,0.00036420426,0.0017960649,0.00010237077,0.00016364183],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042442034,0.00035126085,0.0005262651,0.0005778888,0.00091623137,0.0008603198,0.0012751564,0.0002668932,0.000010346504],"category_scores_gemma":[0.00005928535,0.00036097158,0.0002204023,0.00039726438,0.00011281952,0.0014409472,0.000025351588,0.00047884346,0.000018897228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031728172,0.002320232,0.0033979262,0.00058414537,0.00031123348,0.0009147451,0.035362147,0.75673723,0.09245426,0.003304637,0.00037685136,0.10391933],"study_design_scores_gemma":[0.023165895,0.0013990905,0.041466214,0.008927247,0.00022460519,0.0007176572,0.0024704826,0.73159975,0.17383179,0.0035712363,0.0067330063,0.005893022],"about_ca_topic_score_codex":0.004425081,"about_ca_topic_score_gemma":0.001164011,"teacher_disagreement_score":0.86152035,"about_ca_system_score_codex":0.00012287125,"about_ca_system_score_gemma":0.0001510141,"threshold_uncertainty_score":0.99988425},"labels":[],"label_agreement":null},{"id":"W2770220495","doi":"10.1007/s00025-023-02076-1","title":"Reduced Ideals from the Reduction Algorithm","year":2024,"lang":"en","type":"article","venue":"Results in Mathematics","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University of Edmonton","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Reduction (mathematics); Mathematics; Field (mathematics); Algorithm; Good reduction; Algebraic number field; Discrete mathematics; Pure mathematics; Geometry","score_opus":0.017924917517877472,"score_gpt":0.2667923829134392,"score_spread":0.24886746539556173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770220495","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05039135,0.005417064,0.9097287,0.017370943,0.0039614057,0.00084254495,0.00008870815,0.0009448785,0.011254425],"genre_scores_gemma":[0.2989765,0.0005049617,0.6992007,0.00009404707,0.00055476604,0.000039844796,0.000014497191,0.000027356578,0.00058734865],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987828,0.00006850244,0.00037504977,0.0003114042,0.0002687615,0.00019344904],"domain_scores_gemma":[0.99862444,0.00061055087,0.000054840126,0.00064889283,0.000025663654,0.000035580993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070745725,0.000113124646,0.00013048282,0.000109765926,0.0000784501,0.00030056364,0.0006427822,0.00006748169,0.0000050909607],"category_scores_gemma":[0.0001212039,0.00007109936,0.000079242396,0.0008524137,0.000058950533,0.00019186032,0.00012502886,0.00022573679,0.00007691631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010056405,0.0002878471,0.0000057981383,0.00013519607,0.0001271855,0.00016351716,0.037952814,0.00032155952,0.004108469,0.32419854,0.019619714,0.6130693],"study_design_scores_gemma":[0.00035077636,0.000038541668,0.000526399,0.0006263776,0.000020567044,0.00007582643,0.00064158347,0.32310447,0.003820597,0.66479844,0.005750725,0.0002457036],"about_ca_topic_score_codex":0.00006461045,"about_ca_topic_score_gemma":0.0000066033467,"teacher_disagreement_score":0.6128236,"about_ca_system_score_codex":0.000028284412,"about_ca_system_score_gemma":0.000046125926,"threshold_uncertainty_score":0.28993478},"labels":[],"label_agreement":null},{"id":"W2772513563","doi":"10.1016/j.ipl.2017.12.002","title":"Fast modular reduction and squaring in GF (2 m )","year":2017,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Reduction (mathematics); Modular design; Basis (linear algebra); Polynomial; Simple (philosophy); Irreducible polynomial; Discrete mathematics; Contrast (vision); Combinatorics; Computer science; Matrix polynomial; Artificial intelligence","score_opus":0.007708864062896335,"score_gpt":0.2216530982816451,"score_spread":0.21394423421874875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772513563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6509,0.00003669961,0.34320492,0.0049040546,0.00016800914,0.00007226734,1.9722415e-7,0.00006440599,0.0006494772],"genre_scores_gemma":[0.9872402,0.0000059964977,0.01231757,0.00040322376,0.000020996466,0.0000061335713,9.827536e-7,0.0000017526625,0.0000031352129],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9994812,0.000008563047,0.0001640893,0.00009478342,0.0001246861,0.00012665639],"domain_scores_gemma":[0.9995626,0.0000045109045,0.00014888667,0.00022985668,0.000026011507,0.00002811162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017578604,0.000062609986,0.00005967104,0.00019747125,0.0003848329,0.0010162626,0.0002962749,0.000029479475,4.8181477e-7],"category_scores_gemma":[0.000021664084,0.000059522135,0.000014934382,0.00010670481,0.00006670108,0.005901264,0.00008612347,0.000092076676,0.0000049384626],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005694154,0.0000137333645,0.0062268996,0.00015057914,0.000004964686,0.0000042190404,0.009754524,0.0023565078,0.0040763207,0.003327169,0.00011495714,0.97396445],"study_design_scores_gemma":[0.0017789764,0.000045937973,0.52910876,0.0005129971,0.00000998817,0.00017442992,0.00067335315,0.45198464,0.00652326,0.0052078017,0.0032819894,0.0006978616],"about_ca_topic_score_codex":0.000043595104,"about_ca_topic_score_gemma":0.0000019658892,"teacher_disagreement_score":0.97326654,"about_ca_system_score_codex":0.00001490906,"about_ca_system_score_gemma":0.000014468372,"threshold_uncertainty_score":0.97998434},"labels":[],"label_agreement":null},{"id":"W2775917193","doi":"10.1007/978-3-319-72565-9_4","title":"Side-Channel Attacks on Quantum-Resistant Supersingular Isogeny Diffie-Hellman","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Isogeny; Context (archaeology); Power analysis; Key exchange; Diffie–Hellman key exchange; Computer science; Mathematics; Public-key cryptography; Cryptography; Computer security; Elliptic curve; Pure mathematics","score_opus":0.0197582352092199,"score_gpt":0.24830911959804994,"score_spread":0.22855088438883003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775917193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005541232,0.0014205861,0.9843648,0.0016107264,0.0033428418,0.0004953629,0.000013312668,0.00023073559,0.007967484],"genre_scores_gemma":[0.90959424,0.0003518282,0.084364824,0.0028130524,0.0014306494,0.000020011537,0.000013537262,0.00013644608,0.0012754395],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942372,0.000061931314,0.0006237585,0.0024006534,0.0015435389,0.0011329113],"domain_scores_gemma":[0.99486464,0.0005605486,0.0004106244,0.0035593628,0.00024702615,0.0003577919],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009102927,0.0008818602,0.00082079764,0.0014127474,0.0011513893,0.0012777228,0.0063729933,0.0005425594,0.000018093697],"category_scores_gemma":[0.0001373272,0.0007588806,0.00043071355,0.00039333693,0.0015817658,0.00056392123,0.0015739297,0.0012564859,0.0001051775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121061625,0.0004127361,0.000107863096,0.00028632916,0.00016867423,0.002562803,0.00484003,0.030989472,0.0025020023,0.23603977,0.0003323781,0.7216369],"study_design_scores_gemma":[0.0009908858,0.0012460251,0.0010108817,0.0019807944,0.00004696365,0.00017372449,0.0000010842625,0.3022726,0.003756386,0.6785808,0.0074255294,0.002514323],"about_ca_topic_score_codex":0.0000685822,"about_ca_topic_score_gemma":0.0001636385,"teacher_disagreement_score":0.9090401,"about_ca_system_score_codex":0.00022632325,"about_ca_system_score_gemma":0.0004610859,"threshold_uncertainty_score":0.999759},"labels":[],"label_agreement":null},{"id":"W2783612059","doi":"","title":"Accelerating Poly1305 cryptographic message authentication on the z14","year":2017,"lang":"en","type":"article","venue":"Computer Science and Software Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); McMaster University","funders":"","keywords":"Computer science; Cryptography; Elliptic Curve Digital Signature Algorithm; Digital signature; Message authentication code; Throughput; Authentication (law); Parallel computing; Cryptographic protocol; Integer (computer science); Elliptic curve cryptography; Encryption; Theoretical computer science; Public-key cryptography; Algorithm; Hash function; Computer network; Programming language; Operating system; Computer security","score_opus":0.01718539514733581,"score_gpt":0.22419104829784967,"score_spread":0.20700565315051386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783612059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.158836,0.00011732913,0.83895546,0.0011299152,0.00060158665,0.00011487074,3.7830523e-7,0.00019066966,0.000053793992],"genre_scores_gemma":[0.90113676,0.000020785254,0.09849327,0.0002284655,0.00009886666,0.000010995965,1.3460875e-7,0.0000061296137,0.0000046163427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986156,0.000018389346,0.00014149654,0.0004448097,0.0004355939,0.00034409366],"domain_scores_gemma":[0.9983667,0.0002407352,0.00008180526,0.0010906415,0.00010398464,0.00011611286],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010179748,0.00014818697,0.000110477136,0.00023006208,0.0019022372,0.0019891292,0.0021147698,0.000036425845,0.0000017522221],"category_scores_gemma":[0.00035233912,0.00010327974,0.000050828257,0.00045978767,0.00031355044,0.00095446955,0.00064243475,0.00018310946,0.000005682583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020476598,0.000061884144,0.0066512516,0.000043184456,0.000030641182,0.000023058494,0.0023751366,0.0017779251,0.0028329133,0.5181808,0.00017819046,0.467843],"study_design_scores_gemma":[0.00017516935,0.00006924316,0.2938225,0.00014334674,0.0000061236724,0.000022343771,0.000010775107,0.7006101,0.0020151206,0.002264282,0.00053238537,0.00032860326],"about_ca_topic_score_codex":0.0000089016885,"about_ca_topic_score_gemma":8.031151e-7,"teacher_disagreement_score":0.74230075,"about_ca_system_score_codex":0.000014910689,"about_ca_system_score_gemma":0.000048840448,"threshold_uncertainty_score":0.99939716},"labels":[],"label_agreement":null},{"id":"W2794445524","doi":"10.1016/j.ffa.2018.10.002","title":"On isogeny graphs of supersingular elliptic curves over finite fields","year":2018,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Isogeny; Supersingular elliptic curve; Mathematics; Finite field; Elliptic curve; Schoof's algorithm; Invariant (physics); Pure mathematics; Discrete mathematics; Quarter period; Mathematical physics","score_opus":0.010066950594523047,"score_gpt":0.22809398191401584,"score_spread":0.2180270313194928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794445524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040297925,0.0017018823,0.9505438,0.0015450354,0.00012497816,0.00033909024,0.000032624903,0.0000786137,0.0053360495],"genre_scores_gemma":[0.99590963,0.0005605595,0.002131078,0.0012029888,0.000056967838,0.00004813274,0.0000075243606,0.0000060900334,0.000077035394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923646,0.000028293698,0.00018542631,0.0002780683,0.00010215355,0.00016957303],"domain_scores_gemma":[0.9987504,0.00045041283,0.0000610071,0.000596147,0.00007379509,0.000068237845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011117056,0.00012389784,0.00014657584,0.00014059848,0.00019919033,0.000037752354,0.0003871694,0.00010666258,0.00006814997],"category_scores_gemma":[0.000022478358,0.000097122975,0.00009974949,0.00050916633,0.00016408433,0.0000849844,0.000093239614,0.00013969332,0.000016328875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014666387,0.00030161496,0.00096259,0.00015120162,0.00009729325,0.0000014802126,0.0024589973,0.000051412386,0.0004929654,0.9633962,0.0027667237,0.029304884],"study_design_scores_gemma":[0.0010277526,0.0015776086,0.011447041,0.0005428561,0.00007686361,0.00001663356,0.00020139695,0.030513529,0.013016165,0.8832954,0.05737894,0.00090581574],"about_ca_topic_score_codex":0.000031708674,"about_ca_topic_score_gemma":0.000017967837,"teacher_disagreement_score":0.9556117,"about_ca_system_score_codex":0.0000023648333,"about_ca_system_score_gemma":0.000018711367,"threshold_uncertainty_score":0.396056},"labels":[],"label_agreement":null},{"id":"W2794534772","doi":"10.1007/978-3-031-58411-4_18","title":"Faster Cryptographic Hash Function from Supersingular Isogeny Graphs","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"","keywords":"Isogeny; Hash function; Cryptographic hash function; Cryptography; Computer science; Collision resistance; Cryptographic primitive; Mathematics; Cryptographic protocol; Elliptic curve; Perfect hash function; Algorithm; Pure mathematics; Computer security","score_opus":0.01086130293996169,"score_gpt":0.21196173362752196,"score_spread":0.20110043068756028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794534772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077429035,0.005544637,0.9829147,0.0008298781,0.0060932743,0.00038583748,0.000017305732,0.0004220411,0.003018037],"genre_scores_gemma":[0.5822984,0.00048280015,0.41027272,0.0041683507,0.0018011275,0.000034381555,0.000044583714,0.00018833534,0.00070930965],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99469084,0.000041965053,0.0006200568,0.00248402,0.001303282,0.00085982884],"domain_scores_gemma":[0.9971112,0.00035729568,0.00017417257,0.0018799428,0.00020993488,0.00026745515],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005819387,0.00078402966,0.0006277211,0.002631452,0.0003955795,0.0013993325,0.0031039391,0.0005637653,0.00007744348],"category_scores_gemma":[0.0000218618,0.00068845716,0.0005266684,0.002040745,0.0011750741,0.0007212589,0.0013023124,0.0013304922,0.00017105493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026913825,0.000110230154,0.00047965947,0.00014131173,0.00023302478,0.00053778203,0.0024063662,0.005166196,0.0016028762,0.29920456,0.00014534606,0.68994576],"study_design_scores_gemma":[0.00026971428,0.00025998574,0.0005940702,0.00069994386,0.00006749991,0.000054053493,6.655732e-7,0.07069656,0.00052296504,0.92121917,0.0046622446,0.0009531322],"about_ca_topic_score_codex":0.00009410571,"about_ca_topic_score_gemma":0.00017417272,"teacher_disagreement_score":0.6889926,"about_ca_system_score_codex":0.00011869483,"about_ca_system_score_gemma":0.00028342224,"threshold_uncertainty_score":0.9996373},"labels":[],"label_agreement":null},{"id":"W2797024006","doi":"10.1007/s10623-018-0484-3","title":"Secure simultaneous bit extraction from Koblitz curves","year":2018,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Randomness; Pseudorandom number generator; Computer science; Cryptography; Elliptic curve cryptography; Algorithm; Theoretical computer science; Mathematics; Encryption; Public-key cryptography; Computer security; Statistics","score_opus":0.015151713538853032,"score_gpt":0.2546843695743034,"score_spread":0.23953265603545038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2797024006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083848186,0.008434448,0.90444833,0.0007145346,0.00046013042,0.00028081657,0.000030212788,0.00038793453,0.0013953908],"genre_scores_gemma":[0.9293226,0.0022597893,0.067173295,0.0009526962,0.00022846364,0.000019202716,0.000013202385,0.000016169506,0.0000145495005],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829173,0.00012566158,0.0002631563,0.00062083825,0.00031318617,0.00038543905],"domain_scores_gemma":[0.9985637,0.00042082547,0.000111171954,0.00055063877,0.00015901208,0.00019466887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002209699,0.00025617753,0.00024674225,0.0003414725,0.00041215966,0.00029256477,0.00051458145,0.00013339477,0.00007734335],"category_scores_gemma":[0.00003593552,0.0002193935,0.0001748418,0.0011925924,0.00034044852,0.0004298375,0.00011188756,0.00019346502,0.00002846459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030004757,0.0013845648,0.027908606,0.00045051082,0.0011578598,0.0005303575,0.007393106,0.00008523072,0.07713108,0.33556917,0.03113923,0.51695025],"study_design_scores_gemma":[0.0044722846,0.004592685,0.075546786,0.001971427,0.0006173114,0.00048894546,0.0011121102,0.09494058,0.054453198,0.5213613,0.2354089,0.005034497],"about_ca_topic_score_codex":0.00019664525,"about_ca_topic_score_gemma":0.000084505176,"teacher_disagreement_score":0.8454744,"about_ca_system_score_codex":0.0000061301735,"about_ca_system_score_gemma":0.000026523945,"threshold_uncertainty_score":0.8946607},"labels":[],"label_agreement":null},{"id":"W2804755374","doi":"10.1145/3197507.3197516","title":"SoK","year":2018,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Public Works and Government Services Canada; Royal Bank of Canada","keywords":"Isogeny; Key exchange; Diffie–Hellman key exchange; Computer science; Public-key cryptography; Cryptography; Theoretical computer science; Discrete logarithm; Mathematics; Computer security; Elliptic curve; Encryption","score_opus":0.006832551474660538,"score_gpt":0.22145888996589447,"score_spread":0.21462633849123394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804755374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007682901,0.000024846717,0.8479038,0.00092424284,0.0002359857,0.000020787464,4.134779e-8,0.000155383,0.14305203],"genre_scores_gemma":[0.8951195,0.000002193209,0.10343175,0.0005236105,0.00008810506,0.0000010110837,4.5417835e-8,0.0000012213513,0.0008325827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99971217,0.0000067879405,0.000036235757,0.00009746135,0.000059433027,0.000087894216],"domain_scores_gemma":[0.999716,0.000011527084,0.0000063021657,0.00021353918,0.000023464376,0.00002919506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000047855112,0.000025983552,0.000024443361,0.00003736721,0.000058628393,0.000041756237,0.00028953317,0.000012509588,0.00009666076],"category_scores_gemma":[0.0000033468714,0.000018454832,0.000021384225,0.00021367086,0.00004599261,0.000101982776,0.00007230387,0.00001869169,0.000414157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.5203834e-7,0.000017566126,0.0006681663,8.581563e-7,0.000004160589,0.00000274576,0.0001974299,1.7994718e-7,0.0005316532,0.9036438,0.006754337,0.08817869],"study_design_scores_gemma":[0.0007261691,0.0006315239,0.08455277,0.000016234279,0.000006998148,0.000082429004,0.00006468994,0.033957995,0.098108664,0.35065565,0.43057027,0.0006266161],"about_ca_topic_score_codex":0.000009910206,"about_ca_topic_score_gemma":0.000008502251,"teacher_disagreement_score":0.88743657,"about_ca_system_score_codex":0.0000012925582,"about_ca_system_score_gemma":0.000007825298,"threshold_uncertainty_score":0.53232884},"labels":[],"label_agreement":null},{"id":"W2806079250","doi":"10.1007/s13389-018-0197-6","title":"A new class of irreducible pentanomials for polynomial-based multipliers in binary fields","year":2018,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"H2020 Marie Skłodowska-Curie Actions; European Commission","keywords":"Multiplier (economics); Modulo; Finite field; Binary number; Class (philosophy); Trinomial; Boolean function","score_opus":0.009644395364798096,"score_gpt":0.23900272574564468,"score_spread":0.22935833038084658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806079250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29667196,0.0005265203,0.70123935,0.0004775038,0.00086561684,0.00014672626,0.0000011284975,0.000021692307,0.0000495312],"genre_scores_gemma":[0.79123163,0.000025574369,0.20847514,0.000038541704,0.00021135143,0.0000033334047,2.0940122e-7,0.000011119874,0.000003089066],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986306,0.00002454506,0.0006390123,0.0001782136,0.00023417662,0.0002934747],"domain_scores_gemma":[0.99883693,0.0002737856,0.00029581794,0.00028619688,0.00015307072,0.00015416612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056891213,0.00015673069,0.00036167738,0.0014410263,0.000039903633,0.000046166424,0.00064838567,0.0001153406,0.0000078698],"category_scores_gemma":[0.000100906356,0.0001430314,0.0003514735,0.0011612495,0.00005612199,0.0002952473,0.00004719677,0.00021409462,4.3281955e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016022756,0.001367691,0.046662424,0.0012608663,0.0010458579,0.00021105073,0.006098601,0.2539329,0.5729558,0.034488045,0.014061568,0.06631294],"study_design_scores_gemma":[0.02400495,0.009275748,0.15649919,0.003223379,0.0002769888,0.0003004141,0.00040186782,0.48141316,0.2942815,0.007705373,0.020373635,0.0022437978],"about_ca_topic_score_codex":0.000024757279,"about_ca_topic_score_gemma":0.000020616431,"teacher_disagreement_score":0.49455968,"about_ca_system_score_codex":0.000022819842,"about_ca_system_score_gemma":0.00018762761,"threshold_uncertainty_score":0.5832651},"labels":[],"label_agreement":null},{"id":"W2807702307","doi":"10.1007/978-3-030-05378-9_9","title":"A Note on the Security of CSIDH","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Polynomial; Order (exchange); Discriminant; Combinatorics; Isogeny; Quadratic equation; Quantum algorithm; Quantum; Physics; Discrete mathematics; Mathematics; Computer science; Quantum mechanics; Mathematical analysis; Geometry; Abelian group","score_opus":0.012574671355258554,"score_gpt":0.2371504162932194,"score_spread":0.22457574493796084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807702307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005030993,0.00022546698,0.98918265,0.0016898805,0.0012787497,0.00032095614,0.00000520484,0.00007055901,0.0067234295],"genre_scores_gemma":[0.8318148,0.00008201459,0.16358832,0.0035353624,0.0007667645,0.000010565783,0.0000016585041,0.000037751997,0.00016276876],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970304,0.000051971554,0.00040616805,0.0010348149,0.0010078726,0.00046880182],"domain_scores_gemma":[0.9964874,0.0010410765,0.0002835867,0.0018503981,0.0002387246,0.00009884362],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010417134,0.00038302602,0.00039592828,0.000641853,0.00025537735,0.00022818353,0.0041516647,0.00024979247,0.00005221982],"category_scores_gemma":[0.000113170616,0.0002471257,0.00020819077,0.00082723773,0.0017926304,0.00019902666,0.0011189567,0.0007392777,0.00005008813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024952513,0.00014569827,0.00006063283,0.000100968835,0.000044250675,0.0001059339,0.008419335,0.0034605488,0.0003292907,0.492494,0.00038197116,0.49443242],"study_design_scores_gemma":[0.00018275967,0.00045231817,0.00017023427,0.0005365313,0.000009471064,0.000037253267,2.4406137e-7,0.114340976,0.0068759276,0.8742117,0.002689946,0.00049263],"about_ca_topic_score_codex":0.000018709712,"about_ca_topic_score_gemma":0.0000641556,"teacher_disagreement_score":0.8313117,"about_ca_system_score_codex":0.00006884241,"about_ca_system_score_gemma":0.0003126367,"threshold_uncertainty_score":0.9999981},"labels":[],"label_agreement":null},{"id":"W2887945679","doi":"10.1109/tvlsi.2018.2851958","title":"Efficient VLSI Implementation of a Sequential Finite Field Multiplier Using Reordered Normal Basis in Domino Logic","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Domino logic; Multiplier (economics); Very-large-scale integration; Finite field; CMOS; Critical path method; Computer science; Elliptic curve cryptography; Parallel computing; Arithmetic; Electronic engineering; Logic gate; Logic synthesis; Mathematics; Logic family; Algorithm; Embedded system; Engineering; Discrete mathematics; Encryption","score_opus":0.020182279273917348,"score_gpt":0.2865310725754582,"score_spread":0.2663487933015408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887945679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3084095,0.00002485095,0.6893929,0.00008660461,0.0014587367,0.00042433248,0.000042953932,0.000054505363,0.00010560186],"genre_scores_gemma":[0.9929486,0.000009090255,0.006733286,0.00008848549,0.00008801595,0.00006707644,0.000006261141,0.0000135261635,0.00004567403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976642,0.00028733088,0.00076143385,0.00047307104,0.00043350382,0.0003804332],"domain_scores_gemma":[0.99874496,0.00020586187,0.00023568337,0.00046857618,0.00026111718,0.00008378218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056867,0.00023483131,0.00030675044,0.0006797028,0.00030062036,0.0001358564,0.0003423527,0.00017865366,0.00012975372],"category_scores_gemma":[0.000010634269,0.00021226141,0.00021564562,0.0009865207,0.000084481035,0.00027407563,0.000007371506,0.00026016758,0.000028504499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001488911,0.0047776066,0.0029527408,0.00071948144,0.00061942294,0.000078139965,0.051715374,0.6525273,0.17032294,0.00735895,0.0005066279,0.106932566],"study_design_scores_gemma":[0.0020934972,0.000582711,0.00071501615,0.00025747594,0.00005560018,0.000023327822,0.002847522,0.80270195,0.1901992,0.000062374806,0.00011687489,0.0003444642],"about_ca_topic_score_codex":0.0013750613,"about_ca_topic_score_gemma":0.0026237844,"teacher_disagreement_score":0.6845391,"about_ca_system_score_codex":0.0001198492,"about_ca_system_score_gemma":0.00009631676,"threshold_uncertainty_score":0.8655769},"labels":[],"label_agreement":null},{"id":"W2890105645","doi":"10.1109/trustcom/bigdatase.2018.00228","title":"Energy Efficiency Analysis of Elliptic Curve Based Cryptosystems","year":2018,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Elliptic curve cryptography; Curve25519; Energy consumption; Supersingular elliptic curve; Computer science; Isogeny; Tripling-oriented Doche–Icart–Kohel curve; Elliptic Curve Digital Signature Algorithm; Elliptic curve; Mathematics; Algorithm; Parallel computing; Public-key cryptography; Encryption; Pure mathematics; Computer network; Engineering; Electrical engineering","score_opus":0.009287236512448725,"score_gpt":0.22773517466484577,"score_spread":0.21844793815239705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890105645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036102038,0.00012463018,0.9547399,0.00009323203,0.00019575362,0.00003892772,0.000001504824,0.00008930939,0.008614656],"genre_scores_gemma":[0.98448867,0.0000040850077,0.015221829,0.00014315872,0.00003466239,0.0000038672965,0.0000016161583,0.0000036514439,0.000098465534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987633,0.000087147164,0.00028695297,0.00032525885,0.0003087927,0.00022853147],"domain_scores_gemma":[0.99878305,0.00014301161,0.00010508758,0.0007091517,0.0001803078,0.00007937917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002749957,0.0001079107,0.0002530182,0.00081191026,0.00008980936,0.00005331171,0.0007356909,0.00005147536,0.000120636454],"category_scores_gemma":[0.000014264771,0.0000814107,0.00025467726,0.004558249,0.00014692945,0.00011035197,0.000082429215,0.00003492142,0.000016587084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015100448,0.00060949556,0.021231763,0.000045148456,0.0010449105,0.000011665646,0.0007532529,0.0029392191,0.0080664875,0.9464531,0.0006706142,0.018159224],"study_design_scores_gemma":[0.00018988477,0.00020073286,0.007566411,0.000011482877,0.00016012337,0.0000010550566,0.000020188229,0.9676604,0.021883566,0.0007128077,0.0014265814,0.00016674069],"about_ca_topic_score_codex":0.00034468825,"about_ca_topic_score_gemma":0.0001632767,"teacher_disagreement_score":0.9647212,"about_ca_system_score_codex":0.000008867653,"about_ca_system_score_gemma":0.00004845804,"threshold_uncertainty_score":0.33198318},"labels":[],"label_agreement":null},{"id":"W2896599395","doi":"10.5539/jmr.v10n6p15","title":"Traits of a RSA Modulus on $T_3$ Tree","year":2018,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Modulus; Factorization; Square root; Tree (set theory); Combinatorics; Interval (graph theory); Discrete mathematics; Algorithm; Geometry","score_opus":0.09989185292970279,"score_gpt":0.3868939548940507,"score_spread":0.28700210196434794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896599395","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7535034,0.00032726003,0.2243974,0.00228933,0.00038940186,0.00024592475,0.000002189783,0.000020715574,0.018824374],"genre_scores_gemma":[0.8986686,0.000050273928,0.100886256,0.000021181624,0.0001760966,0.0000013220629,3.1370092e-8,0.000008301597,0.0001879208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750733,0.00015963151,0.0004963328,0.00011996214,0.001424008,0.00029274228],"domain_scores_gemma":[0.9977663,0.0005593967,0.00024399681,0.00037173944,0.0009195983,0.00013893584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030961186,0.00008326368,0.00025678476,0.000754074,0.00010793292,0.00008040386,0.0012697969,0.000060869148,0.00003159163],"category_scores_gemma":[0.00043179886,0.00005657343,0.0001585577,0.00087496964,0.00026554737,0.00017403095,0.00016032392,0.00040795378,0.000035974233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018283867,0.005187451,0.00021310871,0.0007540376,0.0004381481,0.00034057454,0.02823685,0.00009132927,0.060731895,0.61982864,0.023898719,0.2600964],"study_design_scores_gemma":[0.00339071,0.012667274,0.010033383,0.001999985,0.000047009067,0.0009613292,0.0019170577,0.07089922,0.1821096,0.71030843,0.005152715,0.0005133049],"about_ca_topic_score_codex":0.0000034402383,"about_ca_topic_score_gemma":0.0000058830815,"teacher_disagreement_score":0.25958312,"about_ca_system_score_codex":0.000027316719,"about_ca_system_score_gemma":0.00015067798,"threshold_uncertainty_score":0.23596196},"labels":[],"label_agreement":null},{"id":"W2901241775","doi":"10.1109/tc.2018.2878829","title":"Faster Key Compression for Isogeny-Based Cryptosystems","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Public Works and Government Services Canada","keywords":"Isogeny; Computer science; Cryptosystem; Cryptography; Key (lock); Elliptic curve cryptography; Overhead (engineering); Compression (physics); Data compression; Key encapsulation; Theoretical computer science; Post-quantum cryptography; Public-key cryptography; Computer engineering; Key exchange; Algorithm; Mathematics; Encryption; Computer security; Elliptic curve; Physics","score_opus":0.018656392660759007,"score_gpt":0.2484637332216778,"score_spread":0.2298073405609188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901241775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005392617,0.000021111438,0.9890393,0.0006303375,0.003923111,0.00045106464,0.000016249827,0.0003373654,0.00018882145],"genre_scores_gemma":[0.860731,0.0000020980117,0.1381267,0.00085021765,0.00016401238,0.00006147756,0.0000016187552,0.000017995246,0.000044856013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984758,0.00008072023,0.0002789269,0.00052372995,0.0002723794,0.00036843607],"domain_scores_gemma":[0.9987015,0.0002705916,0.00008058713,0.0006506757,0.00014686803,0.0001497704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015756254,0.00022252467,0.00021248093,0.0003369569,0.0004906809,0.00018386821,0.0007299098,0.00010302778,0.000016610467],"category_scores_gemma":[0.000001240097,0.00019563269,0.00026898383,0.00048326058,0.00012866728,0.00023438754,0.0000040441587,0.00014377596,0.00007529681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076212257,0.0029087232,0.00013430935,0.00047015594,0.00066109514,0.000042197295,0.0052808,0.13868082,0.029745132,0.012730118,0.024068914,0.7845156],"study_design_scores_gemma":[0.001852747,0.0009915072,0.00011401266,0.00021394614,0.0000292828,0.000016456723,0.000022319487,0.8898907,0.09311724,0.0005395855,0.01275812,0.00045412983],"about_ca_topic_score_codex":0.000016975135,"about_ca_topic_score_gemma":0.000016064392,"teacher_disagreement_score":0.8553384,"about_ca_system_score_codex":0.000032558135,"about_ca_system_score_gemma":0.000053884556,"threshold_uncertainty_score":0.797767},"labels":[],"label_agreement":null},{"id":"W2911937719","doi":"10.1016/j.mejo.2019.01.011","title":"Scalable digit-serial processor array architecture for finite field division","year":2019,"lang":"en","type":"article","venue":"Microelectronics Journal","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Division (mathematics); Scalability; Array data structure; Computer science; Latency (audio); Computer hardware; Ranging; Processor array; Flexibility (engineering); Parallel computing; Arithmetic; Mathematics; Telecommunications","score_opus":0.004748547366894867,"score_gpt":0.21770633628621938,"score_spread":0.21295778891932451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911937719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13017084,0.0009701658,0.8651816,0.0021839403,0.0007312789,0.00030913507,0.000003223891,0.000058747282,0.00039105042],"genre_scores_gemma":[0.9481359,0.0001590354,0.04980463,0.0008617303,0.00039626422,0.00001567217,0.000004965196,0.000027895883,0.000593887],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99842227,0.000042666354,0.00027898053,0.0003329587,0.00024289035,0.00068025774],"domain_scores_gemma":[0.998996,0.00025404012,0.00015670276,0.00032782383,0.00013701452,0.00012838283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003227834,0.00018341132,0.00021656974,0.000192807,0.0003087294,0.0005685916,0.00093238417,0.00011342242,0.00003871528],"category_scores_gemma":[0.00007164795,0.0001439367,0.00023195024,0.0003734197,0.000021182257,0.00035454764,0.00008533053,0.00058890483,0.000028305163],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057542406,0.0005923344,0.003239761,0.00029992504,0.00034655744,0.000030208048,0.0022829857,0.007597366,0.56375265,0.018226936,0.012011369,0.39104447],"study_design_scores_gemma":[0.0046933196,0.00413589,0.0004070235,0.00024964867,0.000047242327,0.00073928246,0.000038937655,0.007954233,0.56025004,0.14307892,0.2773878,0.0010176628],"about_ca_topic_score_codex":0.0000026443163,"about_ca_topic_score_gemma":0.000010709857,"teacher_disagreement_score":0.8179651,"about_ca_system_score_codex":0.000043843716,"about_ca_system_score_gemma":0.0002554927,"threshold_uncertainty_score":0.58695686},"labels":[],"label_agreement":null},{"id":"W2942966662","doi":"10.1109/access.2019.2914641","title":"Fast Large Integer Modular Addition in GF(p) Using Novel Attribute-Based Representation","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Umm Al-Qura University","keywords":"Isogeny; Cryptography; Public-key cryptography; Computer science; Elliptic curve cryptography; Residue number system; Binary number; Integer (computer science); Key size; Post-quantum cryptography; Representation (politics); Modular arithmetic; NIST; Algorithm; Arithmetic; Theoretical computer science; Mathematics; Encryption; Elliptic curve","score_opus":0.042332366640665336,"score_gpt":0.31785105047486234,"score_spread":0.275518683834197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942966662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4568463,0.00001788571,0.5423038,0.000107799104,0.00042635223,0.00015531055,0.00001224749,0.000048734462,0.0000815883],"genre_scores_gemma":[0.99318796,0.0000025793859,0.0064314576,0.00026281283,0.000056702494,0.0000134962165,0.000022536944,0.000008757328,0.00001371591],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998773,0.000057161524,0.00022190255,0.00040533295,0.0002658497,0.00027678887],"domain_scores_gemma":[0.9991869,0.000082310406,0.00010060271,0.00049716124,0.00008448733,0.000048585174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023243098,0.00011690864,0.00015085172,0.00033584677,0.000068734116,0.00024924628,0.00070593244,0.00007761951,0.00005733252],"category_scores_gemma":[0.000019147305,0.00011168598,0.000078819496,0.0011110174,0.000022224196,0.0012614983,0.00011822851,0.00015348253,0.000030365536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010300495,0.0018681941,0.46586457,0.00025456643,0.000095466086,0.0001089146,0.001531459,0.33620095,0.16212133,0.017807188,0.0010618534,0.012982512],"study_design_scores_gemma":[0.0016700564,0.000040153893,0.12206259,0.00013102626,0.000008297562,0.0000080416185,0.000042750708,0.83650786,0.037492983,0.0014245202,0.0003070063,0.00030471114],"about_ca_topic_score_codex":0.00023872296,"about_ca_topic_score_gemma":0.00006653273,"teacher_disagreement_score":0.53634167,"about_ca_system_score_codex":0.000046722984,"about_ca_system_score_gemma":0.000049329992,"threshold_uncertainty_score":0.4554422},"labels":[],"label_agreement":null},{"id":"W2945811367","doi":"10.3390/math7050441","title":"Algorithms and Data Structures for Sparse Polynomial Arithmetic","year":2019,"lang":"en","type":"article","venue":"Mathematics","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; International Business Machines Corporation","keywords":"Division (mathematics); Remainder; Multiplication (music); Greatest common divisor; Division algorithm; Divisor (algebraic geometry); Arithmetic; Set (abstract data type); Computer science; Polynomial; Mathematics; Algorithm; Theoretical computer science; Discrete mathematics; Combinatorics","score_opus":0.03530159646975184,"score_gpt":0.28212934311564436,"score_spread":0.24682774664589252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945811367","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08788397,0.0004543763,0.9088435,0.00058693683,0.0006275293,0.0007167935,0.000054505763,0.00013664587,0.00069574156],"genre_scores_gemma":[0.14080493,0.000022044998,0.85873735,0.00012177193,0.000089707384,0.000009626473,0.0000117947775,0.000014804529,0.00018794044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990266,0.00001419843,0.00020103349,0.00036939734,0.00016629336,0.000222474],"domain_scores_gemma":[0.99840236,0.00024255525,0.000076504955,0.0011787636,0.000031059553,0.00006876781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002810025,0.00012846506,0.00019746169,0.0000930873,0.000078873905,0.00019732665,0.0010293054,0.000060209095,0.000011536412],"category_scores_gemma":[0.00005293212,0.00010170898,0.000041285766,0.00015876385,0.00005163183,0.00024267155,0.00053032377,0.000077819066,0.000017468192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023947983,0.0005400831,0.0021513088,0.0016960374,0.00032405154,0.000023257673,0.0061185937,0.000109345754,0.0027212542,0.7570256,0.015300674,0.21396585],"study_design_scores_gemma":[0.0016662469,0.0002496061,0.0032709618,0.00008124711,0.00007604903,0.00015778471,0.00026938212,0.7425558,0.0015261378,0.23452646,0.0149990525,0.00062129705],"about_ca_topic_score_codex":0.0000069095336,"about_ca_topic_score_gemma":0.000003348167,"teacher_disagreement_score":0.7424464,"about_ca_system_score_codex":0.0000054512384,"about_ca_system_score_gemma":0.000027615733,"threshold_uncertainty_score":0.4147572},"labels":[],"label_agreement":null},{"id":"W2947171605","doi":"10.5539/esr.v8n2p52","title":"A Single-Domain Implementation of the Voigt/Complex Error Function by Vectorized Interpolation","year":2019,"lang":"en","type":"article","venue":"Earth Science Research","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"York University","funders":"National Research Council Canada; York University","keywords":"Computation; Interpolation (computer graphics); Code (set theory); Set (abstract data type); Domain (mathematical analysis); MATLAB; Error detection and correction; Round-off error","score_opus":0.05350528230376324,"score_gpt":0.36125285696961434,"score_spread":0.3077475746658511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947171605","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9599929,0.000041684292,0.03663611,0.0011484007,0.00046582078,0.00053460133,0.0000031403576,0.00003144532,0.0011459399],"genre_scores_gemma":[0.9954718,0.0000020485181,0.0043407865,0.00003328509,0.000023520508,0.000009607032,0.0000014431449,0.0000037955162,0.00011373736],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9971604,0.00026560036,0.00021601682,0.00039914416,0.0015035716,0.0004553055],"domain_scores_gemma":[0.99876285,0.00013970445,0.000090347065,0.000602833,0.00032285193,0.00008138976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027722863,0.00007629436,0.000096666045,0.0004024167,0.00042459898,0.00022969405,0.001230983,0.000029830806,0.00014884808],"category_scores_gemma":[0.00006004134,0.00005298915,0.00006673039,0.0038214156,0.00056914386,0.00072895,0.0004348457,0.00020485278,0.000052333893],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011338678,0.000045110526,0.012633284,0.000010225705,0.000004293106,1.8431629e-7,0.00079172454,0.00000702069,0.96029246,0.011659352,0.00031453188,0.01423047],"study_design_scores_gemma":[0.0014149523,0.0012047711,0.7184582,0.00007373251,0.000004670096,0.000009456187,0.0022983206,0.023685925,0.23123375,0.011862686,0.0094688935,0.00028465074],"about_ca_topic_score_codex":0.00019051113,"about_ca_topic_score_gemma":0.00007552783,"teacher_disagreement_score":0.72905874,"about_ca_system_score_codex":0.00004087798,"about_ca_system_score_gemma":0.00026493476,"threshold_uncertainty_score":0.3265715},"labels":[],"label_agreement":null},{"id":"W2949160893","doi":"","title":"A double large prime variation for small genus hyperelliptic index calculus.","year":2004,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Prime (order theory); Logarithm; Genus; Variation (astronomy); Context (archaeology); Heuristic; Hyperelliptic curve cryptography; Mathematics; Algorithm; Discrete logarithm; Computer science; Combinatorics; Mathematical optimization; Mathematical analysis; Zoology","score_opus":0.020836332228812322,"score_gpt":0.25874625551600866,"score_spread":0.23790992328719635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949160893","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05427494,0.0003107579,0.93927497,0.0014443096,0.0016417507,0.0018348354,0.00007510063,0.00037253907,0.00077082234],"genre_scores_gemma":[0.35785255,0.000100162084,0.6405911,0.00033752408,0.0002866017,0.0006772987,0.000096653035,0.000052612628,0.000005507954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959502,0.00024060522,0.0007338955,0.0016799492,0.00030879,0.0010865439],"domain_scores_gemma":[0.99675834,0.00046079373,0.00056972017,0.0017402741,0.00020446352,0.00026640386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064462965,0.00061723276,0.0008575928,0.0006640134,0.00034799738,0.00022253086,0.0021852115,0.0005522723,0.000017120503],"category_scores_gemma":[0.00008931917,0.000609729,0.00065428327,0.00036218928,0.00033124743,0.00011545081,0.0029500711,0.0012860859,0.0001106658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016092083,0.00039402922,0.0012948695,0.00018992362,0.00033266767,0.00006302352,0.0037844472,0.004694772,0.00028804634,0.98364854,0.000039672108,0.005109114],"study_design_scores_gemma":[0.0027526699,0.00019479336,0.031655148,0.00012699176,0.00011288067,0.000086567255,0.000033420445,0.043180812,0.00066987454,0.91832423,0.0020871293,0.00077545823],"about_ca_topic_score_codex":0.00044465667,"about_ca_topic_score_gemma":0.0006575501,"teacher_disagreement_score":0.3035776,"about_ca_system_score_codex":0.00015364993,"about_ca_system_score_gemma":0.0007324928,"threshold_uncertainty_score":0.9996354},"labels":[],"label_agreement":null},{"id":"W2949312368","doi":"","title":"Tate pairing computation on the divisors of hyperelliptic curves for cryptosystems.","year":2005,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Pairing; Hyperelliptic curve; Mathematics; Hyperelliptic curve cryptography; Divisor (algebraic geometry); Computation; Cryptosystem; Finite field; Discrete mathematics; Pure mathematics; Algebra over a field; Cryptography; Algorithm; Computer science; Elliptic curve cryptography; Encryption; Public-key cryptography; Physics","score_opus":0.03451022781561683,"score_gpt":0.2734379639903689,"score_spread":0.23892773617475208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949312368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071588665,0.0009447354,0.9178378,0.00559602,0.0009489328,0.001694525,0.000056115743,0.00016900546,0.0011642124],"genre_scores_gemma":[0.6378699,0.00065870845,0.36005566,0.0006221481,0.00019820048,0.00050633843,0.000043814995,0.000042632524,0.0000026348391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965698,0.0006432485,0.00085265865,0.0009874001,0.00038907173,0.00055782445],"domain_scores_gemma":[0.99472976,0.003020815,0.00074189215,0.001209547,0.00018718012,0.00011081125],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009253367,0.00047839567,0.000788537,0.00042115463,0.00026326027,0.0000805353,0.0019595833,0.0002348558,0.000011294724],"category_scores_gemma":[0.00024964055,0.00035679174,0.0006040693,0.0002584847,0.00046998836,0.000081651044,0.001478758,0.0008871166,0.000038708746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004885507,0.00020959764,0.00083667005,0.0009607716,0.000322123,0.000009197997,0.00226948,0.022887865,0.00034737136,0.957289,0.0010431784,0.013775929],"study_design_scores_gemma":[0.00056279876,0.00028409963,0.00873538,0.0017304032,0.00010479722,0.000030270934,0.00011990215,0.09501117,0.0018336048,0.890059,0.0009460931,0.00058249664],"about_ca_topic_score_codex":0.000041055388,"about_ca_topic_score_gemma":0.000043979766,"teacher_disagreement_score":0.5662812,"about_ca_system_score_codex":0.000040349052,"about_ca_system_score_gemma":0.0001642938,"threshold_uncertainty_score":0.9998884},"labels":[],"label_agreement":null},{"id":"W2949753337","doi":"","title":"Weakness of F 3 6*1429 and F 2 4*3041 for Discrete Logarithm Cryptography.","year":2013,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Logarithm; Computer science; Cryptography; Embedding; Finite field; Bilinear interpolation; Discrete mathematics; Mathematics; Algorithm; Public-key cryptography; Computer security; Artificial intelligence; Encryption; Mathematical analysis","score_opus":0.011148643630385546,"score_gpt":0.25280815396348205,"score_spread":0.24165951033309652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949753337","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056403976,0.0011358785,0.9367378,0.0014549991,0.0011477831,0.0015830601,0.00015632524,0.00019210989,0.0011880712],"genre_scores_gemma":[0.12174551,0.0006810467,0.87656486,0.00014015044,0.00013495672,0.0006301035,0.000055600332,0.000045884335,0.0000018929652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960026,0.0003385808,0.00090507977,0.0015916006,0.0003302108,0.0008319226],"domain_scores_gemma":[0.9958917,0.0011235044,0.00068472914,0.0017247655,0.00027595213,0.00029938557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047636038,0.0006806711,0.00120617,0.0009053516,0.00023973263,0.00017038379,0.002102038,0.0005729261,0.000030568186],"category_scores_gemma":[0.00013686149,0.0006137051,0.0007104753,0.0003387429,0.0014293384,0.00019824269,0.004149336,0.0010126795,0.000016031569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051238647,0.00013665702,0.0042025493,0.0005052136,0.00039707933,0.000015914815,0.0014869015,0.00015384969,0.00074005866,0.9764235,0.00049635925,0.015390668],"study_design_scores_gemma":[0.0008513189,0.00023224713,0.024657793,0.0002118277,0.00010632316,0.0000617231,0.000100583675,0.008196622,0.001307829,0.9619579,0.0016494306,0.00066641625],"about_ca_topic_score_codex":0.0001752902,"about_ca_topic_score_gemma":0.0000691733,"teacher_disagreement_score":0.06534154,"about_ca_system_score_codex":0.000018555309,"about_ca_system_score_gemma":0.00019150873,"threshold_uncertainty_score":0.9996314},"labels":[],"label_agreement":null},{"id":"W2949933527","doi":"","title":"Unified Point Addition Formulæ and Side-Channel Attacks.","year":2005,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Side channel attack; Computer science; Affine transformation; Elliptic curve; Point (geometry); Cryptography; Elliptic curve point multiplication; Elliptic curve cryptography; Channel (broadcasting); Tripling-oriented Doche–Icart–Kohel curve; Arithmetic; Key (lock); Algorithm; Mathematics; Computer security; Pure mathematics; Encryption; Public-key cryptography; Geometry; Telecommunications","score_opus":0.014385521650330664,"score_gpt":0.24689157852929033,"score_spread":0.23250605687895967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949933527","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02733872,0.00059823197,0.9559648,0.004896464,0.0009984436,0.0007246148,0.00009634046,0.000402694,0.008979666],"genre_scores_gemma":[0.36498907,0.0010669362,0.6322499,0.00082496315,0.000412377,0.00024021813,0.00016002888,0.000048649184,0.000007853722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963759,0.00035437325,0.0006689302,0.0015045059,0.00031981032,0.00077647314],"domain_scores_gemma":[0.9971137,0.000586737,0.00040686334,0.0014567565,0.00012035666,0.00031556055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042337892,0.0006074932,0.0007346542,0.0006864039,0.00030365816,0.00020497938,0.0014307594,0.0005258908,0.000049658604],"category_scores_gemma":[0.000108318076,0.0005847268,0.00036446247,0.00023505521,0.0005790364,0.0002675595,0.0043297415,0.0015153182,0.00012761784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048017304,0.00016076436,0.00023271768,0.000120829776,0.00021235942,0.00014099696,0.003433922,0.0010197136,0.00026706877,0.9584372,0.0010806731,0.034845706],"study_design_scores_gemma":[0.00063867547,0.00012375387,0.017352788,0.00015819202,0.00005322178,0.00025026093,0.00010103765,0.014924937,0.00067582703,0.9629782,0.0020662292,0.0006768904],"about_ca_topic_score_codex":0.000081048645,"about_ca_topic_score_gemma":0.00023544958,"teacher_disagreement_score":0.33765036,"about_ca_system_score_codex":0.000058279118,"about_ca_system_score_gemma":0.00018381009,"threshold_uncertainty_score":0.99966043},"labels":[],"label_agreement":null},{"id":"W2950233671","doi":"","title":"Weak Fields for ECC.","year":2003,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Elliptic curve cryptography; Discrete logarithm; Elliptic curve; Schoof's algorithm; Tripling-oriented Doche–Icart–Kohel curve; Hessian form of an elliptic curve; Logarithm; Elliptic curve point multiplication; Hyperelliptic curve cryptography; Finite field; Mathematics; Cryptography; Jacobian curve; Computer science; Supersingular elliptic curve; Discrete mathematics; Pure mathematics; Mathematical analysis; Algorithm; Public-key cryptography; Quarter period; Encryption; Computer security","score_opus":0.01859423242820427,"score_gpt":0.2680903661080963,"score_spread":0.249496133679892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950233671","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00481776,0.0004520406,0.97123426,0.0032518976,0.0028914502,0.0009934034,0.000045912217,0.0002657544,0.016047522],"genre_scores_gemma":[0.030358987,0.0002166374,0.9678015,0.0007829086,0.00021127908,0.00053169864,0.000041546686,0.000035598936,0.00001983117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967681,0.00031064136,0.0005558993,0.0013597906,0.00022717264,0.0007783571],"domain_scores_gemma":[0.9967968,0.00080822455,0.0003006393,0.001759146,0.00012295673,0.00021227254],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004228296,0.00049630937,0.00068758836,0.00042308564,0.00025090823,0.00015270199,0.0022240186,0.00060594577,0.000051559167],"category_scores_gemma":[0.00016837743,0.00047498877,0.0006691888,0.00019722931,0.00033871472,0.000087870205,0.0021963995,0.0012155774,0.00008570434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002280544,0.000115454895,0.0006817626,0.00012290024,0.00018093757,0.000028428454,0.00083632366,0.0005195128,0.000093800605,0.98465854,0.0046210885,0.008118454],"study_design_scores_gemma":[0.0004918438,0.00012382116,0.002512955,0.000065681976,0.00004470859,0.000066585344,0.000034398083,0.004180206,0.00063217664,0.9722584,0.019051908,0.00053734466],"about_ca_topic_score_codex":0.00003169828,"about_ca_topic_score_gemma":0.000091967675,"teacher_disagreement_score":0.025541227,"about_ca_system_score_codex":0.000033668748,"about_ca_system_score_gemma":0.00028639362,"threshold_uncertainty_score":0.99977016},"labels":[],"label_agreement":null},{"id":"W2950520523","doi":"","title":"Analyzing the Galbraith-Lin-Scott Point Multiplication Method for Elliptic Curves over Binary Fields.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Elliptic curve; Edwards curve; Schoof's algorithm; Elliptic curve point multiplication; Mathematics; Supersingular elliptic curve; Prime (order theory); Binary number; Endomorphism; Multiplication (music); Complex multiplication; Point (geometry); Counting points on elliptic curves; Pure mathematics; Arithmetic; Discrete mathematics; Combinatorics; Geometry; Quarter period","score_opus":0.021403926248101324,"score_gpt":0.30008111093833556,"score_spread":0.2786771846902342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950520523","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008672649,0.002890171,0.9739951,0.010775861,0.0009814337,0.0018166109,0.000036603782,0.0002496686,0.0005818845],"genre_scores_gemma":[0.027888771,0.0052893492,0.9641699,0.0014029603,0.00027238583,0.00084563775,0.00008156993,0.000043751217,0.0000056361832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99585843,0.00079813827,0.00080207473,0.0015253009,0.00029033932,0.0007257099],"domain_scores_gemma":[0.99363476,0.0031052674,0.00060534134,0.0023076644,0.00017933639,0.00016760215],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096363714,0.0005696008,0.0007717808,0.00047135114,0.0005355088,0.00011951747,0.0027194666,0.00043194692,0.000023706947],"category_scores_gemma":[0.00032482305,0.00043537348,0.0008574629,0.0003927631,0.00047889454,0.00015584011,0.002782949,0.0015200996,0.000035404748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013439542,0.0004466008,0.003833326,0.0008974768,0.00092171994,0.000078758705,0.00767885,0.012472198,0.0016942744,0.9248829,0.009268431,0.037691087],"study_design_scores_gemma":[0.00065262755,0.00015618392,0.026908377,0.0004359485,0.00016206087,0.00014530883,0.000060524544,0.19848038,0.0014245367,0.7677601,0.003051628,0.0007623223],"about_ca_topic_score_codex":0.00015334478,"about_ca_topic_score_gemma":0.000083092185,"teacher_disagreement_score":0.18600819,"about_ca_system_score_codex":0.000049200247,"about_ca_system_score_gemma":0.00024739138,"threshold_uncertainty_score":0.9998098},"labels":[],"label_agreement":null},{"id":"W2950802487","doi":"","title":"Efficient Techniques for High-Speed Elliptic Curve Cryptography.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Speedup; Elliptic curve point multiplication; Curve25519; Scalar multiplication; Elliptic Curve Digital Signature Algorithm; Computer science; Hyperelliptic curve cryptography; Elliptic curve cryptography; Elliptic curve; Tripling-oriented Doche–Icart–Kohel curve; Parallel computing; Jacobian matrix and determinant; x86; Hessian form of an elliptic curve; Cryptography; Arithmetic; Algorithm; Mathematics; Public-key cryptography; Applied mathematics; Encryption; Software; Programming language; Mathematical analysis; Operating system","score_opus":0.011869446846587419,"score_gpt":0.2587890616558372,"score_spread":0.2469196148092498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950802487","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073322825,0.00036457946,0.9160516,0.0019202641,0.0032132335,0.0025667169,0.00014872414,0.0011094061,0.0013026453],"genre_scores_gemma":[0.15116237,0.00013294382,0.84711516,0.00029409217,0.00042135824,0.000705023,0.000091916685,0.000075619595,0.0000015139324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942104,0.0004334589,0.0010769016,0.0023917614,0.00053347676,0.001353971],"domain_scores_gemma":[0.9941399,0.0013138149,0.0007432008,0.0030239366,0.00038070278,0.0003984621],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0009711057,0.0010080712,0.0012713813,0.0014897557,0.00049288827,0.0003268743,0.0040475274,0.0011816174,0.000046718793],"category_scores_gemma":[0.00022894812,0.0009451796,0.0011607376,0.00058508595,0.0011767615,0.00007697586,0.004162165,0.0029685036,0.000083300954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070657814,0.00041058756,0.00064223015,0.00021923863,0.00028860618,0.00005150296,0.0010599103,0.0011311269,0.004758717,0.97878295,0.00044941859,0.012135055],"study_design_scores_gemma":[0.00062410365,0.0002649713,0.004866981,0.00017138601,0.000117996155,0.000070642214,0.000031078966,0.021793105,0.012041467,0.95619625,0.0027161178,0.0011058833],"about_ca_topic_score_codex":0.00011978594,"about_ca_topic_score_gemma":0.00010166577,"teacher_disagreement_score":0.077839546,"about_ca_system_score_codex":0.000055449043,"about_ca_system_score_gemma":0.0003608029,"threshold_uncertainty_score":0.9993317},"labels":[],"label_agreement":null},{"id":"W2950808066","doi":"","title":"Random Digit Representation of Integers","year":2016,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Numerical digit; Computer science; Arithmetic; Representation (politics); Mathematics","score_opus":0.012958764603273174,"score_gpt":0.23475191453304306,"score_spread":0.2217931499297699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950808066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020254929,0.00052992295,0.9245224,0.008244355,0.00036329817,0.00037913982,0.000025118186,0.00022163018,0.0454592],"genre_scores_gemma":[0.9219938,0.00058215717,0.07524795,0.00004682083,0.000021145705,0.00005370051,0.000063517116,0.000023774526,0.001967134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99468875,0.003127291,0.000608292,0.00079389365,0.0004956736,0.00028610058],"domain_scores_gemma":[0.99260014,0.0021029855,0.0006537182,0.0028647913,0.0016383813,0.00013995203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021812064,0.00026460848,0.00043051812,0.00034662432,0.0001649266,0.00032938985,0.0023656,0.00022785414,0.000041175586],"category_scores_gemma":[0.0011829278,0.00022763685,0.00038591647,0.00061609596,0.0003176299,0.00027773037,0.0019734881,0.0003757161,0.000020226558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045692483,0.00075784227,0.004692928,0.00032566988,0.0003023831,0.000012859003,0.013568713,0.00015515661,0.008597218,0.59801024,0.002064231,0.37146705],"study_design_scores_gemma":[0.0034575646,0.0000014059698,0.007715217,0.005842739,0.00010172975,0.000025719477,0.00014043035,0.02393421,0.7235312,0.22695288,0.007145665,0.0011512239],"about_ca_topic_score_codex":0.00041048598,"about_ca_topic_score_gemma":0.00014223017,"teacher_disagreement_score":0.9017389,"about_ca_system_score_codex":0.000045985114,"about_ca_system_score_gemma":0.00021465632,"threshold_uncertainty_score":0.9282761},"labels":[],"label_agreement":null},{"id":"W2950813750","doi":"","title":"An Elliptic Curve Trapdoor System.","year":2003,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hessian form of an elliptic curve; Jacobian curve; Key escrow; Hyperelliptic curve; Elliptic curve; Tripling-oriented Doche–Icart–Kohel curve; Hyperelliptic curve cryptography; Elliptic curve point multiplication; Discrete logarithm; Elliptic curve cryptography; Computer science; Curve25519; Elliptic Curve Digital Signature Algorithm; Key (lock); Public-key cryptography; Mathematics; Discrete mathematics; Pure mathematics; Computer security; Finite field; Encryption","score_opus":0.012113897888469415,"score_gpt":0.253571463960746,"score_spread":0.24145756607227656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950813750","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052425493,0.00071460946,0.9327263,0.0004990653,0.0030387223,0.00086646515,0.000047264148,0.0007419993,0.008940066],"genre_scores_gemma":[0.3864549,0.000147885,0.6126155,0.00023890415,0.00020231596,0.00023570324,0.000048855352,0.000053081763,0.0000028128036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940866,0.0014514107,0.00086896046,0.0020851374,0.00046129868,0.001046549],"domain_scores_gemma":[0.9951895,0.00041065572,0.0004897318,0.0032793824,0.00014986208,0.00048089653],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076630036,0.0007757713,0.0010443534,0.00073900586,0.0003364693,0.00031740955,0.0036725893,0.0006613762,0.000047844343],"category_scores_gemma":[0.00005986367,0.0007355024,0.000619833,0.00041915197,0.00060814776,0.00022092919,0.001618635,0.0019115631,0.00034801773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020658332,0.00026306493,0.0021131097,0.00027821932,0.00022704122,0.0003178853,0.0019384406,0.0011747224,0.00047990377,0.98964864,0.0002490623,0.0032892607],"study_design_scores_gemma":[0.0007107275,0.00029112145,0.015750699,0.00029931904,0.0001285606,0.000578279,0.00030062627,0.024924807,0.0010404221,0.95284027,0.0018184794,0.0013166696],"about_ca_topic_score_codex":0.000088868925,"about_ca_topic_score_gemma":0.00006433972,"teacher_disagreement_score":0.3340294,"about_ca_system_score_codex":0.00009836959,"about_ca_system_score_gemma":0.0003998139,"threshold_uncertainty_score":0.9995096},"labels":[],"label_agreement":null},{"id":"W2951015993","doi":"10.48550/arxiv.1110.4350","title":"Taking Roots over High Extensions of Finite Fields","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Finite field; Prime (order theory); Mathematics; Integer (computer science); Combinatorics; Polynomial; Multiplication (music); Binary logarithm; Field (mathematics); Modular arithmetic; Discrete mathematics; Time complexity; Algorithm; Pure mathematics; Computer science; Mathematical analysis","score_opus":0.07178566113802666,"score_gpt":0.18756011945472603,"score_spread":0.11577445831669937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951015993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42810753,0.00010759625,0.5669801,0.00003795528,0.00073515903,0.00014569101,0.000009480992,0.00012095885,0.0037554859],"genre_scores_gemma":[0.9958451,0.0001829834,0.0035472843,0.00007228051,0.000039792398,4.5795713e-7,0.000004447243,0.000010894258,0.00029680494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985434,0.00009612481,0.00021026847,0.0007716635,0.000092950875,0.0002856199],"domain_scores_gemma":[0.9978256,0.0001816958,0.00037790247,0.0013488845,0.0001446624,0.000121261946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001444452,0.00024210368,0.0003327401,0.00040810503,0.00012107489,0.000039728213,0.0015457033,0.00034252452,0.00013431306],"category_scores_gemma":[0.00004319853,0.00025519897,0.0003206878,0.0006484063,0.00013922152,0.00020629144,0.0019594128,0.00052788394,0.00002079647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033515298,0.00025545596,0.0077476073,0.0001461347,0.00022562998,0.0005828344,0.0006439668,0.09089695,0.000105705054,0.896903,0.0002922878,0.0021669306],"study_design_scores_gemma":[0.0010936155,0.00020402794,0.19388148,0.00061017816,0.00028149376,0.000010654276,0.00006962079,0.20082068,0.0013949174,0.60009605,0.00032503833,0.0012122673],"about_ca_topic_score_codex":0.0009783221,"about_ca_topic_score_gemma":0.00011012612,"teacher_disagreement_score":0.5677375,"about_ca_system_score_codex":0.000025930109,"about_ca_system_score_gemma":0.00010592877,"threshold_uncertainty_score":0.99999005},"labels":[],"label_agreement":null},{"id":"W2951900168","doi":"10.48550/arxiv.1701.01927","title":"Isogenies for point counting on genus two hyperelliptic curves with maximal real multiplication","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; University of Calgary","funders":"","keywords":"Mathematics; Genus; Discriminant; Generalization; Polynomial; Multiplication (music); Elliptic curve; Complex multiplication; Modular design; Discrete mathematics; Pure mathematics; Combinatorics; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.0653949422770869,"score_gpt":0.20929877647278655,"score_spread":0.14390383419569963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951900168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47741738,0.00023390063,0.51782846,0.00035126822,0.00036405807,0.00091910094,0.000029701081,0.000258576,0.0025975353],"genre_scores_gemma":[0.99053574,0.0008046678,0.0081669595,0.00008803316,0.00009817,0.000008337939,0.00002442596,0.00002266764,0.0002509746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981544,0.00006363554,0.00017446486,0.001112095,0.00012567555,0.0003697284],"domain_scores_gemma":[0.99744326,0.00018414452,0.00041392897,0.0016010491,0.00024246774,0.00011513591],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027884042,0.00032445195,0.00032515387,0.0002447701,0.00050421956,0.00026515516,0.0016972731,0.00015958464,0.0000041596304],"category_scores_gemma":[0.000036343674,0.00031090504,0.00023931461,0.00020938547,0.00019818626,0.00040310776,0.0006540005,0.00036324057,0.000021307587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011947522,0.0012860481,0.029820034,0.0032668447,0.0014715546,0.0008589144,0.0019641132,0.21949364,0.0006466262,0.712838,0.0016490498,0.025510445],"study_design_scores_gemma":[0.0036870877,0.0007802883,0.027125657,0.0021123989,0.00055196846,0.00004431027,0.00018249432,0.8915076,0.0014746072,0.06946827,0.0010693575,0.0019959342],"about_ca_topic_score_codex":0.00039704013,"about_ca_topic_score_gemma":0.00014159738,"teacher_disagreement_score":0.672014,"about_ca_system_score_codex":0.00008910247,"about_ca_system_score_gemma":0.0001498455,"threshold_uncertainty_score":0.9999343},"labels":[],"label_agreement":null},{"id":"W2952470461","doi":"","title":"A CRT-Based Montgomery Multiplication for Finite Fields of Small Characteristic","year":2005,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Finite field; Multiplication (music); Mathematics; Reduction (mathematics); Prime (order theory); Polynomial; Discrete mathematics; Time complexity; Multiplication algorithm; Arithmetic; Algorithm; Combinatorics; Mathematical analysis; Geometry","score_opus":0.013327702255507206,"score_gpt":0.2152077203237584,"score_spread":0.2018800180682512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952470461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05292913,0.00023306228,0.93605924,0.008723721,0.000056860514,0.00028948698,0.000015303882,0.000114785114,0.0015784334],"genre_scores_gemma":[0.73011756,0.000035501205,0.2691723,0.00014918872,0.000012001504,0.000062015104,0.000037536473,0.000008897943,0.00040499808],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826145,0.0006436524,0.00034659577,0.00036418563,0.00016594435,0.00021816842],"domain_scores_gemma":[0.99564624,0.0019503102,0.0002581658,0.001158357,0.0008963818,0.00009054144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016089021,0.00013212308,0.00017508067,0.00018007914,0.00018304418,0.0001113756,0.0009114153,0.000094207215,0.000015271247],"category_scores_gemma":[0.0006822515,0.00013308729,0.0001591511,0.00044374276,0.00009838115,0.00016365616,0.0001398171,0.00011549826,0.00000951268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046337493,0.0019233957,0.0045784954,0.0002763299,0.00008049323,0.000001743476,0.009575286,0.00110291,0.025872359,0.28940523,0.000488559,0.66664886],"study_design_scores_gemma":[0.0012585445,0.0000026237258,0.024528863,0.0003876576,0.000027224374,0.000003260666,0.0000256279,0.7978441,0.15995632,0.0028278567,0.012792268,0.0003456611],"about_ca_topic_score_codex":0.00012704085,"about_ca_topic_score_gemma":0.00042399773,"teacher_disagreement_score":0.7967412,"about_ca_system_score_codex":0.00002056745,"about_ca_system_score_gemma":0.00008500861,"threshold_uncertainty_score":0.54271424},"labels":[],"label_agreement":null},{"id":"W2952605738","doi":"","title":"An Analysis of ZVP-Attack on ECC Cryptosystems.","year":2012,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Side channel attack; Computer science; Power analysis; Cryptosystem; Cryptography; Public-key cryptography; Elliptic curve cryptography; Smart card; Computer security; Encryption","score_opus":0.030547227284234254,"score_gpt":0.30976742196873036,"score_spread":0.2792201946844961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952605738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26023617,0.00026598616,0.7335991,0.0003262955,0.00117978,0.00048763762,0.00011465838,0.00022172077,0.0035686132],"genre_scores_gemma":[0.76735306,0.00009044346,0.2319883,0.0001588843,0.00016169167,0.000099784906,0.000115617106,0.000031105483,0.0000011135756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945594,0.0011596583,0.0011031186,0.0016369038,0.0006207379,0.00092017377],"domain_scores_gemma":[0.9937424,0.00078448793,0.0009294751,0.0039011398,0.0002020054,0.0004404628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008783652,0.0007015998,0.0017227352,0.0025520618,0.00018284417,0.00012058165,0.0035720037,0.0006205652,0.000115248185],"category_scores_gemma":[0.00008152731,0.0006400263,0.0012135832,0.0012366977,0.0005572644,0.00020029781,0.0022728639,0.0013854299,0.00012387762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062213505,0.00075307715,0.028880902,0.00015885917,0.00299614,0.000048745238,0.0044564023,0.019177824,0.0007945111,0.9364418,0.00013544828,0.0060940734],"study_design_scores_gemma":[0.0008935168,0.00059095025,0.37255853,0.00031440047,0.0026705684,0.00004913707,0.000332222,0.13480455,0.003520311,0.48090577,0.0014514859,0.0019085554],"about_ca_topic_score_codex":0.00021134625,"about_ca_topic_score_gemma":0.00024156054,"teacher_disagreement_score":0.5071169,"about_ca_system_score_codex":0.00006818991,"about_ca_system_score_gemma":0.00020885191,"threshold_uncertainty_score":0.9996051},"labels":[],"label_agreement":null},{"id":"W2953076142","doi":"","title":"Cryptographic Implications of Hess' Generalized GHS Attack.","year":2004,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Finite field; Generalization; Logarithm; Elliptic curve; Cryptography; Mathematics; Field (mathematics); Discrete mathematics; Pure mathematics; Computer science; Mathematical analysis; Algorithm; Public-key cryptography; Encryption; Computer security","score_opus":0.025450954780576313,"score_gpt":0.28699002304699256,"score_spread":0.26153906826641626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953076142","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11097808,0.0008914062,0.87873125,0.003639852,0.0009577147,0.00084697804,0.00010318098,0.0003500025,0.0035015277],"genre_scores_gemma":[0.34742552,0.0007320562,0.65100276,0.00029724295,0.000115820265,0.00031157624,0.0000723189,0.000041406907,0.0000012614244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954595,0.00049275,0.0011453873,0.0016441679,0.00040428972,0.00085392036],"domain_scores_gemma":[0.9949516,0.00046089475,0.0008386294,0.003156998,0.00028222104,0.00030967235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041781022,0.0006863709,0.0011546162,0.0012459581,0.00027278197,0.00011391583,0.003695595,0.0006056383,0.00006762219],"category_scores_gemma":[0.00009074153,0.0006668446,0.0010303542,0.0008631036,0.0011780773,0.00014209298,0.00406014,0.0014582069,0.00006649369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024729032,0.00033367955,0.005046019,0.0001850254,0.00038601286,0.000024307445,0.0013709763,0.006458595,0.002041892,0.9803441,0.00026286652,0.0035217528],"study_design_scores_gemma":[0.00074652105,0.00009360872,0.08451633,0.00017122434,0.00009008866,0.00008522905,0.000025245772,0.00076068,0.0017354265,0.9102791,0.0008912197,0.000605353],"about_ca_topic_score_codex":0.00021864202,"about_ca_topic_score_gemma":0.00019496189,"teacher_disagreement_score":0.23644744,"about_ca_system_score_codex":0.00006604145,"about_ca_system_score_gemma":0.0006744144,"threshold_uncertainty_score":0.9995783},"labels":[],"label_agreement":null},{"id":"W2953127313","doi":"","title":"A Post-Quantum Digital Signature Scheme Based on Supersingular Isogenies.","year":2017,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Random oracle; Computer science; Scheme (mathematics); Digital signature; Mathematical proof; Key (lock); Schnorr signature; Oracle; Theoretical computer science; Signature (topology); Exploit; Elliptic Curve Digital Signature Algorithm; Algorithm; Mathematics; Public-key cryptography; Blind signature; Computer network; Programming language","score_opus":0.01129449851218596,"score_gpt":0.24469556219919433,"score_spread":0.23340106368700836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953127313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06547694,0.0005087964,0.9160228,0.00719029,0.0022781617,0.0008547273,0.00031390713,0.00049949443,0.0068548787],"genre_scores_gemma":[0.681709,0.000053567896,0.31654686,0.0010413746,0.00027250493,0.00010428871,0.00020170842,0.0000646297,0.000006081958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99555814,0.00027462924,0.00055195397,0.001998974,0.0006163734,0.0009999393],"domain_scores_gemma":[0.9945505,0.00060650957,0.0004657641,0.0037774988,0.00024137883,0.0003582993],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00033246266,0.00083744875,0.0009163659,0.0008582146,0.00063286396,0.0008690905,0.004521324,0.00084816874,0.000047976002],"category_scores_gemma":[0.00046560954,0.0007751566,0.0009670584,0.00017483649,0.0010364017,0.00028412454,0.0038501197,0.0027952716,0.00023906205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021023348,0.0005514768,0.0031883726,0.00018534398,0.00038007682,0.0010462409,0.0018425601,0.0014945321,0.0017249982,0.9795424,0.00076188147,0.00907189],"study_design_scores_gemma":[0.0010592338,0.00048170568,0.010479089,0.0004479475,0.00006135081,0.00011197231,0.00006761255,0.08568588,0.0011955515,0.8955231,0.0035824678,0.0013041133],"about_ca_topic_score_codex":0.000045778164,"about_ca_topic_score_gemma":0.00002085769,"teacher_disagreement_score":0.61623204,"about_ca_system_score_codex":0.00007496942,"about_ca_system_score_gemma":0.00063810387,"threshold_uncertainty_score":0.99950534},"labels":[],"label_agreement":null},{"id":"W2953360005","doi":"10.48550/arxiv.1004.4785","title":"Tabulation of cubic function fields via polynomial binary cubic forms","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cubic function; Cubic form; Generalization; Degree (music); Binary number; Mathematics; Combinatorics; Cubic crystal system; Polynomial; Function (biology); Discriminant; Square (algebra); Monotone cubic interpolation; Discrete mathematics; Mathematical analysis; Physics; Geometry; Arithmetic; Computer science; Condensed matter physics","score_opus":0.028437049051598308,"score_gpt":0.17000366634167308,"score_spread":0.14156661729007478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953360005","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51523274,0.000045013992,0.48289847,0.000053997726,0.0009463619,0.00015907423,0.000003534146,0.00009085799,0.00056993787],"genre_scores_gemma":[0.9982893,0.00007145077,0.001217399,0.00003716034,0.00012310485,9.040799e-7,0.000020569862,0.00001182921,0.00022828237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858147,0.00006793391,0.00024355644,0.00072312786,0.00011296358,0.0002709769],"domain_scores_gemma":[0.9983242,0.00007489195,0.00031617808,0.0010392345,0.00013195783,0.00011354382],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018969427,0.0002526958,0.00029300014,0.0005299762,0.00015441456,0.00005381703,0.0010477001,0.00057941256,0.000047143014],"category_scores_gemma":[0.000011124178,0.00026258128,0.00032855073,0.0006694797,0.00013366142,0.00042352636,0.00095920224,0.00077108725,0.000024840814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007055704,0.0012683147,0.034727346,0.0008819979,0.0008344215,0.000389821,0.0015020206,0.5525915,0.016871458,0.35826793,0.0014879993,0.030471632],"study_design_scores_gemma":[0.0011717424,0.0004228709,0.05290922,0.00013507338,0.00023982403,0.000013291342,0.000044674398,0.8242854,0.0032839312,0.11586864,0.00075478986,0.0008705814],"about_ca_topic_score_codex":0.00027123606,"about_ca_topic_score_gemma":0.0001053426,"teacher_disagreement_score":0.48305658,"about_ca_system_score_codex":0.000045645527,"about_ca_system_score_gemma":0.00012600311,"threshold_uncertainty_score":0.99998266},"labels":[],"label_agreement":null},{"id":"W2956435589","doi":"10.1145/3326229.3326260","title":"Quadratic-Time Algorithms for Normal Elements","year":2019,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Quadratic equation; Computer science; Mathematics; Geometry","score_opus":0.009189914485408257,"score_gpt":0.23897809010824747,"score_spread":0.2297881756228392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956435589","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026985738,0.00004156176,0.9555869,0.00068662077,0.00047906113,0.00051131187,0.0000031353145,0.00017401167,0.015531619],"genre_scores_gemma":[0.17048664,0.00000518866,0.8163942,0.0008952537,0.00009766203,0.00004754838,0.0000072893467,0.000012572939,0.012053611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918985,0.000014556956,0.00015639662,0.00023586534,0.00015629525,0.0002470407],"domain_scores_gemma":[0.99944025,0.000073610674,0.000036179637,0.00034628584,0.000045543587,0.000058139907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018215134,0.000083236264,0.0001013166,0.00007863655,0.00006617693,0.00009652238,0.0004911548,0.000033931552,0.00022744578],"category_scores_gemma":[0.000006243644,0.000065099244,0.00008926518,0.00021213046,0.000013390011,0.00029372604,0.00010452042,0.000039822335,0.00060509046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032547447,0.00053312146,0.016283896,0.00012141833,0.00023467733,0.00001096759,0.0011121323,0.00016312621,0.0122522,0.62103593,0.021405082,0.3268149],"study_design_scores_gemma":[0.0031336308,0.0009804256,0.014317033,0.000029359122,0.00002303351,0.00002113878,0.00007871859,0.8709901,0.015383709,0.02061999,0.07360722,0.0008156235],"about_ca_topic_score_codex":0.000009012905,"about_ca_topic_score_gemma":0.0000022680795,"teacher_disagreement_score":0.87082696,"about_ca_system_score_codex":0.0000063069133,"about_ca_system_score_gemma":0.000024364977,"threshold_uncertainty_score":0.77774155},"labels":[],"label_agreement":null},{"id":"W2967740902","doi":"10.5220/0007772800150024","title":"High-performance Pipelined FPGA Implementation of the Elliptic Curve Cryptography over GF (2n)","year":2019,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Elliptic curve cryptography; Computer science; Field-programmable gate array; Cryptography; GF(2); Elliptic Curve Digital Signature Algorithm; Elliptic curve; Parallel computing; Arithmetic; Embedded system; Public-key cryptography; Mathematics; Algorithm; Finite field; Encryption; Computer security; Discrete mathematics; Pure mathematics","score_opus":0.005074403081662085,"score_gpt":0.2246668957105652,"score_spread":0.21959249262890312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967740902","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9526971,0.000069295624,0.045083806,0.00032498245,0.0006521046,0.00032214276,0.0000027419092,0.00006417583,0.0007836523],"genre_scores_gemma":[0.9896196,0.00004443665,0.009925041,0.00027203685,0.000030525563,0.000008416573,0.0000018053853,0.0000066999833,0.000091452355],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987644,0.00005784444,0.000300064,0.00027253674,0.00035874033,0.00024641762],"domain_scores_gemma":[0.9989595,0.00006675154,0.000144659,0.0007075678,0.000080209145,0.000041340107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000227935,0.00013048327,0.00015153528,0.00016011359,0.00008898952,0.000054923024,0.0007927427,0.00004560105,0.0002739816],"category_scores_gemma":[0.000003335865,0.00008169988,0.00014899483,0.0010605734,0.000063484076,0.0003895055,0.00019266644,0.00010561577,0.00004982916],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024480842,0.00022226144,0.5971474,0.00017119391,0.00014986338,0.0000011698186,0.0013296936,0.0011070268,0.014350323,0.3099054,0.0021075364,0.073483646],"study_design_scores_gemma":[0.0010026158,0.00018098367,0.8761794,0.00003251518,0.000018830402,0.0000031396314,0.00011426002,0.005798067,0.11136063,0.0041263886,0.0009517817,0.00023138215],"about_ca_topic_score_codex":0.00024079987,"about_ca_topic_score_gemma":0.000043300508,"teacher_disagreement_score":0.305779,"about_ca_system_score_codex":0.000009519383,"about_ca_system_score_gemma":0.000044153985,"threshold_uncertainty_score":0.33316243},"labels":[],"label_agreement":null},{"id":"W2980712224","doi":"","title":"Hardware Implementation of Barrett Reduction Exploiting Constant Multiplication","year":2019,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Institute of Standards and Technology; University of Waterloo","keywords":"Multiplication (music); Reduction (mathematics); Constant (computer programming); Computer science; Arithmetic; Mathematics; Programming language","score_opus":0.010886985947872269,"score_gpt":0.22535632500214484,"score_spread":0.21446933905427257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980712224","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.994611,0.0001893661,0.0037304652,0.00028547907,0.00048214154,0.00043155914,0.000030087851,0.00006546309,0.00017441616],"genre_scores_gemma":[0.975037,0.000165222,0.013927524,0.000003630702,0.000022386765,0.0000011042897,0.00041399375,0.0000143471525,0.010414784],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9988857,0.00006210786,0.00019325907,0.0003823889,0.00030156653,0.00017497082],"domain_scores_gemma":[0.99860775,0.0000283219,0.0005606466,0.0004235368,0.0003317842,0.000047928166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001471736,0.00015907043,0.00028326677,0.0004051519,0.00013906798,0.000024715964,0.00051069673,0.00016080098,0.00004854833],"category_scores_gemma":[0.000005394013,0.00018910263,0.00017672194,0.0003673515,0.000058051923,0.00050679006,0.000069628724,0.00014140138,0.000013381797],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020329231,0.00023514414,0.006919026,0.0020735594,0.00048322888,0.000017981029,0.61913526,0.00023651487,0.17468138,0.027010499,0.0010847902,0.16791935],"study_design_scores_gemma":[0.001834645,0.00029129902,0.041002765,0.0006423172,0.00023221491,0.000010559603,0.81399477,0.0022322184,0.1380199,0.00090049393,0.00016200592,0.0006768323],"about_ca_topic_score_codex":0.011627861,"about_ca_topic_score_gemma":0.0032852523,"teacher_disagreement_score":0.1948595,"about_ca_system_score_codex":0.000045510216,"about_ca_system_score_gemma":0.00012166233,"threshold_uncertainty_score":0.9949538},"labels":[],"label_agreement":null},{"id":"W2991551264","doi":"10.1007/978-3-030-34339-2_16","title":"Improved Digital Signatures Based on Elliptic Curve Endomorphism Rings","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Endomorphism ring; Endomorphism; Digital signature; Global Positioning System; Computer science; Scheme (mathematics); Elliptic Curve Digital Signature Algorithm; Signature (topology); Algorithm; Post-quantum cryptography; Elliptic curve cryptography; Mathematics; Public-key cryptography; Discrete mathematics; Encryption; Computer security; Hash function; Geometry; Telecommunications; Mathematical analysis","score_opus":0.007823321560337377,"score_gpt":0.20669272299415978,"score_spread":0.1988694014338224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991551264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012684672,0.00047156803,0.99029744,0.0006007101,0.0022798702,0.00061632734,0.00001525979,0.00022429808,0.005367658],"genre_scores_gemma":[0.86859626,0.000027217713,0.12708466,0.0031346576,0.00047505047,0.000012098303,0.000014649662,0.0000717186,0.0005837073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954225,0.0000326131,0.0004998607,0.0019910492,0.0011982655,0.0008557024],"domain_scores_gemma":[0.99614185,0.0011852153,0.0003142302,0.0019330315,0.00020060805,0.00022506548],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005358213,0.00073910743,0.0006323234,0.0014134194,0.0002480542,0.0012386951,0.0039309263,0.00046457897,0.000025076395],"category_scores_gemma":[0.000107873886,0.00061687845,0.0003353835,0.00080660504,0.00080353813,0.00066091615,0.0008905115,0.0013724178,0.00010151881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057591547,0.00022235447,0.00022421677,0.00017119362,0.000052485222,0.00038834306,0.00059838925,0.1659602,0.0009182479,0.071823314,0.00007924851,0.75950444],"study_design_scores_gemma":[0.00071276457,0.0006310441,0.00022128981,0.0005400304,0.000011646129,0.000032021228,8.902639e-8,0.9375213,0.0018196586,0.05561122,0.0018486499,0.0010503103],"about_ca_topic_score_codex":0.000011570902,"about_ca_topic_score_gemma":0.0000112843545,"teacher_disagreement_score":0.8684694,"about_ca_system_score_codex":0.0001774406,"about_ca_system_score_gemma":0.00063469,"threshold_uncertainty_score":0.9997981},"labels":[],"label_agreement":null},{"id":"W3004260751","doi":"","title":"Quantum Cryptanalysis in the RAM Model: Claw-Finding Attacks on SIKE","year":2019,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Isogeny; Key encapsulation; Cryptanalysis; Computer science; Supersingular elliptic curve; Computation; Quantum computer; Quantum; Post-quantum cryptography; Cryptography; Algorithm; Theoretical computer science; Mathematics; Public-key cryptography; Elliptic curve; Key exchange; Computer security; Physics; Quantum mechanics","score_opus":0.033003109927307636,"score_gpt":0.29711682752191737,"score_spread":0.2641137175946097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004260751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13462551,0.00020671517,0.8520192,0.004006787,0.0009551397,0.0009089998,0.000027711798,0.0001748439,0.007075111],"genre_scores_gemma":[0.8358398,0.00026768705,0.16214627,0.0013269293,0.00011917076,0.00021777624,0.000038303686,0.00004061719,0.0000034519112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99408764,0.0012429203,0.00093160087,0.001932641,0.0007293786,0.0010758349],"domain_scores_gemma":[0.9940408,0.001753433,0.00052971183,0.003438007,0.0000838629,0.00015420269],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0013677739,0.00075196003,0.0011102296,0.0013780145,0.00028938768,0.00032113557,0.00516966,0.0006156719,0.000022677112],"category_scores_gemma":[0.00016788767,0.0005663624,0.00090737664,0.00080626714,0.000459265,0.00014516483,0.0032829195,0.0034024972,0.000280583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042806576,0.00022824838,0.0037891692,0.000062406914,0.00019476243,0.00013806515,0.004898612,0.19111082,0.000060904455,0.7967135,0.00040067476,0.0023600785],"study_design_scores_gemma":[0.00034934448,0.00008533241,0.0074745934,0.00011825514,0.000057498473,0.000029663033,0.00013584874,0.3809341,0.00006593799,0.6100948,0.00020821505,0.0004464303],"about_ca_topic_score_codex":0.00011828109,"about_ca_topic_score_gemma":0.0001884304,"teacher_disagreement_score":0.7012143,"about_ca_system_score_codex":0.00010465766,"about_ca_system_score_gemma":0.00032506703,"threshold_uncertainty_score":0.9996788},"labels":[],"label_agreement":null},{"id":"W3021390709","doi":"10.1007/s00037-020-00204-9","title":"Subquadratic-Time Algorithms for Normal Bases","year":2021,"lang":"en","type":"preprint","venue":"Computational Complexity","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Normal basis; Basis (linear algebra); Combinatorics; Galois group; Abelian group; Invertible matrix; Mathematics; Physics; Discrete mathematics; Pure mathematics; Geometry","score_opus":0.07333356916538013,"score_gpt":0.3050625484096439,"score_spread":0.23172897924426378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021390709","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016032914,0.00048024938,0.97908217,0.0015718316,0.0010679682,0.0006348446,0.00020554513,0.00031444753,0.00061002263],"genre_scores_gemma":[0.17170517,0.0000058763453,0.8257752,0.0006135111,0.0003429609,0.00012725707,0.001298259,0.000025787895,0.00010594999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717706,0.00019972536,0.00055872876,0.0010175105,0.00061184197,0.00043513664],"domain_scores_gemma":[0.9972221,0.0007925807,0.00027615964,0.00077084044,0.00075256336,0.00018574129],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041214837,0.00040194023,0.0005532961,0.0002525002,0.0004331523,0.0007819568,0.0014758792,0.00020926821,0.00011842386],"category_scores_gemma":[0.0000977643,0.00042502413,0.0005462021,0.00041318312,0.00023830916,0.0002904041,0.0017345856,0.00045293637,0.000034985285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073068375,0.0015512176,0.0007174486,0.0013170589,0.000932358,0.00017068938,0.0019361565,0.45159176,0.00014278745,0.48324418,0.01323999,0.04508329],"study_design_scores_gemma":[0.0003855808,0.000060180664,0.010403937,0.00008109044,0.000028465593,0.00003043384,0.000011098323,0.72962934,0.00008571877,0.25821683,0.0006251935,0.00044213491],"about_ca_topic_score_codex":0.000055654622,"about_ca_topic_score_gemma":0.00001720132,"teacher_disagreement_score":0.2780376,"about_ca_system_score_codex":0.00006727904,"about_ca_system_score_gemma":0.0006263287,"threshold_uncertainty_score":0.9998202},"labels":[],"label_agreement":null},{"id":"W3023248040","doi":"","title":"Using z14 Fused-Multiply-Add Instructions to Accelerate Elliptic Curve Cryptography.","year":2019,"lang":"en","type":"article","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Elliptic curve cryptography; Computer science; Elliptic curve; Cryptography; Hessian form of an elliptic curve; Curve25519; Elliptic Curve Digital Signature Algorithm; Elliptic curve point multiplication; Tripling-oriented Doche–Icart–Kohel curve; Mathematics; Public-key cryptography; Algorithm; Encryption; Computer security; Mathematical analysis","score_opus":0.023701994921431446,"score_gpt":0.2732117888300713,"score_spread":0.24950979390863987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023248040","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42052922,0.000059215974,0.5754974,0.0004232726,0.0010096662,0.00047989766,0.000009572603,0.00020638677,0.0017853932],"genre_scores_gemma":[0.3837208,0.000025947877,0.6156343,0.00045430276,0.00009010452,0.000041323423,0.000004638725,0.000025811742,0.0000027509327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99669886,0.00033755312,0.0005556289,0.0011370069,0.0003377921,0.000933135],"domain_scores_gemma":[0.99753237,0.000373094,0.00019544942,0.0013705353,0.00014555376,0.0003829754],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029594888,0.0004240373,0.0005237197,0.0010559731,0.00039119134,0.00019727652,0.0015252586,0.0001754515,0.00018318258],"category_scores_gemma":[0.00006206656,0.00040782287,0.0003706198,0.001497219,0.00030697664,0.00043847144,0.0009744072,0.000617534,0.0009227415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045576926,0.0001454625,0.047330856,0.000028144406,0.00014274157,0.00003801115,0.001951652,0.0028823165,0.022533312,0.91990536,0.00021276416,0.0047837975],"study_design_scores_gemma":[0.002128576,0.00052575296,0.14025277,0.00014611978,0.00007301907,0.0004754657,0.00046413695,0.036779672,0.008356653,0.7975305,0.0117739495,0.0014933894],"about_ca_topic_score_codex":0.0000902855,"about_ca_topic_score_gemma":0.00010565633,"teacher_disagreement_score":0.12237487,"about_ca_system_score_codex":0.00004395138,"about_ca_system_score_gemma":0.00013452173,"threshold_uncertainty_score":0.99985516},"labels":[],"label_agreement":null},{"id":"W3028700067","doi":"","title":"Arithmetic of Generalized Jacobians.","year":2006,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptosystem; Discrete logarithm; Cryptography; Hyperelliptic curve cryptography; ElGamal encryption; Elliptic curve cryptography; Elliptic curve; Mathematics; Algebra over a field; Abelian group; Arithmetic; Logarithm; Algebraic number; Public-key cryptography; Computer science; Pure mathematics; Algorithm; Encryption; Mathematical analysis","score_opus":0.011387459190588659,"score_gpt":0.24218710650805877,"score_spread":0.2307996473174701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028700067","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073458806,0.0012139607,0.91686857,0.0011374617,0.0013696617,0.0005816258,0.000066427594,0.0002570682,0.005046403],"genre_scores_gemma":[0.1096656,0.00034082698,0.88942486,0.00018212704,0.00015525168,0.00012349179,0.00006632767,0.000036728274,0.0000047986623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958746,0.00058370136,0.0010071723,0.0013508584,0.00044731502,0.0007363588],"domain_scores_gemma":[0.99635553,0.0004445569,0.0006700093,0.0021704123,0.00017659602,0.00018287053],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043505646,0.0005917199,0.0011237296,0.00088027125,0.00013807276,0.00009635733,0.0028782445,0.0005279446,0.000046991707],"category_scores_gemma":[0.00007719626,0.00056867104,0.0007650176,0.00043845733,0.00082377694,0.000094267336,0.003963735,0.0012743339,0.000061177954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026700403,0.00028274397,0.004428885,0.00020055546,0.00024753463,0.00012976071,0.00083013315,0.0026255143,0.0013326032,0.9722069,0.0012235015,0.016465198],"study_design_scores_gemma":[0.0006755835,0.000091840964,0.03303908,0.00013433296,0.000080305654,0.0000791941,0.00001254488,0.009042796,0.003045271,0.95171237,0.0014958268,0.0005908513],"about_ca_topic_score_codex":0.00056706567,"about_ca_topic_score_gemma":0.00018655443,"teacher_disagreement_score":0.036206797,"about_ca_system_score_codex":0.000041195446,"about_ca_system_score_gemma":0.00032521025,"threshold_uncertainty_score":0.99967647},"labels":[],"label_agreement":null},{"id":"W3028759481","doi":"","title":"Faster Explicit Formulas for Computing Pairings over Ordinary Curves.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Exponentiation; Parameterized complexity; Pairing; Elliptic curve; Computer science; Computation; Cryptography; Context (archaeology); Quadratic equation; Arithmetic; Mathematics; Theoretical computer science; Algebra over a field; Algorithm; Pure mathematics","score_opus":0.01729256799778458,"score_gpt":0.2769583647404634,"score_spread":0.25966579674267887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028759481","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079814486,0.000557685,0.91066736,0.002769072,0.0027709596,0.001566078,0.000055584354,0.00044688213,0.0013518997],"genre_scores_gemma":[0.10743612,0.00021621384,0.8894999,0.0018654483,0.00045731117,0.00035033014,0.00009299726,0.000073298026,0.000008386706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955917,0.00023476435,0.0008611189,0.0018186118,0.00037207088,0.0011217099],"domain_scores_gemma":[0.99577737,0.0010972688,0.0005952917,0.002046427,0.000189599,0.00029402372],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0007297296,0.00074160885,0.0010155643,0.00057822483,0.0003901031,0.00019767061,0.002991212,0.0006658053,0.000043063752],"category_scores_gemma":[0.00017257387,0.0007055166,0.0008880939,0.0002565184,0.00038082074,0.00022240856,0.0068827774,0.0023948036,0.00006106886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006502072,0.0002464469,0.0044374033,0.0010803028,0.00032775308,0.00008919362,0.0023460498,0.00029535472,0.0010438603,0.9578611,0.005182115,0.027025376],"study_design_scores_gemma":[0.0010150197,0.00020160121,0.02137522,0.00082346535,0.00009346955,0.00015993106,0.000035663907,0.058593016,0.00082221,0.9039828,0.011798877,0.0010986901],"about_ca_topic_score_codex":0.000073086325,"about_ca_topic_score_gemma":0.000074432384,"teacher_disagreement_score":0.05829766,"about_ca_system_score_codex":0.00004422164,"about_ca_system_score_gemma":0.00023551588,"threshold_uncertainty_score":0.9999067},"labels":[],"label_agreement":null},{"id":"W3028858620","doi":"","title":"Torus-based compression by factor 4 and 6.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Torus; Exponentiation; Pairing; Compression (physics); Computer science; Factor (programming language); Lossless compression; Algorithm; Mathematics; Data compression; Theoretical computer science; Physics; Mathematical analysis; Geometry","score_opus":0.009356381829438497,"score_gpt":0.24669706662836688,"score_spread":0.2373406847989284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028858620","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22244526,0.00045399216,0.77297586,0.0015961458,0.0011773278,0.00041461753,0.00010344901,0.00024918767,0.0005841179],"genre_scores_gemma":[0.37180406,0.00014806693,0.62729806,0.00045635313,0.000099488025,0.00009811506,0.00006424,0.00002965979,0.0000019639524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970642,0.00032713116,0.00044634106,0.0013017424,0.00029523682,0.00056536694],"domain_scores_gemma":[0.9973028,0.0006272417,0.00030041448,0.0014485858,0.00007128722,0.0002496811],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019723763,0.00049995893,0.00060840097,0.00034079756,0.00025422405,0.00019587306,0.0016419892,0.0006254065,0.00006807351],"category_scores_gemma":[0.00007284744,0.00044266132,0.00024874488,0.00012793069,0.0006708394,0.00009514877,0.0032834641,0.002154192,0.000038879218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000913598,0.00044130633,0.018396115,0.00027986438,0.00021215325,0.00012776731,0.0021312581,0.0002198,0.03603153,0.8764433,0.0034861374,0.062139392],"study_design_scores_gemma":[0.0010248525,0.00016121613,0.04991248,0.00019002477,0.000040374394,0.00005243811,0.00001825218,0.02865193,0.011931782,0.8940004,0.012943348,0.0010729067],"about_ca_topic_score_codex":0.000078807585,"about_ca_topic_score_gemma":0.000059545888,"teacher_disagreement_score":0.1493588,"about_ca_system_score_codex":0.000018281255,"about_ca_system_score_gemma":0.00017264558,"threshold_uncertainty_score":0.99980253},"labels":[],"label_agreement":null},{"id":"W3028978996","doi":"","title":"On prime-order elliptic curves with embedding degrees k=3, 4 and 6.","year":2007,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Elliptic curve; Prime (order theory); Embedding; Mathematics; Order (exchange); Diophantine equation; Discriminant; Supersingular elliptic curve; Heuristic; Schoof's algorithm; Pure mathematics; Discrete mathematics; Combinatorics; Computer science; Quarter period; Mathematical optimization","score_opus":0.01160623668200747,"score_gpt":0.26478701677389266,"score_spread":0.25318078009188516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028978996","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05830111,0.0019352215,0.9311846,0.0015710839,0.0004795727,0.00067323283,0.000017886245,0.00027767164,0.0055596605],"genre_scores_gemma":[0.09206482,0.0015938989,0.9052911,0.0007809638,0.00010395965,0.000083893974,0.0000307361,0.00004437386,0.0000063029906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964226,0.00029791423,0.0005418278,0.0015520314,0.00042652912,0.00075912895],"domain_scores_gemma":[0.9964997,0.0012701724,0.00037911563,0.0014602165,0.00012985257,0.0002609487],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005996621,0.0006125548,0.0007190847,0.000699649,0.0002445335,0.00015079905,0.0013351496,0.000329587,0.000018856103],"category_scores_gemma":[0.00016263682,0.0004894242,0.00017348822,0.00036719133,0.0007948141,0.00011249165,0.0023042308,0.0016224453,0.000052988256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001722754,0.00021705034,0.0033174146,0.00036569568,0.0003482267,0.0003500112,0.002019549,0.003597133,0.00008141417,0.97541624,0.00033243783,0.013782527],"study_design_scores_gemma":[0.0013341499,0.00073022925,0.038685407,0.0023673046,0.00014871624,0.00050736894,0.0000960994,0.024916619,0.00091553736,0.9279449,0.0009321377,0.0014215299],"about_ca_topic_score_codex":0.000050919454,"about_ca_topic_score_gemma":0.00010746689,"teacher_disagreement_score":0.047471367,"about_ca_system_score_codex":0.000033324814,"about_ca_system_score_gemma":0.00020851943,"threshold_uncertainty_score":0.99975574},"labels":[],"label_agreement":null},{"id":"W3029127791","doi":"","title":"Unbalanced Digit Sets and the Closest Choice Strategy for Minimal Weight Integer Representations.","year":2008,"lang":"en","type":"preprint","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Crosslight Software (Canada)","funders":"","keywords":"Integer (computer science); Mathematics; Representation (politics); Set (abstract data type); Numerical digit; Arithmetic; Function (biology); Combinatorics; Radix (gastropod); Discrete mathematics; Binary number; Algorithm; Computer science","score_opus":0.028404183823960746,"score_gpt":0.2948143477772851,"score_spread":0.26641016395332434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029127791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06226932,0.0034352848,0.8566306,0.016628627,0.002491551,0.003990772,0.00010441937,0.0006412748,0.05380811],"genre_scores_gemma":[0.9588325,0.0014463566,0.03709532,0.00057962263,0.00025970757,0.00042964023,0.000045326775,0.00002315873,0.0012883743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827677,0.000095556155,0.00035932183,0.00074204436,0.00023944602,0.0002868489],"domain_scores_gemma":[0.997679,0.00097393076,0.00017299374,0.00093572587,0.00014872567,0.00008961122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018319099,0.0002631557,0.00033420118,0.00013284328,0.00030622506,0.0004709887,0.001055311,0.00017987701,0.0000088744555],"category_scores_gemma":[0.000092762966,0.00016083378,0.00023646558,0.00024477325,0.00045742796,0.00021902205,0.00086461083,0.0003758353,0.0000049854466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003445041,0.00053672044,0.007853525,0.00058301934,0.0009758868,0.00007118285,0.00460145,0.0034479706,0.00007370719,0.72545236,0.047853693,0.20820598],"study_design_scores_gemma":[0.013333343,0.00041853628,0.13427037,0.0004044091,0.00029686146,0.00039208733,0.00047243162,0.29080507,0.0032275831,0.5235004,0.030177549,0.0027014057],"about_ca_topic_score_codex":0.00030255158,"about_ca_topic_score_gemma":0.0000767618,"teacher_disagreement_score":0.8965632,"about_ca_system_score_codex":0.000012831263,"about_ca_system_score_gemma":0.00013088602,"threshold_uncertainty_score":0.6558611},"labels":[],"label_agreement":null},{"id":"W3029148642","doi":"","title":"Fault attacks on pairing-based protocols revisited.","year":2014,"lang":"en","type":"preprint","venue":"NOT FOUND REPOSITORY (Indian Institute of Science Bangalore)","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pairing; Computer science; Oblivious transfer; Protocol (science); Public-key cryptography; Encryption; Scheme (mathematics); Theoretical computer science; Computer security; Cryptography; Mathematics; Physics","score_opus":0.02334824312631271,"score_gpt":0.28773762929846336,"score_spread":0.26438938617215063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029148642","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6543016,0.00038706596,0.22579335,0.0026089887,0.026734155,0.04134871,0.0000929048,0.0020747615,0.046658486],"genre_scores_gemma":[0.9696896,0.0000061076976,0.027088962,0.0005726772,0.0005801193,0.0018027772,0.000012304661,0.00003728351,0.0002101884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9928552,0.00019957792,0.0011742183,0.0022814933,0.00249729,0.0009922546],"domain_scores_gemma":[0.99361557,0.00015544918,0.0011519144,0.003777761,0.0007456344,0.0005536626],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.0021202255,0.00074173283,0.00090938824,0.0017212727,0.0014334716,0.0013274604,0.0064967484,0.00056653825,0.0000063863595],"category_scores_gemma":[0.00028775624,0.0006399329,0.0006221899,0.0019532274,0.0049931654,0.0010202426,0.0013911515,0.0013350262,0.000054252836],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011405364,0.007218632,0.031651743,0.02086223,0.0010064538,0.0053080465,0.016729282,0.32473183,0.1297376,0.3038166,0.013036602,0.14476047],"study_design_scores_gemma":[0.0066529177,0.00510903,0.115193844,0.031731352,0.00034012576,0.00068532495,0.0001539454,0.11680647,0.5738322,0.01623453,0.12388331,0.009376969],"about_ca_topic_score_codex":0.00019561335,"about_ca_topic_score_gemma":0.000019733845,"teacher_disagreement_score":0.4440946,"about_ca_system_score_codex":0.00038528684,"about_ca_system_score_gemma":0.0029511035,"threshold_uncertainty_score":0.99986655},"labels":[],"label_agreement":null},{"id":"W3029166298","doi":"","title":"Novel Precomputation Schemes for Elliptic Curve Cryptosystems.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scalar multiplication; Precomputation; Elliptic curve point multiplication; Hessian form of an elliptic curve; Elliptic curve; Elliptic curve cryptography; Scalar (mathematics); Tripling-oriented Doche–Icart–Kohel curve; Computer science; Mathematics; Edwards curve; Elliptic Curve Digital Signature Algorithm; Schoof's algorithm; Supersingular elliptic curve; Arithmetic; Algebra over a field; Algorithm; Pure mathematics; Computation; Quarter period; Public-key cryptography; Geometry; Encryption","score_opus":0.02837152545129713,"score_gpt":0.27378431487922866,"score_spread":0.24541278942793154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029166298","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019228866,0.00065562245,0.9723968,0.0010171724,0.0028284667,0.0020535418,0.000115022485,0.00053750444,0.0011670054],"genre_scores_gemma":[0.0737483,0.00037337723,0.9243019,0.00018257428,0.000398726,0.0007774709,0.00015396682,0.00005977938,0.000003896044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954309,0.00031284383,0.0010144244,0.0018843507,0.00041764023,0.0009398732],"domain_scores_gemma":[0.9957497,0.0012690596,0.0007405,0.0016426957,0.00033067627,0.0002673286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004960738,0.00074084906,0.0010388559,0.0007878896,0.00042759874,0.00021093407,0.002424584,0.00061995815,0.000010300886],"category_scores_gemma":[0.00022041716,0.00073482114,0.0008115786,0.00034933843,0.00047834165,0.00021375401,0.0025211237,0.0011868892,0.0000991245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057586392,0.00035423075,0.0011041191,0.0004883396,0.00043426242,0.000033875465,0.0026895981,0.006286451,0.001037348,0.97272485,0.00083562406,0.013953702],"study_design_scores_gemma":[0.0013687707,0.00022060546,0.005002032,0.0003058853,0.00008646307,0.0003547416,0.000057741094,0.15290895,0.0017444862,0.8247711,0.012070101,0.0011091086],"about_ca_topic_score_codex":0.00006726198,"about_ca_topic_score_gemma":0.000043844888,"teacher_disagreement_score":0.14795375,"about_ca_system_score_codex":0.00008873557,"about_ca_system_score_gemma":0.00048628188,"threshold_uncertainty_score":0.9995103},"labels":[],"label_agreement":null},{"id":"W3029195716","doi":"","title":"Minimal Weight and Colexicographically Minimal Integer Representations.","year":2006,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Dimension (graph theory); Discrete mathematics; Integer (computer science); Set (abstract data type); Representation (politics); Minimal models; Arithmetic; Combinatorics; Algebra over a field; Computer science; Pure mathematics","score_opus":0.010194408987092101,"score_gpt":0.25299158542631034,"score_spread":0.24279717643921825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029195716","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12565157,0.0008273866,0.85749865,0.0044485284,0.001135633,0.00068518263,0.000058713285,0.00033676537,0.00935758],"genre_scores_gemma":[0.21828227,0.00027943685,0.7804021,0.00038107578,0.0002506587,0.00026900868,0.00008543371,0.000040206363,0.000009800965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99540997,0.00055974367,0.0008826674,0.0019358873,0.000424613,0.00078714377],"domain_scores_gemma":[0.9966149,0.00088544696,0.00043961924,0.0015890409,0.00016839402,0.0003026493],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039366214,0.0006421389,0.0008130527,0.0010186844,0.00036936978,0.00030655443,0.0018212111,0.0005884325,0.00003933598],"category_scores_gemma":[0.000120017656,0.00061268127,0.0004995004,0.00048568516,0.0017389326,0.00017575924,0.004805421,0.0017127247,0.000044989607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076368975,0.00028321135,0.041465275,0.00010717174,0.00027812482,0.00032386175,0.0012786376,0.00012440518,0.00040754324,0.9427334,0.002696156,0.01022586],"study_design_scores_gemma":[0.0005998398,0.00013355953,0.24377213,0.00010198492,0.00008012651,0.00020994541,0.000049266033,0.005270423,0.00032649818,0.74721307,0.0016064461,0.0006367277],"about_ca_topic_score_codex":0.00025441888,"about_ca_topic_score_gemma":0.00024585114,"teacher_disagreement_score":0.20230685,"about_ca_system_score_codex":0.000028671686,"about_ca_system_score_gemma":0.0002281371,"threshold_uncertainty_score":0.9996325},"labels":[],"label_agreement":null},{"id":"W3029415188","doi":"","title":"Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication.","year":2009,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scalar multiplication; Scalar (mathematics); Computer science; Window (computing); Elliptic curve; Elliptic curve point multiplication; Point (geometry); Multiplication (music); Algorithm; Speedup; Applied mathematics; Mathematics; Arithmetic; Parallel computing; Mathematical analysis; Geometry; Combinatorics","score_opus":0.023077648998691875,"score_gpt":0.3368074585660063,"score_spread":0.31372980956731444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029415188","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002092689,0.0005807586,0.992291,0.0020183453,0.00047775396,0.0015495308,0.00012509461,0.0002761452,0.0005886927],"genre_scores_gemma":[0.0052381763,0.00019118423,0.99322987,0.00064794463,0.00012513323,0.0004667464,0.000058749294,0.00003742476,0.0000047620492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99641764,0.0007372974,0.00061692524,0.001456817,0.00017116558,0.0006001699],"domain_scores_gemma":[0.99649155,0.0012908417,0.000370329,0.0014126599,0.00017672364,0.00025788063],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071399525,0.000512234,0.0006594324,0.0005212879,0.00037235222,0.00019516851,0.001297345,0.00041096777,0.000015540574],"category_scores_gemma":[0.00025345103,0.0004932155,0.00037075105,0.00025638926,0.0005008424,0.00012916504,0.0015042792,0.00079845946,0.000018230998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045006047,0.00029519855,0.0015293118,0.00012881345,0.00023933734,0.0000101927035,0.00293869,0.0433067,0.0005408489,0.9063174,0.0002876142,0.044360895],"study_design_scores_gemma":[0.00067519187,0.00007540968,0.006778711,0.000068619345,0.00006942469,0.00004820466,0.00003485756,0.4230219,0.00054300175,0.56613815,0.0020644588,0.00048205268],"about_ca_topic_score_codex":0.00005114436,"about_ca_topic_score_gemma":0.000038838098,"teacher_disagreement_score":0.3797152,"about_ca_system_score_codex":0.00003747844,"about_ca_system_score_gemma":0.0001563342,"threshold_uncertainty_score":0.9997519},"labels":[],"label_agreement":null},{"id":"W3029799159","doi":"","title":"Double-Base Number System for Multi-Scalar Multiplications.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"","keywords":"Scalar multiplication; Scalar (mathematics); Mathematics; Redundancy (engineering); Base (topology); Algorithm; Discrete mathematics; Computer science; Mathematical analysis; Geometry","score_opus":0.04834976828090153,"score_gpt":0.3035813148722578,"score_spread":0.2552315465913563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029799159","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015651913,0.00024160562,0.9762882,0.0011256468,0.00178427,0.0023794703,0.00014959078,0.0008051575,0.0015741469],"genre_scores_gemma":[0.09188486,0.00019958687,0.9053359,0.0001384886,0.00021227564,0.0020404446,0.00012636045,0.000055360968,0.000006722834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995701,0.0003143238,0.00088569196,0.0019071534,0.00031887504,0.0008729193],"domain_scores_gemma":[0.9955178,0.0006877261,0.0005483605,0.0026037265,0.0003081656,0.00033421878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004001287,0.0006689266,0.00090517406,0.00044726479,0.00054919394,0.00014683075,0.0027503825,0.0006156257,0.000010682827],"category_scores_gemma":[0.00007394415,0.0006464441,0.00085413805,0.000313939,0.0006009396,0.00013171634,0.0028369804,0.0011725249,0.00035164357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011904929,0.00041842237,0.0041518467,0.00046854938,0.00032616968,0.00010913082,0.00233492,0.0019609705,0.00034326292,0.9851559,0.00080769346,0.0038041086],"study_design_scores_gemma":[0.014181131,0.00023228797,0.030098405,0.0009831582,0.00037932282,0.0019447258,0.00044373304,0.3982225,0.013387265,0.5199575,0.01625978,0.003910176],"about_ca_topic_score_codex":0.00015764317,"about_ca_topic_score_gemma":0.00008174872,"teacher_disagreement_score":0.46519837,"about_ca_system_score_codex":0.000119248856,"about_ca_system_score_gemma":0.00037652478,"threshold_uncertainty_score":0.9995987},"labels":[],"label_agreement":null},{"id":"W3030140832","doi":"","title":"Elliptic Curve Cryptography: The Serpentine Course of a Paradigm Shift.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cryptography; Ideal (ethics); Elliptic curve cryptography; Function (biology); Key (lock); Computer security; Elliptic curve; Public-key cryptography; Political science; Mathematics; Law; Pure mathematics; Encryption","score_opus":0.014932985931944464,"score_gpt":0.2538706889830655,"score_spread":0.238937703051121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030140832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10592851,0.0024958984,0.88196236,0.005340644,0.0014646896,0.0010560431,0.00008227281,0.00025127354,0.0014182908],"genre_scores_gemma":[0.7027375,0.0030494863,0.29324052,0.0003557184,0.00022677796,0.00027403276,0.000057039222,0.000057755573,0.0000011459045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99481696,0.0009617868,0.0011304481,0.001515463,0.00058162864,0.0009936923],"domain_scores_gemma":[0.9940013,0.0012746647,0.00093965704,0.0034060257,0.000116246396,0.00026209914],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006848015,0.0008097207,0.0012153661,0.0006319031,0.00040403527,0.00011334536,0.0047501707,0.0004790562,0.000046140212],"category_scores_gemma":[0.00007277698,0.0005925145,0.0012430373,0.000802482,0.0023379156,0.00014338932,0.004333816,0.0021953091,0.000079401034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054652264,0.00046277803,0.013622726,0.00014414133,0.0007093525,0.00014548204,0.0061585666,0.0014801172,0.00008802426,0.97369576,0.00054118136,0.0028972058],"study_design_scores_gemma":[0.00050158025,0.00013183082,0.10417926,0.00016035297,0.00011454261,0.00019372668,0.00006370575,0.0046261195,0.00062341394,0.8867542,0.0020650388,0.00058620377],"about_ca_topic_score_codex":0.00018861967,"about_ca_topic_score_gemma":0.00014150208,"teacher_disagreement_score":0.596809,"about_ca_system_score_codex":0.000025782869,"about_ca_system_score_gemma":0.00050458295,"threshold_uncertainty_score":0.9996526},"labels":[],"label_agreement":null},{"id":"W3030279060","doi":"","title":"Computing Discrete Logarithms in the Jacobian of High-Genus Hyperelliptic Curves over Even Characteristic Finite Fields.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Hyperelliptic curve cryptography; Discrete logarithm; Jacobian matrix and determinant; Mathematics; Hyperelliptic curve; Logarithm; Genus; Base (topology); Finite field; Algorithm; Applied mathematics; Pure mathematics; Discrete mathematics; Computer science; Mathematical analysis; Elliptic curve cryptography","score_opus":0.01895489144504733,"score_gpt":0.2503952366414513,"score_spread":0.23144034519640397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030279060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26357716,0.00073521293,0.73146135,0.0012098607,0.0010579256,0.0007142796,0.000048820224,0.000075180316,0.0011202128],"genre_scores_gemma":[0.9026937,0.00068584207,0.09575472,0.00061437726,0.00011246992,0.000060436018,0.000053841435,0.000023234354,0.0000013765264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959955,0.0009668702,0.0009271065,0.001063654,0.00036908628,0.00067775714],"domain_scores_gemma":[0.99565804,0.0016885636,0.00065628963,0.0018091213,0.00007841925,0.000109559456],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079480535,0.000511544,0.0009505691,0.0004908196,0.00014536154,0.00007470994,0.003273398,0.0003784692,0.000051587776],"category_scores_gemma":[0.00022213494,0.00039649443,0.00041384329,0.00037144523,0.00063333404,0.000102415135,0.0029802043,0.001903048,0.000037364327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008719981,0.0005249974,0.021343125,0.0012219202,0.00040130227,0.00053286337,0.023314701,0.0019667696,0.00015058836,0.9363966,0.00027944788,0.0137805035],"study_design_scores_gemma":[0.00045806853,0.00015761702,0.36583623,0.000997029,0.00008456614,0.00008117574,0.00008544158,0.009364716,0.00013833886,0.62213326,0.0001326816,0.00053086865],"about_ca_topic_score_codex":0.0011002723,"about_ca_topic_score_gemma":0.00039456814,"teacher_disagreement_score":0.6391165,"about_ca_system_score_codex":0.000024527826,"about_ca_system_score_gemma":0.00017345996,"threshold_uncertainty_score":0.9998487},"labels":[],"label_agreement":null},{"id":"W3030299978","doi":"","title":"Implementing Pairings at the 192-bit Security Level.","year":2012,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Pairing; Embedding; Implementation; Speedup; Elliptic curve; Parallel computing; Computation; Bit (key); Curve25519; Theoretical computer science; Cryptography; Arithmetic; Public-key cryptography; Algorithm; Programming language; Mathematics; Operating system; Elliptic curve cryptography; Computer security; Encryption; Artificial intelligence; Physics","score_opus":0.028783759697085284,"score_gpt":0.2717220059528824,"score_spread":0.24293824625579707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030299978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12548023,0.001089815,0.85730815,0.005964299,0.0019511207,0.0008563703,0.00010060522,0.00034340745,0.0069059995],"genre_scores_gemma":[0.77357125,0.00024264648,0.2242168,0.0008542079,0.0006010379,0.00035771474,0.00007876903,0.00005907828,0.00001851149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949039,0.0007625913,0.000765442,0.0013771781,0.00049820676,0.0016926583],"domain_scores_gemma":[0.99575675,0.000784958,0.0006040639,0.002465173,0.000110636465,0.00027842238],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015857883,0.00064521853,0.0006775114,0.00031709528,0.00097490096,0.00021695849,0.0034454342,0.00037971392,0.00026530368],"category_scores_gemma":[0.00011555862,0.00048936135,0.0006879004,0.00029751906,0.00078119134,0.0001696248,0.021632554,0.0020478626,0.00044258585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022661714,0.00014219832,0.014782417,0.00013552753,0.00037035852,0.000062517676,0.012575157,0.000089105466,0.00044376956,0.9461819,0.0021536362,0.023040742],"study_design_scores_gemma":[0.00038424056,0.00003635257,0.046814997,0.00008373142,0.00009371725,0.00019870515,0.00017184996,0.0017759101,0.0020341629,0.9110129,0.036659837,0.0007336386],"about_ca_topic_score_codex":0.0003861215,"about_ca_topic_score_gemma":0.0011639025,"teacher_disagreement_score":0.648091,"about_ca_system_score_codex":0.00010447507,"about_ca_system_score_gemma":0.00017945001,"threshold_uncertainty_score":0.9997558},"labels":[],"label_agreement":null},{"id":"W3030409914","doi":"","title":"Provably Sublinear Point Multiplication on Koblitz Curves and its Hardware Implementation.","year":2006,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Sublinear function; Multiplication (music); Point (geometry); Conjecture; Mathematics; Multiplication algorithm; Base (topology); Arithmetic; Type (biology); Computer science; Discrete mathematics; Algorithm; Combinatorics; Binary number; Mathematical analysis","score_opus":0.01728105635806619,"score_gpt":0.2875493098742194,"score_spread":0.2702682535161532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030409914","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073485196,0.0020551335,0.9042991,0.015102501,0.0006699806,0.0023111536,0.000301123,0.00044281597,0.0013330127],"genre_scores_gemma":[0.24201575,0.0024633678,0.7497103,0.0026189147,0.00035777784,0.0014554161,0.0012930233,0.00007403409,0.00001138766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99660087,0.0003630208,0.00066471146,0.0014591551,0.0003597046,0.00055254705],"domain_scores_gemma":[0.99765307,0.00038403,0.00045003646,0.001135737,0.00020415365,0.0001729728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042330407,0.0004891654,0.0005374732,0.0005954789,0.00025860156,0.00018060852,0.0011568192,0.0002496097,0.00003486947],"category_scores_gemma":[0.00009072973,0.00046250588,0.00023775076,0.0002830004,0.00021633923,0.00019929995,0.002071554,0.0009409653,0.00008839256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004524268,0.0003091566,0.006092123,0.0006654464,0.00019712598,0.000054602628,0.0020555744,0.0004707314,0.0006941624,0.95989764,0.0050865645,0.02443161],"study_design_scores_gemma":[0.0018490689,0.00041505467,0.20329288,0.00072151236,0.00012123613,0.00013425153,0.00012327619,0.017737594,0.007004409,0.7607189,0.0064386623,0.0014431964],"about_ca_topic_score_codex":0.00017440441,"about_ca_topic_score_gemma":0.00014879064,"teacher_disagreement_score":0.1991788,"about_ca_system_score_codex":0.00005020644,"about_ca_system_score_gemma":0.00019319626,"threshold_uncertainty_score":0.9997827},"labels":[],"label_agreement":null},{"id":"W3030847392","doi":"","title":"On the Efficiency and Security of Pairing-Based Protocols in the Type 1 and Type 4 Settings.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Type (biology); Computer science; Protocol (science); Genus; Security analysis; Signature (topology); Elliptic curve; Hash function; Focus (optics); Pairing; Theoretical computer science; Mathematics; Computer security; Pure mathematics; Physics; Geometry","score_opus":0.015704501188230142,"score_gpt":0.2756636668611543,"score_spread":0.25995916567292415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030847392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8905871,0.00012687097,0.09454247,0.0056484574,0.00028660486,0.007665361,0.000011047429,0.000055857818,0.0010762542],"genre_scores_gemma":[0.96688396,0.000022071707,0.031532172,0.0005883684,0.00002927946,0.00093006773,0.0000033833164,0.000010492503,1.8751626e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787015,0.0006305958,0.00033128893,0.0006329384,0.00023079266,0.0003042544],"domain_scores_gemma":[0.9967814,0.0017590885,0.00024873394,0.0010632304,0.00009435744,0.00005316896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012000605,0.00025822374,0.0003464257,0.00021795755,0.00015500074,0.00008531756,0.0013211195,0.00023192812,0.000008947546],"category_scores_gemma":[0.0004992156,0.00015015114,0.000075966374,0.00036820967,0.0008850785,0.00002820451,0.0011952018,0.0016743399,0.0000045791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007846355,0.00021076539,0.010470422,0.0001662233,0.00002692945,0.000030570256,0.0064444817,0.00021953246,0.00030564744,0.9804884,0.00012444457,0.0014340795],"study_design_scores_gemma":[0.0003755621,0.00037644108,0.053896986,0.00026130278,0.000014690746,0.00003466619,0.000089958914,0.016921325,0.00078433665,0.92654985,0.00045231683,0.00024255029],"about_ca_topic_score_codex":0.00004762119,"about_ca_topic_score_gemma":0.000115897936,"teacher_disagreement_score":0.0762969,"about_ca_system_score_codex":0.000006800164,"about_ca_system_score_gemma":0.00018147612,"threshold_uncertainty_score":0.72742665},"labels":[],"label_agreement":null},{"id":"W3036444063","doi":"10.1515/jmc-2015-0056","title":"New Techniques for SIDH-based NIKE","year":2020,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; York University; University of Toronto","funders":"Canada First Research Excellence Fund; Public Works and Government Services Canada; Royal Bank of Canada","keywords":"Key exchange; Computer science; Isogeny; Adversary; Key (lock); Computer security; Public-key cryptography; Protocol (science); Nike; Cryptography; Diffie–Hellman key exchange; Mathematics; Elliptic curve; Advertising","score_opus":0.02557958490615122,"score_gpt":0.27494622182961026,"score_spread":0.24936663692345903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036444063","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058944063,0.000115155475,0.9543043,0.044272225,0.000109921246,0.00013462694,6.094406e-7,0.000056993205,0.0004167781],"genre_scores_gemma":[0.075525075,0.0000046206596,0.92182547,0.0023312976,0.00029548135,0.000003814501,1.4955896e-7,0.000008574682,0.000005530537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988602,0.000058220216,0.000509126,0.00014457709,0.00021303086,0.00021483951],"domain_scores_gemma":[0.9987284,0.00041495083,0.000266447,0.00017735965,0.00014681986,0.00026601765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031621126,0.00011528729,0.00038552747,0.00012570451,0.00004583678,0.000051291907,0.00075029867,0.000105495514,0.000030037334],"category_scores_gemma":[0.00046962846,0.00008259074,0.00027713302,0.0002536002,0.000035805133,0.00014620021,0.00006350463,0.0002038742,0.000014389465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114373564,0.00019216003,0.000071591654,0.00022285937,0.00007920842,0.00009459559,0.00051870756,0.000023878278,0.003562899,0.9134238,0.03352685,0.048169106],"study_design_scores_gemma":[0.0013714595,0.0023020266,0.000094211544,0.00009810327,0.00007258924,0.00041515983,0.000072417206,0.013614245,0.031119233,0.9262939,0.024283588,0.0002630596],"about_ca_topic_score_codex":3.3439744e-7,"about_ca_topic_score_gemma":2.0269202e-7,"teacher_disagreement_score":0.07493563,"about_ca_system_score_codex":0.000009677526,"about_ca_system_score_gemma":0.00015860364,"threshold_uncertainty_score":0.33679527},"labels":[],"label_agreement":null},{"id":"W3036855880","doi":"10.1515/jmc-2015-0057","title":"A subexponential-time, polynomial quantum space algorithm for inverting the CM group action","year":2020,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Canada First Research Excellence Fund; Public Works and Government Services Canada; Royal Bank of Canada","keywords":"Isogeny; Mathematics; Polynomial; Group (periodic table); Quantum algorithm; Action (physics); Quantum computer; Time complexity; Quantum; Cryptosystem; Multiplication (music); Group action; Discrete mathematics; Space (punctuation); Algorithm; Algebra over a field; Elliptic curve; Combinatorics; Pure mathematics; Computer science; Cryptography; Mathematical analysis; Quantum mechanics; Physics","score_opus":0.03095288594065633,"score_gpt":0.2680828124425766,"score_spread":0.23712992650192027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036855880","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0145295905,0.00013419086,0.958973,0.025621459,0.00041202272,0.0002256225,0.0000012202581,0.00003459966,0.000068288726],"genre_scores_gemma":[0.22976388,0.00002901679,0.7677798,0.0013360544,0.0010379485,0.000021408892,7.041799e-7,0.000023055776,0.0000081026365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839884,0.00018638087,0.0006243945,0.00018842082,0.00029326792,0.00030872133],"domain_scores_gemma":[0.99834955,0.00065908296,0.00046898285,0.00020623446,0.00013621188,0.00017992935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007159672,0.00014836655,0.00040861912,0.000106383675,0.00017530611,0.00010478609,0.0008045471,0.00011501735,0.000022603714],"category_scores_gemma":[0.00046854562,0.00009245505,0.00034311574,0.00031341964,0.000088691144,0.00028029043,0.00014856854,0.00034340247,0.000034576275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046549327,0.0008518602,0.0000709651,0.00037462031,0.00063908694,0.00019900933,0.005181497,0.00007742339,0.061879057,0.69819975,0.038906097,0.19315514],"study_design_scores_gemma":[0.0023102749,0.0021308078,0.00019198022,0.000088402245,0.0001843273,0.0015385925,0.00086450926,0.7086035,0.004739522,0.2712803,0.0077035963,0.00036419075],"about_ca_topic_score_codex":0.0000015177827,"about_ca_topic_score_gemma":4.698424e-7,"teacher_disagreement_score":0.7085261,"about_ca_system_score_codex":0.00001819993,"about_ca_system_score_gemma":0.000059685866,"threshold_uncertainty_score":0.37702075},"labels":[],"label_agreement":null},{"id":"W3040773772","doi":"10.1007/978-3-030-52200-1_48","title":"Implementing the Tangent Graeffe Root Finding Method","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Tangent; Root (linguistics); Mathematics; Geometry; Philosophy","score_opus":0.023802716190138375,"score_gpt":0.2832389407379264,"score_spread":0.25943622454778803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040773772","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026896038,0.00085755065,0.9899887,0.0045178304,0.0013604249,0.0004519014,0.0000041245266,0.00015681107,0.002635778],"genre_scores_gemma":[0.0950777,0.00004126861,0.9006187,0.0032170347,0.0008673721,0.000020239175,0.000004337056,0.000046738445,0.000106662694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958023,0.0000967221,0.00054039474,0.0015205464,0.0011019651,0.0009380814],"domain_scores_gemma":[0.99708456,0.0009818597,0.000321346,0.0013035155,0.00012351458,0.00018517915],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020568518,0.0005061123,0.00046531245,0.0005812881,0.0008315593,0.00089026766,0.0047137253,0.00019059039,0.000024897841],"category_scores_gemma":[0.00009538439,0.0003530164,0.00027729236,0.001207653,0.00044606676,0.00033382958,0.00316952,0.0010646122,0.00003102746],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025145832,0.0000129508135,0.00012513259,0.00003697783,0.00003192324,0.00010584328,0.001443346,0.0050780154,0.00020292048,0.11752242,0.00005431431,0.8753836],"study_design_scores_gemma":[0.00039693734,0.00024732653,0.0006891471,0.00040163452,0.000044237193,0.00017471335,0.0000013469771,0.52999085,0.0038726088,0.43951404,0.023459248,0.0012078872],"about_ca_topic_score_codex":0.000031395026,"about_ca_topic_score_gemma":0.00015971494,"teacher_disagreement_score":0.8741757,"about_ca_system_score_codex":0.00012307038,"about_ca_system_score_gemma":0.00029188386,"threshold_uncertainty_score":0.9998922},"labels":[],"label_agreement":null},{"id":"W3081740921","doi":"","title":"Further Optimizations of CSIDH: A Systematic Approach to Efficient Strategies, Permutations, and Bound Vectors.","year":2019,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Speedup; Computer science; Partition (number theory); Class (philosophy); Supersingular elliptic curve; Theoretical computer science; Algorithm; Elliptic curve; Parallel computing; Mathematics; Combinatorics","score_opus":0.01194958658092149,"score_gpt":0.24372692565375378,"score_spread":0.2317773390728323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081740921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0569565,0.00072028226,0.9360887,0.00037882724,0.0004792087,0.0020594285,0.000045479577,0.0001148011,0.0031567917],"genre_scores_gemma":[0.5389143,0.000041360494,0.4606745,0.00004564246,0.000022019134,0.00025391692,0.000025311077,0.000021185124,0.0000017670977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969027,0.00055312546,0.000750695,0.0010358281,0.00033145296,0.00042622202],"domain_scores_gemma":[0.9972131,0.00058566005,0.00043645178,0.0014060435,0.00017589508,0.00018282839],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044502952,0.00041202395,0.00090483914,0.0007545829,0.00015164548,0.0002447606,0.001217638,0.00025209747,0.0000065725135],"category_scores_gemma":[0.00012290753,0.00036501721,0.00023525994,0.0004050062,0.00037256192,0.00008049384,0.001985181,0.0005716567,0.000028934997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000941872,0.00020773042,0.00042162108,0.0041146493,0.00020542799,0.0000057127622,0.01278305,0.26628897,0.00011164543,0.71576756,0.00002960952,0.00005460573],"study_design_scores_gemma":[0.0007820671,0.00023296206,0.01890233,0.0027016613,0.0003099587,0.00019651676,0.003720591,0.44735458,0.00015207265,0.52453476,0.000026482128,0.0010859811],"about_ca_topic_score_codex":0.000072376206,"about_ca_topic_score_gemma":0.000026405893,"teacher_disagreement_score":0.48195782,"about_ca_system_score_codex":0.000040020393,"about_ca_system_score_gemma":0.0004568158,"threshold_uncertainty_score":0.9998802},"labels":[],"label_agreement":null},{"id":"W3097454540","doi":"10.48550/arxiv.2001.04137","title":"Computing isogenies from modular equations in genus two","year":2020,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canarie","funders":"","keywords":"Isogeny; Genus; Mathematics; Kernel (algebra); Isomorphism (crystallography); Modular design; Modular form; Pure mathematics; Multiplication (music); Algebra over a field; Abelian group; Combinatorics; Computer science; Botany; Biology","score_opus":0.019558296292112014,"score_gpt":0.23703765384820993,"score_spread":0.21747935755609793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097454540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11386015,0.0018049591,0.8662437,0.012647582,0.00030423372,0.00034005733,0.000040787916,0.00032738107,0.004431133],"genre_scores_gemma":[0.76038444,0.0001435354,0.23897539,0.00014434525,0.00003175996,0.000023381617,0.00017288452,0.000021957278,0.0001022906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937721,0.0036535985,0.000614643,0.001106392,0.0004689279,0.0003843418],"domain_scores_gemma":[0.99443924,0.0019498621,0.00039961922,0.0023025256,0.00072015636,0.00018857598],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023100288,0.00033418552,0.00041714928,0.00032852407,0.00031990293,0.0007242004,0.002830806,0.000209306,0.000028517537],"category_scores_gemma":[0.00089362037,0.00037483053,0.00026524413,0.0009375553,0.00017048979,0.00020022535,0.0034615975,0.00085324055,0.000047766523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011166595,0.0011296632,0.009901121,0.00020927684,0.00030498838,0.00009326816,0.07230534,0.011028535,0.00687699,0.6548923,0.00037531104,0.24287201],"study_design_scores_gemma":[0.000735925,4.1435126e-7,0.016912457,0.0011920431,0.000034794757,0.0000040963737,0.00010795245,0.87654656,0.014236634,0.08817543,0.0014012872,0.0006523829],"about_ca_topic_score_codex":0.0047083683,"about_ca_topic_score_gemma":0.0025199254,"teacher_disagreement_score":0.86551803,"about_ca_system_score_codex":0.00007921852,"about_ca_system_score_gemma":0.0002720328,"threshold_uncertainty_score":0.99987036},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.005256157962366835,"score_gpt":0.20730803976797818,"score_spread":0.20205188180561134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101994345","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9527712,0.000046367062,0.041065276,0.00043832854,0.0007156104,0.000091495756,7.9978025e-7,0.00014788927,0.004723066],"genre_scores_gemma":[0.96157706,0.0000035884073,0.03819405,0.000049218146,0.00005609513,0.0000036115982,9.794151e-7,0.000004955396,0.0001104427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990595,0.00003923799,0.00019840892,0.0002738232,0.0001556123,0.00027342557],"domain_scores_gemma":[0.9994021,0.000121004465,0.000042693922,0.00033975134,0.000030924388,0.00006353963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025016928,0.00010275486,0.00012732527,0.00020591584,0.00007471305,0.00013236981,0.00050512236,0.00006969762,0.00016489405],"category_scores_gemma":[0.00003496755,0.00008741152,0.00007148214,0.000464217,0.00012339836,0.00028523328,0.00014983877,0.0002498675,0.00018591822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071945233,0.00011969915,0.04732511,0.000014327499,0.000022333124,0.000057341655,0.0007703505,0.000017485156,0.07523277,0.85637707,0.00024815238,0.01980819],"study_design_scores_gemma":[0.0027878857,0.00027898132,0.083667874,0.00007489562,0.000029313253,0.00071390934,0.000741156,0.7080496,0.09708072,0.10073971,0.0040150518,0.0018209219],"about_ca_topic_score_codex":0.00012297134,"about_ca_topic_score_gemma":0.00022788269,"teacher_disagreement_score":0.75563735,"about_ca_system_score_codex":0.0000058616706,"about_ca_system_score_gemma":0.000034177974,"threshold_uncertainty_score":0.35645384},"labels":[],"label_agreement":null},{"id":"W3102327505","doi":"","title":"MORDELL’S EQUATION: A CLASSICAL APPROACH","year":2016,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Diophantine equation; Thue equation; Logarithm; Diophantine set; Lattice (music); Connection (principal bundle); Lattice reduction; Reduction (mathematics); Pure mathematics; Discrete mathematics; Applied mathematics; Mathematical analysis; Statistics; Geometry","score_opus":0.025969775841164517,"score_gpt":0.2225772172104383,"score_spread":0.19660744136927377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102327505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008664394,0.000041869018,0.9457783,0.004771251,0.00009211569,0.000050400104,1.9240946e-7,0.00015477155,0.04824467],"genre_scores_gemma":[0.7922735,0.000011938543,0.20504783,0.0002459385,0.000060700168,0.000011489801,2.1163791e-7,0.000003136485,0.002345208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993459,0.000027694023,0.000091795846,0.0002207463,0.00016220335,0.0001516471],"domain_scores_gemma":[0.99948347,0.000075593,0.000017654045,0.000331753,0.000026806269,0.00006475174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010916948,0.000058693317,0.000060263646,0.000062618834,0.000053661824,0.000050007464,0.000400164,0.00003471872,0.00004580724],"category_scores_gemma":[0.000013640075,0.000029867635,0.000054971028,0.00026486162,0.00005125925,0.00021958291,0.000103340586,0.000032802254,0.0001336067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010226647,0.0000524771,0.00026625025,0.0000017132922,0.0000056684644,0.0000019683946,0.000051998562,0.0000035245057,0.00033785144,0.8839019,0.0020436929,0.113331914],"study_design_scores_gemma":[0.003991064,0.00052288466,0.031585276,0.00006809081,0.000027100037,0.00017614232,0.00010040993,0.31415284,0.012651473,0.4493585,0.1858527,0.0015135127],"about_ca_topic_score_codex":0.0000034272684,"about_ca_topic_score_gemma":0.000001043281,"teacher_disagreement_score":0.7914071,"about_ca_system_score_codex":0.000007297489,"about_ca_system_score_gemma":0.000021542612,"threshold_uncertainty_score":0.17172885},"labels":[],"label_agreement":null},{"id":"W3105153654","doi":"10.1016/j.aej.2020.10.058","title":"Word-serial unified and scalable semi-systolic processor for field multiplication and squaring","year":2020,"lang":"en","type":"article","venue":"Alexandria Engineering Journal","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Deanship of Scientific Research, Prince Sattam bin Abdulaziz University; Prince Sattam bin Abdulaziz University","keywords":"Multiplication (music); Arithmetic; Word (group theory); Scalability; Field (mathematics); Computer science; Systolic array; Parallel computing; Mathematics; Embedded system; Pure mathematics; Combinatorics; Very-large-scale integration; Operating system","score_opus":0.011272943379512918,"score_gpt":0.2103751971076214,"score_spread":0.19910225372810847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105153654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24286985,0.0005884127,0.75421286,0.0018627611,0.00021138508,0.0001578402,7.960615e-7,0.00007860464,0.000017468286],"genre_scores_gemma":[0.93491524,0.0001278368,0.06446169,0.00013340497,0.0003245726,0.000014817061,5.6664095e-7,0.000010810694,0.0000110607525],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931407,0.000009797068,0.00017827407,0.00020359516,0.00009485352,0.00019941131],"domain_scores_gemma":[0.99947476,0.00013908502,0.000058782443,0.00009708091,0.00004743442,0.00018288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014740147,0.00010855299,0.00013773445,0.00008097519,0.00014908689,0.00026886287,0.0001981823,0.000058977184,0.0000023287514],"category_scores_gemma":[0.00013308527,0.000098913355,0.000037649806,0.00020426854,0.000011778892,0.00030550497,0.00006823304,0.00017007893,5.8856267e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086268125,0.00031481826,0.025578713,0.003948811,0.000830596,0.00014793055,0.02508807,0.09159913,0.4159469,0.082604274,0.0054353923,0.3476427],"study_design_scores_gemma":[0.0025919878,0.0003637602,0.009024176,0.00018428007,0.000042252363,0.00040471004,0.00005999062,0.9683546,0.011608876,0.00080783246,0.0061196256,0.00043790476],"about_ca_topic_score_codex":0.000003658185,"about_ca_topic_score_gemma":0.0000010727127,"teacher_disagreement_score":0.8767555,"about_ca_system_score_codex":0.000006981988,"about_ca_system_score_gemma":0.000021291653,"threshold_uncertainty_score":0.40335697},"labels":[],"label_agreement":null},{"id":"W3108917887","doi":"10.1007/s13389-020-00245-4","title":"x-only point addition formula and faster compressed SIKE","year":2020,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Royal Bank of Canada","keywords":"Point (geometry); Mathematics; Computer science; Geometry","score_opus":0.00704499768570218,"score_gpt":0.18271925261994246,"score_spread":0.17567425493424027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108917887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12067289,0.0009863812,0.87617004,0.0017023154,0.00023186003,0.00007118893,0.0000019369688,0.00006756774,0.00009582413],"genre_scores_gemma":[0.9373385,0.00016421932,0.062012225,0.00030200154,0.00016940845,0.000001220889,4.857526e-7,0.000011340129,6.5363844e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989455,0.000022992004,0.00038244383,0.00015441008,0.00028710626,0.00020755727],"domain_scores_gemma":[0.9992257,0.00010266091,0.00017146001,0.0001432617,0.00010694315,0.00025000115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018624277,0.00015004589,0.00024604116,0.0003634024,0.00005489247,0.00014099354,0.00037858702,0.000060013266,0.000010376732],"category_scores_gemma":[0.000046083638,0.0001269971,0.00018613899,0.00063049194,0.000032097138,0.0006768398,0.00008960983,0.00031303335,0.0000013372878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038701927,0.00073967787,0.020436144,0.0020743906,0.0021744564,0.0017140347,0.017601404,0.074444056,0.29040882,0.40537736,0.007929397,0.17671323],"study_design_scores_gemma":[0.008594677,0.003519211,0.1765532,0.0013842285,0.00030585393,0.0037273595,0.0004889081,0.72447133,0.014013935,0.015044534,0.049660333,0.0022364461],"about_ca_topic_score_codex":9.802704e-7,"about_ca_topic_score_gemma":4.4509585e-7,"teacher_disagreement_score":0.8166656,"about_ca_system_score_codex":0.000005689568,"about_ca_system_score_gemma":0.000022826358,"threshold_uncertainty_score":0.5178791},"labels":[],"label_agreement":null},{"id":"W3111886287","doi":"10.1515/jmc-2020-0071","title":"Towards Isogeny-Based Password-Authenticated Key Establishment","year":2020,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund; Public Works and Government Services Canada; Royal Bank of Canada","keywords":"Password; Computer science; Key exchange; Zero-knowledge password proof; Authenticated Key Exchange; Computer security; Cryptography; Cryptographic primitive; Key (lock); Password strength; Public-key cryptography; Theoretical computer science; One-time password; Cryptographic protocol; Encryption","score_opus":0.024331022819154207,"score_gpt":0.25355519293764867,"score_spread":0.22922417011849447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111886287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024604367,0.00019118076,0.9286432,0.045316983,0.00024824875,0.000108078784,0.0000012462823,0.000059287624,0.0008273828],"genre_scores_gemma":[0.7185555,0.0000096986905,0.27957052,0.0017337048,0.00011379221,0.0000030500132,3.9483126e-7,0.000010581712,0.0000027351346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979541,0.00017126011,0.0007918914,0.00022915528,0.0005053828,0.00034823795],"domain_scores_gemma":[0.9984527,0.00022000431,0.0003902253,0.00030863544,0.000238759,0.00038965014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049688586,0.00018355376,0.0005310074,0.00019106567,0.00006721317,0.00011451044,0.0011485459,0.0001283539,0.0001153531],"category_scores_gemma":[0.0005175076,0.00013130037,0.00031552016,0.00060431974,0.0000899341,0.00022418518,0.00016172354,0.00037831333,0.000088407935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019907068,0.0013640992,0.0004920509,0.00041571775,0.00036686892,0.0010178381,0.0038662944,0.00020827143,0.00538952,0.9525849,0.009359152,0.024736207],"study_design_scores_gemma":[0.005202864,0.0036455076,0.0020430873,0.00028510878,0.0003668315,0.0014832448,0.0006861441,0.12534276,0.026340945,0.8203592,0.013260137,0.0009842085],"about_ca_topic_score_codex":6.8914306e-7,"about_ca_topic_score_gemma":2.1535034e-7,"teacher_disagreement_score":0.69395113,"about_ca_system_score_codex":0.000022483016,"about_ca_system_score_gemma":0.00017860763,"threshold_uncertainty_score":0.5354274},"labels":[],"label_agreement":null},{"id":"W3121179842","doi":"","title":"A Simple Left-to-Right Algorithm for Minimal Weight Signed Radix-r Representations","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Arithmetic; Simple (philosophy); Integer (computer science); Radix (gastropod); Cryptography; Coding theory; Coding (social sciences); Representation (politics); Elliptic curve cryptography; Integer sequence; Discrete mathematics; Algorithm; Public-key cryptography; Computer science; Encryption","score_opus":0.007743766295761091,"score_gpt":0.24914349581348486,"score_spread":0.24139972951772376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121179842","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021208546,0.00007766893,0.98821175,0.0019026169,0.0002716121,0.0004913997,0.000015749498,0.00024124721,0.0066670924],"genre_scores_gemma":[0.1181406,0.000002516828,0.8773785,0.00049914926,0.00029800436,0.00009868591,0.000026340538,0.000016490678,0.0035396814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985654,0.0000376075,0.00027776943,0.0005016552,0.00022820622,0.00038936755],"domain_scores_gemma":[0.9989444,0.00025077994,0.000049338247,0.0005234071,0.00010436045,0.00012772821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014794372,0.0001499836,0.00016374362,0.00025094792,0.00034699112,0.00018808054,0.00061443634,0.00005855103,0.00010297097],"category_scores_gemma":[0.0000147541605,0.00012228443,0.00017303124,0.0005892244,0.000055873497,0.00029769048,0.000123767,0.000056571505,0.00005170184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025525995,0.0008491697,0.002009118,0.000030628853,0.000121507495,0.00007822388,0.00080600433,0.00040358232,0.009201875,0.55284184,0.23605241,0.1975801],"study_design_scores_gemma":[0.003909026,0.00083075406,0.035981596,0.0000243952,0.0000819589,0.00011403387,0.00015558525,0.40951425,0.09695058,0.23923269,0.21171454,0.0014905935],"about_ca_topic_score_codex":0.00024282803,"about_ca_topic_score_gemma":0.00012525718,"teacher_disagreement_score":0.40911067,"about_ca_system_score_codex":0.000016165633,"about_ca_system_score_gemma":0.00004365173,"threshold_uncertainty_score":0.49866143},"labels":[],"label_agreement":null},{"id":"W3124639266","doi":"10.1145/3457341.3457345","title":"Improved divisor arithmetic on generic hyperelliptic curves","year":2020,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Divisor (algebraic geometry); Hyperelliptic curve cryptography; Mathematics; Finite field; Hyperelliptic curve; Abelian group; Magma; Algebra over a field; Group (periodic table); Class (philosophy); Arithmetic; Algebraic number; Algebraic geometry; Field (mathematics); Cryptography; Discrete mathematics; Pure mathematics; Computer science; Elliptic curve cryptography; Algorithm; Encryption; Public-key cryptography","score_opus":0.05469412100311326,"score_gpt":0.2745955631548803,"score_spread":0.21990144215176705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124639266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023198912,0.008256631,0.87148565,0.094218604,0.00046137942,0.0008381795,0.0000070642436,0.00070270046,0.0008308905],"genre_scores_gemma":[0.5903833,0.002057169,0.3950137,0.012356073,0.00007714858,0.000072213974,0.000013714305,0.00001987696,0.0000068371164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980386,0.000327778,0.0004632854,0.000559541,0.00024778387,0.00036305023],"domain_scores_gemma":[0.9942022,0.0007800628,0.00011898466,0.00464727,0.00007713902,0.00017433353],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00026102248,0.00024841286,0.00030840645,0.0002412476,0.00023664396,0.00017752928,0.007602558,0.00008031277,0.000010481932],"category_scores_gemma":[0.00013872629,0.00023749455,0.00014715205,0.001722029,0.00017674796,0.00030157337,0.0033472276,0.00053350296,0.00010955914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032375487,0.0024117786,0.005776717,0.00044060932,0.00028528133,0.000060837603,0.0056060962,0.0017829834,0.0017041754,0.19658528,0.012381632,0.77293223],"study_design_scores_gemma":[0.0010770193,0.0005643833,0.017911203,0.00031956777,0.000029597222,0.000026079091,0.000021369613,0.95517087,0.000360922,0.016227162,0.007561034,0.0007308015],"about_ca_topic_score_codex":0.000032658205,"about_ca_topic_score_gemma":0.000017621376,"teacher_disagreement_score":0.95338786,"about_ca_system_score_codex":0.000032705084,"about_ca_system_score_gemma":0.000065424654,"threshold_uncertainty_score":0.9977668},"labels":[],"label_agreement":null},{"id":"W3127874933","doi":"10.1109/tc.2007.250622","title":"Low-Weight Polynomial Form Integers for Efficient Modular Multiplication","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Modular arithmetic; Mathematics; Moduli; Elliptic curve; Mersenne prime; Integer (computer science); Polynomial; Prime (order theory); Finite field; Discrete mathematics; Multiplication (music); Cryptosystem; Arithmetic; Cryptography; Pure mathematics; Combinatorics; Computer science; Algorithm","score_opus":0.006939187852687204,"score_gpt":0.21135899217323653,"score_spread":0.20441980432054932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127874933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03480314,0.000020899315,0.9617912,0.00060922856,0.0018974887,0.00050428126,0.000014204619,0.00028076724,0.00007879508],"genre_scores_gemma":[0.91971743,0.0000044252606,0.07984167,0.00017461536,0.00011068054,0.000094034,0.0000043263985,0.000015240478,0.00003756637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986407,0.00002967216,0.0002844037,0.00048520791,0.00022025403,0.00033974583],"domain_scores_gemma":[0.9990749,0.00018405882,0.00007580866,0.0004982969,0.000078276724,0.000088659945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012781969,0.00019874294,0.00016795761,0.00034312456,0.0003408205,0.00012229732,0.00054616743,0.00009051885,0.0000030466554],"category_scores_gemma":[0.0000010345248,0.0001873653,0.00029703262,0.00047750247,0.0000726569,0.00017400805,0.0000035037028,0.00015035094,0.000019898747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006595886,0.00091854844,0.000007957307,0.00003487702,0.00006432583,0.0000044018675,0.0003952675,0.814854,0.005812848,0.003349405,0.0015308158,0.17296158],"study_design_scores_gemma":[0.0011236421,0.00016365308,0.00032198976,0.00003852065,0.000019021094,0.000010759937,0.0000089914165,0.92267746,0.07374016,0.00041730935,0.0012008812,0.0002776254],"about_ca_topic_score_codex":0.000071843955,"about_ca_topic_score_gemma":0.000021355941,"teacher_disagreement_score":0.8849143,"about_ca_system_score_codex":0.00008442506,"about_ca_system_score_gemma":0.000037423793,"threshold_uncertainty_score":0.76405346},"labels":[],"label_agreement":null},{"id":"W3130406170","doi":"10.1109/tvlsi.2021.3058509","title":"An Efficient and High-Speed Overlap-Free Karatsuba-Based Finite-Field Multiplier for FGPA Implementation","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"FedDev Ontario","keywords":"Operand; Elliptic curve cryptography; Field-programmable gate array; Cryptography; Computer science; Multiplier (economics); Finite field; Public-key cryptography; Key (lock); Gate array; Multiplication (music); Computer hardware; Parallel computing; Arithmetic; Embedded system; Algorithm; Mathematics; Encryption","score_opus":0.011393731774626189,"score_gpt":0.26568274510228135,"score_spread":0.25428901332765513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130406170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07102909,0.00010686811,0.92506,0.0006319211,0.001957934,0.0007299738,0.0002661364,0.00017948469,0.000038620354],"genre_scores_gemma":[0.98725307,0.000016666141,0.011919178,0.00034055882,0.00008843066,0.00020047347,0.000060471473,0.000022764158,0.000098378005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773216,0.00023515472,0.00052575493,0.0006919457,0.0004329145,0.00038207322],"domain_scores_gemma":[0.9978386,0.0006487622,0.00014432566,0.00084369944,0.00035212428,0.0001724873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000436974,0.00027581034,0.0002969211,0.0003382325,0.0005576254,0.00048717883,0.00037121336,0.00018316161,0.000048106438],"category_scores_gemma":[0.00002626447,0.00025360554,0.00020748097,0.0005921908,0.000041238363,0.00038409946,0.000004905179,0.00023723762,0.000013880057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077598094,0.005349018,0.0007314351,0.00069630315,0.00048557762,0.000072326824,0.008086715,0.7412124,0.10048854,0.03146782,0.0028366896,0.10779719],"study_design_scores_gemma":[0.002939749,0.0005518546,0.00037503502,0.00012464548,0.00006254007,0.000012724636,0.001854235,0.8118347,0.18081437,0.00017326519,0.0008716258,0.0003852377],"about_ca_topic_score_codex":0.00020370698,"about_ca_topic_score_gemma":0.00091794314,"teacher_disagreement_score":0.916224,"about_ca_system_score_codex":0.00008008845,"about_ca_system_score_gemma":0.00012040074,"threshold_uncertainty_score":0.9999916},"labels":[],"label_agreement":null},{"id":"W3146510765","doi":"10.1109/fdtc.2007.19","title":"Fault Detection Structures for the Montgomery Multiplication over Binary Extension Fields","year":2007,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Error detection and correction; Binary number; Multiplication (music); Arithmetic; Finite field; Redundancy (engineering); Finite field arithmetic; Cryptography; Multiplier (economics); Algorithm; Parallel computing; Theoretical computer science; Mathematics; Discrete mathematics","score_opus":0.013107557648775603,"score_gpt":0.26213509433157833,"score_spread":0.24902753668280272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3146510765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11825854,0.00023813665,0.8801604,0.0004946846,0.00036444605,0.00024652324,3.568332e-7,0.00009556009,0.00014138548],"genre_scores_gemma":[0.98072594,0.000027181237,0.01865402,0.0004038566,0.00008690082,0.000015322394,7.818079e-7,0.0000039099564,0.00008207042],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99936134,0.0000121030125,0.00012568782,0.00021351902,0.0001279216,0.00015941866],"domain_scores_gemma":[0.99913436,0.00034635855,0.000042891515,0.00038045636,0.00006294877,0.000032957585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025910148,0.000073055264,0.000053735857,0.000090220106,0.00026181043,0.000054977743,0.0002743343,0.00007492537,0.0000060287343],"category_scores_gemma":[0.000030102909,0.00004304285,0.00008158621,0.00027775482,0.00002884792,0.00016376868,0.00006206527,0.000081197235,0.000002348938],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051840863,0.00004678964,0.0003638437,0.000012717784,0.000025062627,0.0000023062605,0.00037754365,0.0010163732,0.045086708,0.024576161,0.0010516563,0.92738897],"study_design_scores_gemma":[0.0005779585,0.00019084006,0.5758067,0.00000728126,0.00001832801,0.000019706147,0.00013401065,0.3167948,0.077184536,0.021989426,0.0070482516,0.00022815984],"about_ca_topic_score_codex":0.00010793546,"about_ca_topic_score_gemma":0.0001600148,"teacher_disagreement_score":0.92716086,"about_ca_system_score_codex":0.000008933282,"about_ca_system_score_gemma":0.000006428202,"threshold_uncertainty_score":0.20136607},"labels":[],"label_agreement":null},{"id":"W3158353526","doi":"10.1007/978-3-030-81293-5_16","title":"Memory Optimization Techniques for Computing Discrete Logarithms in Compressed SIKE","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; University of Waterloo","funders":"","keywords":"Computer science; Isogeny; Key encapsulation; Logarithm; Suite; Discrete logarithm; Key (lock); Public-key cryptography; Algorithm; Theoretical computer science; Mathematics; Elliptic curve; Symmetric-key algorithm; Computer security","score_opus":0.012629593172033736,"score_gpt":0.24925357093429615,"score_spread":0.2366239777622624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158353526","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022367767,0.0007643987,0.99511045,0.0006727879,0.0010525807,0.0008599238,0.000007993294,0.00023548413,0.0012740343],"genre_scores_gemma":[0.03728056,0.00007483844,0.9613508,0.00080788694,0.00031301842,0.000021983047,0.000024409783,0.000040758063,0.00008574487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99608564,0.00006581181,0.0007021559,0.001710469,0.00070360885,0.0007322963],"domain_scores_gemma":[0.9972128,0.0008497095,0.00032055465,0.0011588566,0.0003239555,0.00013410122],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009996417,0.00054362393,0.0006990258,0.0013080182,0.00030544534,0.0006583261,0.0025747663,0.00041677893,0.000009525794],"category_scores_gemma":[0.00009984133,0.0005194209,0.00022768682,0.0010982157,0.0006117349,0.0005033066,0.0013265961,0.00076839066,0.0000017087874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007829882,0.00005006812,0.000040420462,0.000110713416,0.0000138351415,0.00009827097,0.00058383663,0.5544876,0.00011398687,0.010427933,0.000012611549,0.4340529],"study_design_scores_gemma":[0.00039274726,0.00013243173,0.000077390236,0.0008507246,0.00000910394,0.000044676566,6.467413e-7,0.96209913,0.0036890905,0.03170378,0.0003353364,0.00066493324],"about_ca_topic_score_codex":0.00003772085,"about_ca_topic_score_gemma":0.00010783181,"teacher_disagreement_score":0.433388,"about_ca_system_score_codex":0.0001902037,"about_ca_system_score_gemma":0.00040837444,"threshold_uncertainty_score":0.99972576},"labels":[],"label_agreement":null},{"id":"W316013059","doi":"10.1007/978-1-4419-5906-5_255","title":"NIST Elliptic Curves","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"NIST; Mathematics; Computer science; Natural language processing","score_opus":0.031379304473183815,"score_gpt":0.19464347676999125,"score_spread":0.16326417229680742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W316013059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004816085,0.0015312455,0.6870493,0.0006735718,0.00033375912,0.0000952154,2.5010462e-7,0.00034891165,0.30515167],"genre_scores_gemma":[0.88150114,0.0002674628,0.11557801,0.0013966906,0.000022251568,0.000006105075,3.0037688e-7,0.0000040832756,0.0012239706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9995437,0.00001584133,0.00007514873,0.00014592236,0.00009010949,0.0001292719],"domain_scores_gemma":[0.99957776,0.000016445863,0.000015514996,0.00031919024,0.000019373825,0.000051695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007995353,0.000051307383,0.000053005708,0.00004760783,0.00005258658,0.000024991708,0.0004656339,0.000017038083,0.00018691785],"category_scores_gemma":[0.0000051426114,0.000037535927,0.000046352,0.00024700584,0.00003949042,0.00015889686,0.00008217868,0.00004172252,0.00020725126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012002401,0.00011132907,0.0035568054,0.00003489918,0.000015899419,0.000024164214,0.0005231918,3.1426862e-7,0.00015551155,0.9730937,0.0070423065,0.015440663],"study_design_scores_gemma":[0.0013771434,0.0008893327,0.4586716,0.0004515851,0.000071113005,0.00030065875,0.00020732754,0.01232038,0.07440739,0.379519,0.06968092,0.0021035504],"about_ca_topic_score_codex":0.000046494995,"about_ca_topic_score_gemma":0.0000074681343,"teacher_disagreement_score":0.876685,"about_ca_system_score_codex":0.000001856284,"about_ca_system_score_gemma":0.000010937941,"threshold_uncertainty_score":0.26638648},"labels":[],"label_agreement":null},{"id":"W3202160978","doi":"","title":"Faster key compression for isogeny-based cryptosystems","year":2017,"lang":"en","type":"preprint","venue":"University of Washington Tacoma Digital Commons (University of Washington Tacoma)","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Isogeny; Key (lock); Cryptosystem; Cryptography; Elliptic curve cryptography; Compression (physics); Overhead (engineering); Theoretical computer science; Key encapsulation; Public-key cryptography; Computer engineering; Computer security; Key exchange; Mathematics; Elliptic curve; Encryption; Operating system","score_opus":0.020743993331706158,"score_gpt":0.21559680463043196,"score_spread":0.1948528112987258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202160978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48594645,0.00044478072,0.49196112,0.0031480398,0.0012808186,0.0018697144,0.002251306,0.0006258995,0.012471877],"genre_scores_gemma":[0.9632846,0.000055708322,0.035057742,0.00003854747,0.00006501391,5.538437e-7,0.00043412068,0.00006084416,0.0010028434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955247,0.00028608795,0.0006082343,0.0015770404,0.001115889,0.00088801415],"domain_scores_gemma":[0.99206924,0.00071741134,0.0024905757,0.0033869056,0.0008244531,0.00051143154],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00063417613,0.0008807011,0.0017267806,0.0013597733,0.001738688,0.00074965437,0.009707921,0.0009787229,0.00003480205],"category_scores_gemma":[0.000109354936,0.0011431858,0.0018106101,0.00049282046,0.0011426047,0.0024722524,0.0058474336,0.0011509457,0.00002093081],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011851087,0.020746188,0.13762036,0.035656475,0.013895278,0.0036078086,0.08477406,0.032672953,0.027316628,0.2325089,0.21427105,0.18507922],"study_design_scores_gemma":[0.037238136,0.0051516644,0.053073436,0.02014261,0.0033247361,0.00013022563,0.027016368,0.3981216,0.012745428,0.051372934,0.3781127,0.01357014],"about_ca_topic_score_codex":0.0014548243,"about_ca_topic_score_gemma":0.00056897826,"teacher_disagreement_score":0.4773382,"about_ca_system_score_codex":0.00023767492,"about_ca_system_score_gemma":0.00055086554,"threshold_uncertainty_score":0.9995609},"labels":[],"label_agreement":null},{"id":"W3204067048","doi":"","title":"Post-Quantum Cryptography on FPGA Based on Isogenies on Elliptic Curves","year":2016,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Isogeny; Computer science; Key exchange; Parallel computing; Cryptography; Public-key cryptography; Supersingular elliptic curve; Software; Curve25519; Shared secret; Multiplier (economics); Elliptic curve cryptography; Arithmetic; Elliptic curve; Algorithm; Encryption; Mathematics; Operating system","score_opus":0.012880954588559567,"score_gpt":0.24794286298663512,"score_spread":0.23506190839807556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204067048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045936454,0.0007217564,0.9146875,0.019173611,0.003570368,0.00165478,0.00033988143,0.0008678457,0.013047785],"genre_scores_gemma":[0.7656479,0.0021399169,0.21033412,0.019575974,0.00079166744,0.0010431965,0.00021490376,0.00024051931,0.000011786114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926665,0.001198936,0.0009564958,0.0027812412,0.0010184963,0.0013783767],"domain_scores_gemma":[0.99180096,0.0029391258,0.0006604456,0.003899297,0.00024027693,0.00045989716],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0006516502,0.0012889119,0.001277695,0.0022920207,0.00046121117,0.00020563537,0.0037865224,0.0006724244,0.00012349828],"category_scores_gemma":[0.00034238448,0.0009959942,0.0014287955,0.00055832666,0.0011146938,0.00012467595,0.0018496016,0.0024007559,0.0010266257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044366668,0.0008946386,0.0011036751,0.00035203356,0.00033702716,0.0002765731,0.0005008822,0.0016176773,0.0006183439,0.9844504,0.0020435252,0.007361544],"study_design_scores_gemma":[0.0011974797,0.0022641784,0.022108058,0.0031485234,0.000098293116,0.00003438783,0.00002747398,0.0067229485,0.003743196,0.9568991,0.0022473726,0.0015090079],"about_ca_topic_score_codex":0.000029300389,"about_ca_topic_score_gemma":0.000017758824,"teacher_disagreement_score":0.7197115,"about_ca_system_score_codex":0.00008602918,"about_ca_system_score_gemma":0.00037685942,"threshold_uncertainty_score":0.9999863},"labels":[],"label_agreement":null},{"id":"W3204620253","doi":"","title":"x-only point addition formula and faster compressed SIKE","year":2020,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Waterloo","funders":"","keywords":"Computer science; Binary number; Torsion (gastropod); Algorithm; Parallel computing; Arithmetic; Mathematics","score_opus":0.016129434009253287,"score_gpt":0.24064784039057227,"score_spread":0.22451840638131898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204620253","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026600786,0.00027935603,0.96038496,0.006808087,0.00080441893,0.0007236032,0.00013215047,0.00036520587,0.00390141],"genre_scores_gemma":[0.4036736,0.00022770044,0.5942891,0.0012617636,0.00021890542,0.00013344189,0.00015554049,0.000037878253,0.0000020450038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99664295,0.00038658222,0.00058624696,0.0014749623,0.00030981313,0.00059946114],"domain_scores_gemma":[0.9975266,0.00052742916,0.00034968386,0.0011702491,0.000091080394,0.0003349672],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021015135,0.0005476441,0.00075035857,0.00038793715,0.00022529013,0.0002477507,0.0014673806,0.00037761265,0.00007079527],"category_scores_gemma":[0.00008069482,0.0005191311,0.00034185982,0.00020127463,0.00051752076,0.00020624227,0.005299302,0.0014619927,0.000116791685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061029732,0.000116030096,0.0013568924,0.00021240696,0.0002300541,0.00020974818,0.0037325013,0.0002017029,0.0011063033,0.97120017,0.0015697896,0.020003388],"study_design_scores_gemma":[0.000683287,0.0001544412,0.029292341,0.00014975092,0.00005563688,0.00022151065,0.00007674084,0.022996431,0.0006406278,0.9420268,0.0031050907,0.00059736246],"about_ca_topic_score_codex":0.000044552275,"about_ca_topic_score_gemma":0.0000715587,"teacher_disagreement_score":0.3770728,"about_ca_system_score_codex":0.000027634134,"about_ca_system_score_gemma":0.00018196496,"threshold_uncertainty_score":0.999726},"labels":[],"label_agreement":null},{"id":"W3208758550","doi":"10.1109/access.2021.3121520","title":"Digital Filter Architecture With Calculations in the Residue Number System by Winograd Method F (2 × 2, 2 × 2)","year":2021,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Council on grants of the President of the Russian Federation; Russian Foundation for Basic Research; Ministry of Science and Higher Education of the Russian Federation; Centre de Recherches Mathématiques","keywords":"Computer science; Field-programmable gate array; Digital filter; Digital signal processing; Residue number system; Filter (signal processing); Signal processing; Computer hardware; Architecture; Half-band filter; Digital signal; Implementation; Filter design; Hardware architecture; Finite impulse response; Computer engineering; Embedded system; Computer architecture; Root-raised-cosine filter; Algorithm; Software","score_opus":0.012318746912075967,"score_gpt":0.28084808531676586,"score_spread":0.2685293384046899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208758550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048671808,0.00014191463,0.9402386,0.0020027312,0.00017846745,0.0001926613,0.00002054523,0.00009224424,0.008461027],"genre_scores_gemma":[0.9845339,0.000002607344,0.014778309,0.0004087439,0.00006391696,0.000039187464,0.000010502048,0.000009761166,0.00015308523],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99863464,0.00021295152,0.00018295903,0.00037461962,0.0003355949,0.00025921475],"domain_scores_gemma":[0.9988594,0.00029329828,0.000055813256,0.00067116204,0.00006634915,0.000053980406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019309703,0.0001400447,0.00015183634,0.00007835466,0.0001503755,0.0009952653,0.001104345,0.000058960126,0.000008150561],"category_scores_gemma":[0.000013701068,0.00008409996,0.00007772168,0.0014361998,0.000051368224,0.0006025295,0.0001215118,0.00024047653,0.000010860339],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015334634,0.0021715006,0.39911568,0.0008029874,0.0008346269,0.0060520433,0.023150062,0.046290495,0.0021442259,0.1473301,0.06903549,0.30291942],"study_design_scores_gemma":[0.010134221,0.00051162846,0.63511074,0.0022372135,0.0003899719,0.013344936,0.0048069223,0.079764545,0.06123443,0.0410926,0.14552952,0.005843283],"about_ca_topic_score_codex":0.00011203062,"about_ca_topic_score_gemma":0.00021434219,"teacher_disagreement_score":0.93586206,"about_ca_system_score_codex":0.000015222746,"about_ca_system_score_gemma":0.00005864868,"threshold_uncertainty_score":0.95973665},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01777655156329359,"score_gpt":0.23603149127741185,"score_spread":0.21825493971411827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210270412","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025590494,0.002802506,0.96036386,0.0011453389,0.00095387344,0.0009654189,0.000050094768,0.00026725203,0.007861153],"genre_scores_gemma":[0.11509411,0.00063409685,0.88339674,0.00021422264,0.00014250347,0.00042390762,0.000054454136,0.00003433713,0.0000056315384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962028,0.00046042973,0.00093480584,0.0012989754,0.00039173866,0.00071124884],"domain_scores_gemma":[0.9962746,0.000605889,0.0007196971,0.0020673475,0.00015876463,0.00017372693],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046511219,0.0005625153,0.0010065591,0.0006571921,0.00012880645,0.00006527438,0.00276717,0.00035634206,0.00003407035],"category_scores_gemma":[0.00009813795,0.0005419149,0.00067649636,0.00038259735,0.00084925734,0.00011952289,0.004119733,0.0012711475,0.000071427625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022281649,0.00035894217,0.014999302,0.001048241,0.00028793217,0.00013447725,0.0004676939,0.0014668513,0.0002228489,0.96688837,0.0043187654,0.009784292],"study_design_scores_gemma":[0.0005809871,0.00022703843,0.051113576,0.0011669558,0.00012926914,0.00011437735,0.000029841076,0.006745407,0.0015095632,0.92825556,0.009179887,0.0009475191],"about_ca_topic_score_codex":0.0002653087,"about_ca_topic_score_gemma":0.000089424575,"teacher_disagreement_score":0.089503616,"about_ca_system_score_codex":0.000036793692,"about_ca_system_score_gemma":0.00034487498,"threshold_uncertainty_score":0.9997032},"labels":[],"label_agreement":null},{"id":"W3211046319","doi":"10.1109/ccece53047.2021.9569160","title":"Efficient Multiplier and FPGA Implementation for NTRU Prime","year":2021,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"NTRU; NIST; Computer science; Cryptography; Elliptic curve cryptography; Lattice-based cryptography; Post-quantum cryptography; Field-programmable gate array; Adder; Public-key cryptography; Multiplier (economics); Computer engineering; Theoretical computer science; Arithmetic; Quantum cryptography; Parallel computing; Algorithm; Computer hardware; Mathematics; Encryption; Computer security; Quantum; Cryptosystem; Quantum information; Telecommunications","score_opus":0.010456715837315026,"score_gpt":0.2742696006812132,"score_spread":0.2638128848438982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211046319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092057236,0.00017462856,0.9060728,0.0009230981,0.0001288054,0.00016323356,0.000002048816,0.000047604728,0.00043052316],"genre_scores_gemma":[0.8316546,0.000007117393,0.16791426,0.00023390881,0.000019961333,0.000018119863,0.0000031240822,0.0000027372987,0.00014614966],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994877,0.000014016765,0.0000883033,0.00020408025,0.00007854737,0.0001273734],"domain_scores_gemma":[0.9996623,0.000069012676,0.000018600558,0.00015605199,0.000053049447,0.00004099097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009150792,0.000048521102,0.000053708412,0.00003900761,0.00009543922,0.00008381417,0.000088261586,0.000017537232,0.000023127495],"category_scores_gemma":[0.000008534009,0.00003998489,0.000035904577,0.00016183173,0.000015855512,0.000039400846,0.0000864241,0.000021064146,0.000004148975],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068775075,0.00016373275,0.0020860163,0.000039434173,0.00004989133,0.000011030846,0.0017173833,0.00032428117,0.014170293,0.22157826,0.0008242984,0.7590285],"study_design_scores_gemma":[0.0042957524,0.00022691235,0.10391429,0.000021069343,0.00003436743,0.00007051031,0.0011513446,0.2699157,0.5853224,0.014598854,0.01986074,0.0005880543],"about_ca_topic_score_codex":0.000010235841,"about_ca_topic_score_gemma":0.000023236302,"teacher_disagreement_score":0.75844043,"about_ca_system_score_codex":0.0000050232197,"about_ca_system_score_gemma":0.000027441838,"threshold_uncertainty_score":0.16305365},"labels":[],"label_agreement":null},{"id":"W3213153633","doi":"10.1007/s13389-022-00287-w","title":"Rethinking modular multi-exponentiation in real-world applications","year":2022,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Modular exponentiation; Exponentiation; Computer science; Cryptography; Parallel computing; Side channel attack; Theoretical computer science; Arithmetic; Algorithm; Public-key cryptography; Mathematics; Encryption; Computer security","score_opus":0.014409619445672915,"score_gpt":0.23511993082946617,"score_spread":0.22071031138379324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213153633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12425357,0.00080546347,0.87407136,0.00023145971,0.0003670649,0.0001437634,8.121405e-7,0.0000648203,0.00006167652],"genre_scores_gemma":[0.8653351,0.00016278063,0.13435462,0.00003373552,0.000061980645,0.000034621942,8.279047e-7,0.0000119073,0.0000044015474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985604,0.00006938226,0.0005220166,0.00017181759,0.00045068993,0.00022569],"domain_scores_gemma":[0.99920964,0.00009357696,0.00025825974,0.0002826718,0.00007641735,0.00007943282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009348762,0.00011839278,0.00020086036,0.0020657927,0.00015508433,0.00006708336,0.00072102156,0.000031316682,0.000008662851],"category_scores_gemma":[0.00001844921,0.00012414988,0.00019736133,0.0029123786,0.000016487138,0.00038761186,0.00016319976,0.0006042719,4.768815e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015899277,0.0004772241,0.025526335,0.000086802065,0.00014027413,0.00015739909,0.0029974282,0.7580715,0.024355378,0.17797862,0.000043132364,0.010150054],"study_design_scores_gemma":[0.0027526855,0.00030878087,0.33705366,0.0002020434,0.00006399683,0.00034934207,0.0002854299,0.6122245,0.0013763632,0.03297296,0.011576989,0.00083324825],"about_ca_topic_score_codex":0.000026305099,"about_ca_topic_score_gemma":0.000024271112,"teacher_disagreement_score":0.74108154,"about_ca_system_score_codex":0.00006662786,"about_ca_system_score_gemma":0.00004179265,"threshold_uncertainty_score":0.5062685},"labels":[],"label_agreement":null},{"id":"W4210833564","doi":"10.1007/978-1-4419-5906-5_254","title":"Pairings","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.02166163305879803,"score_gpt":0.19012249045048416,"score_spread":0.16846085739168612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210833564","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.4180057e-7,0.00040074807,0.116632335,0.00013285907,0.00022794622,0.000058620553,5.0292795e-7,0.00023038757,0.88231593],"genre_scores_gemma":[0.00058824674,0.00016516457,0.019187348,0.00041040799,0.000064967295,0.000002134224,9.019977e-7,0.000016033007,0.9795648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927014,0.0000028253598,0.000128798,0.00031181934,0.00014763222,0.00013879492],"domain_scores_gemma":[0.9992276,0.000023279705,0.00005663203,0.00058268866,0.00004103719,0.00006878532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005799322,0.00016159218,0.00014449326,0.00015075268,0.000042555137,0.00004905175,0.00074565766,0.00015861593,0.0007246747],"category_scores_gemma":[0.0000019167771,0.00012743984,0.00016682391,0.000025062327,0.000050100283,0.00010677159,0.00025595282,0.00017378422,0.0007436823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.2565563e-7,0.0000041592725,0.0000021622352,0.0000066143584,0.000018022662,0.00002039635,0.000048947102,4.7090133e-8,0.0000012862038,0.9492263,0.005537724,0.04513399],"study_design_scores_gemma":[0.00004535557,0.000030741106,0.00004558559,0.00003110156,0.0000071111895,0.0000135151195,1.8402451e-7,0.00002879086,0.00004976459,0.44781068,0.5517413,0.00019583815],"about_ca_topic_score_codex":0.000018291166,"about_ca_topic_score_gemma":0.000008564361,"teacher_disagreement_score":0.5462036,"about_ca_system_score_codex":0.000005903224,"about_ca_system_score_gemma":0.000027774262,"threshold_uncertainty_score":0.95587796},"labels":[],"label_agreement":null},{"id":"W4213306896","doi":"10.1109/tvlsi.2022.3148207","title":"An Optimized M-Term Karatsuba-Like Binary Polynomial Multiplier for Finite Field Arithmetic","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Multiplier (economics); Field-programmable gate array; Finite field; Galois theory; Computer science; Arithmetic; Polynomial basis; Binary number; Finite field arithmetic; Parallel computing; Mathematics; Computer hardware; Discrete mathematics","score_opus":0.01268377404268676,"score_gpt":0.2497380834496077,"score_spread":0.23705430940692096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213306896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018078461,0.00012945817,0.9728999,0.00046209083,0.0064269705,0.0012164388,0.000293339,0.0003654946,0.0001278538],"genre_scores_gemma":[0.9840786,0.000021932163,0.0128773535,0.00047633756,0.0001653922,0.0013867731,0.00004992305,0.000040090054,0.0009036394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969404,0.00046181798,0.00066820276,0.0008276547,0.0005586455,0.0005433245],"domain_scores_gemma":[0.99788755,0.00058279524,0.00019692066,0.00095869246,0.00016325478,0.00021080155],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00069770793,0.00036599403,0.0004319615,0.0006832892,0.0014265683,0.0004071738,0.0009198163,0.00018757937,0.00013909012],"category_scores_gemma":[0.000010204178,0.000346829,0.0004635793,0.0007997395,0.000068427245,0.0006430319,0.000011859673,0.000612505,0.000034179284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00244271,0.0068184827,0.00014050411,0.00027591706,0.0005633657,0.00010749933,0.010751048,0.88277274,0.028033115,0.002703882,0.012101386,0.05328932],"study_design_scores_gemma":[0.0033236884,0.0018452704,0.00008379601,0.00007950204,0.000086053464,0.00007753307,0.0014548517,0.9742033,0.010425831,0.00007381341,0.0076716435,0.00067474466],"about_ca_topic_score_codex":0.00011903398,"about_ca_topic_score_gemma":0.00008395771,"teacher_disagreement_score":0.9660001,"about_ca_system_score_codex":0.000154544,"about_ca_system_score_gemma":0.000115917486,"threshold_uncertainty_score":0.9998984},"labels":[],"label_agreement":null},{"id":"W4214886844","doi":"10.37394/23206.2022.21.13","title":"El Gamal Cryptosystem on a Montgomery Curves Over Non Local Ring","year":2022,"lang":"en","type":"article","venue":"WSEAS TRANSACTIONS ON MATHEMATICS","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Ring (chemistry); Prime (order theory); Bijection; Cryptosystem; Finite field; Elliptic curve; Discrete mathematics; Combinatorics; Pure mathematics; Cryptography; Algorithm","score_opus":0.011779104268303966,"score_gpt":0.23768680024337485,"score_spread":0.22590769597507088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214886844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01588007,0.00017616886,0.980252,0.0005051186,0.0003963345,0.00033536938,0.000020203848,0.00022289791,0.0022117875],"genre_scores_gemma":[0.98756784,0.00004698441,0.011465269,0.00037957987,0.000026071579,0.00016934895,0.0000016941738,0.000026000724,0.00031721647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981931,0.00009306774,0.00032214352,0.00036390324,0.0007108332,0.00031695995],"domain_scores_gemma":[0.99885255,0.00018532474,0.000099997764,0.00070872495,0.00003274394,0.00012068644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031504675,0.00020738701,0.00024669623,0.00031905636,0.0005914835,0.000078753845,0.000630014,0.00004666834,0.00017079934],"category_scores_gemma":[0.000005741232,0.0001934858,0.00024831996,0.0007719293,0.000052175357,0.00017491227,0.00002807252,0.00044392288,0.000056229193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023420874,0.015391772,0.00011399512,0.0055411467,0.0010938216,0.0006447974,0.017084679,0.45456275,0.0023088097,0.37576178,0.005425248,0.12183698],"study_design_scores_gemma":[0.0021662577,0.0015501208,0.0015919143,0.0013805121,0.00019555766,0.00034458216,0.0020379422,0.9606411,0.0038019991,0.020923832,0.004039109,0.0013270932],"about_ca_topic_score_codex":0.000017397359,"about_ca_topic_score_gemma":0.000007880057,"teacher_disagreement_score":0.97168773,"about_ca_system_score_codex":0.00009444894,"about_ca_system_score_gemma":0.00005775872,"threshold_uncertainty_score":0.7890122},"labels":[],"label_agreement":null},{"id":"W4220708628","doi":"10.3390/math10050848","title":"Compact Word-Serial Modular Multiplier Accelerator Structure for Cryptographic Processors in IoT Edge Nodes with Limited Resources","year":2022,"lang":"en","type":"article","venue":"Mathematics","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Prince Sattam bin Abdulaziz University","keywords":"Computer science; Multiplier (economics); Application-specific integrated circuit; Modular design; Cryptography; Embedded system; Modular arithmetic; Computer hardware; Field-programmable gate array; Efficient energy use; Arithmetic; Computer architecture; Parallel computing; Operating system; Mathematics; Algorithm; Engineering; Electrical engineering","score_opus":0.015175395153885291,"score_gpt":0.22851727711183162,"score_spread":0.21334188195794632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220708628","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95731246,0.0001556335,0.041148342,0.0002486584,0.00014411438,0.0007527479,0.000036519654,0.00014431197,0.00005723629],"genre_scores_gemma":[0.8698517,0.0000028111344,0.12984203,0.00009267224,0.0000543046,0.00010068915,0.0000066335133,0.000029794532,0.000019356701],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829787,0.00006977391,0.00034955188,0.00042402945,0.0004437697,0.00041498998],"domain_scores_gemma":[0.99886674,0.00021471236,0.00019079141,0.0005580515,0.00007960099,0.0000901174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028488488,0.00025341604,0.00035343147,0.0004548691,0.00040285927,0.00022115538,0.0010155259,0.000070226706,0.000030374016],"category_scores_gemma":[0.000043959528,0.0001978734,0.00011003969,0.0016024323,0.000098768855,0.00014036878,0.00020215125,0.0002955581,9.537839e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002346458,0.011413259,0.06980411,0.0075316206,0.0017575156,0.0004018047,0.32520205,0.26644677,0.08323474,0.20395944,0.0033837466,0.024518486],"study_design_scores_gemma":[0.012704781,0.0018236357,0.045343995,0.0005408124,0.00019657316,0.0002234821,0.008580978,0.7408467,0.014779305,0.16258304,0.009364202,0.003012511],"about_ca_topic_score_codex":0.000011919246,"about_ca_topic_score_gemma":0.000045707708,"teacher_disagreement_score":0.47439992,"about_ca_system_score_codex":0.000032246113,"about_ca_system_score_gemma":0.000056425044,"threshold_uncertainty_score":0.8069043},"labels":[],"label_agreement":null},{"id":"W4247414788","doi":"10.1109/ccece.2017.7946812","title":"Systolic design space exploration of polynomial division over GF(m<sup>2</sup>)","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Polynomial; Division algorithm; Computer science; Systolic array; Algorithm; Division (mathematics); Cryptosystem; Inversion (geology); Very-large-scale integration; Theoretical computer science; Mathematics; Cryptography; Arithmetic; Embedded system; Mathematical analysis","score_opus":0.03794049535483371,"score_gpt":0.2705062507195025,"score_spread":0.2325657553646688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247414788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07085874,0.00007163877,0.9260625,0.0008132546,0.00019841941,0.00019204215,9.25171e-7,0.00007855266,0.0017238859],"genre_scores_gemma":[0.9523196,0.00002610602,0.047321443,0.00004033466,0.000059908212,0.0000074982395,6.163696e-7,0.000006554721,0.00021790831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893326,0.00008129219,0.0001998003,0.0002939299,0.00028307384,0.00020866073],"domain_scores_gemma":[0.9985634,0.00009132724,0.00016762083,0.0010356989,0.00006187341,0.000080080026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031727683,0.00012308043,0.00017189095,0.00014974897,0.00035577526,0.00028309724,0.00096678373,0.00007441996,0.000023119808],"category_scores_gemma":[0.000063823885,0.00009698878,0.00010206066,0.00014294549,0.00010111064,0.0015364147,0.00030029507,0.00007979252,0.000033319175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024545606,0.0013536506,0.023263736,0.0003159253,0.0003438471,0.00012453507,0.022909831,0.039351802,0.03234862,0.5852708,0.044332575,0.2501392],"study_design_scores_gemma":[0.002877101,0.0007857862,0.098621495,0.0002525221,0.00005023466,0.000022514614,0.00035337266,0.78418094,0.08827936,0.020438245,0.0031460412,0.0009923646],"about_ca_topic_score_codex":0.00027063163,"about_ca_topic_score_gemma":0.000010451086,"teacher_disagreement_score":0.8814609,"about_ca_system_score_codex":0.000012854808,"about_ca_system_score_gemma":0.00004612314,"threshold_uncertainty_score":0.39550877},"labels":[],"label_agreement":null},{"id":"W4251981231","doi":"10.1090/fic/058/01","title":"An overview of algebraic curves and cryptography","year":2010,"lang":"en","type":"other","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Algebraic number; Cryptography; Computer science; Mathematics; Algorithm; Mathematical analysis","score_opus":0.020112867685885633,"score_gpt":0.2829873067456153,"score_spread":0.2628744390597296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251981231","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001284979,0.21964376,0.085414805,0.00050127774,0.0008134061,0.0006148842,0.000027093056,0.00082843757,0.69202787],"genre_scores_gemma":[0.0035604078,0.22250189,0.7003304,0.003952753,0.0005415028,0.00006610579,0.000045280274,0.0007187507,0.06828294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905556,0.000048114485,0.00016029086,0.0003749878,0.00020117266,0.00015986439],"domain_scores_gemma":[0.9988801,0.000032505704,0.00013254544,0.00082470494,0.000024403913,0.000105758365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012726069,0.0001907912,0.00030105776,0.00047062585,0.000025248606,0.00004399081,0.00073583086,0.00021344214,0.000724796],"category_scores_gemma":[0.0000047947856,0.00014550089,0.00011847864,0.0004908303,0.00017445005,0.00009998426,0.0001221111,0.00018106606,0.000006193369],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010750234,0.00020032929,0.0009815411,0.0016236883,0.00013416348,0.000009549456,0.00009216768,5.1465182e-8,0.0003622057,0.7159717,0.2074694,0.0731541],"study_design_scores_gemma":[0.0005540516,0.00036226507,0.00891489,0.0023812512,0.00010119879,0.00005000144,0.00001351512,0.00018537413,0.0006551704,0.042526215,0.9431642,0.0010918105],"about_ca_topic_score_codex":0.00026257255,"about_ca_topic_score_gemma":0.00033973285,"teacher_disagreement_score":0.7356948,"about_ca_system_score_codex":6.442634e-7,"about_ca_system_score_gemma":0.000024586754,"threshold_uncertainty_score":0.7936008},"labels":[],"label_agreement":null},{"id":"W4251986833","doi":"10.22215/etd/2006-08473","title":"VLSI implementation of a Montgomery modular multiplier","year":2006,"lang":"en","type":"dissertation","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Modular design; Computer science; Arithmetic; Multiplier (economics); Mathematics; Programming language","score_opus":0.00489026273385037,"score_gpt":0.25834727256376855,"score_spread":0.2534570098299182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251986833","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79768616,0.001436089,0.17294,0.00010642556,0.0014346384,0.0008703399,0.000022400012,0.00026741056,0.025236534],"genre_scores_gemma":[0.9527389,0.000059052232,0.042917307,0.000035698977,0.00005899834,0.00004917653,0.00046689535,0.000021548696,0.0036524115],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99880916,0.00002606675,0.00035143743,0.000322414,0.00031313673,0.00017780846],"domain_scores_gemma":[0.9992142,0.00002782232,0.00020944246,0.00039593343,0.00011787147,0.00003477702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000091906266,0.00016725891,0.00021390701,0.0003399227,0.00005543223,0.00004757611,0.00044446383,0.00013428634,0.000047539095],"category_scores_gemma":[0.0000027801907,0.00014824515,0.00017928907,0.00041421838,0.000014358381,0.00017635924,0.000033751705,0.000103992206,0.000008991027],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042682743,0.00068182324,0.0069539663,0.0012561628,0.00052843173,0.000046428788,0.0065726526,0.0007336444,0.05394072,0.1583812,0.010161967,0.76070035],"study_design_scores_gemma":[0.0020701715,0.00028770912,0.7118432,0.00018402864,0.00022242924,0.000007248285,0.0030141075,0.011066054,0.24713953,0.019720092,0.0030653258,0.0013801039],"about_ca_topic_score_codex":0.0014059361,"about_ca_topic_score_gemma":0.001620494,"teacher_disagreement_score":0.7593202,"about_ca_system_score_codex":0.00001215775,"about_ca_system_score_gemma":0.00006818314,"threshold_uncertainty_score":0.60452616},"labels":[],"label_agreement":null},{"id":"W4256357822","doi":"10.1016/s0304-3975(04)00121-5","title":"The generalized Weil pairing and the discrete logarithm problem on elliptic curves","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Discrete logarithm; Mathematics; Elliptic curve; Pairing; Logarithm; TRACE (psycholinguistics); Generalization; Reduction (mathematics); Modulo; Edwards curve; Discrete mathematics; Pure mathematics; Simple (philosophy); Finite field; Combinatorics; Schoof's algorithm; Mathematical analysis; Computer science; Public-key cryptography; Quarter period; Geometry; Physics","score_opus":0.0056954008353222035,"score_gpt":0.22177431581755602,"score_spread":0.2160789149822338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256357822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015028136,0.0011573127,0.947245,0.033742867,0.0004245602,0.00046942264,6.3859017e-7,0.00016744931,0.0017646423],"genre_scores_gemma":[0.93503916,0.00046337539,0.062097006,0.002265303,0.000092618226,0.000024361221,1.90231e-7,0.0000075029643,0.000010507152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974767,0.0002428229,0.00027614058,0.0006339016,0.00075257866,0.00061787275],"domain_scores_gemma":[0.99789125,0.0008089339,0.00007447018,0.0009415981,0.000094215444,0.00018951796],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0028727008,0.0002083664,0.00020524948,0.00009002465,0.0017312735,0.00091495266,0.0025746294,0.000036603036,0.000002814344],"category_scores_gemma":[0.00008773518,0.0000943956,0.00010569605,0.0010378483,0.009404722,0.00031848325,0.0010421376,0.00030804134,0.000019465037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018115012,0.0000217472,0.000010538485,0.000010207262,0.0000073495785,0.0000065776844,0.00036982182,0.00046195075,0.000028187567,0.98458445,0.000021361318,0.014459709],"study_design_scores_gemma":[0.0012218392,0.00021083638,0.0007616301,0.00018387173,0.000012263818,0.00007723292,0.000009438137,0.1348934,0.0009081415,0.86121696,0.0002745217,0.00022983823],"about_ca_topic_score_codex":0.000012876565,"about_ca_topic_score_gemma":0.00000282085,"teacher_disagreement_score":0.920011,"about_ca_system_score_codex":0.000028126473,"about_ca_system_score_gemma":0.00009268187,"threshold_uncertainty_score":0.99956834},"labels":[],"label_agreement":null},{"id":"W4283527481","doi":"10.1016/j.jksuci.2022.06.009","title":"Compact modular multiplier design for strong security capabilities in resource-limited Telehealth IoT devices","year":2022,"lang":"en","type":"article","venue":"Journal of King Saud University - Computer and Information Sciences","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Research Council Canada","keywords":"Computer science; Workload; Modular design; Elliptic curve cryptography; Emulation; Efficient energy use; Embedded system; Cryptography; Modular arithmetic; Public-key cryptography; Computer network; Operating system; Encryption; Computer security; Engineering","score_opus":0.02002157118355477,"score_gpt":0.2312784197653485,"score_spread":0.21125684858179372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283527481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31901544,0.00013253237,0.67905086,0.0012500982,0.00018453057,0.00019525051,0.0000068905338,0.000019399193,0.00014497247],"genre_scores_gemma":[0.95787805,0.000016380352,0.04174089,0.00033784035,0.00002254729,2.2051049e-7,8.321648e-7,0.000001113781,0.0000021045637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987847,0.0001950641,0.00030986022,0.000115930685,0.00039672718,0.00019772166],"domain_scores_gemma":[0.9990131,0.00033546792,0.00035890995,0.00009497535,0.000116868185,0.00008065138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016893585,0.000085243,0.00019352887,0.0008408493,0.00077912473,0.00020565535,0.00069015415,0.000024474642,0.0000029343105],"category_scores_gemma":[0.000016243079,0.000076947734,0.0000940614,0.00075354736,0.00014075315,0.0024048013,0.00018062879,0.00018920549,1.4834403e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019686611,0.00020175296,0.018035619,0.0001590965,0.00015631705,0.000019525074,0.050169304,0.85140264,0.000023217124,0.043805324,0.0011369834,0.034693357],"study_design_scores_gemma":[0.0010448442,0.0008275572,0.026604686,0.000030841835,0.000029225852,0.0000851713,0.0068173013,0.93630207,0.000024450615,0.0013648341,0.026694098,0.00017491337],"about_ca_topic_score_codex":0.000067563546,"about_ca_topic_score_gemma":0.000009098108,"teacher_disagreement_score":0.6388626,"about_ca_system_score_codex":0.000079447396,"about_ca_system_score_gemma":0.00015946435,"threshold_uncertainty_score":0.59924763},"labels":[],"label_agreement":null},{"id":"W4285135680","doi":"10.1109/tcsi.2022.3186810","title":"Area-Efficient Finite Field Multiplication Using Hybrid SET-MOS Technology","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Multiplication (music); XOR gate; Finite field; CMOS; Computer science; Set (abstract data type); Polynomial; Algorithm; Electronic engineering; Logic gate; Mathematics; Engineering; Discrete mathematics","score_opus":0.020995773041029873,"score_gpt":0.22631772933620015,"score_spread":0.20532195629517028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285135680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105463184,0.00046061413,0.8918364,0.0005412508,0.00086095114,0.0004172277,0.000026799667,0.00018911753,0.00020443652],"genre_scores_gemma":[0.9993122,0.00002826749,0.00027387854,0.00013050127,0.000016131315,0.00012619697,0.00000145343,0.000012225359,0.000099136894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985549,0.00012078115,0.00026183506,0.0004831935,0.00031515633,0.00026413353],"domain_scores_gemma":[0.99905497,0.00014189408,0.00009652706,0.00055970816,0.000043935488,0.0001029376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025645617,0.00016069149,0.00019516124,0.00045887084,0.0009355282,0.00009653324,0.00036645148,0.00006922357,0.000017513228],"category_scores_gemma":[0.0000071628383,0.0001559484,0.000104614504,0.0007528304,0.000066468194,0.00007269653,0.000008709237,0.000283562,0.0000027617648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014129517,0.0003677264,0.00009030895,0.00009793297,0.00017054516,0.00007625213,0.0016780237,0.77818733,0.059510283,0.006613814,0.0001039781,0.15308967],"study_design_scores_gemma":[0.000876067,0.00040957594,0.00007338164,0.000086959204,0.000058977756,0.0007647391,0.0016686026,0.97479916,0.0139615545,0.00019601578,0.006578404,0.00052657264],"about_ca_topic_score_codex":0.00006416477,"about_ca_topic_score_gemma":0.000003963211,"teacher_disagreement_score":0.893849,"about_ca_system_score_codex":0.00006621989,"about_ca_system_score_gemma":0.00005697505,"threshold_uncertainty_score":0.7195421},"labels":[],"label_agreement":null},{"id":"W4285511898","doi":"10.1007/978-3-642-27739-9_251-2","title":"Elliptic Curve Signature Schemes","year":2021,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Signature (topology); Elliptic Curve Digital Signature Algorithm; Computer science; Mathematics; Geometry; Elliptic curve cryptography; Computer security; Public-key cryptography","score_opus":0.012116389085876318,"score_gpt":0.21204121143752697,"score_spread":0.19992482235165066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285511898","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003970486,0.012781907,0.10411889,0.0006946107,0.00064456917,0.00013093583,0.0000039573547,0.00026204373,0.8813591],"genre_scores_gemma":[0.00094201905,0.0008846748,0.044744764,0.00071495457,0.00023500272,0.0000042566476,0.00001928529,0.000033754746,0.9524213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985505,0.000014038255,0.00021498275,0.0006145294,0.00036833537,0.00023765906],"domain_scores_gemma":[0.99868214,0.0000910068,0.000089168134,0.00090239476,0.00012730263,0.00010796941],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000087393986,0.00030115002,0.00030256392,0.00019308396,0.000090366855,0.0002064515,0.0009340779,0.00042531913,0.0009357754],"category_scores_gemma":[0.000008971907,0.00024688934,0.00026640392,0.00010842917,0.00007562028,0.00013728412,0.00041727893,0.0005814696,0.00025654634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.2571426e-7,0.000011359596,0.000002350147,0.000026918608,0.000069815724,0.00013151884,0.000024862196,0.0000018546656,0.000047526893,0.983798,0.005654177,0.010231091],"study_design_scores_gemma":[0.00012665094,0.000054342814,0.00002003307,0.00017957133,0.00003263043,0.00004634164,0.0000034682669,0.00038935014,0.00056609197,0.13257496,0.86545295,0.0005536221],"about_ca_topic_score_codex":0.0000028973172,"about_ca_topic_score_gemma":0.000008421619,"teacher_disagreement_score":0.8597987,"about_ca_system_score_codex":0.000015636182,"about_ca_system_score_gemma":0.00011103219,"threshold_uncertainty_score":0.99999833},"labels":[],"label_agreement":null},{"id":"W4285536666","doi":"10.1007/978-3-642-27739-9_249-2","title":"Elliptic Curve Point Multiplication Using Halving","year":2021,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiplication (music); Point (geometry); Arithmetic; Elliptic curve point multiplication; Mathematics; Computer science; Elliptic curve; Pure mathematics; Geometry; Combinatorics","score_opus":0.029019873424727387,"score_gpt":0.24334169447398613,"score_spread":0.21432182104925873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285536666","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004947094,0.0016315627,0.7052668,0.00020814217,0.00035578126,0.00016800524,0.0000016391486,0.00016468145,0.29215392],"genre_scores_gemma":[0.0150641985,0.00076117646,0.5608149,0.00075594493,0.0005510607,0.000012070486,0.000037036472,0.0001010118,0.4219026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985986,0.000019880197,0.0002897514,0.0005952371,0.0002817872,0.00021474154],"domain_scores_gemma":[0.99861306,0.00012144897,0.00015269521,0.00087904563,0.0001460173,0.00008771677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015643625,0.00024285323,0.00024665255,0.00022739221,0.00014062595,0.00022132625,0.0005467383,0.00020761692,0.00018920962],"category_scores_gemma":[0.00001745988,0.00022428582,0.0002471953,0.00010235242,0.00005385751,0.00020916687,0.00035900337,0.00026573875,0.000085402506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.475883e-7,0.000014182976,0.0000114525965,0.000031271677,0.000046346817,0.000035616653,0.00010318762,0.00007853119,0.00040318025,0.98454773,0.00011105267,0.0146168815],"study_design_scores_gemma":[0.0010762918,0.0001563348,0.000589184,0.0021267207,0.00030598164,0.00067736866,0.000082415434,0.46245906,0.0050583775,0.3382256,0.18545236,0.0037903006],"about_ca_topic_score_codex":0.000033039123,"about_ca_topic_score_gemma":0.000016827666,"teacher_disagreement_score":0.64632213,"about_ca_system_score_codex":0.000055481916,"about_ca_system_score_gemma":0.00009437194,"threshold_uncertainty_score":0.91461104},"labels":[],"label_agreement":null},{"id":"W4297857844","doi":"","title":"Measurement of the ratio of the p anti-p ---&gt; W+c-jet cross section to the inclusive p anti-p ---&gt; W+jets cross section","year":2008,"lang":"en","type":"article","venue":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut National de Physique Nucléaire et de Physique des Particules; Science and Technology Facilities Council; Consejo Nacional de Investigaciones Científicas y Técnicas; Natural Sciences and Engineering Research Council of Canada; Fundação para o Desenvolvimento da UNESP; Centre National de la Recherche Scientifique; U.S. Department of Energy; Vetenskapsrådet; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Bundesministerium für Bildung und Forschung; Russian Foundation for Basic Research; Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Western Canada Research Grid; Korea Science and Engineering Foundation; Department of Science and Technology, Ministry of Science and Technology, India; Grantová Agentura České Republiky; Departamento Administrativo de Ciencia, Tecnología e Innovación (COLCIENCIAS); Federal Agency for Science and Innovation; Deutsche Forschungsgemeinschaft; Alexander von Humboldt-Stiftung; Fundação de Amparo à Pesquisa do Estado de São Paulo; Fermilab; National Science Foundation; Science Foundation Ireland; Secretaría de Ciencia y Técnica, Universidad de Buenos Aires","keywords":"Cross section (physics); Jet (fluid); Section (typography); Physics; Astronomy; Mechanics; Computer science","score_opus":0.01359961982479171,"score_gpt":0.23574729841914663,"score_spread":0.2221476785943549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297857844","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9529134,0.00015820231,0.041093558,0.00070190494,0.0015446524,0.00053251616,0.000051101222,0.000042495365,0.0029621513],"genre_scores_gemma":[0.9989786,0.000040009083,0.0007552896,0.00009813716,0.000035562098,0.000025161444,0.000018594354,0.000005040203,0.000043591357],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99711186,0.00010864083,0.00089610746,0.00027282583,0.0013653052,0.00024526607],"domain_scores_gemma":[0.9971956,0.00009465722,0.00076113467,0.00086362276,0.0010121119,0.000072896444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012441097,0.00018851699,0.00028298565,0.00022492815,0.000966558,0.00013149483,0.0010824227,0.00012100271,0.000007066795],"category_scores_gemma":[0.0002150915,0.000105334795,0.00023649057,0.001798705,0.0012332784,0.0008792486,0.00071491586,0.00015189325,0.000001773797],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063257484,0.004205444,0.19668338,0.0012328603,0.0008693801,0.000005099257,0.0023694844,0.132653,0.31309947,0.31279224,0.022154376,0.013302701],"study_design_scores_gemma":[0.0005124188,0.00017327264,0.83680737,0.00012507697,0.000032763346,0.000042434942,0.000011766525,0.0004475398,0.15089688,0.00025229633,0.010537131,0.00016102262],"about_ca_topic_score_codex":0.000083111176,"about_ca_topic_score_gemma":0.00011625261,"teacher_disagreement_score":0.640124,"about_ca_system_score_codex":0.00005459415,"about_ca_system_score_gemma":0.00022700199,"threshold_uncertainty_score":0.7434081},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020906207446285244,"score_gpt":0.20274295639356385,"score_spread":0.1818367489472786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299660901","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000017616537,0.0016234183,0.250221,0.00008856823,0.0005216746,0.00015921397,0.0000029353255,0.00033550622,0.74704593],"genre_scores_gemma":[0.0030930059,0.0030052124,0.14303558,0.001197727,0.00044573343,0.000026957952,0.00001790251,0.00013698018,0.8490409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820685,0.000016583152,0.00034191605,0.000710797,0.00036499574,0.00035883597],"domain_scores_gemma":[0.99819475,0.00007116813,0.00016290019,0.0012774585,0.00010607483,0.00018763558],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00014837287,0.0004264884,0.00037068338,0.0006436414,0.000120783174,0.00013702564,0.0015077839,0.0003750209,0.0012642439],"category_scores_gemma":[0.0000035958712,0.00035096298,0.00057154475,0.00014802205,0.00018806501,0.00020740597,0.00036095365,0.0004344486,0.0012186973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016625714,0.000018781722,0.0000196683,0.000019051755,0.00009147776,0.00003856644,0.000085166284,2.9873397e-7,0.0000032518765,0.97823685,0.0038584555,0.01762679],"study_design_scores_gemma":[0.00011241957,0.00009201057,0.000115624185,0.000065321685,0.00003469663,0.000024516221,0.0000010347342,0.000045970864,0.00005880156,0.66213995,0.33680657,0.00050310406],"about_ca_topic_score_codex":0.000023342682,"about_ca_topic_score_gemma":0.000014948171,"teacher_disagreement_score":0.33294812,"about_ca_system_score_codex":0.000011039693,"about_ca_system_score_gemma":0.00005692809,"threshold_uncertainty_score":0.99989426},"labels":[],"label_agreement":null},{"id":"W4302596635","doi":"10.1007/978-1-4419-5906-5_246","title":"Elliptic Curve Discrete Logarithm Problem","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Logarithm; Discrete logarithm; Mathematics; Elliptic curve; Hessian form of an elliptic curve; Applied mathematics; Mathematical analysis; Schoof's algorithm; Computer science; Quarter period","score_opus":0.018476941748802996,"score_gpt":0.20913543954021876,"score_spread":0.19065849779141578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302596635","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.61342e-7,0.0007625084,0.2683272,0.00019502759,0.00030234468,0.00024767226,0.000005077785,0.00026821182,0.7298914],"genre_scores_gemma":[0.00094798626,0.00061158364,0.09799374,0.000299948,0.00016745702,0.000016519094,0.0000128332695,0.000056896803,0.89989305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810606,0.000019671948,0.00036533724,0.0007610039,0.00036228454,0.00038562278],"domain_scores_gemma":[0.9983775,0.000061873456,0.00017744469,0.0011096805,0.00009640119,0.00017711306],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017903108,0.00042578703,0.0003822312,0.0003117999,0.00012506367,0.00016130086,0.0013993653,0.00036107385,0.00076299184],"category_scores_gemma":[0.0000032605235,0.0003269811,0.00034972752,0.000084283616,0.00018203948,0.00024586046,0.00053960946,0.00047717348,0.0010700739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017983792,0.000014370344,0.0000089325185,0.000033618944,0.000072932664,0.000055710676,0.00012243794,0.0000011214022,0.0000021027354,0.9795505,0.00217361,0.017962907],"study_design_scores_gemma":[0.00016402162,0.00015034086,0.000055681616,0.00013731088,0.000045407214,0.00005569328,0.0000015113791,0.0002889876,0.000056289675,0.70293707,0.29546633,0.00064132665],"about_ca_topic_score_codex":0.000051001847,"about_ca_topic_score_gemma":0.000040205352,"teacher_disagreement_score":0.29329273,"about_ca_system_score_codex":0.000021651167,"about_ca_system_score_gemma":0.000081066784,"threshold_uncertainty_score":0.9999182},"labels":[],"label_agreement":null},{"id":"W4310716484","doi":"10.3390/app122312355","title":"Performance Analysis of Hardware Implementations of Reverse Conversion from the Residue Number System","year":2022,"lang":"en","type":"article","venue":"Applied Sciences","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Science and Higher Education of the Russian Federation; Centre de Recherches Mathématiques","keywords":"Residue number system; Chinese remainder theorem; Computer science; Moduli; Computation; Arithmetic; Modulo; Residue (chemistry); Remainder; Computer hardware; Radix (gastropod); Algorithm; Parallel computing; Mathematics; Discrete mathematics; Chemistry","score_opus":0.01616653278421585,"score_gpt":0.24563189586925888,"score_spread":0.22946536308504303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310716484","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9916164,0.00003956027,0.0052583013,0.00027310703,0.0001256367,0.00014657457,0.000059683294,0.000024620478,0.002456098],"genre_scores_gemma":[0.99519986,0.0000072799703,0.0046730656,0.00007412603,0.000006620671,0.000021743677,0.0000073493507,0.0000013397253,0.000008616186],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987587,0.000075648924,0.00023694709,0.00024693448,0.000550014,0.00013177647],"domain_scores_gemma":[0.9991215,0.00025539997,0.00020365797,0.0003579893,0.00003779579,0.000023654538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071440364,0.000060901923,0.00015482082,0.00015740762,0.0006998642,0.000027730677,0.001147842,0.000011494834,0.00014531563],"category_scores_gemma":[0.0000042852553,0.000042276126,0.00009604602,0.0035872513,0.00025385807,0.00012087551,0.00035968886,0.00006530209,0.0000035695552],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003292036,0.00014547555,0.62345076,0.00007146344,0.0006949349,0.0000034494153,0.017634902,0.028121104,0.007181199,0.31500176,0.003884954,0.0037770916],"study_design_scores_gemma":[0.0009333832,0.00022910164,0.7200146,0.000042066757,0.000927861,0.000006725247,0.07683019,0.16625409,0.030594377,0.0013294253,0.0023697533,0.0004684648],"about_ca_topic_score_codex":0.0008680223,"about_ca_topic_score_gemma":0.000047185993,"teacher_disagreement_score":0.31367233,"about_ca_system_score_codex":0.000017700246,"about_ca_system_score_gemma":0.0000700668,"threshold_uncertainty_score":0.538286},"labels":[],"label_agreement":null},{"id":"W4312287159","doi":"10.1007/978-3-031-15982-4_10","title":"Accelerating the Delfs–Galbraith Algorithm with Fast Subfield Root Detection","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Isogeny; Mathematics; Supersingular elliptic curve; Elliptic curve; Algorithm; Elliptic curve cryptography; Discrete mathematics; Arithmetic; Computer science; Pure mathematics; Public-key cryptography","score_opus":0.01139558803246537,"score_gpt":0.21220417259784896,"score_spread":0.20080858456538359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312287159","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022392231,0.00039145895,0.99388343,0.00096867024,0.0012668564,0.00044689688,0.0000034852583,0.00017685806,0.0026384399],"genre_scores_gemma":[0.4264969,0.000055928045,0.56988597,0.0022227217,0.0009159318,0.00007468013,0.000005903555,0.00007658455,0.00026539867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99624085,0.000073209936,0.00039717855,0.0013777828,0.0012537692,0.00065717945],"domain_scores_gemma":[0.9974792,0.0005936114,0.00028322544,0.0013553202,0.00016402155,0.00012459814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008553989,0.00049818965,0.00037272394,0.00067015557,0.0012484966,0.0009105302,0.003470358,0.0001900175,0.000056001452],"category_scores_gemma":[0.00003101826,0.00032960923,0.00015018399,0.0013567938,0.0006550301,0.0006377565,0.0014310998,0.0015672464,0.000008091196],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048484985,0.000019662053,0.000060078222,0.000012396075,0.000018544642,0.00008462914,0.0008592932,0.019730046,0.00004634652,0.006812988,0.0000051615584,0.972346],"study_design_scores_gemma":[0.0005747143,0.0010287616,0.0010825201,0.00026159146,0.000034052795,0.0007753345,0.0000032876662,0.9272463,0.0033093267,0.05943454,0.00484916,0.0014004513],"about_ca_topic_score_codex":0.000117609496,"about_ca_topic_score_gemma":0.00082363863,"teacher_disagreement_score":0.97094554,"about_ca_system_score_codex":0.00015687839,"about_ca_system_score_gemma":0.00037016053,"threshold_uncertainty_score":0.9999156},"labels":[],"label_agreement":null},{"id":"W4313245494","doi":"10.3390/math11010111","title":"Low-Complexity One-Dimensional Parallel Semi-Systolic Structure for Field Montgomery Multiplication Algorithm Perfect for Small IoT Edge Nodes","year":2022,"lang":"en","type":"article","venue":"Mathematics","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Prince Sattam bin Abdulaziz University","keywords":"Multiplier (economics); Computer science; Cryptography; Multiplication (music); Field-programmable gate array; Application-specific integrated circuit; Enhanced Data Rates for GSM Evolution; Algorithm; Computer hardware; Mathematics; Telecommunications","score_opus":0.03582434243619472,"score_gpt":0.25587057560646176,"score_spread":0.22004623317026703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313245494","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07773678,0.00014952828,0.91963214,0.00083292165,0.00024100703,0.0011008603,0.00014555715,0.00013012251,0.000031101703],"genre_scores_gemma":[0.14570321,0.0000026360794,0.85306185,0.00043160672,0.00011064728,0.0005138081,0.000047610018,0.00002350269,0.00010509639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858975,0.000047953592,0.00033985503,0.0004077608,0.00028108305,0.00033360906],"domain_scores_gemma":[0.99825186,0.00077799294,0.00018281232,0.00059597316,0.00011235138,0.00007903824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003217236,0.00019734107,0.00029064337,0.00013812547,0.0006160348,0.00008201844,0.0007117258,0.00007873323,0.000028894241],"category_scores_gemma":[0.00008408292,0.00018348303,0.00022983884,0.00027732653,0.000045550856,0.00006712873,0.00029193397,0.00018204494,0.0000026134335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000257899,0.005656232,0.0004028389,0.005807193,0.00078923337,0.000020327601,0.018311834,0.03207303,0.0344078,0.59641564,0.014425252,0.2914327],"study_design_scores_gemma":[0.00091241533,0.00024763145,0.0003780038,0.00003819533,0.00004267895,0.000038507085,0.00011371123,0.81750345,0.0046962393,0.1747879,0.00090652006,0.00033474434],"about_ca_topic_score_codex":0.00001812582,"about_ca_topic_score_gemma":0.00001509338,"teacher_disagreement_score":0.78543043,"about_ca_system_score_codex":0.00004690965,"about_ca_system_score_gemma":0.000056847948,"threshold_uncertainty_score":0.7482221},"labels":[],"label_agreement":null},{"id":"W4313890165","doi":"10.3390/math11020328","title":"Word-Based Processor Structure for Montgomery Modular Multiplier Suitable for Compact IoT Edge Devices","year":2023,"lang":"en","type":"article","venue":"Mathematics","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Prince Sattam bin Abdulaziz University","keywords":"Computer science; Cryptography; Modular arithmetic; Modular design; Embedded system; Multiplier (economics); Network processor; Word (group theory); Efficient energy use; Computer hardware; Distributed computing; Computer network; Computer security; Operating system; Network packet; Engineering","score_opus":0.028097814296353496,"score_gpt":0.27617979313126056,"score_spread":0.24808197883490707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313890165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20449027,0.00019242018,0.79226476,0.00073859055,0.00029017357,0.0014076389,0.00010385863,0.0004473203,0.000064972155],"genre_scores_gemma":[0.6407394,0.0000023574255,0.35852018,0.00015276152,0.00008857568,0.00014332614,0.00002754567,0.000036954145,0.00028892484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986488,0.0000150215965,0.0002900261,0.00033480808,0.0002419425,0.0004693846],"domain_scores_gemma":[0.99842614,0.00067968125,0.00014039327,0.000511463,0.00014996406,0.00009236172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003306667,0.00020452827,0.000303383,0.00022619474,0.0002683096,0.00019496195,0.0007114586,0.00010773247,0.0000056665695],"category_scores_gemma":[0.00014139077,0.00016171992,0.00017953625,0.0007844223,0.000043524145,0.00013329132,0.0000654648,0.000090362606,0.0000120556315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037574684,0.0047828457,0.009625251,0.05686071,0.002027272,0.000082518294,0.044874534,0.25487688,0.06637441,0.35743573,0.093111984,0.1095721],"study_design_scores_gemma":[0.00092312566,0.000084084015,0.0012815255,0.00011986508,0.000038906914,0.0000027402173,0.0001680956,0.92104495,0.009274438,0.06280356,0.003953065,0.0003056306],"about_ca_topic_score_codex":0.0000036933284,"about_ca_topic_score_gemma":0.000020365844,"teacher_disagreement_score":0.6661681,"about_ca_system_score_codex":0.000017542507,"about_ca_system_score_gemma":0.000067943794,"threshold_uncertainty_score":0.6594747},"labels":[],"label_agreement":null},{"id":"W4323310115","doi":"10.46586/tches.v2023.i2.358-380","title":"Speeding Up Multi-Scalar Multiplication over Fixed Points Towards Efficient zkSNARKs","year":2023,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Precomputation; Scalar multiplication; Computer science; Scalar (mathematics); Fixed point; Computation; Elliptic curve; Speedup; Context (archaeology); Arithmetic; Parallel computing; Mathematics; Algorithm; Pure mathematics; Geometry; Mathematical analysis","score_opus":0.029257156896974387,"score_gpt":0.2748435390671737,"score_spread":0.2455863821701993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323310115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06744315,0.00047774837,0.926961,0.0005984965,0.0023553781,0.0007937841,0.000057872647,0.0010924406,0.00022010687],"genre_scores_gemma":[0.99211955,0.00046111704,0.006793235,0.00010254675,0.00009358951,0.00023190967,0.000017939732,0.000043152646,0.00013695534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676955,0.00025056067,0.0006078706,0.0009921045,0.000689393,0.00069050654],"domain_scores_gemma":[0.99816906,0.0002539956,0.00015765104,0.0008873913,0.000185553,0.00034635788],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008968023,0.00042476555,0.0004512957,0.0013743155,0.0008059452,0.0004688401,0.00060602097,0.00028780606,0.000035205358],"category_scores_gemma":[0.00002914667,0.000383335,0.00040291564,0.002983925,0.0001506235,0.00028071293,0.000033619064,0.00045396818,0.00013732686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067050423,0.005138143,0.006510585,0.0034141669,0.0038957212,0.0005751112,0.059201453,0.17547035,0.039353047,0.090320185,0.012994161,0.60245657],"study_design_scores_gemma":[0.0043317955,0.00037216212,0.038810097,0.0007551266,0.00016890773,0.00014833114,0.0029174678,0.93417025,0.0026853024,0.0006265953,0.013428179,0.0015858111],"about_ca_topic_score_codex":0.00018842804,"about_ca_topic_score_gemma":0.000023220371,"teacher_disagreement_score":0.9246764,"about_ca_system_score_codex":0.000038991075,"about_ca_system_score_gemma":0.000044985267,"threshold_uncertainty_score":0.99986184},"labels":[],"label_agreement":null},{"id":"W4362476330","doi":"10.1007/978-3-031-30617-4_14","title":"Supersingular Curves You Can Trust","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Academia Sinica; Ministero dell’Istruzione, dell’Università e della Ricerca; Banff International Research Station for Mathematical Innovation and Discovery; Università degli Studi di Roma Tor Vergata; Agence Nationale de la Recherche","keywords":"Computer science; Discrete logarithm; Isogeny; Direct Anonymous Attestation; Protocol (science); Theoretical computer science; Cryptography; Cryptographic protocol; Elliptic curve; Public-key cryptography; Algorithm; Mathematics; Encryption; Computer security; Trusted Computing; Pure mathematics","score_opus":0.015917235906931896,"score_gpt":0.23077026830351813,"score_spread":0.21485303239658624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362476330","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000075556134,0.0019242067,0.98754543,0.0039234897,0.0029062463,0.00036226533,0.000011001174,0.0004236691,0.002828137],"genre_scores_gemma":[0.13566014,0.0047493055,0.82889146,0.01916517,0.0032150045,0.00006535512,0.00007056272,0.00039317732,0.0077898433],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958381,0.00003730204,0.00045735567,0.0016510384,0.001187875,0.00082833896],"domain_scores_gemma":[0.9974129,0.0003498483,0.00016136913,0.0016457618,0.00019519545,0.00023491202],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008518779,0.00053671526,0.0005436813,0.0013107117,0.0003707602,0.00048243423,0.0039260266,0.00030471917,0.000020073177],"category_scores_gemma":[0.0000979307,0.00048078096,0.00025032897,0.0015498174,0.0010175309,0.00035373663,0.0013248093,0.0008613335,0.00006591225],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005658754,0.000067106725,0.00036647526,0.0003882433,0.00006123327,0.00087458827,0.0022430606,0.008834584,0.00019779276,0.100004315,0.00040801414,0.88654894],"study_design_scores_gemma":[0.0007580814,0.0005296375,0.0014419161,0.005069393,0.00006123604,0.00036392699,0.0000011628539,0.2580448,0.0025770161,0.7202864,0.007890635,0.002975758],"about_ca_topic_score_codex":0.00008099595,"about_ca_topic_score_gemma":0.00018311999,"teacher_disagreement_score":0.8835732,"about_ca_system_score_codex":0.00014189184,"about_ca_system_score_gemma":0.0005306132,"threshold_uncertainty_score":0.9997644},"labels":[],"label_agreement":null},{"id":"W4367663098","doi":"10.1109/tvlsi.2023.3268999","title":"Speed/Area-Efficient ECC Processor Implementation Over GF(2<i> <sup>m</sup> </i>) on FPGA via Novel Algorithm-Architecture Co-Design","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Elliptic curve cryptography; Computer science; Field-programmable gate array; Algorithm; Arithmetic; Parallel computing; Gate array; Elliptic curve; Embedded system; Mathematics; Public-key cryptography; Encryption; Operating system","score_opus":0.02008333845369369,"score_gpt":0.2742102791230458,"score_spread":0.2541269406693521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367663098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012429187,0.00004446814,0.9821776,0.0004904277,0.0017309044,0.0016795438,0.00041352218,0.0008406657,0.00019368259],"genre_scores_gemma":[0.9922378,0.000034482717,0.0059526726,0.0003047538,0.00024038272,0.00041446072,0.00010665511,0.00006991858,0.00063884555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956598,0.00034297977,0.0008532356,0.0010779751,0.0012580833,0.00080788054],"domain_scores_gemma":[0.9979809,0.00036661566,0.00026128493,0.00084938353,0.00028631138,0.0002555355],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009957366,0.00056423526,0.0004768559,0.0011970999,0.0008525841,0.00054756267,0.00074626977,0.00028618713,0.00011345949],"category_scores_gemma":[0.0000096244885,0.00047834078,0.0003834572,0.0023807092,0.0000944986,0.0004438561,0.000008685464,0.0006718865,0.00040528562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010807789,0.0011067544,0.000012884077,0.000109588356,0.00017311118,0.00002652385,0.0056144623,0.9218187,0.0066696345,0.00049310643,0.003442173,0.06042503],"study_design_scores_gemma":[0.001796629,0.0005862396,0.00014383388,0.00025837822,0.000060441518,0.00006767868,0.0016125897,0.9468759,0.045237757,0.00014607704,0.0025928384,0.00062169455],"about_ca_topic_score_codex":0.0002134878,"about_ca_topic_score_gemma":0.00008352223,"teacher_disagreement_score":0.9798086,"about_ca_system_score_codex":0.0002445572,"about_ca_system_score_gemma":0.0001501421,"threshold_uncertainty_score":0.9997668},"labels":[],"label_agreement":null},{"id":"W4378556424","doi":"10.1109/icjece.2023.3243888","title":"High-Performance RNS Modular Exponentiation by Sum-Residue Reduction","year":2023,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Modular exponentiation; Exponentiation; Cryptography; Residue number system; Public-key cryptography; Modular arithmetic; Arithmetic; Computer science; Mathematics; Parallel computing; Algorithm; Encryption; Operating system","score_opus":0.0037872266794757086,"score_gpt":0.1550938089679202,"score_spread":0.15130658228844449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378556424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64671457,0.00054131995,0.3518827,0.00031003842,0.00048593513,0.00002903449,6.334128e-7,0.000032848337,0.0000029564126],"genre_scores_gemma":[0.99412304,0.00012368437,0.005495951,0.00002704615,0.00020949291,0.0000012224326,0.0000018114386,0.000006780586,0.000010942077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992412,0.000015853797,0.00020292768,0.00012845799,0.00012780377,0.00028380536],"domain_scores_gemma":[0.99945873,0.000033164826,0.000054126405,0.000098995755,0.00005772806,0.00029725258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015198436,0.00009258482,0.00012929758,0.0005250082,0.00010037515,0.000118436314,0.0002453582,0.000049364033,0.0000014538997],"category_scores_gemma":[0.000010708268,0.00008639842,0.00004388276,0.00089279056,0.000013414765,0.00031338364,0.00001809646,0.0001884615,0.0000028041468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021998332,0.00008568897,0.008537008,0.00017598008,0.00041201393,0.000645907,0.0013257503,0.435486,0.03202768,0.05822044,0.028513208,0.43454832],"study_design_scores_gemma":[0.00032377455,0.00027101854,0.048067745,0.0000545114,0.000011941307,0.00026087087,0.0000037258926,0.9423003,0.0062304116,0.0004552877,0.0018021581,0.00021821131],"about_ca_topic_score_codex":0.0002520333,"about_ca_topic_score_gemma":0.000022536095,"teacher_disagreement_score":0.50681436,"about_ca_system_score_codex":0.000051645842,"about_ca_system_score_gemma":0.00008364211,"threshold_uncertainty_score":0.35232252},"labels":[],"label_agreement":null},{"id":"W4381432897","doi":"10.1007/s44007-023-00053-2","title":"Orienteering with One Endomorphism","year":2023,"lang":"en","type":"article","venue":"La Matematica","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University of Edmonton; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation; National Science Foundation","keywords":"Endomorphism; Endomorphism ring; Mathematics; Isogeny; Graph; Discrete mathematics; Algebra over a field; Pure mathematics; Elliptic curve","score_opus":0.010616115581969331,"score_gpt":0.2028956555379954,"score_spread":0.19227953995602606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381432897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19126886,0.00011794165,0.75378436,0.0034897947,0.00039903805,0.0005792359,0.0000035377789,0.0025325168,0.047824703],"genre_scores_gemma":[0.9482418,0.000018977587,0.051252507,0.00006390978,0.00001921875,0.00003789731,0.0000013850514,0.0000107685055,0.00035354716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992164,0.000038968763,0.00012649663,0.00017652981,0.00023233054,0.00020932133],"domain_scores_gemma":[0.99934477,0.00015623562,0.000035468747,0.00038156082,0.000023298433,0.00005865111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022828807,0.00007928419,0.00012817657,0.00012491818,0.00008055298,0.0001240637,0.0003609083,0.00002654052,0.00002176289],"category_scores_gemma":[0.00001933355,0.000057735146,0.000032374523,0.00081045745,0.00004648411,0.00015218172,0.00012993359,0.000068396905,0.00036128776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052167416,0.00007512518,0.00033739227,0.00035057616,0.00006424574,0.00023590663,0.0014975216,0.00010412462,0.0014601868,0.99254346,0.00077797205,0.0025482702],"study_design_scores_gemma":[0.007839075,0.0013702079,0.13207896,0.0047812858,0.00027471545,0.0014433023,0.0012926714,0.21137075,0.054413356,0.52797484,0.05339877,0.003762042],"about_ca_topic_score_codex":0.0000048956026,"about_ca_topic_score_gemma":0.0000015954602,"teacher_disagreement_score":0.7569729,"about_ca_system_score_codex":0.0000046360024,"about_ca_system_score_gemma":0.000013758824,"threshold_uncertainty_score":0.4643744},"labels":[],"label_agreement":null},{"id":"W4385628833","doi":"10.1145/3614408.3614417","title":"Drinfeld Modules in SageMath","year":2023,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Concordia University","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Programming language","score_opus":0.03958561973493107,"score_gpt":0.2996038609761693,"score_spread":0.26001824124123823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385628833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45000586,0.0015159412,0.51379925,0.028905584,0.00079928787,0.00078499224,0.000005016873,0.0015705712,0.0026135002],"genre_scores_gemma":[0.71336365,0.00059312634,0.28561798,0.0003048385,0.000022499145,0.00006132328,0.000011046854,0.000009488528,0.00001609336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985211,0.00022834113,0.00038209304,0.0003462117,0.00018033716,0.00034190755],"domain_scores_gemma":[0.99400604,0.0008223251,0.00005861237,0.0050214953,0.000036653226,0.00005487961],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005806134,0.00014217499,0.00019587549,0.0008908618,0.00014750824,0.00015081897,0.006290313,0.000074608826,0.0000041511357],"category_scores_gemma":[0.00006385753,0.00014537963,0.00007646063,0.0032407993,0.00012129091,0.0003880216,0.00484625,0.0003525907,0.00016629133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027681288,0.00047855478,0.043800313,0.000034875633,0.00003256315,0.00006684267,0.004871124,0.003214476,0.000080386235,0.57832766,0.0027276708,0.36636278],"study_design_scores_gemma":[0.00048587107,0.00003368002,0.3787633,0.00011171512,0.0000024244557,0.000013359954,0.000038963433,0.4289976,0.00004374971,0.18815336,0.0030824235,0.00027357167],"about_ca_topic_score_codex":0.0001152401,"about_ca_topic_score_gemma":0.0004042799,"teacher_disagreement_score":0.42578313,"about_ca_system_score_codex":0.000035168596,"about_ca_system_score_gemma":0.000035337434,"threshold_uncertainty_score":0.99908614},"labels":[],"label_agreement":null},{"id":"W4385732037","doi":"10.1109/tvlsi.2023.3299508","title":"Novel Formulations of M-Term Overlap-Free Karatsuba Binary Polynomial Multipliers and Their Hardware Implementations","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Field-programmable gate array; Binary number; Polynomial; Computer science; Arithmetic; Operand; Term (time); Parallel computing; Mathematics; Computer hardware","score_opus":0.018861159446916718,"score_gpt":0.2561570545987421,"score_spread":0.2372958951518254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385732037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12239261,0.00005833037,0.8737875,0.00033733333,0.001456067,0.0006048169,0.0009288948,0.00028954132,0.00014486794],"genre_scores_gemma":[0.9960024,0.000055999983,0.003312641,0.000044617907,0.000063492975,0.00018041438,0.00005893556,0.000024219758,0.00025732204],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980232,0.00010981644,0.00063766,0.0004920183,0.0003503459,0.00038692943],"domain_scores_gemma":[0.9984233,0.00030337385,0.0001936659,0.00074629183,0.00018841239,0.00014498488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035958912,0.0002849278,0.0003274589,0.00082763884,0.0006594242,0.00020469929,0.00050317415,0.0001551486,0.000020341482],"category_scores_gemma":[0.000011700668,0.00024354743,0.00026261614,0.0012746038,0.00012287156,0.0007126883,0.00001551309,0.00025710024,0.000027139014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006143491,0.0050600674,0.004858226,0.0011482214,0.0019571546,0.00004445397,0.06894549,0.102892324,0.65682006,0.054371916,0.020259904,0.08302786],"study_design_scores_gemma":[0.008619332,0.00112793,0.029860025,0.0007946046,0.00022501651,0.00015987472,0.019847251,0.8399052,0.09405922,0.0009126647,0.0028417162,0.0016471478],"about_ca_topic_score_codex":0.00018820113,"about_ca_topic_score_gemma":0.00046464612,"teacher_disagreement_score":0.8736097,"about_ca_system_score_codex":0.000075041506,"about_ca_system_score_gemma":0.00008190867,"threshold_uncertainty_score":0.99315757},"labels":[],"label_agreement":null},{"id":"W4386297932","doi":"10.4236/jis.2023.144018","title":"Construction and Implementation of a Privacy-Preserving Identity-Based Encryption Architecture","year":2023,"lang":"en","type":"article","venue":"Journal of Information Security","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Encryption; Identity (music); Scheme (mathematics); Computer security; Architecture; Theoretical computer science; Mathematics","score_opus":0.006640808836855351,"score_gpt":0.26780036556783643,"score_spread":0.26115955673098107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386297932","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5552924,0.00002064195,0.44377273,0.00064605015,0.00014302849,0.00006461901,0.000003014587,0.000018278195,0.000039183902],"genre_scores_gemma":[0.9650431,0.00005471639,0.03481437,0.000057036603,0.000023880026,0.0000011496859,0.000004362304,0.0000012333019,1.4151755e-7],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9990197,0.000050162693,0.00046228606,0.000041670402,0.00034183997,0.00008433556],"domain_scores_gemma":[0.9989584,0.00005911255,0.0005764877,0.000116986936,0.00024518208,0.00004381794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066633354,0.000053792424,0.00010321725,0.0006068267,0.00007227946,0.00011182973,0.0002487681,0.00003542998,0.000009319701],"category_scores_gemma":[0.000067157,0.000046163692,0.0000651003,0.0006870203,0.000035274184,0.0029556113,0.00009254979,0.00011912112,0.0000020084426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015440253,0.0001061554,0.05821528,0.0016163328,0.00021916615,0.000015351507,0.080322,0.005837947,0.008836278,0.33084914,0.0021903557,0.5116376],"study_design_scores_gemma":[0.005026027,0.00075376476,0.5141986,0.00037327054,0.00007671408,0.0004436992,0.008403221,0.05535056,0.034982633,0.37439233,0.0055549294,0.0004442531],"about_ca_topic_score_codex":0.000020693094,"about_ca_topic_score_gemma":0.000009038008,"teacher_disagreement_score":0.51119334,"about_ca_system_score_codex":0.000014059991,"about_ca_system_score_gemma":0.00006803665,"threshold_uncertainty_score":0.21427469},"labels":[],"label_agreement":null},{"id":"W4387602365","doi":"10.1093/comjnl/bxad077","title":"Exact Short Products From Truncated Multipliers","year":2023,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multiplier (economics); Mathematics; Irrational number; Integer (computer science); Arithmetic; Multiple; Discrete mathematics; Product (mathematics); Combinatorics; Algorithm; Computer science","score_opus":0.021860114818867023,"score_gpt":0.23777292412836773,"score_spread":0.21591280930950071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387602365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4190892,0.00035035083,0.56492555,0.010617921,0.004048334,0.00020629767,0.0000030804335,0.0005305763,0.00022869087],"genre_scores_gemma":[0.95015436,0.00014837038,0.04740069,0.0006362972,0.0015460704,0.000004722507,0.0000054394036,0.00001802676,0.00008601072],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849683,0.00017663419,0.00025719206,0.0002994548,0.00038396957,0.00038589578],"domain_scores_gemma":[0.998875,0.00020180448,0.00007238393,0.0006165866,0.00010433638,0.00012985524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068201666,0.00015351323,0.00015976299,0.00020823344,0.00050819915,0.00046700175,0.0016397883,0.000045386758,0.000010927034],"category_scores_gemma":[0.000019706527,0.000093250346,0.00012758518,0.0012162223,0.00008269717,0.00030057912,0.00040395025,0.0004430874,0.00016919085],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039774404,0.00021849821,0.0046471963,0.000015975837,0.0005360391,0.0007965928,0.009784797,0.0084903,0.0057455623,0.0054493737,0.121061414,0.84321445],"study_design_scores_gemma":[0.0013781589,0.00024513746,0.31710842,0.00010750308,0.000058525784,0.00097304344,0.00012736153,0.6066496,0.0044127847,0.043921355,0.024269035,0.0007490603],"about_ca_topic_score_codex":0.0000129085065,"about_ca_topic_score_gemma":0.0000018274774,"teacher_disagreement_score":0.8424654,"about_ca_system_score_codex":0.000020384543,"about_ca_system_score_gemma":0.00006797652,"threshold_uncertainty_score":0.45033085},"labels":[],"label_agreement":null},{"id":"W4387772454","doi":"10.1007/978-3-031-37238-4_3","title":"Applications","year":2023,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Primality test; Mersenne prime; Lucas sequence; Number theory; Integer factorization; Lucas number; Congruence relation; Mathematics; Diophantine equation; Cryptography; Integer (computer science); Computer science; Fermat's Last Theorem; Discrete mathematics; Algebra over a field; Prime number; Arithmetic; Fibonacci number; Algorithm; Combinatorics; Pure mathematics; Public-key cryptography; Programming language","score_opus":0.02648244973900105,"score_gpt":0.24800376276074543,"score_spread":0.22152131302174438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387772454","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000023410103,0.0003780533,0.25241196,0.0001955501,0.00025455616,0.000694527,0.000013333639,0.0004732968,0.7455764],"genre_scores_gemma":[0.00016310388,0.00053228,0.1254073,0.00016756491,0.00021274574,0.00027887468,0.000018107616,0.00014628217,0.87307376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980756,0.000011542488,0.0006024123,0.0005418188,0.0004340652,0.00033454745],"domain_scores_gemma":[0.9977407,0.00034014674,0.0002575802,0.0014847886,0.00007306033,0.000103759616],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00034772514,0.00036136992,0.0004668005,0.0005624467,0.000115132534,0.00015424161,0.0014720557,0.00034740017,0.000035233603],"category_scores_gemma":[0.000021471256,0.00034464587,0.00023731327,0.00018518709,0.00015673609,0.0000986041,0.0004819137,0.0005297851,0.0011268364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.3728716e-7,0.00003240777,0.0000018212743,0.00020355287,0.000030826493,0.00003620393,0.00044748778,0.000009192096,0.000006071468,0.9887171,0.0015858213,0.008929191],"study_design_scores_gemma":[0.00011963356,0.000019125553,0.0000075410235,0.0003396609,0.000022917915,0.000019193887,0.000016233711,0.001768546,0.000021012249,0.892662,0.10464012,0.00036401252],"about_ca_topic_score_codex":0.0000029010591,"about_ca_topic_score_gemma":0.000022492011,"teacher_disagreement_score":0.12749738,"about_ca_system_score_codex":0.000050740866,"about_ca_system_score_gemma":0.00009305693,"threshold_uncertainty_score":0.9999006},"labels":[],"label_agreement":null},{"id":"W4389670345","doi":"10.1145/3637529.3637534","title":"On a Two-Layer Modular Arithmetic","year":2023,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Moduli; Layer (electronics); Modular design; Arithmetic; Modular arithmetic; Computer science; Reduction (mathematics); Mathematics; Parallel computing; Algorithm; Geometry; Programming language; Materials science; Nanotechnology","score_opus":0.04662519339983078,"score_gpt":0.31625338015213533,"score_spread":0.26962818675230454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389670345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2282441,0.0006601851,0.7393438,0.025806407,0.0009896533,0.00072119397,0.000006341276,0.0017637124,0.002464572],"genre_scores_gemma":[0.7451897,0.00018386771,0.25348923,0.0009621552,0.000039239283,0.000077565,0.0000144493615,0.000015884281,0.000027859005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980854,0.00032299495,0.00037898615,0.0004847176,0.00030751113,0.00042040276],"domain_scores_gemma":[0.9914303,0.0012832395,0.00007670926,0.007043755,0.00007085966,0.00009515578],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00059549743,0.00020316974,0.00022689442,0.000899226,0.0003070587,0.00021616918,0.007177752,0.00007734847,0.00000789841],"category_scores_gemma":[0.000095802956,0.0001992835,0.00013476901,0.0032112354,0.00015621228,0.0002973161,0.003951612,0.0004566181,0.00053590845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004440636,0.0004542986,0.0015327315,0.000014718077,0.000057643723,0.000049372167,0.0014774369,0.0067057717,0.00018754583,0.8251971,0.003069376,0.16124958],"study_design_scores_gemma":[0.00070953986,0.00009655822,0.031033836,0.00007999062,0.0000063302914,0.000019316756,0.00001320235,0.6168241,0.000108637316,0.34836692,0.0024290683,0.00031252872],"about_ca_topic_score_codex":0.000060215603,"about_ca_topic_score_gemma":0.00004662293,"teacher_disagreement_score":0.61011827,"about_ca_system_score_codex":0.000043935106,"about_ca_system_score_gemma":0.000049615144,"threshold_uncertainty_score":0.9981939},"labels":[],"label_agreement":null},{"id":"W4390866293","doi":"10.1007/978-981-96-0891-1_10","title":"An Algorithmic Approach to (2, 2)-Isogenies in the Theta Model and Applications to Isogeny-Based Cryptography","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Capital Commission","funders":"Engineering and Physical Sciences Research Council; Agence Nationale de la Recherche","keywords":"Isogeny; Subroutine; Cryptography; Computer science; Rust (programming language); Algorithm; Elliptic curve cryptography; Mathematics; Elliptic curve; Public-key cryptography; Encryption; Pure mathematics; Operating system; Programming language","score_opus":0.016589218436355874,"score_gpt":0.2520204255616119,"score_spread":0.23543120712525603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390866293","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017122432,0.00085108116,0.9936708,0.0014475394,0.00019291058,0.0013741516,0.000016979857,0.0001324308,0.002142869],"genre_scores_gemma":[0.17400527,0.00002657749,0.82140976,0.0039847135,0.00022997074,0.00027826798,0.000006319418,0.000036643098,0.000022472694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631643,0.000043086573,0.00040288814,0.001830547,0.0008088949,0.00059816486],"domain_scores_gemma":[0.9975466,0.00024983636,0.000074493335,0.0017778304,0.00010979922,0.00024145014],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009512236,0.00049932575,0.0003823805,0.0021909217,0.0003000945,0.0010540138,0.0041154223,0.00021501319,0.0000010498339],"category_scores_gemma":[0.000010247353,0.0003611076,0.00014867357,0.002680202,0.00052134134,0.0002760134,0.000682528,0.00068653264,0.000014040328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005413736,0.00011961594,0.000027811837,0.000066998124,0.00001252932,0.000015353515,0.004043296,0.5185923,0.00019005891,0.27860904,0.000015727008,0.19830184],"study_design_scores_gemma":[0.00009305984,0.00012474503,0.00011063114,0.0000916315,0.000010607915,0.000024155637,0.0000017373922,0.6970005,0.0000903666,0.30138415,0.00064812036,0.00042030396],"about_ca_topic_score_codex":0.000028444121,"about_ca_topic_score_gemma":0.0000947621,"teacher_disagreement_score":0.19788153,"about_ca_system_score_codex":0.000058330697,"about_ca_system_score_gemma":0.0002457975,"threshold_uncertainty_score":0.999983},"labels":[],"label_agreement":null},{"id":"W4391321596","doi":"10.18280/mmep.110124","title":"Improving the Robustness of RSA Encryption Through Input-Based Key Generation","year":2024,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Robustness (evolution); Key generation; Encryption; Computer science; Key (lock); Computer security; Embedded system; Chemistry","score_opus":0.025885446874136474,"score_gpt":0.20990263068164264,"score_spread":0.18401718380750617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391321596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024145547,0.001068634,0.9740178,0.00026525347,0.00016591133,0.00012701168,5.791279e-7,0.00017618277,0.000033099484],"genre_scores_gemma":[0.72263604,0.000030930496,0.277235,0.000007683284,0.000052993237,0.000020673486,9.76543e-7,0.00000961981,0.000006098072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922925,0.00001524123,0.00022786437,0.00020777622,0.00016237801,0.00015747662],"domain_scores_gemma":[0.9995473,0.0001474715,0.000026579637,0.00021900728,0.000028704868,0.00003096106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003439842,0.00011204805,0.00012350403,0.00007223823,0.00007110835,0.00018592237,0.0001766251,0.000057408695,0.0000017102739],"category_scores_gemma":[0.00001466052,0.000073597024,0.00005834887,0.0002808486,0.000033131313,0.00019862725,0.00004312887,0.00014246677,0.0000017126025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.3024094e-7,0.000014170738,3.762266e-7,0.00060688925,0.0000097390075,6.9036827e-7,0.000710261,0.86107165,0.002413211,0.1333807,0.0000045037114,0.0017874596],"study_design_scores_gemma":[0.000055355547,0.000025237527,9.585223e-7,0.0002580305,0.000014829621,0.000007792907,0.000005773198,0.98717195,0.001891188,0.010414716,0.00005866118,0.00009550021],"about_ca_topic_score_codex":0.000009656025,"about_ca_topic_score_gemma":2.657301e-7,"teacher_disagreement_score":0.6984905,"about_ca_system_score_codex":0.000008721725,"about_ca_system_score_gemma":0.000016944865,"threshold_uncertainty_score":0.30011997},"labels":[],"label_agreement":null},{"id":"W4391661073","doi":"10.1090/conm/796/16008","title":"Deuring for the people: Supersingular elliptic curves with prescribed endomorphism ring in general characteristic","year":2024,"lang":"en","type":"other","venue":"Contemporary mathematics - American Mathematical Society","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Academia Sinica","keywords":"Supersingular elliptic curve; Endomorphism ring; Mathematics; Schoof's algorithm; Counting points on elliptic curves; Endomorphism; Elliptic curve; Ring (chemistry); Elliptic curve point multiplication; Cryptography; Edwards curve; Polynomial ring; Modular elliptic curve; Twists of curves; Algebra over a field; Polynomial; Number theory; Order (exchange); Discrete mathematics; Pure mathematics; Algorithm; Quarter period","score_opus":0.02011824785244935,"score_gpt":0.24955199205427514,"score_spread":0.2294337442018258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391661073","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039997886,0.020956775,0.93465066,0.0024249558,0.00034839273,0.0040810048,0.00008713503,0.0008981192,0.036152955],"genre_scores_gemma":[0.03461458,0.0034914638,0.8434311,0.0017222187,0.0009687614,0.0027561681,0.00008190515,0.0021650235,0.110768765],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996885,0.00009634398,0.0008118135,0.0008618572,0.0006597794,0.00068521313],"domain_scores_gemma":[0.9967584,0.0011620153,0.00052101613,0.001319356,0.000060596747,0.00017863719],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000772901,0.0007052443,0.0013372456,0.00018659353,0.00014163494,0.00034150205,0.0014552886,0.00018042362,0.00007792823],"category_scores_gemma":[0.00013954651,0.00045220484,0.0006377351,0.0010062066,0.0006750464,0.00015529731,0.0003729021,0.0006292204,0.00007013958],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054944227,0.0024384514,0.00021498303,0.070467286,0.004636812,0.00032966922,0.044805065,0.000037285223,0.0003893685,0.30851734,0.5648545,0.003254333],"study_design_scores_gemma":[0.004913216,0.001304526,0.00030809577,0.055981547,0.0022476097,0.00060332887,0.0068086265,0.67297965,0.0002550617,0.13439032,0.113751404,0.0064565777],"about_ca_topic_score_codex":0.00010051168,"about_ca_topic_score_gemma":0.00002787695,"teacher_disagreement_score":0.6729424,"about_ca_system_score_codex":0.000073388816,"about_ca_system_score_gemma":0.00018908303,"threshold_uncertainty_score":0.999793},"labels":[],"label_agreement":null},{"id":"W4393258258","doi":"10.1007/978-3-031-56232-7_8","title":"Generating Supersingular Elliptic Curves over $$\\mathbb {F}_p$$ with Unknown Endomorphism Ring","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Supersingular elliptic curve; Endomorphism ring; Endomorphism; Elliptic curve; Computer science; Ring (chemistry); Elliptic curve point multiplication; Discrete mathematics; Mathematics; Pure mathematics","score_opus":0.010076143823301693,"score_gpt":0.21812646846719425,"score_spread":0.20805032464389256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393258258","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004660187,0.013082854,0.9807999,0.00084611244,0.0015983285,0.00042971995,0.0000036539736,0.00031391063,0.0024594609],"genre_scores_gemma":[0.13873217,0.0009722796,0.8519892,0.0052132923,0.0016056752,0.000034325087,0.000014023891,0.0001780656,0.0012610002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953033,0.00005411565,0.00053624576,0.0019353105,0.0013004346,0.00087062415],"domain_scores_gemma":[0.9974548,0.000557929,0.00018518121,0.0013859721,0.00019114575,0.0002249796],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012015771,0.00071955903,0.00063384516,0.0011177829,0.00042657097,0.0010551931,0.0025416524,0.00026807332,0.000027875161],"category_scores_gemma":[0.000056320347,0.0005646058,0.00022587381,0.0012218617,0.0009515289,0.00059567275,0.0010529313,0.0011829132,0.000035741898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016652599,0.00012293863,0.00018760751,0.0016801367,0.00021738918,0.0029941092,0.0036138417,0.1382838,0.002455318,0.28792584,0.00017577641,0.5623266],"study_design_scores_gemma":[0.00039077413,0.00036978492,0.000038814236,0.0065665175,0.00006261702,0.0004614572,4.195632e-7,0.91209406,0.0015442036,0.073329985,0.0037921926,0.0013491764],"about_ca_topic_score_codex":0.00003627237,"about_ca_topic_score_gemma":0.000114376344,"teacher_disagreement_score":0.77381027,"about_ca_system_score_codex":0.00018954421,"about_ca_system_score_gemma":0.000443762,"threshold_uncertainty_score":0.9999818},"labels":[],"label_agreement":null},{"id":"W4395099382","doi":"10.1007/978-3-031-48679-1_18","title":"On the Optimization of Pippenger’s Bucket Method with Precomputation","year":2023,"lang":"en","type":"book-chapter","venue":"Fields Institute communications","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Precomputation; Computer science; Algorithm","score_opus":0.06329506006541884,"score_gpt":0.29408417039547247,"score_spread":0.23078911033005362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395099382","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018222203,0.000116366056,0.78622836,0.005071119,0.00020421194,0.00035030124,0.000013998427,0.00012846405,0.20788535],"genre_scores_gemma":[0.011935704,0.002856142,0.9343943,0.0008982553,0.00007982185,0.00016325632,0.00029921465,0.00007181989,0.049301494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895346,0.00009146347,0.00031707503,0.00026128607,0.00026063804,0.000116049705],"domain_scores_gemma":[0.9955972,0.0010871468,0.00030196394,0.002782075,0.00019549251,0.00003615162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034208017,0.00018836248,0.00021618955,0.00025338266,0.00034955997,0.00007330445,0.0023346646,0.00021448282,0.000029457398],"category_scores_gemma":[0.00006394968,0.00013207833,0.000116581294,0.00026142524,0.00023741326,0.00017722759,0.0005423717,0.00055709283,0.00002991516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003450365,0.000024619198,7.2425183e-7,0.000015318989,0.00007248118,0.0000010878886,0.00033845878,0.057398602,4.6017658e-7,0.93244576,0.0010696125,0.008629403],"study_design_scores_gemma":[0.00052348146,0.0004997092,0.0000812092,0.0012879332,0.0001953852,0.000025503505,0.000048512935,0.3343189,0.00007710856,0.5944571,0.06770916,0.0007759858],"about_ca_topic_score_codex":0.000037912443,"about_ca_topic_score_gemma":0.00023052422,"teacher_disagreement_score":0.33798867,"about_ca_system_score_codex":0.000019571537,"about_ca_system_score_gemma":0.0001277806,"threshold_uncertainty_score":0.53859985},"labels":[],"label_agreement":null},{"id":"W4396817466","doi":"10.1109/tvlsi.2024.3394871","title":"A High Speed and Area Efficient Processor for Elliptic Curve Scalar Point Multiplication for GF(2<i> <sup>m</sup> </i>)","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Scalar multiplication; Elliptic curve point multiplication; Elliptic curve; Scalar (mathematics); Elliptic curve cryptography; Arithmetic; Elliptic Curve Digital Signature Algorithm; Multiplication (music); Point (geometry); Mathematics; Parallel computing; Computer science; Physics; Combinatorics; Pure mathematics; Geometry; Operating system; Public-key cryptography","score_opus":0.012689246435146942,"score_gpt":0.23926761444291889,"score_spread":0.22657836800777195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396817466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04049569,0.00064597215,0.9528012,0.0009092603,0.001669326,0.0026293865,0.00036081934,0.00045973234,0.000028593422],"genre_scores_gemma":[0.98849636,0.00005563973,0.009522291,0.00008078358,0.00016895798,0.0011894896,0.00004108373,0.000042909793,0.00040245705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974531,0.00011366965,0.0006468667,0.00092652097,0.00039402704,0.0004657942],"domain_scores_gemma":[0.9982439,0.00056116853,0.00012170771,0.00053281424,0.00036834768,0.00017203117],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007761783,0.00036045857,0.000380904,0.00053667737,0.000529526,0.000728276,0.00036374523,0.00022164613,0.000008028699],"category_scores_gemma":[0.000024819748,0.0002980736,0.00033468957,0.00078562775,0.00008224505,0.00046921402,0.000004666958,0.0002768471,0.000034539553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085946004,0.0038862135,0.00005244946,0.0052749985,0.0009600388,0.00002134555,0.020658785,0.7829938,0.02572873,0.0707406,0.0055806893,0.0832429],"study_design_scores_gemma":[0.0010283018,0.00034181794,0.000025897312,0.0005404884,0.00009899161,0.000043623728,0.00064842845,0.97604173,0.017372794,0.00050843525,0.002996485,0.00035301605],"about_ca_topic_score_codex":0.000066495595,"about_ca_topic_score_gemma":0.000053956082,"teacher_disagreement_score":0.94800067,"about_ca_system_score_codex":0.00013280196,"about_ca_system_score_gemma":0.00008745242,"threshold_uncertainty_score":0.99994713},"labels":[],"label_agreement":null},{"id":"W4399491485","doi":"10.3390/sym16060715","title":"Symmetry-Enabled Resource-Efficient Systolic Array Design for Montgomery Multiplication in Resource-Constrained MIoT Endpoints","year":2024,"lang":"en","type":"article","venue":"Symmetry","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Prince Sattam bin Abdulaziz University","keywords":"Computer science; Modular arithmetic; Multiplication (music); Cryptography; Modular design; Distributed computing; Enhanced Data Rates for GSM Evolution; Resource (disambiguation); Embedded system; Computer network; Computer security; Telecommunications; Mathematics","score_opus":0.016892026568942002,"score_gpt":0.24872066654935918,"score_spread":0.23182863998041717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399491485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028302096,0.0036992664,0.96032363,0.0016928804,0.00050364627,0.0014307481,0.000020667127,0.0006336388,0.003393407],"genre_scores_gemma":[0.9473164,0.000017108516,0.051736522,0.00026713542,0.00016123982,0.00021779667,0.000017484372,0.000046819074,0.00021951154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968606,0.00030670632,0.0006170326,0.0010446325,0.00043042665,0.0007405536],"domain_scores_gemma":[0.9973811,0.001313298,0.00011541866,0.0009239104,0.00006643616,0.00019984289],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017298637,0.00033656496,0.0003925753,0.0014676835,0.00023665711,0.00038203862,0.0009662772,0.00023147074,0.000009024711],"category_scores_gemma":[0.00029379333,0.00030425284,0.00029398192,0.0028914737,0.00013279659,0.00019972339,0.00014142013,0.0003934876,0.000060977367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045904194,0.0019082,0.0008773003,0.0025570993,0.00066280743,0.00043942223,0.010257529,0.013083055,0.06348221,0.494523,0.019980805,0.39176953],"study_design_scores_gemma":[0.0040616556,0.0006702019,0.005961563,0.0018878505,0.00016194943,0.00033402847,0.0017062374,0.8278819,0.061655812,0.027325492,0.06614667,0.0022066603],"about_ca_topic_score_codex":0.000037898306,"about_ca_topic_score_gemma":0.000005596052,"teacher_disagreement_score":0.9190143,"about_ca_system_score_codex":0.0001609857,"about_ca_system_score_gemma":0.00012658158,"threshold_uncertainty_score":0.99994093},"labels":[],"label_agreement":null},{"id":"W4400065448","doi":"10.5539/jmr.v16n3p28","title":"A New Method for Testing Whether a Number Is Prime","year":2024,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Primality test; Mathematics; Prime factor; Prime (order theory); Almost prime; Prime number; Decimal; Order (exchange); Combinatorics; Prime k-tuple; Discrete mathematics; Arithmetic","score_opus":0.16022138709763242,"score_gpt":0.475637886823668,"score_spread":0.3154164997260356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400065448","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010938739,0.0007772833,0.99236554,0.0033681998,0.00018969517,0.00017368136,9.5130935e-7,0.000028088069,0.0020026616],"genre_scores_gemma":[0.00389658,0.000026712549,0.9941686,0.000038749622,0.00025974144,0.0000048496127,3.6108496e-8,0.000017226977,0.0015875187],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808335,0.00012330775,0.00041264054,0.0001641732,0.00088697014,0.00032957556],"domain_scores_gemma":[0.9953786,0.0034986301,0.00009762391,0.00029261466,0.00056579825,0.00016672153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055533713,0.00008993415,0.00020951763,0.00041528445,0.00011165049,0.00055338675,0.00085843954,0.00006424028,0.00007130465],"category_scores_gemma":[0.0007231697,0.00006127458,0.00020550258,0.0011293357,0.000032365642,0.0002847779,0.00017380093,0.00050119037,0.00005956206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020208658,0.0004247719,0.000112887305,0.0015543441,0.00048326823,0.00026361414,0.02150118,0.000041505165,0.019542312,0.29224908,0.12028495,0.5435219],"study_design_scores_gemma":[0.00036459102,0.00030389507,0.00003591637,0.00092193595,0.000027449214,0.0010594226,0.0002680489,0.20297821,0.008678233,0.76028454,0.024934363,0.00014339715],"about_ca_topic_score_codex":0.000014491322,"about_ca_topic_score_gemma":0.000001045829,"teacher_disagreement_score":0.5433785,"about_ca_system_score_codex":0.000038246268,"about_ca_system_score_gemma":0.00048956415,"threshold_uncertainty_score":0.5336321},"labels":[],"label_agreement":null},{"id":"W4402264119","doi":"10.1109/icccas62034.2024.10652771","title":"Multivariate Polynomial Public Key Digital Signature Trefoil Knot Algorithm","year":2024,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McGill University","funders":"Carleton University","keywords":"Trefoil; Multivariate statistics; Key (lock); Computer science; Trefoil knot; Signature (topology); Public-key cryptography; Algorithm; Polynomial; Knot (papermaking); Digital signature; Mathematics; Computer security; Machine learning; Knot theory; Engineering; Encryption; Geometry","score_opus":0.010091415225142642,"score_gpt":0.22758253441909132,"score_spread":0.21749111919394867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402264119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017743596,0.0017832124,0.9577824,0.0067146635,0.0022377635,0.00017035012,0.000031263877,0.0014874852,0.028018543],"genre_scores_gemma":[0.93307865,0.000021711923,0.062153988,0.00031748874,0.0004199952,0.00001351971,0.000012866056,0.000021041466,0.0039607147],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984695,0.000031294097,0.00020654063,0.00056724437,0.00029997132,0.00042548156],"domain_scores_gemma":[0.9991734,0.0001368835,0.00002330288,0.00043009908,0.000049658476,0.00018663653],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00013864244,0.00020216237,0.00015253965,0.00033869458,0.00013419238,0.0021195237,0.00079567917,0.0001388799,0.00009904713],"category_scores_gemma":[0.000023347302,0.00014403375,0.00021090695,0.0010952689,0.00007201169,0.0014660408,0.00031058848,0.0003174249,0.00022913817],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002153843,0.00010066963,0.0000362605,0.0000130971985,0.000082842525,0.00014738631,0.0004885482,0.0000058904284,0.00044554632,0.057387855,0.011371159,0.9299186],"study_design_scores_gemma":[0.0010229724,0.000256798,0.002140603,0.000084148,0.000026868607,0.00021490874,0.00010285256,0.4226963,0.0025211973,0.013378438,0.5564734,0.0010815416],"about_ca_topic_score_codex":0.000048164875,"about_ca_topic_score_gemma":0.000008008662,"teacher_disagreement_score":0.93130434,"about_ca_system_score_codex":0.000028062066,"about_ca_system_score_gemma":0.000121650344,"threshold_uncertainty_score":0.9989164},"labels":[],"label_agreement":null},{"id":"W4402272061","doi":"10.46586/tches.v2024.i4.737-762","title":"Faster Complete Addition Laws for Montgomery Curves","year":2024,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Law; Mathematics; Political science","score_opus":0.022917982116735486,"score_gpt":0.25090124132263025,"score_spread":0.22798325920589477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402272061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007076782,0.01001832,0.9835662,0.001263888,0.0020011463,0.00085270323,0.00040488242,0.0006430301,0.0005421087],"genre_scores_gemma":[0.9894163,0.0025228825,0.0062081097,0.00042809822,0.00021408769,0.0008866816,0.000057716108,0.000050478346,0.00021565004],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99787146,0.00015575706,0.00044252034,0.0007337729,0.00036099658,0.00043552404],"domain_scores_gemma":[0.9986461,0.00045867436,0.00006057474,0.00052812655,0.0001116548,0.00019489335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044746912,0.00031976931,0.00037014764,0.0007329602,0.00046733717,0.0006241981,0.00035175786,0.00015598298,0.00004573422],"category_scores_gemma":[0.000006825224,0.00027356864,0.00042899756,0.0010491653,0.00012417418,0.000507163,0.000008942487,0.00029235496,0.00004374272],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026639487,0.0012362429,0.0001106686,0.01766985,0.0034797145,0.00026720343,0.0071542854,0.0035053268,0.0047609387,0.37605974,0.0835006,0.501989],"study_design_scores_gemma":[0.0023927558,0.0016271033,0.0007760172,0.009788672,0.00062977313,0.0006344432,0.0017122492,0.26416913,0.00071531435,0.014419604,0.70069295,0.002441974],"about_ca_topic_score_codex":0.000053626012,"about_ca_topic_score_gemma":0.000030361309,"teacher_disagreement_score":0.9887086,"about_ca_system_score_codex":0.000017393832,"about_ca_system_score_gemma":0.000038618335,"threshold_uncertainty_score":0.9999716},"labels":[],"label_agreement":null},{"id":"W4402388645","doi":"10.1080/00150517.2021.12427512","title":"Some Primality Tests Constructed from a Cubic Extension of the Lucas Functions","year":2021,"lang":"en","type":"article","venue":"˜The œFibonacci quarterly","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Mount Royal University","funders":"","keywords":"Primality test; Extension (predicate logic); Mathematics; Arithmetic; Computer science; Combinatorics; Prime (order theory); Programming language","score_opus":0.010202664213401975,"score_gpt":0.2206164963275649,"score_spread":0.21041383211416292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402388645","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98152447,0.0010202121,0.013294776,0.00210524,0.0013712075,0.000230152,0.000033580793,0.000112189875,0.00030818276],"genre_scores_gemma":[0.9967137,0.0000055242226,0.0026539643,0.0003422226,0.00012483579,0.0000124018015,0.0000065153345,0.00000892345,0.00013190837],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99823016,0.00031430446,0.00035408005,0.00045073056,0.0003836085,0.00026714275],"domain_scores_gemma":[0.9976063,0.00036879128,0.00017400518,0.0015586197,0.00021845005,0.00007383261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019940047,0.00016668496,0.00022060056,0.00005843852,0.00036177947,0.00013194552,0.00082803774,0.00008532,0.000041544125],"category_scores_gemma":[0.000021139265,0.000101330945,0.00026025463,0.00089779496,0.00024685683,0.00025379966,0.00016095937,0.00025379166,0.000036215257],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013634078,0.0021777053,0.10142943,0.0001553204,0.00093349046,0.0002674536,0.022038704,0.00011510886,0.40738004,0.1635136,0.011857406,0.28999537],"study_design_scores_gemma":[0.00075156474,0.00019060614,0.91794425,0.000070935705,0.00009018312,0.00014754015,0.0011018227,0.002319239,0.003943178,0.071466304,0.001688636,0.00028573436],"about_ca_topic_score_codex":0.00037940193,"about_ca_topic_score_gemma":0.00041864553,"teacher_disagreement_score":0.8165148,"about_ca_system_score_codex":0.000019293637,"about_ca_system_score_gemma":0.0002197486,"threshold_uncertainty_score":0.4132156},"labels":[],"label_agreement":null},{"id":"W4403905839","doi":"10.59934/jaiea.v4i1.647","title":"Super Encryption Feal Algorithm and Base64 Algorithm Image File Security","year":2024,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence and Engineering Applications (JAIEA)","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Encryption; FEAL; Computer science; Image (mathematics); Algorithm; Computer security; Computer vision; Materials science; Metallurgy","score_opus":0.010000566328373067,"score_gpt":0.24243481452270682,"score_spread":0.23243424819433375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403905839","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025291506,0.002223371,0.99408334,0.0006453016,0.0002456702,0.00011782723,0.00003649194,0.00008188946,0.000036962643],"genre_scores_gemma":[0.1953698,0.001968041,0.8016013,0.000061027677,0.0008735249,0.00006004609,0.000011389721,0.000028744114,0.000026122318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998936,0.000018195029,0.00039396514,0.00024717642,0.00020285514,0.00020183146],"domain_scores_gemma":[0.99925894,0.00022250594,0.000060589835,0.00018629152,0.00012125082,0.00015045294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035774734,0.00014460304,0.00016822945,0.00035482988,0.00013193808,0.00041031613,0.00025753264,0.000076532626,0.00004417769],"category_scores_gemma":[0.000025538113,0.00012941829,0.00009460306,0.0006346045,0.00008774895,0.00057024363,0.000074754025,0.00031276673,0.00001903453],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019292766,0.00006298568,0.0000034285504,0.00006070526,0.00004386744,0.000031386426,0.0007908612,0.00039504495,0.0032058442,0.030385364,0.0005118967,0.9645067],"study_design_scores_gemma":[0.00003092471,0.00013138037,0.000257142,0.00012619446,0.000039692848,0.00043875343,0.00027236185,0.94261855,0.0065741413,0.030919177,0.018331967,0.00025968705],"about_ca_topic_score_codex":0.000017903185,"about_ca_topic_score_gemma":0.0000016159865,"teacher_disagreement_score":0.964247,"about_ca_system_score_codex":0.000023567714,"about_ca_system_score_gemma":0.000044990244,"threshold_uncertainty_score":0.52775246},"labels":[],"label_agreement":null},{"id":"W4403947520","doi":"10.18280/mmep.111018","title":"Advancing Security: A Novel Approach with Linear Bézier Curve in Menezes-Vanstone Elliptic Curve Cryptosystem","year":2024,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Elliptic curve; Computer science; Mathematics; Mathematical analysis","score_opus":0.012415555316029595,"score_gpt":0.2053379014900942,"score_spread":0.19292234617406462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403947520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025543068,0.0023136293,0.97092855,0.00011010633,0.00008486689,0.00031775987,0.0000020508946,0.00040401577,0.0002959552],"genre_scores_gemma":[0.6175467,0.00007658422,0.38221675,0.00000756568,0.00003646757,0.000062767656,0.0000017760599,0.000032939337,0.000018485081],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998167,0.000022525835,0.0004060314,0.00057912007,0.00030198437,0.00052335643],"domain_scores_gemma":[0.9991961,0.00023015955,0.000032107455,0.00034744808,0.00003276464,0.00016140849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073779066,0.00029341603,0.00037573295,0.00032718727,0.0000631255,0.00025560774,0.0002784181,0.00011169192,0.0000017257044],"category_scores_gemma":[0.00001644743,0.00022189331,0.00007315226,0.00077188876,0.000043246935,0.00033965285,0.00009787993,0.00043736404,0.00000774084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025805623,0.00010056745,0.000011621774,0.002559246,0.00004054529,0.000018092134,0.0029967788,0.8490699,0.00018273,0.1447101,0.000001996439,0.00030586927],"study_design_scores_gemma":[0.00024255758,0.000064105916,0.0000021089738,0.0016725466,0.000020223373,0.00013211282,0.00004440638,0.98312324,0.000098287936,0.0140271485,0.0002554375,0.00031783083],"about_ca_topic_score_codex":0.000017128626,"about_ca_topic_score_gemma":0.0000015464603,"teacher_disagreement_score":0.5920036,"about_ca_system_score_codex":0.000037260408,"about_ca_system_score_gemma":0.000030180516,"threshold_uncertainty_score":0.90485466},"labels":[],"label_agreement":null},{"id":"W4404168251","doi":"","title":"PEARL-SCALLOP: Parameter Extension Applicable in Real Life for SCALLOP","year":2024,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Scallop; Extension (predicate logic); Pearl; Fishery; Computer science; Biology; Geography; Programming language","score_opus":0.01720746088512529,"score_gpt":0.24426188026850565,"score_spread":0.22705441938338036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404168251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09450886,0.0028666044,0.8602312,0.018524034,0.0007136974,0.00158842,0.000045622568,0.00068648893,0.020835066],"genre_scores_gemma":[0.6940627,0.0009804933,0.30092403,0.00023600503,0.0000486411,0.0004868789,0.00013950518,0.000063675405,0.0030580643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99499303,0.0018185911,0.0006819626,0.0014741305,0.0004727598,0.00055954925],"domain_scores_gemma":[0.9936342,0.0019656643,0.00027700665,0.002854129,0.000998305,0.0002706769],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00507997,0.00039862617,0.0005016367,0.0004926462,0.0002463322,0.0009392094,0.0023411768,0.0004243885,0.00001930452],"category_scores_gemma":[0.0008521682,0.00038967922,0.00041064626,0.00088827184,0.00019832468,0.00015035317,0.0036323024,0.00093024265,0.00005219785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054484448,0.0013166079,0.0013593483,0.0011530096,0.000188283,0.000038471684,0.012115469,0.0005700876,0.0034582012,0.82403654,0.0050870976,0.15062241],"study_design_scores_gemma":[0.0018963005,0.0000034788645,0.016735902,0.0059060627,0.00013141468,0.000029374427,0.00017308035,0.5951133,0.013983015,0.3437171,0.020464076,0.0018469124],"about_ca_topic_score_codex":0.0016768376,"about_ca_topic_score_gemma":0.0013388739,"teacher_disagreement_score":0.5995538,"about_ca_system_score_codex":0.00009236339,"about_ca_system_score_gemma":0.0003902367,"threshold_uncertainty_score":0.9998555},"labels":[],"label_agreement":null},{"id":"W4406084888","doi":"10.1016/j.ffa.2024.102570","title":"The complexity of elliptic normal bases","year":2025,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Carleton University","keywords":"Mathematics; Normal basis; Pure mathematics; Algebra over a field; Discrete mathematics; Galois module","score_opus":0.017341124241650643,"score_gpt":0.2365833396224899,"score_spread":0.21924221538083927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406084888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001882645,0.00086856744,0.9849078,0.0039222008,0.000041367923,0.0001473884,0.000008588335,0.00002835117,0.008193066],"genre_scores_gemma":[0.9963629,0.00019686016,0.0030067563,0.00021504129,0.000012849492,0.000059294132,0.0000018977836,0.0000011263983,0.00014325079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996439,0.000017899114,0.000112017544,0.00010695948,0.0000347981,0.000084381994],"domain_scores_gemma":[0.99915034,0.00041585483,0.000032476426,0.00034500775,0.000036310186,0.000019996993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000866727,0.000049235572,0.00006263623,0.000041616735,0.00029654524,0.00004378667,0.0003302078,0.000029662197,0.0000037614639],"category_scores_gemma":[0.000008514116,0.000030011552,0.00004049454,0.00032639547,0.00021587653,0.000038055543,0.00011308696,0.00007029999,0.0000020448097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011837554,0.000023601653,0.00022634216,0.000009975222,0.00001197256,4.4125677e-8,0.00011002425,0.000009728142,0.000038546783,0.9615336,0.00016644488,0.037868526],"study_design_scores_gemma":[0.00020968716,0.00005136057,0.015240809,0.000027420385,0.000012692691,0.0000024687922,0.00016815457,0.02184517,0.0031907996,0.8134599,0.14566605,0.00012551123],"about_ca_topic_score_codex":0.000022330141,"about_ca_topic_score_gemma":0.000028250459,"teacher_disagreement_score":0.99448025,"about_ca_system_score_codex":0.0000012785873,"about_ca_system_score_gemma":0.000018662231,"threshold_uncertainty_score":0.22808163},"labels":[],"label_agreement":null},{"id":"W4406239094","doi":"10.1007/978-3-030-71522-9_254","title":"Pairings","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.008312149353782135,"score_gpt":0.19908359670135872,"score_spread":0.1907714473475766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406239094","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.6671831e-7,0.0005181707,0.14747909,0.00070686406,0.00026846697,0.0000635108,8.7345194e-7,0.00022056822,0.8507423],"genre_scores_gemma":[0.00007987058,0.00012302787,0.01886257,0.0007190141,0.000039064875,0.0000019527563,0.0000012106461,0.0000057499174,0.98016757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928445,0.0000029396656,0.00012800678,0.00031400306,0.0001500687,0.00012050743],"domain_scores_gemma":[0.99926907,0.00005700379,0.000039191746,0.0005473179,0.00004457742,0.00004281499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005329746,0.00014845705,0.00014892234,0.00021316661,0.00004943192,0.000077425895,0.00070549484,0.00014884258,0.00019092954],"category_scores_gemma":[0.000004187602,0.00012181322,0.00016901598,0.000046275392,0.000034579676,0.0000733838,0.0003189523,0.00017854078,0.00016077924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.2780708e-7,0.0000028233026,0.0000013643336,0.000014740507,0.000020504012,0.00001344138,0.000011030456,2.8331928e-7,8.8056726e-7,0.90247375,0.032084506,0.06537647],"study_design_scores_gemma":[0.00005251339,0.000014936332,0.000017859273,0.00008022849,0.0000086081445,0.0000040082264,2.3929738e-7,0.000248919,0.00003039836,0.22677837,0.772605,0.0001589157],"about_ca_topic_score_codex":0.000008926088,"about_ca_topic_score_gemma":0.000007738855,"teacher_disagreement_score":0.7405205,"about_ca_system_score_codex":0.000009358539,"about_ca_system_score_gemma":0.000060402996,"threshold_uncertainty_score":0.49673986},"labels":[],"label_agreement":null},{"id":"W4406239104","doi":"10.1007/978-3-030-71522-9_256","title":"Pairing-Friendly Elliptic Curves","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pairing; Elliptic curve; Mathematics; Chemistry; Physics; Pure mathematics; Condensed matter physics","score_opus":0.008844519215337307,"score_gpt":0.21133178634025457,"score_spread":0.20248726712491727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406239104","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.386654e-7,0.0076534944,0.15866598,0.0011921943,0.0005103292,0.00016502151,0.0000033489148,0.0003239258,0.8314854],"genre_scores_gemma":[0.00013604389,0.0028723031,0.018215856,0.0013258603,0.00007809826,0.0000073141923,0.000006228678,0.0000151146105,0.9773432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99860317,0.000012979136,0.00026962534,0.00055649056,0.00031235462,0.00024538825],"domain_scores_gemma":[0.998649,0.00013103463,0.0000878773,0.0009630213,0.00008026972,0.00008879695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013937852,0.00028849908,0.00030286887,0.0003108367,0.00009969217,0.00010395445,0.0011674612,0.00019696746,0.00033542127],"category_scores_gemma":[0.000012593831,0.00024012779,0.0002925694,0.00011364588,0.00008772829,0.0001278981,0.0004422776,0.00032351224,0.00027755302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.7776134e-7,0.000008978161,0.0000038290286,0.00017111108,0.00005017187,0.000029240906,0.000011917372,0.0000011436455,0.0000012013974,0.9170064,0.06274271,0.01997273],"study_design_scores_gemma":[0.00012221446,0.00008118611,0.000042007046,0.0012765459,0.000053376076,0.000016361859,0.0000013769288,0.00050040684,0.000056221106,0.12341861,0.87393296,0.00049873634],"about_ca_topic_score_codex":0.000010957054,"about_ca_topic_score_gemma":0.0000140867305,"teacher_disagreement_score":0.81119025,"about_ca_system_score_codex":0.000017344846,"about_ca_system_score_gemma":0.0001156128,"threshold_uncertainty_score":0.9792127},"labels":[],"label_agreement":null},{"id":"W4406257736","doi":"10.1007/978-3-030-71522-9_246","title":"Elliptic Curve Discrete Logarithm Problem","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Logarithm; Discrete logarithm; Mathematics; Elliptic curve; Natural logarithm; Applied mathematics; Mathematical analysis; Computer science; Computer security","score_opus":0.00891214176902911,"score_gpt":0.21710975236275737,"score_spread":0.20819761059372827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406257736","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.785133e-7,0.0009299759,0.3012884,0.0007658267,0.0003388026,0.00025893896,0.0000079078245,0.0002552011,0.6961548],"genre_scores_gemma":[0.00015769636,0.00042286387,0.082640246,0.0004159796,0.00009553702,0.000013408454,0.000014365276,0.000021317683,0.9162186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99813735,0.000020368609,0.00036405423,0.000767368,0.0003680389,0.00034279103],"domain_scores_gemma":[0.99846834,0.00012988407,0.00013022327,0.0010493466,0.00010248943,0.00011969008],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016627675,0.00039695235,0.0003919677,0.00041536227,0.0001415427,0.00023553784,0.0013339849,0.0003410311,0.0002557569],"category_scores_gemma":[0.0000062102768,0.00031545173,0.00035470142,0.00014201608,0.00013324822,0.00017939806,0.0006507681,0.0004897937,0.00030070846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013704862,0.000010674979,0.0000061847772,0.00006716176,0.00008371749,0.000041575615,0.000037026883,0.0000052014884,0.0000015694719,0.9648529,0.009439254,0.02545332],"study_design_scores_gemma":[0.00019554267,0.00008788993,0.000027230235,0.00031909265,0.000056590165,0.00002171888,0.0000020106613,0.001807676,0.000039722825,0.47819003,0.51868033,0.00057217636],"about_ca_topic_score_codex":0.00002808551,"about_ca_topic_score_gemma":0.000037031667,"teacher_disagreement_score":0.50924104,"about_ca_system_score_codex":0.000031868196,"about_ca_system_score_gemma":0.00015485926,"threshold_uncertainty_score":0.9999298},"labels":[],"label_agreement":null},{"id":"W4406257786","doi":"10.1007/978-3-030-71522-9_245","title":"Elliptic Curve Cryptography","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Elliptic curve cryptography; Cryptography; Computer science; Elliptic curve; Computer security; Mathematics; Public-key cryptography; Pure mathematics; Encryption","score_opus":0.009182976802586708,"score_gpt":0.21107618992483995,"score_spread":0.20189321312225325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406257786","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.298171e-7,0.0019923144,0.28471076,0.0003781513,0.0005917201,0.00016782011,0.0000046729656,0.0003161286,0.7118379],"genre_scores_gemma":[0.00030090494,0.0012999692,0.079365216,0.0011053863,0.00016063459,0.000014030587,0.000013033886,0.000031227668,0.9177096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982414,0.000017160395,0.00033988134,0.0007145087,0.00036999807,0.00031700302],"domain_scores_gemma":[0.99827635,0.00015655589,0.00011804166,0.0012110486,0.000114430986,0.00012359217],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013796515,0.0003958144,0.00038064126,0.00087301416,0.00013782094,0.00020472567,0.0014372745,0.0003552393,0.0003891173],"category_scores_gemma":[0.000007162527,0.00033708755,0.00057738216,0.00025253047,0.00013597222,0.0001493763,0.0004371956,0.00044422946,0.00031677514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012424017,0.000013671722,0.00001347853,0.000039414765,0.00010459768,0.000027035228,0.000023351467,0.0000014697805,0.0000023872103,0.95551246,0.018941127,0.025319789],"study_design_scores_gemma":[0.00013111105,0.000049837603,0.000051821422,0.00015395194,0.00004195584,0.000008585066,0.0000013294409,0.00031551637,0.000038978425,0.4558144,0.54296416,0.00042837535],"about_ca_topic_score_codex":0.000012425143,"about_ca_topic_score_gemma":0.00001366289,"teacher_disagreement_score":0.524023,"about_ca_system_score_codex":0.000016529419,"about_ca_system_score_gemma":0.000112632784,"threshold_uncertainty_score":0.9999081},"labels":[],"label_agreement":null},{"id":"W4406257827","doi":"10.1007/978-3-030-71522-9_1571","title":"Elliptic Curve Isogenies","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics","score_opus":0.010258756086696404,"score_gpt":0.21046962046708548,"score_spread":0.20021086438038907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406257827","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000011304045,0.0032203966,0.14830886,0.00046573547,0.0005243304,0.00011816657,0.0000037230152,0.00022349616,0.8471342],"genre_scores_gemma":[0.0003146878,0.0007132991,0.01947532,0.00042261762,0.00007864434,0.0000043327054,0.0000042216852,0.000011235551,0.97897565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988943,0.000009496476,0.00021625987,0.0004535401,0.00022982225,0.00019660036],"domain_scores_gemma":[0.9989122,0.00010963674,0.000067560424,0.0007794874,0.0000682181,0.00006291174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000083125444,0.00024680057,0.00025082502,0.0003325236,0.000092995746,0.00013631661,0.00096878194,0.00021806482,0.0002869244],"category_scores_gemma":[0.0000061926166,0.0002030278,0.0002728283,0.00008692688,0.000082330625,0.00010003009,0.00037899707,0.000250647,0.0003567915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.5806216e-7,0.0000058610935,0.000004116217,0.00002720375,0.000059572478,0.00001937183,0.000031079395,0.0000015241227,0.0000023959954,0.9647211,0.012691968,0.022435194],"study_design_scores_gemma":[0.0000918629,0.000041274812,0.000025029076,0.000116370655,0.000033150154,0.000011140117,0.0000018094399,0.00054843514,0.00012479551,0.32654658,0.6721058,0.00035377484],"about_ca_topic_score_codex":0.0000110433675,"about_ca_topic_score_gemma":0.000017123093,"teacher_disagreement_score":0.6594138,"about_ca_system_score_codex":0.000015106213,"about_ca_system_score_gemma":0.000093024,"threshold_uncertainty_score":0.82792336},"labels":[],"label_agreement":null},{"id":"W4406257923","doi":"10.1007/978-3-030-71522-9_251","title":"Elliptic Curve Signature Schemes","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Signature (topology); Elliptic curve; Elliptic Curve Digital Signature Algorithm; Computer science; Mathematics; Computer security; Elliptic curve cryptography; Pure mathematics; Geometry; Public-key cryptography","score_opus":0.008313562322616243,"score_gpt":0.21313434016703386,"score_spread":0.20482077784441763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406257923","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.5782285e-7,0.0051264972,0.1409095,0.00069243496,0.0005494666,0.00015576309,0.000004526617,0.0002818862,0.8522793],"genre_scores_gemma":[0.00045195088,0.00048428916,0.03128246,0.00073196896,0.000113428265,0.0000045899046,0.000008584659,0.000015319534,0.9669074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987006,0.000010701653,0.00021570748,0.0005556755,0.0002933286,0.00022397532],"domain_scores_gemma":[0.99877596,0.000121614044,0.0000807061,0.0008489871,0.0000947971,0.00007796277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090189424,0.00029939218,0.00028284686,0.00034230418,0.000096453165,0.0001474859,0.0011899776,0.00043263892,0.00033174542],"category_scores_gemma":[0.000009689271,0.0002394945,0.00023226178,0.00012090534,0.0000767457,0.000120862285,0.00041874053,0.0005554734,0.0002004237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.0238296e-7,0.00000869971,0.0000023261462,0.00003879426,0.00006567017,0.00002762621,0.000016457696,0.0000013391963,0.0000110663095,0.95579535,0.02437191,0.019659868],"study_design_scores_gemma":[0.00009974741,0.000040937008,0.000012085362,0.00017973663,0.000029148376,0.0000067097326,0.0000010248822,0.00054438313,0.00017562495,0.23595738,0.7625998,0.00035336314],"about_ca_topic_score_codex":0.0000041055678,"about_ca_topic_score_gemma":0.00000673982,"teacher_disagreement_score":0.73822796,"about_ca_system_score_codex":0.00001725434,"about_ca_system_score_gemma":0.000118726224,"threshold_uncertainty_score":0.9766303},"labels":[],"label_agreement":null},{"id":"W4406258940","doi":"10.1007/978-3-030-71522-9_249","title":"Elliptic Curve Point Multiplication Using Halving","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiplication (music); Arithmetic; Mathematics; Elliptic curve; Point (geometry); Combinatorics; Pure mathematics; Geometry","score_opus":0.02078244444415314,"score_gpt":0.24479269971555148,"score_spread":0.22401025527139834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406258940","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000844426,0.0006255835,0.5941446,0.00018572481,0.0002749251,0.00017660196,0.0000016634068,0.00015822292,0.40442425],"genre_scores_gemma":[0.0068854075,0.0003932088,0.36825532,0.00069662224,0.00025342545,0.000011650771,0.000015807973,0.000043907585,0.6234447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871975,0.000015465517,0.00029068193,0.0005423849,0.00022843096,0.00020330369],"domain_scores_gemma":[0.99869496,0.00015874948,0.00013925247,0.0008308383,0.000111238274,0.000064969405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000161011,0.00024154529,0.00023180056,0.0003857436,0.00014938008,0.00016216766,0.00068387087,0.00021094014,0.00007245839],"category_scores_gemma":[0.000018736553,0.00021808188,0.00021778441,0.000113117414,0.000054582455,0.00018588721,0.00036019587,0.00025478084,0.00006808819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.210994e-7,0.0000100974885,0.0000103535995,0.000039915027,0.00003989546,0.000007675944,0.00006411352,0.000053070486,0.000095568146,0.97504056,0.0003962501,0.024241693],"study_design_scores_gemma":[0.0005955297,0.000083008366,0.00025587255,0.0014669368,0.00019017447,0.0000783818,0.000018387385,0.42176473,0.0011842365,0.43261042,0.14002594,0.0017263456],"about_ca_topic_score_codex":0.000045591674,"about_ca_topic_score_gemma":0.000013704881,"teacher_disagreement_score":0.5424301,"about_ca_system_score_codex":0.00006077906,"about_ca_system_score_gemma":0.00010049216,"threshold_uncertainty_score":0.8893121},"labels":[],"label_agreement":null},{"id":"W4406275999","doi":"10.1007/978-3-030-71522-9_872","title":"Koblitz Elliptic Curves","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Elliptic curve; Mathematical analysis","score_opus":0.009712002559898233,"score_gpt":0.21137206298571654,"score_spread":0.2016600604258183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406275999","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.3124654e-7,0.015100064,0.102820516,0.0015436001,0.00045865544,0.00015088817,0.000002947863,0.00024057367,0.8796826],"genre_scores_gemma":[0.000046606267,0.006283435,0.012409044,0.0019106909,0.00006257893,0.0000049265586,0.0000043358737,0.000010220895,0.97926813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883115,0.000010485673,0.0002302709,0.00046480342,0.0002681969,0.00019508183],"domain_scores_gemma":[0.99880046,0.00011622626,0.000069762784,0.0008674751,0.00007288997,0.00007319081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011111135,0.00023895106,0.00026516602,0.00030896766,0.000074669784,0.00009665412,0.0010586781,0.00018258904,0.00039948153],"category_scores_gemma":[0.0000088449515,0.00019480582,0.00025306453,0.00010797081,0.00007154492,0.000110566296,0.00034909038,0.00027248138,0.00029861057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.826277e-7,0.0000066713983,0.0000019230204,0.00013888913,0.000041513053,0.000017354778,0.000009050047,4.5689984e-7,9.739176e-7,0.924209,0.04950124,0.026072532],"study_design_scores_gemma":[0.000090031055,0.000037583843,0.000030629566,0.0012731036,0.000041550316,0.0000112767975,6.5967004e-7,0.00034797256,0.000035312463,0.25479743,0.7429626,0.0003718659],"about_ca_topic_score_codex":0.00000976102,"about_ca_topic_score_gemma":0.000009494908,"teacher_disagreement_score":0.69346136,"about_ca_system_score_codex":0.000013525437,"about_ca_system_score_gemma":0.000106799765,"threshold_uncertainty_score":0.794395},"labels":[],"label_agreement":null},{"id":"W4407104483","doi":"10.28924/2291-8639-23-2025-32","title":"Arithmetic Relation Between Family of Elliptic Curves Over Finite Field","year":2025,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Relation (database); Field (mathematics); Arithmetic; Elliptic curve; Pure mathematics; Finite field; Algebra over a field; Discrete mathematics; Database; Computer science","score_opus":0.007530615720172293,"score_gpt":0.282067604939381,"score_spread":0.2745369892192087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407104483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02937423,0.0017943511,0.9655711,0.002386154,0.00005605006,0.000052704727,0.000005839895,0.00000582176,0.00075373135],"genre_scores_gemma":[0.9900842,0.0014629986,0.008062594,0.00027209555,0.000054998065,0.000004401937,0.0000046653904,0.0000014547394,0.000052646767],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9990798,0.000030484147,0.00044693914,0.000114439696,0.00027140498,0.000056902118],"domain_scores_gemma":[0.9986875,0.00042414857,0.00031792955,0.00016555341,0.00036967907,0.000035200523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025500124,0.000060157567,0.00019124859,0.0007746651,0.00004481159,0.00005368342,0.0004938736,0.00003585182,0.000009166745],"category_scores_gemma":[0.000046009907,0.000050590763,0.0002109535,0.0011273824,0.000038997798,0.00017376782,0.00007264648,0.00010669421,7.753033e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002228929,0.00039766778,0.43275604,0.00009525605,0.007642716,0.0000071852037,0.00028927697,0.0029737304,0.002248717,0.34037817,0.0011625875,0.21202636],"study_design_scores_gemma":[0.00041269668,0.00006867313,0.94242793,0.0002120511,0.0012005405,0.0000043475147,0.000040212177,0.010436613,0.001669859,0.037213065,0.0061877808,0.00012622264],"about_ca_topic_score_codex":0.000029436886,"about_ca_topic_score_gemma":0.0000047381545,"teacher_disagreement_score":0.9607099,"about_ca_system_score_codex":0.00001073896,"about_ca_system_score_gemma":0.000039936334,"threshold_uncertainty_score":0.20630313},"labels":[],"label_agreement":null},{"id":"W4409253648","doi":"10.62056/abe0iv7sf","title":"Efficient Methods for Simultaneous Homomorphic Inversion","year":2025,"lang":"en","type":"article","venue":"IACR Communications in Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; National Research Council Canada","funders":"University of Waterloo","keywords":"Homomorphic encryption; Inversion (geology); Computer science; Homomorphic filtering; Geology; Artificial intelligence; Seismology; Computer security; Image enhancement; Image (mathematics)","score_opus":0.0316288580653663,"score_gpt":0.38741949511744356,"score_spread":0.35579063705207725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409253648","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042522885,0.0028507484,0.9804209,0.009973556,0.00036935427,0.0004169962,0.000001844963,0.00016619136,0.0015481595],"genre_scores_gemma":[0.3859789,0.0001359068,0.61336464,0.00039368414,0.0000037561917,0.00010490903,0.0000026393539,0.0000048269426,0.000010750777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984763,0.00054620695,0.00033339614,0.00030979622,0.000057705878,0.00027659195],"domain_scores_gemma":[0.9931148,0.004387096,0.00007825386,0.002251612,0.00012943851,0.000038765775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070649316,0.00011937961,0.00022671369,0.000570126,0.0003337994,0.00004277441,0.0026237413,0.00014284732,0.0000034935551],"category_scores_gemma":[0.0005291698,0.00011896294,0.00010360473,0.0013374957,0.0003190412,0.000040842708,0.0009844842,0.00026170976,0.000011771087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007820987,0.00025852452,0.0004671378,0.000018481704,0.000020985713,0.0000020011078,0.00042914695,0.003936903,0.0005012376,0.87720966,0.0001543078,0.11699381],"study_design_scores_gemma":[0.0006393802,0.000049491206,0.0003773504,0.000035678768,0.000013883931,0.000009158412,0.00010260946,0.81169134,0.00042273555,0.14623375,0.040286493,0.00013813813],"about_ca_topic_score_codex":0.00004569955,"about_ca_topic_score_gemma":0.00010469777,"teacher_disagreement_score":0.80775446,"about_ca_system_score_codex":0.000058254693,"about_ca_system_score_gemma":0.00010476273,"threshold_uncertainty_score":0.48756075},"labels":[],"label_agreement":null},{"id":"W4409603167","doi":"10.61091/jcmcc127b-085","title":"Research on Elliptic Curve Cryptography Hardware Encryption System Based on FPGA","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Anhui University","keywords":"Encryption; Elliptic curve cryptography; Field-programmable gate array; Computer science; Cryptography; Elliptic Curve Digital Signature Algorithm; Embedded system; Computer hardware; Public-key cryptography; Computer security","score_opus":0.02214267863809532,"score_gpt":0.2962784756390282,"score_spread":0.2741357970009329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409603167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40612474,0.0009328414,0.51584053,0.0014861289,0.055605553,0.0014048063,0.000004784797,0.00036420592,0.01823641],"genre_scores_gemma":[0.98882776,0.000024010675,0.010355234,0.00006534445,0.00069374667,0.000005890697,7.5131675e-7,0.00002302983,0.0000042168003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99554205,0.0006037276,0.0011850626,0.0004661872,0.0016255311,0.0005774602],"domain_scores_gemma":[0.99437255,0.0028047871,0.00070496707,0.0007107154,0.0011657861,0.00024120713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004748134,0.00037189806,0.0007885097,0.001834358,0.00080758677,0.0007270474,0.001321043,0.00026376502,0.0000022748127],"category_scores_gemma":[0.0003917572,0.00031204466,0.00038557098,0.0022851732,0.0001706004,0.00024090271,0.00030761206,0.0012316025,0.0000074923023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012180474,0.0008245008,0.00010927964,0.0003987997,0.00008947212,0.00004752577,0.00029222702,0.00059319765,0.00009440285,0.99455214,0.0004633403,0.0024133234],"study_design_scores_gemma":[0.0073601124,0.0037988503,0.00080453197,0.005072399,0.00010649891,0.000047021196,0.0008315529,0.1256719,0.0025303788,0.8517336,0.0014598652,0.0005832681],"about_ca_topic_score_codex":0.0000074654354,"about_ca_topic_score_gemma":1.7170468e-7,"teacher_disagreement_score":0.58270305,"about_ca_system_score_codex":0.00018832722,"about_ca_system_score_gemma":0.00029822098,"threshold_uncertainty_score":0.9999332},"labels":[],"label_agreement":null},{"id":"W4410082887","doi":"10.69763/polyjmath.2.3","title":"A finiteness theorem for 2-towers of number fields","year":2025,"lang":"en","type":"article","venue":"Polynesian Journal of Mathematics","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Agencia Nacional de Investigación y Desarrollo; Mount Royal University","keywords":"Mathematics","score_opus":0.010939636558879019,"score_gpt":0.2696730433186094,"score_spread":0.2587334067597304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410082887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021670634,0.00023352954,0.9742758,0.0013170064,0.0003570586,0.000094850366,0.0000015974617,0.000009642342,0.0020398495],"genre_scores_gemma":[0.7402379,0.000032780168,0.2594489,0.00011080613,0.000033199252,0.00000241799,1.0513447e-7,0.000005048285,0.0001288923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990839,0.000029653127,0.00049212005,0.00007666422,0.00017600505,0.00014168055],"domain_scores_gemma":[0.99859595,0.00053035206,0.0003522452,0.00027041696,0.0002025456,0.000048471768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053466216,0.00009069665,0.00027624652,0.00019054851,0.00004936395,0.000040102947,0.0006826279,0.00006159756,0.000011263967],"category_scores_gemma":[0.00015527788,0.000066664805,0.00025201088,0.000378296,0.00006218259,0.00012608923,0.000054414086,0.00009986261,0.0000012031331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002361758,0.00036777783,0.000999027,0.0005868453,0.00018861171,0.000015389072,0.0030547425,0.00006984705,0.0002789907,0.9627788,0.0014593148,0.030177],"study_design_scores_gemma":[0.0014408639,0.0002532929,0.0008585369,0.00085757644,0.0001516706,0.00022105736,0.0010958284,0.008563721,0.019100422,0.9657112,0.0015160441,0.00022982249],"about_ca_topic_score_codex":0.0000010918932,"about_ca_topic_score_gemma":6.3534645e-7,"teacher_disagreement_score":0.71856725,"about_ca_system_score_codex":0.0000076073775,"about_ca_system_score_gemma":0.00010349087,"threshold_uncertainty_score":0.27185118},"labels":[],"label_agreement":null},{"id":"W4411851623","doi":"10.1007/978-3-031-76568-1_3","title":"Representations of Integers","year":2025,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Ottawa; Mount Royal University","funders":"","keywords":"Mathematics; Computer science","score_opus":0.01898990015201574,"score_gpt":0.2633640156386843,"score_spread":0.24437411548666854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411851623","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016784834,0.0005244766,0.15026134,0.00016366247,0.00031106683,0.00035648877,0.000012277031,0.000082268365,0.8482716],"genre_scores_gemma":[0.0022417537,0.00047118822,0.2672168,0.00015396657,0.00006637397,0.000045036566,0.000013692683,0.00005742411,0.72973377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982406,0.000019781623,0.00076303375,0.00040641622,0.00035882284,0.00021137527],"domain_scores_gemma":[0.9976995,0.0004779281,0.00036244633,0.0012798264,0.0001238836,0.000056409735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002954404,0.0002832916,0.00054084876,0.0007160158,0.000053705793,0.00006185528,0.0011599777,0.0002626145,0.000048331513],"category_scores_gemma":[0.000091931026,0.0002671911,0.0002777775,0.00016247349,0.00022043187,0.00010429939,0.00041593978,0.0004269345,0.00002540584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012499872,0.00004781439,0.0000091207585,0.00037651157,0.00006001328,0.000023096363,0.0011137326,0.000029131295,0.00002404141,0.99173427,0.0026637355,0.003917311],"study_design_scores_gemma":[0.0002152372,0.000035162662,0.000016789982,0.0014614688,0.000050343697,0.000011735195,0.00007768547,0.0034332888,0.00040601584,0.9851917,0.00880259,0.00029796167],"about_ca_topic_score_codex":0.0000119146835,"about_ca_topic_score_gemma":0.000023420134,"teacher_disagreement_score":0.11853788,"about_ca_system_score_codex":0.000042818923,"about_ca_system_score_gemma":0.00015880933,"threshold_uncertainty_score":0.999978},"labels":[],"label_agreement":null},{"id":"W4411851873","doi":"10.1007/978-3-031-76568-1_20","title":"Some Diophantine Equations","year":2025,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Ottawa; Mount Royal University","funders":"","keywords":"Diophantine equation; Mathematics; Applied mathematics; Pure mathematics","score_opus":0.02110116865045251,"score_gpt":0.24601618685874616,"score_spread":0.22491501820829365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411851873","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000118829785,0.0032078805,0.2791596,0.00054301077,0.0008607671,0.0006522126,0.00002170032,0.0003026678,0.7152403],"genre_scores_gemma":[0.00075375277,0.00078872405,0.13323998,0.0004150424,0.00031136253,0.00006360548,0.00002043342,0.00007426617,0.86433285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977787,0.000021196296,0.0007828032,0.0005655606,0.0004736543,0.0003780433],"domain_scores_gemma":[0.99751747,0.00057394727,0.00031063356,0.0014040236,0.00010039013,0.000093523086],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039429188,0.00044745186,0.00063676,0.00081475,0.00014147087,0.00019497123,0.0014498878,0.0003764776,0.000046220244],"category_scores_gemma":[0.00010576943,0.00042039988,0.00030590332,0.00016517636,0.0001644795,0.00021878425,0.0005864704,0.0005911293,0.00015630086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.893117e-7,0.00006207076,0.0000015405723,0.00029579495,0.0000526879,0.00005192216,0.0004403229,0.000017283948,0.000018295459,0.9933411,0.001676536,0.0040415586],"study_design_scores_gemma":[0.00027385144,0.000033729342,0.0000059016425,0.0011514915,0.000052225652,0.000011366754,0.000010918524,0.010126137,0.00009413216,0.9652792,0.022506502,0.0004545289],"about_ca_topic_score_codex":0.0000045188144,"about_ca_topic_score_gemma":0.000015007636,"teacher_disagreement_score":0.14909256,"about_ca_system_score_codex":0.00006371691,"about_ca_system_score_gemma":0.00019411641,"threshold_uncertainty_score":0.99982476},"labels":[],"label_agreement":null},{"id":"W4411858899","doi":"10.1007/978-3-031-76568-1_4","title":"Integer Powers","year":2025,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Ottawa; Mount Royal University","funders":"","keywords":"Integer (computer science); Mathematics; Computer science; Programming language","score_opus":0.01372847745482864,"score_gpt":0.23377967103963074,"score_spread":0.2200511935848021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411858899","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007533275,0.0010085945,0.12779741,0.00027210513,0.000708396,0.00040819327,0.000012412216,0.00020501943,0.8695803],"genre_scores_gemma":[0.00048691328,0.0003924436,0.09656077,0.00053918455,0.000091353286,0.000035859775,0.000012383914,0.000059160244,0.9018219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775904,0.000021083226,0.0007328672,0.000621875,0.00046219627,0.00040293494],"domain_scores_gemma":[0.99765825,0.00037119075,0.00027647737,0.0014884765,0.00009994428,0.0001056727],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040614177,0.00050385407,0.00067450583,0.00080331624,0.000089437424,0.00019386887,0.0016905165,0.00047611046,0.00011271902],"category_scores_gemma":[0.00006415813,0.00045722685,0.00035449356,0.0001500451,0.00020543454,0.00013874678,0.00063824817,0.00081417797,0.00023095583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016590077,0.000046957,0.0000033409501,0.00030169112,0.00006352675,0.00009686766,0.00091118005,0.0000072370917,0.000006010806,0.98250324,0.008726184,0.0073321145],"study_design_scores_gemma":[0.0002640264,0.000046737354,0.000004275637,0.0015406488,0.00004472996,0.000029230541,0.00003929801,0.002303086,0.000067831614,0.87822765,0.11684863,0.00058384193],"about_ca_topic_score_codex":0.000004939532,"about_ca_topic_score_gemma":0.000017111137,"teacher_disagreement_score":0.108122446,"about_ca_system_score_codex":0.00009587009,"about_ca_system_score_gemma":0.00019123759,"threshold_uncertainty_score":0.9997879},"labels":[],"label_agreement":null},{"id":"W4412594313","doi":"10.3233/nicsp250005","title":"Supersingular Elliptic Curves, Quaternion Algebras and Applications to Cryptography","year":2025,"lang":"en","type":"book-chapter","venue":"NATO science for peace and security series. D, Information and communication security","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Quaternion; Supersingular elliptic curve; Elliptic curve; Mathematics; Pure mathematics; Cryptography; Algebra over a field; Geometry; Algorithm","score_opus":0.008687215608471417,"score_gpt":0.2510477400787441,"score_spread":0.24236052447027268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412594313","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018116303,0.19776806,0.39272365,0.06719064,0.0014397223,0.025079401,0.0017467192,0.002309497,0.293626],"genre_scores_gemma":[0.40869397,0.45618138,0.101818025,0.023298262,0.0002616544,0.0021276243,0.0019891611,0.00011461522,0.0055153277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99796283,0.000044814966,0.0006095516,0.0005242452,0.00052072597,0.00033783438],"domain_scores_gemma":[0.99742556,0.00015325464,0.00029191023,0.001137672,0.0006680529,0.0003235698],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012222349,0.0003555162,0.0003835907,0.00090867147,0.0014672095,0.0008797482,0.0011994035,0.00025240026,0.0000068090794],"category_scores_gemma":[0.00007551747,0.0003635182,0.00010807707,0.0006672771,0.00093174336,0.003042008,0.0009178064,0.0004345572,0.0000064339324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015513806,0.000021197646,0.00004778411,0.00052520516,0.000020415731,1.2430037e-7,0.0043055676,6.562005e-7,0.000008037764,0.97543126,0.0012055985,0.018418638],"study_design_scores_gemma":[0.0004369123,0.0001633549,0.0001806468,0.0005390007,0.000057655863,0.000031804255,0.0006043037,0.002560209,0.000098052275,0.24497895,0.7497515,0.00059759914],"about_ca_topic_score_codex":0.000069488524,"about_ca_topic_score_gemma":0.000109667584,"teacher_disagreement_score":0.7485459,"about_ca_system_score_codex":0.00004898085,"about_ca_system_score_gemma":0.00022987676,"threshold_uncertainty_score":0.9998817},"labels":[],"label_agreement":null},{"id":"W4414977408","doi":"10.3390/telecom6040075","title":"Securing Elliptic Curve Cryptography with Random Permutation of Secret Key","year":2025,"lang":"en","type":"article","venue":"Telecom","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Scalar multiplication; Elliptic curve cryptography; Elliptic curve; Scalar (mathematics); Elliptic Curve Digital Signature Algorithm; Cryptography; Elliptic curve point multiplication; Public-key cryptography","score_opus":0.0033560396701793776,"score_gpt":0.20860818944760973,"score_spread":0.20525214977743034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414977408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36029345,0.00063491205,0.63469636,0.00020363783,0.00018746861,0.00020443847,0.0000016613185,0.00012318257,0.003654893],"genre_scores_gemma":[0.96941483,0.000046066074,0.030368201,0.00009469066,0.000020937669,0.000014874832,0.000003251852,0.000006151409,0.000030991207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9990133,0.00007190455,0.00022631546,0.00027421716,0.00019774541,0.00021652401],"domain_scores_gemma":[0.9991431,0.00017431304,0.00009220954,0.00038518404,0.00015953142,0.00004565954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020299599,0.00012998788,0.00021278746,0.0004104368,0.000108280095,0.00006828808,0.0004417224,0.000049970182,0.000014909306],"category_scores_gemma":[0.000026460979,0.00010377701,0.00011365166,0.0013849139,0.00009330667,0.00020234763,0.00007097292,0.00013049213,0.0000046599785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046697713,0.00062651816,0.14105015,0.0006899502,0.000766352,0.000054208846,0.0074594487,0.0038958688,0.004835269,0.7846108,0.0016480468,0.053896394],"study_design_scores_gemma":[0.0237104,0.0017874956,0.4804343,0.0016442297,0.00046281522,0.00007296371,0.0008488089,0.11982413,0.12663308,0.2261709,0.0160728,0.0023380741],"about_ca_topic_score_codex":0.000042902964,"about_ca_topic_score_gemma":0.000026064208,"teacher_disagreement_score":0.6091214,"about_ca_system_score_codex":0.000009468255,"about_ca_system_score_gemma":0.000063361425,"threshold_uncertainty_score":0.4231904},"labels":[],"label_agreement":null},{"id":"W4415749767","doi":"10.1007/978-3-032-09645-6_1","title":"A Failure Probability Analysis of a Modular Algorithm to Compute the Monic GCD of Multivariate Polynomials over Algebraic Number Fields $${\\mathbb {Q}(\\alpha _1,\\ldots ,\\alpha _n)}$$","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Monic polynomial; Algebraic number; Finite field; Modulo; Modular design; Modular arithmetic; Interpolation (computer graphics); Field (mathematics)","score_opus":0.009529869293530412,"score_gpt":0.252465466909394,"score_spread":0.24293559761586356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415749767","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004646565,0.00039835236,0.99117076,0.0013182297,0.0008701147,0.0011429797,0.000056930126,0.00009517664,0.0003008942],"genre_scores_gemma":[0.45465362,0.000030660885,0.5439532,0.0010126593,0.00014859416,0.000032005944,0.000009424591,0.000027050322,0.00013280533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99404746,0.00021116239,0.0013783188,0.0020589172,0.0014617665,0.00084235956],"domain_scores_gemma":[0.9938549,0.0014889236,0.00074512174,0.003081061,0.00059957366,0.00023041415],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017944014,0.000788524,0.0016505123,0.0019315667,0.00029920822,0.00031463895,0.0052388916,0.00055918534,0.000043025088],"category_scores_gemma":[0.00017807436,0.0005892163,0.0009414549,0.00528868,0.001078489,0.00038956705,0.0026942606,0.00094463263,0.000006307996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044939385,0.00042914206,0.001012588,0.0003553461,0.0016946617,0.00007104363,0.00541138,0.23091531,0.00066230755,0.061282862,0.00013946625,0.69798094],"study_design_scores_gemma":[0.0005453456,0.0002245216,0.007987853,0.0005860608,0.00040462683,0.000017302309,8.9395695e-7,0.891903,0.0021487619,0.09485639,0.00050067686,0.00082460826],"about_ca_topic_score_codex":0.0005727484,"about_ca_topic_score_gemma":0.00061846885,"teacher_disagreement_score":0.69715637,"about_ca_system_score_codex":0.00017367973,"about_ca_system_score_gemma":0.000718338,"threshold_uncertainty_score":0.9996559},"labels":[],"label_agreement":null},{"id":"W4416085040","doi":"10.48550/arxiv.2503.03478","title":"Gross lattices of supersingular elliptic curves","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery; National Science Foundation","keywords":"Endomorphism ring; Supersingular elliptic curve; Endomorphism; Lattice (music); Elliptic curve point multiplication; Hessian form of an elliptic curve; Elliptic curve; Invariant (physics)","score_opus":0.03399029107128915,"score_gpt":0.2765367254356936,"score_spread":0.24254643436440443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416085040","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93931526,0.022712825,0.031053403,0.0019004705,0.0019098332,0.00039339074,0.000024247016,0.00022575352,0.0024648272],"genre_scores_gemma":[0.98775125,0.002525392,0.0087207,0.00042168147,0.00009824492,0.00002063286,0.000013006292,0.000011258791,0.00043785575],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99814177,0.000121825564,0.0004162025,0.0006725927,0.00032550897,0.0003220838],"domain_scores_gemma":[0.9980237,0.00018973193,0.00019980963,0.0013400409,0.00016386213,0.00008287991],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034576555,0.00027299987,0.00045760462,0.00027814953,0.00010925844,0.00007297271,0.0018451439,0.00022472456,0.000020043917],"category_scores_gemma":[0.00007260937,0.00025177462,0.00034143263,0.0005714303,0.00020028393,0.00016759711,0.0015208169,0.000493771,0.00002254436],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001873622,0.00067028,0.9389776,0.009421828,0.0007926465,0.000113646645,0.0036416163,0.00090491294,0.0015498413,0.033934295,0.002381734,0.0075928764],"study_design_scores_gemma":[0.0010878048,0.00028312602,0.9054344,0.012412593,0.0006304249,0.000027271779,0.00021336299,0.008615899,0.03165773,0.028438887,0.009126243,0.002072251],"about_ca_topic_score_codex":0.0001738656,"about_ca_topic_score_gemma":0.000015712618,"teacher_disagreement_score":0.04843598,"about_ca_system_score_codex":0.00001987312,"about_ca_system_score_gemma":0.00018698507,"threshold_uncertainty_score":0.99999344},"labels":[],"label_agreement":null},{"id":"W4416214575","doi":"10.1109/tcsii.2025.3633181","title":"A Lightweight and Hardware-Efficient NTT FPGA Accelerator for FHE Applications","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits & Systems II Express Briefs","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Queen's University; Queen's University Belfast","keywords":"Field-programmable gate array; Digital signal processing; Reduction (mathematics); Multiplication (music); Scalability; Residue number system; Homomorphic encryption; Modular design; Lookup table","score_opus":0.013368517250198204,"score_gpt":0.242132737507961,"score_spread":0.2287642202577628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416214575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028053075,0.0012984021,0.99066865,0.00046228935,0.0013991012,0.001998087,0.000117537485,0.0003723086,0.0008783183],"genre_scores_gemma":[0.99410444,0.00006512171,0.0014082787,0.00023160742,0.000096683994,0.0028094568,0.0000027285478,0.000023220418,0.0012584361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977983,0.00009584921,0.0004960149,0.00084938307,0.00031454134,0.00044591163],"domain_scores_gemma":[0.998214,0.00031481785,0.000112776754,0.0009607769,0.00021622164,0.00018137773],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025963574,0.0003003409,0.00037486514,0.00049372495,0.001261381,0.0003277088,0.0007760532,0.0001778845,0.0000053097096],"category_scores_gemma":[0.0000047912945,0.00028118351,0.00021214095,0.0009631476,0.00011411373,0.00025623635,0.000012206816,0.00023779867,0.00001088263],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012398792,0.0055128993,0.0001279988,0.0034171427,0.0017308809,0.000035330144,0.011942656,0.06554289,0.075272195,0.43323633,0.012959504,0.39009818],"study_design_scores_gemma":[0.0060659647,0.00070633966,0.0008444736,0.001612852,0.00047644228,0.00016504909,0.0006270131,0.084487416,0.17337732,0.0024583563,0.7268347,0.0023440404],"about_ca_topic_score_codex":0.000072454146,"about_ca_topic_score_gemma":0.000010989911,"teacher_disagreement_score":0.99129915,"about_ca_system_score_codex":0.000063243795,"about_ca_system_score_gemma":0.00015405143,"threshold_uncertainty_score":0.99996406},"labels":[],"label_agreement":null},{"id":"W4417090287","doi":"10.1007/978-981-95-5122-4_15","title":"Pseudorandom Correlation Generators for Multiparty Beaver Triples over $$\\mathbb {F}_2$$","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Brown University; National Science Foundation","keywords":"Pseudorandom number generator; Overhead (engineering); Multiplicative function; Cryptography; Random seed; Generator (circuit theory); Random number generation; Protocol (science)","score_opus":0.011224961592334541,"score_gpt":0.2398397259208412,"score_spread":0.22861476432850666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417090287","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018002339,0.0011696973,0.99256605,0.0003844982,0.0036567207,0.0009533026,0.000022673456,0.00017498138,0.000892082],"genre_scores_gemma":[0.068352886,0.00017515104,0.9278132,0.0018780999,0.00078670145,0.00007207203,0.000029376053,0.000048628062,0.00084392726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963546,0.000043749533,0.00062979123,0.0015653174,0.00075361115,0.00065293966],"domain_scores_gemma":[0.99691737,0.0011388181,0.0003032241,0.0011919725,0.00029203197,0.00015661228],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082757574,0.0005677422,0.0006264782,0.0012576137,0.0004766923,0.0005707925,0.0022120108,0.00045859336,0.000012405573],"category_scores_gemma":[0.00015214518,0.00048764795,0.0003609026,0.0009117151,0.0005405035,0.00053632905,0.00069440383,0.0005852862,0.000010659463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058586476,0.000086800144,0.00042739627,0.00018353062,0.00006439758,0.000038997914,0.0009189155,0.053500913,0.00014367925,0.10467395,0.0007364083,0.8391664],"study_design_scores_gemma":[0.0014798058,0.00013999848,0.00030253592,0.0003670215,0.000032401458,0.000016898013,1.5702595e-7,0.8234211,0.0012984201,0.16640295,0.0058164764,0.0007221902],"about_ca_topic_score_codex":0.000021960312,"about_ca_topic_score_gemma":0.00005885813,"teacher_disagreement_score":0.83844423,"about_ca_system_score_codex":0.00016307538,"about_ca_system_score_gemma":0.00055681926,"threshold_uncertainty_score":0.9997575},"labels":[],"label_agreement":null},{"id":"W4417361046","doi":"10.1097/brs.0000000000005602","title":"Saving Fusion Levels in Lenke 1/2 AR Curves","year":2025,"lang":"en","type":"article","venue":"Spine","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"BC Children's Hospital","funders":"","keywords":"Radiography; Vertebra; Retrospective cohort study; Lumbar; Multivariate analysis; Spinal fusion; Scoliosis; Idiopathic scoliosis","score_opus":0.012863200096247513,"score_gpt":0.26649200546168594,"score_spread":0.2536288053654384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417361046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34712124,0.016829928,0.591802,0.019841788,0.0015802305,0.00046703493,0.0000027437425,0.00035492753,0.022000145],"genre_scores_gemma":[0.9850293,0.00027491865,0.013131545,0.0010131787,0.000021905413,0.000006113795,7.9516616e-7,0.0000025668285,0.0005197215],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99938536,0.000027835486,0.00013285146,0.00019965178,0.00009851729,0.00015578982],"domain_scores_gemma":[0.9996338,0.000021483605,0.00002151174,0.00027974823,0.000020319285,0.0000231536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001854154,0.000065921035,0.000096640804,0.00020707218,0.000053676464,0.000032323587,0.0003669171,0.00003062983,0.00001523144],"category_scores_gemma":[0.000036344005,0.000056986755,0.000040295152,0.0008843352,0.000024658373,0.00013483474,0.00019197186,0.0000969177,0.000010436193],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061068745,0.00036923724,0.035943557,0.00062448863,0.000039012742,0.00012157311,0.000785412,0.00020691009,0.034288395,0.3874868,0.0064978884,0.5336306],"study_design_scores_gemma":[0.0004422526,0.000043799228,0.9696406,0.0009254213,0.0000043779637,0.0000038395915,0.000015050627,0.0034305898,0.003998049,0.014420478,0.0069156126,0.00015989876],"about_ca_topic_score_codex":0.00005355012,"about_ca_topic_score_gemma":0.00008340731,"teacher_disagreement_score":0.93369704,"about_ca_system_score_codex":0.000011446345,"about_ca_system_score_gemma":0.000036533453,"threshold_uncertainty_score":0.23238525},"labels":[],"label_agreement":null},{"id":"W6928855802","doi":"10.3897/zookeys.593.8412.figures1-7","title":"Figures 1-7 from: Klimaszewski J, Langor DW, Bourdon C, Gilbert A, Labrecque M (2016) Two new species and new provincial records of aleocharine rove beetles from Newfoundland and Labrador, Canada (Coleoptera, Staphylinidae, Aleocharinae). ZooKeys 593: 49-89. https://doi.org/10.3897/zookeys.593.8412","year":2016,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nucleofection; Gestational period; TSG101; Liquation; Dysgeusia; Diafiltration; Hyporeflexia; Demotion; Hemopericardium","score_opus":0.017743773712142842,"score_gpt":0.22101770568720097,"score_spread":0.20327393197505814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6928855802","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019275868,0.00404613,0.006792103,0.0019216649,0.0008070796,0.0013786124,0.00093969476,0.00076131965,0.96407753],"genre_scores_gemma":[0.012405447,0.0027411724,0.0037901134,0.00024572504,0.0020819928,4.4367303e-7,0.001015764,0.00168678,0.97603256],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966119,0.0003299902,0.00056126824,0.0010951465,0.00075158477,0.0006501368],"domain_scores_gemma":[0.99744177,0.00016383568,0.0005046686,0.0010047628,0.00027202818,0.0006129104],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00029622854,0.0005566266,0.0006644571,0.0005097318,0.0006282645,0.00082376844,0.0017591501,0.00025231592,0.07545697],"category_scores_gemma":[0.00025363374,0.0004972303,0.00011148252,0.00044608058,0.00033896885,0.00036758557,0.0019181427,0.0005206989,0.0030405603],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013668346,0.00011499479,0.001186752,0.00015531146,0.00031749345,0.000070639886,0.00094811234,0.0000015266719,0.0010252376,0.0026400818,0.91195023,0.08145291],"study_design_scores_gemma":[0.0016452908,0.00029954468,0.016808238,0.0004193236,0.00006453877,0.000005475739,0.00007199162,0.00006196857,0.00038051995,0.0007875438,0.9788448,0.00061074906],"about_ca_topic_score_codex":0.67924124,"about_ca_topic_score_gemma":0.09941768,"teacher_disagreement_score":0.57982355,"about_ca_system_score_codex":0.00016291646,"about_ca_system_score_gemma":0.00018999315,"threshold_uncertainty_score":0.99974793},"labels":[],"label_agreement":null},{"id":"W6930984981","doi":"10.5281/zenodo.16739533","title":"Metaphotina undefined-1","year":2025,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Vertex (graph theory); Biome; Regular polygon; Projection (relational algebra); Clearance","score_opus":0.019759629654870887,"score_gpt":0.2352926056021087,"score_spread":0.21553297594723783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930984981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052864924,0.00040961668,0.5411891,0.004696661,0.00032428198,0.00035571933,0.000022692428,0.0019900186,0.44572544],"genre_scores_gemma":[0.9882532,0.00012959745,0.00810576,0.00078573613,0.000060290236,4.3353918e-8,0.00014678933,0.00045293997,0.0020656604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99874806,0.00019894193,0.00016960115,0.00037565865,0.0002266886,0.0002810466],"domain_scores_gemma":[0.9989634,0.00003171951,0.00004621909,0.00060492347,0.00026378722,0.000089943926],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004705615,0.00010125197,0.00010793866,0.00038714564,0.0016842769,0.0009409662,0.0017865662,0.000043705586,0.0010825323],"category_scores_gemma":[0.00020865182,0.00009828284,0.000070495036,0.0015228329,0.00010970212,0.0002624345,0.0014852715,0.00018037105,0.0021536772],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000116038145,0.00013401732,0.000005652307,0.000041927164,0.000061693405,0.000013862836,0.0004382127,0.000037502516,0.0019338749,0.64136034,0.12772605,0.22823526],"study_design_scores_gemma":[0.00031593823,0.00007660205,0.00110345,0.000021923335,0.000009870199,0.000036488847,0.000062096406,0.0011394701,0.0010645386,0.008084773,0.98796207,0.00012279057],"about_ca_topic_score_codex":0.000009950811,"about_ca_topic_score_gemma":1.9338833e-7,"teacher_disagreement_score":0.98296666,"about_ca_system_score_codex":0.000044349035,"about_ca_system_score_gemma":0.0000042726674,"threshold_uncertainty_score":0.9998306},"labels":[],"label_agreement":null},{"id":"W6931326872","doi":"10.5281/zenodo.5138040","title":"Data Citation in Practice - Cocoon a French repository dedicated to oral resources","year":2021,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Humber Polytechnic","funders":"European Commission","keywords":"Citation; Order (exchange); Pillar; Work (physics); Open science; Citation analysis","score_opus":0.04554979824262712,"score_gpt":0.2760699476072294,"score_spread":0.2305201493646023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931326872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17936383,0.0019591511,0.5313921,0.03229524,0.0010716808,0.0020290494,0.00029978686,0.0038918837,0.2476973],"genre_scores_gemma":[0.9554228,0.00010409551,0.040943768,0.0010648981,0.00014688917,1.2989298e-7,0.0012360077,0.00052573986,0.00055563654],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977505,0.00070953177,0.00024596142,0.000600492,0.0004268412,0.0002666399],"domain_scores_gemma":[0.99791926,0.00008211536,0.00008460443,0.0010764089,0.00068107684,0.00015650502],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000986896,0.00009304974,0.00010500968,0.0003208409,0.0008963047,0.0011501776,0.002022188,0.000050215254,0.0002539125],"category_scores_gemma":[0.002117432,0.00009999704,0.000019985217,0.002611466,0.00006554249,0.00078363455,0.0027383317,0.00023472751,0.0008140316],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015372796,0.0016710932,0.00015530638,0.00019338726,0.00021365103,0.0015679507,0.023678815,0.0007044413,0.036951102,0.03418208,0.45962447,0.440904],"study_design_scores_gemma":[0.00037324592,0.00012954857,0.0053524617,0.00005229106,0.000011037374,0.0002804453,0.000477187,0.0036641003,0.0006986847,0.00020177782,0.98860264,0.00015656183],"about_ca_topic_score_codex":0.00008018061,"about_ca_topic_score_gemma":0.000005093833,"teacher_disagreement_score":0.77605903,"about_ca_system_score_codex":0.000057794754,"about_ca_system_score_gemma":0.000012527836,"threshold_uncertainty_score":0.99996394},"labels":[],"label_agreement":null},{"id":"W6931682187","doi":"10.5683/sp3/76jxkw","title":"From Open to Restricted - Statistic Canada’s Continuum of Data Access - A Panel","year":2020,"lang":"en","type":"dataset","venue":"Borealis","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McMaster University; Ontario Council of University Libraries; Concordia University; Université Laval","funders":"","keywords":"Data access; Statistic; Public access; Data collection; Panel data; Data modeling","score_opus":0.09994807161490606,"score_gpt":0.3326378317118409,"score_spread":0.23268976009693487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931682187","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002841549,0.000068665075,0.008137891,0.0014922678,0.0002576214,0.0004935528,0.98944694,0.000023192197,0.00007705773],"genre_scores_gemma":[0.00002456941,0.00006940067,0.009633416,0.0010483959,0.00013579187,0.000020802112,0.9890483,0.000011044123,0.000008248981],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976272,0.00014359204,0.00047584143,0.0009096443,0.00055736105,0.00028639077],"domain_scores_gemma":[0.9954916,0.00037865888,0.00032202355,0.003395931,0.00010996334,0.00030178658],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00011914894,0.00025776585,0.0005656362,0.00014469969,0.00007727174,0.00057999644,0.01694681,0.00011655626,0.000030149919],"category_scores_gemma":[0.00036114283,0.00023416828,0.000034593882,0.00075967703,0.00004532215,0.00045546063,0.008365808,0.00025086862,0.000004448953],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018256374,0.000033984747,0.0000079806,0.000044787834,0.00009747133,0.00025159464,0.000044557357,0.0000014507237,0.0000028554452,0.000084021616,0.9974379,0.0019751312],"study_design_scores_gemma":[0.00026246827,0.00004932179,0.005957024,0.000102080245,0.00007927312,0.0000023346984,0.0000110310575,0.00011703031,0.00001570333,0.0006040757,0.99251485,0.00028480025],"about_ca_topic_score_codex":0.99781454,"about_ca_topic_score_gemma":0.99385685,"teacher_disagreement_score":0.008581002,"about_ca_system_score_codex":0.000036953457,"about_ca_system_score_gemma":0.0021575904,"threshold_uncertainty_score":0.99965435},"labels":[],"label_agreement":null},{"id":"W6969329526","doi":"10.5281/zenodo.5159785","title":"Hypogastrura tullbergi","year":2017,"lang":"fr","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Plateau (mathematics); Period (music); Indian ocean; Quarter (Canadian coin)","score_opus":0.05162466152374122,"score_gpt":0.2587623801579835,"score_spread":0.20713771863424224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6969329526","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024869945,0.003727472,0.12437756,0.05053464,0.0045210416,0.0011016907,0.0004454615,0.0019548826,0.7884673],"genre_scores_gemma":[0.96459866,0.001335612,0.007379416,0.0004819351,0.0012338181,4.9452538e-8,0.00031654732,0.002333091,0.022320893],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99730563,0.00041682002,0.00030849734,0.0007104579,0.0005177918,0.00074083026],"domain_scores_gemma":[0.9966658,0.000036101992,0.00026324563,0.0019531883,0.00070195325,0.0003797124],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00092673645,0.00023626715,0.00021330573,0.0002467815,0.011179793,0.008031917,0.004948797,0.00013983781,0.01009999],"category_scores_gemma":[0.00084829243,0.00026194067,0.00015323803,0.0004328936,0.00093842135,0.001346842,0.0047321958,0.0004987335,0.018525785],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002204065,0.00021800908,0.000013390607,0.00009193085,0.00007468639,0.00012733274,0.0015005092,0.00003633798,0.0006510917,0.1951078,0.18850751,0.61364937],"study_design_scores_gemma":[0.0005890442,0.0002620529,0.005746718,0.00011303812,0.00002494583,0.0004976383,0.0000941652,0.0021884686,0.0003180897,0.0034968797,0.9863821,0.0002868137],"about_ca_topic_score_codex":0.00013777537,"about_ca_topic_score_gemma":0.0000013895162,"teacher_disagreement_score":0.9397287,"about_ca_system_score_codex":0.00009367466,"about_ca_system_score_gemma":0.000009131278,"threshold_uncertainty_score":0.99998325},"labels":[],"label_agreement":null},{"id":"W7008140783","doi":"","title":"Australia-based crypto miner doubles hash rate after activating Canadian rigs","year":2022,"lang":"en","type":"other","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Hash function; Cryptography; Work (physics); Set (abstract data type); Identification (biology)","score_opus":0.0158722784077397,"score_gpt":0.23506738928866625,"score_spread":0.21919511088092655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7008140783","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007415699,0.00055761804,0.019748626,0.0032911748,0.0016833694,0.00083562935,0.00013093343,0.0008619955,0.9721491],"genre_scores_gemma":[0.022744173,0.000012027081,0.05803577,0.0027704844,0.00033083503,0.00025533736,0.00007125588,0.00031900717,0.9154611],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99811894,0.00011068605,0.0002081827,0.00066723203,0.00029814662,0.0005968351],"domain_scores_gemma":[0.9986183,0.00007022933,0.00011849392,0.00084642303,0.000026726544,0.00031982097],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019084553,0.00035195347,0.00027795898,0.0009869857,0.00016517901,0.0002751218,0.0010492405,0.00021874318,0.04110181],"category_scores_gemma":[0.000011812059,0.0003014538,0.00018898607,0.00076276966,0.00007348991,0.000104864914,0.00016685134,0.00035829356,0.00017606629],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074615145,0.00005208241,0.001520362,0.000088433655,0.0001064102,0.00028977494,0.000113877795,0.00006277991,0.000039459333,0.0077804015,0.986701,0.003237952],"study_design_scores_gemma":[0.00033143433,0.000032900512,0.0014148476,0.0000737817,0.000012860599,0.0000044708486,0.000016358554,0.00030037895,0.00012732287,0.00023350028,0.99693185,0.00052030483],"about_ca_topic_score_codex":0.2262051,"about_ca_topic_score_gemma":0.3573093,"teacher_disagreement_score":0.13110423,"about_ca_system_score_codex":0.00009785238,"about_ca_system_score_gemma":0.0003572716,"threshold_uncertainty_score":0.99994373},"labels":[],"label_agreement":null},{"id":"W7019676940","doi":"","title":"Implementing the Castryck-Decru attack on SIDH with general primes","year":2024,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada)","funders":"","keywords":"Isogeny; Cryptography; Key exchange; Alice (programming language); Alice and Bob; Cryptographic protocol; Public-key cryptography; Exploit","score_opus":0.013007288285511155,"score_gpt":0.22774485088047694,"score_spread":0.2147375625949658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7019676940","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99536264,0.00019624917,0.00022753312,0.0019193375,0.00035015307,0.0002521416,0.000010860034,0.00009922066,0.0015818501],"genre_scores_gemma":[0.3515563,0.00018908888,0.021185314,0.0001306711,0.00020012514,0.0000023696819,0.00023371945,0.00006729183,0.6264351],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9985913,0.000057828445,0.00010208896,0.00047568398,0.00039202167,0.0003810705],"domain_scores_gemma":[0.9990959,0.000049078717,0.00016513528,0.000526456,0.000097251774,0.00006618379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000170971,0.00023813917,0.00024267205,0.00026993817,0.00042490254,0.00012346786,0.0009961067,0.00012842902,0.000043451717],"category_scores_gemma":[0.000002494691,0.00017341138,0.00019055356,0.00046467225,0.00008574942,0.00018347647,0.00020117284,0.00034379892,0.00005225696],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044194053,0.00037998793,0.0018437753,0.0015949734,0.002033288,0.0012269189,0.83411264,0.0011232859,0.005204863,0.0546803,0.033575896,0.06378213],"study_design_scores_gemma":[0.0049701394,0.0040743886,0.088406675,0.0042216885,0.0023509648,0.00017507396,0.7619696,0.02109573,0.031051764,0.004888925,0.07211366,0.0046813427],"about_ca_topic_score_codex":0.007969745,"about_ca_topic_score_gemma":0.03299398,"teacher_disagreement_score":0.64380634,"about_ca_system_score_codex":0.000031570187,"about_ca_system_score_gemma":0.00011158852,"threshold_uncertainty_score":0.99863625},"labels":[],"label_agreement":null},{"id":"W7027774727","doi":"","title":"On the discrete logarithm problem in the finite fields and on elliptic curves","year":2000,"lang":"en","type":"other","venue":"TSpace","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Discrete logarithm; Counting points on elliptic curves; Schoof's algorithm; Logarithm; Finite field; Parameterized complexity; Multiplicative function; Generalization","score_opus":0.013176319511675054,"score_gpt":0.2613118332337158,"score_spread":0.24813551372204076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7027774727","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001566701,0.004358989,0.0044703423,0.026535701,0.00013857588,0.0007121456,0.0000050236495,0.00010963193,0.9635129],"genre_scores_gemma":[0.060229644,0.024048513,0.0071473815,0.032198235,0.0006063981,0.00034474168,0.000020013795,0.00036605078,0.87503904],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99896157,0.00017953603,0.00009431876,0.00031561017,0.00023848364,0.00021049439],"domain_scores_gemma":[0.9986475,0.00058369467,0.00006110674,0.0006767115,0.0000034434318,0.00002751288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021203885,0.00019123348,0.00015396916,0.00014356583,0.00007555335,0.00011080954,0.00076747197,0.00012977625,0.00021210399],"category_scores_gemma":[0.000015755173,0.00009265289,0.000059929163,0.00033375237,0.00010490898,0.000022409044,0.00006612926,0.00043984858,0.000055962963],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015868633,0.00014477757,0.000049417107,0.00021483748,0.00006185489,0.00009163078,0.006358206,0.0001483256,0.0000013790751,0.15262516,0.82635134,0.01393721],"study_design_scores_gemma":[0.00065718923,0.0007575763,0.0012767906,0.004292282,0.00004896133,0.000032246255,0.00027224628,0.0030338427,0.000026690417,0.02926389,0.95946854,0.00086973934],"about_ca_topic_score_codex":0.00019828601,"about_ca_topic_score_gemma":0.00020668312,"teacher_disagreement_score":0.1331172,"about_ca_system_score_codex":0.000003556824,"about_ca_system_score_gemma":0.000017331166,"threshold_uncertainty_score":0.37782753},"labels":[],"label_agreement":null},{"id":"W7038162185","doi":"","title":"Generalized Jacobians in cryptography","year":2005,"lang":"en","type":"other","venue":"Library and Archives Canada (Government of Canada)","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Discrete logarithm; Cryptosystem; Cryptography; Verifiable secret sharing; Hybrid cryptosystem; Hash function; Algebra over a field; Digital signature; Jacobian matrix and determinant","score_opus":0.0023492989399841835,"score_gpt":0.14007165846598996,"score_spread":0.13772235952600578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7038162185","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031898156,0.002693723,0.0016203376,0.0030673093,0.00031717517,0.00021695887,0.00010544871,0.00004359981,0.9916165],"genre_scores_gemma":[0.07343618,0.0070377192,0.108737186,0.0074558686,0.00061663566,0.000063556414,0.000028423923,0.00049698085,0.8021275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99769735,0.000072659146,0.00027848568,0.00039676664,0.0011955326,0.00035919214],"domain_scores_gemma":[0.99911934,0.000087481516,0.00017844433,0.00040480436,1.8172268e-7,0.00020973873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000008457612,0.00027409894,0.00035949316,0.00016695193,0.000059264694,0.00003544402,0.0006831544,0.000068394904,0.00014435817],"category_scores_gemma":[7.7059093e-7,0.0002607037,0.00006009158,0.0002914639,0.00007902736,0.00018143063,0.00022020676,0.00019059143,3.6892025e-9],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007774459,0.000098593824,0.009704926,0.00032917957,0.00021030976,0.00036017905,0.0001364473,0.00006850077,0.0011113063,0.8268644,0.115209974,0.04582839],"study_design_scores_gemma":[0.0007480515,0.00004775543,0.014847021,0.00037974224,0.000017360257,0.00000988681,0.00018033915,0.0013858307,0.003067485,0.0024758352,0.9762008,0.0006398785],"about_ca_topic_score_codex":0.009388771,"about_ca_topic_score_gemma":0.23637442,"teacher_disagreement_score":0.8609908,"about_ca_system_score_codex":0.0000030456383,"about_ca_system_score_gemma":0.0008855233,"threshold_uncertainty_score":0.9999845},"labels":[],"label_agreement":null},{"id":"W7092403464","doi":"10.5281/zenodo.17394697","title":"ps-pat/Moonshine.jl: v0.3.3","year":2025,"lang":"","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Noise (video); Term (time); Minor (academic); Identification (biology)","score_opus":0.024731572656636967,"score_gpt":0.2390803877714695,"score_spread":0.21434881511483253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7092403464","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009595287,0.0013925286,0.12665299,0.002540371,0.0010993546,0.0011826914,0.00044347133,0.0019870219,0.8646056],"genre_scores_gemma":[0.08937417,0.007543544,0.014856073,0.0023698926,0.0028876134,5.0263316e-7,0.004281729,0.02550536,0.8531811],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99361694,0.0012799028,0.0008178552,0.0019177815,0.0011476327,0.0012199004],"domain_scores_gemma":[0.99521184,0.00010970795,0.00044812367,0.0024310758,0.0012392345,0.00056002085],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014087331,0.0007155216,0.00064518384,0.0018002772,0.0051735286,0.0044614584,0.0069306353,0.000506617,0.09746624],"category_scores_gemma":[0.0010556434,0.0007581138,0.00039687028,0.0035485595,0.00074087776,0.00046694535,0.0070529035,0.0013663756,0.04317228],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042870557,0.0004027941,0.0000034860022,0.00032583112,0.0002582264,0.000086570006,0.00093182316,0.0000426871,0.00023960449,0.059582565,0.6309809,0.30710265],"study_design_scores_gemma":[0.0008629406,0.00036692346,0.00040183408,0.00047458892,0.00008393734,0.0001528233,0.0001250373,0.0013542018,0.00013681181,0.0017176626,0.9935634,0.00075981964],"about_ca_topic_score_codex":0.0000955058,"about_ca_topic_score_gemma":0.000002191484,"teacher_disagreement_score":0.36258253,"about_ca_system_score_codex":0.00022265308,"about_ca_system_score_gemma":0.000044866603,"threshold_uncertainty_score":0.999487},"labels":[],"label_agreement":null},{"id":"W7093090512","doi":"10.3934/mfc.2025036","title":"Blind RSA signatures from the &lt;inline-formula&gt;&lt;tex-math id=\"M1\"&gt;$ t- $&lt;/tex-math&gt;&lt;/inline-formula&gt;generalized Lehmer sequences of some classes of groups","year":2025,"lang":"","type":"article","venue":"Mathematical Foundations of Computing","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Algebraic number; Entropy (arrow of time); Adversarial system; Sequence (biology); Pseudorandom number generator; Leverage (statistics)","score_opus":0.02377094191647222,"score_gpt":0.2937545075468835,"score_spread":0.26998356563041126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7093090512","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63784206,0.005810053,0.34939492,0.0022669078,0.0013646907,0.0016489456,0.00021265773,0.00021462899,0.001245122],"genre_scores_gemma":[0.8619422,0.00046188303,0.13627863,0.0003310429,0.0005084122,0.000046326324,0.00014492661,0.00008603981,0.00020058356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9874669,0.0009121097,0.005479616,0.0018025319,0.0026973726,0.0016414907],"domain_scores_gemma":[0.98342097,0.008436432,0.002872834,0.0030700294,0.0017884845,0.000411276],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0035244843,0.0014773243,0.0029845766,0.0012500709,0.0016786873,0.0009158345,0.0048991907,0.00088520366,0.00019760797],"category_scores_gemma":[0.0019608384,0.001130973,0.001653653,0.0042713257,0.0026785838,0.0014280442,0.0023530365,0.001264886,0.00007092465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011989076,0.0020629615,0.00019363624,0.0015251366,0.0011973209,0.000015929269,0.0045937807,0.009283985,0.029216433,0.9398698,0.00046420412,0.011456919],"study_design_scores_gemma":[0.0029762876,0.00046360158,0.0017737595,0.0037256759,0.0010483804,0.000032575295,0.0004619091,0.70027727,0.011040602,0.27515212,0.0018790644,0.0011687403],"about_ca_topic_score_codex":0.00012317412,"about_ca_topic_score_gemma":0.00011867858,"teacher_disagreement_score":0.6909933,"about_ca_system_score_codex":0.00017526148,"about_ca_system_score_gemma":0.0013131477,"threshold_uncertainty_score":0.9997976},"labels":[],"label_agreement":null},{"id":"W7093818954","doi":"","title":"Avaliação da mobilidade de arsênio, cádmio, cromo, cobre, níquel, chumbo e zinco nos sedimentos da bacia do Rio Ribeira de Iguape","year":2014,"lang":"pt","type":"article","venue":"Americanae (AECID Library)","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Drainage basin; Heavy metals; Galaxias; Organochlorine pesticide","score_opus":0.01065762286588776,"score_gpt":0.236412711092971,"score_spread":0.22575508822708323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7093818954","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8521212,0.004422025,0.11706772,0.007267084,0.0031353561,0.0019177203,0.00030183428,0.0014149522,0.012352112],"genre_scores_gemma":[0.95948935,0.00039348583,0.025072994,0.009947681,0.00082709745,0.00023006272,0.00008174385,0.00024711894,0.00371046],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99005777,0.00187461,0.0014288499,0.0024084125,0.0013960999,0.0028342763],"domain_scores_gemma":[0.9931702,0.000906872,0.0010228708,0.0031036248,0.00012281591,0.0016736062],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0011079643,0.0013029487,0.0014514433,0.00097407965,0.0012101822,0.0013318147,0.00473529,0.00038323333,0.0016814852],"category_scores_gemma":[0.00013955396,0.0013754134,0.0009211897,0.0040708366,0.0013934312,0.0021073676,0.0021370358,0.0015785053,0.00055732456],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033708758,0.002946305,0.5399819,0.00044609339,0.0013811905,0.0010507752,0.0107106855,0.0036655632,0.005276873,0.048103586,0.22404765,0.1620523],"study_design_scores_gemma":[0.005434441,0.004357458,0.73176175,0.00074705534,0.0007524907,0.00057055074,0.0021163183,0.092713006,0.011126041,0.011701571,0.13291581,0.005803511],"about_ca_topic_score_codex":0.018304847,"about_ca_topic_score_gemma":0.00007470028,"teacher_disagreement_score":0.19177985,"about_ca_system_score_codex":0.00026100554,"about_ca_system_score_gemma":0.0014648066,"threshold_uncertainty_score":0.9999722},"labels":[],"label_agreement":null},{"id":"W7096554344","doi":"","title":"helpful discussions with Professor Graham Rigby. REFERENCES","year":2008,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Moduli; Multiplier (economics); Prime (order theory); Residue number system; Multiplication (music); Table (database); Quarter (Canadian coin); Remainder","score_opus":0.019822533798187866,"score_gpt":0.2219065597540055,"score_spread":0.20208402595581765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096554344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4631786,0.00025952084,0.4654845,0.015476413,0.0004935159,0.00050146115,0.0000028543207,0.0008953701,0.053707756],"genre_scores_gemma":[0.94641656,0.000040056257,0.04913347,0.00018388056,0.000028616696,0.000022162203,0.0000010414651,0.0000046839286,0.004169528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99900675,0.00004886414,0.00012316107,0.0003028853,0.00026385245,0.00025447807],"domain_scores_gemma":[0.99929404,0.00005021587,0.000039161958,0.0004495705,0.00005472748,0.00011227009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000077949044,0.00011502895,0.000118933174,0.00011090297,0.00038612811,0.00004782198,0.00057756965,0.00004087233,0.00005264015],"category_scores_gemma":[0.000008006619,0.000055821052,0.000051625917,0.00064675265,0.00014650439,0.00032200757,0.00012523118,0.00012367903,0.000058987764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003944903,0.000810924,0.04586778,0.000038612696,0.00011752837,0.00034464174,0.006486536,0.00003779071,0.0006178927,0.89426196,0.019405881,0.031971],"study_design_scores_gemma":[0.003410046,0.0022704627,0.8264204,0.00033091902,0.00005988929,0.001460874,0.001982658,0.0058746147,0.015904073,0.08447801,0.055311438,0.0024966113],"about_ca_topic_score_codex":0.000053657834,"about_ca_topic_score_gemma":0.00012914791,"teacher_disagreement_score":0.80978394,"about_ca_system_score_codex":0.0000051128477,"about_ca_system_score_gemma":0.00006192075,"threshold_uncertainty_score":0.29698244},"labels":[],"label_agreement":null},{"id":"W7099338906","doi":"","title":"on Kyoto ECONOMIC BENEFITS OF CANADIAN ACTION","year":2002,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"","score_opus":0.032427122736647496,"score_gpt":0.20971067852700168,"score_spread":0.17728355579035418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099338906","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7804502,0.00017253324,0.0046202596,0.0035851393,0.00072101643,0.00015116537,0.000005466632,0.00009260005,0.2102016],"genre_scores_gemma":[0.99754614,0.00005663536,0.0019370562,0.00018471714,0.00001592196,0.0000016108431,2.0479641e-7,0.0000018640113,0.0002558315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996501,0.000007643104,0.000070890725,0.00011619156,0.00004311383,0.00011206716],"domain_scores_gemma":[0.99966204,0.000024457993,0.000019116056,0.0002052498,0.000008696051,0.00008041124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000034099616,0.000041052936,0.00004853908,0.00043449202,0.000043532793,0.000021613927,0.00020888989,0.00002677388,0.00026802864],"category_scores_gemma":[0.0000024892065,0.000035769615,0.00003459455,0.0002286453,0.000012328022,0.00010583533,0.000013194719,0.00003305421,0.00017084813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.9510886e-7,0.000027087088,0.00055883225,0.0000030303074,0.000010294122,0.0000015208342,0.00017936669,0.0018344203,0.00005553073,0.8798688,0.0077259974,0.10973434],"study_design_scores_gemma":[0.0026336818,0.0017298631,0.3409714,0.00016094833,0.00003617976,0.00009914336,0.00018819631,0.40968537,0.087776974,0.048458833,0.10641767,0.0018417309],"about_ca_topic_score_codex":0.041557208,"about_ca_topic_score_gemma":0.1274616,"teacher_disagreement_score":0.83140993,"about_ca_system_score_codex":0.000021666194,"about_ca_system_score_gemma":0.000013638027,"threshold_uncertainty_score":0.96482515},"labels":[],"label_agreement":null},{"id":"W7104523501","doi":"10.1145/3747199.3747580","title":"Quantifier Elimination Over the Integers","year":2025,"lang":"","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantifier elimination; Quantifier (linguistics); Algebra over a field; Fragment (logic); Key (lock)","score_opus":0.009730127804241094,"score_gpt":0.26656970601222235,"score_spread":0.25683957820798126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104523501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012777368,0.0019331796,0.86838686,0.03969191,0.004170017,0.00037759254,0.000001248301,0.000090548296,0.07257127],"genre_scores_gemma":[0.9871686,0.00025574383,0.0016840915,0.0027536692,0.000053966996,0.000011733037,6.375527e-7,0.000004681253,0.008066844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998333,0.00017781333,0.00034499055,0.0004826566,0.00031391592,0.00034767098],"domain_scores_gemma":[0.9984674,0.00038393386,0.00007977572,0.0009088605,0.00010856508,0.00005146511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006463008,0.00019298418,0.00015445697,0.00031849157,0.00053077575,0.00062136987,0.0012173605,0.00012371232,0.0003308765],"category_scores_gemma":[0.0000726701,0.000117663636,0.00023749119,0.0021865512,0.00032785157,0.00034044846,0.00042058568,0.00031694118,0.000096411015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065269564,0.0000789176,0.00048204008,0.000022207985,0.000063421045,0.0000028894995,0.000772229,0.000040561088,0.000086000735,0.81396145,0.010344328,0.17413944],"study_design_scores_gemma":[0.0010277426,0.00016901566,0.30081704,0.00033887406,0.00019043521,0.0000099069475,0.0010463069,0.48581976,0.00699512,0.10304916,0.099885575,0.00065105775],"about_ca_topic_score_codex":0.00017923287,"about_ca_topic_score_gemma":0.00008416789,"teacher_disagreement_score":0.9743913,"about_ca_system_score_codex":0.000029684816,"about_ca_system_score_gemma":0.00015312215,"threshold_uncertainty_score":0.5991884},"labels":[],"label_agreement":null},{"id":"W7118161971","doi":"10.1145/3731599.3787534","title":"10.1145/3731599.3787534","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Key (lock)","score_opus":0.003734963850320043,"score_gpt":0.16296996462204758,"score_spread":0.15923500077172753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7118161971","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087243225,0.00010257697,0.000422209,0.0008274456,0.0000069510215,0.00012644714,0.0000021456997,0.00028127746,0.9973585],"genre_scores_gemma":[0.0009220182,7.260034e-7,0.004983724,0.00015626472,0.00006468302,0.000010199732,0.0000015009782,0.000008673271,0.9938522],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905074,0.00003600048,0.000133789,0.00029652612,0.00019776638,0.0002851995],"domain_scores_gemma":[0.99922174,0.00004509565,0.000017544142,0.00052974146,0.000029687673,0.00015619006],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00012224926,0.000114874805,0.00011872188,0.00011946697,0.0001096079,0.00011484318,0.00073020696,0.000046116682,0.9158241],"category_scores_gemma":[0.000009361855,0.000103067796,0.00008056326,0.00061681634,0.000032525626,0.00018202508,0.000096673386,0.000081374346,0.94683397],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008529918,0.000045515433,4.4655266e-7,0.000002584133,0.000010235424,0.000013942366,0.00003998242,0.000085878404,0.000057621,0.00013893377,0.050648995,0.9489473],"study_design_scores_gemma":[0.00014162534,0.00010664255,0.00019378557,0.000009402947,0.0000045134216,0.000017401011,2.8632465e-7,0.0013962514,0.00014821168,0.00018375299,0.9976377,0.0001604435],"about_ca_topic_score_codex":0.000016822029,"about_ca_topic_score_gemma":1.44837e-7,"teacher_disagreement_score":0.9487869,"about_ca_system_score_codex":0.000010003475,"about_ca_system_score_gemma":0.000022437236,"threshold_uncertainty_score":0.42029825},"labels":[],"label_agreement":null},{"id":"W7162208155","doi":"10.65521/ijeecs.v14i2.2107","title":"A Systematic Review of Algebraic Curve Constructions for Lightweight Key Establishment: Methods, Architectures, and Future Research Directions","year":2025,"lang":"","type":"article","venue":"International Journal of Electrical Electronics and Computer Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Key (lock); Cryptography; Elliptic curve cryptography; Scalability; Intersection (aeronautics); Algebraic number; Software","score_opus":0.011327246490535174,"score_gpt":0.33129640508860964,"score_spread":0.31996915859807445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7162208155","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021195445,0.5542701,0.4364247,0.0044499976,0.003451771,0.0010615152,0.0000146975535,0.000011865581,0.00010339649],"genre_scores_gemma":[0.057669934,0.8588572,0.07756097,0.0009937569,0.004308529,0.00026026074,0.000011489395,0.00005991147,0.00027792418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"systematic_review","domain_scores_codex":[0.99351394,0.0018777584,0.002289805,0.00058440765,0.0010957809,0.00063832407],"domain_scores_gemma":[0.99141455,0.0028837724,0.0012719807,0.0004155652,0.0037719267,0.00024221679],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005026475,0.00037033556,0.0014449515,0.001959708,0.00039872547,0.0007308772,0.0014061428,0.00023101752,0.0000036500567],"category_scores_gemma":[0.00045506746,0.0002907373,0.00051690254,0.0020329072,0.0002760482,0.00020854123,0.00032847186,0.0011826797,3.5307824e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015192082,0.00052479084,0.00004416696,0.075913556,0.0047131497,0.000028564438,0.0004938453,0.000036083828,0.000112940186,0.8094063,0.0032566134,0.10531807],"study_design_scores_gemma":[0.0062815715,0.0077542183,0.00036665844,0.3796039,0.003515745,0.012261214,0.00021431541,0.21916693,0.0011900682,0.089560464,0.27849203,0.0015928831],"about_ca_topic_score_codex":0.000036736536,"about_ca_topic_score_gemma":0.0000063137013,"teacher_disagreement_score":0.71984583,"about_ca_system_score_codex":0.00024465902,"about_ca_system_score_gemma":0.0009143953,"threshold_uncertainty_score":0.99995446},"labels":[],"label_agreement":null},{"id":"W71930384","doi":"10.1007/1-4020-5334-4_5","title":"GROUP STRUCTURE OF ELLIPTIC CURVES OVER FINITE FIELDS AND APPLICATIONS","year":2006,"lang":"en","type":"book-chapter","venue":"Algebra and applications","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Elliptic curve; Schoof's algorithm; Group (periodic table); Mathematics; Finite field; Abelian group; Supersingular elliptic curve; Pure mathematics; Field (mathematics); Algebra over a field; Discrete mathematics; Physics; Quarter period","score_opus":0.005416333763933337,"score_gpt":0.20245810612726095,"score_spread":0.19704177236332762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W71930384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029882268,0.03420166,0.90313905,0.0006683511,0.000052086583,0.0017113187,0.00027824205,0.00015075161,0.059499733],"genre_scores_gemma":[0.80141306,0.060293548,0.048502836,0.004487109,0.0019476486,0.0017068967,0.0014352705,0.00024858434,0.07996503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989951,0.000007840968,0.00027453477,0.0004376171,0.00015194857,0.00013295076],"domain_scores_gemma":[0.9989077,0.00017643547,0.00017676041,0.0006101102,0.000052924224,0.000076090524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003738807,0.00020788009,0.00024166718,0.0001421483,0.00016426208,0.000053057778,0.00035022362,0.00021023468,0.00003361778],"category_scores_gemma":[0.0000017436789,0.00019171966,0.000079933976,0.00013141762,0.00021559722,0.00009053628,0.00015627129,0.00021825012,0.0000047125113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.978477e-7,0.00001744616,0.000060241087,0.00018359508,0.000031919106,3.635556e-7,0.000019016768,0.000004021372,0.000077453085,0.97872883,0.000927216,0.01994939],"study_design_scores_gemma":[0.00017671815,0.00004074921,0.0020545057,0.00015125712,0.00012768286,0.000015319629,0.000002743696,0.00021591768,0.0000809907,0.7304001,0.26636752,0.00036649327],"about_ca_topic_score_codex":0.000022268052,"about_ca_topic_score_gemma":0.00003148188,"teacher_disagreement_score":0.8546362,"about_ca_system_score_codex":0.0000045041443,"about_ca_system_score_gemma":0.000021648284,"threshold_uncertainty_score":0.7818101},"labels":[],"label_agreement":null}]}