{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.575929,0.0014211301,0.31184575,0.0009579789,0.00041395833,0.0001679946,0.0004081864,0.0007447706,0.108111314],"genre_scores_gemma":[0.8515169,0.0011117979,0.10423107,0.0001182011,0.00043903087,0.0001617048,0.0006304687,0.00022552007,0.041565247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989467,0.00021538328,0.00008051125,0.0001932833,0.00042985816,0.00013429135],"domain_scores_gemma":[0.9977823,0.0012042513,0.00025174464,0.00025056838,0.00028478896,0.00022652085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011371992,0.0014215404,0.001387481,0.0064563644,0.0019266062,0.0039042374,0.002371648,0.0015842114,0.005881704],"category_scores_gemma":[0.00385456,0.0006860067,0.00083059224,0.005684659,0.0032910956,0.009280254,0.0022425607,0.0021506618,0.0007906506],"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.00007497749,0.000031936255,0.0012434005,0.000110347966,0.000017417875,0.00017346369,0.0003108682,0.0019767545,0.0023580547,0.96771294,0.0017600105,0.02422988],"study_design_scores_gemma":[0.0000136708595,0.00003739468,0.0005887701,0.00003921493,0.00003010219,0.00033750877,0.00013055684,0.009329787,0.0026735757,0.9824808,0.0043161814,0.000022453703],"about_ca_topic_score_codex":0.0005015834,"about_ca_topic_score_gemma":0.0005096865,"teacher_disagreement_score":0.0064563644,"about_ca_system_score_codex":0.0011945656,"about_ca_system_score_gemma":0.00040205152,"threshold_uncertainty_score":0.019676208},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05656769,0.0049016536,0.84072703,0.0031455348,0.0012830336,0.00008982093,0.00021817113,0.00055986835,0.09250712],"genre_scores_gemma":[0.70845175,0.0041768206,0.20990962,0.0010653862,0.0017302808,0.00028963544,0.00028987185,0.00021022701,0.07387645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997495,0.000063573934,0.0000107820215,0.000038165046,0.00009956038,0.0000385111],"domain_scores_gemma":[0.9994342,0.0003080579,0.00005118961,0.000089383866,0.00008216832,0.000034930727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055988325,0.0004943791,0.00038263973,0.0008545691,0.0004973815,0.0013000638,0.00055952236,0.0006664142,0.011874737],"category_scores_gemma":[0.002638258,0.00013842464,0.0003922038,0.0005429436,0.00091628,0.00218523,0.0007216756,0.0017652804,0.0022625658],"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.0000870662,0.000018199942,0.0001789016,0.000080229416,0.000009682855,0.000072455594,0.000044748907,0.01124421,0.003068083,0.9293907,0.004210795,0.051595],"study_design_scores_gemma":[0.0000521683,0.00011034279,0.0002324947,0.00007116416,0.000011675397,0.00027116627,0.000024802173,0.13938874,0.00275116,0.8132663,0.043794226,0.00002582833],"about_ca_topic_score_codex":0.00031899824,"about_ca_topic_score_gemma":0.0003366545,"teacher_disagreement_score":0.011874737,"about_ca_system_score_codex":0.00081472174,"about_ca_system_score_gemma":0.00045156432,"threshold_uncertainty_score":0.039724946},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055660516,0.010219936,0.8484003,0.0012564834,0.00090648205,0.00045455416,0.00012684453,0.0073872455,0.07558765],"genre_scores_gemma":[0.19426763,0.007501942,0.76036286,0.00031926594,0.00046654325,0.00022936279,0.00024064057,0.0010357103,0.03557605],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992423,0.00014506742,0.00006110062,0.00014803684,0.00032141944,0.00008208042],"domain_scores_gemma":[0.99910706,0.0004466103,0.00005306601,0.00026589952,0.00009552247,0.000031734035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010122817,0.0016166891,0.0008132419,0.0014739345,0.0007462174,0.0017888185,0.0010054541,0.0009526491,0.020382922],"category_scores_gemma":[0.002892963,0.0007346446,0.0006417753,0.0011431354,0.00084591657,0.00752712,0.0017964749,0.001787582,0.010589451],"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.00045391073,0.00013116968,0.0005461079,0.0008989092,0.000042323336,0.00043702318,0.0005814519,0.0105559705,0.07710984,0.2021165,0.012204417,0.69492245],"study_design_scores_gemma":[0.00041535991,0.0006993032,0.000782156,0.000400436,0.00016360894,0.0029953928,0.00029111007,0.062371306,0.21872565,0.19485177,0.5181383,0.00016564444],"about_ca_topic_score_codex":0.00014455288,"about_ca_topic_score_gemma":0.0002538174,"teacher_disagreement_score":0.020382922,"about_ca_system_score_codex":0.00045947233,"about_ca_system_score_gemma":0.00038091734,"threshold_uncertainty_score":0.068187654},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34529644,0.022698037,0.23884435,0.0054730396,0.0038851362,0.00011933731,0.00074008637,0.0011557488,0.38178787],"genre_scores_gemma":[0.7181466,0.008760888,0.051701963,0.0010933663,0.0031668406,0.00012653592,0.0008161258,0.0007961588,0.21539146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959904,0.00010415895,0.000022467382,0.000054995475,0.00016707739,0.000052226773],"domain_scores_gemma":[0.9993436,0.00022727699,0.00011664225,0.00013113316,0.000103778395,0.00007757699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068600435,0.00068462954,0.00053649826,0.0014273647,0.0006723647,0.0016780581,0.0006376067,0.00065573165,0.014656243],"category_scores_gemma":[0.0016951133,0.00030876315,0.00031937953,0.0015902816,0.0012731937,0.004115216,0.0010283211,0.0020046874,0.0028320139],"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.000066225366,0.000038922528,0.000055960365,0.00010055983,0.000005347131,0.00004384001,0.00028802123,0.00075067463,0.0027059761,0.94254947,0.006561406,0.046833742],"study_design_scores_gemma":[0.00003165995,0.00007904649,0.00020493621,0.00004337732,0.000008140785,0.00016689884,0.00009009289,0.0023392444,0.0010440813,0.9532193,0.04275478,0.000018472565],"about_ca_topic_score_codex":0.00021693422,"about_ca_topic_score_gemma":0.00027080273,"teacher_disagreement_score":0.014656243,"about_ca_system_score_codex":0.0007466521,"about_ca_system_score_gemma":0.00027079007,"threshold_uncertainty_score":0.049030006},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16948721,0.0022934955,0.7740231,0.0007993204,0.0005208226,0.0009975472,0.0010938247,0.014348595,0.036436033],"genre_scores_gemma":[0.55198824,0.0006788456,0.41691846,0.0001990838,0.00011758532,0.00025261412,0.002074857,0.00017674708,0.027593525],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995627,0.00004798579,0.000036387315,0.00006514097,0.00022361087,0.0000641718],"domain_scores_gemma":[0.999819,0.000017428047,0.000027858545,0.000045934437,0.00007408858,0.00001570893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028652747,0.00037427738,0.0005019007,0.0005441041,0.00040399036,0.00088258745,0.0006464072,0.00043492706,0.0048254402],"category_scores_gemma":[0.0003852511,0.00018377055,0.00023677338,0.0004872648,0.00018140755,0.0014732729,0.0005502202,0.00038481376,0.0024201102],"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.001103369,0.00028847184,0.0021200187,0.00050461147,0.00012000865,0.00046120668,0.0002588487,0.014256372,0.42552438,0.029699553,0.028010782,0.49765247],"study_design_scores_gemma":[0.00039484145,0.001078762,0.0025500725,0.000080639315,0.000111469395,0.0015728051,0.00012560708,0.19372262,0.6403672,0.00839524,0.15147446,0.00012630451],"about_ca_topic_score_codex":0.00048593915,"about_ca_topic_score_gemma":0.0007049409,"teacher_disagreement_score":0.0048254402,"about_ca_system_score_codex":0.0004970521,"about_ca_system_score_gemma":0.0008152592,"threshold_uncertainty_score":0.016142726},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064098336,0.03763139,0.80240196,0.0017913961,0.0022824416,0.00033044466,0.00011768823,0.0028932039,0.08845306],"genre_scores_gemma":[0.7498445,0.021107951,0.18018667,0.00088368467,0.0009955799,0.00012565916,0.00026877451,0.0002838072,0.046303313],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993893,0.00010470751,0.000027379212,0.000070679795,0.0003379265,0.00007006131],"domain_scores_gemma":[0.99935967,0.00029760908,0.000058126912,0.00012220237,0.00014571912,0.00001666735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034967254,0.0013004445,0.00076565077,0.0011874031,0.00039810833,0.0009748859,0.0010051592,0.0011300106,0.0030847138],"category_scores_gemma":[0.0012370015,0.00031557467,0.00039494876,0.0008338439,0.00071725424,0.0019802314,0.0007232257,0.0009871644,0.0009715136],"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.00041403386,0.00015169034,0.00037772543,0.00061038235,0.000085257736,0.0002615703,0.000166219,0.03192656,0.06045757,0.079125606,0.010285023,0.81613845],"study_design_scores_gemma":[0.00013201492,0.0015288892,0.0017100732,0.00079080067,0.000350859,0.0030968038,0.00020676709,0.3272395,0.3138418,0.18980692,0.16114016,0.00015545607],"about_ca_topic_score_codex":0.00022488438,"about_ca_topic_score_gemma":0.00020296373,"teacher_disagreement_score":0.0030847138,"about_ca_system_score_codex":0.00053243554,"about_ca_system_score_gemma":0.0003655508,"threshold_uncertainty_score":0.010319412},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5135733,0.0015323116,0.4690526,0.00031737896,0.000052265772,0.000027087057,0.00005666194,0.00024111035,0.015147309],"genre_scores_gemma":[0.97859335,0.00039030163,0.018669512,0.000021674223,0.000019367268,0.000015685648,0.000027752942,0.00002797077,0.0022343064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964345,0.000059641465,0.000012597057,0.000027861732,0.0002325302,0.00002387854],"domain_scores_gemma":[0.9984276,0.0010271637,0.00016668021,0.000101140926,0.0002579519,0.000019491694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004151602,0.00021043012,0.00020381546,0.00066815,0.0001835156,0.0005252,0.00024067453,0.0003096649,0.001550503],"category_scores_gemma":[0.0049961363,0.00014700601,0.000113841,0.00046166044,0.0006284659,0.0007171613,0.0002361277,0.00033694637,0.00014359342],"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.00053639116,0.000044319087,0.0037828947,0.0001933411,0.000030806747,0.00067246,0.0005267039,0.3641211,0.100937404,0.39569253,0.0009889251,0.1324732],"study_design_scores_gemma":[0.00001061223,0.000083491796,0.0014566625,0.000026244514,0.00000889972,0.0002809841,0.000034875964,0.92279184,0.030606275,0.043278117,0.0013980478,0.000024080815],"about_ca_topic_score_codex":0.0006693674,"about_ca_topic_score_gemma":0.0005662169,"teacher_disagreement_score":0.001550503,"about_ca_system_score_codex":0.0005314737,"about_ca_system_score_gemma":0.0002625573,"threshold_uncertainty_score":0.0051869154},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109180294,0.003907431,0.8272647,0.00048776204,0.00084486225,0.00027682568,0.00018572777,0.0026646615,0.055187777],"genre_scores_gemma":[0.34635973,0.002355146,0.6262453,0.0004242231,0.00030015266,0.00013789875,0.00036643646,0.00018813883,0.02362298],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970514,0.00004540464,0.000032233147,0.00005209859,0.00013282934,0.00003224449],"domain_scores_gemma":[0.9994998,0.00015862437,0.00004606728,0.00014208612,0.00012761308,0.000025781712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004882093,0.0004992349,0.00042862195,0.0007240429,0.0004662428,0.0011889803,0.0007311789,0.0005633461,0.009229694],"category_scores_gemma":[0.0012241337,0.00028321185,0.00042496217,0.0005442714,0.00044347267,0.002881555,0.0004652299,0.0008607252,0.0042704884],"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.0005721337,0.00020241889,0.00083134766,0.0005022511,0.000057492864,0.00040713354,0.00024732336,0.0041886447,0.16069019,0.11832045,0.004919438,0.70906126],"study_design_scores_gemma":[0.00029687866,0.001408891,0.0022292458,0.00026059453,0.00018032739,0.0058425656,0.00021973118,0.060574956,0.61917484,0.061887667,0.24772914,0.00019507452],"about_ca_topic_score_codex":0.000108999346,"about_ca_topic_score_gemma":0.00039807794,"teacher_disagreement_score":0.009229694,"about_ca_system_score_codex":0.00031603745,"about_ca_system_score_gemma":0.00045209882,"threshold_uncertainty_score":0.030876398},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12100116,0.0047991807,0.6520826,0.001443842,0.0021956016,0.00030327038,0.0007575555,0.0018931123,0.21552376],"genre_scores_gemma":[0.5979105,0.004156653,0.2614201,0.00082038384,0.0014341341,0.00029547143,0.0011980605,0.00044956346,0.13231511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996935,0.000059449892,0.00003470196,0.000047920177,0.00012708276,0.000037390488],"domain_scores_gemma":[0.99964476,0.00009110169,0.000046738238,0.000116427975,0.00007973252,0.000021303644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038059082,0.00087912986,0.00045134634,0.0010515727,0.00073112984,0.0020806626,0.0006312146,0.00060436537,0.014619606],"category_scores_gemma":[0.0012279296,0.00036854096,0.00048157608,0.00151182,0.0008923524,0.0019489328,0.000798696,0.001445746,0.0059159463],"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.00009774709,0.000058336347,0.00012533297,0.000115119205,0.000008028277,0.00020255175,0.00016557194,0.0024577507,0.0053419275,0.86760914,0.0057467674,0.11807179],"study_design_scores_gemma":[0.000038117865,0.00014412792,0.0002516799,0.00008671636,0.000019823496,0.00078642066,0.00005743262,0.009622453,0.009482639,0.9293148,0.050159786,0.000035976078],"about_ca_topic_score_codex":0.00018730921,"about_ca_topic_score_gemma":0.00035105168,"teacher_disagreement_score":0.014619606,"about_ca_system_score_codex":0.0005871136,"about_ca_system_score_gemma":0.0005791318,"threshold_uncertainty_score":0.04890752},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04569111,0.0014523477,0.90413773,0.00080896524,0.00052961835,0.00018301235,0.00020305203,0.0037479836,0.043246213],"genre_scores_gemma":[0.32437402,0.0010429022,0.6321172,0.00029746644,0.00045791827,0.00019707682,0.0006033642,0.000507151,0.040402915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993338,0.000121416946,0.000040087507,0.00012398987,0.00028426424,0.00009632445],"domain_scores_gemma":[0.9995852,0.00010905478,0.000025670683,0.00017846741,0.000078124125,0.000023514343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005507801,0.00088882237,0.00075085653,0.00089341373,0.0009373048,0.0014188692,0.000742637,0.0006054418,0.01150521],"category_scores_gemma":[0.0012772116,0.0003492246,0.0006793697,0.0009883633,0.0010323928,0.0023741245,0.0011258932,0.0012646501,0.004061119],"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.0010271437,0.00021514378,0.0004568031,0.00026649944,0.00005744857,0.00015149835,0.00016624991,0.032830775,0.030259691,0.23087725,0.021740723,0.6819508],"study_design_scores_gemma":[0.00038384215,0.0002986133,0.0005173485,0.000113351314,0.00006695744,0.00078584446,0.00012394098,0.2583339,0.054857247,0.6102205,0.07422358,0.00007489057],"about_ca_topic_score_codex":0.0010800605,"about_ca_topic_score_gemma":0.0017351105,"teacher_disagreement_score":0.01150521,"about_ca_system_score_codex":0.0011398483,"about_ca_system_score_gemma":0.0010333001,"threshold_uncertainty_score":0.038488805},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08931756,0.012220522,0.6742439,0.0015416582,0.0008026075,0.0000900778,0.00016437139,0.0018248021,0.2197945],"genre_scores_gemma":[0.7395085,0.007250397,0.21676952,0.0003135272,0.0007070689,0.00008112583,0.00016902752,0.0003656496,0.034835204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996331,0.00008027199,0.000020728574,0.000050844785,0.00017270641,0.000042383588],"domain_scores_gemma":[0.9993987,0.0002504268,0.000047490015,0.00021859973,0.0000713715,0.000013367966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039245776,0.0005245234,0.0005231817,0.0014768759,0.0005943782,0.0012305446,0.0005304645,0.0010476311,0.0040276297],"category_scores_gemma":[0.0026890852,0.0003115798,0.00050708576,0.0027098453,0.0014796575,0.0015333154,0.0012051011,0.0009262966,0.0010040293],"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.00006120367,0.000028698501,0.00038587573,0.00019936521,0.000011344747,0.00044270162,0.00036355178,0.020177145,0.008973924,0.77165186,0.006324392,0.19137998],"study_design_scores_gemma":[0.000021668262,0.00010247048,0.00076323625,0.00016376642,0.000026622138,0.0019750271,0.00010476273,0.117029056,0.009049123,0.813525,0.05718601,0.000053279346],"about_ca_topic_score_codex":0.0004342988,"about_ca_topic_score_gemma":0.00052168773,"teacher_disagreement_score":0.0040276297,"about_ca_system_score_codex":0.00056313485,"about_ca_system_score_gemma":0.00030985067,"threshold_uncertainty_score":0.013473809},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0208589,0.0032281186,0.9312223,0.0004756451,0.00068760966,0.00005411043,0.0000558358,0.0009987016,0.042418808],"genre_scores_gemma":[0.40097636,0.0033953274,0.5649996,0.0003297469,0.00078252185,0.00010571093,0.00016442697,0.00015364694,0.029092684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996985,0.00006406581,0.000027507414,0.00005167556,0.00012933924,0.000028986642],"domain_scores_gemma":[0.9996126,0.00010404163,0.000032150834,0.0000824128,0.00014324769,0.000025491949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004581017,0.0003832874,0.00037073012,0.0009480151,0.0003786137,0.0011131649,0.00043099053,0.0005727455,0.005044349],"category_scores_gemma":[0.0018400485,0.0001517739,0.00020050074,0.0011327966,0.0006604975,0.0010383041,0.0007491755,0.00088815944,0.0019109861],"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.00014606513,0.00003622938,0.00038978495,0.00018591085,0.000012791224,0.00046645588,0.00020445438,0.023294216,0.024993489,0.7125303,0.0037005793,0.2340396],"study_design_scores_gemma":[0.00008649462,0.00034966943,0.00060905196,0.00018955545,0.000030891533,0.0017527544,0.00012472105,0.31060416,0.038075343,0.50236976,0.14573872,0.00006883836],"about_ca_topic_score_codex":0.00023080142,"about_ca_topic_score_gemma":0.0002760276,"teacher_disagreement_score":0.005044349,"about_ca_system_score_codex":0.0002933787,"about_ca_system_score_gemma":0.0003818366,"threshold_uncertainty_score":0.016875029},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30599028,0.0055819456,0.25674525,0.0014448325,0.0016090705,0.0001508536,0.0003480823,0.0013138725,0.42681572],"genre_scores_gemma":[0.84461,0.004376698,0.055060327,0.00018935464,0.00070089195,0.00009551252,0.00024892998,0.0004383105,0.09427998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995528,0.000073271374,0.00002989643,0.00007413127,0.0001857646,0.00008411852],"domain_scores_gemma":[0.9996879,0.00006925717,0.000042155087,0.0000849747,0.00006167502,0.000054014654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004537933,0.0016435424,0.00086540484,0.0024856557,0.0015124269,0.0025748499,0.0007273316,0.0006984696,0.008588229],"category_scores_gemma":[0.0011370085,0.0006005538,0.0006408692,0.0024430603,0.001832205,0.005346826,0.0022664238,0.0023044432,0.003832893],"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.00008784902,0.000038385024,0.00016846636,0.00012354564,0.000014242186,0.00015973943,0.00037602603,0.0016842332,0.005711459,0.9337197,0.0027592878,0.055157024],"study_design_scores_gemma":[0.000028654298,0.00010987846,0.0002778678,0.00006727576,0.000020535606,0.00048716814,0.00011894434,0.0035921715,0.0071466286,0.95860296,0.029501284,0.000046596026],"about_ca_topic_score_codex":0.0002116826,"about_ca_topic_score_gemma":0.0002685827,"teacher_disagreement_score":0.008588229,"about_ca_system_score_codex":0.0007943545,"about_ca_system_score_gemma":0.00039047672,"threshold_uncertainty_score":0.028730452},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007143899,0.010965899,0.94039583,0.00065537344,0.0005409498,0.00014240845,0.00014432668,0.0018744544,0.038136955],"genre_scores_gemma":[0.14952974,0.016841775,0.77142376,0.00039767977,0.0012197887,0.00029054668,0.00066871295,0.00084371906,0.058784228],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877006,0.00017436905,0.00006359748,0.00011712324,0.00076037965,0.000114559996],"domain_scores_gemma":[0.9991084,0.0002799851,0.000056030192,0.00035926842,0.0001696043,0.000026767817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006776252,0.0019756868,0.0008773303,0.0022780197,0.0010056237,0.00219198,0.0018295862,0.0010273918,0.018722858],"category_scores_gemma":[0.0022778192,0.0009956942,0.00086784165,0.002936296,0.0009606828,0.006450388,0.00229742,0.0030641828,0.009783252],"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.0002753303,0.00014243514,0.00020409604,0.00082754344,0.00008850385,0.00013397039,0.00019674127,0.012317688,0.036064997,0.30476165,0.02565078,0.6193362],"study_design_scores_gemma":[0.00023617849,0.00028548343,0.0005557218,0.00038846154,0.00014612192,0.0015591751,0.0001322863,0.10314746,0.0855607,0.54316866,0.2647031,0.000116687705],"about_ca_topic_score_codex":0.00018615137,"about_ca_topic_score_gemma":0.00038776378,"teacher_disagreement_score":0.018722858,"about_ca_system_score_codex":0.00078606093,"about_ca_system_score_gemma":0.00058633013,"threshold_uncertainty_score":0.06263423},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23718473,0.0035207435,0.72883993,0.00043245652,0.0004152679,0.00017937094,0.00016703192,0.0017738056,0.027486632],"genre_scores_gemma":[0.64705014,0.001721215,0.33221373,0.00016127768,0.00018788246,0.00010189587,0.00025939007,0.00010440533,0.018200044],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998673,0.000023506427,0.000012139022,0.0000287814,0.000050325118,0.000017933931],"domain_scores_gemma":[0.9997873,0.000053747615,0.000047579844,0.000040348732,0.000058349327,0.0000127299845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019226104,0.00044648346,0.00022069534,0.00052266405,0.00028143774,0.0004892843,0.0004560065,0.00040032112,0.0033589178],"category_scores_gemma":[0.0005635585,0.00016307892,0.00033683187,0.00039736216,0.000248546,0.0011410145,0.00037323072,0.00043018768,0.0010594493],"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.00080377277,0.00014504755,0.0018539414,0.00057180936,0.000095979354,0.00057888357,0.00032828175,0.019282453,0.37069106,0.075226665,0.0035251866,0.52689695],"study_design_scores_gemma":[0.00019341777,0.0020625603,0.0032486185,0.0002109,0.00018730575,0.0046794433,0.00018580098,0.15564996,0.6964868,0.027460758,0.10951198,0.00012239444],"about_ca_topic_score_codex":0.00015919338,"about_ca_topic_score_gemma":0.00047429788,"teacher_disagreement_score":0.0033589178,"about_ca_system_score_codex":0.0002876532,"about_ca_system_score_gemma":0.00029281926,"threshold_uncertainty_score":0.011236727},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5475084,0.000328499,0.43772057,0.00019898685,0.00008090059,0.00030729265,0.00013875793,0.0016636356,0.01205294],"genre_scores_gemma":[0.86792547,0.00008570385,0.1268275,0.0000560021,0.00006159315,0.00023902513,0.00018639954,0.0001354161,0.004482944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987908,0.0004144381,0.000041588206,0.00018836909,0.00041036733,0.0001543887],"domain_scores_gemma":[0.9965701,0.00181092,0.0005311399,0.00052913174,0.00039892952,0.00015971165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001398087,0.0007863917,0.0007515882,0.000928737,0.00045254617,0.00087283197,0.000989742,0.00058769586,0.003573693],"category_scores_gemma":[0.004853233,0.00035094726,0.0007236376,0.0007721673,0.0006962263,0.001598372,0.0008871965,0.0006903559,0.000861473],"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.0031091042,0.0006638157,0.013194115,0.00039772363,0.00042256524,0.0018662072,0.00040220737,0.33202645,0.09998588,0.29875,0.005234225,0.24394771],"study_design_scores_gemma":[0.00034311455,0.0010126728,0.0012022414,0.000025207017,0.00009411331,0.0011060884,0.00003163623,0.9125171,0.043471392,0.036144618,0.0039908565,0.000061038605],"about_ca_topic_score_codex":0.00020124156,"about_ca_topic_score_gemma":0.00037714987,"teacher_disagreement_score":0.003573693,"about_ca_system_score_codex":0.00043988717,"about_ca_system_score_gemma":0.00042925286,"threshold_uncertainty_score":0.011955142},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02896817,0.0058308663,0.7957532,0.0023911223,0.0022945646,0.00038673377,0.0005427183,0.006111068,0.15772161],"genre_scores_gemma":[0.27565804,0.008288407,0.53349805,0.0008890255,0.0019324209,0.00034801176,0.0010706603,0.0011418307,0.17717358],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99958557,0.00005762514,0.000022478052,0.00004365649,0.0002479409,0.000042657473],"domain_scores_gemma":[0.9995147,0.00013686754,0.000024474844,0.00016815004,0.00011604261,0.000039834908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005038984,0.0009038088,0.0005288576,0.0011699315,0.00087934564,0.0014713198,0.00062619324,0.00096160587,0.012673496],"category_scores_gemma":[0.0011450459,0.00044556614,0.00042946692,0.0012397617,0.0007907479,0.0035839244,0.0013039992,0.0015252554,0.0058698803],"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.00036230515,0.00013716164,0.00017483997,0.00035529176,0.000031916607,0.0003003886,0.00014281104,0.008005227,0.040165216,0.4256704,0.045201227,0.4794533],"study_design_scores_gemma":[0.0002290329,0.00042513083,0.00044896855,0.00022396784,0.00007492828,0.0019111239,0.00006314036,0.05267871,0.04954667,0.38622874,0.5080492,0.00012044476],"about_ca_topic_score_codex":0.00017121495,"about_ca_topic_score_gemma":0.00021080827,"teacher_disagreement_score":0.012673496,"about_ca_system_score_codex":0.0006250395,"about_ca_system_score_gemma":0.0008048908,"threshold_uncertainty_score":0.04239708},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0749266,0.003678639,0.77904546,0.0005772968,0.0006413205,0.0002626947,0.00020764855,0.0035039326,0.13715646],"genre_scores_gemma":[0.49206695,0.0032595815,0.42449626,0.00030111344,0.00049264135,0.00023822692,0.0005106193,0.0004545533,0.07817995],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950993,0.00010830068,0.000033691318,0.00006951208,0.00019681505,0.00008172244],"domain_scores_gemma":[0.9996873,0.00009763599,0.00002664057,0.00009902024,0.00007073561,0.00001852287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053587375,0.0008810368,0.0007611187,0.0010018923,0.00069231936,0.0014733388,0.0007961391,0.00035408916,0.012814474],"category_scores_gemma":[0.0012454765,0.00033608513,0.0005538236,0.0017328225,0.00061610364,0.001953375,0.0010330845,0.0009930917,0.0052564796],"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.0005333679,0.00013604351,0.000315581,0.0005313108,0.00003864157,0.0004450917,0.00046477583,0.0096684955,0.035742022,0.32979766,0.019674076,0.60265297],"study_design_scores_gemma":[0.00030460456,0.0011423723,0.0012794768,0.00035848873,0.00017537133,0.003577812,0.00032040468,0.16254438,0.14207709,0.46383557,0.224209,0.00017541682],"about_ca_topic_score_codex":0.0005449685,"about_ca_topic_score_gemma":0.0011556327,"teacher_disagreement_score":0.012814474,"about_ca_system_score_codex":0.0008149306,"about_ca_system_score_gemma":0.0008480892,"threshold_uncertainty_score":0.042868674},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.304292,0.002317087,0.5173418,0.0008227068,0.0012674619,0.0005465372,0.00085504743,0.010395114,0.1621623],"genre_scores_gemma":[0.7874396,0.0010554559,0.17947936,0.00015698875,0.00009092088,0.00009671567,0.00048621235,0.00013902453,0.031055667],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99986136,0.000019792842,0.0000084206185,0.000017451004,0.000065171625,0.00002774193],"domain_scores_gemma":[0.9999124,0.000019356012,0.0000071601535,0.000015399848,0.000035135785,0.000010552584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008672719,0.00033230285,0.00022023584,0.00041857915,0.00028792568,0.0005621291,0.0003446264,0.00030753072,0.0060971836],"category_scores_gemma":[0.0002529501,0.00016509,0.00014441126,0.00029406033,0.0001539151,0.000310905,0.00014491295,0.00029250956,0.001455471],"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.0011795325,0.00034077742,0.0031647345,0.000909462,0.00013043186,0.0038137194,0.00029261122,0.056648273,0.3653644,0.053751674,0.016576655,0.4978276],"study_design_scores_gemma":[0.0006763055,0.002197808,0.0070291297,0.00035968586,0.00015021359,0.00765146,0.00018128533,0.24664368,0.4871298,0.0073453593,0.24050233,0.00013298266],"about_ca_topic_score_codex":0.0009414537,"about_ca_topic_score_gemma":0.0013136782,"teacher_disagreement_score":0.0060971836,"about_ca_system_score_codex":0.0002706835,"about_ca_system_score_gemma":0.00042188205,"threshold_uncertainty_score":0.020397186},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11942297,0.0013344771,0.8472757,0.000384266,0.00031437082,0.00021734086,0.00028295087,0.0030937449,0.027674202],"genre_scores_gemma":[0.47557092,0.0009344834,0.5122123,0.00017348849,0.00011197199,0.000128324,0.0007120377,0.00012817602,0.010028367],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997892,0.00003950139,0.000015458587,0.00004004944,0.000075880984,0.000039880935],"domain_scores_gemma":[0.9996902,0.00009484075,0.00004228604,0.00007782178,0.00007797356,0.000016945893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026609248,0.0005492674,0.00039250587,0.0006079904,0.00034155248,0.00082668016,0.00037816388,0.00035985088,0.0035027296],"category_scores_gemma":[0.0010216312,0.00015688929,0.0003470985,0.0006940058,0.0003852296,0.0011593695,0.00056155014,0.0005849392,0.002118378],"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.00085756206,0.00019911342,0.0008908365,0.0004265334,0.000045242345,0.00068191666,0.00026205147,0.021579525,0.09925691,0.13133089,0.00922771,0.7352417],"study_design_scores_gemma":[0.0004910435,0.0023576024,0.0018277096,0.00036135936,0.000108766006,0.005275113,0.000392552,0.25450724,0.41419694,0.2082481,0.11208918,0.00014445279],"about_ca_topic_score_codex":0.000515894,"about_ca_topic_score_gemma":0.0007097939,"teacher_disagreement_score":0.0035027296,"about_ca_system_score_codex":0.0003328152,"about_ca_system_score_gemma":0.0007012075,"threshold_uncertainty_score":0.011717796},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42702273,0.0015083242,0.44657135,0.001254279,0.0005236842,0.00031599836,0.0010409303,0.007942907,0.11381982],"genre_scores_gemma":[0.8293094,0.0004621384,0.13801597,0.00019943636,0.00018795587,0.00016757302,0.0012548119,0.0007434118,0.029659314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998874,0.00022753642,0.00005260127,0.00018279125,0.0003414132,0.00032167256],"domain_scores_gemma":[0.9991622,0.0003083282,0.00005097957,0.00029923292,0.000102066784,0.000077197474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064768334,0.0013227622,0.0018306526,0.001365316,0.0018788653,0.0033326913,0.0013979692,0.0010144182,0.022624983],"category_scores_gemma":[0.0019765263,0.00057704526,0.0008969633,0.002852594,0.0012367065,0.0054024966,0.003658892,0.0014328832,0.0051207743],"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.0015682452,0.0003259596,0.0025984906,0.0006014443,0.00013406527,0.0007825236,0.0014738456,0.03507826,0.020332607,0.45453358,0.04385361,0.43871734],"study_design_scores_gemma":[0.0003153034,0.00041650224,0.0013755162,0.00013086364,0.00011993365,0.00054697925,0.00072620786,0.10844511,0.026442466,0.82454836,0.03682079,0.00011189337],"about_ca_topic_score_codex":0.0008197696,"about_ca_topic_score_gemma":0.0018375908,"teacher_disagreement_score":0.022624983,"about_ca_system_score_codex":0.0012578034,"about_ca_system_score_gemma":0.0012022314,"threshold_uncertainty_score":0.075688064},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025357125,0.00042758862,0.9467612,0.00022401786,0.00038964217,0.000058178084,0.00010046407,0.0008285038,0.025853235],"genre_scores_gemma":[0.3041564,0.0009161321,0.63730186,0.0003470418,0.00057101896,0.00030834376,0.00043116295,0.0020786189,0.05388939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99954754,0.000095967975,0.00003374774,0.00006828814,0.00018824988,0.00006622627],"domain_scores_gemma":[0.99962914,0.00009829868,0.000033150962,0.00011928822,0.00006647727,0.000053635536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064443174,0.0007904457,0.0006658822,0.0010947228,0.0006095483,0.001807555,0.0011139117,0.000838901,0.011510374],"category_scores_gemma":[0.0020419406,0.00040703596,0.00059482764,0.0009268695,0.0008181156,0.0029341106,0.0018595974,0.0019323895,0.0031864764],"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.00013488096,0.00006737501,0.00010727509,0.00009315493,0.000013053196,0.00005082227,0.00016527333,0.0022234593,0.01111833,0.8588763,0.004999454,0.12215059],"study_design_scores_gemma":[0.00004763881,0.000070760536,0.00012204378,0.000048383936,0.00002614278,0.00015139871,0.00005712216,0.05311835,0.008291176,0.91529316,0.022739619,0.00003405326],"about_ca_topic_score_codex":0.0001455007,"about_ca_topic_score_gemma":0.00026114326,"teacher_disagreement_score":0.011510374,"about_ca_system_score_codex":0.00035547724,"about_ca_system_score_gemma":0.00029553164,"threshold_uncertainty_score":0.03850603},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3774797,0.0008267448,0.53001165,0.0018597404,0.00044893275,0.00029964064,0.00062798156,0.007897541,0.08054815],"genre_scores_gemma":[0.8137223,0.00022865101,0.17456329,0.00024376687,0.000044577493,0.0001621125,0.0004113768,0.00025272218,0.010371149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896336,0.00015844867,0.000057915382,0.00011744133,0.00046982357,0.00023307868],"domain_scores_gemma":[0.99945456,0.00012962623,0.000052681607,0.00017640702,0.00015320048,0.000033529097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004290927,0.00046949513,0.0005711755,0.0004150342,0.00057368935,0.0012013608,0.0014051414,0.0006926239,0.008573164],"category_scores_gemma":[0.0015338091,0.00030538999,0.0003745286,0.00074763066,0.00059864594,0.0014731082,0.00083468726,0.001060799,0.0015698202],"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.0016065339,0.00076681504,0.0025468364,0.00048060593,0.0001330092,0.00048413198,0.00040190536,0.28853843,0.121820435,0.27886498,0.023300815,0.28105557],"study_design_scores_gemma":[0.00037789965,0.0003419148,0.00092266296,0.000044019427,0.000048371618,0.000109668516,0.000089781985,0.857399,0.076184295,0.046282366,0.018131902,0.000068167436],"about_ca_topic_score_codex":0.002605846,"about_ca_topic_score_gemma":0.004379805,"teacher_disagreement_score":0.008573164,"about_ca_system_score_codex":0.0012484625,"about_ca_system_score_gemma":0.0018587568,"threshold_uncertainty_score":0.028680146},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028091741,0.20217264,0.025471177,0.014724948,0.033608284,0.00044557167,0.0052083596,0.0035568092,0.712003],"genre_scores_gemma":[0.00608862,0.08044511,0.005580357,0.00046452557,0.005443335,0.000063176885,0.0019532845,0.000500996,0.8994606],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992742,0.000053937387,0.000035181205,0.00009856768,0.00044975782,0.000088302426],"domain_scores_gemma":[0.997519,0.00026687354,0.000078454905,0.0001518019,0.0014972226,0.00048655792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010800373,0.002483043,0.0019186501,0.0029686056,0.0018875162,0.004514854,0.0010768499,0.0011578607,0.17507827],"category_scores_gemma":[0.0014308187,0.00073726696,0.0006938477,0.005548759,0.0010898504,0.0028839372,0.0013350688,0.0022897546,0.09661877],"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.000055293767,0.000020414938,0.00016540116,0.00039959972,0.000009989683,0.000055750348,0.00007705678,0.00035267646,0.0006346965,0.005452282,0.88357854,0.10919827],"study_design_scores_gemma":[0.000015764648,0.000028659266,0.00060998445,0.00021568332,0.000016016204,0.00016394274,0.00007909048,0.00051487226,0.00053152314,0.0026699624,0.99514306,0.000011443253],"about_ca_topic_score_codex":0.043443486,"about_ca_topic_score_gemma":0.14721853,"teacher_disagreement_score":0.17507827,"about_ca_system_score_codex":0.005438037,"about_ca_system_score_gemma":0.006869976,"threshold_uncertainty_score":0.58569515},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19211636,0.014506953,0.63022214,0.0051911003,0.002648337,0.00068492047,0.0007283295,0.0031833476,0.15071853],"genre_scores_gemma":[0.7029427,0.0079929,0.19925,0.0007046195,0.001142063,0.00039045126,0.00074938365,0.0003450518,0.08648266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893814,0.0001581295,0.00007464701,0.00018262246,0.0004894932,0.00015685165],"domain_scores_gemma":[0.9989236,0.00028356173,0.00013867301,0.00037164835,0.00016171088,0.00012077295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011915064,0.0007828343,0.000945925,0.0012231201,0.0011494401,0.0029775838,0.0015881964,0.0010830015,0.0087949075],"category_scores_gemma":[0.0026209909,0.0005387961,0.0005293672,0.0013935567,0.0018698935,0.00989016,0.00297545,0.0023239804,0.0023494028],"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.00051514927,0.0001532703,0.00029005154,0.00031073607,0.00003636575,0.0001463989,0.0003667361,0.00346971,0.0133986855,0.8790033,0.0059703477,0.09633928],"study_design_scores_gemma":[0.00056372094,0.00025360077,0.00070393924,0.0002041553,0.00012023058,0.0016709509,0.00015299699,0.03655563,0.027577385,0.72519225,0.20686819,0.00013687096],"about_ca_topic_score_codex":0.00015232078,"about_ca_topic_score_gemma":0.00031769412,"teacher_disagreement_score":0.0087949075,"about_ca_system_score_codex":0.0017456008,"about_ca_system_score_gemma":0.00092900824,"threshold_uncertainty_score":0.029421866},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08907717,0.0073594153,0.35782707,0.011434736,0.0036165956,0.0011890061,0.0036245596,0.0045034615,0.521368],"genre_scores_gemma":[0.6592132,0.0042929007,0.062132433,0.001688048,0.0013072481,0.0004015916,0.0028088025,0.0006547674,0.267501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99867487,0.00021931203,0.000101572194,0.0002466718,0.0004673769,0.00029024214],"domain_scores_gemma":[0.998292,0.00029778655,0.00016163099,0.0007823336,0.00032468585,0.00014163711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010663348,0.0011443419,0.0010342327,0.0014082541,0.0018759774,0.004311399,0.0007254688,0.0016481103,0.041911896],"category_scores_gemma":[0.0036494667,0.00055236835,0.0005965829,0.0017736871,0.0018488114,0.008452834,0.004024295,0.0026904729,0.031472348],"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.0006755504,0.00014278035,0.00045808867,0.00031537283,0.00003293753,0.0003372515,0.00037346073,0.0015042197,0.01638396,0.80411536,0.029839685,0.14582144],"study_design_scores_gemma":[0.00016415116,0.0002696097,0.0006109416,0.00025989246,0.00006970917,0.0018908454,0.00025810974,0.0036483584,0.04913942,0.542237,0.401363,0.00008893612],"about_ca_topic_score_codex":0.00013309065,"about_ca_topic_score_gemma":0.00012150191,"teacher_disagreement_score":0.041911896,"about_ca_system_score_codex":0.001202874,"about_ca_system_score_gemma":0.0013893243,"threshold_uncertainty_score":0.14020926},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15639947,0.029445967,0.29708683,0.021337338,0.003441961,0.00039411857,0.0007044118,0.001950799,0.48923916],"genre_scores_gemma":[0.8511112,0.01590372,0.047605585,0.0021735758,0.0026351435,0.0002261501,0.00053671096,0.0004565496,0.07935138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763083,0.0005235517,0.00009441,0.00025854248,0.0011284441,0.00036414826],"domain_scores_gemma":[0.99674535,0.0019507991,0.00016805202,0.0008593714,0.0001907187,0.000085800006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015051708,0.0018566287,0.0013192168,0.002263148,0.002272269,0.0035315612,0.0012605236,0.002844884,0.007977565],"category_scores_gemma":[0.005962665,0.000983701,0.0015267251,0.0024668246,0.0032087942,0.0081668245,0.003207544,0.004198873,0.0030436113],"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.00080162677,0.00014372883,0.0006858266,0.00033833744,0.000111847236,0.00055102515,0.000608379,0.015101358,0.0086445995,0.8282687,0.027578874,0.11716565],"study_design_scores_gemma":[0.000094437564,0.000112233625,0.0005609504,0.00013753014,0.00009055663,0.0011067342,0.00013448973,0.030734506,0.0077756085,0.9203799,0.03882157,0.000051446423],"about_ca_topic_score_codex":0.0003454234,"about_ca_topic_score_gemma":0.00035476935,"teacher_disagreement_score":0.007977565,"about_ca_system_score_codex":0.0016818029,"about_ca_system_score_gemma":0.00050915556,"threshold_uncertainty_score":0.026687622},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016123836,0.022510191,0.037097752,0.0012675863,0.0020154645,0.00009105177,0.00019041102,0.00065173465,0.93456334],"genre_scores_gemma":[0.012241199,0.015468078,0.010157877,0.0004158609,0.0011315058,0.00004660751,0.00033838992,0.00025673304,0.95994365],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994772,0.00005849914,0.000017815692,0.00007522815,0.00032829333,0.000042908167],"domain_scores_gemma":[0.99967253,0.00006942976,0.000016928761,0.00008967596,0.000120152574,0.000031359934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036061567,0.001397858,0.0007815928,0.0019112861,0.000997849,0.0025976645,0.0008415888,0.00096278754,0.06065905],"category_scores_gemma":[0.0010019911,0.0005521454,0.0003272996,0.0024438458,0.0011467349,0.00414182,0.0015933575,0.002587258,0.05205152],"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.00003200691,0.00008404988,0.00011081876,0.00035445296,0.000010001348,0.00007596883,0.00026411418,0.0012210896,0.0023490407,0.23096366,0.25302622,0.5115085],"study_design_scores_gemma":[0.0000054051493,0.00002179813,0.00011757959,0.00015887489,0.000005371578,0.0002256313,0.00003662394,0.00077563175,0.001159558,0.05561604,0.9418676,0.000009990481],"about_ca_topic_score_codex":0.00043775485,"about_ca_topic_score_gemma":0.000798596,"teacher_disagreement_score":0.06065905,"about_ca_system_score_codex":0.0012723184,"about_ca_system_score_gemma":0.0011604698,"threshold_uncertainty_score":0.20292473},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028151348,0.33069506,0.055400997,0.016615532,0.009369177,0.00012459919,0.00020848395,0.00064873946,0.58412236],"genre_scores_gemma":[0.047627587,0.5159291,0.07046505,0.0046577686,0.01598843,0.00014442841,0.00042471045,0.0005164274,0.3442466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800223,0.00029753748,0.00014826375,0.00022704793,0.0011793452,0.00014558157],"domain_scores_gemma":[0.99781525,0.000898019,0.000086208056,0.0004716144,0.0005692983,0.00015952888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020099978,0.0012721894,0.00091560464,0.0037571695,0.0015100711,0.0048180264,0.0010599828,0.0018013315,0.020152776],"category_scores_gemma":[0.005001145,0.0007804701,0.00077076344,0.0045054727,0.0031610753,0.014144192,0.0033552467,0.0064622737,0.017951662],"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.000029758257,0.000050604485,0.000110924855,0.0006269081,0.000010355255,0.00011232235,0.00040104138,0.0009007782,0.0010296889,0.7143922,0.067452,0.21488346],"study_design_scores_gemma":[0.0000051304196,0.000022105878,0.0000726929,0.00034256576,0.0000040365326,0.00036096596,0.00005307564,0.00049146835,0.00040961904,0.15762189,0.8406045,0.00001201485],"about_ca_topic_score_codex":0.00034778335,"about_ca_topic_score_gemma":0.00031722224,"teacher_disagreement_score":0.020152776,"about_ca_system_score_codex":0.0022664927,"about_ca_system_score_gemma":0.0019412115,"threshold_uncertainty_score":0.06741774},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026709042,0.0023365628,0.9335625,0.0017504211,0.00057902973,0.00026794305,0.00014570312,0.0029053937,0.031743497],"genre_scores_gemma":[0.69344175,0.0022410287,0.27461764,0.0015257499,0.0006799664,0.0005589851,0.00044039698,0.00070617406,0.02578813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99587053,0.0013849154,0.00018749638,0.00063731323,0.0013903158,0.0005294271],"domain_scores_gemma":[0.9914506,0.0043284544,0.000513391,0.0029061574,0.00060593634,0.00019539907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024616567,0.0017000238,0.0016912831,0.0020256042,0.0011651098,0.00234763,0.0024013002,0.0026789068,0.0049297726],"category_scores_gemma":[0.010208823,0.00086330634,0.0010671467,0.0017394834,0.003814996,0.0066913865,0.004954636,0.0035322122,0.0022382021],"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.0007677954,0.00015963994,0.00073351286,0.00030925972,0.00012234159,0.000191301,0.00027905722,0.06386027,0.019401383,0.67320085,0.0151428655,0.22583175],"study_design_scores_gemma":[0.00013869048,0.00022636983,0.00031374465,0.00009867866,0.000096722535,0.0005261748,0.000086282744,0.32977796,0.023724193,0.6241906,0.020727746,0.000092931936],"about_ca_topic_score_codex":0.0004657102,"about_ca_topic_score_gemma":0.00045514686,"teacher_disagreement_score":0.0049297726,"about_ca_system_score_codex":0.001114743,"about_ca_system_score_gemma":0.0011044971,"threshold_uncertainty_score":0.01649177},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078532316,0.0005270454,0.9002766,0.00019198807,0.00021711078,0.00017839827,0.00023679955,0.0017409966,0.01809889],"genre_scores_gemma":[0.40890747,0.0005643517,0.5746408,0.00019110023,0.00013444504,0.00014420229,0.0008140421,0.000105639185,0.014498041],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997931,0.000031602172,0.000017734583,0.000045858185,0.00007521685,0.000036471654],"domain_scores_gemma":[0.99984586,0.000020033292,0.000023164504,0.000051442763,0.000042254123,0.000017177696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021537942,0.000479696,0.00034819922,0.00048681724,0.0003915551,0.0005512993,0.00067146175,0.0003029165,0.0032664665],"category_scores_gemma":[0.00047239265,0.00021462543,0.00032852945,0.00078946486,0.0002887022,0.0010543871,0.00069687463,0.0005334648,0.0011049086],"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.0005196175,0.00022191985,0.0011504682,0.00039563567,0.00006456235,0.00048826213,0.0002730489,0.0206531,0.24210496,0.08861594,0.008588883,0.6369236],"study_design_scores_gemma":[0.00029711932,0.0018595903,0.0024162345,0.00010661343,0.00016974112,0.0037315104,0.00011936813,0.48646036,0.34342438,0.052650616,0.108595446,0.00016901053],"about_ca_topic_score_codex":0.00039901142,"about_ca_topic_score_gemma":0.00093219447,"teacher_disagreement_score":0.0032664665,"about_ca_system_score_codex":0.00027643237,"about_ca_system_score_gemma":0.0006807172,"threshold_uncertainty_score":0.010927379},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105725735,0.004767605,0.82051104,0.0017757727,0.00116288,0.00042876537,0.00027463117,0.0024338237,0.06291976],"genre_scores_gemma":[0.54681426,0.0029496555,0.4033537,0.0005627503,0.00092706754,0.00030827822,0.00056864315,0.00036169915,0.04415402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988973,0.00021385272,0.000092361384,0.00017619638,0.0004831579,0.0001371456],"domain_scores_gemma":[0.99878734,0.00027990475,0.000088356755,0.0005988639,0.00017905977,0.000066469125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008807766,0.0008994036,0.0007324503,0.00076907745,0.0012077717,0.0024293754,0.0012584709,0.0010608562,0.009470868],"category_scores_gemma":[0.0023841553,0.00050310727,0.0004922879,0.0012224307,0.0011014438,0.0046193115,0.002396936,0.0025698852,0.002948175],"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.0007140853,0.00026326336,0.0002559723,0.00034176835,0.00003382024,0.0002377901,0.0003404739,0.005168046,0.0550682,0.6479838,0.009254154,0.2803387],"study_design_scores_gemma":[0.0004131709,0.00073358027,0.0005695669,0.00018537938,0.000117142874,0.0037386827,0.00018418444,0.11505434,0.12202635,0.6354994,0.121320575,0.00015762019],"about_ca_topic_score_codex":0.00008065923,"about_ca_topic_score_gemma":0.00019239748,"teacher_disagreement_score":0.009470868,"about_ca_system_score_codex":0.00083511736,"about_ca_system_score_gemma":0.0007060859,"threshold_uncertainty_score":0.031683266},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012703427,0.017326804,0.3204889,0.0014768481,0.0027181588,0.00017825073,0.00021934397,0.0019744472,0.6429138],"genre_scores_gemma":[0.15381828,0.022339206,0.14588347,0.0009350671,0.0015229682,0.00018671597,0.00055769045,0.0011665666,0.67359006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994504,0.00008976426,0.00002760127,0.00007261336,0.00030875704,0.000050907587],"domain_scores_gemma":[0.9996145,0.0001207657,0.000018227223,0.00012024371,0.000109365224,0.000016813916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004766224,0.0014143552,0.0008804531,0.0015446242,0.000907506,0.0025421337,0.00093249604,0.0007548199,0.01829049],"category_scores_gemma":[0.0013834718,0.00052352936,0.0005312848,0.0019698902,0.0020543193,0.0036554604,0.0015971542,0.00293892,0.0155605255],"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.00007012834,0.000041199324,0.00007871526,0.00031388694,0.0000139888925,0.00012701836,0.00029057468,0.002298956,0.0051537603,0.62547684,0.03339059,0.33274418],"study_design_scores_gemma":[0.000024692705,0.0001122051,0.00016029274,0.00020358684,0.000021777754,0.0009288155,0.00007078037,0.006483643,0.011925022,0.4534532,0.52656734,0.000048508904],"about_ca_topic_score_codex":0.00027156936,"about_ca_topic_score_gemma":0.00028906163,"teacher_disagreement_score":0.01829049,"about_ca_system_score_codex":0.0009042158,"about_ca_system_score_gemma":0.00068284577,"threshold_uncertainty_score":0.061187804},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8121303,0.00055648637,0.070633754,0.0016798057,0.00021562743,0.00007266181,0.00022683475,0.00028957587,0.11419501],"genre_scores_gemma":[0.9854193,0.00017926391,0.0025034996,0.00005862691,0.00011535371,0.000020945077,0.00009099203,0.000043931097,0.011568223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993874,0.0001164433,0.000017997489,0.000056154608,0.00022080098,0.0002012121],"domain_scores_gemma":[0.9990983,0.0003505579,0.000115747185,0.00015060673,0.00013228202,0.00015247885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006473859,0.0006970881,0.0008143954,0.0015060583,0.001082803,0.0016930946,0.0006448388,0.0007679837,0.007968268],"category_scores_gemma":[0.0021680663,0.00025443378,0.0005487203,0.0008553157,0.0025349462,0.0028524094,0.0016535737,0.0015520421,0.0009051654],"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.00032404865,0.000065910244,0.001471159,0.000059896396,0.000018804723,0.0004180952,0.00023348787,0.018323502,0.0037829182,0.9621994,0.0026805345,0.010422206],"study_design_scores_gemma":[0.000054979755,0.00012485388,0.001907914,0.000034961326,0.000023435734,0.00048551246,0.00016143662,0.13926256,0.0035649755,0.85010064,0.004241064,0.000037620877],"about_ca_topic_score_codex":0.0008476494,"about_ca_topic_score_gemma":0.00062234525,"teacher_disagreement_score":0.007968268,"about_ca_system_score_codex":0.0010981251,"about_ca_system_score_gemma":0.00074732513,"threshold_uncertainty_score":0.026656568},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069778934,0.0009372178,0.8922151,0.0004972409,0.0004908537,0.00045835838,0.0002902904,0.015447204,0.019884886],"genre_scores_gemma":[0.5198405,0.00047216276,0.46177688,0.0003414738,0.00011974763,0.00034545764,0.0006431271,0.00019850349,0.016262274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973744,0.000038528164,0.000020918731,0.000055270422,0.00010475098,0.00004298086],"domain_scores_gemma":[0.99972504,0.000052511903,0.00003189379,0.00007372915,0.00009470152,0.00002203787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025041943,0.0005074595,0.00040004187,0.0007387882,0.00069093116,0.0007194411,0.0015135356,0.000607343,0.007663474],"category_scores_gemma":[0.0005927159,0.00027229867,0.00027614526,0.00058672734,0.0003125285,0.0009286711,0.0005283975,0.0006484922,0.003039161],"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.00094599876,0.00028079475,0.0014466854,0.00048085122,0.00009877662,0.000752417,0.00027542634,0.0109828105,0.34614065,0.049834285,0.015994567,0.5727668],"study_design_scores_gemma":[0.00048524042,0.0024069496,0.0022482807,0.0001243247,0.00022295912,0.0033407784,0.000111647874,0.28520247,0.58069456,0.016884798,0.108111285,0.00016669645],"about_ca_topic_score_codex":0.0006002474,"about_ca_topic_score_gemma":0.0010987981,"teacher_disagreement_score":0.007663474,"about_ca_system_score_codex":0.000457972,"about_ca_system_score_gemma":0.00058938714,"threshold_uncertainty_score":0.025636911},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10467006,0.0013214474,0.8137861,0.0010309065,0.00043981816,0.00022571131,0.0006027205,0.0033344592,0.074588776],"genre_scores_gemma":[0.56281596,0.0012964247,0.39677408,0.0004535701,0.00041085662,0.0004068468,0.0011135526,0.0018612163,0.03486742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985746,0.0002197812,0.00011179974,0.00017240414,0.0006462458,0.00027511848],"domain_scores_gemma":[0.9979614,0.0011297899,0.000117548094,0.00043822444,0.0002696174,0.00008346011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014834964,0.0012128946,0.00152063,0.0013978652,0.0013906673,0.005710798,0.0028541556,0.0018161652,0.018555341],"category_scores_gemma":[0.0070733773,0.0010074946,0.0010896568,0.002951201,0.0018946455,0.008120498,0.0032235365,0.0029150846,0.0034921898],"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.0002076491,0.00012461554,0.0004345289,0.00024480367,0.000024316874,0.00015001388,0.0005176073,0.0103491405,0.0038928133,0.86780655,0.006375735,0.10987222],"study_design_scores_gemma":[0.00012410035,0.000060902305,0.00021212985,0.000108493594,0.000047726237,0.00015672711,0.00016408047,0.05673265,0.0065514557,0.92138654,0.014403159,0.000052062598],"about_ca_topic_score_codex":0.00065314857,"about_ca_topic_score_gemma":0.0018119436,"teacher_disagreement_score":0.018555341,"about_ca_system_score_codex":0.0021495179,"about_ca_system_score_gemma":0.0012500981,"threshold_uncertainty_score":0.062073827},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05581111,0.0029426338,0.8418705,0.000820844,0.00094212475,0.000115782685,0.0002745783,0.0011591917,0.09606328],"genre_scores_gemma":[0.58322334,0.0035106777,0.36038452,0.00054296193,0.00073829433,0.00024356373,0.0006512486,0.0010450884,0.049660295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992987,0.00015572713,0.00006104367,0.00009587896,0.00030153734,0.000087143075],"domain_scores_gemma":[0.9995407,0.00014680513,0.00003284399,0.00013338643,0.00011391219,0.000032400414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092157285,0.001121795,0.0011273781,0.0015984405,0.0008526024,0.0033450508,0.001225739,0.0007142305,0.009765405],"category_scores_gemma":[0.0021027206,0.00042040003,0.00072783814,0.0021687627,0.0012037307,0.0052705905,0.001858479,0.0021334582,0.003713459],"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.000055789238,0.000033080585,0.00011662637,0.00008926146,0.000008297544,0.0000956078,0.00017273975,0.0018217658,0.002961885,0.91072106,0.0047186674,0.0792051],"study_design_scores_gemma":[0.000022880882,0.000047137943,0.000105714906,0.000041595278,0.000017194763,0.00027297836,0.00007260935,0.014140581,0.005554853,0.9554912,0.024203412,0.000029764817],"about_ca_topic_score_codex":0.00021325548,"about_ca_topic_score_gemma":0.00037648567,"teacher_disagreement_score":0.009765405,"about_ca_system_score_codex":0.00088360556,"about_ca_system_score_gemma":0.0004390288,"threshold_uncertainty_score":0.03266859},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29355597,0.015474144,0.44864774,0.0053141955,0.004022223,0.0002600557,0.00052338996,0.0016362052,0.23056619],"genre_scores_gemma":[0.81704783,0.0045533315,0.07818689,0.0007428361,0.0011065176,0.00014202514,0.00036038592,0.0002218049,0.09763836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993635,0.00015813377,0.000050649996,0.0001115183,0.00020627228,0.00011000778],"domain_scores_gemma":[0.99899393,0.00037505841,0.00017285807,0.00030110058,0.00011318063,0.000043990043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072903215,0.0010764658,0.0006396311,0.000953593,0.0009745484,0.0023139657,0.00053787,0.0009674859,0.01208085],"category_scores_gemma":[0.0032603354,0.00038529682,0.0005317015,0.0020100877,0.0018399733,0.0038148689,0.0011997415,0.001202685,0.0046837227],"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.0012968039,0.00014699795,0.0009923204,0.00038218906,0.000051279952,0.00095940114,0.00042283878,0.009634951,0.01485792,0.7434434,0.013977635,0.2138343],"study_design_scores_gemma":[0.000114420916,0.00032824,0.0011384219,0.0001689716,0.000066387795,0.0034868398,0.0001561902,0.03573337,0.03204993,0.88000405,0.046679396,0.00007375434],"about_ca_topic_score_codex":0.00026869617,"about_ca_topic_score_gemma":0.00042719487,"teacher_disagreement_score":0.01208085,"about_ca_system_score_codex":0.00071440515,"about_ca_system_score_gemma":0.00062432,"threshold_uncertainty_score":0.040414453},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09992431,0.0047846003,0.83388126,0.00073783315,0.0006460406,0.00024211577,0.00040192954,0.0039896737,0.055392206],"genre_scores_gemma":[0.5688413,0.0023508344,0.41084462,0.00026416752,0.0002835961,0.000117187185,0.00053808314,0.00014394145,0.016616257],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997547,0.00006492665,0.000019380239,0.000042024752,0.00007763851,0.000041296862],"domain_scores_gemma":[0.99975854,0.000088587534,0.00003515917,0.00005929612,0.000047271835,0.000011121432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029370977,0.00064437673,0.00041282427,0.0006048376,0.00046405863,0.0010363652,0.00029810026,0.00032777298,0.0041079177],"category_scores_gemma":[0.0009867187,0.00017903326,0.00034127408,0.0008739941,0.00067322166,0.001191811,0.00047063327,0.0005479118,0.002295804],"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.0011520694,0.00008008577,0.0011309641,0.00070385885,0.000082968305,0.0011372062,0.00039625246,0.029535126,0.08868911,0.24241547,0.01854016,0.6161367],"study_design_scores_gemma":[0.00031149876,0.0019167352,0.002390974,0.00031949088,0.00012412741,0.0056176377,0.00025836175,0.19196568,0.25726828,0.30492452,0.23476698,0.00013575255],"about_ca_topic_score_codex":0.0006146245,"about_ca_topic_score_gemma":0.0009820898,"teacher_disagreement_score":0.0041079177,"about_ca_system_score_codex":0.0005397098,"about_ca_system_score_gemma":0.0005730928,"threshold_uncertainty_score":0.013742387},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006157791,0.013897058,0.019798316,0.0014729007,0.0010920566,0.00004354027,0.00021046097,0.0003907664,0.9569371],"genre_scores_gemma":[0.078327715,0.020546531,0.013735186,0.0004970673,0.0008484305,0.000060326358,0.00041339718,0.00045750645,0.88511384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968946,0.000036441626,0.000015346206,0.000044903205,0.0001778731,0.000035890065],"domain_scores_gemma":[0.9998355,0.00003324922,0.0000153422,0.000051584306,0.000047304064,0.000016974285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002866239,0.0012029925,0.00062693434,0.0022193727,0.0013060296,0.0027342078,0.00057959405,0.0007637743,0.029212438],"category_scores_gemma":[0.00091129256,0.0004902736,0.00029885033,0.0024390297,0.0014797935,0.004663097,0.0014767775,0.002569455,0.019615514],"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.00003453744,0.000032466894,0.00008101888,0.0001976599,0.000007108828,0.000068829504,0.00029708538,0.00073402526,0.0015725276,0.7525435,0.061824918,0.18260625],"study_design_scores_gemma":[0.000009274345,0.000018699706,0.000199358,0.00015013812,0.000010300814,0.00035532168,0.000064444714,0.0006162235,0.0014719777,0.2758098,0.72127813,0.000016280725],"about_ca_topic_score_codex":0.0004963673,"about_ca_topic_score_gemma":0.0007388456,"teacher_disagreement_score":0.029212438,"about_ca_system_score_codex":0.0013055769,"about_ca_system_score_gemma":0.0007617638,"threshold_uncertainty_score":0.09772539},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026032353,0.0016818034,0.92728144,0.0008387717,0.0006420126,0.00017438184,0.00009037205,0.001961751,0.041296992],"genre_scores_gemma":[0.30862466,0.0023262114,0.65164673,0.0002538071,0.00084575906,0.0002271236,0.00045046175,0.00071021327,0.034915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986688,0.00033131073,0.00008543393,0.00019412108,0.0005627581,0.00015754429],"domain_scores_gemma":[0.99942744,0.00011251125,0.000034269546,0.00021074785,0.0001739334,0.000041110514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014739122,0.001223097,0.0014470519,0.002245234,0.00094147294,0.0019363473,0.000965766,0.0010579071,0.006998667],"category_scores_gemma":[0.002596659,0.0005470875,0.0008158731,0.0028269903,0.001202027,0.005361755,0.0028170752,0.00214123,0.004531343],"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.00045787258,0.00017144272,0.0005784862,0.0002915663,0.00008174516,0.00025449158,0.00021585468,0.006696356,0.026241174,0.44469932,0.013001244,0.5073104],"study_design_scores_gemma":[0.00033966493,0.00056500983,0.0005879063,0.00022419223,0.00014665286,0.0019887495,0.00013125145,0.07905382,0.07547348,0.68387306,0.15742907,0.00018703223],"about_ca_topic_score_codex":0.00015294178,"about_ca_topic_score_gemma":0.00016994661,"teacher_disagreement_score":0.006998667,"about_ca_system_score_codex":0.00062959234,"about_ca_system_score_gemma":0.0009157713,"threshold_uncertainty_score":0.023412824},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26130772,0.012848785,0.067705356,0.003929032,0.0023283106,0.00009273071,0.00046245244,0.00032972856,0.65099597],"genre_scores_gemma":[0.72560924,0.011569447,0.014976368,0.000480764,0.0019802554,0.00008124894,0.0007011552,0.0003067941,0.24429479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995621,0.00007420806,0.000017498169,0.000090354486,0.00013996566,0.00011578645],"domain_scores_gemma":[0.9995443,0.00015901994,0.000053317457,0.00009688948,0.00006992131,0.00007658065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037605612,0.0014304734,0.0010052397,0.00173686,0.002130702,0.0029762704,0.0007972262,0.0010878496,0.012119547],"category_scores_gemma":[0.0012710692,0.00069026346,0.00081630197,0.0021512532,0.00300507,0.0046597123,0.0022771962,0.0026097577,0.003117654],"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.00008684681,0.000031037824,0.0002535886,0.00009569791,0.0000084579615,0.0002404304,0.0005610384,0.0023473029,0.0011678952,0.96706575,0.0065830895,0.021558903],"study_design_scores_gemma":[0.000012100613,0.000025754076,0.00034791636,0.000047334135,0.000007686697,0.00019671049,0.00012078345,0.001789079,0.00051593943,0.97948974,0.01743415,0.000012666443],"about_ca_topic_score_codex":0.00083293504,"about_ca_topic_score_gemma":0.0007501821,"teacher_disagreement_score":0.012119547,"about_ca_system_score_codex":0.0013483866,"about_ca_system_score_gemma":0.0006024055,"threshold_uncertainty_score":0.040543973},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019151095,0.0018094559,0.92013836,0.00035827517,0.0005258442,0.00018468579,0.00035315077,0.0059391963,0.051539857],"genre_scores_gemma":[0.33627787,0.0017640892,0.5849954,0.00043050622,0.00036981425,0.00046304107,0.001960516,0.0022205738,0.07151815],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995415,0.00007748129,0.000022008286,0.0000674462,0.00023382445,0.000057813053],"domain_scores_gemma":[0.99952495,0.00015749555,0.000027194306,0.0001363347,0.00013665624,0.000017364266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025805712,0.00068494445,0.00046185896,0.00089684874,0.0006003338,0.0008188402,0.0006842855,0.0005801431,0.013468756],"category_scores_gemma":[0.0014035879,0.00032738262,0.00040656765,0.0009752756,0.00048127273,0.0009847296,0.0009951328,0.00083049404,0.0047963643],"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.00015254188,0.000056611545,0.00022258471,0.00030010004,0.000021681906,0.00022427506,0.00018083864,0.009814013,0.027843783,0.24518156,0.031588487,0.6844135],"study_design_scores_gemma":[0.00011516942,0.00023387712,0.000490783,0.00028279767,0.000055621804,0.0016173451,0.00006684261,0.18864338,0.15571642,0.45535392,0.19733071,0.000093137176],"about_ca_topic_score_codex":0.00036788773,"about_ca_topic_score_gemma":0.000494731,"teacher_disagreement_score":0.013468756,"about_ca_system_score_codex":0.00046892196,"about_ca_system_score_gemma":0.0005248279,"threshold_uncertainty_score":0.045057416},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68155736,0.001453642,0.2586142,0.018073814,0.0012080256,0.00029218223,0.002237184,0.0017923919,0.034771223],"genre_scores_gemma":[0.9768463,0.000077103585,0.019824661,0.0010805763,0.00050133164,0.00005601055,0.0005872454,0.00004207682,0.0009846545],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9790495,0.008502081,0.0011650035,0.004341229,0.005273205,0.0016690244],"domain_scores_gemma":[0.63069445,0.32294852,0.009302214,0.023033975,0.007842997,0.0061779115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02077532,0.001205155,0.0016548234,0.0037615234,0.003186122,0.0038748095,0.003964232,0.008126307,0.017547265],"category_scores_gemma":[0.20259967,0.00092016975,0.0017377356,0.001993756,0.006890917,0.0059655774,0.003504181,0.0040305518,0.0031789248],"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.02768623,0.0012603303,0.41222697,0.001885702,0.002098121,0.013908865,0.0022274822,0.028926428,0.02751834,0.26429954,0.032074288,0.18588766],"study_design_scores_gemma":[0.0032442163,0.002597542,0.060899064,0.0003589885,0.00089713285,0.026706107,0.0013577017,0.18916474,0.04730095,0.6424224,0.024541967,0.0005093339],"about_ca_topic_score_codex":0.0003928274,"about_ca_topic_score_gemma":0.00036324657,"teacher_disagreement_score":0.02077532,"about_ca_system_score_codex":0.00066322443,"about_ca_system_score_gemma":0.0014751203,"threshold_uncertainty_score":0.109871686},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5859517,0.0035701036,0.29881793,0.00042522262,0.0004890696,0.00017767203,0.00040654314,0.01246041,0.097701356],"genre_scores_gemma":[0.92545813,0.00068931194,0.060778655,0.00007690351,0.000057542016,0.000042420364,0.00028185025,0.0001366867,0.012478382],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998361,0.000028645065,0.00001245816,0.00002333189,0.000054297543,0.000045073957],"domain_scores_gemma":[0.99988484,0.000032507724,0.000013456631,0.000028653896,0.000028978639,0.000011531096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013235903,0.00062503625,0.0003985169,0.00077143,0.000368194,0.00095562683,0.00061842956,0.00031553317,0.008333453],"category_scores_gemma":[0.00033035927,0.00020246624,0.00023115949,0.0006427556,0.00022863808,0.0007374922,0.00033551356,0.000328294,0.0018785774],"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.0021545421,0.00018947996,0.0028430412,0.00083387445,0.00019143854,0.0012153073,0.000579812,0.036438305,0.21267699,0.09493675,0.016671373,0.6312691],"study_design_scores_gemma":[0.001008386,0.0024435255,0.0058293575,0.0004971828,0.00035771992,0.0028853281,0.0004421879,0.2596202,0.5539501,0.044978555,0.12774326,0.00024418352],"about_ca_topic_score_codex":0.0010870746,"about_ca_topic_score_gemma":0.0018683528,"teacher_disagreement_score":0.008333453,"about_ca_system_score_codex":0.0005915758,"about_ca_system_score_gemma":0.0003951798,"threshold_uncertainty_score":0.027878165},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04953779,0.0030224214,0.8449912,0.0003048335,0.0006761927,0.000107535096,0.00014335832,0.0057466263,0.09547006],"genre_scores_gemma":[0.3988314,0.003145918,0.48184493,0.00021709265,0.00037104826,0.00013678511,0.0006631236,0.00083653384,0.113953315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997242,0.000059629216,0.000014844528,0.00003753437,0.00012440224,0.000039298633],"domain_scores_gemma":[0.9996674,0.00009349522,0.000014395667,0.00011465384,0.000091794915,0.000018235964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036441025,0.0009960918,0.0006408726,0.000734993,0.00044350882,0.0010894814,0.00065606827,0.00041891847,0.012817666],"category_scores_gemma":[0.0009252791,0.00036369637,0.00037412235,0.0012175912,0.00048027388,0.0021432461,0.00084642984,0.00090471265,0.0058112503],"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.00046916085,0.00008572914,0.0003330078,0.00039272592,0.000039235587,0.00022096545,0.00023073323,0.008578398,0.04151353,0.21946022,0.02269208,0.7059842],"study_design_scores_gemma":[0.00022615807,0.000654897,0.0010606919,0.00019468676,0.00012963542,0.0023086455,0.000118042495,0.14853786,0.11964937,0.516995,0.2100169,0.00010807569],"about_ca_topic_score_codex":0.00022455808,"about_ca_topic_score_gemma":0.0004617753,"teacher_disagreement_score":0.012817666,"about_ca_system_score_codex":0.00039188616,"about_ca_system_score_gemma":0.00043571176,"threshold_uncertainty_score":0.042879343},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15644339,0.009704847,0.49892527,0.0016768399,0.0005277271,0.00015833868,0.000427964,0.0016736966,0.33046186],"genre_scores_gemma":[0.7521299,0.010083699,0.124525286,0.0002461094,0.0007352874,0.00013341631,0.00073222636,0.00048477997,0.110929236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948776,0.00007968594,0.000026423791,0.00004708237,0.0002712868,0.00008767043],"domain_scores_gemma":[0.9996183,0.00014550642,0.00003268483,0.00012113468,0.000059011225,0.00002343388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004519353,0.0011192119,0.00067570375,0.0012367984,0.0005330866,0.0017156376,0.00079007866,0.0003668147,0.009990896],"category_scores_gemma":[0.0010827715,0.00038263865,0.00053244137,0.0021288432,0.0011913611,0.0032206757,0.0015717428,0.0011724824,0.00280837],"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.000113642185,0.00006759107,0.00025978347,0.00029169588,0.000022958311,0.000088079905,0.00035060817,0.008210902,0.009264977,0.76421314,0.009728535,0.20738804],"study_design_scores_gemma":[0.00006595583,0.00009282033,0.00055352546,0.00011555311,0.000028991752,0.00033711363,0.00009419962,0.01416624,0.011172953,0.9165728,0.056773957,0.000025900525],"about_ca_topic_score_codex":0.00021743412,"about_ca_topic_score_gemma":0.0003473024,"teacher_disagreement_score":0.009990896,"about_ca_system_score_codex":0.0008833665,"about_ca_system_score_gemma":0.00050884014,"threshold_uncertainty_score":0.033422887},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08780101,0.0032651077,0.8353409,0.0027729275,0.00094579585,0.0002823583,0.00040534078,0.0015977522,0.06758887],"genre_scores_gemma":[0.8340362,0.001921684,0.1358432,0.0002728283,0.0005834419,0.0001905971,0.00037862707,0.00034622985,0.026427295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99662954,0.0009754285,0.00026908016,0.0005320542,0.00088779867,0.0007060535],"domain_scores_gemma":[0.9947864,0.0019159011,0.00028777652,0.002399221,0.00041259645,0.00019813102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032765702,0.0011374549,0.0012933261,0.0010306205,0.0013901482,0.003912134,0.002440657,0.0014465565,0.008350814],"category_scores_gemma":[0.008365804,0.00080101506,0.0011222808,0.0018130852,0.002981051,0.014023769,0.0065568993,0.00515122,0.0025236532],"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.0004653422,0.000085020256,0.00027610606,0.00020879775,0.000031038537,0.00021214064,0.0003601589,0.01963779,0.0041221054,0.92818576,0.0044804746,0.04193533],"study_design_scores_gemma":[0.00009711132,0.00013006684,0.00016840764,0.000059670256,0.000041423846,0.00023828937,0.000100679295,0.06969313,0.0052582514,0.91146785,0.012689825,0.000055293483],"about_ca_topic_score_codex":0.0004371156,"about_ca_topic_score_gemma":0.00042437477,"teacher_disagreement_score":0.008350814,"about_ca_system_score_codex":0.0019322683,"about_ca_system_score_gemma":0.0019139543,"threshold_uncertainty_score":0.02793628},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59941113,0.002097551,0.2804942,0.00045607937,0.0004082174,0.00013172907,0.0005027547,0.0074570025,0.10904135],"genre_scores_gemma":[0.861131,0.0006553797,0.12113134,0.00006790875,0.00002748164,0.000057424873,0.00042951672,0.00012273666,0.016377183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998685,0.000019263804,0.0000045281777,0.00001414468,0.00007157139,0.000021968885],"domain_scores_gemma":[0.99986863,0.000019014482,0.0000109689345,0.000022128737,0.00006923614,0.000009985852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000113125585,0.00033450781,0.00020156034,0.00045090835,0.00015365996,0.00048218283,0.0005065126,0.00019809863,0.0038886964],"category_scores_gemma":[0.00038342795,0.0000852689,0.00016576702,0.0007092036,0.00010635075,0.00028295626,0.00015905364,0.00026257432,0.0008561792],"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.0013782085,0.00026929268,0.0065641385,0.00051606476,0.00009944748,0.0010376872,0.00038410816,0.18959656,0.31794104,0.049434755,0.028666357,0.40411228],"study_design_scores_gemma":[0.000105227286,0.00054498005,0.0030414339,0.000037378657,0.00003587119,0.00041396086,0.00008929476,0.8397553,0.107778154,0.0025899047,0.045583226,0.00002518235],"about_ca_topic_score_codex":0.0018959272,"about_ca_topic_score_gemma":0.0025016004,"teacher_disagreement_score":0.0038886964,"about_ca_system_score_codex":0.000384463,"about_ca_system_score_gemma":0.00046533323,"threshold_uncertainty_score":0.013009012},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035628054,0.3292655,0.16699506,0.13083844,0.010444677,0.0001753098,0.0008796202,0.0006501788,0.32512313],"genre_scores_gemma":[0.67217726,0.20158471,0.048777893,0.011711391,0.028139561,0.00026792302,0.0005565085,0.000211814,0.036573008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958287,0.0013474742,0.0002866377,0.0007269275,0.0014548085,0.00035534016],"domain_scores_gemma":[0.988398,0.0060305484,0.0006504888,0.002749855,0.0017087619,0.00046239316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060066725,0.0007053165,0.0012252564,0.00312519,0.0028840112,0.010763685,0.0014735704,0.0046666465,0.005974757],"category_scores_gemma":[0.014882519,0.00091372005,0.0005760495,0.004169207,0.016069153,0.023271978,0.0044360873,0.0126144085,0.0027094574],"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.00007866194,0.00003983699,0.00014562276,0.00017671277,0.000009844044,0.00002629972,0.000312925,0.00073002616,0.00044832044,0.9443856,0.0068409913,0.046805095],"study_design_scores_gemma":[0.000023561728,0.000044327848,0.00011972995,0.00023960984,0.0000092419195,0.00006248105,0.000093822906,0.0023897386,0.00083064486,0.8723568,0.12379854,0.000031494426],"about_ca_topic_score_codex":0.0008980347,"about_ca_topic_score_gemma":0.00041058878,"teacher_disagreement_score":0.010763685,"about_ca_system_score_codex":0.0036079253,"about_ca_system_score_gemma":0.0027203062,"threshold_uncertainty_score":0.031766713},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08355849,0.0016115266,0.8520933,0.0007465283,0.001230759,0.00022431387,0.00037252164,0.0029711956,0.057191473],"genre_scores_gemma":[0.38988695,0.0008922485,0.5262779,0.00053018925,0.00039104966,0.00014942515,0.0005477668,0.00020712691,0.08111738],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997415,0.00003796233,0.000015850188,0.000045319503,0.00012885171,0.000030533687],"domain_scores_gemma":[0.99987805,0.000020129773,0.00000976513,0.00003199317,0.000044341094,0.000015706744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018700851,0.00044446296,0.0005230543,0.0004772491,0.00035855387,0.00075037975,0.0006965569,0.00051021564,0.009820722],"category_scores_gemma":[0.00046262715,0.00016463947,0.00035840913,0.00063436,0.00028206472,0.0007616407,0.00077246124,0.000644129,0.004379346],"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.0011177172,0.00019806267,0.000535943,0.0004116258,0.000071353374,0.0008023957,0.00016159732,0.013524875,0.22381853,0.17087707,0.013035708,0.5754452],"study_design_scores_gemma":[0.00053672143,0.0022719312,0.0024248161,0.00021146424,0.00033090898,0.0076921284,0.0001448738,0.3252834,0.27797648,0.12962885,0.25325364,0.000244738],"about_ca_topic_score_codex":0.00030366456,"about_ca_topic_score_gemma":0.0007097929,"teacher_disagreement_score":0.009820722,"about_ca_system_score_codex":0.00040798768,"about_ca_system_score_gemma":0.00072379486,"threshold_uncertainty_score":0.032853603},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09133702,0.0004637609,0.8883896,0.0011751421,0.00010816778,0.00022872118,0.0001273562,0.0021317923,0.016038418],"genre_scores_gemma":[0.36566448,0.00037856138,0.626445,0.0002207672,0.0000684669,0.00022529949,0.00021339045,0.00012565471,0.0066584144],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999495,0.000101725236,0.000028472046,0.00012173058,0.00016248394,0.00009052903],"domain_scores_gemma":[0.99967194,0.00014349588,0.00003154646,0.00009024738,0.000035970304,0.000026806118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004527923,0.0005881826,0.0005850443,0.00037912137,0.00086417835,0.0013221627,0.0013553611,0.0010312707,0.008579785],"category_scores_gemma":[0.0014620356,0.00040807461,0.0005763697,0.0005111719,0.0007268626,0.0032945997,0.0013766827,0.0009719581,0.0013417144],"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.0008801888,0.0007268347,0.0016148287,0.00078841613,0.00014758257,0.00040184517,0.00049989717,0.101609945,0.08029488,0.37116763,0.017715756,0.42415214],"study_design_scores_gemma":[0.00055006763,0.00038333653,0.00046814754,0.00007844591,0.00007546839,0.00030566292,0.00016477778,0.7847406,0.029773124,0.16858517,0.014794479,0.00008074455],"about_ca_topic_score_codex":0.001542731,"about_ca_topic_score_gemma":0.0032778115,"teacher_disagreement_score":0.008579785,"about_ca_system_score_codex":0.0011290567,"about_ca_system_score_gemma":0.001837235,"threshold_uncertainty_score":0.028702259},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02893396,0.0065419697,0.8759085,0.0020830892,0.0010139771,0.00023328904,0.00023369052,0.002148896,0.08290261],"genre_scores_gemma":[0.5615221,0.009596285,0.33788246,0.0010273955,0.0016399862,0.00074504357,0.00051629805,0.0010896397,0.085980855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986066,0.00026823647,0.00009838466,0.00016634451,0.00073845877,0.00012203403],"domain_scores_gemma":[0.9968065,0.0018135785,0.00020152774,0.00084956136,0.00022924172,0.00009957574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011755599,0.0010691783,0.0007612986,0.0010101406,0.00074156706,0.0018677055,0.0010626379,0.0011749319,0.008767046],"category_scores_gemma":[0.005126479,0.0007567338,0.00050551054,0.0012368065,0.0021274246,0.008144607,0.0021088447,0.0031714826,0.00569884],"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.0003805762,0.00007329952,0.00012541821,0.00057533593,0.000037832106,0.00010391905,0.0001949181,0.0050171427,0.038328826,0.7921217,0.008871463,0.15416951],"study_design_scores_gemma":[0.00014862992,0.00020680117,0.00018160674,0.00012865792,0.000058506164,0.00065887714,0.000034924902,0.01642624,0.054171905,0.835327,0.09259758,0.000059180355],"about_ca_topic_score_codex":0.00003712661,"about_ca_topic_score_gemma":0.00006551816,"teacher_disagreement_score":0.008767046,"about_ca_system_score_codex":0.00075651146,"about_ca_system_score_gemma":0.00060973223,"threshold_uncertainty_score":0.029328644},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33932257,0.0025339297,0.3446432,0.00560432,0.0004643263,0.00016266279,0.00020790192,0.00048727388,0.3065738],"genre_scores_gemma":[0.9668764,0.00091877545,0.008006113,0.00019142652,0.00025799277,0.00004478819,0.0000690625,0.000067270186,0.023568276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987325,0.00025675228,0.000030017596,0.000110111876,0.00057253597,0.00029808166],"domain_scores_gemma":[0.99787426,0.00086470845,0.00028196772,0.0004890646,0.00032367648,0.0001663559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013390235,0.0008415177,0.00079732994,0.0018822128,0.0016890182,0.0027075296,0.0013472454,0.0017886576,0.010286383],"category_scores_gemma":[0.005341158,0.00031548474,0.00076815276,0.001356206,0.0033614042,0.0053827064,0.0020502175,0.0026564253,0.0010415943],"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.000049744667,0.000018991375,0.00018778973,0.000017725693,0.0000057862894,0.00005125472,0.00006252502,0.00680263,0.0006303867,0.9872543,0.0008524789,0.004066352],"study_design_scores_gemma":[0.000019551007,0.000031908006,0.00034054066,0.000024808043,0.000012065732,0.0001380372,0.00006695362,0.13551813,0.0011205166,0.85931474,0.0033921886,0.000020641572],"about_ca_topic_score_codex":0.0012347597,"about_ca_topic_score_gemma":0.00083727186,"teacher_disagreement_score":0.010286383,"about_ca_system_score_codex":0.0024931736,"about_ca_system_score_gemma":0.0013821252,"threshold_uncertainty_score":0.03441143},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02331267,0.013828417,0.81196934,0.0044937693,0.0022782655,0.00043892668,0.00019166402,0.001387851,0.14209908],"genre_scores_gemma":[0.24544758,0.02356447,0.6456616,0.0010029521,0.0012802209,0.0003606562,0.00038073506,0.0006144577,0.08168728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899477,0.00022239801,0.00005688507,0.000104073646,0.00053208193,0.00008972882],"domain_scores_gemma":[0.99881685,0.00049160875,0.00004024661,0.00023424305,0.0003540898,0.00006293465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015387476,0.00096953905,0.00059778104,0.0014963484,0.0010235055,0.0023384898,0.00103818,0.0011335284,0.007096284],"category_scores_gemma":[0.004083458,0.00078106276,0.000640194,0.0011682793,0.0017278,0.0070303692,0.0021158273,0.0034875283,0.0025076284],"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.000094384704,0.000056489902,0.00018815356,0.00021132594,0.000014781086,0.00014004605,0.0001906338,0.008663602,0.0046762577,0.83420146,0.007188797,0.14437407],"study_design_scores_gemma":[0.000097788296,0.00023419187,0.00025782836,0.0004242734,0.00003267822,0.0009110297,0.00008246782,0.07578864,0.019158833,0.6477087,0.25523084,0.00007275275],"about_ca_topic_score_codex":0.0006865021,"about_ca_topic_score_gemma":0.0005357317,"teacher_disagreement_score":0.007096284,"about_ca_system_score_codex":0.0013780186,"about_ca_system_score_gemma":0.0013660607,"threshold_uncertainty_score":0.023739457},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06480435,0.0034392315,0.7788751,0.001939767,0.0008971874,0.00013355163,0.00021093778,0.0011627887,0.1485371],"genre_scores_gemma":[0.81363446,0.0030047968,0.1301015,0.0007015361,0.0008412374,0.00018870858,0.00029983345,0.00039267377,0.05083515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819213,0.00045284172,0.00008449179,0.0001624573,0.0008295107,0.00027859182],"domain_scores_gemma":[0.99878436,0.00039489346,0.00010213274,0.0004897344,0.00018089404,0.00004806114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011044308,0.0011112748,0.0010427659,0.0014032351,0.0012476887,0.0028169507,0.0013880004,0.0018487348,0.006553853],"category_scores_gemma":[0.0027773515,0.00066433364,0.0008223096,0.00225145,0.0022947174,0.0050251395,0.0036221275,0.0037757813,0.0026476434],"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.00014332049,0.00003420144,0.000097257696,0.0000644465,0.000016309055,0.00013600364,0.00011216894,0.0043143895,0.0033701654,0.94389284,0.004385571,0.04343326],"study_design_scores_gemma":[0.000027249773,0.000050309594,0.00008486397,0.000041687676,0.000028605955,0.0003823044,0.000038785216,0.02440494,0.005541983,0.9552477,0.014120188,0.000031360618],"about_ca_topic_score_codex":0.00012636199,"about_ca_topic_score_gemma":0.00013941895,"teacher_disagreement_score":0.006553853,"about_ca_system_score_codex":0.0006755579,"about_ca_system_score_gemma":0.00063420675,"threshold_uncertainty_score":0.021924853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5539849,0.005934494,0.37977308,0.005623059,0.0007669164,0.00022773584,0.0010389845,0.0032273547,0.04942346],"genre_scores_gemma":[0.87500143,0.00056940864,0.11953305,0.00047130868,0.00034336658,0.000107676264,0.0004653179,0.00031493107,0.0031935524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99364626,0.001166799,0.00045818987,0.0012334555,0.0021429285,0.0013524527],"domain_scores_gemma":[0.9833308,0.009472914,0.0013826756,0.0036949741,0.0014237489,0.0006948764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044133053,0.0011120627,0.0024983683,0.0018231624,0.0014019848,0.0038913242,0.0031719708,0.0020848599,0.007702525],"category_scores_gemma":[0.029746657,0.0006202656,0.0008141199,0.001617332,0.0018962169,0.009558821,0.003138174,0.0022345134,0.0021977862],"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.0099569345,0.0007545996,0.0133879855,0.0014531582,0.00035106196,0.0012387133,0.0006936667,0.17484064,0.08015625,0.39796516,0.028372541,0.29082933],"study_design_scores_gemma":[0.0005013063,0.0011296507,0.0028061878,0.00024456836,0.00021938988,0.0023172058,0.00038861408,0.5251149,0.045016356,0.40071073,0.021397455,0.00015369456],"about_ca_topic_score_codex":0.00050544256,"about_ca_topic_score_gemma":0.0008784228,"teacher_disagreement_score":0.007702525,"about_ca_system_score_codex":0.0025685313,"about_ca_system_score_gemma":0.001803732,"threshold_uncertainty_score":0.025767505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09662198,0.00048380563,0.859505,0.00043683444,0.0003851056,0.0002463569,0.00035956228,0.0067898016,0.035171587],"genre_scores_gemma":[0.5247477,0.00027342953,0.45880574,0.0002763193,0.0001324394,0.00017050601,0.00037400392,0.00013048187,0.015089343],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998778,0.000015648668,0.00001170041,0.000024321229,0.000049756654,0.000020769667],"domain_scores_gemma":[0.999851,0.000024485998,0.000016167796,0.000035073368,0.000057153167,0.000015962361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012574633,0.00029565507,0.0002790837,0.00033598117,0.00032521345,0.00058197515,0.0008065373,0.00038860552,0.009245893],"category_scores_gemma":[0.0004592319,0.00018894854,0.00024010682,0.0003381707,0.00016471327,0.00050097174,0.0002552312,0.00027674803,0.0026929753],"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.0007243178,0.00020406954,0.0018476717,0.00041977986,0.00010064882,0.0014466648,0.00017977157,0.028223759,0.46925977,0.044347465,0.014120994,0.43912506],"study_design_scores_gemma":[0.0003030123,0.0022922663,0.0036112675,0.00008906005,0.0001725587,0.0055305767,0.00008594744,0.38492122,0.4858306,0.009525762,0.10753472,0.00010302162],"about_ca_topic_score_codex":0.0007526363,"about_ca_topic_score_gemma":0.0008269429,"teacher_disagreement_score":0.009245893,"about_ca_system_score_codex":0.00030593053,"about_ca_system_score_gemma":0.00044933727,"threshold_uncertainty_score":0.030930638},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73416835,0.0017345359,0.23612109,0.0008823215,0.0000776139,0.0001469012,0.0001130931,0.0011912402,0.025564859],"genre_scores_gemma":[0.981079,0.00038692486,0.01476678,0.000042753527,0.000058164813,0.000023600294,0.000050288985,0.00009404462,0.0034984462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99852234,0.0003231037,0.00006695141,0.00014700677,0.0007028198,0.00023784194],"domain_scores_gemma":[0.992214,0.0051447283,0.00062252546,0.0013761686,0.0005273391,0.00011531976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015940883,0.0009197491,0.00070027256,0.0016919031,0.0005157315,0.0016760526,0.0008998489,0.0011007766,0.0048803687],"category_scores_gemma":[0.010055672,0.00038206493,0.0007328532,0.000993511,0.0014025551,0.003126254,0.00098714,0.0011853408,0.0006872087],"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.0032296844,0.00054644624,0.0051245145,0.00040042587,0.0002182755,0.0007609419,0.00051645044,0.44267896,0.09441552,0.25133282,0.0036548031,0.19712114],"study_design_scores_gemma":[0.000064228836,0.00042389744,0.00068444083,0.000028148754,0.000089271365,0.00049278076,0.000069962596,0.93238246,0.023860933,0.040624563,0.0012544416,0.000024877367],"about_ca_topic_score_codex":0.00018966803,"about_ca_topic_score_gemma":0.00024081844,"teacher_disagreement_score":0.0048803687,"about_ca_system_score_codex":0.00092768454,"about_ca_system_score_gemma":0.00056809484,"threshold_uncertainty_score":0.016326487},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17923808,0.0031935365,0.6904569,0.0016205718,0.0014332536,0.0011460634,0.00086508784,0.009362947,0.11268351],"genre_scores_gemma":[0.5696784,0.00077617797,0.37829122,0.0005899821,0.00024125665,0.00036916335,0.0007244381,0.00025603359,0.049073283],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99982303,0.000023271186,0.000013658263,0.00003203541,0.00008109834,0.000026987094],"domain_scores_gemma":[0.9998369,0.000025614681,0.00001948822,0.00004077871,0.00006098197,0.000016136146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020289446,0.00045238485,0.00022693753,0.00048404856,0.00048850535,0.0005097429,0.00065989944,0.0005038055,0.016157867],"category_scores_gemma":[0.0005127396,0.0002487748,0.00023890291,0.0004354095,0.00016498331,0.0008769175,0.00035988583,0.00047682598,0.005281998],"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.00053530495,0.00019805208,0.0013585225,0.00056677515,0.00008025758,0.0007527457,0.00012685575,0.0048518186,0.51932925,0.041066475,0.02294785,0.40818614],"study_design_scores_gemma":[0.0003544762,0.0026810921,0.0046225376,0.00021091508,0.00020491378,0.0063047046,0.00008388954,0.06578503,0.54863125,0.009759007,0.36120695,0.00015531441],"about_ca_topic_score_codex":0.0002175573,"about_ca_topic_score_gemma":0.0005605894,"teacher_disagreement_score":0.016157867,"about_ca_system_score_codex":0.00038488104,"about_ca_system_score_gemma":0.0005934502,"threshold_uncertainty_score":0.054053426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065097,0.00034665226,0.9063109,0.00020357444,0.00016026678,0.000087474655,0.00010874837,0.007545729,0.020139646],"genre_scores_gemma":[0.53149194,0.00028486078,0.45987615,0.00014857647,0.00009992919,0.000086236156,0.00029818912,0.0001556906,0.0075585223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961734,0.00006960978,0.000039708706,0.000060413975,0.00014701283,0.00006589767],"domain_scores_gemma":[0.9996389,0.000116154035,0.000032960244,0.00011183588,0.000078911435,0.000021219108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043030802,0.00041814227,0.00041805935,0.0005653802,0.00035536016,0.0011267365,0.0009427992,0.00041658522,0.0066119717],"category_scores_gemma":[0.0013061564,0.00019870038,0.00044625453,0.0005878617,0.00041022568,0.0010485027,0.00052129285,0.00048919406,0.0020681117],"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.0008889636,0.00016728931,0.0013245979,0.00035855925,0.00006995144,0.0006238552,0.00032452462,0.036272652,0.19628529,0.13208286,0.0078762425,0.62372535],"study_design_scores_gemma":[0.00019727378,0.0009599299,0.0016898907,0.000103558734,0.00010490264,0.0018458394,0.00012196954,0.45611092,0.44555223,0.030401433,0.06281434,0.000097791766],"about_ca_topic_score_codex":0.0006959312,"about_ca_topic_score_gemma":0.0008242107,"teacher_disagreement_score":0.0066119717,"about_ca_system_score_codex":0.00060901116,"about_ca_system_score_gemma":0.0007387284,"threshold_uncertainty_score":0.022119224},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50125164,0.0014412054,0.3807416,0.0017377376,0.0008758191,0.00042492515,0.0011034983,0.020283021,0.09214054],"genre_scores_gemma":[0.797079,0.0004474003,0.17454939,0.000364379,0.0002909047,0.00024151347,0.0015378589,0.0018082411,0.023681255],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977017,0.00044217016,0.00012207539,0.00042994725,0.0006871841,0.0006169006],"domain_scores_gemma":[0.9967353,0.0014379625,0.00015061852,0.0012576018,0.00024457663,0.00017393932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011124102,0.002154202,0.002054249,0.0015641721,0.0017033225,0.0042109885,0.0021182469,0.0015865958,0.023082042],"category_scores_gemma":[0.0053882156,0.001093905,0.001782428,0.0026800488,0.0021781817,0.009580117,0.0056472477,0.0030026655,0.0069516613],"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.0032222779,0.0004665414,0.0044542216,0.0009492723,0.00025308607,0.0009637777,0.001952711,0.06891365,0.039634712,0.3430408,0.054083277,0.48206568],"study_design_scores_gemma":[0.0004218164,0.0004421671,0.0011670946,0.00016636642,0.00017619485,0.00046384078,0.0006240041,0.20143284,0.043112043,0.7161476,0.035718452,0.00012764029],"about_ca_topic_score_codex":0.0014402672,"about_ca_topic_score_gemma":0.0030099356,"teacher_disagreement_score":0.023082042,"about_ca_system_score_codex":0.0019083241,"about_ca_system_score_gemma":0.0018623493,"threshold_uncertainty_score":0.07721716},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010744571,0.015541657,0.06909044,0.0014934163,0.0016997923,0.0001806739,0.00088286976,0.0034508011,0.9065859],"genre_scores_gemma":[0.0039852266,0.008141372,0.01759308,0.0005398201,0.00054432853,0.00007360814,0.0007977507,0.00054595264,0.9677788],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956197,0.000033911412,0.000016067821,0.000053392483,0.00029741452,0.00003716517],"domain_scores_gemma":[0.9994727,0.00012555193,0.000023642804,0.00011303613,0.00021406429,0.000051110997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004060049,0.001634205,0.0013158927,0.0024441818,0.0008659158,0.002019279,0.0011218244,0.0011263415,0.14855683],"category_scores_gemma":[0.0012910671,0.0007937662,0.00042502314,0.0023482733,0.000741331,0.0037532877,0.0012918297,0.002740267,0.1604571],"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.000025042264,0.00008090182,0.00011018806,0.0002714381,0.000009068011,0.000080305384,0.000113795584,0.0011010597,0.0017877129,0.053318493,0.48584795,0.45725405],"study_design_scores_gemma":[0.000007226415,0.00002212863,0.00014421479,0.00013735505,0.000005102196,0.0002663065,0.000020761752,0.0007323594,0.0007537016,0.023816956,0.9740825,0.000011317234],"about_ca_topic_score_codex":0.00074185466,"about_ca_topic_score_gemma":0.002037088,"teacher_disagreement_score":0.14855683,"about_ca_system_score_codex":0.00096447364,"about_ca_system_score_gemma":0.0012295066,"threshold_uncertainty_score":0.49697208},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06570797,0.00065310986,0.910776,0.0006302491,0.00034558866,0.00017884819,0.00022566419,0.0022637364,0.019218896],"genre_scores_gemma":[0.3790936,0.00041454352,0.6051945,0.000271127,0.00022281954,0.00022968222,0.0006099375,0.00037300115,0.0135907885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988778,0.00018701433,0.000079095524,0.00025254532,0.00045934523,0.00014420193],"domain_scores_gemma":[0.9989312,0.00034619062,0.000067412606,0.00036487944,0.00021090472,0.00007935688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079990976,0.0009789566,0.0012580857,0.0014284776,0.001620991,0.0027462689,0.001783977,0.001662788,0.010354486],"category_scores_gemma":[0.0026141452,0.00056641205,0.00091824564,0.002302303,0.0016598627,0.0044195135,0.0033329749,0.0019686157,0.0026028648],"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.0005944036,0.00023290757,0.0009764374,0.0002577543,0.000107238375,0.0001439902,0.00040960917,0.02188175,0.019653428,0.48754928,0.011877736,0.45631558],"study_design_scores_gemma":[0.0002616438,0.00022781141,0.0006633083,0.000075525,0.0000776578,0.00024166524,0.00022831929,0.20302439,0.01721979,0.7605177,0.017372578,0.000089447276],"about_ca_topic_score_codex":0.0010662611,"about_ca_topic_score_gemma":0.001822136,"teacher_disagreement_score":0.010354486,"about_ca_system_score_codex":0.0013110616,"about_ca_system_score_gemma":0.0013767522,"threshold_uncertainty_score":0.03463924},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20381738,0.0018515066,0.7300204,0.0009028274,0.00095267314,0.00027468824,0.0007387658,0.013978802,0.047462925],"genre_scores_gemma":[0.7871326,0.00035053946,0.19086058,0.00026317316,0.00021307004,0.00010032939,0.00079322275,0.00068385823,0.01960252],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970907,0.0005970203,0.00017250127,0.00039749805,0.0012943884,0.00044782698],"domain_scores_gemma":[0.9955765,0.0011430053,0.00018781591,0.002021051,0.0009564877,0.00011516903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013417803,0.000941298,0.000990264,0.0010335678,0.0007068282,0.0018696685,0.0013023168,0.0010584565,0.012672924],"category_scores_gemma":[0.0035974137,0.00050396856,0.00081889005,0.0008542801,0.0010457211,0.00300528,0.0026548163,0.0014990182,0.004452736],"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.0034998618,0.0003082936,0.0018419194,0.00051232515,0.00010896958,0.00055919314,0.00032335523,0.040684137,0.15903427,0.21510081,0.02174373,0.5562832],"study_design_scores_gemma":[0.0004642455,0.00064878515,0.0014895308,0.00014140828,0.00010916051,0.0012135379,0.00012534294,0.38995728,0.34575796,0.20296182,0.057033256,0.000097748816],"about_ca_topic_score_codex":0.0005570331,"about_ca_topic_score_gemma":0.0010145482,"teacher_disagreement_score":0.012672924,"about_ca_system_score_codex":0.0010953523,"about_ca_system_score_gemma":0.0015245054,"threshold_uncertainty_score":0.042395175},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12703945,0.0004178086,0.85812,0.00017310081,0.00011143596,0.000063194544,0.00010732177,0.0011537715,0.012813891],"genre_scores_gemma":[0.6209784,0.0003435602,0.3737144,0.000053556643,0.000102705904,0.000039323,0.0003049253,0.0000807405,0.004382417],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974936,0.000049139293,0.000020351426,0.000039547995,0.00011891318,0.000022660655],"domain_scores_gemma":[0.9996418,0.0001552252,0.000036353355,0.00006936224,0.000080153804,0.000017059758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030357047,0.00034967318,0.00038376692,0.0006994632,0.00024955234,0.0009031172,0.00042049002,0.00028272544,0.004014255],"category_scores_gemma":[0.0014737297,0.00014824049,0.00025230457,0.0006383291,0.000495166,0.0014053027,0.00047399732,0.0003784901,0.00089625805],"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.0007292028,0.00011680281,0.0021231223,0.00034830262,0.00004867756,0.0008221879,0.00032406542,0.12664,0.13407077,0.30174196,0.004398532,0.42863643],"study_design_scores_gemma":[0.000127742,0.00040270988,0.0010789828,0.000038007438,0.000026032476,0.0007525276,0.0000817357,0.7635132,0.11359233,0.09953244,0.020802278,0.000051992236],"about_ca_topic_score_codex":0.0002961095,"about_ca_topic_score_gemma":0.00045357426,"teacher_disagreement_score":0.004014255,"about_ca_system_score_codex":0.00045990243,"about_ca_system_score_gemma":0.0004284512,"threshold_uncertainty_score":0.013429046},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40945086,0.0010916163,0.5733317,0.00020877688,0.00017209636,0.000138977,0.00014410423,0.0014330776,0.014028793],"genre_scores_gemma":[0.77758193,0.00033018825,0.21472485,0.000063255306,0.000041239637,0.000069129615,0.00017502716,0.000035631467,0.0069787386],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998301,0.000027896607,0.000013737026,0.00003083841,0.00007177062,0.000025620076],"domain_scores_gemma":[0.99978036,0.000044355158,0.000029684566,0.000050478153,0.00007761046,0.000017598564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021057484,0.00030076542,0.00024747674,0.00045037438,0.00026891657,0.0005742854,0.0006208183,0.0002701323,0.0027125643],"category_scores_gemma":[0.0004529436,0.00014283498,0.0002298823,0.0005276888,0.00024333864,0.0008145533,0.0003693908,0.0003933719,0.0008760889],"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.0011883723,0.00023188736,0.0019850614,0.0003951352,0.00007751647,0.00047970138,0.00024897655,0.034754172,0.46754557,0.10706698,0.0033760802,0.38265052],"study_design_scores_gemma":[0.00026745116,0.0021854066,0.0033154136,0.00008734643,0.000106394764,0.0018819085,0.0001322205,0.43339542,0.48098654,0.037180323,0.040347088,0.00011448222],"about_ca_topic_score_codex":0.00034832387,"about_ca_topic_score_gemma":0.0007944139,"teacher_disagreement_score":0.0027125643,"about_ca_system_score_codex":0.00042048682,"about_ca_system_score_gemma":0.00042325445,"threshold_uncertainty_score":0.00907445},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13140255,0.0015208176,0.8523473,0.00028836456,0.00022980913,0.0002388828,0.00025782728,0.0030145263,0.010699957],"genre_scores_gemma":[0.5239708,0.0004882558,0.46946448,0.00007005928,0.00007481935,0.00014563836,0.00035201336,0.0001169493,0.0053170156],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995358,0.0000918924,0.00006087901,0.0000757,0.00019180315,0.00004395384],"domain_scores_gemma":[0.9995516,0.000105945845,0.000061145416,0.00015936374,0.00008829932,0.000033645938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043318636,0.00038439137,0.00046506294,0.000801333,0.000735062,0.001244154,0.00058180734,0.0003970138,0.0046835425],"category_scores_gemma":[0.0012348937,0.00014357385,0.00022143518,0.001119791,0.000489876,0.0016952164,0.0010372561,0.00043740944,0.0016294043],"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.0014631996,0.00013065507,0.0016880437,0.0004988516,0.00005708555,0.0003601912,0.0003412154,0.038264614,0.096478544,0.3394685,0.008875258,0.51237386],"study_design_scores_gemma":[0.00037816897,0.0008067409,0.0014527638,0.0001338609,0.00009310066,0.0023668562,0.00021104855,0.5317115,0.19030532,0.19465147,0.07773189,0.00015725118],"about_ca_topic_score_codex":0.00029561308,"about_ca_topic_score_gemma":0.00046074708,"teacher_disagreement_score":0.0046835425,"about_ca_system_score_codex":0.00065149355,"about_ca_system_score_gemma":0.00064188574,"threshold_uncertainty_score":0.015668035},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7847854,0.00038009515,0.21011138,0.00074362196,0.000025048103,0.00010483036,0.00015911866,0.0006510496,0.0030394245],"genre_scores_gemma":[0.9868716,0.00006124802,0.012469419,0.000039476075,0.00002860599,0.00005274746,0.00012719528,0.000046685906,0.00030306427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98747057,0.0049097193,0.00053456676,0.0019055903,0.003798526,0.0013810042],"domain_scores_gemma":[0.82536185,0.14115512,0.00997118,0.015267244,0.0055702194,0.0026743799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016255142,0.0008203803,0.002195884,0.0030712998,0.0013230167,0.003056151,0.0036190196,0.0021468308,0.0029205421],"category_scores_gemma":[0.10660886,0.00063381036,0.0009230562,0.0017372585,0.0057047764,0.0068630916,0.0021493705,0.0019622114,0.0003147151],"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.0027502996,0.0004677791,0.05637646,0.00027922002,0.00041477446,0.0006884384,0.0005580416,0.42526478,0.019499272,0.43505177,0.0020838326,0.05656538],"study_design_scores_gemma":[0.00007310193,0.00021443436,0.00334151,0.000020613174,0.000032560187,0.00025486434,0.000059714086,0.9053966,0.009090345,0.08111059,0.0003535968,0.000052152893],"about_ca_topic_score_codex":0.0007800296,"about_ca_topic_score_gemma":0.0004963256,"teacher_disagreement_score":0.016255142,"about_ca_system_score_codex":0.003647177,"about_ca_system_score_gemma":0.002443953,"threshold_uncertainty_score":0.08596641},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024068208,0.0012833972,0.9065209,0.0024318043,0.0011563316,0.00009331558,0.00018892396,0.00058965763,0.06366748],"genre_scores_gemma":[0.47959107,0.002664139,0.40335816,0.0014040339,0.0028764773,0.00036654068,0.00055441237,0.001884897,0.107300214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732095,0.0008242827,0.00011201358,0.0003611557,0.0010833772,0.00029829066],"domain_scores_gemma":[0.996956,0.0014703647,0.00019838692,0.0005779881,0.00051783305,0.00027945466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036380047,0.0012522002,0.001754166,0.003045273,0.0024585158,0.00463858,0.0032820827,0.0016602309,0.013949282],"category_scores_gemma":[0.010941285,0.0006046696,0.0025262465,0.0028698877,0.0043489533,0.007999426,0.00530058,0.0053907745,0.003721551],"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.000014959901,0.000017087104,0.00009670687,0.000048599497,0.000011819267,0.00005005807,0.00008390956,0.0016714988,0.00028494323,0.9897002,0.0019839262,0.006036297],"study_design_scores_gemma":[0.000020052126,0.000018612409,0.000076435346,0.00002022187,0.000015219382,0.00006279502,0.000034038847,0.050688807,0.0005311603,0.941165,0.0073471726,0.000020484977],"about_ca_topic_score_codex":0.003232784,"about_ca_topic_score_gemma":0.0027800987,"teacher_disagreement_score":0.013949282,"about_ca_system_score_codex":0.0028974847,"about_ca_system_score_gemma":0.0022248917,"threshold_uncertainty_score":0.046664953},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13734697,0.000682038,0.82157457,0.00029681835,0.0003103598,0.0002553756,0.00064041023,0.012547973,0.026345454],"genre_scores_gemma":[0.42096466,0.00041232008,0.5617689,0.00010975417,0.000049026108,0.0001416195,0.0013716781,0.0005798741,0.014602052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978167,0.000028338352,0.000015370386,0.000029527313,0.000112856804,0.000032190637],"domain_scores_gemma":[0.99977654,0.000029836892,0.00001217755,0.00005293805,0.000109769084,0.000018764578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016935002,0.00040738354,0.00038681383,0.0005889115,0.00039793985,0.00066017685,0.0009049821,0.00034423813,0.0056136977],"category_scores_gemma":[0.0008829117,0.00018250316,0.00026413734,0.0008118086,0.00016643156,0.0005961586,0.00033315294,0.00047784296,0.0016264353],"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.0011338645,0.0003248945,0.005710304,0.00030425328,0.00013913406,0.0007214736,0.0003867123,0.046395697,0.24427474,0.0269279,0.028130265,0.64555067],"study_design_scores_gemma":[0.00026855932,0.0005675331,0.0040826113,0.00006507608,0.000050194518,0.0010855835,0.00009498667,0.71760464,0.1741967,0.004041938,0.097870536,0.000071608614],"about_ca_topic_score_codex":0.0033310638,"about_ca_topic_score_gemma":0.004826947,"teacher_disagreement_score":0.0056136977,"about_ca_system_score_codex":0.00043077243,"about_ca_system_score_gemma":0.00082013605,"threshold_uncertainty_score":0.018779635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0244798,0.00063753634,0.9647118,0.00020354481,0.00019807645,0.00015679347,0.00002610447,0.0006413425,0.008944952],"genre_scores_gemma":[0.32280433,0.00097296934,0.66736376,0.0002952245,0.0003075003,0.0002004023,0.00017918981,0.00023038563,0.007646267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992544,0.00016081677,0.000089612215,0.00016528659,0.00024316511,0.000086825814],"domain_scores_gemma":[0.9992588,0.0001994006,0.00006797528,0.00034118714,0.00010822299,0.000024232433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081482343,0.000969237,0.00064619863,0.0010596698,0.0005774455,0.0012042159,0.0010576104,0.0008157421,0.0038485683],"category_scores_gemma":[0.0020091801,0.00036162988,0.00097506883,0.0008993547,0.0009534949,0.0034918694,0.0014042879,0.0019225175,0.0012699733],"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.0006109782,0.0001627872,0.00097629015,0.0005440871,0.000103819206,0.0005359321,0.0005882263,0.021515992,0.11605246,0.49678183,0.0033638468,0.3587638],"study_design_scores_gemma":[0.0002410884,0.0012847502,0.0012773052,0.00026685087,0.00022074139,0.0037139312,0.00017699538,0.292417,0.24082448,0.30015406,0.15920167,0.00022114637],"about_ca_topic_score_codex":0.0001976622,"about_ca_topic_score_gemma":0.0003097476,"teacher_disagreement_score":0.0038485683,"about_ca_system_score_codex":0.0004965989,"about_ca_system_score_gemma":0.00043345857,"threshold_uncertainty_score":0.012874782},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5283855,0.0020214568,0.3505675,0.002017019,0.0019636066,0.00017547476,0.00013449653,0.0011636802,0.11357129],"genre_scores_gemma":[0.9268255,0.0013026386,0.047593683,0.0003585917,0.0005213634,0.00006872162,0.00010603166,0.00036714572,0.022856178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909365,0.0002666229,0.00006776845,0.00014741134,0.00023027313,0.00019436746],"domain_scores_gemma":[0.99912757,0.00024751006,0.000096495976,0.00027799417,0.00013291185,0.00011750803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014970332,0.0012578999,0.0008595998,0.002954131,0.0013950599,0.0032063413,0.000903873,0.0011508595,0.008087191],"category_scores_gemma":[0.0031942239,0.0005120448,0.0011920506,0.001811572,0.002904627,0.005017273,0.004010425,0.002403716,0.00223578],"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.00023576307,0.00006592592,0.0005139006,0.00006716884,0.000020031606,0.0003809168,0.0006170361,0.00292228,0.0035581924,0.95051926,0.0015511279,0.03954828],"study_design_scores_gemma":[0.000058693895,0.00014185275,0.00037103787,0.000071288065,0.000030003333,0.00032628514,0.00030607282,0.010011036,0.0056308,0.9696518,0.013354096,0.000047111476],"about_ca_topic_score_codex":0.0003804372,"about_ca_topic_score_gemma":0.00034230243,"teacher_disagreement_score":0.008087191,"about_ca_system_score_codex":0.0010520814,"about_ca_system_score_gemma":0.00036720707,"threshold_uncertainty_score":0.02705431},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08044059,0.38694328,0.027316414,0.033981573,0.0049249353,0.00005058272,0.00043270004,0.00029447253,0.46561545],"genre_scores_gemma":[0.79726446,0.09540613,0.011705523,0.0025133372,0.014345223,0.00009647828,0.00038077126,0.000103244536,0.078184836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994149,0.00020348006,0.000026475693,0.00010087153,0.00018485312,0.00006944869],"domain_scores_gemma":[0.9990416,0.0005687407,0.00011758165,0.00009513448,0.0001189772,0.000057917325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000802683,0.0010429785,0.0011194668,0.0038546603,0.0026202395,0.004684367,0.00073227443,0.0027867986,0.009394973],"category_scores_gemma":[0.0033233108,0.0004419361,0.00034113255,0.0053422297,0.007375828,0.0052340156,0.0015123644,0.005124794,0.0015554746],"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.000015760234,0.0000150577935,0.00008604381,0.00009141105,0.000003586667,0.00002916183,0.00016258616,0.00064460863,0.0001357702,0.98462415,0.0056904284,0.00850151],"study_design_scores_gemma":[0.000011318318,0.000009486961,0.00018714316,0.000037278445,0.000003729745,0.00007812359,0.00006620854,0.00066159846,0.000052900952,0.9769279,0.021954942,0.000009460236],"about_ca_topic_score_codex":0.0045245364,"about_ca_topic_score_gemma":0.0038231048,"teacher_disagreement_score":0.009394973,"about_ca_system_score_codex":0.0034574843,"about_ca_system_score_gemma":0.0013474316,"threshold_uncertainty_score":0.03142929},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22080784,0.050105616,0.4269022,0.012423715,0.0009824936,0.00031573095,0.0003077062,0.0008246909,0.28733003],"genre_scores_gemma":[0.93122274,0.01741169,0.0343028,0.00047009066,0.0009229295,0.00008144233,0.00014843658,0.000056128392,0.015383825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986871,0.00041965125,0.000079464924,0.00012612721,0.000529698,0.00015807015],"domain_scores_gemma":[0.99871457,0.0004450741,0.00020895366,0.00040260743,0.00015315264,0.000075720665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014749476,0.0005254103,0.00038030322,0.0013345642,0.0008967829,0.0033561557,0.0008054172,0.0010645676,0.0049846815],"category_scores_gemma":[0.002508412,0.00032012703,0.00037183307,0.0018576876,0.0031897104,0.006506115,0.0023643472,0.0031789232,0.0012729015],"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.00007810753,0.000021953136,0.00021632406,0.00018447709,0.000009916138,0.00032563152,0.00027945865,0.0058475854,0.006466283,0.9575195,0.0013198471,0.027730962],"study_design_scores_gemma":[0.000035645695,0.00023091132,0.0005994904,0.00029385512,0.00002773438,0.0022184395,0.0004258577,0.023051305,0.024719836,0.79150754,0.1568087,0.00008063337],"about_ca_topic_score_codex":0.00018671808,"about_ca_topic_score_gemma":0.00010422059,"teacher_disagreement_score":0.0049846815,"about_ca_system_score_codex":0.0010715383,"about_ca_system_score_gemma":0.0005967444,"threshold_uncertainty_score":0.016675413},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04472726,0.0012260347,0.9448849,0.0002490337,0.000065116044,0.00015749483,0.0000646778,0.0012463126,0.007379178],"genre_scores_gemma":[0.3596253,0.0012331778,0.63072544,0.00010627206,0.00006022936,0.00021015218,0.0003741551,0.00008996325,0.007575351],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972564,0.00004393872,0.000021375703,0.000034809407,0.00014329232,0.000030981686],"domain_scores_gemma":[0.9998448,0.000018370278,0.000021616846,0.000050944192,0.000055354747,0.000008953882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023530785,0.00043836894,0.0003375619,0.0007455095,0.000364939,0.0005711752,0.00080556294,0.00039566625,0.0023734944],"category_scores_gemma":[0.00044913602,0.00018902477,0.00027144302,0.00091980735,0.00036111727,0.0012176352,0.00062120456,0.0005406417,0.0016794301],"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.00041942776,0.00016470687,0.001250049,0.00038767167,0.00007267656,0.00029938752,0.00021426113,0.05732663,0.30418447,0.12274827,0.0059217657,0.50701064],"study_design_scores_gemma":[0.00022942277,0.0008683985,0.0020307568,0.000119657925,0.00009593087,0.0013700112,0.00014772582,0.5954638,0.25283578,0.05468912,0.092050806,0.00009859317],"about_ca_topic_score_codex":0.0004773244,"about_ca_topic_score_gemma":0.0007326416,"teacher_disagreement_score":0.0023734944,"about_ca_system_score_codex":0.0005036269,"about_ca_system_score_gemma":0.0008476122,"threshold_uncertainty_score":0.007940114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30574468,0.00117891,0.6596864,0.00047955976,0.00036849687,0.00018328673,0.00024954777,0.0024016805,0.029707443],"genre_scores_gemma":[0.6504277,0.000710423,0.32716078,0.00012894958,0.00011172009,0.00008333452,0.00047184536,0.000068931884,0.020836407],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998159,0.000037799804,0.000016179954,0.000028707416,0.00007566982,0.000025758252],"domain_scores_gemma":[0.9997733,0.000045809633,0.000034747747,0.000050850562,0.00007991346,0.000015203275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002274505,0.00045030075,0.00026088444,0.0005334342,0.00025184386,0.0005908605,0.0005299084,0.00026397497,0.005292945],"category_scores_gemma":[0.00063772895,0.00019054791,0.00015348276,0.0005654247,0.00019383576,0.001141576,0.00035196435,0.0003549434,0.0013897609],"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.00091944437,0.0002676463,0.0011258341,0.00039488752,0.00004924513,0.00042710328,0.00016998476,0.029324953,0.1645347,0.13200691,0.007670316,0.66310894],"study_design_scores_gemma":[0.0005874093,0.0019169409,0.0025567147,0.00017282116,0.00012436065,0.0026936643,0.00019220784,0.4618857,0.350687,0.10566317,0.0734127,0.000107324144],"about_ca_topic_score_codex":0.00024889247,"about_ca_topic_score_gemma":0.000971292,"teacher_disagreement_score":0.005292945,"about_ca_system_score_codex":0.0003171778,"about_ca_system_score_gemma":0.00049979007,"threshold_uncertainty_score":0.017706692},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37697288,0.0004804022,0.61187184,0.0016121481,0.00014139795,0.00015013899,0.00039630482,0.0020137825,0.0063612247],"genre_scores_gemma":[0.9197268,0.00018335815,0.076956406,0.00012789857,0.0001543652,0.00006507344,0.0004725666,0.00016187427,0.0021517358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99378806,0.0021018044,0.00021463893,0.00093792286,0.002072693,0.00088475895],"domain_scores_gemma":[0.943629,0.0392896,0.003688375,0.007897872,0.0035127637,0.0019823364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009719581,0.0009666589,0.0014820053,0.0021408154,0.0013417655,0.0022408916,0.0035125278,0.0014474059,0.005332142],"category_scores_gemma":[0.064630106,0.0005239812,0.0010108536,0.0015093402,0.0038316317,0.0063789356,0.0033757652,0.0029749589,0.000782187],"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.005926111,0.000515385,0.03830343,0.00038616126,0.00018433566,0.00053563353,0.0004642556,0.26409507,0.037879195,0.43088078,0.008804319,0.21202536],"study_design_scores_gemma":[0.000120206525,0.00041084108,0.0028659815,0.000027630258,0.000027401806,0.00019349619,0.000083549465,0.82692105,0.02030276,0.1475982,0.0013787675,0.000070124675],"about_ca_topic_score_codex":0.0027553614,"about_ca_topic_score_gemma":0.0019133021,"teacher_disagreement_score":0.009719581,"about_ca_system_score_codex":0.0026432113,"about_ca_system_score_gemma":0.0023673072,"threshold_uncertainty_score":0.051402688},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021706179,0.52423316,0.020295741,0.029807944,0.0064991876,0.00004874079,0.0002775656,0.00025218297,0.3968793],"genre_scores_gemma":[0.52101785,0.2612919,0.010996398,0.0042362446,0.029437575,0.0001542609,0.00038582116,0.0001513247,0.17232862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928695,0.00024936456,0.000030315554,0.00013821282,0.00023040819,0.00006489287],"domain_scores_gemma":[0.9987109,0.0008129312,0.00011086233,0.00012642512,0.00015681326,0.00008213024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079304335,0.0014403646,0.0015845681,0.0035685182,0.0024610208,0.007790062,0.00079298404,0.0029170825,0.013018138],"category_scores_gemma":[0.0036090498,0.0006492495,0.0004282066,0.0054426473,0.0074889446,0.008221007,0.0015798776,0.0050074896,0.0027672236],"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.000013746653,0.000014420706,0.00007290263,0.000103368686,0.000005708329,0.000022233495,0.00017957878,0.00059336575,0.00012541881,0.9711888,0.012644739,0.01503566],"study_design_scores_gemma":[0.000008133358,0.000010955866,0.00013843604,0.0000683272,0.0000050086765,0.000075696335,0.00008291928,0.0006571877,0.000060056533,0.9296853,0.0692007,0.0000072663934],"about_ca_topic_score_codex":0.0016688235,"about_ca_topic_score_gemma":0.0012666652,"teacher_disagreement_score":0.013018138,"about_ca_system_score_codex":0.0037887048,"about_ca_system_score_gemma":0.0012877274,"threshold_uncertainty_score":0.043550014},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61144745,0.0025733677,0.3198905,0.00047552196,0.00046124918,0.0002829853,0.0005650944,0.008417141,0.05588667],"genre_scores_gemma":[0.9211339,0.00034109634,0.06958323,0.0000937583,0.00003971476,0.000052977943,0.0003363808,0.000044172208,0.008374674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990356,0.000012085102,0.0000070753367,0.000017617996,0.00003177515,0.000027871372],"domain_scores_gemma":[0.9999238,0.000014773044,0.000011388442,0.0000146381035,0.000026456328,0.000008821816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000074349904,0.00032253706,0.00015801695,0.00032495096,0.00019130213,0.000330559,0.00051586126,0.00018091041,0.00534017],"category_scores_gemma":[0.00019324486,0.00011343701,0.000110902256,0.00023412355,0.00008854534,0.0003969031,0.00013946748,0.00018273946,0.0010201314],"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.001371762,0.000218696,0.004023661,0.00067614374,0.00012041451,0.0014619533,0.00022684273,0.043986324,0.34474644,0.013548101,0.019159887,0.5704597],"study_design_scores_gemma":[0.00078208157,0.0046528317,0.012048557,0.00018051596,0.00021113774,0.0030868128,0.00027719943,0.40281472,0.4741469,0.005106246,0.09658374,0.00010921013],"about_ca_topic_score_codex":0.0011319881,"about_ca_topic_score_gemma":0.0020498957,"teacher_disagreement_score":0.00534017,"about_ca_system_score_codex":0.000308381,"about_ca_system_score_gemma":0.0003871909,"threshold_uncertainty_score":0.017864585},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6374818,0.03360153,0.16027346,0.015228686,0.0015157309,0.00019483012,0.000904262,0.00064171944,0.15015797],"genre_scores_gemma":[0.98131955,0.0051435656,0.009403494,0.0003993302,0.00091931684,0.000041024326,0.000118622615,0.00005239506,0.0026026736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959514,0.0009065632,0.00023682292,0.0006953683,0.0014927618,0.00071708835],"domain_scores_gemma":[0.983651,0.011263897,0.0010444892,0.002758283,0.0008216606,0.00046075994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038318008,0.0013012622,0.0016838937,0.0029418126,0.0021497193,0.0045238254,0.0012107608,0.0021665,0.004990124],"category_scores_gemma":[0.010374284,0.0007629367,0.0011659674,0.0024704612,0.0062559303,0.009300465,0.0063322904,0.004268338,0.0016139714],"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.0013961698,0.00018606351,0.002520193,0.00037528801,0.0001313119,0.001201349,0.0007432085,0.04222194,0.008569355,0.8885941,0.004825943,0.049235154],"study_design_scores_gemma":[0.000076124,0.00017211771,0.0006118941,0.00018785756,0.000058547368,0.0007305201,0.00012218855,0.032946195,0.004650936,0.9513552,0.009024252,0.00006411543],"about_ca_topic_score_codex":0.00032970984,"about_ca_topic_score_gemma":0.00017839528,"teacher_disagreement_score":0.004990124,"about_ca_system_score_codex":0.0013276652,"about_ca_system_score_gemma":0.0007404834,"threshold_uncertainty_score":0.020264745},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65327287,0.0018079813,0.2685236,0.0033605734,0.00045078117,0.000092434944,0.00036211082,0.00035555917,0.07177402],"genre_scores_gemma":[0.9590013,0.0007303545,0.023909042,0.00020842931,0.0005060533,0.00008617698,0.00034803976,0.00016772763,0.015042784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99516296,0.0015831467,0.00037178874,0.00066317304,0.0014455215,0.0007733815],"domain_scores_gemma":[0.9890065,0.006895589,0.0006728142,0.0011307313,0.0011335418,0.0011606968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044806255,0.00128557,0.0019156811,0.003474519,0.002878827,0.0062935096,0.0020391867,0.0015833472,0.010259597],"category_scores_gemma":[0.014721654,0.00067882997,0.0014590382,0.0034264617,0.0052150646,0.017327087,0.008318563,0.0044999644,0.001364703],"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.000251139,0.000076649114,0.0011061614,0.00013057169,0.000034181667,0.00021777194,0.00038530902,0.007178194,0.0011028596,0.97197694,0.0015408254,0.01599942],"study_design_scores_gemma":[0.000014925864,0.00002430362,0.00019304686,0.000025866997,0.000014758798,0.00018453169,0.00013366966,0.014375361,0.0017107815,0.98172164,0.0015814812,0.00001960247],"about_ca_topic_score_codex":0.00033302818,"about_ca_topic_score_gemma":0.00022552341,"teacher_disagreement_score":0.010259597,"about_ca_system_score_codex":0.0014363197,"about_ca_system_score_gemma":0.0006506866,"threshold_uncertainty_score":0.034321785},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010702077,0.00036548765,0.98304224,0.00012092085,0.00010678445,0.00013457752,0.00008607442,0.0017810899,0.0036606758],"genre_scores_gemma":[0.0959867,0.00044157446,0.89626056,0.00015429912,0.00016562469,0.00038880223,0.00060631265,0.00038571618,0.00561038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975829,0.00038114697,0.00025683906,0.00033186545,0.0011700128,0.00027711186],"domain_scores_gemma":[0.9964797,0.0008467507,0.00030548155,0.001214966,0.0010416314,0.000111436835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013773114,0.0014698915,0.0011078137,0.0026230884,0.0009814388,0.0021093737,0.0021522576,0.00076004025,0.006708456],"category_scores_gemma":[0.0058971765,0.0004463707,0.0013640326,0.0030929614,0.0010651138,0.003858632,0.0024536068,0.0018840948,0.0043375525],"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.000538508,0.00022916248,0.00078133,0.00022853196,0.00005712793,0.00012682981,0.0003198654,0.03137229,0.025878673,0.10931788,0.010266948,0.8208829],"study_design_scores_gemma":[0.00025412423,0.0005250057,0.0006614077,0.00011071383,0.00012216244,0.00075300474,0.00021760765,0.6787943,0.08873454,0.19315524,0.03657375,0.00009810264],"about_ca_topic_score_codex":0.0010112503,"about_ca_topic_score_gemma":0.0016875756,"teacher_disagreement_score":0.006708456,"about_ca_system_score_codex":0.0014786384,"about_ca_system_score_gemma":0.002332803,"threshold_uncertainty_score":0.022441983},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23725827,0.00065484043,0.72490734,0.004308775,0.0002989819,0.00078343897,0.00022531048,0.0016052452,0.02995777],"genre_scores_gemma":[0.8533496,0.0004791488,0.13686548,0.0004009783,0.00016743277,0.00041773432,0.0002569268,0.00024709397,0.007815563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936811,0.0019338593,0.00031512688,0.00076070067,0.0026623502,0.00064697646],"domain_scores_gemma":[0.98928666,0.0044739572,0.0010351859,0.0039563663,0.00084242655,0.00040538234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060920333,0.0007738556,0.0012257501,0.0013122639,0.0015220816,0.0042801714,0.0019093216,0.0024943573,0.007163104],"category_scores_gemma":[0.013796169,0.00085478654,0.00085920474,0.0010117703,0.004641324,0.011248655,0.00584874,0.0061243568,0.0021046214],"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.00046314817,0.00017360804,0.000480804,0.00015896292,0.000031228843,0.00015697976,0.0005107907,0.01529482,0.018083801,0.9488492,0.0019908247,0.01380583],"study_design_scores_gemma":[0.00033115488,0.00027860625,0.0002360508,0.00007470348,0.000047403388,0.0002764144,0.00027437464,0.19646011,0.06737674,0.7211623,0.01339838,0.000083674626],"about_ca_topic_score_codex":0.00027297268,"about_ca_topic_score_gemma":0.00017920251,"teacher_disagreement_score":0.007163104,"about_ca_system_score_codex":0.0016609684,"about_ca_system_score_gemma":0.0014490293,"threshold_uncertainty_score":0.0322181},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23910911,0.0031603219,0.7211959,0.0005847036,0.0006870206,0.00036114335,0.000328407,0.008825411,0.025747953],"genre_scores_gemma":[0.5544578,0.0015030319,0.4179873,0.0002816249,0.00028770114,0.00019570123,0.0016324922,0.00024086381,0.023413476],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997229,0.00003742887,0.00002778932,0.000049079914,0.00011838174,0.000044509987],"domain_scores_gemma":[0.99973863,0.00003587342,0.000023322542,0.000048227503,0.00014050197,0.000013394325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027386655,0.0005677966,0.00035335607,0.0005926602,0.0002921314,0.00048413695,0.0007024608,0.00038799157,0.0057495786],"category_scores_gemma":[0.0006618021,0.0001925766,0.00036240745,0.0005592606,0.00012035892,0.0011124563,0.00036876733,0.0006345483,0.0022256623],"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.0009823504,0.00029234382,0.00211983,0.0004462507,0.000081579514,0.0008106475,0.00018287826,0.019569391,0.34698248,0.01481436,0.0133630205,0.6003549],"study_design_scores_gemma":[0.0005533115,0.0033445447,0.0086404225,0.00015109277,0.0003211303,0.004285563,0.0001525595,0.2609817,0.5032084,0.0095492,0.20862877,0.00018332378],"about_ca_topic_score_codex":0.00043798235,"about_ca_topic_score_gemma":0.0006736831,"teacher_disagreement_score":0.0057495786,"about_ca_system_score_codex":0.00029210266,"about_ca_system_score_gemma":0.00059127284,"threshold_uncertainty_score":0.0192343},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7526323,0.0065951524,0.21722406,0.0012330307,0.00009812879,0.00008644414,0.000073980846,0.001068907,0.02098795],"genre_scores_gemma":[0.988567,0.00045791475,0.010087584,0.000044045122,0.000025538522,0.000012485403,0.0000205791,0.000052420033,0.00073237997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998749,0.0002989406,0.00009101572,0.00013734748,0.00047947807,0.00024427578],"domain_scores_gemma":[0.99480754,0.003430361,0.00042097172,0.00070289406,0.0005371993,0.0001010535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019219258,0.00078590855,0.00050303416,0.00090792245,0.00065219,0.0016322534,0.00076658785,0.000985989,0.0019573923],"category_scores_gemma":[0.007497037,0.00037190533,0.0002722553,0.00088193046,0.0009950058,0.0039032083,0.000949507,0.00082423823,0.00058769895],"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.0025078445,0.00023739446,0.0053942255,0.00055121665,0.000117428644,0.0010026193,0.00037277324,0.3828159,0.3237222,0.10054853,0.0015995149,0.18113042],"study_design_scores_gemma":[0.00021491245,0.0026977998,0.005762426,0.00019810788,0.0001575003,0.0025144843,0.00022600498,0.503348,0.39226845,0.08576496,0.006677803,0.00016955264],"about_ca_topic_score_codex":0.00013175987,"about_ca_topic_score_gemma":0.00021381435,"teacher_disagreement_score":0.0019573923,"about_ca_system_score_codex":0.0005931646,"about_ca_system_score_gemma":0.00031322558,"threshold_uncertainty_score":0.010164201},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31758723,0.0025576341,0.6559572,0.00050349615,0.0004950383,0.00020598888,0.00030601418,0.005168088,0.017219307],"genre_scores_gemma":[0.61180604,0.00044143174,0.3764226,0.00034648555,0.00011793812,0.0000914254,0.0008263938,0.0001040573,0.009843604],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99991584,0.000009948139,0.0000068013974,0.000022383187,0.000029854258,0.000015219602],"domain_scores_gemma":[0.9998958,0.000016502992,0.0000111078525,0.000019101604,0.000046904133,0.000010466067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011731971,0.00025304197,0.00022591252,0.00026818327,0.00020969367,0.00026354016,0.0006618504,0.00030581595,0.0029950507],"category_scores_gemma":[0.00013896423,0.00011791897,0.0001923518,0.00029772703,0.000105888605,0.0005151989,0.00020170205,0.00029813548,0.001197919],"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.000723588,0.00027983295,0.002518231,0.00043044914,0.00006122652,0.00069080875,0.00010830519,0.016031798,0.5124404,0.0081997365,0.0102496995,0.44826594],"study_design_scores_gemma":[0.00036018,0.0039997147,0.010327147,0.000073846546,0.00018772057,0.003882741,0.0000888639,0.30276376,0.56680197,0.0035512608,0.10785413,0.000108687644],"about_ca_topic_score_codex":0.0002485067,"about_ca_topic_score_gemma":0.00046689832,"teacher_disagreement_score":0.0029950507,"about_ca_system_score_codex":0.00018138505,"about_ca_system_score_gemma":0.0003874314,"threshold_uncertainty_score":0.010019422},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022782974,0.0006184782,0.10142625,0.0074760085,0.0046883803,0.0007964908,0.07099235,0.12367897,0.6880448],"genre_scores_gemma":[0.013946114,0.0011411567,0.04647147,0.0039288723,0.0008872209,0.00062201027,0.117084526,0.066317834,0.74960077],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971641,0.00043012228,0.00031390754,0.00048035572,0.0012225491,0.0003888719],"domain_scores_gemma":[0.99343663,0.0010059346,0.00024640746,0.0018214983,0.002909085,0.0005804395],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027933337,0.0030880137,0.0016500998,0.0031703732,0.0025873787,0.010049864,0.004330075,0.0034176838,0.56302935],"category_scores_gemma":[0.011311755,0.001830446,0.0024559363,0.004354234,0.0012057355,0.010671423,0.0045774286,0.0045258836,0.6393183],"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.000179231,0.00009458447,0.0002541281,0.00023030929,0.00001586372,0.00011585836,0.00022164707,0.00039716042,0.0020858713,0.010398322,0.93630487,0.049702127],"study_design_scores_gemma":[0.000026116299,0.00001577139,0.00030389614,0.00006641871,0.000009367669,0.00007381472,0.000087525754,0.0008465951,0.0025258637,0.0023858803,0.9936279,0.000030826624],"about_ca_topic_score_codex":0.03076908,"about_ca_topic_score_gemma":0.027228152,"teacher_disagreement_score":0.56302935,"about_ca_system_score_codex":0.0043530287,"about_ca_system_score_gemma":0.0040626084,"threshold_uncertainty_score":0.6232856},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2452018,0.0026202917,0.70299226,0.002808553,0.00034826514,0.00036452914,0.00069338013,0.0051625674,0.039808277],"genre_scores_gemma":[0.6546388,0.0013686242,0.32544404,0.00034843196,0.00020360522,0.00025077446,0.0013570297,0.0007134345,0.015675252],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969597,0.0005259741,0.00026082018,0.0005721662,0.00096785824,0.00071343686],"domain_scores_gemma":[0.9955556,0.0018804978,0.0003679937,0.0015213792,0.00043968295,0.00023479563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018896429,0.0016873771,0.0016889779,0.0027471727,0.0020183914,0.0060383943,0.002797397,0.0021098715,0.013876928],"category_scores_gemma":[0.008547167,0.0008187457,0.0014709703,0.0033002775,0.0017895688,0.012860272,0.0053636115,0.0028231174,0.0040545594],"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.0017623113,0.00042147774,0.0025837303,0.000541169,0.00015753445,0.0001614654,0.0012683487,0.047612164,0.010072967,0.42724362,0.014993274,0.49318203],"study_design_scores_gemma":[0.00043967328,0.00019860368,0.00046587933,0.00014681846,0.000089727524,0.00025634767,0.0004378408,0.1283109,0.011285382,0.8440465,0.0142527195,0.000069622765],"about_ca_topic_score_codex":0.0015112724,"about_ca_topic_score_gemma":0.0027652227,"teacher_disagreement_score":0.013876928,"about_ca_system_score_codex":0.0031424237,"about_ca_system_score_gemma":0.00285353,"threshold_uncertainty_score":0.0464229},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009863347,0.403908,0.018762859,0.08733559,0.0062057185,0.00010656521,0.00015433568,0.00023269255,0.47343087],"genre_scores_gemma":[0.37876958,0.38710397,0.015154705,0.028807394,0.011379028,0.00021632152,0.00024632516,0.00028785356,0.17803484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99253255,0.002881248,0.00063398364,0.0012069398,0.0021769407,0.00056833343],"domain_scores_gemma":[0.98739225,0.007595218,0.0008238149,0.001445071,0.0021232488,0.0006203037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007064752,0.0007395328,0.0006043841,0.0044540763,0.0035482242,0.01098558,0.001275334,0.0065409043,0.008792472],"category_scores_gemma":[0.009639295,0.00067778246,0.00046534676,0.0054796617,0.022720367,0.016186431,0.0044279573,0.008732327,0.0027223947],"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.000052144325,0.00004318429,0.0006379286,0.00044207595,0.000010475465,0.00016331625,0.0016697915,0.00030359774,0.0003057056,0.8518359,0.021473074,0.12306282],"study_design_scores_gemma":[0.000007923503,0.00008125345,0.0010961366,0.0013720316,0.00001115148,0.00036888433,0.00065903255,0.00035877823,0.0009980939,0.12243326,0.87255496,0.000058508977],"about_ca_topic_score_codex":0.004719937,"about_ca_topic_score_gemma":0.002790765,"teacher_disagreement_score":0.011795221,"about_ca_system_score_codex":0.011795221,"about_ca_system_score_gemma":0.0046620793,"threshold_uncertainty_score":0.08558071},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4219075,0.0007435148,0.55787265,0.00078643457,0.0002159823,0.00012418053,0.00005065705,0.0019889376,0.01631019],"genre_scores_gemma":[0.82828057,0.000508738,0.16642162,0.00016658119,0.00015595548,0.000039122435,0.00006263408,0.0004723501,0.0038923856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988016,0.00024430308,0.00008702052,0.0000953342,0.00060173334,0.00016991398],"domain_scores_gemma":[0.99752575,0.0010619075,0.00027642006,0.0007435485,0.00031869652,0.00007363644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012780939,0.0006075951,0.0006122111,0.00092615886,0.0006924424,0.0018326446,0.0010527049,0.0005326165,0.002776785],"category_scores_gemma":[0.005868409,0.00028614033,0.00048602995,0.00087771367,0.0018366606,0.0032370416,0.002364543,0.0015897539,0.0007513544],"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.00085543166,0.00031630683,0.0045766546,0.00067000516,0.000073752206,0.0008620262,0.0011635901,0.08392339,0.110180676,0.4060605,0.0042404714,0.38707724],"study_design_scores_gemma":[0.00023855714,0.00073425885,0.0017339446,0.00033350362,0.00009968155,0.0012638413,0.00042467547,0.51261693,0.1585572,0.28868428,0.03514216,0.00017099747],"about_ca_topic_score_codex":0.00036774657,"about_ca_topic_score_gemma":0.0005170943,"teacher_disagreement_score":0.002776785,"about_ca_system_score_codex":0.000700074,"about_ca_system_score_gemma":0.0006655783,"threshold_uncertainty_score":0.009289205},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04036542,0.00033628743,0.89722896,0.00029229003,0.0002576048,0.00027434024,0.0003980612,0.04404018,0.016806748],"genre_scores_gemma":[0.30553007,0.00022108364,0.6815389,0.00023890242,0.00015205322,0.0002821417,0.00094238826,0.0019686797,0.00912576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990037,0.000111204194,0.00008652897,0.00020648295,0.00037666023,0.00021534193],"domain_scores_gemma":[0.9992368,0.0001759023,0.00005716231,0.00022808778,0.00023900227,0.00006312729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006859812,0.0011831624,0.00064758834,0.0012725336,0.0009497119,0.0011998289,0.0019013906,0.00057166186,0.012789977],"category_scores_gemma":[0.002008922,0.0004903593,0.000798502,0.0013089154,0.0006758068,0.0020042784,0.0010884586,0.0009404661,0.004788909],"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.002373088,0.00060403615,0.0024384828,0.0005890502,0.00013451738,0.0007162081,0.00047933625,0.02339516,0.12817082,0.056140892,0.047888543,0.7370699],"study_design_scores_gemma":[0.001556145,0.0016775086,0.0017342181,0.0001367975,0.0002589443,0.0020224855,0.00014776914,0.54004955,0.27812126,0.054454178,0.11955814,0.00028296662],"about_ca_topic_score_codex":0.002256753,"about_ca_topic_score_gemma":0.0021481314,"teacher_disagreement_score":0.012789977,"about_ca_system_score_codex":0.0010264076,"about_ca_system_score_gemma":0.0018354466,"threshold_uncertainty_score":0.042786717},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19555461,0.0011169012,0.67212075,0.0009506624,0.000558424,0.00017338674,0.0014535711,0.01403544,0.114036314],"genre_scores_gemma":[0.62021774,0.0005805221,0.3520098,0.00020931308,0.00014126289,0.0001322147,0.0019286879,0.0005505758,0.024229832],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968576,0.00005321476,0.000021794165,0.000048463404,0.00015078989,0.000039961134],"domain_scores_gemma":[0.99952185,0.00007250921,0.000020120528,0.00019435956,0.0001666876,0.000024424819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002320576,0.00046977605,0.00042366763,0.0005448626,0.00039391077,0.00096454064,0.0006900928,0.0003086266,0.012415071],"category_scores_gemma":[0.0012607859,0.00020602233,0.0002942182,0.00096058304,0.00036797416,0.0010495872,0.0007742945,0.0005963453,0.0037724788],"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.0011865073,0.00019749999,0.003167286,0.00038705437,0.0001271126,0.00082721433,0.00040764918,0.098122336,0.16181855,0.19698052,0.071990564,0.46478772],"study_design_scores_gemma":[0.00021021518,0.0002740787,0.0017408257,0.00006507078,0.000041498923,0.0004800307,0.00008450704,0.74319416,0.06915291,0.06774113,0.11697259,0.000043039847],"about_ca_topic_score_codex":0.0017324045,"about_ca_topic_score_gemma":0.0018888923,"teacher_disagreement_score":0.012415071,"about_ca_system_score_codex":0.0005884158,"about_ca_system_score_gemma":0.00056314614,"threshold_uncertainty_score":0.041532576},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20539704,0.00057700713,0.77991724,0.0003635595,0.00034032323,0.000061637,0.000055737943,0.0032290784,0.010058334],"genre_scores_gemma":[0.85541517,0.00029623072,0.13738938,0.00010005995,0.0001413768,0.00004023536,0.000065556174,0.00016958779,0.006382552],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946946,0.00007605925,0.0000366264,0.000068095185,0.00027765523,0.00007216573],"domain_scores_gemma":[0.9989305,0.00027467587,0.00014892295,0.00044107775,0.00015561529,0.000049070204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004002845,0.00034961887,0.00048191744,0.00046568978,0.0004643365,0.00078124175,0.0008708672,0.00037512768,0.002045621],"category_scores_gemma":[0.0017796585,0.00020985908,0.00029584538,0.00048812857,0.00090994284,0.001535823,0.0010581309,0.000756146,0.0006144669],"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.000986503,0.00011087315,0.00059570104,0.00027980734,0.000056237797,0.00075331464,0.00042170627,0.079126544,0.3382802,0.24603637,0.005138845,0.32821396],"study_design_scores_gemma":[0.000110462344,0.0006997366,0.00038489717,0.00003837256,0.000046536792,0.0009686321,0.000088957706,0.4255293,0.45386094,0.09831797,0.019887822,0.000066361936],"about_ca_topic_score_codex":0.00020653645,"about_ca_topic_score_gemma":0.0002711701,"teacher_disagreement_score":0.002045621,"about_ca_system_score_codex":0.00037028847,"about_ca_system_score_gemma":0.00045016964,"threshold_uncertainty_score":0.0068433285},"labels":[],"label_agreement":null},{"id":"W1999613060","doi":"10.1007/s13389-011-0017-8","title":"Speeding scalar multiplication over binary elliptic curves using the new carry-less multiplication instruction","year":2011,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Consejo Nacional de Ciencia y Tecnología; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; University of Waterloo; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Scalar multiplication; Elliptic curve cryptography; Edwards curve; Arithmetic; Elliptic curve; Elliptic curve point multiplication; Parallel computing; Computer science; Binary number; Side channel attack; Multiplication (music); Curve25519; Mathematics; Cryptography; Algorithm; Public-key cryptography; Encryption; Pure mathematics","score_opus":0.026526956020350424,"score_gpt":0.2340954477578505,"score_spread":0.20756849173750005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999613060","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51168084,0.0033029881,0.43964586,0.00078581605,0.0015483533,0.00021649455,0.000319881,0.018128358,0.024371484],"genre_scores_gemma":[0.7783548,0.0008600861,0.20212285,0.0003084203,0.00036661324,0.000071758615,0.00054264045,0.00040658715,0.016966108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958235,0.00003777688,0.000038026217,0.000068257956,0.00020367083,0.00007000164],"domain_scores_gemma":[0.99934155,0.00018922813,0.00006574906,0.00015240634,0.0002021852,0.0000489249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036674074,0.0007677653,0.0004595792,0.0014646902,0.0004040774,0.0009757952,0.0007966347,0.0003726146,0.0055196295],"category_scores_gemma":[0.0011559194,0.00026995747,0.0002785988,0.0010875372,0.00039349473,0.0022959176,0.0006901254,0.0007073649,0.0014662846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015783183,0.0002894888,0.003097178,0.00042887783,0.000063921834,0.0003528764,0.00030477418,0.011509196,0.21308362,0.034935154,0.013545761,0.7208109],"study_design_scores_gemma":[0.0005381539,0.0015647528,0.0042831353,0.00018486907,0.000314541,0.0015790743,0.000155889,0.30717382,0.5636077,0.033864908,0.0864924,0.00024072827],"about_ca_topic_score_codex":0.0008554213,"about_ca_topic_score_gemma":0.0018409069,"teacher_disagreement_score":0.0055196295,"about_ca_system_score_codex":0.00047342858,"about_ca_system_score_gemma":0.00091110496,"threshold_uncertainty_score":0.018464983},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065807596,0.0295845,0.35297662,0.0020210943,0.0034048741,0.00014918158,0.00012473504,0.0007572721,0.5451741],"genre_scores_gemma":[0.6606526,0.015529906,0.22151764,0.0007332928,0.0030333665,0.00016441074,0.00013655357,0.00023568906,0.09799657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994228,0.00015437815,0.000026508644,0.0000856018,0.00023110151,0.00007964734],"domain_scores_gemma":[0.99968123,0.00014494371,0.000022305494,0.00006807552,0.00005504875,0.000028475233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004976502,0.0005325551,0.0003388494,0.0015114292,0.0010647157,0.0013077386,0.00056896027,0.0005658789,0.0067549194],"category_scores_gemma":[0.0015928327,0.00019590263,0.000291043,0.0016601819,0.0020019182,0.0024039152,0.001009976,0.0013061191,0.0014252226],"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.000008429733,0.0000048370634,0.000058832265,0.000047288428,0.0000018416152,0.000046629404,0.00011895341,0.0011537643,0.000574979,0.9606611,0.0016071611,0.035716183],"study_design_scores_gemma":[0.000006474563,0.00003074101,0.00020953103,0.000057878675,0.0000059997446,0.00020072072,0.000058949518,0.008294281,0.0022139808,0.8970678,0.09183474,0.000019021109],"about_ca_topic_score_codex":0.0010668921,"about_ca_topic_score_gemma":0.001311576,"teacher_disagreement_score":0.0067549194,"about_ca_system_score_codex":0.00086208264,"about_ca_system_score_gemma":0.0005485778,"threshold_uncertainty_score":0.022597432},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27744204,0.0014426553,0.68508786,0.00031356944,0.0003965753,0.0002535179,0.00018475823,0.005019018,0.029860077],"genre_scores_gemma":[0.6877916,0.00065991626,0.29614294,0.00010896175,0.00011261748,0.00013356627,0.0005414753,0.00013433235,0.014374594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998073,0.00003108348,0.000021464331,0.00003035776,0.00007242658,0.000037409976],"domain_scores_gemma":[0.99963975,0.000055080494,0.000043735203,0.000081910184,0.00015567215,0.000023832312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019945223,0.00051536807,0.00032499278,0.0007105569,0.00035512075,0.0007223888,0.0006719022,0.00032157538,0.0048856605],"category_scores_gemma":[0.00055996305,0.00019011436,0.00023649089,0.0008196926,0.0002526264,0.0014640794,0.00037302973,0.00054208963,0.0018228474],"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.00081901095,0.00026027008,0.001459934,0.0003695749,0.000066983266,0.0006105452,0.00034177778,0.020728014,0.31444976,0.10341105,0.010059442,0.5474237],"study_design_scores_gemma":[0.00031089914,0.0026332664,0.002975079,0.00012902613,0.00015586216,0.0023774179,0.00029219338,0.35965532,0.43489987,0.07761805,0.118742235,0.00021080751],"about_ca_topic_score_codex":0.000378615,"about_ca_topic_score_gemma":0.0008714304,"teacher_disagreement_score":0.0048856605,"about_ca_system_score_codex":0.00044352867,"about_ca_system_score_gemma":0.00048334844,"threshold_uncertainty_score":0.01634419},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2863517,0.00019044497,0.68734473,0.0004573871,0.00006482797,0.00010877803,0.00032342577,0.00080862764,0.02435009],"genre_scores_gemma":[0.7476827,0.00020714187,0.24385288,0.0001768581,0.000041401592,0.00014802492,0.0005671838,0.00025398645,0.007069782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923086,0.00014610232,0.00009002639,0.0001434033,0.00026353978,0.00012615026],"domain_scores_gemma":[0.998502,0.00045173944,0.0002558723,0.0004573779,0.0002658794,0.00006711217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006303179,0.00032667365,0.00027002234,0.0008871428,0.00063806266,0.0015753717,0.00068083423,0.00053588423,0.0023322904],"category_scores_gemma":[0.0043655834,0.00022562468,0.0004800942,0.0010804541,0.0012923897,0.002839577,0.001568929,0.0010461251,0.00062083633],"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.00016898291,0.000045395638,0.0012452672,0.000075914424,0.000009144247,0.00015515678,0.00038390138,0.005848594,0.017503047,0.8927981,0.0016409772,0.080125414],"study_design_scores_gemma":[0.000058765076,0.00022873022,0.0009861653,0.00009468518,0.00004246849,0.000981944,0.000299079,0.06275261,0.07401829,0.8288905,0.03154909,0.000097641634],"about_ca_topic_score_codex":0.00024588048,"about_ca_topic_score_gemma":0.00031196675,"teacher_disagreement_score":0.0023322904,"about_ca_system_score_codex":0.00070374034,"about_ca_system_score_gemma":0.00076653634,"threshold_uncertainty_score":0.0078023076},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40801284,0.0042090705,0.5219796,0.00053458085,0.00057214213,0.0002605222,0.00037009423,0.004227715,0.05983345],"genre_scores_gemma":[0.83960676,0.0011585802,0.14206998,0.00012049838,0.00009766748,0.000080337544,0.00056618854,0.000117195494,0.016182683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958473,0.00008975732,0.000026345931,0.00003154254,0.00017999265,0.00008757322],"domain_scores_gemma":[0.9997223,0.00008817974,0.00002411031,0.000077461016,0.00007177096,0.00001622394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002922779,0.00062186446,0.00038416206,0.0007626961,0.00041005953,0.0009942345,0.0007463163,0.00032838198,0.008425788],"category_scores_gemma":[0.00068800163,0.00024025932,0.00024990403,0.00073845073,0.00019716981,0.00096515747,0.0004314497,0.00047077506,0.00169684],"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.0019265627,0.00024944442,0.0017609765,0.00055679306,0.00012159234,0.000548062,0.00018281273,0.075984515,0.1655731,0.05276857,0.011648676,0.6886788],"study_design_scores_gemma":[0.00057631166,0.0011897974,0.0030504232,0.00020266736,0.00015199625,0.0012386804,0.00016378837,0.599234,0.3145979,0.018474746,0.06104327,0.00007641052],"about_ca_topic_score_codex":0.0012059658,"about_ca_topic_score_gemma":0.0028546427,"teacher_disagreement_score":0.008425788,"about_ca_system_score_codex":0.00056897895,"about_ca_system_score_gemma":0.00061740924,"threshold_uncertainty_score":0.028187096},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3589025,0.00027893306,0.6244446,0.0008100449,0.00019496228,0.000096885255,0.00011652771,0.0010517011,0.0141038485],"genre_scores_gemma":[0.79611576,0.00023029163,0.19737127,0.000108342254,0.0001840217,0.000116898605,0.00022873453,0.00014987521,0.005494806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836,0.00047413085,0.00013054936,0.00021465734,0.0005418794,0.00027883163],"domain_scores_gemma":[0.9972886,0.0014569337,0.00018067897,0.0003951415,0.0005032016,0.0001753577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001609791,0.00064943853,0.00086070754,0.0021258965,0.0013088083,0.0025112294,0.0008497597,0.00109646,0.004036613],"category_scores_gemma":[0.009849922,0.00030545346,0.00054428563,0.001458829,0.0021704051,0.0049917246,0.0025323238,0.0015341786,0.0016869772],"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.0016735622,0.00024406122,0.0062896637,0.00018271376,0.000061221705,0.0004841449,0.0006998966,0.07835995,0.023830839,0.67857057,0.006235862,0.20336752],"study_design_scores_gemma":[0.00010663698,0.00023609697,0.00095771404,0.000054378426,0.0000292533,0.00027618223,0.00020035107,0.35345918,0.017848238,0.6236094,0.003145527,0.000076996876],"about_ca_topic_score_codex":0.0007447809,"about_ca_topic_score_gemma":0.00086231896,"teacher_disagreement_score":0.004036613,"about_ca_system_score_codex":0.00079408585,"about_ca_system_score_gemma":0.001169509,"threshold_uncertainty_score":0.01350379},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101193175,0.0053927,0.79267645,0.0035279416,0.0021827826,0.00058300537,0.0015439283,0.005478798,0.08742123],"genre_scores_gemma":[0.65768504,0.0028940635,0.29775086,0.00083969935,0.0006410405,0.0002009451,0.0014303322,0.00028771762,0.03827034],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983278,0.00038284666,0.0001380013,0.00027488527,0.00068265875,0.00019377981],"domain_scores_gemma":[0.99785954,0.00035016116,0.000177439,0.0009207763,0.00055554573,0.00013647148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012460598,0.0006536598,0.00071400526,0.0014100496,0.00093650323,0.0025060256,0.0007191659,0.0012580844,0.0064956136],"category_scores_gemma":[0.004145165,0.00022754267,0.0005262443,0.0013969284,0.0010488874,0.0025358952,0.002232151,0.0013686552,0.0054928786],"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.0010244716,0.00016772923,0.0022816842,0.0003333592,0.00006322032,0.00021483954,0.00013713626,0.0094208345,0.03309106,0.30928922,0.014668842,0.62930757],"study_design_scores_gemma":[0.00035446096,0.0009487035,0.0021751355,0.00024961072,0.000110669265,0.003766791,0.00017975082,0.11401324,0.13555747,0.35700104,0.38547945,0.00016374837],"about_ca_topic_score_codex":0.00026642022,"about_ca_topic_score_gemma":0.00021963232,"teacher_disagreement_score":0.0064956136,"about_ca_system_score_codex":0.00065651676,"about_ca_system_score_gemma":0.0018108996,"threshold_uncertainty_score":0.021730006},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08922655,0.0014605771,0.75642097,0.00061778293,0.00028518453,0.0010576193,0.0011065315,0.09701115,0.052813713],"genre_scores_gemma":[0.7493623,0.001109514,0.18073964,0.0006917732,0.00015908964,0.0010224291,0.005720712,0.006410261,0.054784343],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975496,0.00027523816,0.00021651275,0.0001719293,0.0015388607,0.0002477464],"domain_scores_gemma":[0.9968438,0.00041592945,0.0003380094,0.001198411,0.00111675,0.00008715337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014064802,0.0008458509,0.000658865,0.0014834886,0.0006141289,0.0016453195,0.0014639678,0.00084321457,0.0058945767],"category_scores_gemma":[0.004669019,0.00040813224,0.00036298417,0.0007371914,0.0005729044,0.0029425218,0.0015006628,0.0012627166,0.0057836673],"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.0020764398,0.00092857843,0.0073612393,0.0009433967,0.0001754326,0.0015711053,0.00084124896,0.016349066,0.16052131,0.08037315,0.05891903,0.66993994],"study_design_scores_gemma":[0.00023967407,0.000516557,0.0038089438,0.00024473754,0.00012893294,0.0022820372,0.00009799847,0.164148,0.57936513,0.014097014,0.23487616,0.00019478638],"about_ca_topic_score_codex":0.00059099705,"about_ca_topic_score_gemma":0.00049614115,"teacher_disagreement_score":0.0058945767,"about_ca_system_score_codex":0.00082250906,"about_ca_system_score_gemma":0.0013477671,"threshold_uncertainty_score":0.019719303},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5613201,0.002934552,0.37024286,0.00049077306,0.00061522814,0.00031578602,0.00070563436,0.008264077,0.055110898],"genre_scores_gemma":[0.88908845,0.00047125705,0.10099438,0.000106124244,0.00005552344,0.000058699614,0.00047404543,0.00007339964,0.008678171],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99987745,0.0000211075,0.000008050203,0.000017946448,0.00004066215,0.0000346789],"domain_scores_gemma":[0.99990547,0.00002554837,0.000009677722,0.000020683308,0.000028835522,0.00000976878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011274157,0.00045885213,0.00025058424,0.00059016765,0.00030111574,0.0006532372,0.000600873,0.00024259639,0.006759877],"category_scores_gemma":[0.00029688576,0.00019008608,0.00018417822,0.00038908573,0.00012409028,0.00036331775,0.00018191437,0.00028526408,0.001128503],"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.0024115136,0.00031917123,0.0029772138,0.00060385943,0.00015317026,0.0011679977,0.00017480402,0.03733817,0.28512964,0.020876937,0.016298959,0.6325486],"study_design_scores_gemma":[0.0013859402,0.00298355,0.008006365,0.0002503401,0.00030744146,0.0026468975,0.00025979689,0.4762054,0.42114133,0.010851699,0.07583758,0.00012362232],"about_ca_topic_score_codex":0.0015784003,"about_ca_topic_score_gemma":0.0034992162,"teacher_disagreement_score":0.006759877,"about_ca_system_score_codex":0.00036407774,"about_ca_system_score_gemma":0.00057885423,"threshold_uncertainty_score":0.022614062},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55498624,0.028907211,0.080277115,0.13442995,0.0041563506,0.00010879404,0.000860372,0.00035537884,0.19591859],"genre_scores_gemma":[0.9455865,0.005506081,0.012999842,0.003837339,0.0023655966,0.00008523894,0.00047767657,0.00010984988,0.029031925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988876,0.00034120842,0.00004194816,0.00036647115,0.00019017477,0.00017267294],"domain_scores_gemma":[0.9946852,0.004057183,0.00037542562,0.00034519282,0.00028354698,0.00025344323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001487123,0.0005430624,0.0010821837,0.0011888767,0.0024002735,0.0026611444,0.00089956686,0.0015857031,0.0045778826],"category_scores_gemma":[0.013598976,0.00046856562,0.00065015844,0.0012717067,0.0042773513,0.00635374,0.0021816066,0.0043583307,0.0015189925],"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.00060666417,0.000056709734,0.0041175084,0.00016940381,0.00005261315,0.00010659779,0.0005621165,0.0047403574,0.0018504232,0.9283911,0.030322496,0.029024106],"study_design_scores_gemma":[0.0001015199,0.00023632305,0.0039620944,0.00013895273,0.00006685572,0.00045979052,0.00043796975,0.018489128,0.002514884,0.91386795,0.059657604,0.00006687396],"about_ca_topic_score_codex":0.0017582948,"about_ca_topic_score_gemma":0.0007427637,"teacher_disagreement_score":0.0045778826,"about_ca_system_score_codex":0.0031483115,"about_ca_system_score_gemma":0.0010193003,"threshold_uncertainty_score":0.022842765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09870838,0.014287202,0.7200987,0.003584358,0.00080439163,0.0012310402,0.0012280887,0.0020497302,0.15800817],"genre_scores_gemma":[0.408436,0.024168028,0.5342545,0.0010548544,0.00081861916,0.0009758609,0.00219036,0.00041713918,0.027684592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962255,0.00075914507,0.00058216223,0.000499872,0.0014814989,0.00045182888],"domain_scores_gemma":[0.99663454,0.00061736075,0.0005078559,0.0011231508,0.00070675806,0.00041029564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025179642,0.0015155374,0.0009791483,0.005322881,0.0030926927,0.0046361964,0.0013272478,0.0021360097,0.0035587598],"category_scores_gemma":[0.0058422955,0.0007010254,0.0010917521,0.0054851165,0.0031174612,0.009326097,0.004007085,0.0038284368,0.0020166086],"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.000038644863,0.000053479285,0.0013637803,0.00020607832,0.000010434983,0.00031915234,0.00072154915,0.0015778602,0.002045849,0.93964326,0.0028948109,0.051125236],"study_design_scores_gemma":[0.00002966184,0.00027809304,0.0013474918,0.00049488456,0.000028676295,0.004916003,0.0007070812,0.008386095,0.0042780726,0.6644677,0.31495714,0.00010911528],"about_ca_topic_score_codex":0.00033912036,"about_ca_topic_score_gemma":0.0002038178,"teacher_disagreement_score":0.005322881,"about_ca_system_score_codex":0.0010131795,"about_ca_system_score_gemma":0.0015739639,"threshold_uncertainty_score":0.0133164525},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16399333,0.0059873103,0.77446395,0.0014102084,0.0006646035,0.00034247743,0.00046731363,0.0023984106,0.050272368],"genre_scores_gemma":[0.68339163,0.002013658,0.27056643,0.00054530567,0.0005327032,0.00036277674,0.0008435194,0.0001503581,0.041593652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949634,0.00010046835,0.000031255593,0.000113447575,0.0001766993,0.00008186547],"domain_scores_gemma":[0.9996325,0.0001136131,0.00010317024,0.00006607342,0.000058548863,0.000026066324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036834463,0.0005181338,0.00040387097,0.00083339505,0.0006639928,0.0010813768,0.0005425812,0.0007053374,0.0073974933],"category_scores_gemma":[0.0012381468,0.00014742318,0.00046611304,0.00078220305,0.00052621367,0.0011990212,0.00070808287,0.0008345871,0.0029594894],"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.001372753,0.00027329664,0.0015683628,0.0009652078,0.00010487003,0.0011151072,0.000630041,0.01874141,0.23771726,0.2397554,0.013558135,0.48419815],"study_design_scores_gemma":[0.00064539094,0.0050853016,0.004177384,0.0007391238,0.0002501683,0.009106572,0.00044304266,0.18965071,0.3693141,0.11729808,0.30290988,0.0003803009],"about_ca_topic_score_codex":0.00042997222,"about_ca_topic_score_gemma":0.0007431825,"teacher_disagreement_score":0.0073974933,"about_ca_system_score_codex":0.0007098913,"about_ca_system_score_gemma":0.00092138664,"threshold_uncertainty_score":0.024747133},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16299933,0.0020230804,0.7958252,0.00096601824,0.00071827543,0.00036179886,0.00029788687,0.015511429,0.021297028],"genre_scores_gemma":[0.5948291,0.00057674415,0.39087194,0.00026608576,0.0001991528,0.00021504554,0.00057273166,0.00016661864,0.012302563],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996369,0.00004261323,0.000034430905,0.00007901731,0.00011953433,0.00008748863],"domain_scores_gemma":[0.99969864,0.000049113092,0.000036213998,0.00008415455,0.000098725286,0.000033258842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033849425,0.000760309,0.0005951486,0.0014214504,0.0009592546,0.0011285223,0.0014000342,0.0007321502,0.0067185108],"category_scores_gemma":[0.00063191366,0.00036581207,0.00045670688,0.0007146537,0.0004893911,0.0021776822,0.0007795239,0.00084709993,0.0024705294],"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.0011987266,0.0003581852,0.0020734945,0.00045254375,0.00007680191,0.0005339316,0.00050463725,0.010805328,0.21142615,0.07278078,0.016534118,0.6832553],"study_design_scores_gemma":[0.0012010422,0.004098668,0.004393827,0.0002618682,0.00027600877,0.0033796602,0.00038093497,0.28511345,0.5242132,0.040111378,0.13612731,0.00044271862],"about_ca_topic_score_codex":0.0010476895,"about_ca_topic_score_gemma":0.001324642,"teacher_disagreement_score":0.0067185108,"about_ca_system_score_codex":0.00092655304,"about_ca_system_score_gemma":0.0011783302,"threshold_uncertainty_score":0.02247566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037750065,0.0075257174,0.7466028,0.001905276,0.0010452465,0.00028673396,0.00023108242,0.0046248077,0.20002833],"genre_scores_gemma":[0.45468372,0.008565631,0.39282554,0.00055685715,0.0005395736,0.00027105786,0.00069120474,0.00079217314,0.14107423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925786,0.0001464859,0.00005443221,0.000060811606,0.00038518148,0.000095144635],"domain_scores_gemma":[0.99955887,0.000102369595,0.000025468273,0.00017525075,0.000117723,0.000020229678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060258585,0.00074394885,0.0005360229,0.00068810716,0.00059923937,0.002642951,0.0013225967,0.0009639023,0.011306588],"category_scores_gemma":[0.0019811655,0.00067955075,0.0003407888,0.0010773102,0.00086547906,0.0028291997,0.0010171076,0.0016108389,0.005380325],"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.00022953002,0.00012035479,0.0002373096,0.00038042627,0.000025724083,0.00016429996,0.00024527265,0.0089164665,0.025467621,0.5580587,0.015082886,0.39107144],"study_design_scores_gemma":[0.00023714911,0.00029165528,0.00048052176,0.0004280424,0.000060579485,0.0011405145,0.00013165518,0.080096684,0.11533345,0.36436936,0.43735263,0.0000777122],"about_ca_topic_score_codex":0.00030959732,"about_ca_topic_score_gemma":0.00033494658,"teacher_disagreement_score":0.011306588,"about_ca_system_score_codex":0.00069572625,"about_ca_system_score_gemma":0.00076443836,"threshold_uncertainty_score":0.037824273},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051278733,0.021611858,0.6269456,0.052199133,0.13135265,0.0010230266,0.0012151262,0.00623182,0.10814203],"genre_scores_gemma":[0.29829967,0.019993175,0.3991491,0.021008076,0.023068897,0.0005038559,0.0013319155,0.0013559993,0.2352894],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999292,0.00014749165,0.000057998728,0.00007658461,0.00035728436,0.00006857266],"domain_scores_gemma":[0.99882966,0.0006193678,0.00004855091,0.000112802896,0.00032907337,0.000060502276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090253603,0.000879377,0.0003987527,0.00071433705,0.0012542827,0.0016054322,0.0011986969,0.0014149589,0.014421613],"category_scores_gemma":[0.003205142,0.00043488643,0.0004819441,0.0008535432,0.0011514889,0.0026482593,0.0006488304,0.0026672627,0.005242262],"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.0016416521,0.00014706659,0.0008537028,0.0011106915,0.00009275577,0.0039159027,0.0006923383,0.0030422832,0.13280372,0.13717833,0.3889771,0.32954443],"study_design_scores_gemma":[0.00011402339,0.0009266637,0.0012519779,0.00019958515,0.00007267952,0.0029032698,0.00016866052,0.011868442,0.1612899,0.034829173,0.7862444,0.0001312654],"about_ca_topic_score_codex":0.0013750474,"about_ca_topic_score_gemma":0.004875253,"teacher_disagreement_score":0.014421613,"about_ca_system_score_codex":0.0008765098,"about_ca_system_score_gemma":0.0009495518,"threshold_uncertainty_score":0.048245072},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035257768,0.0030006529,0.8295344,0.013342177,0.07298886,0.00038163853,0.0015793574,0.013800212,0.030114923],"genre_scores_gemma":[0.1208957,0.0013915261,0.72115433,0.0034159045,0.007849368,0.00019653488,0.0034974325,0.0034362553,0.13816293],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993092,0.00012326575,0.000059692065,0.00010947121,0.0003202788,0.00007802126],"domain_scores_gemma":[0.9989066,0.00022463867,0.000038090562,0.00019691847,0.00056659215,0.000067102235],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00068770006,0.0009140261,0.00085900375,0.00079578493,0.00086795125,0.0010251665,0.0015482951,0.0014732546,0.029654415],"category_scores_gemma":[0.0031737806,0.00026512032,0.0007644671,0.0009647769,0.00064806925,0.0015880194,0.0010088542,0.0013166624,0.014218202],"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.0013280914,0.00021470798,0.00071599905,0.00066917064,0.00015566252,0.0012476116,0.0002254029,0.0072543155,0.030157821,0.022830699,0.29375476,0.6414458],"study_design_scores_gemma":[0.00045956657,0.000699416,0.0023740488,0.00018353862,0.00019383307,0.0034701284,0.00024034665,0.14791095,0.09332971,0.04518477,0.7057459,0.0002078409],"about_ca_topic_score_codex":0.0017406804,"about_ca_topic_score_gemma":0.0035964653,"teacher_disagreement_score":0.99852675,"about_ca_system_score_codex":0.0007349846,"about_ca_system_score_gemma":0.00085569307,"threshold_uncertainty_score":0.099203885},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6854699,0.0046572243,0.20968308,0.0016656312,0.0005834149,0.00035454932,0.0012025133,0.019022578,0.07736107],"genre_scores_gemma":[0.91812027,0.0006329575,0.063517794,0.00020677905,0.00010428895,0.00010332659,0.0011495386,0.00024410622,0.015920885],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998018,0.000018678318,0.000012305483,0.000044008495,0.00007212187,0.000051154017],"domain_scores_gemma":[0.99982244,0.000026899947,0.000014891278,0.000041512423,0.00007124966,0.000023036628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019935907,0.00060587586,0.00047093933,0.00089939067,0.0005178487,0.0007579308,0.0008315698,0.00032777016,0.016165297],"category_scores_gemma":[0.00052745984,0.0001947149,0.00021102245,0.00082418055,0.00021900122,0.0017362358,0.0007556652,0.000551013,0.0028372868],"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.0033964922,0.0005296225,0.0041769245,0.00068325555,0.00016395898,0.0010145509,0.0004266246,0.020630352,0.45904547,0.045386042,0.057306398,0.4072402],"study_design_scores_gemma":[0.0009090748,0.0014608984,0.0046782265,0.0001953887,0.00027614488,0.0011272246,0.0004127367,0.31510377,0.55065376,0.02786033,0.097167194,0.00015518018],"about_ca_topic_score_codex":0.00095265405,"about_ca_topic_score_gemma":0.0016008386,"teacher_disagreement_score":0.016165297,"about_ca_system_score_codex":0.00066154514,"about_ca_system_score_gemma":0.00078344473,"threshold_uncertainty_score":0.05407828},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14998457,0.0018740257,0.78796047,0.007404303,0.00088413106,0.00046576752,0.00032835876,0.001856196,0.04924226],"genre_scores_gemma":[0.8954524,0.0007510815,0.09034278,0.0008318374,0.00018063257,0.00018722189,0.00018684196,0.00010496949,0.011962226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99199086,0.0020426859,0.0006031455,0.00093731657,0.0035224056,0.00090357015],"domain_scores_gemma":[0.99536586,0.0014489648,0.00030140052,0.0019804898,0.0007556238,0.00014770663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054070614,0.0006435697,0.00078238605,0.0010147609,0.0014402501,0.0017119813,0.0017258469,0.0019052887,0.0026893571],"category_scores_gemma":[0.0094391955,0.00043170765,0.0011527528,0.0011052523,0.0024613766,0.007069938,0.0060204053,0.0032066475,0.00087349134],"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.00056221505,0.000106888605,0.0020769024,0.0003207813,0.00009822242,0.0006819899,0.0010506926,0.011443184,0.01662743,0.8705147,0.0067357095,0.08978122],"study_design_scores_gemma":[0.00027906446,0.00052590965,0.0012620394,0.00019272543,0.00020017028,0.0036713274,0.00049958914,0.21107063,0.106142156,0.5542596,0.12166941,0.0002273231],"about_ca_topic_score_codex":0.00050182705,"about_ca_topic_score_gemma":0.00019607494,"teacher_disagreement_score":0.0054070614,"about_ca_system_score_codex":0.0012535027,"about_ca_system_score_gemma":0.0015445189,"threshold_uncertainty_score":0.028595626},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022023657,0.090815775,0.21980153,0.33892244,0.020618195,0.00014645154,0.0004315554,0.0005993202,0.306641],"genre_scores_gemma":[0.5508199,0.10881481,0.18236119,0.040753856,0.04585231,0.00033166516,0.00026579076,0.0005946114,0.070205964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977506,0.0009202693,0.00009198776,0.000323616,0.0007393126,0.00017428794],"domain_scores_gemma":[0.99593484,0.0022468856,0.00014190524,0.0006239179,0.0007518721,0.000300606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052843033,0.000978743,0.0010052957,0.0017084285,0.002850937,0.007193546,0.0012198595,0.0046415003,0.0047617396],"category_scores_gemma":[0.011220818,0.00055958447,0.00069500256,0.0014585019,0.013991347,0.022716383,0.0043469155,0.011465807,0.0019441351],"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.000029527031,0.00001917246,0.000036551533,0.000030783296,0.0000032897635,0.000021725988,0.00012348774,0.0004283218,0.00011412321,0.97749674,0.0071760444,0.01452029],"study_design_scores_gemma":[0.000020413758,0.000022372518,0.000035716494,0.000053644933,0.0000018426759,0.00004635605,0.000055160428,0.0012675789,0.00011580998,0.9558668,0.04250355,0.000010703795],"about_ca_topic_score_codex":0.0011091221,"about_ca_topic_score_gemma":0.0007370091,"teacher_disagreement_score":0.007193546,"about_ca_system_score_codex":0.0038429417,"about_ca_system_score_gemma":0.0025016195,"threshold_uncertainty_score":0.027946413},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.391276,0.0084628435,0.24723306,0.004386519,0.002251864,0.000103372084,0.00048963656,0.00040651878,0.34539026],"genre_scores_gemma":[0.91179305,0.005683327,0.029330978,0.00094697915,0.0017739738,0.0000981227,0.00028046494,0.00013118789,0.049961913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944144,0.0001305316,0.000033953558,0.00008991296,0.00016572337,0.00013835577],"domain_scores_gemma":[0.99911314,0.00036227945,0.00016904202,0.00012002465,0.00012722948,0.00010838754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007937775,0.0013215811,0.0006265064,0.0026112378,0.0013704051,0.0034888163,0.00068299513,0.0010465198,0.0059309397],"category_scores_gemma":[0.00245305,0.00044211943,0.00055237045,0.0026333602,0.0030355153,0.0037816006,0.0016857393,0.0023493795,0.0013618558],"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.000013454619,0.0000070213046,0.000037778344,0.000014978341,0.0000012680899,0.000029818711,0.00013840952,0.00047857995,0.00029907472,0.99342656,0.00054542813,0.0050077112],"study_design_scores_gemma":[0.0000070431934,0.000012315169,0.00004568076,0.000018336501,0.0000021024593,0.000041949093,0.00004166665,0.00117739,0.00013947353,0.9952945,0.0032129767,0.0000064110172],"about_ca_topic_score_codex":0.0007747152,"about_ca_topic_score_gemma":0.00059255376,"teacher_disagreement_score":0.0059309397,"about_ca_system_score_codex":0.0014773043,"about_ca_system_score_gemma":0.00055147195,"threshold_uncertainty_score":0.019840956},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4199552,0.0008590602,0.54367834,0.00050264207,0.00027614867,0.00014408368,0.00047099622,0.001377575,0.032736037],"genre_scores_gemma":[0.7162679,0.0002302226,0.27379873,0.00017133607,0.00008575497,0.00008630112,0.0005502539,0.00012104523,0.008688415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980373,0.00032361297,0.00025851562,0.00046252063,0.00070239865,0.00021567142],"domain_scores_gemma":[0.9961696,0.0016571985,0.000362699,0.0012268347,0.00039806706,0.00018559778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012076545,0.00051862124,0.0006782092,0.0017836738,0.0013339175,0.0033633725,0.0013542384,0.0009843047,0.008141418],"category_scores_gemma":[0.008083756,0.00036493695,0.00076174235,0.0015448241,0.0015916441,0.0035876313,0.002339291,0.001148512,0.0017376563],"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.000877191,0.00017475772,0.0032824827,0.0002136811,0.000028418737,0.0009785409,0.0006361863,0.016385382,0.020800302,0.74380636,0.002448559,0.21036816],"study_design_scores_gemma":[0.00010632083,0.00032855765,0.0009638684,0.00014466778,0.000050371244,0.0019256937,0.00041018586,0.11636548,0.0546611,0.7914164,0.033502813,0.00012451794],"about_ca_topic_score_codex":0.00024384119,"about_ca_topic_score_gemma":0.0004194565,"teacher_disagreement_score":0.008141418,"about_ca_system_score_codex":0.000837267,"about_ca_system_score_gemma":0.000723868,"threshold_uncertainty_score":0.027235806},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053494863,0.0005154109,0.9080699,0.00031922595,0.0002380501,0.00006042256,0.00071784615,0.009539138,0.027045256],"genre_scores_gemma":[0.37592822,0.00044818575,0.60878646,0.000117008814,0.00009876377,0.00011595584,0.0016866127,0.00093225046,0.011886638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961627,0.000053882675,0.000027209242,0.000060323353,0.00017465433,0.000067612506],"domain_scores_gemma":[0.9995485,0.000087147244,0.000019804018,0.00015373067,0.00016467118,0.0000261261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023709732,0.0007222632,0.00058278866,0.0005986306,0.0005688702,0.0011308808,0.000774991,0.0004604121,0.010507905],"category_scores_gemma":[0.0015979604,0.0002898799,0.00040896665,0.0012259865,0.00034631434,0.0013662154,0.00083519414,0.0007790327,0.0033291439],"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.00059638766,0.00017277557,0.0018598718,0.00034893374,0.00012887853,0.0007739027,0.00042495638,0.1526414,0.106723994,0.1397774,0.051187187,0.5453643],"study_design_scores_gemma":[0.00011052842,0.00010576236,0.0006346686,0.00003883785,0.00002079915,0.00040623595,0.000056532994,0.81175566,0.07689717,0.046914432,0.063007444,0.000052033272],"about_ca_topic_score_codex":0.0025735497,"about_ca_topic_score_gemma":0.003445156,"teacher_disagreement_score":0.010507905,"about_ca_system_score_codex":0.00043039786,"about_ca_system_score_gemma":0.00062547426,"threshold_uncertainty_score":0.035152495},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.393401,0.0016948367,0.5666308,0.0008719489,0.0006194134,0.00067653996,0.00050859654,0.006583009,0.029013807],"genre_scores_gemma":[0.7607797,0.00033526885,0.22771648,0.00023314156,0.00008251649,0.00017395063,0.00044725224,0.000053046326,0.010178691],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998472,0.000022468801,0.000010566165,0.000030932013,0.000047460875,0.000041340325],"domain_scores_gemma":[0.99984586,0.000019705409,0.000021114141,0.000026087258,0.00007100902,0.000016222497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001558704,0.00038684517,0.00028449815,0.00058074284,0.0005606415,0.0006775974,0.0009856194,0.0005061561,0.0051246723],"category_scores_gemma":[0.00037122227,0.00024522026,0.00022338101,0.0005164588,0.00016362454,0.00044747387,0.00028085877,0.00035418724,0.0014219994],"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.0011005226,0.0003789284,0.003489166,0.0006903823,0.0002458324,0.0011802993,0.00035091164,0.021694591,0.501408,0.025617387,0.0126039265,0.43123996],"study_design_scores_gemma":[0.00086676324,0.0038532307,0.007141082,0.00019532308,0.00035550984,0.003646035,0.00025274538,0.30759394,0.59536505,0.009881812,0.07068638,0.00016206152],"about_ca_topic_score_codex":0.0015106121,"about_ca_topic_score_gemma":0.0034556328,"teacher_disagreement_score":0.0051246723,"about_ca_system_score_codex":0.0005079071,"about_ca_system_score_gemma":0.0011855942,"threshold_uncertainty_score":0.017143667},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42572528,0.0005423954,0.5479267,0.0019052384,0.0001794483,0.00027045232,0.00027259166,0.002579835,0.020598007],"genre_scores_gemma":[0.8263995,0.00019818486,0.16681118,0.00018968062,0.00006933159,0.00011320451,0.0003565566,0.00022432565,0.005637957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970988,0.00053901767,0.00018909051,0.00056713657,0.0011579233,0.0004480015],"domain_scores_gemma":[0.9932417,0.002961952,0.00047873787,0.0023297747,0.00068534125,0.00030252562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024984302,0.00056312943,0.0010772768,0.0010183074,0.0010693591,0.0029258984,0.0013081558,0.0010683612,0.0062225163],"category_scores_gemma":[0.010531242,0.00039286804,0.0010540743,0.0012174492,0.002275654,0.005528095,0.0038544901,0.0024811104,0.0014382579],"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.0016261349,0.0006724847,0.008042258,0.00046320911,0.00023195082,0.000422265,0.0012485903,0.050266635,0.045900024,0.64957315,0.0058755944,0.2356777],"study_design_scores_gemma":[0.00045900102,0.00032753104,0.0017326896,0.00006757706,0.00011242341,0.00040661477,0.00043790645,0.22393158,0.06494168,0.6942707,0.013229132,0.00008318036],"about_ca_topic_score_codex":0.00079015625,"about_ca_topic_score_gemma":0.0010231653,"teacher_disagreement_score":0.0062225163,"about_ca_system_score_codex":0.0026762597,"about_ca_system_score_gemma":0.0027547115,"threshold_uncertainty_score":0.020816386},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019454964,0.0017366023,0.96275485,0.0006136888,0.00035062182,0.00014673844,0.00039665712,0.0033199075,0.011225951],"genre_scores_gemma":[0.19576313,0.0021587603,0.7817287,0.00045393573,0.000699508,0.00045712767,0.002423988,0.0017812873,0.014533579],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956672,0.00072948734,0.00039197263,0.0010155841,0.0017179933,0.00047774974],"domain_scores_gemma":[0.9932278,0.0027682653,0.00041877961,0.0020607314,0.0012944627,0.00023000217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034914464,0.002568861,0.0016147123,0.004493881,0.0014986906,0.0049519786,0.002720816,0.0017592099,0.011656279],"category_scores_gemma":[0.015179165,0.00094300497,0.0025851831,0.0043350053,0.0024329058,0.013927314,0.005513641,0.0045975023,0.0058715004],"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.00045618054,0.00021476392,0.0024159558,0.0006244788,0.000121340585,0.00010579295,0.0006055023,0.025526108,0.006903836,0.45749483,0.016019309,0.4895119],"study_design_scores_gemma":[0.00014856143,0.00019559624,0.0007211986,0.00015420375,0.000060463124,0.00027008168,0.00025134222,0.08683928,0.010670957,0.8713038,0.02928819,0.00009643311],"about_ca_topic_score_codex":0.001480814,"about_ca_topic_score_gemma":0.0014900529,"teacher_disagreement_score":0.011656279,"about_ca_system_score_codex":0.002743893,"about_ca_system_score_gemma":0.0020019,"threshold_uncertainty_score":0.038994133},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13639204,0.01589508,0.27688125,0.004371244,0.0028530932,0.00017136992,0.00023040076,0.002511951,0.5606936],"genre_scores_gemma":[0.52895,0.006616627,0.12712298,0.0010266692,0.0017283127,0.00016995578,0.00019193532,0.00046176874,0.33373183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99983084,0.000040443723,0.0000075691846,0.000030149356,0.000063405874,0.000027513312],"domain_scores_gemma":[0.999835,0.00007500882,0.000020062176,0.000030083507,0.000027776221,0.000012106882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022616207,0.00056333776,0.0003709762,0.0008949886,0.00062908133,0.0010616123,0.00032904884,0.0005727597,0.012831],"category_scores_gemma":[0.00096089154,0.00024067338,0.00022792767,0.00096348074,0.0010259589,0.0015286665,0.0007134879,0.0010587147,0.0044888644],"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.0003066217,0.000043788128,0.00019015146,0.0002256223,0.0000142639565,0.00056126446,0.0005016622,0.0020891193,0.02007867,0.77504677,0.020501371,0.18044068],"study_design_scores_gemma":[0.00012758057,0.0004787576,0.0007081753,0.00015197106,0.0000328816,0.0026099996,0.00015535968,0.009066498,0.038062338,0.63421947,0.3143157,0.00007128829],"about_ca_topic_score_codex":0.00027896187,"about_ca_topic_score_gemma":0.0006185807,"teacher_disagreement_score":0.012831,"about_ca_system_score_codex":0.00050053955,"about_ca_system_score_gemma":0.00037052875,"threshold_uncertainty_score":0.042923987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97795725,0.0016094912,0.011754308,0.000100360536,0.0000858529,0.00011320702,0.00033126544,0.00223664,0.0058116694],"genre_scores_gemma":[0.98376113,0.00058646576,0.01322392,0.000027225542,0.000018567713,0.000041171254,0.0004024083,0.00009426082,0.0018447753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872476,0.00022659429,0.00014737784,0.00021412493,0.0005038986,0.00018328844],"domain_scores_gemma":[0.99787796,0.0006496157,0.00016955771,0.00030640158,0.000874422,0.00012210126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007148485,0.0007423009,0.0006889399,0.0014075716,0.00027633383,0.0008077464,0.00062314986,0.00042217996,0.0032240057],"category_scores_gemma":[0.0038105063,0.00019913737,0.00023320499,0.0013204161,0.000170051,0.0008342226,0.0004492103,0.00022686289,0.0008306863],"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.012171836,0.0007550727,0.028187132,0.0019421169,0.00045371836,0.00109267,0.00090401917,0.04976743,0.15852703,0.0040434347,0.010866698,0.7312888],"study_design_scores_gemma":[0.0009483103,0.011155004,0.08344997,0.0003910922,0.0006262589,0.0027124975,0.0018088733,0.5666783,0.30101302,0.0015024695,0.029455822,0.00025839635],"about_ca_topic_score_codex":0.0018000673,"about_ca_topic_score_gemma":0.0017200517,"teacher_disagreement_score":0.0032240057,"about_ca_system_score_codex":0.0005652692,"about_ca_system_score_gemma":0.00039201597,"threshold_uncertainty_score":0.010785401},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3318489,0.0060879695,0.59317374,0.0013609271,0.0006255887,0.0002877498,0.0003835685,0.007340437,0.058891136],"genre_scores_gemma":[0.7403451,0.0010453105,0.24133228,0.00017087301,0.0001207196,0.0000901129,0.00034332334,0.00007720868,0.016474994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998828,0.000026782127,0.0000077813875,0.000019146166,0.000047492496,0.000016008973],"domain_scores_gemma":[0.9997975,0.00005528502,0.00002372368,0.000033651075,0.000075213524,0.0000146471875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029159265,0.000318697,0.00022175972,0.00036536824,0.0002919604,0.0005242612,0.0004859137,0.00039137242,0.012354415],"category_scores_gemma":[0.00074218493,0.00014082628,0.0001615153,0.0005635778,0.00012691203,0.0006910372,0.00023470109,0.00041459408,0.002972116],"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.0009985903,0.00018473066,0.001731761,0.00046792542,0.00005355102,0.0005463772,0.00015744414,0.011895138,0.42163795,0.056114998,0.0155358305,0.49067572],"study_design_scores_gemma":[0.0003565607,0.0032614956,0.0037865161,0.00025421783,0.00010494759,0.0030981116,0.0001382178,0.1959753,0.5528879,0.02858389,0.21142484,0.0001280436],"about_ca_topic_score_codex":0.0002416059,"about_ca_topic_score_gemma":0.00045350942,"teacher_disagreement_score":0.012354415,"about_ca_system_score_codex":0.00037868085,"about_ca_system_score_gemma":0.0004307897,"threshold_uncertainty_score":0.041329622},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2563856,0.0022500954,0.6489664,0.0088851,0.00068021356,0.00037802587,0.006153252,0.026524976,0.049776293],"genre_scores_gemma":[0.7539713,0.0010334366,0.21148069,0.00095995364,0.0006899275,0.0002131019,0.0075076213,0.0027469855,0.02139704],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99660957,0.00037912765,0.00022749178,0.00092397706,0.0012578365,0.00060208625],"domain_scores_gemma":[0.9924091,0.004167018,0.00046779984,0.0017563862,0.0007828803,0.00041681126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019839166,0.0017545453,0.0019214848,0.001448494,0.0014820519,0.007330658,0.0028904811,0.0014801973,0.022970071],"category_scores_gemma":[0.016239114,0.00073430274,0.002407079,0.0023316203,0.0018478718,0.01275353,0.0050995112,0.003989005,0.009000111],"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.0027788472,0.0007724381,0.011076813,0.0026465002,0.00043390592,0.0014224373,0.0017499607,0.122966364,0.026032832,0.32860747,0.100524016,0.40098837],"study_design_scores_gemma":[0.00039091497,0.00012939685,0.0011963114,0.00008712283,0.00013559146,0.0004799494,0.00041461736,0.27688807,0.015416273,0.69087124,0.013905991,0.000084511295],"about_ca_topic_score_codex":0.004148918,"about_ca_topic_score_gemma":0.0066552428,"teacher_disagreement_score":0.022970071,"about_ca_system_score_codex":0.004040537,"about_ca_system_score_gemma":0.0032979758,"threshold_uncertainty_score":0.07684255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019136865,0.00067045883,0.9171646,0.000280971,0.0003493774,0.000089536996,0.00017487213,0.013806349,0.048327025],"genre_scores_gemma":[0.3461953,0.0010836854,0.5848401,0.0005053037,0.00020970206,0.00025717972,0.0011326175,0.0029401786,0.06283583],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99921584,0.00014800328,0.000061252555,0.00011296388,0.00036410976,0.000097855824],"domain_scores_gemma":[0.99933356,0.0001874272,0.000033709093,0.00023137989,0.00019245871,0.000021368502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005533451,0.0007789885,0.00049200223,0.000716796,0.0004961002,0.0023262203,0.0012972412,0.00072097644,0.013483375],"category_scores_gemma":[0.0018024637,0.00045140358,0.00060109125,0.0007528971,0.00066401303,0.0020043575,0.0011156789,0.0010264922,0.00509445],"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.00038101999,0.00015645554,0.0007821651,0.0005334439,0.000075591044,0.0002817605,0.00062672584,0.0109015815,0.048314247,0.39896747,0.027770275,0.51120937],"study_design_scores_gemma":[0.00019518308,0.00027749763,0.00089965406,0.0003425099,0.00016608584,0.0009592183,0.00016638976,0.19169235,0.21311347,0.22165868,0.37044492,0.00008415857],"about_ca_topic_score_codex":0.0006010741,"about_ca_topic_score_gemma":0.0007492776,"teacher_disagreement_score":0.013483375,"about_ca_system_score_codex":0.00054594956,"about_ca_system_score_gemma":0.0007835799,"threshold_uncertainty_score":0.04510641},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043606758,0.0008794931,0.88975054,0.0011038472,0.00037981838,0.0002862666,0.0018252167,0.01837542,0.043792713],"genre_scores_gemma":[0.24977058,0.00055237545,0.71516323,0.00034378626,0.00016197312,0.00035944325,0.004489494,0.0040471684,0.025111921],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976598,0.0005089765,0.0001740399,0.00043404146,0.00077328086,0.00044984318],"domain_scores_gemma":[0.9971866,0.0011476489,0.00014292075,0.00091317226,0.0004400376,0.00016955822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019151835,0.0016763812,0.0011654223,0.0017094883,0.0013325746,0.0029307979,0.0023499373,0.0013936218,0.027347906],"category_scores_gemma":[0.0058577973,0.00089088856,0.0018159896,0.0024061883,0.0013243078,0.005226119,0.0068995147,0.0027140456,0.015652617],"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.0009867498,0.00021481073,0.0024575884,0.0012487968,0.00008130064,0.0005951637,0.0011343099,0.014682809,0.026545318,0.43281993,0.05142281,0.46781036],"study_design_scores_gemma":[0.0004050989,0.00028200756,0.0013266181,0.0003861095,0.00012486853,0.0012461479,0.0010048287,0.1171292,0.09805382,0.5943648,0.1855009,0.00017550959],"about_ca_topic_score_codex":0.0010419055,"about_ca_topic_score_gemma":0.001208868,"teacher_disagreement_score":0.027347906,"about_ca_system_score_codex":0.0016596437,"about_ca_system_score_gemma":0.0014274755,"threshold_uncertainty_score":0.091487825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07748158,0.0014881392,0.90506005,0.0002179008,0.00018287804,0.000113499475,0.000116148614,0.0033509294,0.011988826],"genre_scores_gemma":[0.38859007,0.000735794,0.5969156,0.00024441112,0.00014074314,0.0001598683,0.00063009065,0.00015915786,0.012424284],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997732,0.000031650252,0.000022948969,0.000050696188,0.000089088186,0.00003242372],"domain_scores_gemma":[0.9998287,0.000017155675,0.000022020657,0.000029853278,0.000089972935,0.00001223693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020117749,0.00042282298,0.00035331666,0.0008135589,0.00034437826,0.0005177897,0.00095054694,0.00035239596,0.003105797],"category_scores_gemma":[0.00034569882,0.00022985271,0.00034621469,0.0008112152,0.00023229758,0.0014105008,0.00051986973,0.00046817164,0.0011266056],"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.00035551857,0.000085485604,0.0011043717,0.00030662745,0.000103803315,0.00043934985,0.00022101772,0.032625712,0.34931386,0.039871976,0.011153815,0.5644185],"study_design_scores_gemma":[0.00019489178,0.0016951824,0.0031012616,0.00008316857,0.00020706392,0.0022703167,0.00012297428,0.60277385,0.26169208,0.014853147,0.11283227,0.00017388124],"about_ca_topic_score_codex":0.0006980554,"about_ca_topic_score_gemma":0.0013718166,"teacher_disagreement_score":0.003105797,"about_ca_system_score_codex":0.00036528308,"about_ca_system_score_gemma":0.00065672165,"threshold_uncertainty_score":0.010389924},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0614476,0.0006991971,0.9306338,0.00022850538,0.00011946085,0.00013456115,0.000027404945,0.0016019495,0.005107509],"genre_scores_gemma":[0.27997845,0.0004507296,0.7158444,0.000058111094,0.00010506746,0.00007044625,0.00012180661,0.00018580162,0.0031851744],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995436,0.00009658387,0.000029031142,0.00006194657,0.00021590693,0.000052884843],"domain_scores_gemma":[0.9992617,0.00023098978,0.00006558981,0.0002599018,0.00015133922,0.000030461862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006555526,0.0007332332,0.0005936021,0.00080276985,0.00060199137,0.0007258823,0.0008492319,0.0003824738,0.0038600178],"category_scores_gemma":[0.0017379533,0.00021223535,0.00043864228,0.0005944122,0.00054100977,0.0017797549,0.0008241291,0.001057426,0.001615009],"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.0008337982,0.00020349544,0.0012785905,0.00036757602,0.000062506486,0.00029258244,0.00031992595,0.030511051,0.18358614,0.09607059,0.0047341976,0.6817395],"study_design_scores_gemma":[0.0002536531,0.00108639,0.0016738557,0.0000973045,0.000100454374,0.001534114,0.0001491178,0.48999697,0.37956268,0.07369528,0.051750053,0.00010009233],"about_ca_topic_score_codex":0.00016705146,"about_ca_topic_score_gemma":0.00051467493,"teacher_disagreement_score":0.0038600178,"about_ca_system_score_codex":0.0003604811,"about_ca_system_score_gemma":0.0005321266,"threshold_uncertainty_score":0.012913048},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013793045,0.0010811524,0.95289856,0.00042969402,0.00051815726,0.0001117032,0.00015416114,0.0013046488,0.029708866],"genre_scores_gemma":[0.2509769,0.0020836475,0.7195783,0.00034472917,0.0004785552,0.00027631628,0.00042204725,0.0007444428,0.02509503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989573,0.00018843643,0.00009224343,0.00021849421,0.00042954652,0.000113937465],"domain_scores_gemma":[0.99930763,0.0001529911,0.000060127797,0.00026050262,0.00016560007,0.000053083848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083981233,0.0008981468,0.0006411074,0.0014375055,0.0010108058,0.002864428,0.0010309878,0.000933252,0.0084095495],"category_scores_gemma":[0.0033376256,0.00044633623,0.0006029015,0.0019135253,0.0015691125,0.0037083554,0.0025054335,0.002327521,0.0061000884],"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.00016296297,0.000030211833,0.00031686848,0.00016813405,0.000009959461,0.00026638023,0.00020814917,0.006129957,0.013599871,0.8469387,0.0058640046,0.12630482],"study_design_scores_gemma":[0.00008174356,0.0002018834,0.0003075086,0.00016971324,0.000028425373,0.0016145076,0.0001121812,0.09015799,0.04337376,0.6495623,0.21427418,0.00011578792],"about_ca_topic_score_codex":0.0004451482,"about_ca_topic_score_gemma":0.00036084297,"teacher_disagreement_score":0.0084095495,"about_ca_system_score_codex":0.0008812236,"about_ca_system_score_gemma":0.0008614254,"threshold_uncertainty_score":0.028132796},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83505255,0.00016253116,0.15533814,0.00020302893,0.00004181532,0.00006220454,0.00025127098,0.0013836231,0.0075048716],"genre_scores_gemma":[0.94750535,0.00009100691,0.048503913,0.000022444969,0.00003612852,0.000024066552,0.0006082758,0.0001235861,0.0030851993],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947363,0.000063859756,0.000036318204,0.000088882465,0.0001930392,0.00014433349],"domain_scores_gemma":[0.99872226,0.00055477413,0.00013000771,0.00018708903,0.00023725587,0.0001685624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081073376,0.00097111246,0.0010020345,0.0032258097,0.00068121916,0.0023901034,0.0009535826,0.00044686836,0.005084184],"category_scores_gemma":[0.004132312,0.00029422436,0.0005985832,0.0010779286,0.00094145,0.003135226,0.0012974797,0.00092400383,0.0011874321],"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.002706701,0.00053720427,0.038593605,0.0005555768,0.00021194738,0.0014165614,0.001863113,0.13488303,0.11893561,0.2585092,0.0072061834,0.43458128],"study_design_scores_gemma":[0.00026658,0.00036575744,0.009616931,0.00005683274,0.00006188168,0.00033455997,0.0006505273,0.54628736,0.07995475,0.3558355,0.0064524175,0.000116935604],"about_ca_topic_score_codex":0.0016728999,"about_ca_topic_score_gemma":0.002340306,"teacher_disagreement_score":0.005084184,"about_ca_system_score_codex":0.0011608525,"about_ca_system_score_gemma":0.00082811626,"threshold_uncertainty_score":0.017008305},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94289833,0.00037385782,0.009155277,0.0008636992,0.000086297914,0.000046478464,0.00018373824,0.00022106786,0.046171267],"genre_scores_gemma":[0.9859438,0.00041395292,0.0018216969,0.00012594617,0.00021247573,0.000034521334,0.00040626738,0.000076787706,0.010964467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990947,0.00016276712,0.0000369573,0.0001559267,0.00020170641,0.00034795518],"domain_scores_gemma":[0.9982687,0.00072084984,0.00027815736,0.00014566001,0.00011237672,0.0004742424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092594005,0.0012393048,0.0010124418,0.0046663648,0.0027917763,0.004905608,0.0012855075,0.0017057557,0.013277149],"category_scores_gemma":[0.0023996797,0.0006522438,0.0008960001,0.002592896,0.0034091547,0.006742134,0.0034156574,0.003114702,0.0008079538],"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.00033951804,0.00018865515,0.004124511,0.00006640683,0.000028175544,0.000567311,0.0017784674,0.0017261622,0.0041366364,0.96961266,0.0017571065,0.015674481],"study_design_scores_gemma":[0.00007633709,0.00008527737,0.005091933,0.000047186706,0.000034908695,0.0004967711,0.00080104376,0.0051383413,0.0028663247,0.98023456,0.0050852364,0.00004213801],"about_ca_topic_score_codex":0.0009624789,"about_ca_topic_score_gemma":0.00056104944,"teacher_disagreement_score":0.013277149,"about_ca_system_score_codex":0.0021921957,"about_ca_system_score_gemma":0.000673366,"threshold_uncertainty_score":0.044416487},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046924107,0.0010056779,0.9171271,0.0013501041,0.0011454988,0.0003448282,0.00041539877,0.0033800858,0.028307265],"genre_scores_gemma":[0.2841229,0.00081209606,0.6891396,0.0005969867,0.00093470665,0.00042788644,0.00093274494,0.001103691,0.021929469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995695,0.0010315437,0.00036329593,0.00059207797,0.0018996755,0.0004182639],"domain_scores_gemma":[0.9942761,0.0013733798,0.00023391114,0.0029541939,0.0009463387,0.00021617343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037528595,0.0015781771,0.0022237953,0.0036305129,0.0018794573,0.0033627143,0.0028465444,0.0016244766,0.012739226],"category_scores_gemma":[0.015713293,0.0007577405,0.002168798,0.0033799584,0.0026442534,0.0063812546,0.0043496634,0.004540048,0.005561013],"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.0010194633,0.00027883227,0.0017623247,0.00021164936,0.00011584351,0.00022458841,0.00036780667,0.0143949315,0.009986611,0.67496675,0.01610069,0.28057063],"study_design_scores_gemma":[0.00021535221,0.00030722326,0.0009094361,0.00009509721,0.00012030899,0.0005547003,0.00012926561,0.11583889,0.014449124,0.82965374,0.0375972,0.00012972551],"about_ca_topic_score_codex":0.0015408604,"about_ca_topic_score_gemma":0.0023566058,"teacher_disagreement_score":0.012739226,"about_ca_system_score_codex":0.0015124716,"about_ca_system_score_gemma":0.0019981624,"threshold_uncertainty_score":0.042616904},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24688523,0.0013436258,0.7203334,0.0004316093,0.00032237195,0.00046326427,0.00019777575,0.0023747378,0.02764802],"genre_scores_gemma":[0.5739921,0.0005956065,0.40784818,0.00012178116,0.00008961854,0.00017837906,0.00040077878,0.00015340897,0.016620148],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944943,0.00010531069,0.00006137846,0.000079343925,0.00023723824,0.00006735983],"domain_scores_gemma":[0.99955684,0.000050417606,0.0000558718,0.00017113393,0.00013263093,0.000033030385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005846446,0.00040761626,0.0004385235,0.0007562116,0.0004572754,0.0006715655,0.0006982606,0.0003690182,0.0035401105],"category_scores_gemma":[0.0010374631,0.00016248183,0.000327167,0.00061669055,0.0004926524,0.0016034495,0.00078478974,0.0007061101,0.001292887],"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.0015441043,0.00025235012,0.0019312885,0.00056074996,0.00007596934,0.0009541139,0.00080124795,0.016048651,0.26434493,0.2708879,0.0053519765,0.43724662],"study_design_scores_gemma":[0.0007132049,0.0035968288,0.0026582305,0.00025850558,0.00020228409,0.006328044,0.000286167,0.23006824,0.44440678,0.09679239,0.21439134,0.0002981222],"about_ca_topic_score_codex":0.00015492711,"about_ca_topic_score_gemma":0.00023079876,"teacher_disagreement_score":0.0035401105,"about_ca_system_score_codex":0.00040023107,"about_ca_system_score_gemma":0.00073129043,"threshold_uncertainty_score":0.011842787},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6297041,0.0008309886,0.32285234,0.003087322,0.0003510189,0.00011935741,0.00020132933,0.002900272,0.03995318],"genre_scores_gemma":[0.9732956,0.000118354685,0.02190859,0.00016044098,0.00003119044,0.000018787285,0.00006410204,0.000037645175,0.0043652495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890137,0.0002322331,0.00005765851,0.00013365397,0.00042229655,0.00025283638],"domain_scores_gemma":[0.99876815,0.00040579366,0.00013624084,0.00039810833,0.00021085098,0.00008087961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065191626,0.00044787946,0.00062373007,0.0012017557,0.0009018738,0.00085756194,0.0007128284,0.0015847832,0.0039504883],"category_scores_gemma":[0.0025396394,0.00020898727,0.0004782512,0.0009492026,0.0008441745,0.0016072569,0.0015835803,0.0007859584,0.0009239959],"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.004209715,0.00041713874,0.007655593,0.00039791476,0.00029725712,0.0025086896,0.000983812,0.07356071,0.16291268,0.3523677,0.013398318,0.3812905],"study_design_scores_gemma":[0.00049193285,0.0014915594,0.0040426566,0.00016779227,0.000267402,0.003127282,0.0002341258,0.542316,0.1657685,0.2587916,0.023138968,0.00016216321],"about_ca_topic_score_codex":0.0007708248,"about_ca_topic_score_gemma":0.0007053165,"teacher_disagreement_score":0.0039504883,"about_ca_system_score_codex":0.0009413796,"about_ca_system_score_gemma":0.0008902849,"threshold_uncertainty_score":0.013215661},"labels":[],"label_agreement":null},{"id":"W2070532428","doi":"10.1007/s13389-011-0003-1","title":"Algorithm-level error detection for Montgomery ladder-based ECSM","year":2011,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Correctness; Scalar multiplication; Computer science; Elliptic curve cryptography; Cryptography; Algorithm; Elliptic curve; Fault detection and isolation; Computation; Arithmetic; Mathematics; Public-key cryptography; Computer security; Artificial intelligence","score_opus":0.03866171637910226,"score_gpt":0.22259061327719776,"score_spread":0.1839288968980955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070532428","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21251783,0.00036269418,0.77538794,0.00033693228,0.000109332505,0.00011933803,0.00015099948,0.002730672,0.008284235],"genre_scores_gemma":[0.81788,0.000081852355,0.17784587,0.00013821144,0.000024355459,0.000049122304,0.0001646164,0.00005722411,0.0037587848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905413,0.00019792629,0.000068822825,0.00011794555,0.00041939455,0.00014176444],"domain_scores_gemma":[0.9985636,0.000416589,0.00014787479,0.00045406865,0.00036291903,0.000054993183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008612432,0.00041539854,0.00048204194,0.00090525456,0.00049746,0.000867809,0.0007945241,0.000882397,0.0032577654],"category_scores_gemma":[0.0028656786,0.00014360876,0.0002649955,0.0005040368,0.00038280795,0.0010429666,0.001230608,0.00052718486,0.0007898253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027335535,0.00045850952,0.008992515,0.0003511758,0.00014501346,0.00060998707,0.00029813198,0.057368875,0.2337132,0.114584684,0.0048829336,0.5758614],"study_design_scores_gemma":[0.00010944769,0.0005914187,0.0025231806,0.00008513096,0.00006994792,0.00073309377,0.00007264823,0.7558128,0.19641554,0.036728982,0.006797733,0.000060052113],"about_ca_topic_score_codex":0.00044914053,"about_ca_topic_score_gemma":0.0009654408,"teacher_disagreement_score":0.0032577654,"about_ca_system_score_codex":0.0005953322,"about_ca_system_score_gemma":0.00092260813,"threshold_uncertainty_score":0.010898292},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13736397,0.0014626194,0.7927263,0.0006336634,0.00034074753,0.00021090049,0.00018841767,0.005043256,0.06203014],"genre_scores_gemma":[0.75022954,0.00067404355,0.23402235,0.00027139072,0.000081314014,0.00012344585,0.00020596758,0.000093081195,0.014298906],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999818,0.000045554287,0.00001284021,0.000031874923,0.00006908675,0.0000225506],"domain_scores_gemma":[0.99984694,0.000020441612,0.000015656306,0.000033718014,0.00007381856,0.000009506884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018174603,0.00026391936,0.0001981094,0.00022815878,0.00019239748,0.0004372431,0.0005331948,0.0002533935,0.0035915612],"category_scores_gemma":[0.00040590682,0.00011001895,0.000162862,0.00018912807,0.000203757,0.0004190099,0.00022248848,0.0002706151,0.0011571468],"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.0005477929,0.00009423118,0.0010940348,0.00045359522,0.000054883898,0.0005668627,0.00012530264,0.09365694,0.31110373,0.12817994,0.0074832044,0.45663938],"study_design_scores_gemma":[0.00014207413,0.0010531399,0.0008721342,0.00007649691,0.00007516347,0.0013064588,0.00005240041,0.6132683,0.25400174,0.025986375,0.10312434,0.000041407286],"about_ca_topic_score_codex":0.00030473762,"about_ca_topic_score_gemma":0.0005668276,"teacher_disagreement_score":0.0035915612,"about_ca_system_score_codex":0.00034643192,"about_ca_system_score_gemma":0.00047155426,"threshold_uncertainty_score":0.012014985},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87620306,0.00057333306,0.06987075,0.0008581325,0.00009337464,0.00006168038,0.00023809873,0.00033336756,0.051768165],"genre_scores_gemma":[0.9892336,0.00015444617,0.0049769636,0.000050777926,0.00011610509,0.000035319965,0.00014619406,0.00002753034,0.005259028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989053,0.00020054064,0.00006079537,0.00019760015,0.00040341885,0.0002322947],"domain_scores_gemma":[0.9965364,0.0013278491,0.000594225,0.00078800216,0.0003745997,0.00037898682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009080514,0.000366414,0.0007170027,0.0014107145,0.0009084127,0.002187685,0.00054994656,0.00067061506,0.008219895],"category_scores_gemma":[0.006370017,0.00021824289,0.00034399505,0.0010303353,0.0018241509,0.0039696577,0.0020966788,0.0011688787,0.00079598546],"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.00019587806,0.00007353733,0.0012069809,0.00005368651,0.000008839561,0.00019519965,0.0003236334,0.004168598,0.0038384034,0.9704385,0.0012811606,0.018215572],"study_design_scores_gemma":[0.00006418392,0.000089616435,0.0013964808,0.000032592405,0.000012358278,0.00031825824,0.00016629665,0.027083661,0.0045844293,0.95752233,0.008712396,0.00001737259],"about_ca_topic_score_codex":0.0002018854,"about_ca_topic_score_gemma":0.00014365246,"teacher_disagreement_score":0.008219895,"about_ca_system_score_codex":0.0010702625,"about_ca_system_score_gemma":0.00034736533,"threshold_uncertainty_score":0.027498305},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5040901,0.0037583525,0.3389162,0.02313318,0.00163623,0.00015386834,0.00052839157,0.0005128314,0.12727082],"genre_scores_gemma":[0.9407109,0.0018252621,0.025936142,0.0011966379,0.001643503,0.00011807622,0.00049204705,0.00019587668,0.0278815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767417,0.00085528794,0.000106660416,0.00036128963,0.00064717967,0.00035539403],"domain_scores_gemma":[0.9922694,0.0056961128,0.0004956461,0.00066162326,0.0004397408,0.00043737318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029335693,0.001054688,0.0017692661,0.0020595568,0.002636229,0.006672135,0.0022919343,0.0027804119,0.008907999],"category_scores_gemma":[0.01879582,0.0005492959,0.0006952069,0.002775927,0.005399625,0.013399423,0.0042973575,0.005982632,0.0016178024],"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.00020852865,0.00008690969,0.0002802858,0.000084875945,0.000012627131,0.000115828596,0.00023171322,0.0047466517,0.00046630582,0.97667605,0.0035417683,0.01354857],"study_design_scores_gemma":[0.000020404406,0.000010030551,0.000037564507,0.000008289774,0.0000035026542,0.00003098967,0.00004063497,0.0099009415,0.00018079882,0.9892581,0.00050013314,0.000008583104],"about_ca_topic_score_codex":0.00094798073,"about_ca_topic_score_gemma":0.00064067653,"teacher_disagreement_score":0.008907999,"about_ca_system_score_codex":0.001999084,"about_ca_system_score_gemma":0.0013400569,"threshold_uncertainty_score":0.029800236},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76122093,0.001469467,0.1610155,0.0008015055,0.00047720852,0.00005913988,0.000090840455,0.0002952169,0.07457024],"genre_scores_gemma":[0.94544303,0.00058506645,0.03749463,0.00022709473,0.0002743576,0.00003384468,0.00007140825,0.00010556616,0.015765026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994153,0.00013728571,0.00003709977,0.0001072627,0.00020736583,0.000095771706],"domain_scores_gemma":[0.9992387,0.00026390151,0.00015890857,0.00009697669,0.0001341038,0.000107407315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000634172,0.00045227358,0.00034579905,0.0010257004,0.00056609063,0.0009814079,0.00054732093,0.00043904345,0.004694643],"category_scores_gemma":[0.00254776,0.00022295714,0.0003106265,0.00087992597,0.0015784822,0.002599658,0.0010881133,0.001483692,0.0008715907],"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.00028958038,0.00004281192,0.0006172455,0.00008759606,0.0000070151095,0.0008187846,0.0004336489,0.0029442392,0.018726896,0.9534998,0.0009948498,0.021537526],"study_design_scores_gemma":[0.000091932736,0.00048089217,0.0024549884,0.000092555914,0.000021034331,0.0019378772,0.00045066015,0.023558427,0.021102425,0.9199608,0.02976952,0.00007897378],"about_ca_topic_score_codex":0.00022337887,"about_ca_topic_score_gemma":0.00022602583,"teacher_disagreement_score":0.004694643,"about_ca_system_score_codex":0.0005932415,"about_ca_system_score_gemma":0.00031562732,"threshold_uncertainty_score":0.015705109},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8556907,0.0006683291,0.12784615,0.0006915251,0.00025663705,0.00019517065,0.00052805594,0.0037279641,0.010395432],"genre_scores_gemma":[0.89586467,0.00023941902,0.09576223,0.00009630123,0.00011532125,0.000086644875,0.001271642,0.0002032801,0.006360554],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993857,0.00008848409,0.00005018569,0.00008707124,0.00026080912,0.00012782153],"domain_scores_gemma":[0.99829465,0.00041998274,0.00023688913,0.0007442636,0.00021392538,0.000090137655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046316703,0.0006801199,0.0005938188,0.0008013506,0.0003453036,0.0010190455,0.0006134944,0.0005762505,0.0058124736],"category_scores_gemma":[0.0031013035,0.00021266175,0.0005167257,0.0010963164,0.0006077454,0.0025134962,0.0015860414,0.0006780635,0.0010495051],"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.0067013684,0.0006175073,0.0072629126,0.00048659893,0.0001779972,0.0014737928,0.0017630768,0.05880508,0.124001235,0.08295044,0.012725771,0.7030343],"study_design_scores_gemma":[0.0006518893,0.0015002015,0.003542843,0.00013914301,0.00012876187,0.0018479914,0.0009868924,0.46337175,0.4174407,0.07530513,0.03495595,0.00012877071],"about_ca_topic_score_codex":0.0005548989,"about_ca_topic_score_gemma":0.00069043064,"teacher_disagreement_score":0.0058124736,"about_ca_system_score_codex":0.0005316855,"about_ca_system_score_gemma":0.00069826865,"threshold_uncertainty_score":0.019444644},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3526191,0.0025517088,0.5689766,0.0006099979,0.0004366973,0.0004862615,0.00065743254,0.01568665,0.057975445],"genre_scores_gemma":[0.85895985,0.00044534434,0.12929292,0.00015878849,0.000073880554,0.00013495573,0.0008081606,0.000099665776,0.01002638],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99985385,0.000013309303,0.000009880781,0.00002685793,0.000062700354,0.000033318618],"domain_scores_gemma":[0.9999069,0.000011481311,0.000010953706,0.000021465958,0.00003809752,0.00001105776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013176553,0.00038949805,0.00027262833,0.0004534904,0.00028235395,0.00038438037,0.00065121305,0.00022305794,0.0058684754],"category_scores_gemma":[0.0002695547,0.00012473005,0.00018631527,0.00037635505,0.00014033324,0.00071715476,0.00031891797,0.00037975202,0.0014081032],"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.0011952638,0.00024308398,0.0031247523,0.00050776097,0.000083477375,0.0010118667,0.00014659273,0.049626376,0.3530123,0.03229473,0.03236487,0.5263889],"study_design_scores_gemma":[0.00044646082,0.0016169972,0.0058218786,0.00011786892,0.00010841696,0.0021830252,0.00011844574,0.47227612,0.40954182,0.008214229,0.09945139,0.00010335033],"about_ca_topic_score_codex":0.0008889557,"about_ca_topic_score_gemma":0.0012006715,"teacher_disagreement_score":0.0058684754,"about_ca_system_score_codex":0.00048206197,"about_ca_system_score_gemma":0.00075075676,"threshold_uncertainty_score":0.019631982},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032207515,0.00047416234,0.9523299,0.00019705894,0.0002208943,0.00017512515,0.0001939668,0.004011051,0.010190319],"genre_scores_gemma":[0.12160965,0.00020915184,0.86754936,0.00010589024,0.000074443924,0.00015590647,0.0004933411,0.00023214515,0.009570165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997656,0.00004020163,0.0000131533725,0.000040297444,0.00010307235,0.000037739912],"domain_scores_gemma":[0.9998553,0.000027727188,0.000011112394,0.00003608562,0.00005506616,0.000014782897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022861935,0.00061222917,0.000651406,0.0006572035,0.0006263103,0.0005290129,0.0007832055,0.0004040697,0.009519315],"category_scores_gemma":[0.0006038328,0.00020293663,0.0004852543,0.0007652777,0.00032818477,0.00074900663,0.000677598,0.0005933235,0.0031861374],"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.0006780507,0.00017135419,0.0008620377,0.00038631912,0.00008842237,0.00027036353,0.0002298617,0.034162473,0.06018767,0.029274294,0.0120626455,0.8616265],"study_design_scores_gemma":[0.0007173444,0.0008508721,0.0015723672,0.00010166221,0.00012464184,0.0011627792,0.0002566963,0.80345094,0.080740705,0.041000806,0.06989598,0.00012526341],"about_ca_topic_score_codex":0.0038264808,"about_ca_topic_score_gemma":0.008493913,"teacher_disagreement_score":0.009519315,"about_ca_system_score_codex":0.0005054093,"about_ca_system_score_gemma":0.0012586752,"threshold_uncertainty_score":0.03184527},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.531112,0.0009064854,0.42752743,0.0021530949,0.0002283526,0.0001080718,0.00024028086,0.0013170274,0.036407173],"genre_scores_gemma":[0.9427683,0.00058749516,0.05137276,0.00023611194,0.000187096,0.000051611023,0.00023223089,0.00018328661,0.004381165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972995,0.0006712695,0.00017315768,0.00039034823,0.0009669973,0.00049880065],"domain_scores_gemma":[0.992282,0.004573136,0.0004852856,0.001698015,0.0005498684,0.00041159973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003651841,0.0012943415,0.001938335,0.003920618,0.001810597,0.004563093,0.0013625727,0.002065077,0.0062461854],"category_scores_gemma":[0.019340152,0.0007479478,0.0013351466,0.0023309882,0.0048336815,0.009210292,0.006736778,0.0039743213,0.0016232359],"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.00042898802,0.00011860286,0.008357362,0.00038862374,0.00015400563,0.0014890773,0.00116278,0.016047163,0.014530198,0.8738726,0.0030123466,0.08043814],"study_design_scores_gemma":[0.000065267326,0.00014102583,0.0013182331,0.00015511645,0.00005179997,0.0009936838,0.00041617226,0.057700243,0.041963752,0.89037675,0.0067380057,0.00007989623],"about_ca_topic_score_codex":0.0003097494,"about_ca_topic_score_gemma":0.00031052463,"teacher_disagreement_score":0.0062461854,"about_ca_system_score_codex":0.0011075421,"about_ca_system_score_gemma":0.00092579186,"threshold_uncertainty_score":0.02089554},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017883105,0.56712365,0.21405005,0.004688447,0.0030500742,0.0002846644,0.0011237054,0.0026312093,0.18916512],"genre_scores_gemma":[0.092359364,0.61184347,0.19110909,0.0029528856,0.0041906973,0.00031832137,0.004980529,0.0014554649,0.09079019],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876404,0.0002059377,0.00014603949,0.00024105735,0.0005033828,0.0001394824],"domain_scores_gemma":[0.99784636,0.000831872,0.0001606833,0.00046830127,0.00055165216,0.00014110775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001991447,0.0014843576,0.0010250903,0.005891962,0.00092491775,0.0024342628,0.0019849043,0.0010367291,0.027011445],"category_scores_gemma":[0.0045875926,0.001092291,0.00084050244,0.009210715,0.0010375289,0.0076193605,0.00222013,0.002283858,0.017842513],"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.00021953876,0.00014530747,0.00046480214,0.0024395394,0.000034461846,0.0000949153,0.00012660329,0.0024785216,0.005257333,0.051443707,0.0344735,0.90282184],"study_design_scores_gemma":[0.000050830822,0.0003662834,0.0007667766,0.0007885515,0.00006420888,0.0014626082,0.00011665878,0.005977044,0.012845759,0.039480407,0.9380041,0.000076887925],"about_ca_topic_score_codex":0.0007752329,"about_ca_topic_score_gemma":0.0011317213,"teacher_disagreement_score":0.027011445,"about_ca_system_score_codex":0.0013977574,"about_ca_system_score_gemma":0.0017950167,"threshold_uncertainty_score":0.09036231},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29672045,0.00046056803,0.6782773,0.00027001998,0.000216159,0.00024031448,0.00018616876,0.0044435654,0.019185506],"genre_scores_gemma":[0.71837,0.00018886534,0.27268577,0.00007383014,0.000037792954,0.000075352466,0.00023756982,0.000070852875,0.008260013],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999274,0.000012281656,0.000005432931,0.000013472202,0.000027637998,0.000013733333],"domain_scores_gemma":[0.99988973,0.000023428422,0.000013903986,0.000019101142,0.00004372641,0.000010092334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013266607,0.00034551928,0.0002339488,0.00033881646,0.000279618,0.0003579729,0.0004658039,0.00019560102,0.00402802],"category_scores_gemma":[0.0002642454,0.000130658,0.00014151643,0.00023892,0.00014445215,0.00040167224,0.00016143,0.00023738391,0.001063641],"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.0004354585,0.00014095636,0.0013318302,0.00025811815,0.000056616147,0.000708013,0.00021521356,0.0095389215,0.6360016,0.014960362,0.0036860686,0.33266678],"study_design_scores_gemma":[0.0002219985,0.003034496,0.00294075,0.000089514084,0.00011885953,0.0039994004,0.00016292937,0.17244792,0.74696314,0.007341782,0.06256312,0.00011612077],"about_ca_topic_score_codex":0.0004177723,"about_ca_topic_score_gemma":0.0009443158,"teacher_disagreement_score":0.00402802,"about_ca_system_score_codex":0.00025977026,"about_ca_system_score_gemma":0.00047584207,"threshold_uncertainty_score":0.01347506},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.500903,0.0010531015,0.4635848,0.00030889944,0.00015779845,0.0002487711,0.00024476857,0.008410109,0.025088733],"genre_scores_gemma":[0.87582374,0.0003452064,0.11818068,0.000053164054,0.00004162743,0.00008206255,0.00025935518,0.00011484937,0.0050993515],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970716,0.000034647932,0.000025762822,0.000040176288,0.00012547316,0.00006676074],"domain_scores_gemma":[0.99971896,0.000049335573,0.000038397786,0.00008022301,0.00009205353,0.000021031563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022020603,0.00064872,0.0004238922,0.00086860603,0.0004632006,0.00072550646,0.0007823462,0.00034247345,0.0045996695],"category_scores_gemma":[0.00067478063,0.0001753701,0.00028733417,0.0006782512,0.00031474687,0.0014132108,0.00063797634,0.00049281283,0.0014872873],"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.0014887457,0.00025179848,0.0053193388,0.000547392,0.00009969748,0.0010915808,0.000639403,0.040175,0.47395772,0.052306186,0.0067388024,0.4173843],"study_design_scores_gemma":[0.0003110915,0.0014308236,0.0038615644,0.00011253822,0.000090821704,0.0013732843,0.00016677352,0.26635334,0.66811645,0.014780715,0.043269116,0.0001336065],"about_ca_topic_score_codex":0.00092502875,"about_ca_topic_score_gemma":0.001146469,"teacher_disagreement_score":0.0045996695,"about_ca_system_score_codex":0.0006219107,"about_ca_system_score_gemma":0.0006908057,"threshold_uncertainty_score":0.015387416},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.565865,0.0009941229,0.403677,0.00028141754,0.00011625939,0.00017742206,0.00026706987,0.0035406258,0.025081072],"genre_scores_gemma":[0.7965165,0.00044190834,0.19675757,0.00004711783,0.000025943154,0.00006324152,0.0003376413,0.00007517253,0.0057349643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998282,0.000025934145,0.000012911094,0.000021532664,0.00008092608,0.00003051744],"domain_scores_gemma":[0.99983406,0.000047417816,0.000019667385,0.000039274884,0.000048400245,0.000011167858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015158618,0.0003807124,0.00026725314,0.0004564638,0.0001996111,0.00045063958,0.00048099778,0.00021235317,0.0036823328],"category_scores_gemma":[0.000573422,0.0001369359,0.0001541135,0.00059018674,0.00020929398,0.00075288955,0.00026783292,0.00027070698,0.0008641462],"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.0009510251,0.00017547933,0.0031068912,0.00040054167,0.00006401757,0.0007206777,0.00028607572,0.072118826,0.23066293,0.06630924,0.0067208125,0.6184835],"study_design_scores_gemma":[0.00039184146,0.0014113376,0.004988076,0.00011580481,0.00007269258,0.0013547246,0.00020701041,0.5224419,0.40024582,0.023262003,0.04541594,0.00009275665],"about_ca_topic_score_codex":0.00078866933,"about_ca_topic_score_gemma":0.0016323079,"teacher_disagreement_score":0.0036823328,"about_ca_system_score_codex":0.0004439866,"about_ca_system_score_gemma":0.00043788485,"threshold_uncertainty_score":0.012318671},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9744819,0.0003364417,0.0076425127,0.0004457847,0.0000551475,0.000030714265,0.00008499645,0.00013300545,0.016789407],"genre_scores_gemma":[0.9948597,0.0001897947,0.0014343113,0.000035817502,0.00007066123,0.000028906923,0.000112545866,0.000026086454,0.0032421818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933714,0.00015617097,0.000026234817,0.00009760132,0.00021925686,0.00016364627],"domain_scores_gemma":[0.9986027,0.00046895174,0.0002633814,0.00014883987,0.00017902769,0.0003371926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010703293,0.00073714537,0.0006994022,0.0034458272,0.0029957772,0.00214652,0.0009427584,0.0012349602,0.0073206536],"category_scores_gemma":[0.004692438,0.00066524313,0.0006606332,0.0016630469,0.0027876983,0.003150118,0.002518465,0.0016715896,0.00062859163],"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.00047281268,0.000098635755,0.008419415,0.00010614993,0.0000622495,0.0040652463,0.002613615,0.005721621,0.006881005,0.95707804,0.0021013336,0.012379827],"study_design_scores_gemma":[0.00026205543,0.00022137977,0.006813169,0.00014715995,0.00004952499,0.002961441,0.0016912495,0.020077676,0.004761786,0.9537622,0.009182148,0.00007024643],"about_ca_topic_score_codex":0.00069237436,"about_ca_topic_score_gemma":0.0004408325,"teacher_disagreement_score":0.0073206536,"about_ca_system_score_codex":0.0020779516,"about_ca_system_score_gemma":0.00037120935,"threshold_uncertainty_score":0.024489999},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01545506,0.009615515,0.9258231,0.004074136,0.0015664754,0.000154098,0.00006687169,0.0005530397,0.042691663],"genre_scores_gemma":[0.20014645,0.008091223,0.7506035,0.0012191648,0.0024449767,0.00025822077,0.0001424331,0.00047171704,0.036622304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801326,0.00068723026,0.000088718065,0.00027269372,0.0008052839,0.00013266767],"domain_scores_gemma":[0.9963664,0.0017443574,0.00016701977,0.0010245809,0.00061729347,0.00008033193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032133486,0.0011743131,0.00069886714,0.0020146873,0.0011673688,0.0018986434,0.0016117578,0.0011758046,0.010905254],"category_scores_gemma":[0.008897413,0.00055232015,0.0012514151,0.0016671591,0.0024347305,0.007780356,0.0021877934,0.003461525,0.002924733],"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.00013926958,0.000059275942,0.00028948483,0.0002589074,0.000029442503,0.00008847922,0.00022988513,0.008400137,0.0035125325,0.83859503,0.0065812743,0.14181624],"study_design_scores_gemma":[0.00016378883,0.0002649768,0.00028829445,0.00028048814,0.000040905485,0.00055282685,0.0000917723,0.08998442,0.009997622,0.7546322,0.14363827,0.000064468535],"about_ca_topic_score_codex":0.0005627045,"about_ca_topic_score_gemma":0.00036608768,"teacher_disagreement_score":0.010905254,"about_ca_system_score_codex":0.0015204106,"about_ca_system_score_gemma":0.0007652296,"threshold_uncertainty_score":0.036481738},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032492515,0.00045283226,0.92619985,0.0004697289,0.00037006848,0.00011573632,0.0008568541,0.010962999,0.028079301],"genre_scores_gemma":[0.1913068,0.00050063105,0.7678475,0.0002178342,0.000256931,0.00015282034,0.0022638033,0.004583054,0.03287057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998384,0.00020088285,0.00015994163,0.00047365465,0.0005422016,0.0002392827],"domain_scores_gemma":[0.9977958,0.0008506592,0.00013497508,0.00063523476,0.00045940507,0.00012393348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015622386,0.0014536275,0.0011659057,0.0024177732,0.0014910117,0.004899841,0.002033013,0.00093931856,0.030242376],"category_scores_gemma":[0.0065773595,0.0007066029,0.0018831331,0.0020079154,0.0017893423,0.009099288,0.0046046674,0.0027838198,0.0133530935],"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.00032896356,0.00010101284,0.0018974893,0.00058872387,0.00005736622,0.00046661583,0.0013021735,0.0060354816,0.0117171835,0.4992818,0.020882592,0.45734063],"study_design_scores_gemma":[0.000092056194,0.00009727227,0.0006263529,0.00017708473,0.000071146635,0.00049496384,0.00062274525,0.033993382,0.027828762,0.83757246,0.09832597,0.00009784147],"about_ca_topic_score_codex":0.0023486016,"about_ca_topic_score_gemma":0.0038164023,"teacher_disagreement_score":0.030242376,"about_ca_system_score_codex":0.0016749725,"about_ca_system_score_gemma":0.0011611201,"threshold_uncertainty_score":0.10117084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084639594,0.0019216951,0.8616652,0.00056236616,0.0007962854,0.00039872256,0.001076203,0.011845093,0.03709485],"genre_scores_gemma":[0.31218505,0.0013648686,0.6281468,0.00045355948,0.00027557838,0.00041812356,0.0024942465,0.00073966815,0.053922106],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998211,0.000021768179,0.000014855144,0.00003997989,0.00007218375,0.000029976583],"domain_scores_gemma":[0.9998173,0.000036577458,0.000030381756,0.00004284069,0.00006008146,0.0000128214915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022093054,0.0009238374,0.00032229943,0.00055471726,0.0004096975,0.0006501795,0.0010695191,0.0003590281,0.02683656],"category_scores_gemma":[0.00061826454,0.00028734843,0.00037231384,0.0007647634,0.000245541,0.001378249,0.00058563956,0.000831651,0.007264284],"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.0008543998,0.00022908731,0.0005436578,0.0008071429,0.00006306382,0.0004216306,0.00015603041,0.013445231,0.22287948,0.057169158,0.034271,0.66916007],"study_design_scores_gemma":[0.00058883236,0.0017739702,0.0017262043,0.00023667589,0.00013525668,0.0019139274,0.000116557414,0.25674477,0.4340543,0.025004288,0.2775309,0.00017423465],"about_ca_topic_score_codex":0.00072304724,"about_ca_topic_score_gemma":0.0020586152,"teacher_disagreement_score":0.02683656,"about_ca_system_score_codex":0.00062911253,"about_ca_system_score_gemma":0.0010860038,"threshold_uncertainty_score":0.08977717},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02116968,0.00033149627,0.9701846,0.00014233505,0.00012680676,0.00011190005,0.00007737493,0.0013441016,0.0065117804],"genre_scores_gemma":[0.09737712,0.00023101333,0.89756304,0.00010341255,0.00008322613,0.00009570101,0.00019229038,0.00014504364,0.004209076],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995214,0.00008523924,0.000052795684,0.000105402374,0.0001880178,0.0000472026],"domain_scores_gemma":[0.9996068,0.00009362213,0.000039079205,0.000113524075,0.00012056315,0.000026372303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005467203,0.00050288695,0.00058558484,0.0010258602,0.00050313456,0.0011703522,0.0008972723,0.0004768926,0.004242618],"category_scores_gemma":[0.00138844,0.00022218915,0.0004191967,0.0008445084,0.000452771,0.0021416713,0.00083039794,0.0010837973,0.0018166414],"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.00060146523,0.00015987326,0.0006353784,0.00022404728,0.00004057152,0.00027390386,0.0002826373,0.019434597,0.102477305,0.18896535,0.0070006335,0.67990416],"study_design_scores_gemma":[0.00063859683,0.0008704394,0.0010922537,0.0001506368,0.000114696406,0.0020915694,0.00017365212,0.5543115,0.18903758,0.17121321,0.080167145,0.0001387014],"about_ca_topic_score_codex":0.00041468974,"about_ca_topic_score_gemma":0.0005668292,"teacher_disagreement_score":0.004242618,"about_ca_system_score_codex":0.0005919509,"about_ca_system_score_gemma":0.0009525851,"threshold_uncertainty_score":0.014192998},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095044546,0.0010763753,0.8957277,0.00019821215,0.000121763296,0.000091627495,0.00011776204,0.0012907792,0.006331279],"genre_scores_gemma":[0.4590134,0.0009605014,0.5332312,0.00014746,0.000099873716,0.00011583036,0.00027755348,0.000051571453,0.006102533],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99989176,0.000022406572,0.000011352693,0.000013576217,0.000051110488,0.00000979189],"domain_scores_gemma":[0.999777,0.000060680253,0.000037608123,0.000042484393,0.00006905796,0.000013213243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019222366,0.00025536676,0.00019407412,0.00035554267,0.00028318405,0.00041559816,0.0005114397,0.00025127828,0.0027259637],"category_scores_gemma":[0.00057308923,0.00012540685,0.00020816037,0.00053341215,0.00023517685,0.00058713515,0.0002589488,0.0003705987,0.0008051535],"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.00044472574,0.00019861084,0.001092304,0.00044390367,0.000045193014,0.00038953742,0.00020106818,0.02689032,0.2763835,0.13132602,0.004395623,0.5581892],"study_design_scores_gemma":[0.00023550853,0.002247014,0.0029839145,0.00016232593,0.000115209004,0.002056451,0.00014502218,0.58373404,0.26508763,0.08309586,0.06003294,0.0001041331],"about_ca_topic_score_codex":0.0002294323,"about_ca_topic_score_gemma":0.0007776557,"teacher_disagreement_score":0.0027259637,"about_ca_system_score_codex":0.00026975677,"about_ca_system_score_gemma":0.00069863343,"threshold_uncertainty_score":0.009119213},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37497866,0.00969769,0.5388125,0.0011376452,0.0007454217,0.00015260885,0.0001601806,0.006689466,0.06762576],"genre_scores_gemma":[0.85168314,0.0026168916,0.11873388,0.00024487416,0.00025270463,0.00004444553,0.00021367126,0.00054613466,0.02566422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994542,0.000113772054,0.000035095578,0.000058007034,0.000266394,0.00007249891],"domain_scores_gemma":[0.9988117,0.00045322828,0.000089242705,0.00027254436,0.0003175682,0.000055709523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004970552,0.0005765197,0.00030787688,0.00069327635,0.00027837817,0.0014990931,0.0009840337,0.00046286336,0.0073848157],"category_scores_gemma":[0.002524375,0.0003183396,0.0002660141,0.00093360554,0.000347759,0.0016315317,0.0005081272,0.0007707088,0.0015747149],"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.001225961,0.00021370487,0.0014560259,0.0007191701,0.00007127202,0.00030169397,0.00029721524,0.028063366,0.1325937,0.09796532,0.0066565443,0.73043597],"study_design_scores_gemma":[0.00039319953,0.0021662575,0.0024139604,0.0006144587,0.00027120204,0.0017863234,0.00019265796,0.40365788,0.4044899,0.06621935,0.11766014,0.000134714],"about_ca_topic_score_codex":0.00052855595,"about_ca_topic_score_gemma":0.0006699698,"teacher_disagreement_score":0.0073848157,"about_ca_system_score_codex":0.0004454188,"about_ca_system_score_gemma":0.0007151193,"threshold_uncertainty_score":0.024704635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22100373,0.0013540544,0.68969643,0.0021702321,0.00060279825,0.00020191212,0.00029692182,0.0017495357,0.08292444],"genre_scores_gemma":[0.81132835,0.0013950164,0.1552162,0.0005420362,0.000974738,0.00014394974,0.0002513659,0.00043556452,0.02971273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965906,0.00011826822,0.000012062966,0.000061301944,0.000104851,0.000044500604],"domain_scores_gemma":[0.9982527,0.0009652718,0.00018123658,0.000260315,0.00017041781,0.00017008885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055952265,0.0005558883,0.00087245816,0.002589431,0.0009311586,0.0013056558,0.00074975006,0.0010281644,0.0071247537],"category_scores_gemma":[0.0029447582,0.0003242392,0.00056896865,0.0019578862,0.0017523317,0.0025445847,0.0016757493,0.0016519411,0.0009450809],"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.00007689639,0.000053861197,0.00027578574,0.00004658596,0.000009073419,0.00025306846,0.00021654744,0.010678119,0.0030496742,0.94280696,0.0030614515,0.039471943],"study_design_scores_gemma":[0.000025436751,0.000048282076,0.00030115925,0.000020358448,0.000018176592,0.00034223034,0.0000854097,0.08216343,0.0020544995,0.9081973,0.006711558,0.000032114523],"about_ca_topic_score_codex":0.00043771436,"about_ca_topic_score_gemma":0.000563657,"teacher_disagreement_score":0.0071247537,"about_ca_system_score_codex":0.00055281445,"about_ca_system_score_gemma":0.00037375465,"threshold_uncertainty_score":0.023834646},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0503291,0.008798254,0.06948961,0.0059542605,0.005136836,0.000059320704,0.00025275542,0.00039917146,0.8595808],"genre_scores_gemma":[0.36145025,0.007368514,0.049475,0.0030507206,0.0032151153,0.00008402452,0.00033978422,0.00043647992,0.57458013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964726,0.000078500394,0.000018205585,0.00007252439,0.00013657693,0.000046906833],"domain_scores_gemma":[0.99969995,0.00007435531,0.000023012024,0.00010596035,0.00006611722,0.000030621708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005627123,0.001011049,0.00091655605,0.0017052005,0.0010031894,0.0022129463,0.0005818709,0.0009331146,0.023597024],"category_scores_gemma":[0.0012007533,0.00033188338,0.0006456139,0.0015514762,0.0019063387,0.005708056,0.0012268634,0.0032774361,0.0043779053],"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.000022131453,0.000015563524,0.000035361038,0.00006328929,0.0000046522377,0.00004475898,0.00017802321,0.0004198228,0.0011316476,0.9732503,0.0053588906,0.019475495],"study_design_scores_gemma":[0.000013743315,0.00003127324,0.00013434835,0.00004449145,0.000008350557,0.00024835867,0.00007809901,0.00076387264,0.00063634594,0.8654508,0.13257347,0.000016879823],"about_ca_topic_score_codex":0.00033894423,"about_ca_topic_score_gemma":0.0007364706,"teacher_disagreement_score":0.023597024,"about_ca_system_score_codex":0.0011346482,"about_ca_system_score_gemma":0.00035011183,"threshold_uncertainty_score":0.078939915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21634945,0.023715882,0.68738353,0.0008271993,0.00034523866,0.0001449686,0.00016477836,0.00035477246,0.070714146],"genre_scores_gemma":[0.6090548,0.023514764,0.3568759,0.0003511651,0.00040052485,0.00015577336,0.00032354222,0.00016074836,0.009162822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953604,0.00008045057,0.000051145635,0.000079792,0.00022077003,0.000031832005],"domain_scores_gemma":[0.99926156,0.00046299023,0.00008419569,0.00008767482,0.00008201987,0.00002148527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007343926,0.0006333596,0.00059099455,0.0011866976,0.0005902619,0.0015389675,0.00044598593,0.0004811023,0.002434273],"category_scores_gemma":[0.0022542034,0.00027541642,0.00064116,0.0019355753,0.00076605,0.00349837,0.0004990603,0.0013317073,0.0007104084],"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.00017549626,0.00007152201,0.0008169671,0.0006694473,0.000031601754,0.0003461226,0.00030940675,0.03637242,0.025548061,0.67739135,0.0019532398,0.25631434],"study_design_scores_gemma":[0.000037573533,0.0004132393,0.0011493734,0.0003594734,0.00006618515,0.0017669913,0.0001622747,0.12968771,0.047067616,0.73996884,0.07922186,0.000098846656],"about_ca_topic_score_codex":0.00012323771,"about_ca_topic_score_gemma":0.00008047008,"teacher_disagreement_score":0.002434273,"about_ca_system_score_codex":0.0005329004,"about_ca_system_score_gemma":0.00044810068,"threshold_uncertainty_score":0.008143485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15507479,0.0017191867,0.82200986,0.00036341374,0.00025417082,0.00018648227,0.000313568,0.006423011,0.013655545],"genre_scores_gemma":[0.54990995,0.0010232449,0.42136526,0.00020333185,0.00013119861,0.00015456896,0.0010979208,0.00023656234,0.025877953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985075,0.000020359606,0.000010203659,0.000020891834,0.00007572199,0.000022006237],"domain_scores_gemma":[0.99984574,0.0000345971,0.000022692859,0.000024497127,0.000061612685,0.000010925493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002184992,0.0003933117,0.00029392436,0.00041794265,0.00029086575,0.0003836129,0.0006281643,0.0002626329,0.0053752265],"category_scores_gemma":[0.00043414434,0.0001482306,0.00017215329,0.0007374335,0.00021057103,0.00081579655,0.00034345614,0.00031934728,0.0017298673],"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.00089157483,0.00015131418,0.0013417249,0.00030812292,0.000037140482,0.00038392702,0.00010579814,0.015603934,0.41512895,0.03520381,0.01179124,0.51905245],"study_design_scores_gemma":[0.00036411182,0.0020948234,0.0023399596,0.000071077324,0.000085207255,0.0018552878,0.00010211053,0.24801658,0.6295992,0.012690327,0.10270983,0.00007151601],"about_ca_topic_score_codex":0.00030874077,"about_ca_topic_score_gemma":0.0006703339,"teacher_disagreement_score":0.0053752265,"about_ca_system_score_codex":0.00024453943,"about_ca_system_score_gemma":0.0004074383,"threshold_uncertainty_score":0.017981946},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06222155,0.0017047144,0.88106525,0.0010181507,0.0009246062,0.00012387821,0.00016370697,0.0008785316,0.0518996],"genre_scores_gemma":[0.46692064,0.0017726735,0.5109891,0.00034379677,0.0010149567,0.00018036482,0.00027632117,0.00023857274,0.018263564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994388,0.00011870099,0.000039621616,0.00010870552,0.00022094738,0.00007322181],"domain_scores_gemma":[0.99955934,0.00011480074,0.0000629322,0.0001327178,0.00009630366,0.000033939632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006022844,0.0004524599,0.00040047764,0.00064543204,0.00083608355,0.0014211627,0.0006986797,0.00038982715,0.004318639],"category_scores_gemma":[0.0016150653,0.00020212193,0.000583062,0.00076884625,0.0016366544,0.0035183076,0.0011923782,0.0012664052,0.0023789892],"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.000060614057,0.000016210824,0.00017656905,0.00007308815,0.00000673273,0.000091143855,0.00013948846,0.003609238,0.006657196,0.9222625,0.0025483114,0.064358905],"study_design_scores_gemma":[0.000052254527,0.00026940132,0.00027027036,0.000041243526,0.000022414439,0.00057865516,0.00007841663,0.03850594,0.016477283,0.8519486,0.091719665,0.000035830126],"about_ca_topic_score_codex":0.00016753848,"about_ca_topic_score_gemma":0.00018777559,"teacher_disagreement_score":0.004318639,"about_ca_system_score_codex":0.0004995746,"about_ca_system_score_gemma":0.0005069958,"threshold_uncertainty_score":0.014447212},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16289465,0.0022484905,0.8033525,0.0005456006,0.0004263576,0.00021013303,0.00036045394,0.0028451763,0.027116694],"genre_scores_gemma":[0.4699038,0.0013182893,0.50984114,0.00016212669,0.000104956845,0.00013914499,0.00070761,0.000082998085,0.017739795],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998306,0.000038039903,0.000014524925,0.000025553669,0.0000688396,0.000022401246],"domain_scores_gemma":[0.99977726,0.00004853889,0.000034552326,0.000044652796,0.00007972545,0.00001531644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021549177,0.0004984786,0.0002894182,0.00066525454,0.00028221507,0.00052591984,0.00060673745,0.00026989364,0.0051254453],"category_scores_gemma":[0.00063186826,0.00019657586,0.00017352462,0.00070280436,0.00021560439,0.0012639837,0.0003823637,0.00040471234,0.0019410712],"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.00089907023,0.0001817293,0.0010175222,0.00057281443,0.000054207925,0.0003033581,0.00018473357,0.019556167,0.18892673,0.12671575,0.009043546,0.6525444],"study_design_scores_gemma":[0.0005650448,0.0019710842,0.0028805374,0.0002217032,0.00016026552,0.0034532738,0.00021388092,0.3181979,0.46390316,0.06966647,0.13864373,0.00012292847],"about_ca_topic_score_codex":0.00034912574,"about_ca_topic_score_gemma":0.0012544385,"teacher_disagreement_score":0.0051254453,"about_ca_system_score_codex":0.00036712288,"about_ca_system_score_gemma":0.000521149,"threshold_uncertainty_score":0.01714629},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3465575,0.0019636708,0.59801185,0.0004639404,0.0003846696,0.00032874264,0.00052570185,0.009822602,0.041941386],"genre_scores_gemma":[0.775096,0.00037068126,0.21197043,0.00013306786,0.00008960385,0.0001126065,0.0007033318,0.000100819474,0.011423472],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99988353,0.000013740655,0.0000091330285,0.000026439046,0.0000425435,0.000024570236],"domain_scores_gemma":[0.99985087,0.000032003078,0.000018607863,0.000033017386,0.000051237283,0.000014258765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016050403,0.00035246514,0.00034408952,0.0004559494,0.0002780983,0.0003644125,0.0005381105,0.00025310184,0.0068609277],"category_scores_gemma":[0.00033707058,0.00010149667,0.00019226856,0.000573428,0.00014488876,0.00075864396,0.00032253552,0.00031349866,0.0018398322],"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.00084938726,0.00020757147,0.001657979,0.00035420025,0.00006041383,0.0008993033,0.0001426554,0.024675438,0.4605722,0.019496724,0.015351745,0.4757324],"study_design_scores_gemma":[0.00037352403,0.0027998118,0.0055474937,0.0001361025,0.00013677104,0.0028679804,0.00019802911,0.36642456,0.5287568,0.010426955,0.08224664,0.00008532598],"about_ca_topic_score_codex":0.0004086689,"about_ca_topic_score_gemma":0.00074835704,"teacher_disagreement_score":0.0068609277,"about_ca_system_score_codex":0.00030024973,"about_ca_system_score_gemma":0.00049380946,"threshold_uncertainty_score":0.02295214},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48645687,0.0033183026,0.44797656,0.0007310703,0.000625958,0.00036972086,0.00064516015,0.008975416,0.050901],"genre_scores_gemma":[0.88318706,0.00038462653,0.104354955,0.0002175315,0.00007431394,0.000051155508,0.0002741419,0.00009029273,0.011365853],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99985754,0.000018176812,0.000009606309,0.000041760388,0.00004156213,0.00003125514],"domain_scores_gemma":[0.99980444,0.000024915735,0.00004496198,0.000060623155,0.000048125323,0.00001695226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009667752,0.0003170366,0.00027211985,0.00040748666,0.0002098811,0.00044974012,0.0008004348,0.00030330403,0.0038975282],"category_scores_gemma":[0.00024596113,0.00012967126,0.0002301062,0.00039859972,0.00013562563,0.0003470236,0.00017112959,0.00026839404,0.0012405],"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.0008274558,0.00016437398,0.0026089624,0.00038212305,0.000083825056,0.0014461057,0.000106700805,0.02345511,0.5944116,0.0074250195,0.0076605505,0.36142823],"study_design_scores_gemma":[0.00030795875,0.0040160585,0.009876353,0.00011381567,0.0002672374,0.007476675,0.00007643584,0.16908139,0.7091079,0.0020210918,0.097545065,0.0001100378],"about_ca_topic_score_codex":0.0004517645,"about_ca_topic_score_gemma":0.0005627936,"teacher_disagreement_score":0.0038975282,"about_ca_system_score_codex":0.00026772646,"about_ca_system_score_gemma":0.00030204645,"threshold_uncertainty_score":0.013038516},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017284645,0.0015378768,0.9376151,0.0011920482,0.0008423579,0.0001183791,0.00012709154,0.0011741992,0.04010835],"genre_scores_gemma":[0.2157578,0.0023551704,0.7543471,0.0008028944,0.0013752911,0.00027449414,0.0003456382,0.0003931741,0.024348378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897146,0.00025368066,0.00009964479,0.00018873965,0.00039687136,0.00008958924],"domain_scores_gemma":[0.99888796,0.00029215685,0.000101355414,0.0003883631,0.00023555369,0.00009463242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007760585,0.0006716942,0.00063495035,0.0013584037,0.001083196,0.0031193914,0.0011632623,0.0010304673,0.010234672],"category_scores_gemma":[0.0043698237,0.00040859933,0.0005747481,0.0024395904,0.0023162179,0.0055496856,0.002825536,0.002326444,0.004572375],"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.00014112589,0.00004790717,0.00021446192,0.000109642206,0.000006202809,0.0001423128,0.00025552404,0.0056710388,0.007369483,0.7696349,0.0067837364,0.20962368],"study_design_scores_gemma":[0.00006306661,0.00022496175,0.00018553657,0.00012878723,0.000018611669,0.00087050395,0.00016804712,0.07748764,0.011821754,0.7362246,0.17272867,0.00007777874],"about_ca_topic_score_codex":0.0003476905,"about_ca_topic_score_gemma":0.0002893997,"teacher_disagreement_score":0.010234672,"about_ca_system_score_codex":0.00081705605,"about_ca_system_score_gemma":0.00068335515,"threshold_uncertainty_score":0.034238458},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032758344,0.0026915695,0.945194,0.00024793038,0.00044688754,0.00011760446,0.0000604375,0.0005889882,0.01789434],"genre_scores_gemma":[0.36864156,0.0030747198,0.61870795,0.00034402646,0.00029710043,0.00013884438,0.00015226983,0.00015855861,0.008484887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914396,0.00016696245,0.00011029904,0.00015027731,0.00036279732,0.00006565768],"domain_scores_gemma":[0.9990138,0.00036781054,0.00010975639,0.00029675258,0.00018427106,0.000027568434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013582006,0.00068093906,0.00051800936,0.00092064735,0.00042967146,0.001319247,0.0011222017,0.00043297122,0.002618479],"category_scores_gemma":[0.0030230195,0.00026558558,0.00084151374,0.0007412127,0.0010571536,0.0026450306,0.0008586694,0.0011841536,0.0011365636],"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.00035507482,0.000047390018,0.00073440827,0.0004384999,0.00006877548,0.00047652083,0.0004283069,0.034393847,0.038361482,0.5780932,0.0026521555,0.34395033],"study_design_scores_gemma":[0.00019326064,0.0008461669,0.0010593637,0.00025414946,0.00022201671,0.0032026737,0.00019814842,0.28132525,0.26536438,0.27398157,0.17313914,0.00021390838],"about_ca_topic_score_codex":0.00030301503,"about_ca_topic_score_gemma":0.0003496417,"teacher_disagreement_score":0.002618479,"about_ca_system_score_codex":0.0007185469,"about_ca_system_score_gemma":0.000578854,"threshold_uncertainty_score":0.008759737},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03708023,0.00084593636,0.9451862,0.0002481301,0.0003545247,0.00026110216,0.00021521536,0.0017695496,0.014039099],"genre_scores_gemma":[0.26593634,0.00062102126,0.7168218,0.00017234763,0.0002575325,0.00024369493,0.000623462,0.00032153272,0.0150021985],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941874,0.00006766623,0.0000557538,0.000097433425,0.0002942226,0.000066093075],"domain_scores_gemma":[0.99928206,0.00014709786,0.00006276443,0.00033210433,0.00012847416,0.000047603262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065233203,0.00060277624,0.0005831187,0.0008576236,0.00071624055,0.001254919,0.0007232674,0.00046552136,0.0077559445],"category_scores_gemma":[0.0017210181,0.00031890368,0.0005425776,0.0007727859,0.0007960466,0.0027152735,0.0016222139,0.0018146624,0.0028335762],"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.0006140777,0.00021241892,0.0006828921,0.0004526206,0.00004139097,0.00035300525,0.00040484197,0.008643381,0.14803115,0.3799677,0.008740647,0.45185584],"study_design_scores_gemma":[0.00026826333,0.0013545863,0.0016432588,0.00012341439,0.00013025822,0.003592524,0.00015127967,0.15764289,0.39905673,0.25957918,0.17625211,0.00020558579],"about_ca_topic_score_codex":0.0001508718,"about_ca_topic_score_gemma":0.0003105208,"teacher_disagreement_score":0.0077559445,"about_ca_system_score_codex":0.00046272553,"about_ca_system_score_gemma":0.0008746681,"threshold_uncertainty_score":0.0259462},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019375134,0.0030052958,0.96377987,0.0009383984,0.00021802161,0.00021607011,0.00002474615,0.00043943277,0.012003038],"genre_scores_gemma":[0.6577705,0.005635173,0.3278779,0.00057007343,0.0010078918,0.00048772543,0.00008478365,0.00013749072,0.0064284145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959149,0.0010788362,0.00029079572,0.00045369117,0.0020206259,0.00024119359],"domain_scores_gemma":[0.9932708,0.0034785806,0.0010443548,0.0014291528,0.000666175,0.00011097359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021238846,0.0017146914,0.00082604034,0.00340055,0.0008948044,0.002699553,0.0017648528,0.0018363643,0.0029610842],"category_scores_gemma":[0.010380053,0.0005868893,0.0010014642,0.0014854854,0.003715545,0.004673486,0.002046277,0.0023128518,0.0006965306],"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.0004052054,0.00022177606,0.0010841398,0.0006634556,0.00017121696,0.00036978777,0.00032811685,0.10660356,0.022776766,0.60283875,0.002133877,0.26240325],"study_design_scores_gemma":[0.0001498835,0.0005772892,0.0007653114,0.0002956066,0.00015203722,0.0016911335,0.0001550514,0.4966477,0.049581207,0.43117884,0.018666148,0.00013985929],"about_ca_topic_score_codex":0.00013690887,"about_ca_topic_score_gemma":0.00018490336,"teacher_disagreement_score":0.00340055,"about_ca_system_score_codex":0.0009421513,"about_ca_system_score_gemma":0.0010024079,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23343995,0.0003952536,0.75860345,0.0003255618,0.000083984465,0.00012963756,0.00007451654,0.003284552,0.003663108],"genre_scores_gemma":[0.8760734,0.00009290687,0.12180069,0.000056312776,0.000037382404,0.000058967573,0.00006129325,0.00006273014,0.0017563448],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99781185,0.0006495021,0.00017910749,0.00042734074,0.0007522682,0.00017991468],"domain_scores_gemma":[0.9939459,0.0020656255,0.001120091,0.002232669,0.0005559657,0.00007988018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014775608,0.00041851512,0.00065776176,0.000750844,0.0004964593,0.00084818865,0.0009807387,0.00059178926,0.0015027291],"category_scores_gemma":[0.0074569294,0.00022497596,0.00037336437,0.00082088157,0.0010729632,0.0013384492,0.0010195834,0.00060716644,0.0003643154],"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.00261063,0.0002868433,0.0061041988,0.00037851257,0.0001121192,0.0009951169,0.0004844552,0.2279192,0.15956102,0.16307017,0.0026020347,0.43587568],"study_design_scores_gemma":[0.0001256738,0.00062305527,0.0011003794,0.00005562761,0.00006222129,0.00084050756,0.000048795082,0.7603351,0.19847764,0.033134237,0.0051455544,0.000051194973],"about_ca_topic_score_codex":0.0002555543,"about_ca_topic_score_gemma":0.000239635,"teacher_disagreement_score":0.0015027291,"about_ca_system_score_codex":0.00069323304,"about_ca_system_score_gemma":0.0008508097,"threshold_uncertainty_score":0.007814169},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055353887,0.010303558,0.8504442,0.0014647198,0.0013696417,0.00024846735,0.000130052,0.0015666819,0.079118825],"genre_scores_gemma":[0.52802885,0.006185262,0.44348374,0.00035176665,0.00072109845,0.00018682843,0.0002782536,0.00020040154,0.020563805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927956,0.00017437617,0.00006288987,0.00011047141,0.00027543746,0.0000972856],"domain_scores_gemma":[0.99948335,0.00014770868,0.00005202815,0.00014834535,0.00010483637,0.00006363288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008306207,0.00079594343,0.0006757662,0.0014535451,0.0013133816,0.0042804945,0.00092671096,0.0010221978,0.004349401],"category_scores_gemma":[0.0025753814,0.00037338428,0.00038109167,0.0016269463,0.0024196645,0.0044055744,0.0017946356,0.001815865,0.0027842566],"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.00022839177,0.000049114074,0.00048683927,0.00017586633,0.000009538892,0.00018137366,0.00017156563,0.005671269,0.007023759,0.81162536,0.004732915,0.16964403],"study_design_scores_gemma":[0.00010935041,0.0002782485,0.00031956463,0.00025917834,0.000026791951,0.0013597794,0.00019235957,0.043626834,0.023534236,0.82277185,0.10742125,0.000100560355],"about_ca_topic_score_codex":0.00024088666,"about_ca_topic_score_gemma":0.00021365499,"teacher_disagreement_score":0.004349401,"about_ca_system_score_codex":0.0009746723,"about_ca_system_score_gemma":0.00096978294,"threshold_uncertainty_score":0.014550209},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25041774,0.0013044025,0.72930217,0.00035566755,0.0004507015,0.0001649457,0.00019925415,0.0025060498,0.015299066],"genre_scores_gemma":[0.5430859,0.00049721135,0.44387168,0.00016274909,0.00015222431,0.00007822859,0.00031795693,0.00005674039,0.011777352],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999013,0.00001848707,0.000010671664,0.00002259465,0.000030048941,0.000016836504],"domain_scores_gemma":[0.9998553,0.000028005588,0.000028337277,0.000025207686,0.00005155144,0.0000114700815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020299587,0.00040254777,0.00033987255,0.00048582244,0.00034926223,0.00039805748,0.0005659091,0.0003502078,0.0034029505],"category_scores_gemma":[0.00034842218,0.00015764206,0.0003050888,0.00051440153,0.00018897107,0.00073029805,0.00022555371,0.00033803002,0.0009914554],"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.00080730417,0.00014502602,0.0008465648,0.00045468193,0.00010543977,0.001087942,0.00019294333,0.014609959,0.47191584,0.047016717,0.005805521,0.45701206],"study_design_scores_gemma":[0.00035556554,0.0048468392,0.0033296735,0.00019143567,0.00038208254,0.007885005,0.00018478296,0.32806006,0.5370829,0.0220348,0.09543303,0.00021377322],"about_ca_topic_score_codex":0.00034932554,"about_ca_topic_score_gemma":0.001047418,"teacher_disagreement_score":0.0034029505,"about_ca_system_score_codex":0.000241523,"about_ca_system_score_gemma":0.0005145533,"threshold_uncertainty_score":0.01138401},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03554218,0.0012488244,0.94168603,0.00090657955,0.00033338208,0.00029336743,0.00017051857,0.0012424451,0.018576613],"genre_scores_gemma":[0.36152732,0.0006141318,0.6193629,0.00037601075,0.00016048968,0.00032085052,0.00047868062,0.00013055262,0.017029086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933475,0.00015897144,0.000051168758,0.00014386603,0.00021134072,0.000099858386],"domain_scores_gemma":[0.9995566,0.00017198794,0.00003502835,0.00014684306,0.000059837042,0.000029689729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091886177,0.0004756031,0.00051622407,0.0006068899,0.0007824729,0.001297395,0.0007868103,0.0007881048,0.0044955537],"category_scores_gemma":[0.0023039433,0.00021821294,0.00048664652,0.00063808914,0.00082844176,0.0029403346,0.002026606,0.0010249068,0.0018849875],"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.00075419666,0.00015627146,0.0007947257,0.00032040366,0.00009455105,0.0003240618,0.00039822058,0.037201066,0.022271806,0.54451674,0.016341712,0.37682632],"study_design_scores_gemma":[0.00035834298,0.00040008235,0.000805113,0.00020188728,0.00007255525,0.0011440082,0.00025149056,0.40862226,0.025993036,0.45355237,0.1085271,0.000071765295],"about_ca_topic_score_codex":0.0003821403,"about_ca_topic_score_gemma":0.0004968662,"teacher_disagreement_score":0.0044955537,"about_ca_system_score_codex":0.0007133707,"about_ca_system_score_gemma":0.0010723441,"threshold_uncertainty_score":0.015039146},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47399318,0.00435762,0.47300604,0.00079731736,0.0005281329,0.00035967687,0.00042297604,0.010519395,0.036015663],"genre_scores_gemma":[0.791386,0.00067141664,0.1876954,0.00031061907,0.0001169181,0.00016783719,0.00083484914,0.0001478753,0.018669045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997881,0.000034284007,0.00001757361,0.0000436755,0.000071835064,0.000044606673],"domain_scores_gemma":[0.99980253,0.00002660743,0.000026039475,0.00003777641,0.00009036269,0.000016748287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019721963,0.0006165871,0.00043604375,0.00093989825,0.00056886615,0.00063692196,0.0016667655,0.00038002018,0.0081395665],"category_scores_gemma":[0.00037485207,0.0002606992,0.0003176956,0.0008358465,0.00023885646,0.0013486434,0.0005646906,0.0006515799,0.0021868297],"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.0016291988,0.00043305045,0.0027393682,0.0007448683,0.00018831775,0.0010682886,0.000557466,0.020303382,0.35590693,0.030809512,0.028411433,0.55720806],"study_design_scores_gemma":[0.00079522975,0.006329869,0.005113387,0.0003071576,0.00061972137,0.00287506,0.00063474744,0.47109994,0.38188526,0.036816694,0.09320167,0.00032130923],"about_ca_topic_score_codex":0.0011237646,"about_ca_topic_score_gemma":0.003073857,"teacher_disagreement_score":0.0081395665,"about_ca_system_score_codex":0.0005509085,"about_ca_system_score_gemma":0.000874349,"threshold_uncertainty_score":0.027229607},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006734258,0.0004569669,0.98785806,0.0001323926,0.000054685595,0.000068758956,0.000036682006,0.0005979779,0.004060342],"genre_scores_gemma":[0.12666456,0.0015440728,0.8654814,0.00014818949,0.00023583029,0.00017326842,0.00024983843,0.00019783968,0.0053050104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838114,0.0003928544,0.00013411666,0.00024128365,0.00065647333,0.00019405426],"domain_scores_gemma":[0.998906,0.00031801948,0.00012588118,0.00045856924,0.000147658,0.000043855576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012741303,0.00095520983,0.0009941416,0.0015934736,0.0009134379,0.0023608452,0.0017643312,0.00063284795,0.0047622775],"category_scores_gemma":[0.0032673082,0.00047210342,0.001243487,0.0017620174,0.0016471283,0.0058293096,0.002773238,0.0020836103,0.0031449804],"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.0002545304,0.00011088297,0.0005185133,0.00027278913,0.000050679475,0.00015546895,0.00031200144,0.019868765,0.01497018,0.52262455,0.0037984718,0.43706316],"study_design_scores_gemma":[0.00019849728,0.00059672346,0.00055194163,0.00032324775,0.00012605613,0.0013926813,0.00021334802,0.26229757,0.080643594,0.5439117,0.10948723,0.0002573613],"about_ca_topic_score_codex":0.00043680653,"about_ca_topic_score_gemma":0.00055368745,"teacher_disagreement_score":0.0047622775,"about_ca_system_score_codex":0.00095749914,"about_ca_system_score_gemma":0.0015526837,"threshold_uncertainty_score":0.015931427},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21147288,0.0006886522,0.7650288,0.00034067826,0.000085722626,0.00014434046,0.000068686946,0.0010468516,0.021123506],"genre_scores_gemma":[0.74396443,0.00066918164,0.23968925,0.00009797074,0.00009932411,0.00010029271,0.00022100608,0.00009659913,0.01506196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99943,0.00009427175,0.000031312167,0.000085835316,0.00027128845,0.00008729278],"domain_scores_gemma":[0.9995197,0.00016580685,0.00006004365,0.00013067483,0.000103226404,0.000020602187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053421425,0.000536641,0.0005795358,0.00054058863,0.0005137302,0.0009433366,0.00052755635,0.00042015285,0.003927936],"category_scores_gemma":[0.0012309672,0.00024444037,0.0005797863,0.00051608164,0.00057025347,0.0019006606,0.0005782808,0.00075472274,0.001365223],"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.000994405,0.00025769326,0.00096126675,0.00043847365,0.000079023586,0.00052658556,0.00027375168,0.116493404,0.1633309,0.46727955,0.004321107,0.24504393],"study_design_scores_gemma":[0.000170081,0.00095839816,0.00069623685,0.000060762915,0.000087671004,0.0014326455,0.00010963506,0.6102065,0.1644278,0.20148285,0.020277862,0.00008960843],"about_ca_topic_score_codex":0.0005222888,"about_ca_topic_score_gemma":0.0012183598,"teacher_disagreement_score":0.003927936,"about_ca_system_score_codex":0.0005553452,"about_ca_system_score_gemma":0.00092902064,"threshold_uncertainty_score":0.013140261},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39761165,0.0032740217,0.18045607,0.028494988,0.0018150661,0.00014068189,0.0004683144,0.00055085705,0.38718835],"genre_scores_gemma":[0.9766738,0.00058467727,0.0063498206,0.0009778801,0.00048246022,0.00002670683,0.0000585107,0.000040269886,0.014805821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985549,0.00053485367,0.000044970373,0.00013844136,0.00045662545,0.00027020668],"domain_scores_gemma":[0.9984212,0.00072009745,0.00011430416,0.00047784855,0.00018098786,0.000085594824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013858804,0.0004540728,0.0006716365,0.001020975,0.0012941419,0.0020353904,0.00071342575,0.0017062887,0.008779906],"category_scores_gemma":[0.0041142157,0.00025112883,0.0005280265,0.0010347521,0.0044857753,0.004815158,0.0026149137,0.002367742,0.0011248512],"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.00008345476,0.000009527065,0.00010870279,0.0000188151,0.000006755418,0.00011047866,0.00007507209,0.0020460319,0.000743532,0.98990333,0.001741919,0.0051523717],"study_design_scores_gemma":[0.000016226257,0.000016054353,0.000100995516,0.0000088103425,0.000004067263,0.00013071363,0.000049728213,0.006262904,0.00068185077,0.9893694,0.0033481184,0.000011228949],"about_ca_topic_score_codex":0.00041657925,"about_ca_topic_score_gemma":0.00027436207,"teacher_disagreement_score":0.008779906,"about_ca_system_score_codex":0.0009968712,"about_ca_system_score_gemma":0.0006290906,"threshold_uncertainty_score":0.029371738},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13532335,0.0014225264,0.8315578,0.0007552153,0.0006965442,0.00029851843,0.00024531162,0.001726932,0.027973779],"genre_scores_gemma":[0.39596617,0.0009791126,0.58639014,0.00030721698,0.00029924075,0.0002526764,0.00041200165,0.000075605385,0.015317873],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983823,0.00002693919,0.000011952004,0.000042402557,0.00005395409,0.000026469736],"domain_scores_gemma":[0.999782,0.000027139577,0.00003840687,0.00005229475,0.00007434397,0.000025746796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019229185,0.0005263471,0.0005038792,0.00065252045,0.0006557444,0.0005409394,0.0007706566,0.0004654905,0.0027376385],"category_scores_gemma":[0.0005040524,0.00030621243,0.0005204934,0.00075163506,0.00040878088,0.0011560109,0.000608943,0.00070119445,0.0009576278],"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.0008985879,0.00019764843,0.001809009,0.0005978401,0.0001604113,0.0013563356,0.00036828945,0.013528917,0.2813693,0.1832736,0.010665721,0.5057743],"study_design_scores_gemma":[0.0005205871,0.0031227097,0.0048487675,0.00018537091,0.00054329494,0.010411853,0.0002294869,0.21844482,0.40777916,0.13034181,0.22328153,0.0002905952],"about_ca_topic_score_codex":0.000288514,"about_ca_topic_score_gemma":0.000647328,"teacher_disagreement_score":0.0027376385,"about_ca_system_score_codex":0.0003873873,"about_ca_system_score_gemma":0.00065372366,"threshold_uncertainty_score":0.009158313},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7370965,0.0048391484,0.11987869,0.0075879656,0.00035190347,0.00014966434,0.00028808648,0.0010207151,0.12878725],"genre_scores_gemma":[0.994796,0.00052541855,0.0031165737,0.00012782887,0.00015089814,0.000040636853,0.00006069338,0.00006439149,0.0011177341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928653,0.003147628,0.00024054265,0.0005676904,0.0019466127,0.0012321505],"domain_scores_gemma":[0.9387729,0.04794562,0.0028935007,0.005470854,0.0027348883,0.0021821752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008484874,0.0010028635,0.0018007407,0.0038040532,0.0023754328,0.004200165,0.0018030455,0.0022136434,0.004701111],"category_scores_gemma":[0.06752258,0.0004684363,0.0007856461,0.001194523,0.007443939,0.008161126,0.0061905105,0.005165187,0.0006242177],"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.0010281609,0.00016846084,0.005311493,0.00023230466,0.00013092147,0.0004557846,0.00043500794,0.07925807,0.009620261,0.8777692,0.0037452404,0.02184517],"study_design_scores_gemma":[0.000082147984,0.0002866,0.0017229076,0.00019416754,0.00009004622,0.0006757358,0.0002331195,0.47178286,0.010301326,0.5121509,0.0024037196,0.0000765299],"about_ca_topic_score_codex":0.0006003195,"about_ca_topic_score_gemma":0.00038709954,"teacher_disagreement_score":0.008484874,"about_ca_system_score_codex":0.0024657405,"about_ca_system_score_gemma":0.0012348819,"threshold_uncertainty_score":0.04487282},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2736712,0.015909258,0.49526766,0.009910824,0.00096519047,0.0005625027,0.0011831548,0.00065126625,0.20187896],"genre_scores_gemma":[0.8802179,0.007014062,0.085739724,0.0007965786,0.0012402191,0.000670686,0.00068347465,0.00046959874,0.0231677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9799597,0.009535023,0.0011202173,0.0019593586,0.0046968134,0.0027289498],"domain_scores_gemma":[0.9317403,0.05171802,0.0022267934,0.011594609,0.0018389617,0.0008814323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016853122,0.0026163803,0.0038748058,0.0034197061,0.0035594534,0.010105906,0.005037473,0.0045037256,0.00945451],"category_scores_gemma":[0.03288595,0.001994854,0.0031859584,0.0047474992,0.010964349,0.031116283,0.00915128,0.011718485,0.002454856],"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.0006580758,0.00011593594,0.0006212446,0.00016596988,0.00007003,0.00010518584,0.0003348394,0.011117502,0.001670308,0.96429205,0.002410185,0.018438693],"study_design_scores_gemma":[0.000083043844,0.00008140424,0.00025424772,0.00008322373,0.00005964602,0.0001685545,0.000087433255,0.034337826,0.0019492966,0.9603069,0.0025429295,0.000045623372],"about_ca_topic_score_codex":0.0006153569,"about_ca_topic_score_gemma":0.00044962307,"teacher_disagreement_score":0.016853122,"about_ca_system_score_codex":0.0051102033,"about_ca_system_score_gemma":0.0034325502,"threshold_uncertainty_score":0.08912891},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39376888,0.00080579217,0.6012113,0.00022308315,0.00006332977,0.00009997474,0.00002599177,0.00096665096,0.0028349522],"genre_scores_gemma":[0.90590864,0.0002130836,0.09175509,0.00006341944,0.00003069438,0.00004162196,0.000024768238,0.00003448266,0.0019282312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988973,0.00024649064,0.000085738124,0.00021295036,0.00045793378,0.00009950806],"domain_scores_gemma":[0.99659437,0.0018567311,0.00068446103,0.00042739243,0.0003921573,0.00004491916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012051762,0.0005059456,0.0004043348,0.0007401966,0.00047480513,0.0009466188,0.00084921444,0.00057098037,0.0009157106],"category_scores_gemma":[0.0045440663,0.00024582562,0.0003172498,0.00055328413,0.0007346744,0.0017147526,0.00082631316,0.00047629746,0.00019595401],"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.0026741421,0.00043891635,0.010128568,0.00053614745,0.00015356086,0.0019666243,0.0010509103,0.18635733,0.33076352,0.08134434,0.0011119834,0.38347393],"study_design_scores_gemma":[0.00013530087,0.00095152453,0.001148605,0.00007720218,0.00009828537,0.0016373493,0.000077788325,0.58184093,0.39071602,0.019058416,0.0041975942,0.000060998787],"about_ca_topic_score_codex":0.00044864716,"about_ca_topic_score_gemma":0.0006137833,"teacher_disagreement_score":0.0012051762,"about_ca_system_score_codex":0.00049982703,"about_ca_system_score_gemma":0.00060591573,"threshold_uncertainty_score":0.006373644},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10188617,0.004115639,0.8535704,0.00063405617,0.0006427786,0.0002028911,0.00032482098,0.0035308467,0.035092454],"genre_scores_gemma":[0.33765963,0.0016700021,0.637958,0.0002845164,0.00019982771,0.00009453526,0.00035637023,0.000078528996,0.021698631],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99988043,0.000021392332,0.000013343934,0.000015376507,0.000056565743,0.000012807574],"domain_scores_gemma":[0.99984884,0.000042679047,0.00001834593,0.000022062532,0.000059442747,0.000008594687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027621083,0.00034338576,0.00029269423,0.0005333095,0.00034139707,0.0005790706,0.0005856828,0.00028376107,0.005076857],"category_scores_gemma":[0.00054229173,0.00020556946,0.00021195729,0.0005058619,0.00015773649,0.00086884614,0.00026627013,0.0002982759,0.0015739168],"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.00037415823,0.00007494955,0.00038921813,0.00072324416,0.000052677857,0.0005414362,0.00009485125,0.018999118,0.35009253,0.12654948,0.007961884,0.49414644],"study_design_scores_gemma":[0.00022284739,0.0016330745,0.0019631276,0.00025128128,0.00025402784,0.005066622,0.00010918611,0.3203534,0.41505075,0.031728297,0.223247,0.000120508594],"about_ca_topic_score_codex":0.00038538003,"about_ca_topic_score_gemma":0.0011898936,"teacher_disagreement_score":0.005076857,"about_ca_system_score_codex":0.000343495,"about_ca_system_score_gemma":0.0006114694,"threshold_uncertainty_score":0.016983747},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053756893,0.0017260156,0.92484516,0.00039303978,0.0004589858,0.00034601556,0.00015922933,0.0019956895,0.016319029],"genre_scores_gemma":[0.43949834,0.00096187025,0.5506204,0.00018563648,0.00019709021,0.00018402576,0.00021833059,0.00006505761,0.008069333],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999759,0.000055274882,0.000022829132,0.000034945217,0.00010279563,0.000025085668],"domain_scores_gemma":[0.9997552,0.00007103198,0.000021882905,0.000060457933,0.000077791454,0.000013593172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003736524,0.0003145129,0.0003335267,0.00068584946,0.00041697538,0.0008021379,0.0007230162,0.0005735103,0.005705334],"category_scores_gemma":[0.0007474216,0.00022939908,0.00025655865,0.000601213,0.0003516697,0.0011972243,0.00029202778,0.00071329414,0.0018415494],"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.0007452067,0.0001989629,0.0008063664,0.0006171015,0.00007844667,0.00048111455,0.00018876488,0.01400546,0.31246376,0.10694827,0.0054258886,0.55804074],"study_design_scores_gemma":[0.0004763593,0.0022363781,0.0018543906,0.00021980162,0.00020050742,0.0059270053,0.00017806087,0.20468912,0.61643106,0.033384323,0.13421988,0.00018314023],"about_ca_topic_score_codex":0.00022226691,"about_ca_topic_score_gemma":0.00035170774,"teacher_disagreement_score":0.005705334,"about_ca_system_score_codex":0.00029614707,"about_ca_system_score_gemma":0.00049359695,"threshold_uncertainty_score":0.019086242},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082898505,0.00021116438,0.8956755,0.00021255486,0.00008391556,0.00011836836,0.000071719995,0.0005913498,0.020137],"genre_scores_gemma":[0.4522489,0.00044364735,0.528712,0.00008593044,0.0001696447,0.00015700496,0.00014223906,0.00032421382,0.01771643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994259,0.00007523584,0.000046889963,0.000083772036,0.0002861496,0.000081956256],"domain_scores_gemma":[0.9995079,0.000106202606,0.000068378744,0.00014273444,0.0001378571,0.000036958554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005865798,0.00077476946,0.00056994864,0.0008479163,0.00083546876,0.0012831356,0.00094365433,0.00053025875,0.0064155036],"category_scores_gemma":[0.0015753275,0.00029863417,0.0007068106,0.00079693156,0.0011812864,0.002047321,0.0013101009,0.0008387999,0.0017398049],"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.00029125102,0.00010237054,0.00087483454,0.00016835127,0.000026324547,0.000377551,0.00037847733,0.11215427,0.026039712,0.7261376,0.0026771992,0.13077198],"study_design_scores_gemma":[0.000087581975,0.00016415468,0.00025865852,0.00003290287,0.000015179315,0.00030157613,0.000111106194,0.57972693,0.026314668,0.37762585,0.015315481,0.000045902696],"about_ca_topic_score_codex":0.00088593864,"about_ca_topic_score_gemma":0.0016336777,"teacher_disagreement_score":0.0064155036,"about_ca_system_score_codex":0.0009612106,"about_ca_system_score_gemma":0.00096841826,"threshold_uncertainty_score":0.021462023},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008892182,0.00083703507,0.98199296,0.00016452547,0.0003302813,0.00014578219,0.00008275851,0.0015555774,0.005998867],"genre_scores_gemma":[0.08815994,0.0006609634,0.9011467,0.0001454351,0.0002245795,0.00017312767,0.0003435108,0.00014678028,0.008998833],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992323,0.00012573248,0.00007358928,0.00015747377,0.0003400634,0.000070756774],"domain_scores_gemma":[0.9994727,0.000111133064,0.000056111327,0.00012287416,0.00020600876,0.000031260573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006043254,0.00070784567,0.0006367196,0.0011903079,0.0007113483,0.0011175777,0.00094167027,0.0005594997,0.00686486],"category_scores_gemma":[0.0016945517,0.0002576458,0.00037477523,0.0011462894,0.0006451181,0.0018766695,0.001171549,0.001037819,0.0041263564],"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.00030130782,0.00008070739,0.00046175843,0.00041294785,0.000036726116,0.0002533329,0.00016812028,0.0078084986,0.06547076,0.06979909,0.011449096,0.8437576],"study_design_scores_gemma":[0.0005340037,0.0015946368,0.0018511487,0.00034045108,0.00017829814,0.0057812636,0.00019275535,0.38769457,0.21149877,0.14469269,0.24538067,0.00026068708],"about_ca_topic_score_codex":0.00039401517,"about_ca_topic_score_gemma":0.00065343775,"teacher_disagreement_score":0.00686486,"about_ca_system_score_codex":0.00056660344,"about_ca_system_score_gemma":0.0009428073,"threshold_uncertainty_score":0.022965193},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16468343,0.00094713917,0.81942326,0.00019736525,0.0001867546,0.0001312674,0.0000635917,0.003032389,0.01133475],"genre_scores_gemma":[0.5988671,0.0003382368,0.39379004,0.00010305629,0.00007484075,0.0000685806,0.00011828145,0.00005516064,0.0065846355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998242,0.000035339584,0.000011872789,0.000031031937,0.000070194015,0.000027289103],"domain_scores_gemma":[0.9998247,0.0000645102,0.000018306915,0.000040144394,0.000042274798,0.000010045798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020305859,0.0003552506,0.00032405872,0.0004452324,0.00028569927,0.00044573945,0.00061876385,0.00026841732,0.0039308304],"category_scores_gemma":[0.0003912717,0.00016613919,0.00018412608,0.00029129005,0.00019084227,0.00048769813,0.00014953339,0.00030129091,0.0007196506],"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.0009357553,0.00016439837,0.0010492273,0.00036907254,0.00007982286,0.00053017004,0.00014191083,0.029260231,0.34655353,0.015147423,0.002842913,0.6029256],"study_design_scores_gemma":[0.0008016469,0.0022717996,0.0043484583,0.0001177414,0.00021326292,0.0026461666,0.000109594024,0.4708529,0.47462213,0.0075685387,0.03635717,0.00009056969],"about_ca_topic_score_codex":0.0006885871,"about_ca_topic_score_gemma":0.0018460443,"teacher_disagreement_score":0.0039308304,"about_ca_system_score_codex":0.00038356063,"about_ca_system_score_gemma":0.0003379076,"threshold_uncertainty_score":0.013149977},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71039474,0.011098457,0.11480216,0.032227322,0.0025763826,0.00010696544,0.0003858615,0.00028795813,0.12812024],"genre_scores_gemma":[0.9705258,0.0032626812,0.008257578,0.00047499736,0.0020642371,0.000070105285,0.00014660327,0.00005044797,0.015147604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811316,0.0007615841,0.00008677084,0.00027500995,0.00041968617,0.00034388687],"domain_scores_gemma":[0.9969303,0.0017176393,0.00040606124,0.00039396537,0.00016722654,0.00038483017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022474162,0.00112758,0.0021503312,0.0028371774,0.0038256303,0.0069382144,0.0013283037,0.0032652696,0.006092293],"category_scores_gemma":[0.008341937,0.0007955741,0.001029011,0.0035238,0.009955608,0.015856251,0.006283316,0.0060707973,0.0009464542],"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.00011149742,0.00003214018,0.0002821411,0.00004327174,0.000008395211,0.0001854064,0.00025166594,0.0022457368,0.00023182236,0.989876,0.0013169765,0.0054150247],"study_design_scores_gemma":[0.000016855129,0.000009373779,0.000058426995,0.00001230035,0.0000032455648,0.00006757559,0.000057853616,0.0024548522,0.00011952868,0.9960659,0.0011250923,0.000009010937],"about_ca_topic_score_codex":0.00055697263,"about_ca_topic_score_gemma":0.00038784198,"teacher_disagreement_score":0.0069382144,"about_ca_system_score_codex":0.0020854163,"about_ca_system_score_gemma":0.0012866742,"threshold_uncertainty_score":0.020380735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076749444,0.00030467845,0.9125775,0.00015447644,0.00007704587,0.00009933633,0.000033028926,0.0020183,0.007986135],"genre_scores_gemma":[0.44473267,0.0003418299,0.5498755,0.00006540302,0.00009458396,0.000090580565,0.00011132731,0.00016261937,0.004525512],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994704,0.00006420677,0.000037125814,0.00006474034,0.00030258248,0.000060842292],"domain_scores_gemma":[0.99899393,0.00016567444,0.00011450069,0.00050951255,0.00018290912,0.00003352566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005455209,0.00044157397,0.00039653908,0.00074226625,0.0004328235,0.0007736621,0.00091754517,0.00030866984,0.0027363044],"category_scores_gemma":[0.0015978103,0.00029929858,0.00039132428,0.0007904152,0.0007512132,0.0018073606,0.00097383093,0.0009170334,0.0009227449],"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.00044487166,0.00019215238,0.0022133645,0.00024519613,0.00005570753,0.00042112274,0.00033373904,0.036597714,0.18651903,0.23538835,0.0042819954,0.5333067],"study_design_scores_gemma":[0.00028349448,0.001360462,0.0016564024,0.000104508435,0.00012933087,0.0017711698,0.00012348512,0.45745277,0.3585407,0.11612949,0.062353443,0.000094770396],"about_ca_topic_score_codex":0.0003095082,"about_ca_topic_score_gemma":0.00053903245,"teacher_disagreement_score":0.0027363044,"about_ca_system_score_codex":0.00033388237,"about_ca_system_score_gemma":0.000746663,"threshold_uncertainty_score":0.009153843},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011217959,0.000110804795,0.9724682,0.00010275405,0.00007136787,0.00004170003,0.00088155415,0.017342906,0.007858874],"genre_scores_gemma":[0.020616807,0.00016367916,0.9572358,0.00015129881,0.000034573026,0.00038627564,0.0013557702,0.0062803184,0.013775454],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996425,0.00010139367,0.00002909086,0.000049087856,0.00014478502,0.000033117212],"domain_scores_gemma":[0.9987929,0.000639901,0.000090913534,0.000127329,0.0003133182,0.000035666613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005177835,0.0012961014,0.0006797771,0.0007808633,0.0004276769,0.00070719566,0.001564073,0.0010094749,0.0713809],"category_scores_gemma":[0.0040984848,0.00063761283,0.00057850016,0.0006736427,0.00026688952,0.0008723472,0.0009977263,0.0014674152,0.030935772],"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.000205515,0.00012691732,0.0007012242,0.0011991054,0.00014561525,0.00032932375,0.0002130951,0.16663423,0.01163412,0.05778411,0.17726511,0.5837616],"study_design_scores_gemma":[0.00015878843,0.00006930757,0.00030874493,0.00012800911,0.000043151213,0.00030519045,0.00007525318,0.7932805,0.019108469,0.03159765,0.15486376,0.00006124712],"about_ca_topic_score_codex":0.0017703831,"about_ca_topic_score_gemma":0.004747815,"teacher_disagreement_score":0.0713809,"about_ca_system_score_codex":0.0002868765,"about_ca_system_score_gemma":0.00093609677,"threshold_uncertainty_score":0.2387929},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15738738,0.0006196492,0.81372523,0.00017886124,0.00026914547,0.00016170744,0.00022612874,0.0076019038,0.019830042],"genre_scores_gemma":[0.7419017,0.0001765748,0.25356966,0.000044597313,0.00005207062,0.000059484093,0.00025817714,0.00010342431,0.0038343002],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99986434,0.000018347386,0.000014798377,0.00001858933,0.000063367006,0.000020556978],"domain_scores_gemma":[0.99980026,0.00006529143,0.000019964255,0.00004934843,0.000054891312,0.000010198009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019050376,0.00032779173,0.00029247275,0.00047033076,0.0002092836,0.0004464441,0.0005258414,0.00019741773,0.004058588],"category_scores_gemma":[0.0006387286,0.00011623614,0.00025651488,0.0003371689,0.00017412179,0.00046834574,0.00017289224,0.000272828,0.0009006818],"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.0008891331,0.00015828751,0.0033369327,0.0005684209,0.00008481914,0.0007798548,0.00026296466,0.038451023,0.294215,0.056436464,0.007290342,0.5975268],"study_design_scores_gemma":[0.00025901562,0.0010602658,0.0039098533,0.000093976734,0.00011639657,0.0017139915,0.00006520152,0.4413885,0.492623,0.010794091,0.04791582,0.000059913764],"about_ca_topic_score_codex":0.00049168646,"about_ca_topic_score_gemma":0.00060618576,"teacher_disagreement_score":0.004058588,"about_ca_system_score_codex":0.0002680874,"about_ca_system_score_gemma":0.00035826495,"threshold_uncertainty_score":0.013577342},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0105963135,0.000619664,0.9801757,0.00021584424,0.00060817896,0.00022717156,0.00013679537,0.0023065286,0.005113747],"genre_scores_gemma":[0.08578066,0.00041080068,0.9039539,0.0002041249,0.0003178902,0.00024427683,0.00060580246,0.00027401472,0.008208531],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830246,0.000185879,0.00021793366,0.00040978,0.0007444725,0.00013944323],"domain_scores_gemma":[0.99893206,0.00017567785,0.000115297196,0.00019959013,0.0005234313,0.000053901178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009642733,0.0010365108,0.0012182936,0.0025385078,0.00094527,0.0017907973,0.0017466306,0.0007595399,0.00729954],"category_scores_gemma":[0.0026072704,0.00041488762,0.0007217547,0.0018704847,0.000654078,0.0033873452,0.001525394,0.0010201057,0.0029899136],"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.0006143531,0.00007812192,0.0007457393,0.00034690552,0.00006835027,0.0002380273,0.00020810074,0.008668422,0.061343838,0.052864082,0.013143858,0.86168015],"study_design_scores_gemma":[0.000929614,0.0014074916,0.0029274474,0.00017778648,0.00024899372,0.0046624346,0.00031541716,0.42902485,0.26240098,0.086113885,0.21139476,0.0003963419],"about_ca_topic_score_codex":0.0008008689,"about_ca_topic_score_gemma":0.00085374987,"teacher_disagreement_score":0.00729954,"about_ca_system_score_codex":0.00090160826,"about_ca_system_score_gemma":0.0014450689,"threshold_uncertainty_score":0.024419427},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14233884,0.0010318819,0.8215869,0.00063162425,0.00013422547,0.000184195,0.00010848907,0.0007511311,0.03323264],"genre_scores_gemma":[0.5528625,0.0011140029,0.4267781,0.00040209727,0.0003377162,0.00033875005,0.0002712379,0.0001887405,0.017706862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992799,0.00015571825,0.0000467145,0.0001606469,0.0002360744,0.0001209606],"domain_scores_gemma":[0.9986563,0.00051757024,0.00023223281,0.0003053927,0.00022571371,0.00006271724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006065819,0.00038175567,0.00035000805,0.0012590477,0.0006345423,0.0015472508,0.00094030745,0.0008026742,0.0050492864],"category_scores_gemma":[0.003532815,0.00033512418,0.00033286883,0.0013597731,0.0010719611,0.002263792,0.0013018437,0.001227754,0.0013211042],"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.00037099735,0.000110161884,0.0010069559,0.000088483044,0.000025736728,0.00015717976,0.00019567195,0.014228001,0.016451297,0.7515578,0.0021835335,0.21362416],"study_design_scores_gemma":[0.00019848818,0.0005289188,0.0013191238,0.00011817485,0.00004648477,0.0016010276,0.000106867825,0.17921601,0.060675815,0.7259466,0.0301315,0.000110913716],"about_ca_topic_score_codex":0.0005397908,"about_ca_topic_score_gemma":0.0005886638,"teacher_disagreement_score":0.0050492864,"about_ca_system_score_codex":0.00079627836,"about_ca_system_score_gemma":0.0012137416,"threshold_uncertainty_score":0.01689154},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061110094,0.0005392669,0.9223202,0.00015321368,0.00014387644,0.0000969763,0.00004068157,0.0032425905,0.012353087],"genre_scores_gemma":[0.32179317,0.0005172465,0.66904545,0.000078319485,0.00006615358,0.00010210405,0.00019314137,0.0001423166,0.008062047],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99961793,0.00009317177,0.00002229196,0.000055427598,0.00016862752,0.000042560478],"domain_scores_gemma":[0.9994344,0.0001689558,0.00004256488,0.00012922446,0.000198564,0.000026222711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042750305,0.0006004388,0.00046123177,0.0005446505,0.00037970603,0.000841622,0.0007720539,0.0004157182,0.0033093889],"category_scores_gemma":[0.0015116503,0.0001932819,0.00031580793,0.0008104182,0.00044057413,0.0015383572,0.0007218132,0.00073089334,0.0014129202],"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.00086703914,0.00016080576,0.001310891,0.00028052006,0.000047500285,0.00029458912,0.0002182385,0.038306437,0.09581166,0.13835002,0.008262698,0.71608967],"study_design_scores_gemma":[0.0002033173,0.0009991758,0.00092338014,0.00008033011,0.000061591345,0.0009804922,0.00010938916,0.6637055,0.17710331,0.10136151,0.05440027,0.0000716649],"about_ca_topic_score_codex":0.0004370585,"about_ca_topic_score_gemma":0.00071894866,"teacher_disagreement_score":0.0033093889,"about_ca_system_score_codex":0.00039551413,"about_ca_system_score_gemma":0.00073067157,"threshold_uncertainty_score":0.011071026},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16971721,0.006285039,0.69664055,0.0027763136,0.0017852874,0.00028393167,0.00031217476,0.0005908892,0.121608645],"genre_scores_gemma":[0.7431369,0.009146878,0.20498109,0.00089218304,0.0026909062,0.00031341577,0.0005379567,0.00055068615,0.037750028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870765,0.00039652296,0.00009211639,0.0001756635,0.0004682875,0.00015972197],"domain_scores_gemma":[0.9986929,0.00037024563,0.00020655163,0.00038916996,0.0001963004,0.00014476561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014601453,0.0010806847,0.0009306246,0.0025105784,0.0020085531,0.0029231748,0.00088169856,0.0008841652,0.009724333],"category_scores_gemma":[0.0036127933,0.0003868752,0.00084923796,0.0025464322,0.0029689965,0.0062172487,0.005211513,0.0033881245,0.0033589064],"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.000054562286,0.000029126872,0.00023169728,0.000101114725,0.000008749093,0.00013815223,0.0002619914,0.006497941,0.0022375304,0.95568043,0.0017152845,0.03304344],"study_design_scores_gemma":[0.000012617549,0.00007310075,0.00013597381,0.000062825726,0.000007323372,0.0002815869,0.00013012816,0.011397018,0.003002697,0.9618891,0.022979992,0.000027515143],"about_ca_topic_score_codex":0.00014456805,"about_ca_topic_score_gemma":0.00013716577,"teacher_disagreement_score":0.009724333,"about_ca_system_score_codex":0.0007324555,"about_ca_system_score_gemma":0.0004934923,"threshold_uncertainty_score":0.032531083},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68286663,0.002914603,0.15409957,0.003985941,0.0008538221,0.000094065785,0.0003913594,0.0015918657,0.15320206],"genre_scores_gemma":[0.9637616,0.00084237155,0.0153657505,0.0001759312,0.00046574714,0.000047401347,0.00017728737,0.0002187821,0.018945135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989962,0.00022333737,0.00005666651,0.00014283368,0.0003743437,0.00020663762],"domain_scores_gemma":[0.99763525,0.0010888083,0.00029825125,0.00044291557,0.0003229638,0.00021170267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011652751,0.0011672354,0.0012460224,0.0058586523,0.0024550813,0.0041664164,0.0012294732,0.001545662,0.0077729127],"category_scores_gemma":[0.005973327,0.00052684004,0.00074948254,0.0039785835,0.0038857185,0.00572118,0.0024001948,0.0021725614,0.0011382386],"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.00018628965,0.000040873376,0.0027680562,0.00011399219,0.000019745348,0.000326136,0.000578841,0.0047666887,0.002433659,0.95195746,0.0056039724,0.031204222],"study_design_scores_gemma":[0.000014044416,0.000026624182,0.00088954665,0.000041236497,0.000028936984,0.00034070923,0.00009231425,0.0122349765,0.0022346594,0.9786112,0.005461985,0.000023824829],"about_ca_topic_score_codex":0.0007535298,"about_ca_topic_score_gemma":0.0009413317,"teacher_disagreement_score":0.0077729127,"about_ca_system_score_codex":0.0017419943,"about_ca_system_score_gemma":0.00067705195,"threshold_uncertainty_score":0.026003003},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24896944,0.012883226,0.610585,0.004141742,0.0025148562,0.00026160228,0.00049500243,0.0024551426,0.11769411],"genre_scores_gemma":[0.79419374,0.0045732637,0.12256549,0.00041255282,0.00094450585,0.00008620355,0.0004888661,0.00051063864,0.07622472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990578,0.0001627979,0.000052798183,0.000083354425,0.00052721176,0.00011598912],"domain_scores_gemma":[0.9988379,0.00053946907,0.00009421805,0.0003697958,0.00011363024,0.00004502844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007961004,0.0010499301,0.0007064824,0.0011875989,0.0005979178,0.0017603993,0.00069438916,0.00072978524,0.009115347],"category_scores_gemma":[0.003084126,0.00040331387,0.00066415576,0.001191083,0.0012321151,0.003070844,0.0014752826,0.0017930442,0.0036593492],"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.0017192474,0.00013979702,0.0015373941,0.00057771686,0.00015637722,0.000991776,0.0005894466,0.015731266,0.07888186,0.49190474,0.015138443,0.39263195],"study_design_scores_gemma":[0.00020051925,0.0005004868,0.0016185204,0.0003106956,0.0001347611,0.004017656,0.00019419056,0.08329196,0.20645407,0.615332,0.08784179,0.00010345409],"about_ca_topic_score_codex":0.000082613355,"about_ca_topic_score_gemma":0.00014182444,"teacher_disagreement_score":0.009115347,"about_ca_system_score_codex":0.0006362831,"about_ca_system_score_gemma":0.00048649646,"threshold_uncertainty_score":0.030493855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036179833,0.0035114419,0.9110386,0.0004953965,0.0007400261,0.00014574494,0.00030955946,0.009620905,0.03795857],"genre_scores_gemma":[0.23025183,0.0017274354,0.6907799,0.00036716033,0.00046201132,0.00023438234,0.00073928403,0.0042715417,0.07116643],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927205,0.00012869506,0.000049853385,0.000105991385,0.0003469886,0.00009630629],"domain_scores_gemma":[0.99928135,0.0001418489,0.000045029705,0.00035141667,0.0001452982,0.000035025983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060922885,0.0013231364,0.0012040236,0.0013303142,0.001255369,0.0017191293,0.0013409314,0.0006664917,0.019717216],"category_scores_gemma":[0.0021214182,0.00054193643,0.00094679504,0.0023826929,0.0006567104,0.0033506784,0.0018708967,0.0017331864,0.006854475],"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.0006735908,0.00016159657,0.00058292475,0.00034122085,0.000064990185,0.00016368944,0.00032443195,0.0066927155,0.031009689,0.14249595,0.023384545,0.79410464],"study_design_scores_gemma":[0.0003650054,0.00054858666,0.0023270682,0.00024358039,0.00020969484,0.0013667662,0.00036668903,0.14063847,0.16050747,0.45423198,0.23898995,0.00020483142],"about_ca_topic_score_codex":0.00045941645,"about_ca_topic_score_gemma":0.0010868096,"teacher_disagreement_score":0.019717216,"about_ca_system_score_codex":0.0007268165,"about_ca_system_score_gemma":0.00069044705,"threshold_uncertainty_score":0.065960646},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047976498,0.0016890627,0.94136965,0.00054115895,0.0005485582,0.00021042454,0.000102926824,0.0013569489,0.0062047904],"genre_scores_gemma":[0.633839,0.0012923859,0.35533595,0.00027142063,0.00028384454,0.00017897328,0.00034411353,0.00007614297,0.00837812],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989802,0.00019627842,0.00009925861,0.00012970502,0.00048082278,0.000113631904],"domain_scores_gemma":[0.99930954,0.000103367325,0.00011114682,0.00018604558,0.00024511266,0.00004473358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005947871,0.00048382094,0.0005685,0.001126207,0.00086506514,0.0010044752,0.0010075254,0.0008646168,0.001818247],"category_scores_gemma":[0.0012441723,0.0001581434,0.0004052619,0.00089085253,0.0005897083,0.0024853933,0.00086376874,0.0009354268,0.0006293377],"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.0012513695,0.00025546298,0.0013430248,0.0007713725,0.000116557385,0.0006972799,0.0005071184,0.041326564,0.14588752,0.29989544,0.007810058,0.5001382],"study_design_scores_gemma":[0.00045933994,0.0022490537,0.0013862004,0.00021120398,0.00022368491,0.004858493,0.00017379786,0.48840028,0.2763182,0.11090865,0.114508964,0.00030209462],"about_ca_topic_score_codex":0.00026045745,"about_ca_topic_score_gemma":0.00020021666,"teacher_disagreement_score":0.001818247,"about_ca_system_score_codex":0.000578683,"about_ca_system_score_gemma":0.0006996348,"threshold_uncertainty_score":0.0060825944},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047117904,0.0006438937,0.9236703,0.00031935162,0.00018089791,0.00006235386,0.00010840484,0.011564153,0.016332716],"genre_scores_gemma":[0.32214832,0.00037803833,0.66748875,0.00011823909,0.000097425895,0.00007413283,0.00044481317,0.0006446303,0.008605672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997178,0.000058427624,0.000016030404,0.00003316813,0.00013603902,0.000038478127],"domain_scores_gemma":[0.9997383,0.00004992561,0.000015303098,0.00006163737,0.000111662404,0.000023202869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002837578,0.0005031224,0.00034658765,0.0008567411,0.00041013322,0.0006995965,0.00072281295,0.00032854793,0.0059575266],"category_scores_gemma":[0.00091509224,0.00019008009,0.00032755465,0.0007463244,0.00023251452,0.0006562596,0.0005307422,0.0006144857,0.0022981283],"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.0007269267,0.00012885938,0.002475188,0.00030601313,0.00008607814,0.0007839945,0.00032835786,0.032339785,0.17968243,0.08817654,0.034589466,0.66037637],"study_design_scores_gemma":[0.00013558248,0.0005125144,0.0023281805,0.000094304116,0.00006705741,0.0013245422,0.0000796574,0.68028384,0.13954496,0.029438624,0.14611714,0.00007357451],"about_ca_topic_score_codex":0.0008598517,"about_ca_topic_score_gemma":0.0013274597,"teacher_disagreement_score":0.0059575266,"about_ca_system_score_codex":0.00044893206,"about_ca_system_score_gemma":0.00052415824,"threshold_uncertainty_score":0.019929886},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021400427,0.0006199974,0.9443083,0.0015335667,0.00040183397,0.00024015894,0.00016061659,0.0013338873,0.03000113],"genre_scores_gemma":[0.33443618,0.0011084327,0.6472998,0.00040659646,0.00022247246,0.000363233,0.00036666705,0.0003727319,0.015423807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783677,0.00046798825,0.00014503408,0.00023134996,0.0009881522,0.00033077277],"domain_scores_gemma":[0.9991366,0.00026720867,0.000044561413,0.00033594196,0.00016752552,0.000048147653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017563334,0.00066729385,0.0010518493,0.00093535596,0.0016296626,0.0021682088,0.0014481904,0.0011997255,0.0077856253],"category_scores_gemma":[0.0037178015,0.00045769336,0.00096702884,0.0013124994,0.0021020093,0.0046248226,0.0026572328,0.0018686702,0.0026600345],"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.00012859175,0.000058853333,0.00018620914,0.00012787733,0.000020240019,0.00011088315,0.00021576324,0.023228457,0.0032859843,0.89720774,0.0059607443,0.069468595],"study_design_scores_gemma":[0.00011946204,0.00010103121,0.00009563938,0.00005570329,0.000018866647,0.00013947694,0.00007637022,0.12530614,0.011370479,0.8323405,0.030319775,0.000056539495],"about_ca_topic_score_codex":0.0008055853,"about_ca_topic_score_gemma":0.00077528757,"teacher_disagreement_score":0.0077856253,"about_ca_system_score_codex":0.0010099015,"about_ca_system_score_gemma":0.0020051026,"threshold_uncertainty_score":0.026045501},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30308682,0.004081736,0.5550134,0.000532906,0.0006282545,0.00069874496,0.0007850973,0.02338353,0.11178953],"genre_scores_gemma":[0.81229347,0.0007428177,0.15171717,0.00022894365,0.00011309477,0.0001921766,0.0010021429,0.00016233392,0.03354799],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998155,0.000021590666,0.0000097769325,0.00003435869,0.000075477656,0.00004336884],"domain_scores_gemma":[0.9998373,0.00002148195,0.00001832769,0.000025314532,0.0000832717,0.000014201655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011202229,0.00042551773,0.00035233246,0.00047147897,0.00027906828,0.00044904678,0.00072942756,0.0002741006,0.009544823],"category_scores_gemma":[0.00031835417,0.00012557198,0.00011809631,0.00063504715,0.00012962872,0.00038897168,0.00019539522,0.00030826812,0.0032198278],"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.0012701597,0.00028575116,0.003876427,0.00061598,0.000089317684,0.001047188,0.00012325734,0.021874188,0.2540653,0.018466145,0.035041574,0.6632447],"study_design_scores_gemma":[0.00048603103,0.003019881,0.012216105,0.00015873557,0.00019605647,0.00540272,0.00011993009,0.20981845,0.54853994,0.0039445595,0.21598049,0.000117142416],"about_ca_topic_score_codex":0.0006599693,"about_ca_topic_score_gemma":0.00077721564,"teacher_disagreement_score":0.009544823,"about_ca_system_score_codex":0.00038110442,"about_ca_system_score_gemma":0.00045406242,"threshold_uncertainty_score":0.031930625},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29022112,0.0015166592,0.6609023,0.0003674858,0.00015866169,0.00018839276,0.00011137562,0.00075182033,0.045782004],"genre_scores_gemma":[0.73612314,0.0012635137,0.2437452,0.0001536546,0.00012032112,0.00009373853,0.0002378186,0.00007773703,0.018184945],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998436,0.000023660332,0.000013945612,0.00003671272,0.00005414892,0.000027937105],"domain_scores_gemma":[0.9997303,0.00006755377,0.00006605626,0.00007275043,0.000046001598,0.000017319619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022670829,0.0004858488,0.00027300467,0.00052064925,0.00037642056,0.0006515628,0.0003517946,0.00035068893,0.004322414],"category_scores_gemma":[0.0009801049,0.00017162538,0.00041804338,0.00053476624,0.00049746095,0.0013480766,0.0004468978,0.00044569914,0.0012294515],"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.00060679315,0.00020571485,0.0025499398,0.00042109124,0.00006688268,0.00068516016,0.0003578501,0.030762207,0.14718947,0.30438006,0.0024098188,0.51036507],"study_design_scores_gemma":[0.0001887988,0.0021575764,0.0042923614,0.00019398087,0.00015668295,0.006439457,0.00038665402,0.23993465,0.41693023,0.23784854,0.09132409,0.00014700553],"about_ca_topic_score_codex":0.0002210226,"about_ca_topic_score_gemma":0.0006771546,"teacher_disagreement_score":0.004322414,"about_ca_system_score_codex":0.00028378514,"about_ca_system_score_gemma":0.00040156217,"threshold_uncertainty_score":0.014459908},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02679194,0.00036546675,0.96473944,0.00027469083,0.00011468871,0.00015943858,0.00015397182,0.0016322486,0.00576811],"genre_scores_gemma":[0.1939419,0.00034850388,0.79833585,0.0001372811,0.00005773594,0.00026978593,0.0004758062,0.00017311393,0.006259987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995486,0.00010150412,0.00002712574,0.00009950004,0.0001401342,0.00008301877],"domain_scores_gemma":[0.999663,0.00009795108,0.00003881623,0.00008123575,0.00009363383,0.000025269892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004817829,0.00064445415,0.0006455468,0.0011732058,0.0007486698,0.0009908245,0.00086052256,0.0006338687,0.0046842094],"category_scores_gemma":[0.0017661056,0.00023296452,0.00041317233,0.0014394658,0.00057791127,0.0011616582,0.0011627825,0.00051404664,0.0025048247],"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.0007211689,0.00009108203,0.0017660005,0.0002144178,0.00007016593,0.00037292208,0.00022402109,0.10425223,0.0247063,0.09488618,0.015290208,0.75740534],"study_design_scores_gemma":[0.00020962705,0.00037277446,0.0006841929,0.000068282636,0.00005638717,0.0013018827,0.00020422557,0.80992746,0.030902622,0.12356235,0.03262899,0.00008127608],"about_ca_topic_score_codex":0.0013210067,"about_ca_topic_score_gemma":0.0019940434,"teacher_disagreement_score":0.0046842094,"about_ca_system_score_codex":0.0005276388,"about_ca_system_score_gemma":0.0016718308,"threshold_uncertainty_score":0.01567024},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50521755,0.0030125638,0.39647868,0.0038101354,0.00081675017,0.00009318265,0.00025810822,0.00056083954,0.089752264],"genre_scores_gemma":[0.95602226,0.0010066265,0.02039627,0.0001792856,0.0004176804,0.0000460584,0.00015854357,0.00007600195,0.021697264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901104,0.00032060154,0.00003553377,0.00013616784,0.00031397623,0.00018273354],"domain_scores_gemma":[0.997703,0.001192096,0.00022831548,0.00041334154,0.00024135903,0.00022190211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016121477,0.0007584283,0.0011822777,0.0016774167,0.0010808583,0.0026076909,0.0012588684,0.0009982849,0.006109425],"category_scores_gemma":[0.0070922906,0.0004215066,0.0005927173,0.0015678,0.0025841347,0.0057013207,0.002636512,0.0028082512,0.0010350489],"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.00010350172,0.000039263134,0.00022534272,0.000026490234,0.0000062440536,0.000049711656,0.00015836133,0.0050927484,0.0005180933,0.984814,0.00092293724,0.008043421],"study_design_scores_gemma":[0.000027638627,0.000026387528,0.00011937901,0.000015658206,0.0000085156225,0.00007499293,0.000058766087,0.04733794,0.0010249477,0.94856393,0.0027255986,0.000016265663],"about_ca_topic_score_codex":0.00077043194,"about_ca_topic_score_gemma":0.00049500365,"teacher_disagreement_score":0.006109425,"about_ca_system_score_codex":0.0019461864,"about_ca_system_score_gemma":0.0008411975,"threshold_uncertainty_score":0.020438015},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12766169,0.0029762634,0.8119475,0.0010408072,0.00028334936,0.00022592995,0.00011324526,0.0018559897,0.05389525],"genre_scores_gemma":[0.5719624,0.0016847437,0.41459903,0.00015875226,0.00019743796,0.00017788397,0.00020370084,0.00032023666,0.010695813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946755,0.000116778385,0.00004457273,0.00007742481,0.00022179671,0.00007183888],"domain_scores_gemma":[0.9995958,0.00014751637,0.000066436645,0.0001344109,0.000037484086,0.00001818889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065525435,0.0006901418,0.00055794895,0.00081123144,0.00070124853,0.001470107,0.00050075643,0.0004749523,0.006473924],"category_scores_gemma":[0.0022605204,0.00035678165,0.00045765107,0.00086632476,0.0010590637,0.0030691773,0.0014451535,0.0011833885,0.002706282],"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.00031108645,0.00010227093,0.00063876074,0.0003395339,0.000018995343,0.00037736693,0.00040047406,0.009460861,0.057746213,0.71786344,0.00474729,0.20799375],"study_design_scores_gemma":[0.00014701838,0.00043762347,0.0005440981,0.00024553918,0.000050786297,0.0019760483,0.00017961144,0.10722567,0.13441797,0.61103845,0.14364474,0.000092505],"about_ca_topic_score_codex":0.000065752436,"about_ca_topic_score_gemma":0.0001313419,"teacher_disagreement_score":0.006473924,"about_ca_system_score_codex":0.00053110375,"about_ca_system_score_gemma":0.00028116716,"threshold_uncertainty_score":0.021657467},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4427782,0.001030575,0.53177214,0.0012967899,0.00020297436,0.00016509411,0.00007154478,0.0035600543,0.019122664],"genre_scores_gemma":[0.950213,0.00025021264,0.046511274,0.00012621668,0.000053695887,0.00003728362,0.000051673804,0.000058422007,0.002698166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833554,0.00029075067,0.00012258392,0.00014785668,0.0008292597,0.00027408483],"domain_scores_gemma":[0.9961528,0.0011691246,0.00071900774,0.0012984779,0.00051189447,0.00014861724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001075633,0.00051263085,0.00072752434,0.0013533875,0.0007500052,0.0013768794,0.00068355125,0.0016781776,0.0022454134],"category_scores_gemma":[0.0055621783,0.00029273497,0.0004304547,0.0007646515,0.0013754023,0.002514411,0.0019597393,0.0011356031,0.0011654467],"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.0016812921,0.00025149103,0.005147001,0.00032388023,0.00013620667,0.0014525122,0.0009154191,0.054509632,0.3084524,0.22636561,0.003931936,0.39683267],"study_design_scores_gemma":[0.0004016799,0.0014841924,0.0022685837,0.00018399034,0.00010962472,0.003350892,0.00023460614,0.34239343,0.50901395,0.109685495,0.030677669,0.0001958537],"about_ca_topic_score_codex":0.00031119294,"about_ca_topic_score_gemma":0.0002268551,"teacher_disagreement_score":0.0022454134,"about_ca_system_score_codex":0.0005475729,"about_ca_system_score_gemma":0.00079779315,"threshold_uncertainty_score":0.0075116754},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030765219,0.00060858205,0.9628185,0.00009095807,0.00008118281,0.00009360414,0.000059050653,0.0012016186,0.004281462],"genre_scores_gemma":[0.23065157,0.00035939884,0.7646077,0.00010129771,0.000056327568,0.00008944054,0.0002977933,0.00013363868,0.003702761],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991492,0.00014732537,0.000100457204,0.00019095963,0.00034191317,0.00007012194],"domain_scores_gemma":[0.999218,0.00025906911,0.00007763044,0.00017426268,0.00024581657,0.00002519013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009427156,0.00048495398,0.0006366288,0.0011331161,0.00064403727,0.0010445486,0.0011865303,0.0006070559,0.004419276],"category_scores_gemma":[0.0020169425,0.00025818238,0.00030337027,0.0009363832,0.00044005198,0.003669966,0.00092879974,0.00069704524,0.0011322368],"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.0006207776,0.00010956581,0.00079000386,0.00026277656,0.00005609368,0.0001714577,0.0001692647,0.025316453,0.07374703,0.07134699,0.0036786096,0.8237308],"study_design_scores_gemma":[0.00034497379,0.0007452948,0.0015082832,0.00012276074,0.00009757525,0.0015930425,0.00015248475,0.5819045,0.2429762,0.119187765,0.051226366,0.00014075985],"about_ca_topic_score_codex":0.0002661455,"about_ca_topic_score_gemma":0.00042027904,"teacher_disagreement_score":0.004419276,"about_ca_system_score_codex":0.00061510445,"about_ca_system_score_gemma":0.00079025485,"threshold_uncertainty_score":0.014783919},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068437055,0.00040109898,0.9217671,0.00020559195,0.00012461637,0.00012848682,0.00006695376,0.0018267626,0.0070423502],"genre_scores_gemma":[0.31540328,0.0004240992,0.67412764,0.00017280177,0.00023404317,0.00015133164,0.0005176778,0.00042317246,0.008545885],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991678,0.000121499404,0.000043649816,0.000118685544,0.00042394438,0.00012447702],"domain_scores_gemma":[0.9994221,0.00017434533,0.00005838333,0.00016691307,0.00014394104,0.000034404176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004627994,0.0005340819,0.0005873775,0.0014821811,0.0007229525,0.00081963366,0.0008330267,0.00041483677,0.0037152963],"category_scores_gemma":[0.0015587602,0.00017884625,0.00060004974,0.000869097,0.0006180586,0.0020258103,0.0010621895,0.0011737982,0.0016709681],"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.00075707043,0.00019479275,0.0016609733,0.00024565778,0.000059475446,0.00027916973,0.00053309323,0.01357632,0.13129294,0.12214589,0.006514851,0.7227398],"study_design_scores_gemma":[0.00046535835,0.0012619231,0.0033356159,0.00012440025,0.00020468487,0.0022407204,0.0003407816,0.32117057,0.38403496,0.19650093,0.09010189,0.00021819716],"about_ca_topic_score_codex":0.0004438243,"about_ca_topic_score_gemma":0.00059860805,"teacher_disagreement_score":0.0037152963,"about_ca_system_score_codex":0.0004308133,"about_ca_system_score_gemma":0.00061586266,"threshold_uncertainty_score":0.012428939},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73799515,0.00039097722,0.2527697,0.0014616266,0.000049320162,0.00008580852,0.00024051782,0.00065523526,0.006351594],"genre_scores_gemma":[0.93776363,0.00024077707,0.059597697,0.000058799415,0.00008095181,0.000037103746,0.0003300186,0.000060054303,0.0018310385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989248,0.00019631583,0.000049889364,0.00029226826,0.00037582105,0.00016083336],"domain_scores_gemma":[0.9954418,0.0022466865,0.00059460266,0.0012237306,0.0002519009,0.00024123679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001351765,0.0006609748,0.00075735175,0.0016001887,0.0012541346,0.002187854,0.0012045669,0.0009121222,0.0027969903],"category_scores_gemma":[0.010594004,0.0004702001,0.00061553874,0.0011412634,0.00219565,0.0066086273,0.0025156,0.0020556638,0.00061206764],"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.0011166717,0.00045176886,0.04536099,0.0005187804,0.00018496707,0.00084175135,0.0024820988,0.13335755,0.04360311,0.5437942,0.006992724,0.22129539],"study_design_scores_gemma":[0.000099319615,0.00022996354,0.00339394,0.000048909656,0.000050984258,0.00033827542,0.00032417043,0.2183909,0.022983499,0.7502891,0.0037933206,0.000057638237],"about_ca_topic_score_codex":0.00071754545,"about_ca_topic_score_gemma":0.00072228,"teacher_disagreement_score":0.0027969903,"about_ca_system_score_codex":0.00084474945,"about_ca_system_score_gemma":0.001014095,"threshold_uncertainty_score":0.009356797},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18845887,0.0016336716,0.78867143,0.00037215222,0.0004307332,0.00022653109,0.00019583476,0.0016929978,0.018317787],"genre_scores_gemma":[0.6606318,0.0009797105,0.3245208,0.00016202935,0.0002613213,0.00011662593,0.0003681186,0.00006644328,0.012893164],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988437,0.000017204295,0.000009332116,0.000023593835,0.00004662322,0.000018876506],"domain_scores_gemma":[0.9998281,0.00003243113,0.000043437438,0.000037219514,0.000045925703,0.000012923189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021960113,0.0005098279,0.0003828609,0.00066508085,0.00039297197,0.00037850565,0.00051656493,0.00032577265,0.0025828357],"category_scores_gemma":[0.00034397404,0.0001831389,0.00036297622,0.00047226096,0.00022842805,0.0007350214,0.00022897712,0.00043820075,0.00077550334],"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.00077416963,0.00018278358,0.0011523664,0.00042158805,0.000103463484,0.001052734,0.00016129763,0.01575398,0.4892507,0.05990758,0.004488002,0.42675138],"study_design_scores_gemma":[0.00046438386,0.004379234,0.003779076,0.00016561577,0.0003798731,0.013038353,0.000106327774,0.30832645,0.5339914,0.022648409,0.11252003,0.00020075582],"about_ca_topic_score_codex":0.00014881862,"about_ca_topic_score_gemma":0.0003461894,"teacher_disagreement_score":0.0025828357,"about_ca_system_score_codex":0.0002476096,"about_ca_system_score_gemma":0.00038339797,"threshold_uncertainty_score":0.008640468},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00843509,0.0072826934,0.970426,0.00030672585,0.00038709273,0.000059932052,0.000049891536,0.00044856546,0.012604047],"genre_scores_gemma":[0.24976696,0.008035736,0.7342513,0.0003262682,0.0007278493,0.00012528495,0.00012796595,0.00014781475,0.0064907162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983437,0.00036349508,0.00017574558,0.00028491142,0.0007579726,0.000074059804],"domain_scores_gemma":[0.9981839,0.00089438603,0.00021160227,0.00028717695,0.00039342986,0.000029577024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017296713,0.00074914657,0.0008013407,0.0016612579,0.00043667018,0.0015204874,0.0009662718,0.00076998747,0.0023223283],"category_scores_gemma":[0.0056162886,0.0003472377,0.00067780825,0.0020611323,0.0013732584,0.002282914,0.00083605084,0.0011514605,0.00093797484],"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.00036047123,0.0000325205,0.00069213536,0.00049562193,0.0000699328,0.0005402537,0.00022717752,0.045896985,0.025761355,0.48348093,0.0031836058,0.43925893],"study_design_scores_gemma":[0.00015103226,0.00076857716,0.0013425025,0.00023469626,0.00013532132,0.0042759064,0.000090051835,0.4936421,0.09838284,0.28757077,0.11318831,0.00021789085],"about_ca_topic_score_codex":0.00050332985,"about_ca_topic_score_gemma":0.0004396409,"teacher_disagreement_score":0.0023223283,"about_ca_system_score_codex":0.00078135455,"about_ca_system_score_gemma":0.00073880795,"threshold_uncertainty_score":0.009147465},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3360436,0.0017317282,0.6111179,0.0005677601,0.00046990742,0.00041617837,0.00038206924,0.011247238,0.038023606],"genre_scores_gemma":[0.8095235,0.00036681525,0.17690092,0.0002832977,0.00009192192,0.0001425213,0.00036002687,0.00017644068,0.012154512],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987257,0.000013290692,0.000010913145,0.00003673645,0.000033941167,0.000032401844],"domain_scores_gemma":[0.99987674,0.000022191343,0.000019748988,0.00002901167,0.00004009674,0.00001216048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011622284,0.0002881223,0.00023192554,0.00048306215,0.00032926098,0.00045780442,0.00085204036,0.0002960861,0.0031253386],"category_scores_gemma":[0.00026566305,0.0001599348,0.00021961263,0.00026994818,0.00014634963,0.00044030356,0.00023775926,0.00030205856,0.0012254793],"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.0010328565,0.00021537082,0.0030194814,0.00038049647,0.000106881074,0.0010720663,0.00019949075,0.037868883,0.49898866,0.01801087,0.01261284,0.42649207],"study_design_scores_gemma":[0.00026962726,0.0013659627,0.0028889014,0.00007826217,0.0002291944,0.0020422372,0.0000871266,0.23590522,0.66936725,0.0036177656,0.08403848,0.00010992448],"about_ca_topic_score_codex":0.00054030993,"about_ca_topic_score_gemma":0.0007615076,"teacher_disagreement_score":0.0031253386,"about_ca_system_score_codex":0.0003268462,"about_ca_system_score_gemma":0.000519865,"threshold_uncertainty_score":0.01045531},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.642643,0.0003499489,0.3539119,0.000115588264,0.000054953165,0.000049448154,0.0000270844,0.0007562502,0.0020918807],"genre_scores_gemma":[0.9327222,0.000099190256,0.0660383,0.000018550958,0.000017012977,0.000015282654,0.000022681446,0.000023512033,0.0010431899],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994368,0.00009987525,0.00004186409,0.000079831414,0.00027234486,0.00006933393],"domain_scores_gemma":[0.99867034,0.000519799,0.0002768238,0.0002352734,0.0002612478,0.000036637135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065378565,0.00041340297,0.0003238447,0.0005334706,0.00030774015,0.0005128642,0.0006248698,0.0002642575,0.0008448705],"category_scores_gemma":[0.0023475953,0.00020803281,0.00025503294,0.00046171653,0.00051198085,0.0014458231,0.00046975186,0.00028286723,0.00012018666],"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.0018909359,0.00028899964,0.010075107,0.00030563594,0.00009040943,0.00108676,0.00047680896,0.25684714,0.28418112,0.046671428,0.00087899546,0.39720657],"study_design_scores_gemma":[0.000060099803,0.000649013,0.001315147,0.000022815793,0.000046366695,0.00042688492,0.000093349845,0.8110377,0.1756129,0.008925482,0.0017752928,0.000034887846],"about_ca_topic_score_codex":0.0007614825,"about_ca_topic_score_gemma":0.0014936912,"teacher_disagreement_score":0.0008448705,"about_ca_system_score_codex":0.00040554575,"about_ca_system_score_gemma":0.0006969008,"threshold_uncertainty_score":0.0034576058},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105437905,0.0005521302,0.88144433,0.00022117152,0.000074656746,0.0001435246,0.000108585045,0.00081356656,0.011204158],"genre_scores_gemma":[0.48254412,0.0006268579,0.507748,0.00011289379,0.0000742545,0.00015842453,0.0002796905,0.00007874623,0.008377079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997961,0.000047921163,0.000016027181,0.000033988454,0.00007810589,0.000027985563],"domain_scores_gemma":[0.99977905,0.000055989578,0.000044380657,0.00006896661,0.00004390119,0.000007830081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020945969,0.00045360625,0.00031097615,0.0003429454,0.00038747778,0.00064784323,0.0007305058,0.00026880967,0.0038926438],"category_scores_gemma":[0.00056542095,0.00017241268,0.00042420227,0.0006135932,0.0003538246,0.0012194355,0.00032191313,0.0006222934,0.00094975624],"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.0004351528,0.00019868014,0.0010523022,0.000594519,0.00010478104,0.0005020892,0.0002727285,0.17877112,0.1739723,0.34497482,0.0057032746,0.29341823],"study_design_scores_gemma":[0.00012677052,0.0007078957,0.0009346969,0.00006136007,0.0001112488,0.0008404683,0.000095458076,0.73854965,0.10860853,0.12329798,0.026611945,0.000053979766],"about_ca_topic_score_codex":0.00051975844,"about_ca_topic_score_gemma":0.0024212454,"teacher_disagreement_score":0.0038926438,"about_ca_system_score_codex":0.0005895006,"about_ca_system_score_gemma":0.0006638862,"threshold_uncertainty_score":0.013022125},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1374105,0.0012180005,0.8393015,0.0002848802,0.00022692625,0.00017423714,0.00021986855,0.0021261314,0.019037805],"genre_scores_gemma":[0.4456333,0.0007278465,0.5394658,0.00010689206,0.000106967826,0.00011975065,0.0005118862,0.0000686081,0.0132589415],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984396,0.00003936809,0.000013665715,0.000024992185,0.00005690422,0.000021097152],"domain_scores_gemma":[0.99964833,0.00008075165,0.000061361585,0.000069154245,0.000119516655,0.000020802005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024196506,0.0004983653,0.0003031803,0.0004025263,0.00027765587,0.0005678567,0.0005075291,0.00024620397,0.0056964573],"category_scores_gemma":[0.001036454,0.00015764085,0.00020697943,0.00063192303,0.00025818727,0.0010324508,0.00031244924,0.00042398318,0.0022946738],"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.001124672,0.00015633917,0.0015953517,0.00044453502,0.00005719181,0.00041107205,0.00015541053,0.017847208,0.23124838,0.09717934,0.0076846243,0.6420959],"study_design_scores_gemma":[0.00038171938,0.0032689916,0.003619462,0.00014350445,0.00013668984,0.005147836,0.00023094285,0.32934418,0.44620758,0.11240212,0.09901426,0.000102711],"about_ca_topic_score_codex":0.00034828403,"about_ca_topic_score_gemma":0.0011970943,"teacher_disagreement_score":0.0056964573,"about_ca_system_score_codex":0.00026280148,"about_ca_system_score_gemma":0.00063023804,"threshold_uncertainty_score":0.019056499},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050305188,0.0012172875,0.92249024,0.00036561716,0.0003663307,0.00012344493,0.00015720063,0.0038687105,0.021106103],"genre_scores_gemma":[0.34929925,0.0010117752,0.62681746,0.00038847313,0.00034145557,0.00023768388,0.00093328644,0.00019572125,0.020774832],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998047,0.00002479362,0.000014580701,0.00003837629,0.000084417654,0.000033212986],"domain_scores_gemma":[0.99986005,0.000016986767,0.000010657474,0.00002105709,0.00007928339,0.000012064563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017181598,0.00034206835,0.00038288315,0.00062114146,0.0003969135,0.00047446473,0.00068599,0.00032602306,0.005179209],"category_scores_gemma":[0.00029725736,0.0002005084,0.0003084045,0.00058689906,0.00018738495,0.0012251508,0.0004996746,0.00050257426,0.0017788766],"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.00072386384,0.00010892146,0.001237467,0.00038966734,0.00010761779,0.00077344093,0.00022153453,0.046805903,0.29129827,0.051364794,0.02746161,0.5795069],"study_design_scores_gemma":[0.00028721217,0.0010962359,0.002445368,0.00007450288,0.0001487212,0.0025201382,0.000101999074,0.6622565,0.14592423,0.01645497,0.16855827,0.00013195608],"about_ca_topic_score_codex":0.0005011263,"about_ca_topic_score_gemma":0.001161088,"teacher_disagreement_score":0.005179209,"about_ca_system_score_codex":0.00037411076,"about_ca_system_score_gemma":0.0004716545,"threshold_uncertainty_score":0.017326117},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15239012,0.0019382153,0.8191568,0.00041279462,0.00033153614,0.00020937737,0.000073851086,0.0030230887,0.022464199],"genre_scores_gemma":[0.7963471,0.0006301588,0.19596413,0.000101329206,0.0000913605,0.00007917232,0.00010163657,0.000036964906,0.0066481875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997614,0.00004442815,0.00001542302,0.00004034007,0.00010402973,0.000034411627],"domain_scores_gemma":[0.9998716,0.000035704663,0.000019663641,0.000031884352,0.00003108477,0.000009961552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018441792,0.00031784648,0.00026247746,0.00062076416,0.00026491945,0.00048502773,0.00044377078,0.00038172145,0.0037104154],"category_scores_gemma":[0.0003769538,0.00018005323,0.00023686438,0.00022850884,0.00023470375,0.0006355997,0.00021976534,0.00037083426,0.0007511822],"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.00077515066,0.00019651142,0.0016079486,0.0004318321,0.00008560785,0.0007243222,0.0001701642,0.017236419,0.39723563,0.06466938,0.003266184,0.5136009],"study_design_scores_gemma":[0.00045505638,0.0020306846,0.0056448,0.00011267286,0.00014892504,0.006268917,0.00009061803,0.374059,0.55025613,0.013494536,0.04732086,0.00011782885],"about_ca_topic_score_codex":0.00021227889,"about_ca_topic_score_gemma":0.0003100664,"teacher_disagreement_score":0.0037104154,"about_ca_system_score_codex":0.00026423155,"about_ca_system_score_gemma":0.00030487883,"threshold_uncertainty_score":0.012412608},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06778175,0.0011310885,0.8942291,0.0003344019,0.0002537596,0.0001226934,0.0002052546,0.0055730757,0.030368794],"genre_scores_gemma":[0.3200743,0.0006516817,0.65992796,0.00021769614,0.00015656634,0.000104198145,0.00027167134,0.00013231015,0.018463679],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998447,0.000031984695,0.000014301002,0.000019642232,0.00007524497,0.000014189089],"domain_scores_gemma":[0.99973625,0.000077415425,0.00005404911,0.00005342064,0.00006884775,0.0000098744395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022255424,0.00029551756,0.00017502363,0.00026469398,0.00020462823,0.00041881786,0.0007904917,0.00025848433,0.006707481],"category_scores_gemma":[0.0006853176,0.00012325111,0.00017471118,0.00035766454,0.00020064188,0.0005517524,0.00020426662,0.00029744869,0.002357245],"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.00036624484,0.00012362881,0.0006297578,0.00047010003,0.000036426023,0.00046772455,0.00017015636,0.035076983,0.33803314,0.07187617,0.009470899,0.54327863],"study_design_scores_gemma":[0.00020684302,0.0018913808,0.0011174813,0.00015158598,0.00011306738,0.0021047425,0.00011079758,0.3043039,0.5090081,0.020158233,0.1607635,0.00007029664],"about_ca_topic_score_codex":0.0002091354,"about_ca_topic_score_gemma":0.0004887105,"teacher_disagreement_score":0.006707481,"about_ca_system_score_codex":0.0002771502,"about_ca_system_score_gemma":0.00035081714,"threshold_uncertainty_score":0.022438765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19044022,0.007434338,0.73835725,0.0007812235,0.0004489294,0.0002051031,0.00010611243,0.0035559617,0.05867083],"genre_scores_gemma":[0.81997824,0.0017880818,0.16174173,0.00012308038,0.00016260623,0.00007978788,0.000091853595,0.00012133731,0.01591322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998362,0.000037914586,0.000012043698,0.000026305028,0.00006204056,0.000025395195],"domain_scores_gemma":[0.9997706,0.00005348691,0.00004017129,0.00009334993,0.000033351385,0.000009077504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015723119,0.00049836416,0.00029198686,0.00042178755,0.00030967733,0.0007380532,0.00046230495,0.0003601393,0.0039767283],"category_scores_gemma":[0.00056201627,0.00019179616,0.0003997872,0.00034918252,0.00026666114,0.0008220091,0.00026354368,0.0004332301,0.0011969785],"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.00083434855,0.000117384654,0.0016008029,0.00044858307,0.000105464045,0.0011706912,0.00012934404,0.11936858,0.34378567,0.17540483,0.004685025,0.35234922],"study_design_scores_gemma":[0.00019335875,0.00089726574,0.0026083798,0.00015161943,0.00015118453,0.0027012015,0.00008927419,0.5434268,0.3000142,0.050402503,0.09926406,0.00010017658],"about_ca_topic_score_codex":0.00020242357,"about_ca_topic_score_gemma":0.00027783675,"teacher_disagreement_score":0.0039767283,"about_ca_system_score_codex":0.00043878824,"about_ca_system_score_gemma":0.0002930156,"threshold_uncertainty_score":0.013303518},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044933777,0.00041285527,0.9456434,0.0003277749,0.00015556205,0.00007612318,0.00003779661,0.0011819217,0.007230836],"genre_scores_gemma":[0.36630374,0.00048017714,0.6269546,0.00019297106,0.00031856322,0.000091450514,0.00011730715,0.0005037363,0.005037361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858,0.00033741046,0.00006521691,0.00023724785,0.0006511117,0.00012894317],"domain_scores_gemma":[0.99788564,0.0007641781,0.00013401649,0.0008576675,0.00023942205,0.000118980155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014668545,0.0006464257,0.0009932366,0.0011381502,0.0007568175,0.0019254393,0.001295008,0.000483755,0.0044867974],"category_scores_gemma":[0.0068294355,0.00028174464,0.0006027188,0.0010383496,0.0018364664,0.0030254996,0.0034343419,0.0022997952,0.0012895807],"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.00043697882,0.00009389096,0.0018485441,0.00022755974,0.000041434,0.0004284446,0.00032832008,0.028930342,0.022927782,0.58828473,0.0048218593,0.3516301],"study_design_scores_gemma":[0.00012548422,0.00038007903,0.0012872485,0.00007335677,0.00005185261,0.0010886856,0.000116893796,0.35014918,0.041799348,0.56960535,0.035195224,0.00012726319],"about_ca_topic_score_codex":0.00020851078,"about_ca_topic_score_gemma":0.00030720924,"teacher_disagreement_score":0.0044867974,"about_ca_system_score_codex":0.0006567183,"about_ca_system_score_gemma":0.00070080056,"threshold_uncertainty_score":0.01500982},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050340995,0.0008433222,0.88958406,0.000390276,0.0004216625,0.00015761131,0.00022993148,0.002037625,0.05599456],"genre_scores_gemma":[0.5160355,0.0009876954,0.45373255,0.00047257682,0.00039831715,0.00018950408,0.0005697661,0.00049372384,0.027120413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990362,0.00011461106,0.00009118648,0.00013789155,0.00049293396,0.00012721641],"domain_scores_gemma":[0.9989987,0.000262707,0.00012540421,0.00030527724,0.00026032227,0.000047568985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006258747,0.00065348134,0.0005685304,0.0011832695,0.0007254076,0.0014957843,0.0011938591,0.0007219524,0.012415228],"category_scores_gemma":[0.0032008092,0.0002923183,0.00076792913,0.0014250388,0.00079583074,0.0028383797,0.0016180605,0.0014616207,0.003327736],"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.00022268802,0.00007921141,0.0005969866,0.00028309526,0.00003991312,0.0003227404,0.00024795282,0.010759999,0.04235686,0.5873148,0.009675511,0.34810024],"study_design_scores_gemma":[0.00013539907,0.0005083444,0.0009663748,0.00017282134,0.00014986495,0.0022586912,0.00013036869,0.17331812,0.10563599,0.5630672,0.15349494,0.000161998],"about_ca_topic_score_codex":0.00029729985,"about_ca_topic_score_gemma":0.00060829066,"teacher_disagreement_score":0.012415228,"about_ca_system_score_codex":0.00067006215,"about_ca_system_score_gemma":0.00056045345,"threshold_uncertainty_score":0.041533113},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13769421,0.0003836231,0.78825504,0.0007316679,0.00043931734,0.0005243571,0.00073219277,0.015722292,0.055517234],"genre_scores_gemma":[0.44458067,0.00020844293,0.5351173,0.00031450676,0.00006805195,0.00020792712,0.0007951578,0.00047442998,0.018233474],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996909,0.000042069947,0.000021977972,0.000057146306,0.00011586809,0.00007220237],"domain_scores_gemma":[0.9992643,0.00023526924,0.000072734,0.00019615663,0.00019508095,0.000036333007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039794232,0.0005033761,0.00030550908,0.0006046171,0.00068134157,0.0007306207,0.0008571338,0.00042751117,0.014949993],"category_scores_gemma":[0.0017584412,0.00015375447,0.00037483065,0.0010633569,0.00045389018,0.0009112765,0.00054369296,0.0007130227,0.00394566],"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.0017538721,0.00042285415,0.0022177536,0.00072510727,0.00008655721,0.001617468,0.00044423837,0.020791505,0.15512578,0.10618089,0.03668436,0.6739496],"study_design_scores_gemma":[0.0006046686,0.0016694098,0.0029455328,0.00023995133,0.00009227998,0.0044252193,0.00028480077,0.27119437,0.5344038,0.04413305,0.13986056,0.0001462666],"about_ca_topic_score_codex":0.0018829143,"about_ca_topic_score_gemma":0.0033118986,"teacher_disagreement_score":0.014949993,"about_ca_system_score_codex":0.00064364355,"about_ca_system_score_gemma":0.0014916622,"threshold_uncertainty_score":0.050012767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10197285,0.0011642822,0.87084085,0.00036825167,0.0002487743,0.000098888595,0.00010480378,0.0013158453,0.023885483],"genre_scores_gemma":[0.56359327,0.0007711024,0.42507532,0.00012663673,0.00015487353,0.00007918386,0.0002791845,0.000109559536,0.009810916],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993918,0.00013026495,0.000049231552,0.000100057216,0.00023469438,0.000093934665],"domain_scores_gemma":[0.99929607,0.0002397161,0.00006385918,0.0002029284,0.00016375835,0.00003365871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005722468,0.00047898988,0.0005687141,0.00056662154,0.00048244972,0.0012746122,0.00055044814,0.00039002043,0.0035499898],"category_scores_gemma":[0.0018850976,0.00021430316,0.0002834866,0.0008218329,0.00068655866,0.0026441868,0.001207961,0.00076273317,0.0015412928],"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.00073731627,0.00013326122,0.00076884474,0.0002381218,0.000025646714,0.0002122903,0.00023087746,0.03050747,0.063447475,0.44584033,0.0075014075,0.45035696],"study_design_scores_gemma":[0.00011945762,0.0006107677,0.00036923282,0.00007798822,0.000024870136,0.00084660295,0.00012950196,0.35067564,0.085400864,0.51447034,0.047223266,0.000051517036],"about_ca_topic_score_codex":0.00021872681,"about_ca_topic_score_gemma":0.00040952003,"teacher_disagreement_score":0.0035499898,"about_ca_system_score_codex":0.0003754717,"about_ca_system_score_gemma":0.0006958628,"threshold_uncertainty_score":0.011875927},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30064315,0.0009763568,0.6783403,0.00021332923,0.00020006933,0.00015188892,0.00011991293,0.0026487422,0.016706193],"genre_scores_gemma":[0.61581445,0.00041241452,0.37860233,0.00007939364,0.000070283415,0.000064019536,0.0001233491,0.000051627998,0.0047821146],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998884,0.000025410694,0.000009015504,0.000016123455,0.000041066334,0.000019882618],"domain_scores_gemma":[0.9998629,0.000048734433,0.000021360132,0.000020102918,0.00003729706,0.0000095911455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023789804,0.00026361254,0.00020501942,0.0004074616,0.00028227968,0.00040523466,0.0003611434,0.00032134738,0.0019599344],"category_scores_gemma":[0.00041727838,0.00016368883,0.00019089633,0.00020368045,0.00021033183,0.0003766422,0.00011221367,0.0002046901,0.00046410374],"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.00089003675,0.0001803141,0.0029852202,0.0004286642,0.00013088528,0.00084531883,0.00042770422,0.061392367,0.44689277,0.036732092,0.0032526029,0.44584215],"study_design_scores_gemma":[0.00042817582,0.0028993133,0.0051746047,0.000105909814,0.00015079329,0.0018529558,0.00013844632,0.42380643,0.5044089,0.00633777,0.05461123,0.000085407606],"about_ca_topic_score_codex":0.0006115597,"about_ca_topic_score_gemma":0.0010004438,"teacher_disagreement_score":0.0019599344,"about_ca_system_score_codex":0.00031068097,"about_ca_system_score_gemma":0.00035475226,"threshold_uncertainty_score":0.0065565705},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29537526,0.00095299265,0.6770058,0.00025054003,0.00021802218,0.0002807936,0.00038291904,0.005993004,0.019540602],"genre_scores_gemma":[0.77601624,0.00032760686,0.21555862,0.000108144646,0.00008106986,0.00012011014,0.00043952127,0.000087629414,0.0072611882],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997998,0.000021345671,0.00002073207,0.000051058727,0.00005955274,0.00004745473],"domain_scores_gemma":[0.99972266,0.000058479924,0.000039482868,0.0000752061,0.00008176548,0.000022395816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003107755,0.000558233,0.00033672302,0.000600478,0.00041017914,0.0005158357,0.0007296062,0.00033364882,0.0047771805],"category_scores_gemma":[0.000620629,0.00022364654,0.00036646292,0.0004355197,0.00025866306,0.0011797155,0.00054137164,0.0004045463,0.0013737215],"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.001507798,0.00022026013,0.002840346,0.0006185005,0.000073104624,0.00092200004,0.00031650197,0.03079287,0.52073914,0.054868016,0.0077664405,0.3793349],"study_design_scores_gemma":[0.00035939473,0.0028050696,0.002912429,0.00013351777,0.00016994133,0.0025244267,0.00010404208,0.27884844,0.6023964,0.030129664,0.07947823,0.00013829525],"about_ca_topic_score_codex":0.00041632814,"about_ca_topic_score_gemma":0.00070468563,"teacher_disagreement_score":0.0047771805,"about_ca_system_score_codex":0.00041262852,"about_ca_system_score_gemma":0.0008684207,"threshold_uncertainty_score":0.015981317},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036752786,0.0017869752,0.14685532,0.0073179975,0.006338861,0.00006056295,0.0010738295,0.0031073443,0.7967064],"genre_scores_gemma":[0.59480983,0.0018435793,0.07785203,0.003132201,0.0029974987,0.00012216534,0.0013137294,0.0022627863,0.31566623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984205,0.00024247839,0.00008825375,0.0004257812,0.00056511327,0.00025795176],"domain_scores_gemma":[0.99835616,0.00048574037,0.00014858333,0.0003452897,0.0004617996,0.00020244558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015585048,0.001036215,0.0007305295,0.0018070894,0.002500928,0.004016959,0.0007312357,0.00097145623,0.044766128],"category_scores_gemma":[0.004007586,0.000512676,0.0014227912,0.0011690218,0.0041624396,0.004822462,0.0024991885,0.0033809445,0.018813182],"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.0001787663,0.00002098757,0.00031603564,0.00010420159,0.000020322055,0.0002258187,0.00033516702,0.00038715973,0.0016765889,0.9389228,0.028472051,0.029339992],"study_design_scores_gemma":[0.000034547196,0.00010542608,0.0009463956,0.000050531722,0.000022516919,0.00060257304,0.00012798059,0.00092256203,0.0045138663,0.60640967,0.38619238,0.00007147363],"about_ca_topic_score_codex":0.0011001062,"about_ca_topic_score_gemma":0.0012311783,"teacher_disagreement_score":0.044766128,"about_ca_system_score_codex":0.00213116,"about_ca_system_score_gemma":0.0013470409,"threshold_uncertainty_score":0.14975762},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026152879,0.0070443847,0.9118747,0.00072986464,0.0004002243,0.000110231755,0.00009094307,0.0031756798,0.050421067],"genre_scores_gemma":[0.4340572,0.009000918,0.51019555,0.0005729193,0.000353648,0.000090910195,0.0002664466,0.0002565664,0.04520575],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996836,0.000061928484,0.000023341907,0.00004760019,0.00016391405,0.000019627796],"domain_scores_gemma":[0.99965036,0.0001184086,0.000026359572,0.00007938327,0.00011442327,0.000011131263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032591337,0.000362856,0.00025900954,0.0005412731,0.00019379528,0.0004598877,0.00037959783,0.00047904006,0.008864846],"category_scores_gemma":[0.00094962603,0.00011473955,0.00031494288,0.0005808411,0.00029168106,0.0006186471,0.00042725005,0.00044967173,0.0039030507],"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.0002025765,0.000048847156,0.0007763541,0.0007207616,0.000030177116,0.0005911803,0.00017968811,0.013948493,0.15868466,0.058232974,0.007429991,0.7591544],"study_design_scores_gemma":[0.000047443835,0.00060119486,0.0016749398,0.00025445147,0.00007840173,0.005013669,0.0001536156,0.25082698,0.28867775,0.039267693,0.4133389,0.000064912325],"about_ca_topic_score_codex":0.00032292688,"about_ca_topic_score_gemma":0.0003645162,"teacher_disagreement_score":0.008864846,"about_ca_system_score_codex":0.00027814443,"about_ca_system_score_gemma":0.00025587343,"threshold_uncertainty_score":0.029655874},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24068865,0.008641018,0.6922384,0.00236862,0.00046621414,0.00025721267,0.00062515703,0.002585767,0.052129008],"genre_scores_gemma":[0.77008885,0.0030551406,0.21324804,0.00025661424,0.00032867098,0.0002298832,0.0007262701,0.0002406999,0.011825827],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969187,0.0005222443,0.00025971237,0.00032982047,0.0016441793,0.0003253729],"domain_scores_gemma":[0.99557567,0.0027542962,0.000323557,0.00066990545,0.00060806586,0.000068619505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010686895,0.0006476278,0.00060504663,0.0009190737,0.0005959251,0.0023731457,0.0012000089,0.00062437536,0.0068609538],"category_scores_gemma":[0.007964941,0.00042792075,0.0006116186,0.0011787096,0.0007229831,0.004157229,0.0010568666,0.0008536942,0.0019275685],"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.0015216888,0.000164806,0.004190105,0.001303207,0.00014061682,0.0007985555,0.00039125548,0.14614622,0.049649507,0.19451286,0.011608402,0.5895729],"study_design_scores_gemma":[0.0003543644,0.000646144,0.0032945373,0.00022204804,0.00017752121,0.0022270419,0.0002662656,0.6978216,0.06942012,0.18394396,0.041491713,0.00013466853],"about_ca_topic_score_codex":0.00096296467,"about_ca_topic_score_gemma":0.0012393296,"teacher_disagreement_score":0.0068609538,"about_ca_system_score_codex":0.0012004668,"about_ca_system_score_gemma":0.0019743745,"threshold_uncertainty_score":0.02295214},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030473888,0.0005625389,0.9444446,0.00045516665,0.00024474418,0.0001655872,0.00032076752,0.0055093584,0.01782335],"genre_scores_gemma":[0.18878168,0.00052904553,0.7752613,0.00028633745,0.00027358194,0.00027430584,0.0011209843,0.001541857,0.03193091],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822086,0.00026155464,0.00013942491,0.00034724013,0.00083643856,0.00019445193],"domain_scores_gemma":[0.9968573,0.0010121127,0.00013068882,0.0011710274,0.0006610395,0.00016774042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016244272,0.0015791247,0.0014901401,0.0020339477,0.001102557,0.0035432996,0.0023568638,0.001216749,0.018265398],"category_scores_gemma":[0.0067512156,0.00067971105,0.001199313,0.0028071627,0.0011995804,0.006195009,0.0036773118,0.0025946319,0.008611931],"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.00072017295,0.00019940225,0.0011744335,0.00025410464,0.000069279326,0.00013813771,0.00025879734,0.010122036,0.01683107,0.16985899,0.02022203,0.7801515],"study_design_scores_gemma":[0.0003420497,0.00026370093,0.0012552179,0.00008912286,0.00017158987,0.0006460264,0.00024951753,0.19313534,0.030632932,0.72444296,0.048684254,0.00008733374],"about_ca_topic_score_codex":0.0012315648,"about_ca_topic_score_gemma":0.0019745352,"teacher_disagreement_score":0.018265398,"about_ca_system_score_codex":0.0016199904,"about_ca_system_score_gemma":0.0016240776,"threshold_uncertainty_score":0.06110382},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17686751,0.0016268318,0.7923282,0.00051196315,0.000255458,0.00013408058,0.00013236313,0.0040049935,0.024138656],"genre_scores_gemma":[0.70317477,0.0006225859,0.28252158,0.00022910866,0.00015857774,0.00011980377,0.00043805977,0.00010783022,0.0126276165],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998822,0.000014880726,0.000008159005,0.000020114274,0.000052737738,0.000022029986],"domain_scores_gemma":[0.99991596,0.000011838071,0.000009203677,0.00001313444,0.000041490814,0.000008378119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012256467,0.00027375927,0.00022319706,0.0004933778,0.00031848042,0.00032128123,0.0006128238,0.0002377681,0.0033050603],"category_scores_gemma":[0.00022265996,0.00015969813,0.00020427752,0.00043620585,0.00013698984,0.00095492916,0.0003240714,0.00034169288,0.0009702446],"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.000624168,0.00013347609,0.0016909841,0.0003585894,0.00009436771,0.0010077338,0.00023039016,0.04256627,0.42802677,0.03228057,0.019109134,0.4738776],"study_design_scores_gemma":[0.0003318119,0.0016715295,0.0052956156,0.00006495728,0.0001595136,0.0027416667,0.00012378288,0.67916244,0.21699722,0.015003807,0.07833309,0.00011471707],"about_ca_topic_score_codex":0.00047508042,"about_ca_topic_score_gemma":0.001255072,"teacher_disagreement_score":0.0033050603,"about_ca_system_score_codex":0.0003071337,"about_ca_system_score_gemma":0.0004001866,"threshold_uncertainty_score":0.011056483},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18534566,0.0012354656,0.7821263,0.0003913578,0.00034743315,0.00016338495,0.000129549,0.002569509,0.027691362],"genre_scores_gemma":[0.62568206,0.00075767504,0.35574424,0.0000936147,0.000118264354,0.00008929931,0.00022468907,0.000055476186,0.017234659],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998952,0.000021039283,0.00000777334,0.000014576793,0.0000488489,0.000012515727],"domain_scores_gemma":[0.9998964,0.000018150064,0.0000124184135,0.000019356863,0.000043632226,0.000010075189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014092891,0.00029485984,0.00020700351,0.0004271733,0.0001985144,0.00036430117,0.00036937476,0.0002630351,0.0038045412],"category_scores_gemma":[0.0003460256,0.00016271732,0.00016153132,0.00036006654,0.00021092388,0.00063881016,0.00020430266,0.00032725531,0.0008936665],"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.00066137424,0.000121308614,0.0010811598,0.00026344543,0.00004975629,0.0010742629,0.00020061768,0.017820584,0.35785824,0.060632713,0.00460458,0.55563194],"study_design_scores_gemma":[0.0002922543,0.0028711043,0.0034221373,0.000111868045,0.00010152786,0.009663107,0.0001546045,0.33590388,0.5094715,0.0317147,0.10612697,0.00016631071],"about_ca_topic_score_codex":0.000321133,"about_ca_topic_score_gemma":0.00050683157,"teacher_disagreement_score":0.0038045412,"about_ca_system_score_codex":0.00023651795,"about_ca_system_score_gemma":0.0003772387,"threshold_uncertainty_score":0.012727439},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2725403,0.002940919,0.639046,0.0006352407,0.000810555,0.0004701823,0.0005000771,0.008590966,0.07446574],"genre_scores_gemma":[0.7119906,0.00081624236,0.26222953,0.00022236603,0.00015953161,0.00010474559,0.000532267,0.00011777222,0.02382687],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974936,0.00003869831,0.000016624741,0.00004475762,0.00010861844,0.000042067753],"domain_scores_gemma":[0.99978083,0.000028355335,0.000022470782,0.00005117905,0.0001008645,0.00001626027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001486422,0.0004260582,0.00031145682,0.00052567956,0.0002202205,0.0005793256,0.00070613134,0.00036992272,0.0070947455],"category_scores_gemma":[0.00037876697,0.00016898048,0.00023813563,0.0003802121,0.00012562085,0.0004504126,0.0001302819,0.0004358509,0.002038792],"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.0014010977,0.00025884135,0.0022771533,0.00049660326,0.00011220444,0.0017257135,0.00013814631,0.039664593,0.34468174,0.023171483,0.012706552,0.5733659],"study_design_scores_gemma":[0.0006582627,0.0037101174,0.011106818,0.00020355792,0.0002342267,0.0069045937,0.00007589478,0.3501658,0.45044976,0.0032000237,0.17311077,0.00018015788],"about_ca_topic_score_codex":0.0011909804,"about_ca_topic_score_gemma":0.0014295432,"teacher_disagreement_score":0.0070947455,"about_ca_system_score_codex":0.00037148956,"about_ca_system_score_gemma":0.0005177919,"threshold_uncertainty_score":0.023734272},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052923627,0.0011372778,0.8944881,0.00041670867,0.0005225177,0.00035075968,0.00038746992,0.009938034,0.03983547],"genre_scores_gemma":[0.34988657,0.0007931534,0.62289274,0.0004586503,0.00022001793,0.0002180967,0.0007435809,0.00041298376,0.024374207],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958557,0.00004630425,0.000035317236,0.000068191155,0.00020562785,0.000058948714],"domain_scores_gemma":[0.99972516,0.00006048639,0.000023339406,0.00007199719,0.00010026438,0.000018780014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003142201,0.00061081233,0.00062715996,0.000981906,0.0005099331,0.0015806758,0.0009841565,0.0007175797,0.013670035],"category_scores_gemma":[0.00081203616,0.0002930796,0.00032221124,0.0011013,0.0003022994,0.0016673091,0.00082549854,0.0007910037,0.007291521],"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.0006158946,0.00029041158,0.00043710717,0.00033045924,0.00004668839,0.00058672385,0.00012755458,0.0075283875,0.1782791,0.060723435,0.016523989,0.73451024],"study_design_scores_gemma":[0.00050098693,0.0008237624,0.001479058,0.00014035092,0.0001361566,0.005505635,0.0001325482,0.17511187,0.5940572,0.055221483,0.16672364,0.00016730114],"about_ca_topic_score_codex":0.00025982846,"about_ca_topic_score_gemma":0.00040928565,"teacher_disagreement_score":0.013670035,"about_ca_system_score_codex":0.00035484764,"about_ca_system_score_gemma":0.00080841826,"threshold_uncertainty_score":0.04573077},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14989318,0.0008367822,0.83206147,0.00020208844,0.00009363658,0.00014297891,0.00007495321,0.003496972,0.013197921],"genre_scores_gemma":[0.73607236,0.00052445167,0.25404885,0.00011308209,0.00005078813,0.00009682825,0.00019418127,0.000074348136,0.008825125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998072,0.000030881853,0.000020392588,0.00003685542,0.000069897294,0.000034890552],"domain_scores_gemma":[0.99968445,0.00006144608,0.0000685078,0.00008238312,0.0000810571,0.000022182337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018948546,0.0004503931,0.00025385077,0.0007445205,0.00035445747,0.00061042473,0.00086770114,0.00041058153,0.004592344],"category_scores_gemma":[0.00047081386,0.00018966045,0.00026859422,0.00063872134,0.00025169214,0.0012308365,0.00041046785,0.00042861194,0.0012048308],"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.0006910116,0.00026117667,0.0017911054,0.00034251495,0.00007066355,0.0005262472,0.00032986523,0.03315359,0.3804261,0.042232417,0.0033924344,0.5367829],"study_design_scores_gemma":[0.00038507328,0.0025170003,0.0039068847,0.00012096685,0.00017415639,0.0021887866,0.00016297006,0.41855976,0.47410044,0.036218405,0.0615342,0.00013134435],"about_ca_topic_score_codex":0.00043642198,"about_ca_topic_score_gemma":0.0007446862,"teacher_disagreement_score":0.004592344,"about_ca_system_score_codex":0.00042748125,"about_ca_system_score_gemma":0.0003766533,"threshold_uncertainty_score":0.015362859},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053782642,0.00019727678,0.9254004,0.00071237964,0.00016057574,0.00013327389,0.00012020765,0.0021716647,0.017321538],"genre_scores_gemma":[0.35119456,0.00027324673,0.6239379,0.0003917253,0.00013355442,0.0002880803,0.00037003757,0.0005351422,0.022875722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982167,0.00041690108,0.00013498515,0.00031276795,0.0006178842,0.0003007949],"domain_scores_gemma":[0.9982698,0.00072597124,0.00008208268,0.00043321642,0.00040695484,0.00008184646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016002686,0.00058291305,0.0007735416,0.0011026453,0.000871533,0.001865559,0.0010309613,0.0011654245,0.008553626],"category_scores_gemma":[0.0063456106,0.00031940147,0.00041208667,0.0009390456,0.0013661413,0.0029566681,0.0020580373,0.0014439223,0.0043225223],"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.0014502516,0.00022436747,0.0022354198,0.00024937125,0.000056161934,0.0004225531,0.00094285107,0.0457181,0.0187711,0.51464015,0.016426401,0.3988632],"study_design_scores_gemma":[0.00037474278,0.00028846168,0.0008051876,0.000105211984,0.000042320586,0.0005636263,0.00041263242,0.35966957,0.04507633,0.56148237,0.03107056,0.00010897164],"about_ca_topic_score_codex":0.0008211859,"about_ca_topic_score_gemma":0.0009641539,"teacher_disagreement_score":0.008553626,"about_ca_system_score_codex":0.000750314,"about_ca_system_score_gemma":0.0014464181,"threshold_uncertainty_score":0.0286147},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041701845,0.0043077827,0.04491602,0.0010800705,0.0014803117,0.000044902874,0.00012618929,0.00052691286,0.9433476],"genre_scores_gemma":[0.058759354,0.0077408287,0.015148273,0.00047453633,0.0011616062,0.00005941297,0.00028606647,0.00052970997,0.91584027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959666,0.00008218065,0.000011106807,0.000045703888,0.00022012429,0.00004429595],"domain_scores_gemma":[0.99979204,0.000052928823,0.000012978537,0.00006375697,0.000050870723,0.000027423492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038833867,0.0010127656,0.00048224995,0.0011013319,0.001133244,0.0023766083,0.00053308276,0.00070272805,0.04275233],"category_scores_gemma":[0.0011951239,0.000420653,0.00033788665,0.0013389426,0.0011669147,0.0036204606,0.0020838769,0.0026068387,0.029018695],"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.000025476977,0.00003264141,0.0000438676,0.00011347905,0.0000034749369,0.000059170197,0.00020329024,0.0008334561,0.0018157088,0.84760886,0.06296527,0.08629529],"study_design_scores_gemma":[0.00000745237,0.000027558723,0.00009852644,0.00010365638,0.0000041975227,0.00027804048,0.000060353694,0.0011141906,0.002173423,0.36259755,0.63352287,0.000012127231],"about_ca_topic_score_codex":0.0001953401,"about_ca_topic_score_gemma":0.00028492406,"teacher_disagreement_score":0.04275233,"about_ca_system_score_codex":0.0008224016,"about_ca_system_score_gemma":0.00049383484,"threshold_uncertainty_score":0.14302075},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08910397,0.0003201862,0.8766137,0.00052457,0.00025094603,0.00018251908,0.00023519943,0.01283712,0.019931844],"genre_scores_gemma":[0.33473733,0.00019446733,0.6565274,0.0001118481,0.000043382013,0.00019794745,0.0004883177,0.0008300157,0.0068694106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991013,0.00022305943,0.000070654576,0.000129594,0.0003615457,0.00011381368],"domain_scores_gemma":[0.99862766,0.00031892935,0.00009640577,0.000431232,0.00043237951,0.000093368864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010613222,0.00094136933,0.00075021567,0.0007657446,0.0010129942,0.0016941653,0.0014946857,0.00063285726,0.0064962017],"category_scores_gemma":[0.0030183468,0.00039121837,0.0006942195,0.0011646771,0.0010572632,0.0015265136,0.0011018378,0.0013570291,0.0016125444],"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.0014230104,0.00039601058,0.0066022663,0.00067447947,0.00025724652,0.0011292002,0.0023887937,0.25361758,0.06531744,0.16714357,0.04660108,0.4544493],"study_design_scores_gemma":[0.00028187127,0.000235824,0.0008042572,0.00005494444,0.000035106335,0.00021691089,0.00022685635,0.86825174,0.04275337,0.037671506,0.04940248,0.000065113985],"about_ca_topic_score_codex":0.005959504,"about_ca_topic_score_gemma":0.006195488,"teacher_disagreement_score":0.0064962017,"about_ca_system_score_codex":0.0012562046,"about_ca_system_score_gemma":0.0016720075,"threshold_uncertainty_score":0.021731913},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28361806,0.0013017869,0.6874757,0.0004221862,0.0002735669,0.0001885091,0.000337293,0.0025790958,0.023803828],"genre_scores_gemma":[0.71772957,0.00061115634,0.27108824,0.00007771474,0.0001386175,0.00010099729,0.00085270166,0.0002438355,0.009157117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993774,0.00011917257,0.00004296227,0.00011471518,0.00022238394,0.00012332368],"domain_scores_gemma":[0.9994072,0.0001535469,0.000066106055,0.00021476796,0.00009488916,0.000063571744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007316261,0.0008195927,0.0009323442,0.0016517075,0.00101167,0.0012771495,0.00062197674,0.0005738553,0.007862797],"category_scores_gemma":[0.0025301485,0.00033842164,0.0009899772,0.00109343,0.0007494746,0.0038602343,0.0025310162,0.0011471632,0.001904594],"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.0009511564,0.00017708336,0.0070391223,0.0005137844,0.00013906247,0.00071286986,0.0017917426,0.03411703,0.038473044,0.46242964,0.0118054515,0.4418499],"study_design_scores_gemma":[0.00018804238,0.0005797432,0.00352085,0.000112248286,0.00008695683,0.001962272,0.0005911452,0.32013533,0.07431462,0.5528716,0.045488067,0.0001491855],"about_ca_topic_score_codex":0.00032628083,"about_ca_topic_score_gemma":0.0005701774,"teacher_disagreement_score":0.007862797,"about_ca_system_score_codex":0.0006142653,"about_ca_system_score_gemma":0.0008429941,"threshold_uncertainty_score":0.026303709},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78756386,0.0024792808,0.14499442,0.00090908876,0.0002687888,0.00023010992,0.00034540723,0.0014088146,0.06180027],"genre_scores_gemma":[0.8512429,0.0012565455,0.13123631,0.000101178426,0.00009687227,0.00009092855,0.0005676123,0.0002602518,0.015147398],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99927133,0.00021078669,0.00002318679,0.00009365519,0.0003172919,0.00008370477],"domain_scores_gemma":[0.99896085,0.0005354563,0.00005616684,0.00024672176,0.00013617112,0.000064631975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084009604,0.00066728616,0.0009716483,0.0006593884,0.00088369485,0.0013825005,0.0007781727,0.0008343995,0.006390355],"category_scores_gemma":[0.0027065638,0.00022843284,0.00029180318,0.001156387,0.0008070359,0.003421852,0.0010424163,0.0015962388,0.0011184488],"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.0024381555,0.0040711523,0.0034897646,0.00085623184,0.00017342846,0.0002454753,0.000852045,0.053856336,0.15268913,0.26164886,0.014509526,0.5051699],"study_design_scores_gemma":[0.00071389717,0.0035005359,0.0040100464,0.00012940273,0.00008704557,0.0009932468,0.00085480855,0.57920474,0.25265852,0.1292532,0.028457256,0.00013731474],"about_ca_topic_score_codex":0.00049602933,"about_ca_topic_score_gemma":0.00046721447,"teacher_disagreement_score":0.006390355,"about_ca_system_score_codex":0.00039599775,"about_ca_system_score_gemma":0.0007333345,"threshold_uncertainty_score":0.021377921},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46604642,0.0014253411,0.4646789,0.00043793488,0.00030685094,0.0001416724,0.00029979047,0.0076913936,0.058971725],"genre_scores_gemma":[0.9102914,0.0001865635,0.07936944,0.000078527104,0.000039782015,0.00005312538,0.00020631524,0.00010886077,0.009665957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995797,0.0000932363,0.000028312075,0.000065218046,0.00014185769,0.000091615366],"domain_scores_gemma":[0.99965596,0.00007115958,0.000052180952,0.00009768313,0.000103607395,0.000019501424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023749711,0.00047557478,0.00025982774,0.00058411213,0.00035172654,0.0005210052,0.00060306414,0.00031832137,0.00962804],"category_scores_gemma":[0.00080246775,0.00016383796,0.00019802326,0.0005956849,0.00025150814,0.000888055,0.00068642746,0.00038616813,0.0021638544],"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.0017505189,0.00015979199,0.0018707402,0.0004517328,0.000052877953,0.0006918611,0.00025868177,0.022161102,0.32988754,0.06484356,0.012064595,0.56580704],"study_design_scores_gemma":[0.0002777586,0.0018637582,0.0039760247,0.00026421438,0.000093507944,0.0020547514,0.00018381218,0.2899775,0.48495382,0.059421714,0.15679346,0.00013967392],"about_ca_topic_score_codex":0.0003812074,"about_ca_topic_score_gemma":0.00044577263,"teacher_disagreement_score":0.00962804,"about_ca_system_score_codex":0.00037476668,"about_ca_system_score_gemma":0.00031445385,"threshold_uncertainty_score":0.03220898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7941567,0.0014776284,0.13938616,0.000865093,0.00055590493,0.00025845104,0.0006533363,0.010094974,0.052551802],"genre_scores_gemma":[0.92054355,0.00024399614,0.06603378,0.00013555793,0.00006811096,0.00012261631,0.0006676784,0.0002556131,0.011929071],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99967396,0.000049394836,0.0000213427,0.00007386303,0.00010065299,0.00008072622],"domain_scores_gemma":[0.999647,0.00008818681,0.000023563367,0.0000860662,0.00012350797,0.00003163096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002507606,0.00079264556,0.0004442961,0.00054507167,0.00051779783,0.00078569993,0.00083042367,0.00028819812,0.011252149],"category_scores_gemma":[0.0009688631,0.00023993793,0.00027883425,0.00090621464,0.00028418854,0.00088425993,0.00043821684,0.0004094,0.0012807217],"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.0042698462,0.0008149323,0.0045753517,0.0005960933,0.00018684815,0.0009539398,0.0004414594,0.19782035,0.26175782,0.029980479,0.046686836,0.45191613],"study_design_scores_gemma":[0.00057360926,0.0008297341,0.0026440788,0.000036203397,0.000071434864,0.0002139612,0.00022770277,0.8017123,0.16192889,0.012607784,0.019111184,0.00004324694],"about_ca_topic_score_codex":0.0035655233,"about_ca_topic_score_gemma":0.0069432626,"teacher_disagreement_score":0.011252149,"about_ca_system_score_codex":0.0010484838,"about_ca_system_score_gemma":0.0012550958,"threshold_uncertainty_score":0.03764212},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18858688,0.0006618395,0.80245394,0.00017622822,0.00012503569,0.00011340925,0.00008122753,0.0019153188,0.005886053],"genre_scores_gemma":[0.5419406,0.0002657903,0.45476115,0.000071088514,0.000098533186,0.000117149495,0.00016570812,0.00016847727,0.002411438],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998718,0.00040549575,0.0001082286,0.00014659076,0.00048324486,0.00013845845],"domain_scores_gemma":[0.9964896,0.0013387322,0.0004175929,0.0007844457,0.00083595596,0.00013368065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020676886,0.0010521399,0.0006128647,0.0014356176,0.00046343534,0.0014014195,0.00133083,0.0007107612,0.0053549516],"category_scores_gemma":[0.008339232,0.00019026214,0.0004559848,0.0014791221,0.00082044123,0.0022581858,0.0011305899,0.0008031153,0.0012463542],"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.002521629,0.00036180168,0.006852044,0.00043586505,0.00018930016,0.00036909524,0.0003169831,0.15778375,0.08973869,0.17636815,0.0047340035,0.56032866],"study_design_scores_gemma":[0.00031731257,0.00062332687,0.0014677409,0.000097854376,0.000056377154,0.0004203243,0.00010086552,0.83536464,0.10804012,0.04796203,0.0055058682,0.00004358999],"about_ca_topic_score_codex":0.00037558464,"about_ca_topic_score_gemma":0.0005793303,"teacher_disagreement_score":0.0053549516,"about_ca_system_score_codex":0.0011896136,"about_ca_system_score_gemma":0.00095519715,"threshold_uncertainty_score":0.017914057},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8980332,0.00015101109,0.089783594,0.00056207576,0.000042709424,0.000063993306,0.000046776102,0.00014378062,0.011172872],"genre_scores_gemma":[0.9946449,0.00004170797,0.0043066577,0.000014504623,0.000012533517,0.000009992858,0.000022722861,0.0000043321907,0.00094258314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987929,0.00031054922,0.00003999984,0.00010904215,0.0005182971,0.00022923286],"domain_scores_gemma":[0.9985662,0.0006972547,0.00018274816,0.00027014894,0.00015450436,0.0001292159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009080496,0.00038575308,0.000592771,0.000820909,0.0006604975,0.0009922065,0.0003521721,0.0005627359,0.0012723567],"category_scores_gemma":[0.0027688476,0.00013148639,0.00046433762,0.00045731093,0.0015667224,0.0019094942,0.0015580782,0.0010221739,0.00019199376],"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.0025257778,0.00028115872,0.02188931,0.00016232632,0.00015000823,0.0023217574,0.00078862126,0.25975162,0.048004244,0.59532297,0.003625311,0.06517687],"study_design_scores_gemma":[0.00009955541,0.00038691086,0.00411182,0.000026620906,0.00002888441,0.00092020945,0.00026754593,0.840172,0.025416916,0.12450513,0.004019396,0.00004509235],"about_ca_topic_score_codex":0.00034315404,"about_ca_topic_score_gemma":0.00028255107,"teacher_disagreement_score":0.0012723567,"about_ca_system_score_codex":0.0008058033,"about_ca_system_score_gemma":0.0005692757,"threshold_uncertainty_score":0.00584656},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087482125,0.0005118347,0.8882023,0.00018299614,0.0000941757,0.000099515855,0.00007774288,0.001407192,0.021942247],"genre_scores_gemma":[0.31378666,0.0006096998,0.6740372,0.000085033855,0.00010940242,0.0001061016,0.0003235378,0.0003362152,0.010606157],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939585,0.00008420476,0.00003163852,0.000076693585,0.00034705707,0.00006454971],"domain_scores_gemma":[0.9995198,0.0001953485,0.00003995275,0.000114508635,0.00011132544,0.000019156163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057366665,0.00073146576,0.00070792966,0.0014946309,0.00065658183,0.0014867958,0.0009971543,0.00044317052,0.0048559103],"category_scores_gemma":[0.0019484691,0.00026436005,0.0005986702,0.0011842579,0.0010189173,0.0030676168,0.0012668353,0.001192054,0.0014775876],"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.00028010574,0.00006244094,0.0008964311,0.00024170378,0.00003161333,0.00019648221,0.00042951203,0.05092709,0.02866968,0.39776605,0.0036389225,0.51685995],"study_design_scores_gemma":[0.00010481844,0.00025299954,0.00083136314,0.000119509656,0.000033983775,0.00057370483,0.0002379297,0.56718147,0.0533342,0.3373735,0.039881613,0.00007492522],"about_ca_topic_score_codex":0.0010536044,"about_ca_topic_score_gemma":0.0014600967,"teacher_disagreement_score":0.0048559103,"about_ca_system_score_codex":0.00093760045,"about_ca_system_score_gemma":0.0007596818,"threshold_uncertainty_score":0.01624459},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07204269,0.002017926,0.8630794,0.00092302175,0.0005247494,0.00023857101,0.00089857157,0.0018680891,0.058406916],"genre_scores_gemma":[0.5962248,0.0029461859,0.3733213,0.00061980356,0.00059242034,0.00053355354,0.0021716966,0.0013484498,0.022241795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924004,0.000091443115,0.000082237326,0.0001358935,0.0002914963,0.00015891348],"domain_scores_gemma":[0.9980813,0.0009843786,0.00019418201,0.00031827946,0.00033314104,0.00008864452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011602079,0.0014964417,0.0010759224,0.0019533387,0.0011596052,0.0038759855,0.0023158698,0.001132117,0.0150479],"category_scores_gemma":[0.006498624,0.00056039926,0.0011730856,0.0017244328,0.0016914385,0.0060448744,0.0019426091,0.0025253154,0.0056899553],"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.00027397266,0.00014594404,0.0031190438,0.00081051735,0.00004672871,0.0009340664,0.00077574,0.016157465,0.0104790805,0.8164219,0.014266426,0.13656904],"study_design_scores_gemma":[0.000036356796,0.00012700993,0.0006725845,0.00029065183,0.0000788746,0.0012595004,0.00027352298,0.06589599,0.013791447,0.8986724,0.018814532,0.00008699255],"about_ca_topic_score_codex":0.0005990592,"about_ca_topic_score_gemma":0.001376144,"teacher_disagreement_score":0.0150479,"about_ca_system_score_codex":0.0018256076,"about_ca_system_score_gemma":0.0012088484,"threshold_uncertainty_score":0.050340295},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13332802,0.0011254064,0.8294403,0.00028503156,0.00021402347,0.00014737363,0.00020102499,0.008779055,0.02647982],"genre_scores_gemma":[0.7917116,0.00053413695,0.20056911,0.00012351677,0.00011043794,0.00021949262,0.0005062459,0.0006347154,0.0055907774],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984648,0.00035715464,0.00012307824,0.0001609455,0.0006378037,0.0002562166],"domain_scores_gemma":[0.9982836,0.00042963141,0.0001252276,0.00073960534,0.00037056432,0.000051380168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008380956,0.00080662646,0.00055558054,0.0009754318,0.00051806885,0.0015499671,0.00095293554,0.000579875,0.006796766],"category_scores_gemma":[0.0034892987,0.00041211318,0.0006284303,0.000923262,0.000687548,0.002256301,0.0017415995,0.0010718564,0.0024460743],"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.0012426083,0.00033490628,0.0036838886,0.00078857073,0.00011746308,0.0003891804,0.00078921963,0.06735026,0.0942557,0.30813462,0.011915791,0.51099783],"study_design_scores_gemma":[0.00040466627,0.0013684736,0.0017491039,0.00027512293,0.0001046015,0.00071283506,0.00028136914,0.5295763,0.20877138,0.17160712,0.08502851,0.00012051931],"about_ca_topic_score_codex":0.00054254144,"about_ca_topic_score_gemma":0.0005375358,"teacher_disagreement_score":0.006796766,"about_ca_system_score_codex":0.0005744669,"about_ca_system_score_gemma":0.0011187531,"threshold_uncertainty_score":0.022737503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30241784,0.00025869076,0.6795168,0.00042061482,0.00012815419,0.00023991315,0.00012553652,0.0013242182,0.015568245],"genre_scores_gemma":[0.69229513,0.00013517197,0.3017762,0.000092964816,0.00003682281,0.00013686999,0.00024719146,0.00015283431,0.005126835],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995765,0.00009280627,0.000023419136,0.00006487888,0.00016626186,0.000076127486],"domain_scores_gemma":[0.9989385,0.00049346115,0.0001180353,0.00023972907,0.00016687288,0.000043412616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048782435,0.00040080934,0.00032935734,0.0005028062,0.00059387286,0.0007569531,0.00043489574,0.000558641,0.003765618],"category_scores_gemma":[0.0019694713,0.00011718253,0.00048526752,0.000586771,0.0007812745,0.0006802506,0.00055860425,0.0006780292,0.0007398102],"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.0009188169,0.0003756275,0.0029010775,0.00063755695,0.00008746112,0.0010614854,0.00067632267,0.19012292,0.1384437,0.24819705,0.006647267,0.4099307],"study_design_scores_gemma":[0.00018338459,0.0008239586,0.001382814,0.00009183822,0.000042132182,0.0012531547,0.00023786719,0.64397573,0.2230737,0.10382452,0.025066348,0.000044631564],"about_ca_topic_score_codex":0.0008791387,"about_ca_topic_score_gemma":0.0011614038,"teacher_disagreement_score":0.003765618,"about_ca_system_score_codex":0.00053365517,"about_ca_system_score_gemma":0.0011755286,"threshold_uncertainty_score":0.012597203},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03369462,0.0007895912,0.9529446,0.00043704474,0.00026493837,0.0004400256,0.00013506407,0.0020276387,0.0092666],"genre_scores_gemma":[0.48327848,0.00092146307,0.5034083,0.00024255208,0.00021806454,0.00042719688,0.00054983684,0.00017779206,0.0107763605],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983511,0.00045868178,0.00013126805,0.00036177447,0.0005064433,0.00019080656],"domain_scores_gemma":[0.999153,0.00020692189,0.000096848686,0.00026116672,0.00022900474,0.000053004012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011728286,0.0005345563,0.00066798,0.00095690135,0.0010019161,0.00096485316,0.0011998529,0.00072121667,0.0028237728],"category_scores_gemma":[0.0024650602,0.00028896352,0.0003637702,0.0008830004,0.00092908606,0.002855942,0.00161153,0.0012666133,0.0011362453],"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.0011397745,0.0001648279,0.0019612561,0.00048641115,0.00007043751,0.0010410442,0.0016256967,0.022463772,0.09315118,0.33567104,0.01521838,0.52700615],"study_design_scores_gemma":[0.000928263,0.00093701493,0.0016812102,0.00017830775,0.00019651074,0.003958355,0.00036405734,0.33378854,0.2007841,0.3156174,0.14124434,0.00032197576],"about_ca_topic_score_codex":0.00046380103,"about_ca_topic_score_gemma":0.00038536018,"teacher_disagreement_score":0.0028237728,"about_ca_system_score_codex":0.00058460643,"about_ca_system_score_gemma":0.0011854102,"threshold_uncertainty_score":0.009446442},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021381686,0.00071807724,0.96090615,0.0009627308,0.0005961103,0.0002699385,0.00026127754,0.0028765278,0.012027385],"genre_scores_gemma":[0.09249681,0.0005138832,0.8952421,0.00035554322,0.00029752994,0.00021039821,0.0006481157,0.0002957677,0.009939793],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989121,0.00017882837,0.00012674506,0.00024502337,0.00040202783,0.00013531966],"domain_scores_gemma":[0.9987841,0.0005896021,0.00006030459,0.00026733434,0.0002527339,0.000045896126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009509696,0.0009932299,0.0009714766,0.0017735966,0.0010845353,0.0012158105,0.0013738124,0.0011564465,0.008646679],"category_scores_gemma":[0.0033259857,0.00058460503,0.0008477479,0.0019064749,0.001169014,0.003631617,0.0020459665,0.0023625742,0.003442608],"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.0008828831,0.00018292762,0.0012861417,0.00046311878,0.000073358606,0.000744944,0.00076616433,0.013173184,0.0320562,0.2060447,0.031788453,0.712538],"study_design_scores_gemma":[0.0012329058,0.0010025051,0.0030092667,0.00023725108,0.0002439912,0.004243637,0.0004885759,0.28399423,0.086634345,0.45668045,0.16187033,0.00036245948],"about_ca_topic_score_codex":0.0012470874,"about_ca_topic_score_gemma":0.001214653,"teacher_disagreement_score":0.008646679,"about_ca_system_score_codex":0.0007923866,"about_ca_system_score_gemma":0.0014944394,"threshold_uncertainty_score":0.028925955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030685034,0.0010982025,0.95170635,0.00043398375,0.0004485869,0.0002033973,0.00015516934,0.0028047368,0.012464469],"genre_scores_gemma":[0.12600031,0.00063016824,0.8530248,0.0002196096,0.00016765643,0.00014065312,0.00048380467,0.00014261299,0.019190446],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940264,0.00010356237,0.000061965664,0.00011351833,0.0002627185,0.00005562438],"domain_scores_gemma":[0.9995944,0.000050634844,0.00005339666,0.00010081328,0.00017432516,0.000026517999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047284158,0.00065650174,0.00056765595,0.0011361808,0.0004729128,0.0010376642,0.0010008257,0.00069529976,0.004725982],"category_scores_gemma":[0.0011052653,0.00026999813,0.0004749149,0.0011112754,0.0003843243,0.0019004914,0.0007611368,0.000762088,0.003039489],"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.00052547455,0.00009940473,0.0006060652,0.00024776583,0.000051227078,0.00041986397,0.00024677868,0.017651524,0.120803274,0.071019754,0.009125671,0.77920324],"study_design_scores_gemma":[0.00030126152,0.001161583,0.0011198237,0.00015045863,0.000119174096,0.0042282506,0.00013302997,0.46884003,0.22149554,0.046930555,0.25529674,0.00022363134],"about_ca_topic_score_codex":0.00041173192,"about_ca_topic_score_gemma":0.00042212522,"teacher_disagreement_score":0.004725982,"about_ca_system_score_codex":0.0004736685,"about_ca_system_score_gemma":0.00097132527,"threshold_uncertainty_score":0.015810013},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06448708,0.0029774164,0.89349985,0.00048463812,0.00029754508,0.0002405768,0.00014236587,0.009641449,0.028229011],"genre_scores_gemma":[0.6085065,0.0013668961,0.36680922,0.0002649288,0.00016849843,0.0002154538,0.0004057214,0.0002510758,0.022011776],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99964046,0.00005450579,0.00002701984,0.000058639635,0.00016812197,0.00005124155],"domain_scores_gemma":[0.9998047,0.000032554006,0.00002819212,0.00004034224,0.00008116285,0.000012994366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021837215,0.00044471177,0.0003994647,0.0007982704,0.00047558156,0.00060210703,0.0006158917,0.0004526346,0.0048577543],"category_scores_gemma":[0.0006242531,0.00023277849,0.0003500144,0.0006157027,0.00021190153,0.0009202627,0.0004005555,0.00046612124,0.0014153428],"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.0010488342,0.00014138475,0.0023822288,0.00036525156,0.000095787116,0.00069882773,0.00027480043,0.022310331,0.18363696,0.051455643,0.013652344,0.72393763],"study_design_scores_gemma":[0.00060656475,0.0021441279,0.005890487,0.0002266929,0.00025500797,0.0038340956,0.00013894445,0.4068212,0.37335783,0.022239923,0.18419881,0.0002863716],"about_ca_topic_score_codex":0.000948446,"about_ca_topic_score_gemma":0.0009383802,"teacher_disagreement_score":0.0048577543,"about_ca_system_score_codex":0.00036816453,"about_ca_system_score_gemma":0.00059411826,"threshold_uncertainty_score":0.01625079},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06576034,0.0010656287,0.9197942,0.00018555559,0.00024666757,0.00012590259,0.0000712945,0.0017418215,0.011008519],"genre_scores_gemma":[0.36279696,0.00055695296,0.6271174,0.000090024056,0.000118205346,0.00012554486,0.00018086357,0.00027401338,0.00874008],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994411,0.00012314455,0.000036299534,0.00007721548,0.00026881392,0.00005336587],"domain_scores_gemma":[0.999173,0.00022641037,0.00007209761,0.00033394815,0.00015671895,0.000037864687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065122446,0.0004781591,0.00036207316,0.0007848955,0.00048156022,0.00080527406,0.00060913834,0.00045633697,0.0067182463],"category_scores_gemma":[0.0032309499,0.00015426126,0.00034125033,0.00066056394,0.00045429706,0.0021029005,0.0011245282,0.0008276658,0.0024627703],"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.00066811655,0.0001366905,0.001515905,0.000289704,0.00004342737,0.00024578045,0.0003995575,0.020539425,0.06796241,0.13007465,0.008341339,0.769783],"study_design_scores_gemma":[0.00018863607,0.0010520899,0.0020353997,0.0001862184,0.00007327141,0.001967315,0.00027564925,0.6436734,0.16101022,0.08776278,0.10164801,0.00012702032],"about_ca_topic_score_codex":0.00033941763,"about_ca_topic_score_gemma":0.00041788965,"teacher_disagreement_score":0.0067182463,"about_ca_system_score_codex":0.0002866217,"about_ca_system_score_gemma":0.0005859634,"threshold_uncertainty_score":0.022474766},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054091893,0.00063983555,0.9236107,0.00018292913,0.00011911408,0.000067462934,0.000049838924,0.0032243493,0.01801387],"genre_scores_gemma":[0.48166898,0.0004045833,0.48925862,0.0002953875,0.0001691583,0.00011543704,0.00028063045,0.00055754324,0.027249636],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994789,0.000072775016,0.00001885822,0.00010224354,0.0002549098,0.0000724264],"domain_scores_gemma":[0.99961793,0.00010294623,0.000023095592,0.00015074458,0.00008888224,0.00001631772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022369409,0.00056118047,0.0005929744,0.00089005544,0.0006558913,0.00076349813,0.0010416375,0.0004523053,0.007983375],"category_scores_gemma":[0.0006826105,0.00023194149,0.000571152,0.00061943266,0.00064491096,0.0015020274,0.0010906247,0.00077119656,0.0025205475],"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.0005498164,0.00017560145,0.00088667346,0.00027824237,0.00011654519,0.0004377476,0.00038436466,0.021086745,0.33325568,0.06854962,0.0055869985,0.56869197],"study_design_scores_gemma":[0.00018578403,0.00092032715,0.0024541845,0.00006971966,0.0001688142,0.0030865665,0.00021940346,0.27960366,0.53180736,0.07628682,0.10502606,0.00017127456],"about_ca_topic_score_codex":0.0004144933,"about_ca_topic_score_gemma":0.0009818522,"teacher_disagreement_score":0.007983375,"about_ca_system_score_codex":0.0003180808,"about_ca_system_score_gemma":0.0003498893,"threshold_uncertainty_score":0.026707113},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14413564,0.0013958926,0.8277335,0.0009512713,0.00033477836,0.00012853336,0.0004330966,0.0011101444,0.023777213],"genre_scores_gemma":[0.8492709,0.00084951165,0.13930283,0.00030512796,0.00025238068,0.00022905393,0.0005029875,0.00013460456,0.009152564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977344,0.00070863095,0.0001168117,0.00041140037,0.00079613546,0.00023254698],"domain_scores_gemma":[0.9961957,0.0015737484,0.00040602195,0.0012956429,0.0004082376,0.00012066571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013240543,0.00044483706,0.000624442,0.0013980371,0.0005102351,0.0015609011,0.0010714812,0.00083322753,0.004357133],"category_scores_gemma":[0.012728734,0.00030161222,0.00038475395,0.0014556368,0.0013241601,0.003067958,0.0014710369,0.0011603765,0.0013284107],"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.00031563418,0.000045279154,0.0009310027,0.00014082043,0.000019934943,0.00015534673,0.00012766999,0.044658568,0.008457086,0.87056994,0.0026113559,0.071967445],"study_design_scores_gemma":[0.00009064112,0.00016407917,0.00064242654,0.00011002713,0.000022223028,0.00060605025,0.000053716456,0.4161158,0.016037406,0.55179805,0.014295195,0.00006437871],"about_ca_topic_score_codex":0.00019060932,"about_ca_topic_score_gemma":0.00017194921,"teacher_disagreement_score":0.004357133,"about_ca_system_score_codex":0.0007946865,"about_ca_system_score_gemma":0.0006146514,"threshold_uncertainty_score":0.014576077},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009279252,0.00038461995,0.97595674,0.00018577042,0.00029741513,0.0002375607,0.00010455757,0.0020692993,0.011484745],"genre_scores_gemma":[0.059264865,0.00035360968,0.93025213,0.000114553746,0.00015295092,0.00018726094,0.00034961084,0.00023819377,0.009086798],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996495,0.000061753046,0.00003975094,0.000085121486,0.00012400372,0.00003970919],"domain_scores_gemma":[0.99968374,0.00006720268,0.00003543187,0.0000697461,0.00012365406,0.000020288586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004269158,0.00066734216,0.00039087096,0.00095203484,0.00059142814,0.0005799289,0.00076595944,0.0003896278,0.009171334],"category_scores_gemma":[0.0008327913,0.00024362416,0.00052583014,0.00059428473,0.0004126734,0.0010623205,0.00075304136,0.0006866277,0.0052159973],"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.00016253702,0.00010124206,0.0007101296,0.0003344688,0.000056603643,0.00019845593,0.00019906402,0.005152307,0.057004146,0.07867368,0.012969041,0.84443825],"study_design_scores_gemma":[0.0002633228,0.001195749,0.0024305477,0.00019754759,0.00022580294,0.0054291226,0.00014456088,0.16651374,0.20276478,0.14555681,0.4750711,0.00020690139],"about_ca_topic_score_codex":0.00026234786,"about_ca_topic_score_gemma":0.00048089918,"teacher_disagreement_score":0.009171334,"about_ca_system_score_codex":0.00033085348,"about_ca_system_score_gemma":0.0007091941,"threshold_uncertainty_score":0.030681193},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19983459,0.001569515,0.76263607,0.00023772435,0.0004216906,0.00021149528,0.0004880053,0.0048138886,0.029787019],"genre_scores_gemma":[0.52695876,0.00086406624,0.4521848,0.0001954555,0.00012415025,0.00016422832,0.001202659,0.00019686003,0.018108958],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99987376,0.000014929042,0.000013873578,0.000029555136,0.000049001632,0.000018893345],"domain_scores_gemma":[0.99982184,0.000025508498,0.000022573602,0.00004543103,0.00006776192,0.000016907346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018058298,0.0004818258,0.00028816267,0.0005712013,0.00025180806,0.00063930015,0.000776969,0.00024570918,0.0048891115],"category_scores_gemma":[0.00043318447,0.00019083719,0.00022231606,0.0006493875,0.00022823755,0.0010976504,0.000536992,0.0005245256,0.002470426],"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.00072048896,0.00022423065,0.0016678862,0.0004658608,0.00008225675,0.00050090457,0.00023802032,0.015198414,0.31074733,0.094532296,0.0126234135,0.5629989],"study_design_scores_gemma":[0.00024169275,0.00115821,0.0022066175,0.00011687754,0.00012559943,0.002252614,0.00017526634,0.2837929,0.5528292,0.040512394,0.11646093,0.00012777177],"about_ca_topic_score_codex":0.00031289906,"about_ca_topic_score_gemma":0.0010182186,"teacher_disagreement_score":0.0048891115,"about_ca_system_score_codex":0.00031921818,"about_ca_system_score_gemma":0.00046093093,"threshold_uncertainty_score":0.016355693},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032845564,0.00047915807,0.9604161,0.00023419943,0.000056266323,0.0001430909,0.00011453955,0.0020491334,0.0036621387],"genre_scores_gemma":[0.20033246,0.0002738095,0.79587895,0.000081952174,0.00007400571,0.00015563746,0.00051820045,0.00036730376,0.002317631],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988159,0.00027087415,0.00008851253,0.00024671535,0.00039943407,0.00017857051],"domain_scores_gemma":[0.99736136,0.0012410805,0.00021786238,0.00080482924,0.00026188305,0.00011298845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014108167,0.0011190807,0.0010823951,0.0018234312,0.001100211,0.0019706048,0.00179582,0.0008319708,0.0060359277],"category_scores_gemma":[0.0053171134,0.00045993243,0.0007600634,0.0017990161,0.0013658733,0.004707642,0.0021147823,0.0015641549,0.0018670319],"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.0009895338,0.00029980025,0.003694377,0.0005482918,0.00010706092,0.00021579761,0.00072948623,0.10187011,0.018942038,0.17623484,0.010477673,0.68589085],"study_design_scores_gemma":[0.00036218765,0.00030396695,0.0009607146,0.000064393425,0.00006772318,0.0002954652,0.00037504104,0.61184615,0.018009508,0.35187837,0.015762623,0.00007391753],"about_ca_topic_score_codex":0.00204342,"about_ca_topic_score_gemma":0.0042025554,"teacher_disagreement_score":0.0060359277,"about_ca_system_score_codex":0.0014751604,"about_ca_system_score_gemma":0.0019361445,"threshold_uncertainty_score":0.020192206},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10764627,0.0015845429,0.80454016,0.0008465577,0.00055250205,0.0007241955,0.0014221345,0.032431856,0.05025172],"genre_scores_gemma":[0.7179876,0.00047625616,0.2474865,0.00042761862,0.00010563026,0.0005198109,0.0022718485,0.00094103784,0.029783702],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991398,0.00017067812,0.00007307031,0.0001186563,0.0002790449,0.00021879647],"domain_scores_gemma":[0.99955505,0.00007095385,0.000035428628,0.00022873013,0.00007666594,0.000033235585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007353864,0.0004880076,0.0008681299,0.0006641428,0.0007385158,0.0014691778,0.0015720894,0.0007000807,0.009999579],"category_scores_gemma":[0.0012045446,0.0003776125,0.0004408783,0.0006176617,0.00042835195,0.0023073107,0.0026861415,0.0012418382,0.00315718],"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.0037689523,0.0004913675,0.002409227,0.00090721674,0.00017830347,0.0009834863,0.0006929174,0.014599844,0.118883915,0.20584902,0.07045411,0.58078164],"study_design_scores_gemma":[0.000642166,0.0011480537,0.0032192913,0.00028776852,0.00026826427,0.0017050072,0.00032530856,0.3887522,0.23745349,0.15433763,0.21159403,0.00026691228],"about_ca_topic_score_codex":0.00041789658,"about_ca_topic_score_gemma":0.000654333,"teacher_disagreement_score":0.009999579,"about_ca_system_score_codex":0.0007066948,"about_ca_system_score_gemma":0.0011102326,"threshold_uncertainty_score":0.033451915},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65065795,0.002048414,0.27931687,0.0004332908,0.00034549765,0.00022237975,0.00030588984,0.007498402,0.059171196],"genre_scores_gemma":[0.9331907,0.00040227364,0.05872885,0.000089025954,0.000046351794,0.000052707415,0.0002047272,0.000098157354,0.0071870433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995561,0.000083091,0.000027602004,0.000057078258,0.00017606946,0.000099986864],"domain_scores_gemma":[0.9995826,0.00010214616,0.00004810937,0.00016885392,0.00007984907,0.000018389577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003136589,0.0004921521,0.00037045174,0.000561154,0.00035982084,0.0008674639,0.0007304682,0.00025613923,0.0058083693],"category_scores_gemma":[0.00074510387,0.00017282878,0.00028786392,0.00059302186,0.00039449777,0.0011549444,0.0003537381,0.0003981459,0.0012465584],"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.002469894,0.00035066315,0.0055943727,0.0008109403,0.00014106564,0.0010745273,0.000402417,0.08929309,0.21671604,0.12625788,0.012612182,0.5442769],"study_design_scores_gemma":[0.0005331087,0.0023547432,0.007823202,0.0002079616,0.00016998885,0.0013910779,0.0001538505,0.3682535,0.49261263,0.03392352,0.09243937,0.00013700683],"about_ca_topic_score_codex":0.0010420732,"about_ca_topic_score_gemma":0.0012933988,"teacher_disagreement_score":0.0058083693,"about_ca_system_score_codex":0.0007777361,"about_ca_system_score_gemma":0.00060094206,"threshold_uncertainty_score":0.019430995},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08541963,0.001203103,0.89184475,0.00061285554,0.0003328719,0.00022482571,0.00025801038,0.004909753,0.015194142],"genre_scores_gemma":[0.37872952,0.0006307593,0.6054871,0.00037662685,0.00023077485,0.00022157299,0.00078143197,0.0001194123,0.013422803],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997446,0.00004001207,0.00002064333,0.00006411656,0.00009087866,0.00003974805],"domain_scores_gemma":[0.9998405,0.000016332377,0.00002539947,0.000028397617,0.000075750526,0.000013612975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020111249,0.00041334957,0.00035529785,0.0005336122,0.00048764373,0.0006687106,0.0011790751,0.00038433642,0.0051819636],"category_scores_gemma":[0.00034304938,0.00025996426,0.00033085822,0.00074634794,0.00024889296,0.0011029226,0.00038718185,0.00051087746,0.002653129],"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.00060363766,0.00026587743,0.0021057213,0.0006311822,0.00013074688,0.00053379,0.0002196609,0.023766665,0.44300097,0.03268536,0.020633575,0.47542268],"study_design_scores_gemma":[0.000484658,0.0031753639,0.0038874384,0.00012113215,0.00026786246,0.0024453565,0.00012804114,0.44218627,0.38934588,0.009559141,0.14820985,0.00018906622],"about_ca_topic_score_codex":0.0007756224,"about_ca_topic_score_gemma":0.0017246905,"teacher_disagreement_score":0.0051819636,"about_ca_system_score_codex":0.00053029263,"about_ca_system_score_gemma":0.0009047523,"threshold_uncertainty_score":0.017335415},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2563617,0.0015335333,0.7164209,0.0004599578,0.00044514067,0.0002324974,0.0002012625,0.0018088544,0.02253613],"genre_scores_gemma":[0.7493243,0.000800115,0.23785625,0.00013794277,0.00019181873,0.00009518566,0.00029712898,0.00005394792,0.011243354],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999131,0.000014520168,0.0000062452373,0.00001592821,0.00003416934,0.000015980306],"domain_scores_gemma":[0.99988866,0.000018154044,0.000023077162,0.0000242481,0.000035126042,0.000010581174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019027792,0.0004188955,0.00035678945,0.00059477263,0.00041425196,0.0003259143,0.0004791499,0.00028199187,0.0021324118],"category_scores_gemma":[0.00024746257,0.00016807289,0.00033520884,0.00046028048,0.00021423493,0.00067612925,0.00021193325,0.0004563509,0.0005860036],"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.00083722605,0.00023792635,0.0014219709,0.0004068251,0.000120956414,0.001140255,0.0001727389,0.016755505,0.49815467,0.08967091,0.0055480646,0.385533],"study_design_scores_gemma":[0.00051809667,0.0040182928,0.003834084,0.00015201917,0.00038260242,0.01032771,0.00011235218,0.33949557,0.5142976,0.031867467,0.09481272,0.00018153824],"about_ca_topic_score_codex":0.0001653739,"about_ca_topic_score_gemma":0.00041332952,"teacher_disagreement_score":0.0021324118,"about_ca_system_score_codex":0.00023458317,"about_ca_system_score_gemma":0.00041643414,"threshold_uncertainty_score":0.0071336627},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040785443,0.0006275526,0.9461528,0.00034780017,0.00008164571,0.0001393145,0.00003216805,0.000601649,0.011231641],"genre_scores_gemma":[0.41396078,0.0010511192,0.57017094,0.00023321867,0.00015771548,0.00019161298,0.00007587548,0.00011534584,0.01404337],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998772,0.000018104043,0.0000071326613,0.000019270146,0.00006157567,0.00001662953],"domain_scores_gemma":[0.99983716,0.00005545609,0.00003737169,0.00001967463,0.000043664313,0.0000066345197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018445503,0.00041428255,0.00015324044,0.00048511647,0.00038397202,0.00041502647,0.00057435903,0.00031205034,0.003769629],"category_scores_gemma":[0.00049413036,0.00028836276,0.0002873416,0.0002640681,0.000261916,0.00074475043,0.00031581725,0.0005092686,0.0011172168],"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.0002877063,0.0000625677,0.00066430774,0.00040960274,0.000054241576,0.00042824223,0.0003424594,0.016379345,0.6677406,0.06436071,0.0023526633,0.24691768],"study_design_scores_gemma":[0.0002980084,0.0020022485,0.0021309496,0.00017814236,0.00017071991,0.003207783,0.0001632036,0.19973436,0.624247,0.036036026,0.13173544,0.000096125346],"about_ca_topic_score_codex":0.00019036776,"about_ca_topic_score_gemma":0.00064063683,"teacher_disagreement_score":0.003769629,"about_ca_system_score_codex":0.00040031865,"about_ca_system_score_gemma":0.00034990095,"threshold_uncertainty_score":0.012610674},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11951275,0.0058989124,0.84958243,0.00052997714,0.00014964338,0.00016419146,0.00023142829,0.0031024518,0.020828143],"genre_scores_gemma":[0.6870794,0.0031198654,0.29615948,0.0001466036,0.0001223301,0.00015583356,0.0005480055,0.0003531875,0.012315258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994809,0.00008429581,0.00003579679,0.000051786254,0.00028645832,0.00006092602],"domain_scores_gemma":[0.99962306,0.00008794399,0.000047931928,0.0001463467,0.000081197184,0.000013626963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045022264,0.0005631297,0.00038846696,0.00054992246,0.0002873235,0.00075188687,0.00056099944,0.00034028967,0.0029198132],"category_scores_gemma":[0.0012508241,0.00024953354,0.0002700383,0.0007914112,0.0003641128,0.0016286854,0.00056494336,0.00076253404,0.0013871376],"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.0006215038,0.00017564485,0.0016277275,0.0007474035,0.00009002664,0.00028292596,0.00017769817,0.14755332,0.19364427,0.20247199,0.009148686,0.44345883],"study_design_scores_gemma":[0.0001889091,0.0006635297,0.0016161851,0.00018797442,0.00007495926,0.00059146824,0.000081501006,0.51006514,0.2728475,0.09801337,0.115581974,0.00008740606],"about_ca_topic_score_codex":0.00019652488,"about_ca_topic_score_gemma":0.00023221518,"teacher_disagreement_score":0.0029198132,"about_ca_system_score_codex":0.0005044475,"about_ca_system_score_gemma":0.00070074585,"threshold_uncertainty_score":0.009767771},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055422988,0.000743953,0.92293775,0.0006957705,0.00017857809,0.00013211786,0.00027578406,0.0055737123,0.014039263],"genre_scores_gemma":[0.32799017,0.0005167574,0.65150696,0.0003314878,0.00037299938,0.00019768102,0.0013163242,0.0008601658,0.01690746],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978915,0.00036929696,0.00016554007,0.00038699643,0.0009349274,0.0002517134],"domain_scores_gemma":[0.9970885,0.0010481183,0.0001605974,0.0012907577,0.00030896266,0.000103119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015740816,0.0009827605,0.0011140667,0.0017707743,0.00061943295,0.0023257358,0.0012605829,0.00067530107,0.009104431],"category_scores_gemma":[0.0064820326,0.0004038498,0.0016810418,0.0015335038,0.001222918,0.007176664,0.0026578421,0.002294103,0.0046711667],"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.00085886935,0.0003211416,0.0029827598,0.00036416465,0.00008640335,0.00019324264,0.00048723826,0.041270435,0.012896218,0.2380392,0.013411104,0.6890891],"study_design_scores_gemma":[0.00026925656,0.00032022063,0.0011751086,0.00012892277,0.00007789284,0.0005271612,0.0001646375,0.44157943,0.028092,0.49709192,0.030489499,0.000083929495],"about_ca_topic_score_codex":0.0018758766,"about_ca_topic_score_gemma":0.002358149,"teacher_disagreement_score":0.009104431,"about_ca_system_score_codex":0.001388727,"about_ca_system_score_gemma":0.0017641373,"threshold_uncertainty_score":0.030457377},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0137068825,0.00026564844,0.9752627,0.00015563739,0.00019091142,0.0001071478,0.000078154975,0.0013544029,0.008878584],"genre_scores_gemma":[0.1618027,0.00043581222,0.8246947,0.00015734087,0.00019348456,0.00016277007,0.00043387432,0.00019598966,0.011923338],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926263,0.000067505105,0.00005323852,0.00014054091,0.0003841719,0.00009192188],"domain_scores_gemma":[0.99948525,0.00006964447,0.00004399968,0.00021700384,0.00015290553,0.000031210267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000424159,0.0008644546,0.0007569881,0.0008422542,0.00072346075,0.0012228104,0.0011814642,0.000485166,0.0062440694],"category_scores_gemma":[0.0011608845,0.00034868487,0.0005918062,0.001031338,0.00063736766,0.002063369,0.0019032168,0.0011090545,0.0031950136],"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.00052111864,0.00021781021,0.0008771133,0.00031728807,0.00007936056,0.00033155383,0.00017357794,0.040247656,0.09229684,0.12777333,0.011550739,0.7256137],"study_design_scores_gemma":[0.00022061875,0.000552431,0.0006981337,0.000056402416,0.00010070508,0.0020177506,0.000091010006,0.571438,0.1880019,0.14325832,0.09347919,0.00008557112],"about_ca_topic_score_codex":0.0004625884,"about_ca_topic_score_gemma":0.0009620352,"teacher_disagreement_score":0.0062440694,"about_ca_system_score_codex":0.0005265079,"about_ca_system_score_gemma":0.0009852209,"threshold_uncertainty_score":0.020888448},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2976191,0.0008671548,0.56250536,0.00093622395,0.00050290365,0.00019614666,0.00045193546,0.0015614987,0.13535964],"genre_scores_gemma":[0.7656752,0.0004790469,0.18338244,0.0002890067,0.0002634125,0.0001629289,0.0005596627,0.0002228013,0.0489655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977857,0.00004738209,0.0000151608165,0.000039225284,0.00007129071,0.00004841967],"domain_scores_gemma":[0.9997917,0.00006228976,0.000035384466,0.000047830552,0.000042123447,0.00002077485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033019585,0.0006113814,0.00035386323,0.0007286012,0.00063188514,0.0009750187,0.00041263012,0.00042324656,0.012378862],"category_scores_gemma":[0.00081667036,0.0001411784,0.00050828,0.0005317164,0.000502655,0.0009392858,0.0005655505,0.00068497506,0.0022377232],"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.00079275947,0.0002035396,0.00089876144,0.00027693636,0.000045446028,0.000999396,0.00030910148,0.016609209,0.048844833,0.730393,0.013063066,0.187564],"study_design_scores_gemma":[0.00030803285,0.0012514528,0.0015399066,0.00016859166,0.000111186746,0.0028143045,0.00022973311,0.19134803,0.10369136,0.60746396,0.09093078,0.00014270711],"about_ca_topic_score_codex":0.00035702664,"about_ca_topic_score_gemma":0.0006157436,"teacher_disagreement_score":0.012378862,"about_ca_system_score_codex":0.0005900065,"about_ca_system_score_gemma":0.000592079,"threshold_uncertainty_score":0.04141146},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031390697,0.0027166177,0.94724965,0.00038139694,0.00039338632,0.00008873196,0.00006327088,0.0007255202,0.016990708],"genre_scores_gemma":[0.44952542,0.0035985985,0.5330592,0.00026253093,0.0006029746,0.000098198965,0.00021866731,0.00008530893,0.012549071],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995664,0.00012448773,0.00003358905,0.00006551702,0.00018559287,0.000024335086],"domain_scores_gemma":[0.99940574,0.00020006581,0.00005870744,0.00014907384,0.00016673503,0.000019588106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063606084,0.0005022022,0.00043245626,0.00068689836,0.0002500854,0.0011326467,0.00045083484,0.0005262779,0.0045786365],"category_scores_gemma":[0.0018562619,0.00016470997,0.00023510779,0.0009175311,0.0006737226,0.0013020241,0.00052823336,0.0007265498,0.0018673383],"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.00042818888,0.000080240294,0.000505875,0.0005038756,0.000054133485,0.0004323818,0.00022771365,0.034974355,0.11664197,0.3719597,0.004479857,0.46971172],"study_design_scores_gemma":[0.0002097783,0.0012122046,0.0013222246,0.00022259663,0.00008399991,0.0022872002,0.000104342966,0.52580404,0.13190736,0.1732605,0.16342711,0.00015861362],"about_ca_topic_score_codex":0.00021858838,"about_ca_topic_score_gemma":0.00028507892,"teacher_disagreement_score":0.0045786365,"about_ca_system_score_codex":0.0003534841,"about_ca_system_score_gemma":0.00034070938,"threshold_uncertainty_score":0.015317082},"labels":[],"label_agreement":null},{"id":"W2594864105","doi":"10.1007/s13389-017-0154-9","title":"Montgomery reduction within the context of residue number system arithmetic","year":2017,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Residue number system; Arithmetic; Computer science; Reduction (mathematics); Cryptography; Implementation; Context (archaeology); Parallel computing; Theoretical computer science; Mathematics; Algorithm; Programming language; History","score_opus":0.00809598719957067,"score_gpt":0.21958840218044023,"score_spread":0.21149241498086957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594864105","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26086086,0.0064691645,0.34833872,0.008615354,0.0022584447,0.00009627612,0.00017291663,0.0005301783,0.372658],"genre_scores_gemma":[0.92065024,0.0020261528,0.04066747,0.00072951935,0.0014968808,0.000044168217,0.00008770706,0.00018610575,0.034111798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993197,0.00023172161,0.000025980647,0.00007589788,0.00022196046,0.00012479848],"domain_scores_gemma":[0.9995369,0.0002327004,0.000033628377,0.00007677188,0.00008226764,0.00003790298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068165327,0.0005652665,0.0007502961,0.0014875656,0.0015468784,0.0021811635,0.0008124696,0.0010436992,0.004747132],"category_scores_gemma":[0.002168185,0.00024201146,0.0007012309,0.0010579217,0.0038212168,0.0034695263,0.0020374795,0.0028735867,0.0010751756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002098468,0.0000119132765,0.000049241185,0.00001954136,0.000003914919,0.00009470095,0.00014144203,0.0009967528,0.00062940153,0.9928268,0.0007760299,0.00442933],"study_design_scores_gemma":[0.00000999503,0.000016279066,0.000055198932,0.000008808335,0.0000046223004,0.00009538739,0.000038170623,0.004326652,0.00075016543,0.9902956,0.0043890984,0.000010063464],"about_ca_topic_score_codex":0.000763921,"about_ca_topic_score_gemma":0.0007349401,"teacher_disagreement_score":0.004747132,"about_ca_system_score_codex":0.0009703642,"about_ca_system_score_gemma":0.00073441153,"threshold_uncertainty_score":0.015880704},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018437823,0.00024019639,0.9662002,0.00011907369,0.00020485786,0.00011343771,0.00008318146,0.0030385903,0.011562714],"genre_scores_gemma":[0.23414147,0.0003117283,0.75365895,0.00017378123,0.00017187672,0.00021396809,0.0004481086,0.0009744651,0.009905539],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809176,0.00032212678,0.00016379451,0.00040911994,0.0007650062,0.00024808533],"domain_scores_gemma":[0.9986265,0.00047239903,0.00008432879,0.00053053367,0.0002394262,0.000046970345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011394547,0.0010432866,0.00072946545,0.0016849394,0.0009249098,0.0027207616,0.0013863351,0.00054108375,0.013104993],"category_scores_gemma":[0.0038505176,0.000566792,0.0012417407,0.0016238999,0.0013580214,0.004267803,0.0031222368,0.0019551793,0.005267089],"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.00038861218,0.00018886113,0.00069211354,0.00026081307,0.000070667615,0.0005317325,0.00056521257,0.014558634,0.03043263,0.37230945,0.009344152,0.5706571],"study_design_scores_gemma":[0.00015735142,0.00046837155,0.0004941251,0.00013683032,0.00008975015,0.0014851495,0.0002906218,0.11600263,0.13142726,0.6617876,0.08748802,0.00017232644],"about_ca_topic_score_codex":0.00043725583,"about_ca_topic_score_gemma":0.00047757107,"teacher_disagreement_score":0.013104993,"about_ca_system_score_codex":0.00051338656,"about_ca_system_score_gemma":0.0008398996,"threshold_uncertainty_score":0.043840587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3765179,0.0014037837,0.47003815,0.0021081532,0.0012652115,0.00040395863,0.0009200946,0.002395143,0.1449477],"genre_scores_gemma":[0.8953104,0.00061628415,0.071322136,0.00028761645,0.00032566488,0.000106661646,0.00038688042,0.0002234033,0.03142097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927634,0.00013877822,0.00005347128,0.0001365075,0.00026408845,0.0001307769],"domain_scores_gemma":[0.9993363,0.000111802765,0.00006440321,0.00030615838,0.00011665364,0.000064626554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055981765,0.00054469716,0.00086759205,0.0006103506,0.0011714592,0.002106101,0.00071615115,0.0008452644,0.006426753],"category_scores_gemma":[0.0010233632,0.00026961433,0.0005709311,0.0009179324,0.0020436242,0.0031044893,0.0018058677,0.0018170617,0.002470521],"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.00022882679,0.00005110322,0.00013949627,0.00007877226,0.000010578481,0.00011853039,0.00017386107,0.0019607274,0.01073134,0.9555884,0.0022550968,0.028663125],"study_design_scores_gemma":[0.00014820605,0.00035246924,0.00050184963,0.000049691793,0.00005545,0.0007075365,0.00009798027,0.03334872,0.030477071,0.8872201,0.046936788,0.00010414004],"about_ca_topic_score_codex":0.00025303545,"about_ca_topic_score_gemma":0.00021604601,"teacher_disagreement_score":0.006426753,"about_ca_system_score_codex":0.00090551516,"about_ca_system_score_gemma":0.0010829922,"threshold_uncertainty_score":0.021499634},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086848915,0.001237709,0.88816327,0.00021920574,0.00023564286,0.00022363344,0.00029032122,0.0029673814,0.01981389],"genre_scores_gemma":[0.43069163,0.0005942933,0.555588,0.00030548248,0.00015202006,0.00024705468,0.0010524505,0.00009238333,0.011276627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978036,0.000035694316,0.000019965135,0.00004189534,0.00009607706,0.000026016483],"domain_scores_gemma":[0.9997876,0.000026500622,0.00003627038,0.000046708512,0.000089734276,0.0000132053965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016688081,0.00046974534,0.0003022694,0.0005785313,0.00029257176,0.00040646747,0.0010438468,0.00024735453,0.003925267],"category_scores_gemma":[0.00035796146,0.0001902618,0.00036151646,0.00085899845,0.00018047453,0.00074528926,0.0003493032,0.00038556263,0.0013607136],"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.0005644681,0.00017673441,0.001641613,0.00060823327,0.00015635151,0.0005602207,0.0001743881,0.037498526,0.31381685,0.050679848,0.014326951,0.5797959],"study_design_scores_gemma":[0.0004047143,0.0032444866,0.003618822,0.00014189375,0.00034287683,0.0032917194,0.00015228525,0.53935856,0.3110017,0.016779386,0.121536866,0.00012670942],"about_ca_topic_score_codex":0.0005533976,"about_ca_topic_score_gemma":0.0018043383,"teacher_disagreement_score":0.003925267,"about_ca_system_score_codex":0.0003794301,"about_ca_system_score_gemma":0.0007345508,"threshold_uncertainty_score":0.0131313205},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092131376,0.00045435852,0.89401567,0.0003026126,0.000107224776,0.00023809874,0.00010400147,0.0015554175,0.011091238],"genre_scores_gemma":[0.6756056,0.000379783,0.31527433,0.00015647967,0.00013390071,0.00036560345,0.00022468332,0.00026254266,0.007597033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986733,0.0005774265,0.000100211335,0.0001781139,0.00028653792,0.00018437946],"domain_scores_gemma":[0.9977354,0.0013337531,0.00029722627,0.00042712668,0.000148619,0.00005786918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016488777,0.00055515603,0.00057011977,0.00085512624,0.00039682136,0.000978902,0.00094325695,0.00048732097,0.0050173323],"category_scores_gemma":[0.005662372,0.00031758842,0.0005198712,0.00062385225,0.0010965462,0.003543128,0.0009455983,0.00073492015,0.0017865816],"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.00057742425,0.0001160789,0.0013570437,0.00018149943,0.000037831283,0.00045935676,0.00046154467,0.043387976,0.02935065,0.7651371,0.0021864239,0.15674709],"study_design_scores_gemma":[0.00045325875,0.0010568646,0.00075304357,0.00020260249,0.0000756649,0.0014982631,0.00015011357,0.35357732,0.10482794,0.4940317,0.04317001,0.00020327349],"about_ca_topic_score_codex":0.00015215181,"about_ca_topic_score_gemma":0.0002722265,"teacher_disagreement_score":0.0050173323,"about_ca_system_score_codex":0.00053741876,"about_ca_system_score_gemma":0.00039223934,"threshold_uncertainty_score":0.016784668},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12384842,0.0005753051,0.85713315,0.00032241188,0.000223603,0.0000695021,0.00020863807,0.002830339,0.014788591],"genre_scores_gemma":[0.65513295,0.00040407453,0.3353512,0.00015623467,0.00009813703,0.00005883049,0.0004080695,0.00038255475,0.008007928],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993594,0.0001002471,0.000050523206,0.00012592813,0.00025192605,0.00011187404],"domain_scores_gemma":[0.99931467,0.00011245628,0.00005773261,0.00034400547,0.00012920945,0.000041822103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034898968,0.00043652244,0.0003949531,0.00046380126,0.00041470828,0.0013433985,0.0008849849,0.0003677992,0.003841352],"category_scores_gemma":[0.0027036862,0.00021394955,0.00036273513,0.0013263198,0.00075356464,0.0023635994,0.0011527862,0.0008552505,0.0010745268],"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.00095662725,0.00013880966,0.004379156,0.00029367194,0.00007424031,0.00071856164,0.0004073292,0.16046037,0.06705359,0.36109334,0.0127771525,0.39164722],"study_design_scores_gemma":[0.00008768391,0.0002837696,0.0018664995,0.00004265441,0.000037872152,0.0006308054,0.00013955373,0.7424349,0.059559297,0.16138525,0.033479568,0.00005211739],"about_ca_topic_score_codex":0.0011809877,"about_ca_topic_score_gemma":0.00272276,"teacher_disagreement_score":0.003841352,"about_ca_system_score_codex":0.00057374925,"about_ca_system_score_gemma":0.00081556104,"threshold_uncertainty_score":0.012850583},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1595961,0.00060415285,0.81342995,0.00020006431,0.00023566683,0.00015492094,0.000102448634,0.0023153503,0.023361275],"genre_scores_gemma":[0.59807765,0.00043275207,0.39121592,0.00017953443,0.00009063566,0.000082910454,0.00028286217,0.000066520995,0.009571204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981886,0.000019244815,0.000018432274,0.000041325988,0.00007208501,0.00002999945],"domain_scores_gemma":[0.99986696,0.000015881411,0.000012716329,0.000028673585,0.000064564,0.0000111113995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016324305,0.00031989667,0.00031736746,0.0005802864,0.00037409525,0.00076419045,0.00079997495,0.00029027293,0.0026326505],"category_scores_gemma":[0.0002812752,0.00019632748,0.0003565365,0.00072623347,0.00028860013,0.0010717594,0.00043528667,0.00040096926,0.0008048855],"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.00044607426,0.0002151529,0.0021274032,0.0002717252,0.00008233976,0.0004342225,0.00028311947,0.015944177,0.32405317,0.06961289,0.0034212992,0.5831085],"study_design_scores_gemma":[0.00030786908,0.0032038717,0.0026947341,0.000094210045,0.0002920486,0.0029903394,0.00023048524,0.4595155,0.40648666,0.04111022,0.08293096,0.00014313351],"about_ca_topic_score_codex":0.00089123886,"about_ca_topic_score_gemma":0.001984964,"teacher_disagreement_score":0.0026326505,"about_ca_system_score_codex":0.000326419,"about_ca_system_score_gemma":0.00071592425,"threshold_uncertainty_score":0.008807063},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22523367,0.005228207,0.3319156,0.009628303,0.0019124853,0.00011305298,0.00091525115,0.003244531,0.4218089],"genre_scores_gemma":[0.7797315,0.0026189538,0.078559555,0.0008224165,0.00086595886,0.000066505185,0.0011168342,0.0013235493,0.13489477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993013,0.000107334374,0.000026665657,0.00015224972,0.00029108554,0.00012126095],"domain_scores_gemma":[0.9994054,0.0002478196,0.000031149255,0.00014519227,0.000102494625,0.00006808076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073699123,0.0013241764,0.0010930304,0.0012903085,0.0014067836,0.004555655,0.0009998484,0.0007559727,0.0121782785],"category_scores_gemma":[0.0024588702,0.00059161504,0.0006069986,0.00169118,0.0030366352,0.0065605254,0.0024306967,0.0033241701,0.0062621646],"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.00016214993,0.000037027447,0.00038089958,0.00015587428,0.000016070167,0.00007380492,0.00039967874,0.0039299927,0.0021769803,0.9196111,0.015688444,0.05736793],"study_design_scores_gemma":[0.000012735525,0.000021195947,0.00015646635,0.000041930052,0.000012075106,0.0000898575,0.00009561551,0.0051428974,0.0027810696,0.9704515,0.021178808,0.000015830674],"about_ca_topic_score_codex":0.0006380706,"about_ca_topic_score_gemma":0.0006933365,"teacher_disagreement_score":0.0121782785,"about_ca_system_score_codex":0.0016404446,"about_ca_system_score_gemma":0.0008623699,"threshold_uncertainty_score":0.04074037},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10238295,0.030435061,0.06752264,0.0053683394,0.0037341674,0.000107064836,0.00042423038,0.0012296011,0.7887958],"genre_scores_gemma":[0.617259,0.01611485,0.019863179,0.001122965,0.0028482063,0.00011550383,0.00041391567,0.00069540506,0.34156695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997383,0.00005394962,0.00000981296,0.000040960906,0.00011317469,0.00004376271],"domain_scores_gemma":[0.999742,0.000102284495,0.000023963936,0.00005675513,0.000035383855,0.00003968303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033846698,0.0011295403,0.0007526496,0.0022260244,0.0016525893,0.0018386468,0.000688737,0.00086372596,0.013800763],"category_scores_gemma":[0.0009978699,0.00043085354,0.00037950702,0.0015146472,0.0027940155,0.0034206032,0.0016827921,0.0029469542,0.0054049236],"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.000027461452,0.000028609771,0.0000972027,0.00019527583,0.0000040901773,0.00008829254,0.0006227291,0.00048635306,0.0013549414,0.9421983,0.0123239765,0.04257284],"study_design_scores_gemma":[0.00001160958,0.00003339724,0.0003153905,0.000087917695,0.0000095372025,0.0003916237,0.000091847614,0.00083286525,0.00087326363,0.9182311,0.07910229,0.000019010453],"about_ca_topic_score_codex":0.00031407544,"about_ca_topic_score_gemma":0.0004440814,"teacher_disagreement_score":0.013800763,"about_ca_system_score_codex":0.0011089547,"about_ca_system_score_gemma":0.00055000605,"threshold_uncertainty_score":0.04616815},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19715956,0.0014978341,0.75799125,0.00043914828,0.0006519645,0.00030584546,0.0006129323,0.0062440205,0.035097532],"genre_scores_gemma":[0.64216137,0.000508878,0.33280733,0.00027837793,0.00010731617,0.0001055717,0.00061985955,0.00009195167,0.023319349],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999089,0.00001364142,0.0000075407024,0.000022258464,0.000030183011,0.000017548633],"domain_scores_gemma":[0.9999132,0.000010148939,0.000017234022,0.000017222175,0.000033112603,0.000008950858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011501812,0.00038842714,0.00029690503,0.0003505056,0.0002986185,0.0004179942,0.0005975623,0.00034377768,0.005081324],"category_scores_gemma":[0.00021604642,0.00016949218,0.00024127812,0.00043952043,0.00011385728,0.00057260797,0.00022380716,0.00034492914,0.0017201474],"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.000616192,0.00015700379,0.0008940071,0.0005193223,0.00010336643,0.0009271032,0.00014757697,0.010644245,0.53592473,0.034531023,0.010618139,0.40491727],"study_design_scores_gemma":[0.00022913236,0.0033656324,0.003950088,0.00015547907,0.0002540006,0.0060805995,0.00009948686,0.21949185,0.6349938,0.008777148,0.12245936,0.00014350885],"about_ca_topic_score_codex":0.00039424287,"about_ca_topic_score_gemma":0.0012076033,"teacher_disagreement_score":0.005081324,"about_ca_system_score_codex":0.00025747562,"about_ca_system_score_gemma":0.0004986136,"threshold_uncertainty_score":0.016998708},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096572384,0.0033138834,0.522794,0.005775466,0.0015340671,0.0001826229,0.00077545806,0.0013974336,0.36765477],"genre_scores_gemma":[0.69949687,0.0028649718,0.16958502,0.0018386239,0.0020681522,0.00022420553,0.0018929067,0.0013860599,0.120643094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985183,0.00041191015,0.000062077255,0.00020960589,0.0006159226,0.00018214714],"domain_scores_gemma":[0.99882466,0.00044771633,0.000055362067,0.00025864382,0.00032312443,0.00009046133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011548679,0.0007157353,0.0009998197,0.0018407106,0.0014155275,0.00336027,0.001080868,0.0009074771,0.012674433],"category_scores_gemma":[0.002872035,0.00044670375,0.0012618538,0.0011625156,0.0026141666,0.0050009154,0.0029932628,0.0047783507,0.005269793],"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.00009156539,0.000039786464,0.0001194633,0.00006982302,0.000013471561,0.000055771707,0.00015356341,0.0009947845,0.0014922855,0.9716997,0.005189995,0.02007992],"study_design_scores_gemma":[0.00003858135,0.000028894387,0.00011238745,0.000020712549,0.0000144312,0.00016248855,0.00004680661,0.0036202406,0.003010474,0.97214204,0.020787748,0.000015203767],"about_ca_topic_score_codex":0.00045288663,"about_ca_topic_score_gemma":0.0004893046,"teacher_disagreement_score":0.012674433,"about_ca_system_score_codex":0.0010145527,"about_ca_system_score_gemma":0.00093803334,"threshold_uncertainty_score":0.04240018},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1945813,0.0018883783,0.75408894,0.00087247876,0.0006530138,0.00021737743,0.00030386343,0.008439009,0.038955726],"genre_scores_gemma":[0.62050426,0.0005945338,0.34911093,0.00032713005,0.00034958738,0.00013877038,0.0004967852,0.00050849246,0.027969506],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993856,0.00011001043,0.000029477385,0.0000867331,0.00026116974,0.00012711693],"domain_scores_gemma":[0.9995055,0.00019473264,0.00003732528,0.00014941864,0.00008402186,0.000029021263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050782267,0.0011999118,0.0008446677,0.0009516266,0.0006589056,0.0012991892,0.0005997516,0.0005092179,0.0128231095],"category_scores_gemma":[0.0017156777,0.0002791955,0.00075021497,0.0011286691,0.0006548598,0.0014563466,0.0014375342,0.00088885496,0.0047106054],"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.0012227824,0.00018447402,0.0011391228,0.00038337955,0.00010704431,0.00089132733,0.00043703933,0.01405601,0.08774634,0.060060658,0.01718483,0.81658703],"study_design_scores_gemma":[0.0011149284,0.0021399062,0.0050704814,0.00025495616,0.00034973223,0.0039193844,0.0007277821,0.2981501,0.3075375,0.2999746,0.080518216,0.00024243411],"about_ca_topic_score_codex":0.0009863719,"about_ca_topic_score_gemma":0.0026470793,"teacher_disagreement_score":0.0128231095,"about_ca_system_score_codex":0.00057393214,"about_ca_system_score_gemma":0.0009347439,"threshold_uncertainty_score":0.042897582},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38137302,0.0032374782,0.39345196,0.006173131,0.001144077,0.0003631915,0.0006192055,0.0025967788,0.21104121],"genre_scores_gemma":[0.95937455,0.0009422797,0.01926538,0.000393946,0.00029619795,0.000090867434,0.0002225678,0.00017012413,0.019244041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997308,0.00065602566,0.00008944449,0.00021594937,0.0012166776,0.00051395886],"domain_scores_gemma":[0.9973002,0.00097335066,0.00018649208,0.0012000155,0.00023306085,0.00010687107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016332717,0.00090950605,0.0011899044,0.0009903376,0.001286768,0.0016610458,0.0010268684,0.0017492148,0.0072179222],"category_scores_gemma":[0.003590889,0.00059867336,0.0009707179,0.0011056146,0.0023268955,0.0040069255,0.0038947505,0.0035116635,0.0027137941],"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.00095660257,0.00017136241,0.000873712,0.00022205869,0.00012842374,0.00058395416,0.0005892974,0.023668315,0.023885105,0.8546272,0.015239901,0.079054125],"study_design_scores_gemma":[0.0002063498,0.00025539257,0.0007257368,0.000122065634,0.000109753986,0.0010015372,0.00019100387,0.14590861,0.045230474,0.78271013,0.02343754,0.00010140095],"about_ca_topic_score_codex":0.0003057352,"about_ca_topic_score_gemma":0.00028296732,"teacher_disagreement_score":0.0072179222,"about_ca_system_score_codex":0.0011138549,"about_ca_system_score_gemma":0.0009854077,"threshold_uncertainty_score":0.024146318},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5898586,0.0008550802,0.3375957,0.00065656565,0.00040492872,0.00032161444,0.00028855697,0.017069656,0.052949283],"genre_scores_gemma":[0.8595624,0.00023864709,0.123488866,0.00018799271,0.000043797387,0.00010628155,0.00048987684,0.0003892275,0.015493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991897,0.000120710225,0.00004244482,0.00011722688,0.000357267,0.00017276041],"domain_scores_gemma":[0.99938273,0.00014506053,0.00008171718,0.00016587919,0.00018209666,0.00004252243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054603314,0.00047118447,0.00029950726,0.0005645891,0.00048263412,0.0009897763,0.0010626975,0.00035787176,0.011594596],"category_scores_gemma":[0.0013154723,0.00020394279,0.0003610322,0.00055002543,0.0007014337,0.0017495337,0.001102021,0.000821526,0.0031391198],"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.0050056363,0.0004609306,0.009521771,0.00054773,0.000091068774,0.00074618903,0.00074804656,0.045564517,0.32137358,0.16490191,0.023125643,0.42791295],"study_design_scores_gemma":[0.00042600467,0.0018386026,0.003998836,0.00009663346,0.00008753473,0.00057206926,0.00022682622,0.33484372,0.53519946,0.013228616,0.109341554,0.00014010121],"about_ca_topic_score_codex":0.0021303045,"about_ca_topic_score_gemma":0.0030546058,"teacher_disagreement_score":0.011594596,"about_ca_system_score_codex":0.0012478253,"about_ca_system_score_gemma":0.0016624779,"threshold_uncertainty_score":0.038787782},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9021509,0.00069717754,0.045929614,0.0021797037,0.00027555917,0.000093512106,0.00034562728,0.00027902576,0.04804884],"genre_scores_gemma":[0.97550464,0.00089993025,0.006934761,0.00037267877,0.00033852825,0.00006344817,0.0005383614,0.00017008638,0.015177652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994179,0.00015812428,0.000022583446,0.00012263877,0.00012651137,0.00015219257],"domain_scores_gemma":[0.9973769,0.0011815323,0.0006314692,0.00018687335,0.00018348588,0.00043979473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006719774,0.0013429354,0.0011706923,0.004177508,0.002633379,0.0036102592,0.001361059,0.0014878213,0.009144222],"category_scores_gemma":[0.0031847793,0.0006673078,0.0009085914,0.002706327,0.0035854436,0.0050471164,0.0021786296,0.0025349401,0.00084487867],"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.00013171729,0.000071568116,0.0009457024,0.00005897035,0.000010880718,0.0003176835,0.000840051,0.0028381832,0.0014868074,0.9830273,0.0015369742,0.008734119],"study_design_scores_gemma":[0.000025257998,0.00002130597,0.00058505207,0.000025559459,0.000012894286,0.00010469598,0.00034176253,0.004143615,0.00050123397,0.99264187,0.0015835864,0.000013184779],"about_ca_topic_score_codex":0.0013347745,"about_ca_topic_score_gemma":0.0014380936,"teacher_disagreement_score":0.009144222,"about_ca_system_score_codex":0.0016139492,"about_ca_system_score_gemma":0.000657341,"threshold_uncertainty_score":0.030590475},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2260242,0.0026329383,0.687097,0.001710198,0.0009717719,0.00038714497,0.0009837569,0.007113132,0.07307991],"genre_scores_gemma":[0.80679685,0.0011107083,0.14399444,0.00071134267,0.0005858004,0.00027590297,0.0018248593,0.0011914072,0.04350871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917585,0.00015056228,0.000039734758,0.00014343191,0.0003688259,0.00012153144],"domain_scores_gemma":[0.99886227,0.00037014193,0.000062950894,0.00051981513,0.00014099343,0.00004379038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005913808,0.0008857057,0.001068581,0.0011727777,0.00084346655,0.0017169424,0.00096937316,0.00085902214,0.014358358],"category_scores_gemma":[0.0017198372,0.00048302763,0.00089652877,0.0014786752,0.0010734888,0.0048083127,0.0026545625,0.0019543087,0.004320155],"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.0013806006,0.00016204578,0.00079854665,0.0006596865,0.00010284895,0.0003945503,0.0005217776,0.02417926,0.04455111,0.57202107,0.027438251,0.3277903],"study_design_scores_gemma":[0.00025414946,0.00040320746,0.00078063307,0.00010454701,0.00011823026,0.0008935104,0.00017669021,0.095686,0.057122912,0.7961654,0.048193607,0.000101180565],"about_ca_topic_score_codex":0.00038584982,"about_ca_topic_score_gemma":0.00042150018,"teacher_disagreement_score":0.014358358,"about_ca_system_score_codex":0.0010268727,"about_ca_system_score_gemma":0.0007838054,"threshold_uncertainty_score":0.048033535},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24496633,0.0025271873,0.70212317,0.001972345,0.00042601005,0.0002006576,0.0007786512,0.002854943,0.04415073],"genre_scores_gemma":[0.9017316,0.0008457506,0.07972647,0.00027659902,0.00014549635,0.00010825793,0.0005792044,0.00037434822,0.0162122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787164,0.00033522048,0.00016044176,0.00031368877,0.0009422988,0.000376703],"domain_scores_gemma":[0.99796766,0.00067504,0.00020991526,0.00088806666,0.00019456045,0.000064847576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009441206,0.0010676602,0.0010066864,0.0013378348,0.0011142625,0.0022730615,0.00078216766,0.0015926932,0.0074651996],"category_scores_gemma":[0.005019785,0.0006689857,0.00081580586,0.0016547124,0.0012942867,0.005661884,0.0055793193,0.0021379285,0.004251681],"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.001739064,0.00011838668,0.0014726697,0.0005143596,0.00013471223,0.00061916176,0.00059293397,0.024845531,0.071026795,0.5839784,0.006561194,0.30839676],"study_design_scores_gemma":[0.00016450163,0.00027802426,0.00077151,0.00026330867,0.00011234,0.0011453523,0.00016751225,0.08212328,0.17797814,0.71130216,0.025568288,0.00012558191],"about_ca_topic_score_codex":0.00019836854,"about_ca_topic_score_gemma":0.0002868076,"teacher_disagreement_score":0.0074651996,"about_ca_system_score_codex":0.00093983463,"about_ca_system_score_gemma":0.0009862958,"threshold_uncertainty_score":0.02497363},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006401398,0.0018115478,0.0219069,0.0047756406,0.0046004825,0.00027855375,0.012348671,0.00614582,0.94173115],"genre_scores_gemma":[0.08513304,0.003765673,0.021072213,0.004888537,0.0016131725,0.00037504628,0.032011297,0.004564646,0.8465764],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987243,0.00017987135,0.000097604185,0.00029712106,0.00046177386,0.00023923806],"domain_scores_gemma":[0.998442,0.00018063556,0.000094417584,0.0005014009,0.00060923677,0.00017230086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000940085,0.0010502908,0.0007843299,0.0019667672,0.0023635973,0.0046212617,0.0011738708,0.0016146338,0.44371098],"category_scores_gemma":[0.0030569793,0.0003981467,0.000752003,0.0022371397,0.00091807597,0.0047975546,0.003996184,0.0019372774,0.35317078],"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.00051628274,0.00013089736,0.0014282368,0.0007267178,0.000042082047,0.0003986555,0.00043372143,0.0005670573,0.006656153,0.19582036,0.48637596,0.30690393],"study_design_scores_gemma":[0.000022474873,0.000024623629,0.00037412354,0.000085563,0.000010702766,0.00022236233,0.000108965185,0.00040290083,0.0017824698,0.020734213,0.97621024,0.000021384996],"about_ca_topic_score_codex":0.0014776594,"about_ca_topic_score_gemma":0.0015652716,"teacher_disagreement_score":0.44371098,"about_ca_system_score_codex":0.0013635176,"about_ca_system_score_gemma":0.0014903807,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2806079250","doi":"10.1007/s13389-018-0197-6","title":"A new class of irreducible pentanomials for polynomial-based multipliers in binary fields","year":2018,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"H2020 Marie Skłodowska-Curie Actions; European Commission","keywords":"Multiplier (economics); Modulo; Finite field; Binary number; Class (philosophy); Trinomial; Boolean function","score_opus":0.009644395364798096,"score_gpt":0.23900272574564468,"score_spread":0.22935833038084658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806079250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40948913,0.0012336879,0.52373946,0.0006963015,0.00040417694,0.00027646398,0.00030340932,0.00082881394,0.06302853],"genre_scores_gemma":[0.8492671,0.00074942363,0.13052088,0.00026224807,0.00019494107,0.00017761353,0.0002978434,0.00013152824,0.01839829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997571,0.000037366597,0.00001784102,0.000052994197,0.00008062199,0.00005413814],"domain_scores_gemma":[0.99983037,0.000049022317,0.000034294386,0.00003465716,0.000030496993,0.000021078044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024133908,0.00038977066,0.00036369215,0.0008572588,0.0008209234,0.0011477431,0.00035441728,0.00036693554,0.004161412],"category_scores_gemma":[0.00068781705,0.00022421917,0.00048827933,0.000559958,0.00073594484,0.0012963408,0.0005921933,0.0011134996,0.00076031836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021714465,0.000082727194,0.0006608784,0.00012932438,0.000015307181,0.00039599006,0.00022384706,0.009517489,0.03526864,0.8796311,0.0022626864,0.07159492],"study_design_scores_gemma":[0.00011363348,0.0006986466,0.0011567271,0.00012092414,0.00004210546,0.0022284284,0.00020341492,0.09717447,0.056168504,0.75821006,0.08376303,0.000119946955],"about_ca_topic_score_codex":0.00020486816,"about_ca_topic_score_gemma":0.00030517633,"teacher_disagreement_score":0.004161412,"about_ca_system_score_codex":0.00052609836,"about_ca_system_score_gemma":0.0005190389,"threshold_uncertainty_score":0.01392132},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01769113,0.06504815,0.12825613,0.04634245,0.014150207,0.00013557126,0.0008992289,0.0007345539,0.7267426],"genre_scores_gemma":[0.62819153,0.06962923,0.06689777,0.011529624,0.016292507,0.00030623854,0.0011676049,0.0006367075,0.20534877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764484,0.00051404204,0.00013844427,0.0003534514,0.0010111547,0.00033812286],"domain_scores_gemma":[0.99510396,0.0029632295,0.00010244764,0.001270112,0.0004386707,0.00012154187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022271741,0.0010684986,0.0012557763,0.0014800619,0.0019841017,0.005006803,0.0014502275,0.0019333712,0.01102596],"category_scores_gemma":[0.0062850397,0.00069927884,0.0010002194,0.002342535,0.0074567073,0.009531894,0.005079073,0.011839562,0.005601191],"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.00008514738,0.00001581661,0.000069713984,0.00019188678,0.000016459098,0.00007441333,0.00016873481,0.0013680423,0.0008763815,0.94180924,0.022114877,0.033209223],"study_design_scores_gemma":[0.0000227712,0.000038380313,0.00010250164,0.00017601196,0.000017245053,0.00021176923,0.00007220362,0.0021655892,0.0018394111,0.8747663,0.12055971,0.000028101174],"about_ca_topic_score_codex":0.0016979405,"about_ca_topic_score_gemma":0.0008402558,"teacher_disagreement_score":0.01102596,"about_ca_system_score_codex":0.003846724,"about_ca_system_score_gemma":0.0022615402,"threshold_uncertainty_score":0.0368855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33229944,0.0007686634,0.6498561,0.00028961193,0.0001886263,0.0001690118,0.00013343387,0.0022306952,0.014064445],"genre_scores_gemma":[0.7667611,0.00031842096,0.22704105,0.00010008119,0.000042387994,0.00006010105,0.00017046445,0.00004085774,0.0054655923],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989796,0.000018013963,0.000008557665,0.000021670136,0.000031968284,0.000021871363],"domain_scores_gemma":[0.9998784,0.00003269187,0.00001847126,0.000018102786,0.000042680793,0.000009654249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013362615,0.0003140012,0.00021787864,0.00037884354,0.00032491903,0.00044958343,0.0006013145,0.00021676962,0.0024159176],"category_scores_gemma":[0.00026237013,0.00012234211,0.0001843005,0.0003366412,0.00019937371,0.0006495991,0.00018213931,0.00021158576,0.0004828502],"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.0005335944,0.00018735399,0.0011113858,0.00029018594,0.000067108216,0.00067731703,0.00023554561,0.029350564,0.58025074,0.031413656,0.0026997675,0.3531828],"study_design_scores_gemma":[0.00025369675,0.0021942263,0.0015041397,0.00006542346,0.00012990327,0.0017223123,0.00015211003,0.51639843,0.42197797,0.015505878,0.04002162,0.000074418465],"about_ca_topic_score_codex":0.0007180725,"about_ca_topic_score_gemma":0.0022306396,"teacher_disagreement_score":0.0024159176,"about_ca_system_score_codex":0.00035677294,"about_ca_system_score_gemma":0.0005660211,"threshold_uncertainty_score":0.008082092},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9343352,0.003048464,0.04472218,0.00025358118,0.000051199135,0.00006560152,0.00052043336,0.0006055752,0.016397817],"genre_scores_gemma":[0.9895762,0.00052998326,0.0062065856,0.000024823912,0.0000084080275,0.000031218435,0.0003589057,0.00007645546,0.0031874173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992162,0.00012642915,0.000047727583,0.00008589916,0.00036902464,0.00015470716],"domain_scores_gemma":[0.9992692,0.0003549143,0.00007379469,0.0001301067,0.00015802629,0.000013986333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032763177,0.00047960732,0.0003329901,0.0008981837,0.00026008277,0.0005178134,0.00050795043,0.00025239505,0.0031962136],"category_scores_gemma":[0.001226948,0.00012865983,0.00030001823,0.0011228673,0.00022724111,0.001041318,0.000246405,0.00020901558,0.00057629007],"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.002190655,0.0004603265,0.019951355,0.0009571975,0.00026905228,0.0008301443,0.0002680688,0.4683006,0.21688864,0.021726044,0.004948556,0.26320934],"study_design_scores_gemma":[0.00006677321,0.0011511071,0.02498189,0.000084115054,0.00012540387,0.0008872175,0.00029564314,0.71415114,0.23810758,0.006154095,0.013934193,0.00006086024],"about_ca_topic_score_codex":0.0006001164,"about_ca_topic_score_gemma":0.00056197663,"teacher_disagreement_score":0.0031962136,"about_ca_system_score_codex":0.00064815424,"about_ca_system_score_gemma":0.00031232476,"threshold_uncertainty_score":0.010692358},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3075721,0.0012716375,0.60054195,0.0007043623,0.00045280834,0.00015105815,0.0004940386,0.0016296459,0.08718239],"genre_scores_gemma":[0.8422556,0.0008899414,0.13444702,0.00017810817,0.0002060017,0.000090847374,0.00046363164,0.00036323114,0.02110552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967146,0.000046293568,0.00002329972,0.00007062468,0.0001300283,0.000058250505],"domain_scores_gemma":[0.9994904,0.0001307478,0.000080575046,0.0001269254,0.00011738994,0.00005402273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002572523,0.00024371874,0.00033033502,0.000763261,0.0008475997,0.0012867956,0.00031402902,0.00040219008,0.007260361],"category_scores_gemma":[0.0014832591,0.00016462848,0.00046448392,0.0010269837,0.0008663825,0.0020301156,0.0010238625,0.00070452277,0.0022627702],"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.0004099154,0.0000363797,0.0024152684,0.0001846795,0.000018473718,0.0011486236,0.0010713188,0.012285412,0.06399239,0.75208104,0.0065296856,0.15982673],"study_design_scores_gemma":[0.00009903309,0.0005043037,0.005047418,0.00014606539,0.000095037496,0.0043234266,0.0007832486,0.08455095,0.05316432,0.66784525,0.18330595,0.00013499195],"about_ca_topic_score_codex":0.0005125556,"about_ca_topic_score_gemma":0.00041991982,"teacher_disagreement_score":0.007260361,"about_ca_system_score_codex":0.000505182,"about_ca_system_score_gemma":0.00035747007,"threshold_uncertainty_score":0.024288297},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.220251,0.0074335705,0.750305,0.0014754807,0.00052994554,0.00023511214,0.00023538922,0.004763778,0.014770759],"genre_scores_gemma":[0.7198625,0.003071262,0.26645106,0.0002978024,0.00041130136,0.0001368851,0.0006325462,0.00053183525,0.008604761],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991967,0.000105539206,0.0000607066,0.00011335993,0.0004167649,0.000106842344],"domain_scores_gemma":[0.99864,0.00056171353,0.000104978324,0.00044486858,0.00021251939,0.000035968213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007027706,0.00070527045,0.00083217776,0.0013473174,0.00055208936,0.0013046266,0.00077166996,0.0005991371,0.007453049],"category_scores_gemma":[0.002500211,0.000257522,0.00033779404,0.0014114918,0.00074945536,0.0050307903,0.001138707,0.00137683,0.0022031916],"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.0021276714,0.00021050271,0.00084699417,0.00063721184,0.000049254824,0.00044262217,0.00064881064,0.023375435,0.24429068,0.16217467,0.007325532,0.5578707],"study_design_scores_gemma":[0.0002513396,0.0005836296,0.0012613827,0.00010579022,0.00006225015,0.0011791902,0.00028493113,0.3293066,0.516129,0.11765994,0.033082712,0.000093249386],"about_ca_topic_score_codex":0.00032959357,"about_ca_topic_score_gemma":0.0003013116,"teacher_disagreement_score":0.007453049,"about_ca_system_score_codex":0.0006338705,"about_ca_system_score_gemma":0.0004868486,"threshold_uncertainty_score":0.024932921},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23654251,0.004557365,0.67064303,0.0009570711,0.0010331554,0.00034080897,0.0013063309,0.013817976,0.07080174],"genre_scores_gemma":[0.7270872,0.0008883752,0.24148796,0.00057321694,0.0001811454,0.00018246676,0.0018569607,0.00012526472,0.027617382],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998313,0.000026064994,0.000014665798,0.000038229882,0.00006220883,0.000027507762],"domain_scores_gemma":[0.99981004,0.000025327294,0.000020744821,0.00004277355,0.000084454514,0.000016654409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012454038,0.00043242742,0.00034207926,0.00059761066,0.00033006808,0.0005796543,0.0009927214,0.0002515928,0.01289849],"category_scores_gemma":[0.0003286632,0.00015704944,0.00022860082,0.00083866843,0.00012762159,0.0007451384,0.00043338293,0.00039527434,0.0031366914],"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.0012382858,0.00036972968,0.0024781309,0.0006126733,0.00014674578,0.00058283383,0.00015202035,0.03321426,0.25435463,0.030618593,0.046864208,0.62936795],"study_design_scores_gemma":[0.00046409862,0.0025897068,0.0034920676,0.00017626843,0.000274587,0.0020841083,0.0002078723,0.60168934,0.24999246,0.02092484,0.11798511,0.00011964478],"about_ca_topic_score_codex":0.0009405853,"about_ca_topic_score_gemma":0.002416873,"teacher_disagreement_score":0.01289849,"about_ca_system_score_codex":0.00044000795,"about_ca_system_score_gemma":0.00076969736,"threshold_uncertainty_score":0.04314971},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09141153,0.0007056697,0.8952133,0.0002868586,0.00022006714,0.00016376695,0.00015027929,0.0016744789,0.010174027],"genre_scores_gemma":[0.49057198,0.00051510346,0.50309896,0.00013224359,0.00011333875,0.00012699029,0.00040981045,0.000050210667,0.0049813185],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996629,0.00006705634,0.000028700475,0.00005481535,0.00014853907,0.00003800604],"domain_scores_gemma":[0.99966025,0.00007746803,0.000063657324,0.00011070369,0.000071521485,0.000016462496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035672451,0.00039187496,0.00035121554,0.00058127195,0.0003423659,0.00072461786,0.00057984324,0.00030826547,0.0020228068],"category_scores_gemma":[0.0009699973,0.0001213338,0.00034866924,0.00088289735,0.00042140816,0.0016264725,0.0005945485,0.0005082599,0.0009414276],"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.0007791346,0.0001793206,0.0011060204,0.0003925626,0.00006021544,0.0006047611,0.00031798935,0.048031706,0.19703387,0.15837012,0.007139262,0.58598506],"study_design_scores_gemma":[0.0003589679,0.0020562948,0.0013655837,0.00013046787,0.00013320147,0.003444247,0.00016131788,0.578663,0.27672896,0.0586747,0.07811613,0.0001670461],"about_ca_topic_score_codex":0.00030234898,"about_ca_topic_score_gemma":0.00042226107,"teacher_disagreement_score":0.0020228068,"about_ca_system_score_codex":0.0003472733,"about_ca_system_score_gemma":0.00056382903,"threshold_uncertainty_score":0.006766975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029987579,0.00054606545,0.98236173,0.00026025213,0.000080338745,0.00013755677,0.0005660054,0.0072447923,0.0058044884],"genre_scores_gemma":[0.044886112,0.00089373166,0.94355357,0.00024273542,0.00017785361,0.0004902718,0.0025299562,0.001622506,0.0056034084],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977564,0.00035828372,0.00027612745,0.00025768927,0.0011408038,0.00021064102],"domain_scores_gemma":[0.996781,0.000848017,0.00023631462,0.0012571928,0.0007795613,0.000097801785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001702015,0.0011947794,0.00089871144,0.002576842,0.0013314981,0.0043068347,0.0031664816,0.0010474913,0.015176086],"category_scores_gemma":[0.007796839,0.0008232527,0.0014823045,0.005415397,0.0014304835,0.0064131822,0.0031794386,0.0027478915,0.010328746],"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.00033451105,0.00017769262,0.0011782455,0.0007047935,0.000071728675,0.00014633167,0.00045778195,0.019381026,0.010978694,0.35801595,0.039301094,0.56925213],"study_design_scores_gemma":[0.00020391861,0.00019766607,0.00055123935,0.00024313807,0.000071148585,0.0007084398,0.00020730165,0.18407373,0.04634263,0.51058555,0.25671,0.00010527803],"about_ca_topic_score_codex":0.0014717466,"about_ca_topic_score_gemma":0.0023970844,"teacher_disagreement_score":0.015176086,"about_ca_system_score_codex":0.0017133941,"about_ca_system_score_gemma":0.0024810904,"threshold_uncertainty_score":0.05076909},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007432121,0.00004524535,0.9869573,0.000055816337,0.00005462484,0.000023291997,0.00005942536,0.0022212733,0.003150862],"genre_scores_gemma":[0.14740363,0.000085054366,0.84684175,0.000054514898,0.000028951401,0.00007220887,0.00023116624,0.00071605033,0.004566656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997203,0.000039009992,0.000016792603,0.000042785046,0.00014521183,0.000035943514],"domain_scores_gemma":[0.9995043,0.00013972618,0.000034690427,0.00013896791,0.00015643667,0.00002579715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000562422,0.00053699553,0.00041049285,0.00052618934,0.000410551,0.0010608718,0.0012513853,0.00048664326,0.010275166],"category_scores_gemma":[0.0016731708,0.00022368747,0.00041261892,0.00059520395,0.00033857088,0.0009694157,0.00077904935,0.00088427006,0.003305998],"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.00051295775,0.00018147202,0.0013793088,0.00034889294,0.00008972881,0.0002762082,0.00028294252,0.19018018,0.09104566,0.12134441,0.008886242,0.5854719],"study_design_scores_gemma":[0.00006200035,0.00014863299,0.0003898322,0.000042429856,0.000019146351,0.00029259518,0.00006194822,0.88945174,0.06930957,0.015861271,0.024309931,0.000050942686],"about_ca_topic_score_codex":0.0014238491,"about_ca_topic_score_gemma":0.0016111532,"teacher_disagreement_score":0.010275166,"about_ca_system_score_codex":0.00047079095,"about_ca_system_score_gemma":0.0010443914,"threshold_uncertainty_score":0.03437382},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047221605,0.0005342638,0.9410697,0.00045280156,0.00024830815,0.000120735494,0.00006872862,0.001286002,0.008997854],"genre_scores_gemma":[0.36185703,0.00037194754,0.63030875,0.00020675422,0.00028326354,0.00008761223,0.00015694299,0.00041681406,0.0063108453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857867,0.00038428954,0.00005908161,0.00023797994,0.0006387048,0.00010140031],"domain_scores_gemma":[0.9979699,0.00075260305,0.00014877947,0.00074759347,0.00023518642,0.00014583879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015037325,0.00058001874,0.00079170463,0.0011480155,0.0006628156,0.0018117152,0.0011083183,0.00047255366,0.0045242226],"category_scores_gemma":[0.007431854,0.00026293882,0.0005752945,0.0011127976,0.0017370344,0.0023642855,0.003206611,0.0022025313,0.0014657646],"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.00043981764,0.00009916611,0.002409988,0.00025955465,0.000051841893,0.00041666065,0.0003511843,0.016500497,0.024695553,0.54993343,0.008311328,0.39653087],"study_design_scores_gemma":[0.00012011675,0.00037023556,0.0016222019,0.00007314814,0.00005472924,0.0011946592,0.00012472621,0.26661518,0.033944502,0.6550796,0.04070376,0.0000971869],"about_ca_topic_score_codex":0.00021709148,"about_ca_topic_score_gemma":0.0003736567,"teacher_disagreement_score":0.0045242226,"about_ca_system_score_codex":0.00069345045,"about_ca_system_score_gemma":0.00069524074,"threshold_uncertainty_score":0.01513505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15031749,0.0023852626,0.8051054,0.0012834504,0.0006173954,0.00036490549,0.00035074214,0.0009423057,0.038633123],"genre_scores_gemma":[0.7018152,0.0014392937,0.27914754,0.00015984642,0.00031118852,0.00018776047,0.0006245893,0.00014485639,0.016169667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990711,0.00023724143,0.000063159816,0.00019128644,0.00032828422,0.00010895775],"domain_scores_gemma":[0.9991441,0.00031162874,0.00007050118,0.00030156143,0.0001031401,0.00006903517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009867967,0.00085080724,0.0009583831,0.0015339828,0.0015140856,0.0027986679,0.0007736823,0.001036847,0.010240987],"category_scores_gemma":[0.0034918748,0.00036668812,0.000934166,0.0015652574,0.0019898573,0.0058605275,0.0024973052,0.0023765867,0.002224645],"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.00037993447,0.000109065026,0.0016312294,0.00035638345,0.00005164539,0.00031185805,0.00051270984,0.014678104,0.013171573,0.85176325,0.005064185,0.11197014],"study_design_scores_gemma":[0.000063963496,0.00023613573,0.00076527207,0.00010145587,0.00003461894,0.00072282547,0.00020977984,0.093004085,0.028511263,0.8431951,0.033087052,0.00006851387],"about_ca_topic_score_codex":0.00026112358,"about_ca_topic_score_gemma":0.00032081295,"teacher_disagreement_score":0.010240987,"about_ca_system_score_codex":0.0013802744,"about_ca_system_score_gemma":0.0009591692,"threshold_uncertainty_score":0.034259558},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3879308,0.0065619554,0.25373393,0.016401079,0.0013082485,0.00055678614,0.0010461906,0.0016976661,0.33076337],"genre_scores_gemma":[0.92489886,0.0010875041,0.051587805,0.00058819604,0.00031351612,0.0001402092,0.00046308397,0.00012417465,0.020796588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955427,0.0010228155,0.00024608866,0.0005107447,0.0022613131,0.00041637453],"domain_scores_gemma":[0.9922072,0.0026458541,0.00067460135,0.0030648129,0.0010639048,0.00034365713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006013486,0.00080154574,0.000749334,0.001500995,0.0018384587,0.0023278885,0.0009688017,0.0013294865,0.0120702],"category_scores_gemma":[0.014796165,0.00030238702,0.0006680536,0.0010859739,0.0024802585,0.005109723,0.0031118384,0.0029014482,0.004250369],"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.0010285621,0.00015177284,0.0063314177,0.0003060628,0.000070855334,0.0002984137,0.0005360286,0.007691037,0.0083619235,0.8095988,0.014438115,0.15118702],"study_design_scores_gemma":[0.00015969145,0.0007692806,0.0036559633,0.00025277148,0.00007513072,0.002103334,0.00042378015,0.049346562,0.033155996,0.736183,0.17376257,0.00011186782],"about_ca_topic_score_codex":0.00086040405,"about_ca_topic_score_gemma":0.0006349022,"teacher_disagreement_score":0.0120702,"about_ca_system_score_codex":0.0018458264,"about_ca_system_score_gemma":0.002472134,"threshold_uncertainty_score":0.04037887},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08532867,0.0017485202,0.82656944,0.001750478,0.0009027432,0.00020460595,0.00018109873,0.00044289857,0.08287149],"genre_scores_gemma":[0.8168426,0.0009203125,0.16753496,0.00081670884,0.00044256527,0.00021223396,0.0001669562,0.0001229739,0.012940599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971474,0.0008555369,0.00014920678,0.0002355225,0.001303798,0.00030863105],"domain_scores_gemma":[0.9981268,0.00064321834,0.00026584437,0.00048884284,0.00037622015,0.00009912596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026927935,0.0006224224,0.0006629719,0.0011862258,0.0009684851,0.0017347364,0.00095636176,0.0010465587,0.002506089],"category_scores_gemma":[0.0057881987,0.00035062188,0.00075354025,0.00094311364,0.0032356924,0.0031029005,0.0027529723,0.003019937,0.00090085046],"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.00006483151,0.00002550835,0.000120107725,0.000048892005,0.000010776345,0.00010320444,0.00012234705,0.0023497895,0.0020189371,0.9748138,0.0021916039,0.018130215],"study_design_scores_gemma":[0.00005077628,0.0001902224,0.0002317939,0.00007384947,0.000034089,0.00046369946,0.00008364516,0.04630309,0.0068477388,0.9259321,0.019741835,0.00004723419],"about_ca_topic_score_codex":0.0002473609,"about_ca_topic_score_gemma":0.00028463706,"teacher_disagreement_score":0.0026927935,"about_ca_system_score_codex":0.00066466327,"about_ca_system_score_gemma":0.00090095686,"threshold_uncertainty_score":0.01424098},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050492287,0.0078085023,0.54622984,0.022356221,0.0043837316,0.00041646117,0.0015049079,0.0028535211,0.3639546],"genre_scores_gemma":[0.67669594,0.007116681,0.19213165,0.00575729,0.0030241034,0.0006133868,0.0021248977,0.00065932755,0.111876704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980742,0.00050915004,0.00015020062,0.00030017516,0.00074412196,0.0002221704],"domain_scores_gemma":[0.99510515,0.0017545761,0.00034555336,0.0019800295,0.0006077953,0.00020682468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002691859,0.0011704214,0.0006057621,0.0014714082,0.001978385,0.0034167822,0.0011207039,0.001674475,0.029952766],"category_scores_gemma":[0.011487619,0.0003722095,0.0006254075,0.0011278201,0.002380026,0.010293818,0.0042072413,0.004640154,0.011310667],"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.00008802938,0.00004166268,0.00049191044,0.00020324868,0.000012899777,0.0000921572,0.00009614504,0.0016227441,0.0019988287,0.9259364,0.020711053,0.048704974],"study_design_scores_gemma":[0.000017510953,0.00006285798,0.00021789252,0.00013484531,0.00001609627,0.00036260518,0.000066807785,0.005673111,0.0037197878,0.8930038,0.09670207,0.000022672226],"about_ca_topic_score_codex":0.00027488178,"about_ca_topic_score_gemma":0.0002987236,"teacher_disagreement_score":0.029952766,"about_ca_system_score_codex":0.0010554101,"about_ca_system_score_gemma":0.0011549208,"threshold_uncertainty_score":0.100201964},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44825572,0.0009651659,0.5283237,0.00063311885,0.00009716802,0.00016245476,0.00007550239,0.0008936266,0.020593544],"genre_scores_gemma":[0.86251384,0.00038918437,0.13101842,0.00008643515,0.000045048695,0.00007603821,0.00016375455,0.00011926788,0.005587999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988918,0.0003040055,0.000041147967,0.000115126524,0.0004836978,0.00016417047],"domain_scores_gemma":[0.99758554,0.0012631972,0.00018494215,0.00055951806,0.00030516012,0.00010169118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017069132,0.00058998005,0.00044834337,0.001002886,0.0005627222,0.0013068079,0.00073448534,0.0006375679,0.0033208476],"category_scores_gemma":[0.006450446,0.00026464098,0.0006536483,0.0011166864,0.0010635062,0.0031105087,0.0015250643,0.0010573796,0.0009723934],"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.0017950466,0.00027133035,0.013517985,0.00037591433,0.00011114603,0.0005853268,0.00086109544,0.10455732,0.0680136,0.46826622,0.005846019,0.33579898],"study_design_scores_gemma":[0.0001770194,0.00043577407,0.003120106,0.00006702509,0.00005564848,0.000610721,0.00021511652,0.69768363,0.051141262,0.23414944,0.012278977,0.00006519693],"about_ca_topic_score_codex":0.00081191695,"about_ca_topic_score_gemma":0.000796075,"teacher_disagreement_score":0.0033208476,"about_ca_system_score_codex":0.0011272641,"about_ca_system_score_gemma":0.0009432188,"threshold_uncertainty_score":0.011109352},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015195905,0.0046301316,0.96257496,0.0005461669,0.00033795723,0.00014386859,0.00010020368,0.001315754,0.015155136],"genre_scores_gemma":[0.19661252,0.0041590277,0.7751525,0.000200546,0.00028840918,0.0001962929,0.0004974776,0.00039366062,0.022499556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991885,0.00016100472,0.00004355591,0.000060095517,0.00048130803,0.00006545772],"domain_scores_gemma":[0.9995409,0.00011125232,0.000051912542,0.00018144312,0.000098989316,0.00001547166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006940015,0.0009850613,0.00048899616,0.0014159045,0.0005861067,0.000984067,0.00078954693,0.0005614416,0.010058994],"category_scores_gemma":[0.0016155051,0.0004008485,0.0005997567,0.0014355575,0.0006378967,0.0024044618,0.001321235,0.0013257242,0.0061280704],"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.00028326685,0.00013439791,0.0005028925,0.00067565177,0.00009688455,0.00020836135,0.0001781266,0.01872398,0.07916157,0.20646842,0.013500908,0.6800656],"study_design_scores_gemma":[0.00034343282,0.0005885428,0.0012753222,0.0003317497,0.00014340582,0.0024802787,0.00019751803,0.23841256,0.17290145,0.37429923,0.20892058,0.000105895415],"about_ca_topic_score_codex":0.0001329628,"about_ca_topic_score_gemma":0.00032269757,"teacher_disagreement_score":0.010058994,"about_ca_system_score_codex":0.0004492257,"about_ca_system_score_gemma":0.00059464114,"threshold_uncertainty_score":0.033650696},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21447523,0.0063404175,0.5652703,0.010307682,0.0032647105,0.0002376029,0.0018022464,0.0017499902,0.1965518],"genre_scores_gemma":[0.87665296,0.0022794127,0.049540605,0.0010908085,0.002052253,0.00023491541,0.0013115795,0.00022087061,0.06661649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987557,0.00047802433,0.000058769154,0.00021069238,0.0003716467,0.00012521575],"domain_scores_gemma":[0.9975126,0.0012809369,0.0002576369,0.00050075795,0.00031657735,0.00013144831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009376741,0.0006138605,0.0006590824,0.00167811,0.0004335476,0.0026127768,0.00052776537,0.0009622483,0.015994266],"category_scores_gemma":[0.009108036,0.00019679565,0.00034042692,0.0014199155,0.0008310114,0.0016303741,0.0010655416,0.0012338784,0.0038359622],"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.00032111607,0.00005383593,0.0005222911,0.00019152756,0.00001572856,0.00016607909,0.000117775904,0.010381825,0.0048353467,0.8822541,0.011512991,0.08962738],"study_design_scores_gemma":[0.00012354243,0.00014689563,0.000556474,0.0001922,0.000023062163,0.00057131326,0.00006218102,0.07728463,0.0069874744,0.8803067,0.033692133,0.00005342059],"about_ca_topic_score_codex":0.00015016766,"about_ca_topic_score_gemma":0.00013337206,"teacher_disagreement_score":0.015994266,"about_ca_system_score_codex":0.0008126047,"about_ca_system_score_gemma":0.0005176994,"threshold_uncertainty_score":0.053506196},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1100429,0.003139426,0.7258017,0.004015837,0.00117687,0.00072446174,0.0022054403,0.009991243,0.14290214],"genre_scores_gemma":[0.858786,0.0011459228,0.098511264,0.0004678001,0.00023909756,0.00019932474,0.0010587336,0.0002738923,0.03931797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861157,0.0002790975,0.00008177336,0.0001819223,0.0005478134,0.0002978069],"domain_scores_gemma":[0.9984932,0.00039503275,0.00008341448,0.0006854347,0.000207821,0.00013506696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012631912,0.000510051,0.00062233343,0.00073144236,0.0012473618,0.003582077,0.0009885116,0.0011284202,0.013823938],"category_scores_gemma":[0.0044192006,0.0004309299,0.00038932372,0.00089417124,0.0013479044,0.0050640544,0.0038944802,0.0019842875,0.0053409655],"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.0010491726,0.00024390327,0.00082151726,0.0002995903,0.000049881906,0.00054772594,0.00045176904,0.006596436,0.015131454,0.80031604,0.026393158,0.14809932],"study_design_scores_gemma":[0.00040448352,0.00038924484,0.00043596156,0.00017159167,0.00009102707,0.0016196695,0.00020369691,0.066504076,0.028213354,0.7840914,0.11777488,0.000100641206],"about_ca_topic_score_codex":0.00030319332,"about_ca_topic_score_gemma":0.00032309964,"teacher_disagreement_score":0.013823938,"about_ca_system_score_codex":0.0007521761,"about_ca_system_score_gemma":0.001597469,"threshold_uncertainty_score":0.046245635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31532338,0.0013004255,0.64368224,0.0014993466,0.0004002368,0.00014157759,0.00039609784,0.004478643,0.032777987],"genre_scores_gemma":[0.6663184,0.00046195052,0.31717288,0.00022478594,0.0002690501,0.000085790794,0.0005892052,0.0004301428,0.014447735],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990125,0.00014045618,0.00006525735,0.00025277986,0.0003433311,0.00018565658],"domain_scores_gemma":[0.99837863,0.00055317977,0.00014935441,0.00059778814,0.00018184727,0.00013914432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085598754,0.0009131686,0.00095401745,0.0014645089,0.0011461361,0.0024208492,0.0012641593,0.00069905765,0.010280506],"category_scores_gemma":[0.004757606,0.00037677973,0.0006429036,0.0012710721,0.0013868771,0.005953149,0.0032958775,0.0022014952,0.0039044784],"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.001077187,0.00021680513,0.004438293,0.00042069712,0.00008697097,0.0005541711,0.00069732784,0.022502484,0.033494912,0.30567372,0.014134896,0.61670256],"study_design_scores_gemma":[0.00021343495,0.00031428217,0.001077474,0.00012180751,0.000072311515,0.0009273226,0.0003880075,0.118021704,0.04819004,0.7999334,0.030640474,0.000099739555],"about_ca_topic_score_codex":0.0007801842,"about_ca_topic_score_gemma":0.0014363239,"teacher_disagreement_score":0.010280506,"about_ca_system_score_codex":0.0012135699,"about_ca_system_score_gemma":0.0011418952,"threshold_uncertainty_score":0.03439176},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3361282,0.00076464756,0.5844567,0.0017965613,0.00024795983,0.00027516054,0.0003744639,0.0019137559,0.0740425],"genre_scores_gemma":[0.8232596,0.00079261797,0.15743329,0.00035121094,0.00039260043,0.00020418428,0.0005969769,0.00069230486,0.016277198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968581,0.0005333766,0.00020806641,0.0006101219,0.0012520768,0.0005382235],"domain_scores_gemma":[0.99312043,0.0035210126,0.00056015933,0.0016428898,0.0007796923,0.000375821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003143888,0.0013713888,0.0013093207,0.004381623,0.0020182838,0.0059636715,0.0020091725,0.0012927799,0.010079699],"category_scores_gemma":[0.018203238,0.0006113522,0.001887041,0.0031238445,0.004865037,0.007868691,0.005891513,0.004701879,0.0024408998],"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.00023035848,0.000095653864,0.0034814486,0.00014224384,0.00002702723,0.00022677303,0.00066498586,0.011769477,0.004261488,0.9245629,0.0039296504,0.050607946],"study_design_scores_gemma":[0.000044016004,0.000081898615,0.00078764884,0.00006697489,0.00003971823,0.00030941042,0.00017595643,0.07340069,0.008113467,0.9108622,0.006067458,0.000050610055],"about_ca_topic_score_codex":0.0010622522,"about_ca_topic_score_gemma":0.00093059934,"teacher_disagreement_score":0.010079699,"about_ca_system_score_codex":0.0028695918,"about_ca_system_score_gemma":0.0016905981,"threshold_uncertainty_score":0.033720016},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068916626,0.0009894131,0.89745647,0.00065273093,0.0007080133,0.00028335903,0.00029657703,0.0055733817,0.025123416],"genre_scores_gemma":[0.4647482,0.00071354886,0.5000993,0.00040479883,0.00054957037,0.00028187284,0.0005549048,0.0003054859,0.032342307],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930143,0.00012435531,0.00004873662,0.00014360723,0.00028898375,0.00009291072],"domain_scores_gemma":[0.99949944,0.0001557149,0.000029936718,0.00014550451,0.00011574121,0.00005369331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004403371,0.00068783574,0.0010814365,0.00078894035,0.0008620597,0.0015158029,0.0009349813,0.00096998207,0.016192036],"category_scores_gemma":[0.0014168607,0.00027083294,0.0006865914,0.00097544806,0.0006517473,0.0011679305,0.0014081233,0.00094283564,0.0048521166],"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.0027614844,0.00030458567,0.00084750477,0.00057239993,0.00013014716,0.0012000067,0.00046283842,0.018233132,0.31789654,0.120890245,0.019789753,0.5169113],"study_design_scores_gemma":[0.0011378529,0.0029265203,0.0021259806,0.00033672768,0.0004140613,0.004674948,0.00019075858,0.44863477,0.31971124,0.08796909,0.13156521,0.00031287794],"about_ca_topic_score_codex":0.0007347584,"about_ca_topic_score_gemma":0.0012989332,"teacher_disagreement_score":0.016192036,"about_ca_system_score_codex":0.0006659311,"about_ca_system_score_gemma":0.00077181007,"threshold_uncertainty_score":0.054167807},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6667554,0.0018189906,0.27361783,0.0011592864,0.00013838685,0.00025927016,0.00022262233,0.0005554326,0.055472825],"genre_scores_gemma":[0.9916243,0.0003562135,0.0054121995,0.00004663601,0.000037425805,0.000021130016,0.00007731412,0.000020185684,0.002404586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984604,0.0003210127,0.000057693273,0.00012638196,0.00075324654,0.00028122324],"domain_scores_gemma":[0.9959072,0.002575908,0.00046590742,0.0005145563,0.00041436788,0.00012214704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009307279,0.00053531677,0.00049870723,0.002199507,0.000650002,0.0012110464,0.0005268606,0.0010405113,0.0026723577],"category_scores_gemma":[0.0045463704,0.00018811446,0.00076031697,0.0008686859,0.0011978528,0.001960452,0.0010869633,0.0011123361,0.0003863931],"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.0008761568,0.00026545458,0.009351097,0.0004089372,0.00020400758,0.0024636881,0.0004691411,0.14742005,0.04311544,0.69976705,0.006120554,0.089538455],"study_design_scores_gemma":[0.00003727226,0.00032660738,0.003916081,0.000048005266,0.00009078576,0.002338741,0.00012094561,0.76248914,0.03174312,0.19381861,0.0050355913,0.00003502821],"about_ca_topic_score_codex":0.00022377454,"about_ca_topic_score_gemma":0.00011515322,"teacher_disagreement_score":0.0026723577,"about_ca_system_score_codex":0.0009143937,"about_ca_system_score_gemma":0.00034516057,"threshold_uncertainty_score":0.008939862},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2855555,0.00786833,0.100768946,0.045869637,0.0023931232,0.00016213974,0.0006586146,0.00067250157,0.5560511],"genre_scores_gemma":[0.971456,0.0010492153,0.004742421,0.0013416224,0.00039774168,0.000025802781,0.000081661194,0.000042112864,0.020863403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837375,0.00057625334,0.000040303596,0.00014072517,0.0005251307,0.00034383746],"domain_scores_gemma":[0.99786097,0.00096222357,0.00015091624,0.0006781287,0.0002355668,0.00011225222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014740756,0.00052533014,0.0005564099,0.0009656772,0.0011989275,0.0017912699,0.00077826326,0.0023808188,0.010415861],"category_scores_gemma":[0.0060167047,0.00026069075,0.00046033462,0.0009638279,0.0042169155,0.0048697274,0.0029573925,0.002493476,0.0019014803],"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.00026200002,0.00001912335,0.00035865093,0.0000527919,0.00002197309,0.00041145104,0.00013544815,0.0032339746,0.001422455,0.9677248,0.009819311,0.016537977],"study_design_scores_gemma":[0.000047955527,0.000048636677,0.0003641231,0.000031252104,0.000013135279,0.00050891703,0.00011922847,0.009392242,0.0018646062,0.97369766,0.013889872,0.000022368531],"about_ca_topic_score_codex":0.0005902186,"about_ca_topic_score_gemma":0.00045365293,"teacher_disagreement_score":0.010415861,"about_ca_system_score_codex":0.0011029845,"about_ca_system_score_gemma":0.000657611,"threshold_uncertainty_score":0.034844518},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19321327,0.0009431724,0.6663259,0.001604394,0.0006000594,0.0006398634,0.0012998976,0.0037915679,0.13158183],"genre_scores_gemma":[0.903565,0.00026839587,0.069183245,0.00025988033,0.00011528204,0.00011974399,0.0005133463,0.00012378507,0.025851399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879277,0.00019537384,0.000059142592,0.00025859484,0.00046567767,0.00022838355],"domain_scores_gemma":[0.9988587,0.00012870123,0.00011439961,0.00064642663,0.00016572754,0.00008603228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006820747,0.00037241235,0.00056813494,0.0004811028,0.000767961,0.0014934315,0.0010881511,0.00080024486,0.008246496],"category_scores_gemma":[0.0014618628,0.00020467292,0.00046215314,0.0005892953,0.0016295445,0.0027874305,0.002442319,0.0016020829,0.0024309522],"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.00032040468,0.00010619101,0.00042594303,0.0001424003,0.000027571723,0.0002483986,0.00031765443,0.005867272,0.026107514,0.9216592,0.0043821614,0.040395264],"study_design_scores_gemma":[0.00025870328,0.00062409753,0.0012664488,0.00006779597,0.00009599117,0.0011162214,0.00016155923,0.14577964,0.15497977,0.52443314,0.1710603,0.00015630406],"about_ca_topic_score_codex":0.0005184176,"about_ca_topic_score_gemma":0.0005000624,"teacher_disagreement_score":0.008246496,"about_ca_system_score_codex":0.0010675489,"about_ca_system_score_gemma":0.0013663443,"threshold_uncertainty_score":0.027587354},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3033938,0.000531257,0.6364943,0.00075452495,0.00030959412,0.0004354691,0.0014736787,0.0056335595,0.050973807],"genre_scores_gemma":[0.5839471,0.00032174814,0.39390257,0.00021099811,0.00011885794,0.00021030563,0.0030399149,0.0013381226,0.016910376],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999243,0.00012756059,0.00004640542,0.00010880235,0.00030999485,0.0001642824],"domain_scores_gemma":[0.9988165,0.0003876166,0.00009431033,0.00040921694,0.00022947145,0.00006300922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006519001,0.0006070782,0.0008087561,0.0021329243,0.0013576361,0.0015820264,0.0010486201,0.00043293246,0.015775504],"category_scores_gemma":[0.0041062795,0.00032825017,0.00089142146,0.00205989,0.0010343042,0.002598297,0.0022238174,0.0014923611,0.0032616],"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.0007202732,0.00024968106,0.0028484806,0.00047377165,0.000042362208,0.00028778074,0.0008720653,0.029886296,0.014904443,0.3051903,0.019793523,0.624731],"study_design_scores_gemma":[0.0002508196,0.0003889215,0.00094578834,0.00013732593,0.00006432623,0.00041724622,0.0006182018,0.21848881,0.045628622,0.6618217,0.07113021,0.00010801227],"about_ca_topic_score_codex":0.0020128952,"about_ca_topic_score_gemma":0.0021843486,"teacher_disagreement_score":0.015775504,"about_ca_system_score_codex":0.0008983857,"about_ca_system_score_gemma":0.0014124452,"threshold_uncertainty_score":0.05277431},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056955155,0.0005199062,0.9170007,0.0017906086,0.00019832293,0.00039662223,0.0011113859,0.007574691,0.014452504],"genre_scores_gemma":[0.4076187,0.00031275323,0.5702669,0.0005728595,0.00030071763,0.00052452984,0.0032610353,0.0011602823,0.015982185],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9929426,0.0012677957,0.0006646602,0.002040675,0.0020626849,0.001021631],"domain_scores_gemma":[0.9831887,0.00883157,0.0008708055,0.004690917,0.0019510895,0.00046694346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037227145,0.0011797206,0.0013816837,0.001332878,0.0016054751,0.0035701324,0.0038456495,0.0017355534,0.018103234],"category_scores_gemma":[0.019329686,0.00074770156,0.0016235798,0.0023308042,0.0021811011,0.011455306,0.0048077214,0.0027538694,0.004891007],"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.0033622994,0.00073582906,0.0048894724,0.0009448764,0.00016996448,0.00027499333,0.0009803763,0.09976518,0.016653314,0.41487202,0.033996824,0.42335486],"study_design_scores_gemma":[0.00041858677,0.00023137091,0.0004976367,0.000055870412,0.000059886323,0.00026216608,0.00021293401,0.36984414,0.01029745,0.60688835,0.011169692,0.000061944906],"about_ca_topic_score_codex":0.0022144576,"about_ca_topic_score_gemma":0.0033484786,"teacher_disagreement_score":0.018103234,"about_ca_system_score_codex":0.0027091792,"about_ca_system_score_gemma":0.0033098592,"threshold_uncertainty_score":0.06056136},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53075117,0.0038401033,0.37531352,0.00064243365,0.0006686554,0.00033953556,0.0011528124,0.015915062,0.0713767],"genre_scores_gemma":[0.89453685,0.0003913407,0.09079053,0.00012330734,0.00005705331,0.000053783002,0.00066252495,0.000098844845,0.013285854],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99981433,0.000025388706,0.000010771344,0.000031713163,0.0000642258,0.0000535928],"domain_scores_gemma":[0.99987817,0.000026405138,0.0000144594005,0.00002587304,0.000041184125,0.00001382386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018561062,0.00051850826,0.0002957907,0.00061569747,0.00030630207,0.0005882779,0.0007535973,0.00026664737,0.013054114],"category_scores_gemma":[0.00032819886,0.00023009742,0.00020931073,0.0005207135,0.00014578804,0.00064895465,0.00025751465,0.00033957427,0.0019775473],"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.0029043532,0.000434714,0.0036147793,0.0009802533,0.00015043028,0.0010591792,0.0002946074,0.029167006,0.34555602,0.018497638,0.023127336,0.57421374],"study_design_scores_gemma":[0.0010099126,0.003085413,0.010374495,0.0002527352,0.00020203376,0.0023373528,0.0002397369,0.40628958,0.4648674,0.01083298,0.1003374,0.00017092652],"about_ca_topic_score_codex":0.0020744652,"about_ca_topic_score_gemma":0.0047204546,"teacher_disagreement_score":0.013054114,"about_ca_system_score_codex":0.0005934988,"about_ca_system_score_gemma":0.00078637415,"threshold_uncertainty_score":0.043670297},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5147335,0.0009714057,0.43846065,0.00016026842,0.00014451372,0.0002688269,0.00022579118,0.0095712785,0.03546369],"genre_scores_gemma":[0.88332725,0.00020111517,0.10731463,0.00007543387,0.000022718146,0.00006080973,0.00024973272,0.00010882177,0.008639468],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984133,0.000018501112,0.000010035625,0.00003893625,0.000059254897,0.000031988493],"domain_scores_gemma":[0.9998425,0.000032876414,0.000022854718,0.00004920061,0.000043318058,0.0000092073915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013673105,0.0004090561,0.0002245461,0.0004448769,0.00023873874,0.0005022661,0.0009231543,0.0002536964,0.004461962],"category_scores_gemma":[0.00032282498,0.00017724384,0.00027828952,0.00032098393,0.00022694208,0.0005589385,0.00036485743,0.00035544386,0.0008804981],"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.0007639637,0.00018104311,0.002817643,0.0005193244,0.000099810604,0.0004911768,0.00029791065,0.020137658,0.5794279,0.030424612,0.0044166553,0.36042237],"study_design_scores_gemma":[0.00018868092,0.0020131934,0.004965586,0.000078928926,0.00015902215,0.0015027534,0.00008799642,0.19262953,0.7512106,0.0063377433,0.040726542,0.000099367375],"about_ca_topic_score_codex":0.00054165215,"about_ca_topic_score_gemma":0.00088823936,"teacher_disagreement_score":0.004461962,"about_ca_system_score_codex":0.00033493032,"about_ca_system_score_gemma":0.00041572814,"threshold_uncertainty_score":0},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1521269,0.0028866932,0.768671,0.0011566291,0.0012113764,0.000250883,0.00040074438,0.00329171,0.070004165],"genre_scores_gemma":[0.7590797,0.0016421555,0.20208728,0.0003148158,0.00083077577,0.00011958169,0.0005437087,0.0003855582,0.034996413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979242,0.00042554364,0.000119246135,0.00027622684,0.0010251802,0.00022955851],"domain_scores_gemma":[0.9984724,0.00037912824,0.00009682251,0.0007010953,0.00026671897,0.000083909326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010012654,0.0007652985,0.0013551655,0.0011532207,0.0008141164,0.0022915832,0.0011330913,0.00083387765,0.008359703],"category_scores_gemma":[0.0024335855,0.00037090178,0.0008078861,0.0014542394,0.0013559374,0.0050299363,0.0027128612,0.0022417402,0.0030437778],"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.0008764337,0.0002635229,0.00046881725,0.00030189607,0.000057088197,0.00023386501,0.00028255978,0.018950846,0.034297474,0.6924559,0.006823902,0.24498774],"study_design_scores_gemma":[0.00023203311,0.0005423495,0.00086101063,0.00011738159,0.00015371125,0.0012980283,0.00013530202,0.16845597,0.071419,0.67874527,0.07787345,0.00016653279],"about_ca_topic_score_codex":0.00013431994,"about_ca_topic_score_gemma":0.00014656749,"teacher_disagreement_score":0.008359703,"about_ca_system_score_codex":0.0008751545,"about_ca_system_score_gemma":0.0007653612,"threshold_uncertainty_score":0.027965963},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33759877,0.0011394479,0.5704945,0.005525075,0.00029356717,0.00013545217,0.00021926087,0.0006585251,0.083935395],"genre_scores_gemma":[0.963841,0.00046349724,0.027518423,0.00033880316,0.00012533624,0.00007900879,0.000056651443,0.0000953839,0.0074819284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986312,0.00036699572,0.000042920776,0.00015822555,0.0005615658,0.00023901099],"domain_scores_gemma":[0.99679726,0.0014051469,0.0002698852,0.0012258317,0.00017657608,0.00012530711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018552567,0.00064812985,0.0011422618,0.0011643105,0.0011060328,0.0025142878,0.001553906,0.002052293,0.005680275],"category_scores_gemma":[0.005867405,0.00040168373,0.001042173,0.0007863198,0.00486092,0.009022471,0.002932076,0.00375245,0.00085420755],"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.000029307157,0.000018654042,0.00006553248,0.00001331537,0.000003740545,0.000045787765,0.000056428402,0.009689439,0.0007444644,0.98720944,0.00047699822,0.0016468762],"study_design_scores_gemma":[0.00001536348,0.000033130473,0.00004972164,0.000016436083,0.0000050739336,0.000066166576,0.000042834825,0.14702164,0.0012820397,0.850151,0.0013023325,0.000014283308],"about_ca_topic_score_codex":0.0007025339,"about_ca_topic_score_gemma":0.0007144589,"teacher_disagreement_score":0.005680275,"about_ca_system_score_codex":0.0016238511,"about_ca_system_score_gemma":0.0009519749,"threshold_uncertainty_score":0.019002378},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06308211,0.0020106407,0.85888654,0.0044421586,0.0006171459,0.00024501764,0.00092085806,0.0048200097,0.06497552],"genre_scores_gemma":[0.50926036,0.0017066707,0.43619496,0.0015504479,0.0011585737,0.0005856337,0.0026202775,0.0020661945,0.044856958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99618214,0.0008795086,0.0001943059,0.0007487817,0.0013333801,0.0006618568],"domain_scores_gemma":[0.99227315,0.0042087547,0.00031756368,0.002100103,0.00073339464,0.00036698612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025456075,0.0019066309,0.0015772961,0.0022696166,0.0016929779,0.007134674,0.0036030908,0.0017218654,0.025708985],"category_scores_gemma":[0.014199587,0.0007396198,0.0013713104,0.0032313936,0.0021490627,0.014356712,0.0042513334,0.0051691234,0.007072151],"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.0012305107,0.0005226818,0.0009958139,0.00048683953,0.00007030947,0.00009369042,0.0003450213,0.024321169,0.0057969843,0.6393643,0.038167257,0.28860545],"study_design_scores_gemma":[0.0001512058,0.00005409589,0.00019715405,0.00003742884,0.00003795273,0.00011036529,0.00008418182,0.09232478,0.0037287865,0.89505017,0.00819584,0.000028047025],"about_ca_topic_score_codex":0.002082384,"about_ca_topic_score_gemma":0.0031690353,"teacher_disagreement_score":0.025708985,"about_ca_system_score_codex":0.004431421,"about_ca_system_score_gemma":0.0029973255,"threshold_uncertainty_score":0.08600509},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22012298,0.0041803676,0.64877164,0.001192439,0.0015183913,0.00044332206,0.0012332796,0.04436891,0.078168735],"genre_scores_gemma":[0.6143078,0.0011462499,0.33201626,0.00043798127,0.00022384053,0.00020164247,0.0028975946,0.0014853975,0.047283173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994425,0.00007124106,0.000033924374,0.00006270637,0.00029404223,0.00009550761],"domain_scores_gemma":[0.99946517,0.00010931979,0.0000459304,0.00012686315,0.00022051428,0.000032270582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045857488,0.0009879777,0.00041116378,0.0010769715,0.00055623945,0.0009833744,0.0008187984,0.00048821885,0.01462368],"category_scores_gemma":[0.0017951193,0.00039093057,0.00040314588,0.0009248265,0.00037456685,0.0017249133,0.0012086298,0.001013786,0.0076044365],"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.001808717,0.00039902568,0.0030757852,0.00038557916,0.00012517098,0.000459329,0.00026530697,0.017193766,0.14145255,0.0413096,0.05064017,0.742885],"study_design_scores_gemma":[0.00057921576,0.0012422048,0.0032971909,0.0002573303,0.00020836998,0.000879757,0.00017863566,0.22754106,0.53326726,0.03948514,0.19291554,0.00014827917],"about_ca_topic_score_codex":0.0016417791,"about_ca_topic_score_gemma":0.0034678616,"teacher_disagreement_score":0.01462368,"about_ca_system_score_codex":0.0005479008,"about_ca_system_score_gemma":0.0013970436,"threshold_uncertainty_score":0.04892105},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39502954,0.0042900783,0.27504677,0.004106478,0.0018207496,0.00024269302,0.00066018006,0.00063929625,0.31816423],"genre_scores_gemma":[0.94190145,0.0009985217,0.023966994,0.0003109767,0.00063797634,0.000064021464,0.00022505317,0.00010655423,0.0317884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993368,0.00013544383,0.00004064815,0.00010899524,0.00026811,0.000109931425],"domain_scores_gemma":[0.99937916,0.00017488036,0.00010251872,0.00011561763,0.0001321138,0.000095563155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069325714,0.00057662826,0.00043100287,0.0013512933,0.00091859966,0.0019409234,0.00047879588,0.00044888543,0.009244793],"category_scores_gemma":[0.0019861753,0.00020529111,0.0007131515,0.0007617108,0.0032727772,0.0032072407,0.0020272774,0.0014963363,0.0016422708],"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.00002854627,0.00001408716,0.0001989206,0.000046526322,0.000004910287,0.00012309574,0.00023463133,0.0009061156,0.0011797189,0.9841372,0.0013707954,0.011755518],"study_design_scores_gemma":[0.000023980967,0.00005717512,0.00036545758,0.00002276352,0.000007219163,0.0003162924,0.0001258002,0.0047015906,0.0012770427,0.9743809,0.018706605,0.000015220452],"about_ca_topic_score_codex":0.0005233445,"about_ca_topic_score_gemma":0.0003743316,"teacher_disagreement_score":0.009244793,"about_ca_system_score_codex":0.0008954365,"about_ca_system_score_gemma":0.00055576535,"threshold_uncertainty_score":0.030926943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054884512,0.0025494911,0.89524424,0.0010231368,0.00064406416,0.00014238882,0.00068919355,0.00430359,0.040519323],"genre_scores_gemma":[0.5332921,0.0016007705,0.43534842,0.00055102893,0.0005851531,0.00030667096,0.0019245277,0.0016018593,0.024789458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820566,0.00038345056,0.00015394346,0.00022294321,0.00076757825,0.0002664131],"domain_scores_gemma":[0.9960437,0.0018690649,0.00017893732,0.0012387305,0.0005320986,0.00013748535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020038215,0.0012718859,0.0011568344,0.0016890664,0.0010520277,0.003606275,0.0020204461,0.0010632758,0.021741616],"category_scores_gemma":[0.013354822,0.000639408,0.0009345676,0.0024877812,0.0011099068,0.0106460005,0.0037762886,0.0029656347,0.0052663726],"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.0004522854,0.00020588083,0.0012908371,0.0004591709,0.00006046844,0.00023387684,0.00044465126,0.012052051,0.004811877,0.66720384,0.018845119,0.29394],"study_design_scores_gemma":[0.00011415974,0.000092453345,0.0002858743,0.00012456569,0.000052170126,0.00026498825,0.00013161541,0.045216177,0.0061180387,0.92708087,0.020479266,0.000039704915],"about_ca_topic_score_codex":0.000831934,"about_ca_topic_score_gemma":0.0023478891,"teacher_disagreement_score":0.021741616,"about_ca_system_score_codex":0.0012237092,"about_ca_system_score_gemma":0.0012503351,"threshold_uncertainty_score":0.072732985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32308468,0.0015518701,0.60137326,0.0016816731,0.00086785696,0.00038773674,0.00077186624,0.005057957,0.06522309],"genre_scores_gemma":[0.8541589,0.00065133226,0.12640767,0.00028421308,0.00029108592,0.00021332037,0.0011033294,0.00030042167,0.016589718],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992637,0.00011027545,0.000052385156,0.0000985329,0.00032182323,0.00015319927],"domain_scores_gemma":[0.9988293,0.00031653573,0.00011159886,0.0005189659,0.00016907605,0.000054554348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050876936,0.0006039514,0.00046772958,0.0007217935,0.00051711715,0.0009435536,0.00053238176,0.00057784107,0.007986102],"category_scores_gemma":[0.0025951946,0.00018297431,0.00052981847,0.0010104413,0.00092610065,0.0027229942,0.0019198302,0.0009645651,0.0023207664],"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.002470532,0.00030835916,0.0027871602,0.00046375298,0.00012849321,0.0012368833,0.001146303,0.03681298,0.13734409,0.3763215,0.024820033,0.41615993],"study_design_scores_gemma":[0.00030943492,0.0013347716,0.0018921477,0.00015723366,0.00015316963,0.0037235313,0.00072525925,0.20973961,0.38251647,0.3111763,0.08811833,0.00015378305],"about_ca_topic_score_codex":0.0003616566,"about_ca_topic_score_gemma":0.00038728095,"teacher_disagreement_score":0.007986102,"about_ca_system_score_codex":0.00046350906,"about_ca_system_score_gemma":0.0005965982,"threshold_uncertainty_score":0.026716173},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8500824,0.0013867441,0.089026645,0.0011240231,0.00011224124,0.00022906058,0.00055632007,0.00036200852,0.057120487],"genre_scores_gemma":[0.9670659,0.00083039555,0.021819733,0.0000964244,0.000056232588,0.000063802145,0.00054443296,0.000065600514,0.009457535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988569,0.00020938381,0.00006715261,0.0001793688,0.00039475798,0.00029242958],"domain_scores_gemma":[0.99709165,0.0012256982,0.00073725515,0.00055824756,0.00018033088,0.00020675844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010526894,0.0011097593,0.00078738836,0.0020684868,0.001315679,0.0020741404,0.00062820537,0.0011781731,0.009704187],"category_scores_gemma":[0.0059282132,0.00034011743,0.00082626357,0.0014661715,0.0020265942,0.004350915,0.0021244697,0.0018970718,0.0020690802],"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.0012423428,0.00024281882,0.006612234,0.0006807827,0.000065554734,0.0009528116,0.0010881326,0.055390432,0.049809515,0.815807,0.004070243,0.064038135],"study_design_scores_gemma":[0.00019201494,0.00028088118,0.0030983037,0.00021046701,0.00004999774,0.0016226382,0.00040056024,0.1058016,0.08327258,0.790827,0.014152252,0.000091704795],"about_ca_topic_score_codex":0.0002783466,"about_ca_topic_score_gemma":0.00041001104,"teacher_disagreement_score":0.009704187,"about_ca_system_score_codex":0.0013714972,"about_ca_system_score_gemma":0.0005649651,"threshold_uncertainty_score":0.03246367},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0828989,0.00047806217,0.90452164,0.00035496472,0.00010181229,0.00013604412,0.00019804141,0.0008148119,0.0104956655],"genre_scores_gemma":[0.4148619,0.00027135803,0.57709336,0.00017406957,0.000064993954,0.00018156039,0.0006026275,0.00018002333,0.0065701604],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828374,0.00039919539,0.00011816815,0.00025895156,0.0007837803,0.00015615714],"domain_scores_gemma":[0.998221,0.00082586176,0.00023602357,0.00045006233,0.00017727455,0.000089814894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011761928,0.000692742,0.0007456143,0.0014366255,0.0007820294,0.0018550087,0.0010815731,0.0008681063,0.0045293844],"category_scores_gemma":[0.007401942,0.0003483986,0.0004937118,0.0015100404,0.0010779836,0.0026738935,0.0022807699,0.0010777223,0.0017809236],"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.0014359967,0.00017485747,0.0013123107,0.00023072076,0.000056321576,0.0003801899,0.0003299276,0.06550417,0.03760937,0.42986575,0.0058720536,0.45722842],"study_design_scores_gemma":[0.00021583478,0.00043982387,0.0004684891,0.000110626446,0.0000396625,0.0009816737,0.00015393569,0.3323531,0.055630907,0.58809334,0.021425106,0.00008748952],"about_ca_topic_score_codex":0.00027967902,"about_ca_topic_score_gemma":0.00038750438,"teacher_disagreement_score":0.0045293844,"about_ca_system_score_codex":0.00085844076,"about_ca_system_score_gemma":0.0007731417,"threshold_uncertainty_score":0.015152335},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.252989,0.008358784,0.6782294,0.010740427,0.0013150545,0.00041215672,0.00017025464,0.0011776689,0.046607234],"genre_scores_gemma":[0.97522503,0.0010356987,0.020312628,0.00037311527,0.00024918467,0.0000713613,0.000038591366,0.000039484497,0.0026549043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.989986,0.003913862,0.00051458407,0.0008198552,0.003912804,0.0008529187],"domain_scores_gemma":[0.9803152,0.011256274,0.0016025408,0.005539789,0.00089821516,0.00038805688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006062324,0.00093048275,0.0012157619,0.0020735504,0.0021091276,0.0038002133,0.0011890669,0.0036921357,0.0032022018],"category_scores_gemma":[0.019314637,0.00057347916,0.0009616393,0.0017169121,0.0076311487,0.013486014,0.005041753,0.005005,0.00059082446],"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.00032340377,0.00005936407,0.001675539,0.00017816688,0.00007097338,0.00092709734,0.00085285987,0.015445507,0.0047947187,0.9434873,0.0024372938,0.02974766],"study_design_scores_gemma":[0.00009434941,0.00029630278,0.0005596739,0.00019586622,0.00010306237,0.0033792013,0.0004527813,0.13616234,0.025560183,0.8144265,0.018701024,0.00006877131],"about_ca_topic_score_codex":0.00026667485,"about_ca_topic_score_gemma":0.00008189777,"teacher_disagreement_score":0.006062324,"about_ca_system_score_codex":0.0021721697,"about_ca_system_score_gemma":0.00069229555,"threshold_uncertainty_score":0.03206104},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11698669,0.005716104,0.802182,0.0025795554,0.0016173758,0.0006375951,0.0005351596,0.0027696833,0.06697596],"genre_scores_gemma":[0.5961442,0.0025197533,0.36074302,0.000760571,0.0009525615,0.00036714887,0.00093303685,0.00025479312,0.03732492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986513,0.0002892006,0.0001214366,0.00020426682,0.00054645794,0.00018731799],"domain_scores_gemma":[0.9982595,0.00040178432,0.00012494103,0.0008288984,0.0002725298,0.00011233411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001291591,0.0007451177,0.00066828215,0.00079664344,0.0011411182,0.002275458,0.0012727155,0.0010960073,0.0101102535],"category_scores_gemma":[0.003863723,0.00042279172,0.00047988468,0.0010359397,0.0010641904,0.0043500704,0.002725768,0.0026837054,0.0034778505],"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.001034504,0.00041847455,0.00042331193,0.00038336235,0.00005321056,0.00039821048,0.00047118813,0.0050493153,0.05540851,0.619326,0.015170784,0.30186304],"study_design_scores_gemma":[0.00069527794,0.0011330748,0.00078626187,0.00021545865,0.00014237723,0.004463743,0.00025742318,0.08158539,0.1138476,0.64224416,0.1544628,0.00016643551],"about_ca_topic_score_codex":0.0001267067,"about_ca_topic_score_gemma":0.00032234646,"teacher_disagreement_score":0.0101102535,"about_ca_system_score_codex":0.00079482584,"about_ca_system_score_gemma":0.0009882239,"threshold_uncertainty_score":0.03382218},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16135228,0.00022445574,0.80950624,0.0004805956,0.00007921532,0.00012458055,0.00032351675,0.0006871044,0.027222075],"genre_scores_gemma":[0.6608696,0.00026986175,0.32848495,0.00019795015,0.000052912128,0.00017023637,0.00066718535,0.00025169502,0.009035578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924076,0.00017751218,0.00007739979,0.0001382854,0.00026321056,0.000102754006],"domain_scores_gemma":[0.9985001,0.00048688342,0.00026888837,0.0004374786,0.00024034479,0.00006629146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075535197,0.00034644658,0.00024293156,0.0008275581,0.00067923125,0.00153792,0.0006665727,0.0005699247,0.0027079582],"category_scores_gemma":[0.004897452,0.00022507508,0.00051822985,0.0010608364,0.0013680552,0.0030152118,0.0014158572,0.0011365121,0.00076273136],"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.00009841111,0.000028343804,0.00061292807,0.000059824757,0.000006698481,0.00008611578,0.0002440316,0.0028233198,0.008092801,0.9294358,0.0013773823,0.057134334],"study_design_scores_gemma":[0.00003909938,0.00014442325,0.000534905,0.000069481706,0.000029111165,0.0008038943,0.0001899161,0.03541421,0.03473819,0.9008941,0.027084848,0.00005777489],"about_ca_topic_score_codex":0.00021655667,"about_ca_topic_score_gemma":0.00028486483,"teacher_disagreement_score":0.0027079582,"about_ca_system_score_codex":0.0006842933,"about_ca_system_score_gemma":0.00072187366,"threshold_uncertainty_score":0.009059012},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025642607,0.0011028275,0.9629814,0.0001623396,0.00016624929,0.00016023543,0.00015559103,0.003720632,0.005908138],"genre_scores_gemma":[0.13861358,0.0005912549,0.84998626,0.00007857174,0.00008802748,0.00018032102,0.00037382162,0.0006529132,0.00943523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992663,0.00011050451,0.000066833396,0.000113701964,0.0003697202,0.00007286321],"domain_scores_gemma":[0.9987883,0.00025724628,0.00010189002,0.0005467265,0.00026563572,0.00004018256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007683533,0.0008553361,0.00080487586,0.0011416924,0.00055258686,0.0009797502,0.0011311038,0.0006848146,0.0072544897],"category_scores_gemma":[0.0033264917,0.00035103425,0.00090980594,0.0010643211,0.0004551267,0.0027023263,0.0011207077,0.001216993,0.003030136],"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.0005280156,0.00011560191,0.0012623095,0.00039112655,0.000076661105,0.00019331614,0.00033121055,0.01899056,0.07037989,0.06313282,0.0055458364,0.8390528],"study_design_scores_gemma":[0.00030415147,0.0009389651,0.0039788918,0.00027323983,0.00018115959,0.0020644816,0.0002595256,0.45439467,0.26417568,0.10474818,0.16839784,0.00028318958],"about_ca_topic_score_codex":0.0010056457,"about_ca_topic_score_gemma":0.001997167,"teacher_disagreement_score":0.0072544897,"about_ca_system_score_codex":0.0006233425,"about_ca_system_score_gemma":0.0010411935,"threshold_uncertainty_score":0.024268687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03971419,0.00072589325,0.93621653,0.00031847507,0.0004388939,0.00012261675,0.0002634671,0.001750031,0.020449763],"genre_scores_gemma":[0.28113374,0.00041622907,0.7015134,0.00021287089,0.00023214883,0.00017563031,0.0006836397,0.00071581616,0.014916525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886084,0.00020077074,0.00008284384,0.00018556911,0.00057862705,0.0000913759],"domain_scores_gemma":[0.9988147,0.0002970635,0.00012494091,0.00042982062,0.00025532782,0.00007830728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089706114,0.00070170214,0.0004914796,0.00097604486,0.00065742084,0.0019123717,0.00077794143,0.00054267765,0.012224042],"category_scores_gemma":[0.004203012,0.00031202595,0.00053044327,0.000904998,0.0012415602,0.0035931126,0.001881328,0.0014559736,0.005240482],"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.00036648783,0.00006327111,0.0010643766,0.000521503,0.000028506232,0.00023167017,0.00035877075,0.013339792,0.039522927,0.7127073,0.012463556,0.21933183],"study_design_scores_gemma":[0.00007545139,0.0003323384,0.00091079605,0.0002290122,0.000043708285,0.000885825,0.00021162802,0.18521646,0.091352634,0.5635904,0.1570596,0.00009206587],"about_ca_topic_score_codex":0.00026594943,"about_ca_topic_score_gemma":0.0005871217,"teacher_disagreement_score":0.012224042,"about_ca_system_score_codex":0.0007146162,"about_ca_system_score_gemma":0.0007719028,"threshold_uncertainty_score":0.040893495},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018736934,0.09597323,0.097210586,0.39579487,0.012579988,0.00010782607,0.00035050712,0.000546615,0.37869948],"genre_scores_gemma":[0.6564228,0.111824706,0.08952103,0.03472706,0.015756812,0.00025300216,0.0003118082,0.00044690835,0.09073582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962411,0.0015904292,0.00017755695,0.00041732,0.001362168,0.00021146772],"domain_scores_gemma":[0.99569356,0.0021146291,0.00032574066,0.0008188144,0.00070093904,0.00034639024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006097721,0.00073700206,0.0004798156,0.0014797272,0.002619305,0.006595177,0.00067248195,0.0038243204,0.005003115],"category_scores_gemma":[0.012444617,0.00048655257,0.0003562134,0.0017637132,0.014322787,0.018628722,0.0035880152,0.009461317,0.00293736],"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.000026113532,0.000009901441,0.00007901126,0.000037358743,0.0000024102162,0.000045841472,0.0002351034,0.00025461987,0.00010934711,0.9709141,0.0120312,0.016254788],"study_design_scores_gemma":[0.000014334869,0.00002127745,0.00010197779,0.00012385659,0.0000018875537,0.00017062732,0.00013700839,0.0008154058,0.00018735812,0.866078,0.13233653,0.000011686778],"about_ca_topic_score_codex":0.0006325467,"about_ca_topic_score_gemma":0.0005763582,"teacher_disagreement_score":0.006595177,"about_ca_system_score_codex":0.004713092,"about_ca_system_score_gemma":0.0019269264,"threshold_uncertainty_score":0.03419602},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45458466,0.0007161326,0.5256814,0.0015146119,0.00017512035,0.00018010447,0.00039015926,0.0021440482,0.014613745],"genre_scores_gemma":[0.8676566,0.00021925231,0.126396,0.0001047605,0.000114308474,0.000037108442,0.00047598497,0.00012475702,0.0048711263],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989222,0.00017518993,0.00006819987,0.00020022129,0.00044226926,0.00019184288],"domain_scores_gemma":[0.99742895,0.0012595911,0.00025118006,0.0005750452,0.0002612335,0.00022410238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015105696,0.0007762822,0.0010279949,0.0013145681,0.00077394117,0.0026656548,0.0012353543,0.00087561127,0.004715808],"category_scores_gemma":[0.009376273,0.00027667312,0.0007683951,0.0014086135,0.0015523658,0.0048628626,0.002205217,0.0020433879,0.000910047],"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.0011926986,0.00048418442,0.02391113,0.00075618445,0.0001704543,0.0013800671,0.001232887,0.33272573,0.024722932,0.2653007,0.012961576,0.33516148],"study_design_scores_gemma":[0.00012523135,0.00013489259,0.0015076015,0.0000280361,0.000025325971,0.00021727987,0.00021095992,0.7053831,0.012662165,0.27663428,0.0030452267,0.000025850712],"about_ca_topic_score_codex":0.0015229152,"about_ca_topic_score_gemma":0.003031437,"teacher_disagreement_score":0.004715808,"about_ca_system_score_codex":0.0017055236,"about_ca_system_score_gemma":0.0013979605,"threshold_uncertainty_score":0.015775919},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5392758,0.00047965068,0.4106659,0.0005040593,0.00045984105,0.0003335189,0.00033205934,0.006050339,0.041898802],"genre_scores_gemma":[0.88321674,0.00012341297,0.10828974,0.00013726832,0.00005685099,0.00014684025,0.0003838461,0.00030532625,0.0073400736],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922884,0.00017265418,0.00005928737,0.000116726784,0.0002553,0.00016720418],"domain_scores_gemma":[0.9988902,0.0002472199,0.00011831156,0.00049179094,0.00018796252,0.000064572574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010347861,0.0006485444,0.00052231096,0.0005382944,0.00066113827,0.000999414,0.0007973828,0.0006279441,0.011549361],"category_scores_gemma":[0.0025748217,0.000327818,0.00037253805,0.00066212605,0.0008352148,0.0026315814,0.0017130474,0.0012049485,0.0027248866],"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.0034842258,0.0015007695,0.012520564,0.0008440452,0.00019046436,0.00090339995,0.0011786934,0.060784124,0.24102561,0.2524247,0.016475828,0.4086676],"study_design_scores_gemma":[0.00066221313,0.0021877661,0.0026266978,0.000115325325,0.00010185513,0.00093820767,0.00030743008,0.28098977,0.4837148,0.16118294,0.06706296,0.00011005763],"about_ca_topic_score_codex":0.00018167672,"about_ca_topic_score_gemma":0.00026004284,"teacher_disagreement_score":0.011549361,"about_ca_system_score_codex":0.00047152885,"about_ca_system_score_gemma":0.0006456871,"threshold_uncertainty_score":0.038636446},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12431191,0.001046629,0.83799726,0.0007541481,0.000206146,0.00022020916,0.0001587118,0.005403797,0.029901244],"genre_scores_gemma":[0.5560959,0.0004159053,0.43451166,0.00022146801,0.00012977372,0.00018556991,0.0003016964,0.00026406313,0.0078740055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987587,0.00020823837,0.00009808934,0.00017536715,0.000564008,0.00019562872],"domain_scores_gemma":[0.9988716,0.0003116989,0.00013287032,0.0004458519,0.0001718514,0.00006610245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007028453,0.0009130486,0.00057700125,0.0008785433,0.00066069333,0.0015956768,0.0013575429,0.00061033457,0.0071973647],"category_scores_gemma":[0.002499733,0.00033242296,0.0005677084,0.00084246736,0.00097604905,0.0028444768,0.001798619,0.0015594043,0.0032122203],"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.0016335426,0.00035460867,0.0029958768,0.00054926367,0.00008618214,0.00058702193,0.00065515947,0.024422128,0.13211824,0.33227432,0.008735851,0.49558783],"study_design_scores_gemma":[0.00066903955,0.0014052032,0.0018354759,0.00023783775,0.00010627535,0.00246159,0.00024840064,0.32555497,0.2806324,0.32454515,0.062136777,0.00016682126],"about_ca_topic_score_codex":0.00038330109,"about_ca_topic_score_gemma":0.00063520216,"teacher_disagreement_score":0.0071973647,"about_ca_system_score_codex":0.0010293042,"about_ca_system_score_gemma":0.0008862148,"threshold_uncertainty_score":0.024077535},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38422525,0.005033484,0.503761,0.004163214,0.00058403943,0.000873423,0.0007584827,0.0013459304,0.099255174],"genre_scores_gemma":[0.90314656,0.0013343063,0.08614582,0.00035375208,0.00029249387,0.0005262869,0.00030207404,0.000318538,0.0075800098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97673833,0.011185657,0.0016715726,0.002008344,0.005174307,0.003221764],"domain_scores_gemma":[0.91824836,0.0498228,0.005717999,0.022662655,0.0025475887,0.0010006926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022028422,0.0015585137,0.0017720043,0.0029917108,0.0024201504,0.006610691,0.0030112439,0.0028782221,0.008122595],"category_scores_gemma":[0.049936622,0.00121973,0.0016172003,0.002623902,0.005814965,0.02314096,0.008907801,0.006171334,0.001916522],"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.0024095385,0.00023607389,0.005079459,0.00034108103,0.00016290566,0.00044676353,0.00075978634,0.028147522,0.012435702,0.8907379,0.003021348,0.056221955],"study_design_scores_gemma":[0.0003229213,0.0007917849,0.0019778395,0.0002507803,0.00028736368,0.0012317122,0.00042700925,0.14054917,0.03984739,0.79686004,0.017230429,0.00022357801],"about_ca_topic_score_codex":0.00041866416,"about_ca_topic_score_gemma":0.0003273945,"teacher_disagreement_score":0.022028422,"about_ca_system_score_codex":0.0043273643,"about_ca_system_score_gemma":0.00391329,"threshold_uncertainty_score":0.11649877},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028805686,0.00034767558,0.9441534,0.0007986204,0.00025124193,0.00019525677,0.000047735055,0.0007352319,0.02466511],"genre_scores_gemma":[0.405588,0.0003955768,0.57701814,0.00030035918,0.00018707583,0.0002602119,0.0001324238,0.00022147053,0.01589673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970817,0.0007562477,0.0001884338,0.00037446458,0.0013446936,0.00025450494],"domain_scores_gemma":[0.99619067,0.0011303392,0.00021641873,0.001957375,0.0003800633,0.0001251572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026616899,0.00052287505,0.0009657937,0.0012143146,0.0011305802,0.0014212419,0.0018791372,0.0011468612,0.0070712874],"category_scores_gemma":[0.0059814127,0.00044852955,0.0008561034,0.0007378757,0.0033150418,0.004558961,0.005542766,0.0031176733,0.001627088],"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.00020858744,0.00013934211,0.0004259252,0.00022935956,0.000035997895,0.00022764,0.00041760996,0.01042452,0.02762449,0.87323916,0.002488902,0.08453839],"study_design_scores_gemma":[0.00015470873,0.0003548928,0.0004060811,0.000073589064,0.000044867513,0.0012969264,0.00029727042,0.22443502,0.08032105,0.63949937,0.053002227,0.00011404242],"about_ca_topic_score_codex":0.00018574731,"about_ca_topic_score_gemma":0.00027573985,"teacher_disagreement_score":0.0070712874,"about_ca_system_score_codex":0.0009866557,"about_ca_system_score_gemma":0.0010603468,"threshold_uncertainty_score":0.023655832},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095412605,0.00028041363,0.87711465,0.0015573374,0.00016718476,0.0002208896,0.000144348,0.0028733748,0.022229167],"genre_scores_gemma":[0.6212695,0.00014945737,0.3686518,0.0003175828,0.00009773874,0.00014696004,0.00023742011,0.00021721274,0.008912273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989039,0.00020655763,0.00006384569,0.0002596948,0.00036864902,0.00019734638],"domain_scores_gemma":[0.99849796,0.00053246634,0.000113190166,0.0005317701,0.00021372727,0.00011084093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009853767,0.00047445117,0.0005533867,0.0007566578,0.0007527127,0.0015229661,0.0014949014,0.0010508677,0.008019126],"category_scores_gemma":[0.002843625,0.00021514544,0.0006169025,0.00086062716,0.0014818558,0.0025438138,0.0022974133,0.0019238162,0.0016018563],"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.0010565626,0.00045103935,0.0019212145,0.00022343968,0.00006722435,0.0002057367,0.00065238855,0.029216206,0.043671004,0.6130849,0.010907688,0.29854268],"study_design_scores_gemma":[0.0005800606,0.00040011623,0.0007946864,0.000039254923,0.00007240261,0.00036263297,0.00029476904,0.46153945,0.058323376,0.4527942,0.024699617,0.000099413744],"about_ca_topic_score_codex":0.0015281512,"about_ca_topic_score_gemma":0.0018014773,"teacher_disagreement_score":0.008019126,"about_ca_system_score_codex":0.0015321289,"about_ca_system_score_gemma":0.002494883,"threshold_uncertainty_score":0.02682662},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037330315,0.0002717556,0.90754825,0.00027292225,0.00035545975,0.00006776935,0.00015226135,0.006881734,0.047119584],"genre_scores_gemma":[0.30987656,0.00027739807,0.65059817,0.00018929591,0.000089781075,0.000057500176,0.00036199202,0.0018191923,0.03673018],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950814,0.00007204,0.000026181087,0.000058754227,0.00026252534,0.0000723283],"domain_scores_gemma":[0.9994981,0.00012245521,0.00002340156,0.00019510744,0.00013354035,0.00002736011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005142797,0.00055061106,0.00069192785,0.0010134025,0.0006446206,0.0014830728,0.0011740598,0.000766685,0.02177467],"category_scores_gemma":[0.0019316614,0.00032098885,0.00044255838,0.0009362364,0.00070941244,0.0021416547,0.0017752639,0.00088899134,0.0073833545],"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.0003569666,0.00012365919,0.00084054004,0.00019089034,0.000043035998,0.00034138156,0.0004058999,0.011744922,0.046308562,0.27555338,0.019098878,0.6449918],"study_design_scores_gemma":[0.00027733154,0.00035806771,0.0009014849,0.00014794858,0.00008504719,0.0017235138,0.0004405381,0.31484812,0.1271727,0.40821669,0.14566955,0.00015904811],"about_ca_topic_score_codex":0.0005131591,"about_ca_topic_score_gemma":0.0010209685,"teacher_disagreement_score":0.02177467,"about_ca_system_score_codex":0.00039968127,"about_ca_system_score_gemma":0.00059281895,"threshold_uncertainty_score":0.07284355},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005717557,0.0002998192,0.9797006,0.00043579878,0.00009013407,0.00017336523,0.00013367592,0.0011196915,0.012329394],"genre_scores_gemma":[0.13530926,0.00040553862,0.855023,0.0002972657,0.000077952944,0.00027399376,0.00039776802,0.00069004943,0.007525253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966785,0.0010942857,0.00019502104,0.00037106124,0.0012266785,0.0004346214],"domain_scores_gemma":[0.9976012,0.00066999684,0.00013042115,0.0011983733,0.00032214966,0.000077760706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002010652,0.0013298063,0.0009476191,0.0011490318,0.00084510894,0.0020880846,0.002318949,0.00086186215,0.0070297066],"category_scores_gemma":[0.0060566287,0.0007351405,0.0013600452,0.0016742925,0.0015944297,0.003984883,0.0028003436,0.0049786256,0.0027936886],"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.0003195636,0.00029607926,0.0008072725,0.00036967348,0.000109726294,0.0001340697,0.0003880442,0.11563133,0.020071136,0.53165436,0.0137083605,0.31651038],"study_design_scores_gemma":[0.00012340654,0.00019736716,0.0003326646,0.00010459184,0.00006350044,0.00018866773,0.00017604024,0.6028454,0.028799346,0.308485,0.05859881,0.00008520636],"about_ca_topic_score_codex":0.0028384756,"about_ca_topic_score_gemma":0.003919354,"teacher_disagreement_score":0.0070297066,"about_ca_system_score_codex":0.0018629548,"about_ca_system_score_gemma":0.003468966,"threshold_uncertainty_score":0.023516715},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5462735,0.00064567564,0.43287447,0.00068023836,0.00014101958,0.00016399077,0.00046961274,0.0031533132,0.01559807],"genre_scores_gemma":[0.7908889,0.0004522163,0.1992209,0.00014047726,0.00013070801,0.00008518483,0.0012196911,0.00066796824,0.0071939374],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992692,0.00010067981,0.0000777727,0.00017471475,0.00020627247,0.0001712956],"domain_scores_gemma":[0.9984994,0.00064419373,0.00018332593,0.00039589358,0.00016721236,0.000110040404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009069079,0.0014219373,0.0013166254,0.003344248,0.0007727098,0.0024735206,0.0013366924,0.0010896827,0.0069186967],"category_scores_gemma":[0.0055029504,0.0004875761,0.0011299954,0.0019954029,0.0015195213,0.0055002836,0.00394311,0.002171121,0.0015940428],"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.00095839106,0.00038408043,0.016615033,0.0007559319,0.0001444223,0.001570412,0.0030565765,0.06351955,0.028512634,0.3568439,0.008884059,0.518755],"study_design_scores_gemma":[0.00022077099,0.00028434442,0.003542075,0.00011617726,0.00008181641,0.00070710276,0.00066646474,0.16871881,0.025166474,0.7828711,0.017507648,0.00011709459],"about_ca_topic_score_codex":0.0010295135,"about_ca_topic_score_gemma":0.001308837,"teacher_disagreement_score":0.0069186967,"about_ca_system_score_codex":0.0011908647,"about_ca_system_score_gemma":0.00088078587,"threshold_uncertainty_score":0.023145378},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25706345,0.00039429025,0.72128594,0.0014606316,0.00011788481,0.00023509459,0.0001952204,0.002943862,0.016303703],"genre_scores_gemma":[0.6792591,0.00034888482,0.3119187,0.0002279747,0.00008956211,0.00016817657,0.0004116122,0.00041167877,0.007164375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729174,0.00043680958,0.00017805165,0.00056298473,0.001090862,0.00043938783],"domain_scores_gemma":[0.99390066,0.0026010682,0.00040057665,0.0023355896,0.00054836995,0.00021373319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023148167,0.0006259692,0.0012617458,0.0010436818,0.0011134191,0.0036871296,0.0014280337,0.0011849046,0.005583483],"category_scores_gemma":[0.010343127,0.00046337923,0.0012135699,0.0012108756,0.0021533885,0.006489483,0.003922937,0.003080608,0.0017460006],"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.0010143719,0.00050156034,0.0038985529,0.00032650682,0.00015703372,0.00029216107,0.001255566,0.03579214,0.03640866,0.64150894,0.004326839,0.27451774],"study_design_scores_gemma":[0.00034782453,0.0002483,0.0011279746,0.000044386532,0.00010815866,0.00035667708,0.000437882,0.1844395,0.058716197,0.7408195,0.013274898,0.000078661215],"about_ca_topic_score_codex":0.000739047,"about_ca_topic_score_gemma":0.00086056767,"teacher_disagreement_score":0.005583483,"about_ca_system_score_codex":0.0020961692,"about_ca_system_score_gemma":0.0023608564,"threshold_uncertainty_score":0.018678665},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0466258,0.0040545845,0.5671048,0.01317158,0.0026193613,0.00014951768,0.00038410776,0.00034317363,0.3655471],"genre_scores_gemma":[0.5286822,0.004441318,0.29887226,0.00505066,0.0027674409,0.00031546943,0.00042176645,0.0003652895,0.15908358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956137,0.00009429619,0.000016163993,0.00006651163,0.0001899522,0.00007165061],"domain_scores_gemma":[0.99972194,0.0000903542,0.00002077142,0.00006113823,0.00007489505,0.000030918054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006948215,0.0006190679,0.00061565137,0.0015080953,0.0010155424,0.0014902275,0.0016572122,0.0011183764,0.0091605075],"category_scores_gemma":[0.0018431944,0.00025945887,0.00089352357,0.0010400484,0.0028371315,0.003331651,0.0023285854,0.003271205,0.0026440397],"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.000006497723,0.000012553544,0.000048027654,0.000030337667,0.0000032625835,0.000020602787,0.00007370083,0.0013008523,0.00033084294,0.98883307,0.002247238,0.0070930407],"study_design_scores_gemma":[0.00001140346,0.000012835764,0.00005865301,0.000019833193,0.0000035994278,0.00004310135,0.00003391851,0.0128107155,0.0004917304,0.97085965,0.015643176,0.000011441346],"about_ca_topic_score_codex":0.0015615209,"about_ca_topic_score_gemma":0.0023737294,"teacher_disagreement_score":0.0091605075,"about_ca_system_score_codex":0.0014021258,"about_ca_system_score_gemma":0.0011102421,"threshold_uncertainty_score":0.030645013},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22650361,0.0006603596,0.7503229,0.00014135458,0.000121531244,0.000124344,0.00016322825,0.0029080578,0.01905472],"genre_scores_gemma":[0.77360713,0.00030716794,0.21858996,0.00011123676,0.00004793532,0.00008815452,0.00034223948,0.00008105012,0.006825134],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999167,0.000012909231,0.0000066668626,0.000016402742,0.000033642726,0.000013712926],"domain_scores_gemma":[0.99990773,0.000015857724,0.00001543611,0.000019519252,0.00003428415,0.000007207213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010520732,0.00027390127,0.0001740509,0.00025770647,0.00016388093,0.00028857013,0.00055190944,0.0001644308,0.0029785014],"category_scores_gemma":[0.00019684313,0.000106124746,0.00019044147,0.00036964862,0.00013925247,0.00038747428,0.0002492615,0.00023560955,0.0008825618],"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.00043390295,0.00016126162,0.0013426102,0.00040490244,0.00006285505,0.00045736026,0.00013325704,0.039102677,0.64390624,0.027883517,0.0044935695,0.28161785],"study_design_scores_gemma":[0.00012371523,0.0025878712,0.0028899624,0.000068449284,0.00014472222,0.0018575462,0.00011002716,0.4628646,0.4716522,0.0105865635,0.047054727,0.000059655744],"about_ca_topic_score_codex":0.0002330412,"about_ca_topic_score_gemma":0.0007588978,"teacher_disagreement_score":0.0029785014,"about_ca_system_score_codex":0.00018017105,"about_ca_system_score_gemma":0.00056149316,"threshold_uncertainty_score":0.0099641085},"labels":[],"label_agreement":null},{"id":"W3108917887","doi":"10.1007/s13389-020-00245-4","title":"x-only point addition formula and faster compressed SIKE","year":2020,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Royal Bank of Canada","keywords":"Point (geometry); Mathematics; Computer science; Geometry","score_opus":0.00704499768570218,"score_gpt":0.18271925261994246,"score_spread":0.17567425493424027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108917887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36914334,0.0022380238,0.5377611,0.002139599,0.0011889979,0.00035072173,0.0006071613,0.005166126,0.08140496],"genre_scores_gemma":[0.83849245,0.0004952016,0.12793453,0.00070153695,0.0002766374,0.00013253957,0.00053375715,0.0002473154,0.031185953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994962,0.000060076778,0.00003385754,0.00009199327,0.00022239127,0.000095581265],"domain_scores_gemma":[0.9995414,0.00013908868,0.000036683152,0.00017073043,0.00008754321,0.00002455609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031347535,0.0006560636,0.00069297676,0.0006137924,0.00059783517,0.0011156874,0.0006533596,0.00067766453,0.012346498],"category_scores_gemma":[0.0011612732,0.0002479394,0.0004117148,0.0008865129,0.0007463408,0.0026346394,0.0013215779,0.0009953717,0.0018582129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023644187,0.0002958745,0.0010257566,0.00037602973,0.00009487422,0.0009866698,0.00031400129,0.018228823,0.096736364,0.5291809,0.019016756,0.33137962],"study_design_scores_gemma":[0.00089565164,0.0011880652,0.0017513176,0.00023168609,0.00026492812,0.0033375719,0.00034224303,0.28316742,0.23803133,0.4104824,0.060111783,0.00019557624],"about_ca_topic_score_codex":0.00063391007,"about_ca_topic_score_gemma":0.0012480887,"teacher_disagreement_score":0.012346498,"about_ca_system_score_codex":0.0006048085,"about_ca_system_score_gemma":0.0010653178,"threshold_uncertainty_score":0.041303158},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035896193,0.00028052207,0.9506758,0.0013328529,0.00018865088,0.00018242207,0.00004921581,0.000702826,0.010691649],"genre_scores_gemma":[0.7207096,0.00044823013,0.27162096,0.00046548367,0.00024726463,0.00017671392,0.00016540274,0.000119828146,0.0060465643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99324894,0.0024006863,0.00037883493,0.0008318218,0.002457338,0.0006824575],"domain_scores_gemma":[0.99316376,0.0016589771,0.00052280596,0.0030160614,0.0012096324,0.00042871758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061655287,0.00059823727,0.0011542405,0.0015694735,0.0011316258,0.00288744,0.0026256882,0.0022170965,0.0041168383],"category_scores_gemma":[0.00851338,0.00067649403,0.0007857225,0.0010966413,0.0046388884,0.0060823746,0.0073331455,0.0050152764,0.0023488798],"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.00045936622,0.00020006443,0.0007914588,0.00016352937,0.000036784375,0.00051517325,0.0006375497,0.016680133,0.018784976,0.91496575,0.003158959,0.043606296],"study_design_scores_gemma":[0.0002160851,0.00034329877,0.00025362556,0.00009337235,0.000042596817,0.0008783689,0.00018342104,0.3728905,0.04335184,0.5585466,0.023099039,0.000101251455],"about_ca_topic_score_codex":0.00045930874,"about_ca_topic_score_gemma":0.0002200675,"teacher_disagreement_score":0.0061655287,"about_ca_system_score_codex":0.0010612528,"about_ca_system_score_gemma":0.0014109785,"threshold_uncertainty_score":0.03260684},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009673556,0.00015645125,0.9804581,0.00020706431,0.00013857112,0.00016057602,0.00010807802,0.0025221484,0.006575418],"genre_scores_gemma":[0.098516114,0.00021179882,0.89217305,0.00018133433,0.00010418508,0.00021099542,0.00046528465,0.0005243029,0.007612925],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988115,0.00019649584,0.00013032,0.00018888606,0.0005299527,0.0001427866],"domain_scores_gemma":[0.99877816,0.00026750463,0.00012412318,0.00044607092,0.0003188217,0.00006536436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075883884,0.00095736916,0.00078146585,0.0014792982,0.00082182663,0.0018337631,0.0012698283,0.0008495658,0.011152151],"category_scores_gemma":[0.003539776,0.00039197152,0.00068147696,0.0011797396,0.0009934674,0.0025379825,0.0021810045,0.0015894028,0.0069542658],"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.00048099097,0.00015560561,0.0004211322,0.00025324384,0.000031465093,0.00028207724,0.0003338635,0.007632468,0.054454762,0.12919778,0.012214475,0.79454213],"study_design_scores_gemma":[0.0005146965,0.0011248617,0.0008217198,0.0002619564,0.00011422172,0.0031590816,0.00042714318,0.21651953,0.2434513,0.37860087,0.15466669,0.00033790144],"about_ca_topic_score_codex":0.00031663518,"about_ca_topic_score_gemma":0.00047491584,"teacher_disagreement_score":0.011152151,"about_ca_system_score_codex":0.0005548346,"about_ca_system_score_gemma":0.0010384277,"threshold_uncertainty_score":0.03730768},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6521126,0.004328133,0.15414335,0.002743974,0.00080336945,0.00009140075,0.0004609585,0.00088971975,0.18442647],"genre_scores_gemma":[0.9539625,0.0015234217,0.027172802,0.0001824915,0.000649234,0.000030737905,0.00026011534,0.00010930277,0.016109388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991517,0.00015376683,0.000042229505,0.0001326304,0.00035453818,0.00016501415],"domain_scores_gemma":[0.9991592,0.00016923517,0.00011686802,0.00028703245,0.00015043835,0.00011720217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001280751,0.00067507394,0.0009499539,0.0022233392,0.0010736964,0.002509091,0.0010041187,0.0006825692,0.008260273],"category_scores_gemma":[0.002451872,0.00026037355,0.00055444683,0.0017278838,0.002455831,0.0053574154,0.0031884916,0.001962529,0.0017495038],"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.00026091203,0.0000385136,0.00056060776,0.000078876525,0.000011930639,0.00021732408,0.0002919218,0.012547244,0.004865605,0.9447933,0.0024393296,0.033894334],"study_design_scores_gemma":[0.000067476365,0.00013990831,0.00086837594,0.000060389,0.000021652102,0.00025629238,0.00013031502,0.048573412,0.0056594587,0.9279304,0.016248204,0.00004409268],"about_ca_topic_score_codex":0.00068274623,"about_ca_topic_score_gemma":0.00072181725,"teacher_disagreement_score":0.008260273,"about_ca_system_score_codex":0.0017672039,"about_ca_system_score_gemma":0.00065363676,"threshold_uncertainty_score":0.027633369},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12436282,0.0029515561,0.8157113,0.000964363,0.0002565742,0.00022181256,0.00011934129,0.0018677255,0.053544477],"genre_scores_gemma":[0.59602284,0.0015917504,0.39154726,0.00016410733,0.00018993841,0.00018296586,0.00020318695,0.00027913824,0.009818787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950457,0.00010337192,0.00004318835,0.00007468264,0.00020625064,0.00006797345],"domain_scores_gemma":[0.99960166,0.00014209478,0.00006803376,0.0001338218,0.000037000602,0.000017304596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059303915,0.00070351304,0.0005325533,0.0007918763,0.0006307043,0.0014395323,0.00048382694,0.00048696436,0.0068503576],"category_scores_gemma":[0.0021328868,0.00034126674,0.00042507905,0.00088672154,0.00095104985,0.0029764131,0.0013543862,0.0011078824,0.0026671789],"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.00034501957,0.00010660528,0.000644906,0.00042043027,0.000019203257,0.00038987954,0.0003572756,0.01128649,0.06732636,0.6850997,0.0048774327,0.22912675],"study_design_scores_gemma":[0.00015396802,0.0004970376,0.0005623254,0.00027522328,0.00005237285,0.0019825783,0.0001651483,0.11926074,0.14339796,0.59971607,0.13384527,0.00009128439],"about_ca_topic_score_codex":0.00006129454,"about_ca_topic_score_gemma":0.00012567968,"teacher_disagreement_score":0.0068503576,"about_ca_system_score_codex":0.0005098828,"about_ca_system_score_gemma":0.00028422268,"threshold_uncertainty_score":0.022916734},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08384731,0.0012430208,0.901212,0.0002845483,0.00022607381,0.00015500365,0.00011716269,0.002523141,0.010391732],"genre_scores_gemma":[0.58255243,0.00048080695,0.40843132,0.00016218857,0.00008730879,0.000115265415,0.0002033669,0.000051562667,0.007915778],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99989295,0.000016865788,0.0000073636356,0.000026852222,0.00004231798,0.000013646095],"domain_scores_gemma":[0.9998988,0.000018634613,0.000014603756,0.000019557889,0.000040755338,0.000007576091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001549444,0.00038857252,0.00023286106,0.00047045268,0.00043511012,0.00035771378,0.00071569334,0.00032861152,0.0040703965],"category_scores_gemma":[0.00030196295,0.00015403108,0.00018809795,0.0003861766,0.00019688238,0.00077278784,0.00024032919,0.00036413124,0.0011415629],"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.00043148914,0.00018004252,0.00095488236,0.000345007,0.00006991577,0.00044869308,0.00018282635,0.011153655,0.47845927,0.019999595,0.0046506724,0.48312402],"study_design_scores_gemma":[0.000263646,0.0018695473,0.0024585614,0.00013712845,0.0001548261,0.0035693203,0.00012118855,0.2981102,0.59688234,0.009436297,0.086867854,0.00012906606],"about_ca_topic_score_codex":0.0004207745,"about_ca_topic_score_gemma":0.0010073474,"teacher_disagreement_score":0.0040703965,"about_ca_system_score_codex":0.00027838533,"about_ca_system_score_gemma":0.00055969495,"threshold_uncertainty_score":0.01361686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27739254,0.0011688535,0.7150073,0.00057673315,0.00018557161,0.00016255937,0.00011410221,0.0017661621,0.0036261075],"genre_scores_gemma":[0.7894253,0.0003585821,0.20417316,0.00021400208,0.00012643366,0.000121056546,0.00018179277,0.000050832423,0.0053487257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995747,0.0000706297,0.00005799782,0.00007667615,0.00017188596,0.000048078626],"domain_scores_gemma":[0.9979881,0.00060233084,0.0005236393,0.00038613912,0.00044933852,0.000050451374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054091925,0.00041640358,0.00041402158,0.0010099828,0.0007490801,0.0007257274,0.0008264679,0.000655127,0.0018586764],"category_scores_gemma":[0.0022015225,0.0002007326,0.00032176214,0.00053452194,0.0006003178,0.0015882893,0.00073486276,0.00057876104,0.0004200279],"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.0019268452,0.00030209444,0.0039738873,0.00046104644,0.0000966416,0.0010823387,0.0008646279,0.042057324,0.25545987,0.12792477,0.003596729,0.56225383],"study_design_scores_gemma":[0.00036313283,0.00331388,0.004369069,0.00026227237,0.00023482741,0.0028381161,0.00024257503,0.4013271,0.45149863,0.105107345,0.030232172,0.00021083285],"about_ca_topic_score_codex":0.00058033975,"about_ca_topic_score_gemma":0.0008350477,"teacher_disagreement_score":0.0018586764,"about_ca_system_score_codex":0.0007843893,"about_ca_system_score_gemma":0.0008814755,"threshold_uncertainty_score":0.006217897},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0367789,0.0021202273,0.93745136,0.0006566085,0.0002858357,0.00012145387,0.0002931146,0.0033854137,0.01890708],"genre_scores_gemma":[0.4495194,0.0014662634,0.5262851,0.00043508588,0.00043087592,0.0002729935,0.0007693041,0.00083490013,0.019986145],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909556,0.00016157977,0.000063831816,0.00010600218,0.0004297701,0.0001432606],"domain_scores_gemma":[0.9989298,0.0005036775,0.000072173134,0.00030934936,0.00015252295,0.000032451375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057380286,0.00084849866,0.0011442957,0.0010550332,0.00069656415,0.0017451132,0.0013555055,0.00065091794,0.00801982],"category_scores_gemma":[0.0030967705,0.0003772011,0.00076356146,0.0023290773,0.00094396184,0.003237366,0.0017004432,0.0017676094,0.0020941792],"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.0008349531,0.00025602223,0.0008054288,0.00039018184,0.00011361156,0.00015891038,0.00029391778,0.12981872,0.026583454,0.24932417,0.02124513,0.57017547],"study_design_scores_gemma":[0.000081293256,0.00014718216,0.00035893143,0.000061883475,0.000046061763,0.00016899608,0.00012377655,0.76471525,0.02578606,0.20011874,0.008348196,0.000043564924],"about_ca_topic_score_codex":0.0015472524,"about_ca_topic_score_gemma":0.005235006,"teacher_disagreement_score":0.00801982,"about_ca_system_score_codex":0.001089071,"about_ca_system_score_gemma":0.0012442732,"threshold_uncertainty_score":0.026829004},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06615218,0.0042698025,0.10720335,0.00783178,0.0019747096,0.00044922603,0.0056656506,0.0077624233,0.79869086],"genre_scores_gemma":[0.6718076,0.0034352385,0.08830442,0.0014509581,0.0015281374,0.0003977929,0.012652713,0.0016767397,0.2187464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964785,0.00071619044,0.0002269823,0.0004242161,0.0017274221,0.00042665328],"domain_scores_gemma":[0.99691534,0.00031019258,0.00018374095,0.0014727698,0.00096064364,0.00015740977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020051599,0.0011783179,0.0016257246,0.0031850727,0.0035801954,0.0037855778,0.0010401942,0.0021209116,0.034489106],"category_scores_gemma":[0.0070717265,0.00062835956,0.0006742673,0.00305433,0.0017685496,0.0047166566,0.0027604168,0.0030075696,0.025552541],"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.0007054463,0.00015130376,0.0009297148,0.0003121622,0.00003052343,0.00012230629,0.00025245914,0.0031634185,0.00660483,0.776983,0.08774902,0.12299574],"study_design_scores_gemma":[0.00015315322,0.00020820707,0.001283702,0.00029445987,0.000058828482,0.0007099681,0.00017103835,0.010529068,0.03435275,0.4573463,0.49476802,0.00012446627],"about_ca_topic_score_codex":0.0013101839,"about_ca_topic_score_gemma":0.0013117859,"teacher_disagreement_score":0.034489106,"about_ca_system_score_codex":0.002319186,"about_ca_system_score_gemma":0.003690191,"threshold_uncertainty_score":0.115377545},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23816991,0.005841853,0.73003256,0.0019672273,0.0005097116,0.00018840168,0.00027299786,0.0046163173,0.018400928],"genre_scores_gemma":[0.7347883,0.0024245998,0.25079912,0.00029262085,0.0004025445,0.00011127289,0.0006154471,0.00058517675,0.009980852],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921775,0.00012181596,0.000055726643,0.00011629836,0.00039271385,0.0000956751],"domain_scores_gemma":[0.99866235,0.0005536941,0.00009722885,0.00045466737,0.00019823773,0.000033764703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074568746,0.000702726,0.0007360293,0.0013485414,0.0005052848,0.0015130615,0.0006923137,0.000616921,0.008772945],"category_scores_gemma":[0.0028873328,0.00024485393,0.00029968063,0.0013486659,0.0007502578,0.005037129,0.001192108,0.0014197526,0.0024188557],"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.0020951699,0.00022113106,0.0010227386,0.00050578127,0.00004697097,0.00042285287,0.00059160363,0.02364694,0.22073644,0.20569941,0.009151039,0.53585994],"study_design_scores_gemma":[0.00023565786,0.00042845026,0.0013301927,0.00010623073,0.000050379072,0.0009971794,0.00028758793,0.34302005,0.45428324,0.16555479,0.033630893,0.00007533482],"about_ca_topic_score_codex":0.000289723,"about_ca_topic_score_gemma":0.0002858554,"teacher_disagreement_score":0.008772945,"about_ca_system_score_codex":0.0006311409,"about_ca_system_score_gemma":0.00046732405,"threshold_uncertainty_score":0.029348433},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6430274,0.0015854219,0.2729525,0.00045085754,0.00034584652,0.00023923202,0.00035194907,0.007585534,0.07346128],"genre_scores_gemma":[0.94004834,0.00029557158,0.05186577,0.000076210956,0.000037848422,0.000048042733,0.00022391677,0.00010775259,0.007296536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956554,0.00007438191,0.00002400284,0.00005804349,0.00017608624,0.00010200501],"domain_scores_gemma":[0.9996363,0.000077287965,0.0000388827,0.00016005062,0.000069643094,0.000017902774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031339438,0.0004955414,0.0003579277,0.00059081346,0.00036918873,0.0008666154,0.0006781003,0.00026125656,0.006988365],"category_scores_gemma":[0.00076659734,0.00017075731,0.00028113206,0.0005906133,0.00042093702,0.0011083516,0.00041791232,0.0004157771,0.0015053529],"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.0023515506,0.00038367696,0.005870615,0.0007383752,0.00012406262,0.0011107213,0.00044688425,0.084522456,0.22730705,0.16141596,0.012595746,0.50313294],"study_design_scores_gemma":[0.0004988418,0.0019047791,0.0074168923,0.00020188763,0.00013333297,0.0013981581,0.00015228381,0.32863632,0.52203053,0.043661892,0.09384177,0.00012322256],"about_ca_topic_score_codex":0.00082270184,"about_ca_topic_score_gemma":0.0009580846,"teacher_disagreement_score":0.006988365,"about_ca_system_score_codex":0.00072547747,"about_ca_system_score_gemma":0.0006171713,"threshold_uncertainty_score":0.023378432},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3803625,0.0028249444,0.52794486,0.0020387014,0.0006134715,0.00041646516,0.0011579781,0.015936343,0.0687047],"genre_scores_gemma":[0.82946986,0.00056109426,0.14941227,0.00047331653,0.00022277734,0.0001602354,0.0016532395,0.0005672726,0.017479934],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888164,0.0001143909,0.000068516856,0.00016670402,0.00056007114,0.00020875357],"domain_scores_gemma":[0.9988129,0.00027247946,0.000112381065,0.0005842891,0.00016549126,0.000052448635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005739937,0.000665793,0.00087959116,0.000857897,0.0004779944,0.0013899913,0.00081245217,0.00049581256,0.011760207],"category_scores_gemma":[0.0022223715,0.00023132552,0.00047991966,0.0009793194,0.0007407791,0.0036388345,0.0022330966,0.0014569598,0.003990066],"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.0025717514,0.0005266898,0.0015659989,0.0005389758,0.000085867,0.0008577832,0.0004229691,0.024340514,0.15728699,0.3393157,0.025438134,0.4470486],"study_design_scores_gemma":[0.00071216794,0.0013895264,0.001993836,0.00020653487,0.0001648209,0.0024916213,0.00035343572,0.3055969,0.41290754,0.21103121,0.0629584,0.0001941239],"about_ca_topic_score_codex":0.0004452284,"about_ca_topic_score_gemma":0.00057334604,"teacher_disagreement_score":0.011760207,"about_ca_system_score_codex":0.00061248394,"about_ca_system_score_gemma":0.0008598312,"threshold_uncertainty_score":0.039341807},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06483088,0.00085140637,0.9215843,0.00019088566,0.00017545125,0.000100582576,0.00011153785,0.0011370503,0.011017849],"genre_scores_gemma":[0.35033914,0.0006669993,0.63495636,0.00011151058,0.0000714735,0.00014022634,0.00030094193,0.00010792618,0.013305403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979657,0.00003366748,0.000019262197,0.00004585843,0.0000814146,0.00002321387],"domain_scores_gemma":[0.9998698,0.000022030596,0.000013839244,0.00003297849,0.00005611007,0.000005182337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022222473,0.000431736,0.00031028435,0.0007017306,0.00037579006,0.00088102336,0.0005212901,0.00046188294,0.0056425105],"category_scores_gemma":[0.0004501555,0.00016730573,0.00042819232,0.0005849927,0.00023680182,0.0011193346,0.00023861861,0.00042007037,0.0019699559],"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.0005737276,0.0001227065,0.0017487735,0.0005234835,0.00015344705,0.00037352144,0.00027299853,0.042110063,0.21538472,0.13417366,0.005362933,0.59919983],"study_design_scores_gemma":[0.00019509265,0.0011468123,0.002797816,0.00014088939,0.00018380453,0.0024379457,0.00015854613,0.5463415,0.29532093,0.03738116,0.1137624,0.00013308147],"about_ca_topic_score_codex":0.0007326231,"about_ca_topic_score_gemma":0.0010524503,"teacher_disagreement_score":0.0056425105,"about_ca_system_score_codex":0.0004817677,"about_ca_system_score_gemma":0.0006156115,"threshold_uncertainty_score":0.018876076},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10875963,0.014965087,0.6969701,0.0037597814,0.0008579334,0.0011384224,0.0013776093,0.0018622548,0.17030913],"genre_scores_gemma":[0.4575315,0.02582885,0.48111424,0.0011062971,0.0009377572,0.000939131,0.0024130591,0.00042007986,0.029709091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99611366,0.0008180599,0.0005700936,0.0005424143,0.0014750547,0.00048066248],"domain_scores_gemma":[0.9967243,0.00061768375,0.00046369463,0.0011080371,0.00066123635,0.0004250737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025681122,0.0015257398,0.0009454452,0.0052823233,0.0030046944,0.004886284,0.0013065906,0.002203977,0.0038537907],"category_scores_gemma":[0.0056638974,0.00068662514,0.0010262824,0.005675292,0.0032054682,0.009549969,0.0040766783,0.0039307876,0.002061346],"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.00003127964,0.00004086589,0.001047017,0.00017052643,0.000008179798,0.00025012606,0.00062440615,0.0012660001,0.0016500829,0.95250136,0.0024166887,0.03999345],"study_design_scores_gemma":[0.000023821785,0.00022591502,0.0011521737,0.00040287923,0.000022676086,0.0037522335,0.0006283919,0.0065307408,0.003278557,0.7166012,0.26729658,0.00008473123],"about_ca_topic_score_codex":0.00031775894,"about_ca_topic_score_gemma":0.00018439314,"teacher_disagreement_score":0.0052823233,"about_ca_system_score_codex":0.0010409683,"about_ca_system_score_gemma":0.0014338244,"threshold_uncertainty_score":0.013581634},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2906953,0.003211804,0.64476955,0.00068515964,0.00063255423,0.00035412097,0.00045008166,0.0050105103,0.05419082],"genre_scores_gemma":[0.77838206,0.0006632969,0.20297253,0.00020126211,0.00009526536,0.00013112323,0.0004502616,0.00007604559,0.017028093],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99984455,0.000028716096,0.0000107675505,0.000028904413,0.000058282036,0.000028737575],"domain_scores_gemma":[0.9999038,0.000014070347,0.000014382575,0.000019410283,0.000039767234,0.000008527816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001332574,0.0004155738,0.0002384212,0.00049374,0.00035827985,0.0004896807,0.00054057216,0.00029834275,0.007866585],"category_scores_gemma":[0.00034977624,0.00013768114,0.00017869711,0.00035916094,0.0001540725,0.00066713995,0.0002676374,0.000307619,0.0020402642],"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.0013986884,0.00018678591,0.0025176918,0.00068893435,0.00011593438,0.0016825898,0.00042639993,0.02175458,0.40237865,0.049129363,0.0162706,0.50344986],"study_design_scores_gemma":[0.00038605163,0.00332214,0.0046694516,0.00024665208,0.00016288161,0.006472362,0.00029297435,0.24796697,0.5521248,0.015267544,0.16894883,0.00013926649],"about_ca_topic_score_codex":0.00049919187,"about_ca_topic_score_gemma":0.0009710796,"teacher_disagreement_score":0.007866585,"about_ca_system_score_codex":0.0003299422,"about_ca_system_score_gemma":0.00045505792,"threshold_uncertainty_score":0.026316345},"labels":[],"label_agreement":null},{"id":"W3213153633","doi":"10.1007/s13389-022-00287-w","title":"Rethinking modular multi-exponentiation in real-world applications","year":2022,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Modular exponentiation; Exponentiation; Computer science; Cryptography; Parallel computing; Side channel attack; Theoretical computer science; Arithmetic; Algorithm; Public-key cryptography; Mathematics; Encryption; Computer security","score_opus":0.014409619445672915,"score_gpt":0.23511993082946617,"score_spread":0.22071031138379324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213153633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14215423,0.008547467,0.792498,0.010356408,0.0042438856,0.00016029795,0.0001359968,0.004034449,0.03786927],"genre_scores_gemma":[0.7828549,0.00284978,0.19770052,0.002037048,0.001197336,0.00005315632,0.00014222074,0.0011407858,0.012024288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748105,0.0008147512,0.0002282786,0.0004057307,0.0008000142,0.0002701512],"domain_scores_gemma":[0.99211216,0.0028283766,0.00020459364,0.0038078902,0.0008698684,0.0001770656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003553814,0.0008619361,0.00066368125,0.0007978095,0.0009874409,0.0030342443,0.0017112226,0.0014399326,0.0063184225],"category_scores_gemma":[0.016357696,0.00055681285,0.00071351044,0.00068675436,0.0027425324,0.010970778,0.005067474,0.0038280839,0.0031121636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006167476,0.00020139787,0.0020857088,0.00049992965,0.000083317194,0.0005825063,0.0009222923,0.017513203,0.038144194,0.5815497,0.008525812,0.34927523],"study_design_scores_gemma":[0.000093231676,0.00032974203,0.0005195608,0.00032644684,0.00008099514,0.0010170025,0.00031035466,0.07441543,0.033047147,0.7763738,0.11340033,0.00008584662],"about_ca_topic_score_codex":0.00016497624,"about_ca_topic_score_gemma":0.00036572755,"teacher_disagreement_score":0.0063184225,"about_ca_system_score_codex":0.00050165533,"about_ca_system_score_gemma":0.0007251481,"threshold_uncertainty_score":0.021137238},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002742486,0.004753056,0.037182488,0.0014139516,0.0027688832,0.000077659315,0.00025057766,0.00039615223,0.95041466],"genre_scores_gemma":[0.057664048,0.0061468347,0.020132275,0.00086546683,0.0017748568,0.0001711112,0.0006298586,0.00046264776,0.91215295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99940574,0.00013438394,0.000030268686,0.00011778807,0.00024200114,0.00006987749],"domain_scores_gemma":[0.999739,0.00006106468,0.000014911876,0.00008643441,0.00006661755,0.000032028925],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00047716338,0.0012099105,0.00084289897,0.0017354831,0.002251934,0.0034074024,0.0007698698,0.0008864707,0.06568705],"category_scores_gemma":[0.0012191312,0.0005028232,0.00053498446,0.0018579068,0.0025518844,0.0051752552,0.0024065513,0.0031026732,0.03886405],"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.000016574924,0.000017015662,0.000024692092,0.00007834478,0.0000035623186,0.000026007125,0.00013989396,0.00021260828,0.0004657852,0.8837943,0.050066266,0.06515496],"study_design_scores_gemma":[0.000007452848,0.000021727998,0.000049199774,0.0000754774,0.0000046547284,0.00019142614,0.000056907786,0.00037800908,0.00078315445,0.44519207,0.5532293,0.000010553328],"about_ca_topic_score_codex":0.00027790613,"about_ca_topic_score_gemma":0.00036059966,"teacher_disagreement_score":0.93431294,"about_ca_system_score_codex":0.0011938507,"about_ca_system_score_gemma":0.0008966005,"threshold_uncertainty_score":0},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079326846,0.0006875279,0.9076595,0.00018787077,0.0001333566,0.00015544258,0.0000965559,0.00090283726,0.010850184],"genre_scores_gemma":[0.46513578,0.0003251755,0.5275098,0.00010964404,0.000056167682,0.000102911305,0.00015197125,0.000038805207,0.006569728],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998702,0.000022950648,0.000009238439,0.000030744766,0.00005077001,0.000016071426],"domain_scores_gemma":[0.9998778,0.000022466833,0.000022790708,0.00001816318,0.00004962089,0.00000923481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016309867,0.00035257472,0.00025029076,0.00042263075,0.0004033592,0.00047369875,0.00057704386,0.00035149892,0.003731442],"category_scores_gemma":[0.00043527756,0.0001555816,0.00024613988,0.00045709015,0.0001619363,0.0006504426,0.00023151927,0.00032835503,0.0010126628],"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.0007346259,0.00015893477,0.0010716383,0.00046612814,0.00007503709,0.0004271151,0.00017457732,0.029950453,0.5093774,0.044685468,0.0038927584,0.40898582],"study_design_scores_gemma":[0.0002947384,0.002559761,0.0024955175,0.00015082426,0.00019000962,0.003020861,0.0001397181,0.46028078,0.43302894,0.017351637,0.08035664,0.00013051383],"about_ca_topic_score_codex":0.00034274947,"about_ca_topic_score_gemma":0.00093128765,"teacher_disagreement_score":0.003731442,"about_ca_system_score_codex":0.00036200017,"about_ca_system_score_gemma":0.00062829605,"threshold_uncertainty_score":0.012482882},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.618841,0.0033948836,0.28796533,0.0035885938,0.00036659653,0.0003069462,0.00030618501,0.0007884699,0.08444206],"genre_scores_gemma":[0.95761395,0.0010741968,0.026194302,0.00019637849,0.00021929218,0.00010552332,0.00009059867,0.000044453143,0.014461371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893945,0.00023212237,0.000056893638,0.00018348054,0.00034833868,0.00023965958],"domain_scores_gemma":[0.99940443,0.00024136378,0.000105571715,0.00011743449,0.00007414811,0.00005716579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074974506,0.0004144366,0.0006255577,0.001335654,0.0011929452,0.0019554687,0.00053976406,0.00089071796,0.0029266442],"category_scores_gemma":[0.0017389453,0.00017665753,0.00047388117,0.0013783441,0.0030445852,0.004215732,0.0022888235,0.0017473532,0.00063233025],"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.00017892501,0.00005868557,0.00075260084,0.00009154148,0.000020341027,0.00048889633,0.0005881442,0.0072378507,0.008374821,0.95784914,0.0010755339,0.023283437],"study_design_scores_gemma":[0.00032732097,0.0005324364,0.002267229,0.0002173371,0.00008767666,0.003002446,0.00072969776,0.10082497,0.052745778,0.76803315,0.07105201,0.00018005152],"about_ca_topic_score_codex":0.0007412318,"about_ca_topic_score_gemma":0.000433074,"teacher_disagreement_score":0.0029266442,"about_ca_system_score_codex":0.0015256824,"about_ca_system_score_gemma":0.001332979,"threshold_uncertainty_score":0.011069655},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3055034,0.001308165,0.66936004,0.00060468575,0.00022721066,0.0001562483,0.00020720472,0.0011134465,0.021519618],"genre_scores_gemma":[0.8294304,0.00041317006,0.161706,0.00014377388,0.000053704858,0.00008286048,0.0001521975,0.000033244305,0.007984582],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99992204,0.000016695365,0.0000058832084,0.000015415057,0.000029438635,0.00001056476],"domain_scores_gemma":[0.99987566,0.000019718442,0.000037689715,0.00001814448,0.00004109876,0.000007714344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001481773,0.00035233685,0.00015279907,0.00028581943,0.00021340985,0.00030728278,0.0005386865,0.00023056782,0.0031831993],"category_scores_gemma":[0.0003627076,0.000119756405,0.00014936167,0.0004110901,0.00016729393,0.0006121869,0.00021506689,0.0002787266,0.0007955593],"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.001037081,0.0001620895,0.00219488,0.0006059957,0.00006472852,0.0008168757,0.00022039232,0.03738882,0.6328647,0.086205356,0.009480873,0.22895823],"study_design_scores_gemma":[0.000275111,0.0027510235,0.0029454771,0.00019068288,0.0001276947,0.0026513794,0.00012611125,0.40374193,0.48841718,0.02022688,0.078465596,0.00008101434],"about_ca_topic_score_codex":0.00016295504,"about_ca_topic_score_gemma":0.00042040003,"teacher_disagreement_score":0.0031831993,"about_ca_system_score_codex":0.0002997449,"about_ca_system_score_gemma":0.00049658684,"threshold_uncertainty_score":0.010648847},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113104746,0.0017713932,0.85998803,0.0002825326,0.00013876316,0.00012601618,0.00012448037,0.0009951637,0.023468854],"genre_scores_gemma":[0.5473357,0.0011835014,0.44568077,0.00010663451,0.00006027781,0.00013050526,0.00030237253,0.000067010384,0.0051333024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998791,0.00003192089,0.000010914048,0.000018948174,0.000041345666,0.000017692624],"domain_scores_gemma":[0.99982125,0.000057144327,0.000027491697,0.000022345434,0.000063877575,0.000007911555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018797065,0.00041191993,0.00018773924,0.000331996,0.00030562386,0.0005125756,0.00043963187,0.0002057218,0.0026991821],"category_scores_gemma":[0.00041153454,0.00010508069,0.00026372465,0.0006111705,0.00017290955,0.00040650624,0.00021705196,0.0002990761,0.0006248495],"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.0002653735,0.00012802181,0.0025857997,0.000631372,0.00009312684,0.00053068675,0.00038758546,0.1260514,0.15246762,0.095041156,0.005523751,0.61629397],"study_design_scores_gemma":[0.000112055466,0.0019174216,0.0016858657,0.00014911342,0.00016466485,0.0017287506,0.00029585423,0.713353,0.15947051,0.04195429,0.0791166,0.000051937277],"about_ca_topic_score_codex":0.0005573385,"about_ca_topic_score_gemma":0.001238651,"teacher_disagreement_score":0.0026991821,"about_ca_system_score_codex":0.00032620307,"about_ca_system_score_gemma":0.0007425878,"threshold_uncertainty_score":0.009029686},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026221413,0.39376998,0.052737094,0.004328409,0.002789866,0.00012351516,0.0004857744,0.0010990335,0.54204416],"genre_scores_gemma":[0.038152006,0.65029496,0.05645508,0.0018045771,0.010895646,0.00016431221,0.0013519543,0.00053556514,0.2403459],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993211,0.00011025644,0.000054106586,0.00009242348,0.0003473076,0.000074894655],"domain_scores_gemma":[0.99945647,0.00018786723,0.000033323264,0.00009041424,0.00017996733,0.00005201549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005615539,0.0011181339,0.0009563668,0.0056876596,0.001066952,0.004317719,0.0007719712,0.001314165,0.027362438],"category_scores_gemma":[0.0010910616,0.00052807125,0.000493075,0.009445971,0.0012735832,0.0070767403,0.0013582517,0.00226003,0.01691381],"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.000036803758,0.00007544241,0.00023422301,0.0010257834,0.0000144588585,0.00007655538,0.00011950397,0.0014753164,0.0011316044,0.36434582,0.13567358,0.49579087],"study_design_scores_gemma":[0.000006327594,0.00001958397,0.00021051698,0.00029897277,0.0000062486047,0.0002921822,0.000046008307,0.0012172911,0.00031829203,0.103426635,0.8941454,0.000012487006],"about_ca_topic_score_codex":0.0012773059,"about_ca_topic_score_gemma":0.0017852376,"teacher_disagreement_score":0.027362438,"about_ca_system_score_codex":0.001732016,"about_ca_system_score_gemma":0.0018694513,"threshold_uncertainty_score":0.09153646},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3054382,0.0018452981,0.6166677,0.0020741092,0.0010553732,0.00039933674,0.00045364987,0.008773479,0.06329279],"genre_scores_gemma":[0.7415868,0.00048723808,0.2150408,0.0004611993,0.00019913039,0.00012520728,0.00038223682,0.000102187696,0.0416151],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999175,0.000011845148,0.0000060131993,0.000017227128,0.000027539952,0.000019907106],"domain_scores_gemma":[0.9999286,0.000013593871,0.0000092672435,0.000013371278,0.000025188674,0.000010046009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001148673,0.00026277392,0.00021010393,0.00041543003,0.00039070795,0.0006107518,0.000589231,0.0004658423,0.011230425],"category_scores_gemma":[0.00028861497,0.00018269921,0.00021078193,0.00027984363,0.00014859514,0.00042986442,0.00029884608,0.00032162722,0.0026340317],"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.00090836827,0.00021107469,0.0015004904,0.00029637731,0.000120431665,0.0014366169,0.0002734447,0.010513056,0.5355215,0.03780916,0.015422887,0.3959867],"study_design_scores_gemma":[0.00089528674,0.0043282076,0.0058915615,0.00017223554,0.00021777349,0.0058709895,0.00020801088,0.21458587,0.5607301,0.015691388,0.19127299,0.0001355573],"about_ca_topic_score_codex":0.0005952062,"about_ca_topic_score_gemma":0.0012617272,"teacher_disagreement_score":0.011230425,"about_ca_system_score_codex":0.00034948892,"about_ca_system_score_gemma":0.0005174887,"threshold_uncertainty_score":0.037569582},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71039474,0.011098457,0.11480216,0.032227322,0.0025763826,0.00010696544,0.0003858615,0.00028795813,0.12812024],"genre_scores_gemma":[0.9705258,0.0032626812,0.008257578,0.00047499736,0.0020642371,0.000070105285,0.00014660327,0.00005044797,0.015147604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811316,0.0007615841,0.00008677084,0.00027500995,0.00041968617,0.00034388687],"domain_scores_gemma":[0.9969303,0.0017176393,0.00040606124,0.00039396537,0.00016722654,0.00038483017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022474162,0.00112758,0.0021503312,0.0028371774,0.0038256303,0.0069382144,0.0013283037,0.0032652696,0.006092293],"category_scores_gemma":[0.008341937,0.0007955741,0.001029011,0.0035238,0.009955608,0.015856251,0.006283316,0.0060707973,0.0009464542],"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.00011149742,0.00003214018,0.0002821411,0.00004327174,0.000008395211,0.0001854064,0.00025166594,0.0022457368,0.00023182236,0.989876,0.0013169765,0.0054150247],"study_design_scores_gemma":[0.000016855129,0.000009373779,0.000058426995,0.00001230035,0.0000032455648,0.00006757559,0.000057853616,0.0024548522,0.00011952868,0.9960659,0.0011250923,0.000009010937],"about_ca_topic_score_codex":0.00055697263,"about_ca_topic_score_gemma":0.00038784198,"teacher_disagreement_score":0.0069382144,"about_ca_system_score_codex":0.0020854163,"about_ca_system_score_gemma":0.0012866742,"threshold_uncertainty_score":0.020380735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1275158,0.0004691733,0.860536,0.00021954945,0.000116765965,0.00012676917,0.00006724741,0.0007179244,0.010230783],"genre_scores_gemma":[0.7214928,0.00031977962,0.2723204,0.0001137562,0.000065274,0.00013380688,0.000086166845,0.00005155941,0.0054164617],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998703,0.00002969542,0.000011856523,0.000023680921,0.00004730783,0.000017156703],"domain_scores_gemma":[0.99974054,0.00005557742,0.00006730483,0.0000416569,0.00008362892,0.000011239091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021053349,0.00030689983,0.00019538331,0.00028078945,0.00019921732,0.00055986113,0.0006772856,0.00024339896,0.00225026],"category_scores_gemma":[0.00053659827,0.0001358375,0.00018742445,0.00026751164,0.00019384683,0.0005044064,0.00026399887,0.00032132442,0.0005949331],"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.00056345743,0.00015923062,0.0012516237,0.0004893636,0.00008211152,0.0005433789,0.00042750433,0.053547524,0.580372,0.094848335,0.0034136055,0.26430187],"study_design_scores_gemma":[0.00022819823,0.003681521,0.0016409587,0.0001773292,0.00015460867,0.0018408238,0.00014194983,0.47079074,0.45017806,0.017378002,0.05372342,0.00006434387],"about_ca_topic_score_codex":0.00014748843,"about_ca_topic_score_gemma":0.00028307905,"teacher_disagreement_score":0.00225026,"about_ca_system_score_codex":0.00030705903,"about_ca_system_score_gemma":0.0004478865,"threshold_uncertainty_score":0.007527828},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7492693,0.0030335838,0.20649628,0.0005103375,0.00023181357,0.00009694534,0.0004343438,0.0012052536,0.03872217],"genre_scores_gemma":[0.96443427,0.00045787293,0.03230508,0.000034774865,0.000025085668,0.00002808082,0.00009063096,0.000015987203,0.0026081987],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99993134,0.0000067679985,0.0000044506846,0.000012942199,0.00003436667,0.000010194735],"domain_scores_gemma":[0.99992144,0.000021256605,0.000017561244,0.000014432155,0.000017882248,0.000007453221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006423979,0.00023001144,0.00026973852,0.000261622,0.00022475793,0.00054541416,0.0005832512,0.0002704508,0.0022765235],"category_scores_gemma":[0.00017388286,0.000102287566,0.00022739585,0.00037722578,0.00016325785,0.0006835056,0.0002876321,0.00022864528,0.0005280131],"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.00034482486,0.000108914704,0.0012361879,0.00039459707,0.00011361393,0.0005401012,0.00013928411,0.023124425,0.83468485,0.04925004,0.0028793106,0.08718374],"study_design_scores_gemma":[0.00009853114,0.0012727412,0.0025874735,0.00012836113,0.00011973979,0.0020758985,0.000119083146,0.3561842,0.5835758,0.021109303,0.03265456,0.00007433628],"about_ca_topic_score_codex":0.0002803176,"about_ca_topic_score_gemma":0.0007103251,"teacher_disagreement_score":0.0022765235,"about_ca_system_score_codex":0.0002815561,"about_ca_system_score_gemma":0.00015627027,"threshold_uncertainty_score":0.0076156855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018074323,0.00515056,0.015548168,0.0008698067,0.0007971309,0.000053019423,0.000224063,0.00041416,0.97513574],"genre_scores_gemma":[0.017897153,0.0052136793,0.004864353,0.00024866054,0.00044304354,0.000032452623,0.0003392821,0.0001662867,0.97079515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964976,0.00004741188,0.000011080524,0.000039546765,0.00021890481,0.00003324707],"domain_scores_gemma":[0.9998066,0.00004357691,0.000010108169,0.00006168028,0.00005795592,0.00002008994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028253815,0.00089645013,0.0005350969,0.0012129748,0.0009904626,0.0022765908,0.0006098999,0.00064863346,0.06926082],"category_scores_gemma":[0.0007277938,0.00042974667,0.0002414836,0.0021830853,0.0009945527,0.0033575085,0.0013638209,0.0019078662,0.040668093],"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.000033852622,0.00006783609,0.00006864102,0.00022520738,0.0000055740898,0.000049664883,0.00031135383,0.00093647913,0.0021503654,0.50507563,0.20522456,0.2858508],"study_design_scores_gemma":[0.0000057627453,0.00002132811,0.00010408561,0.00009051821,0.0000030814763,0.000137827,0.00004427952,0.00060118234,0.0009840968,0.10441336,0.89358777,0.000006660084],"about_ca_topic_score_codex":0.00036135348,"about_ca_topic_score_gemma":0.0005986069,"teacher_disagreement_score":0.06926082,"about_ca_system_score_codex":0.001272835,"about_ca_system_score_gemma":0.0007793995,"threshold_uncertainty_score":0.23170054},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077425824,0.01078413,0.21077904,0.0011323615,0.0023315968,0.0001258405,0.00020871585,0.0018963587,0.7649994],"genre_scores_gemma":[0.093945906,0.012693798,0.08113832,0.000702716,0.0011240453,0.00011688304,0.0004143311,0.001053483,0.8088105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995346,0.00007448978,0.000019134388,0.00006277636,0.00026624932,0.00004268],"domain_scores_gemma":[0.99963796,0.000120144294,0.000016432907,0.000112667454,0.00009586049,0.000016936849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037295415,0.0013477383,0.0008259046,0.0014397921,0.0009297914,0.0027345093,0.0009086698,0.00072966464,0.027408378],"category_scores_gemma":[0.0013516549,0.0004994936,0.0004930468,0.0018921196,0.0018524923,0.0035683296,0.001653691,0.002832841,0.022111636],"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.0000721187,0.000040137496,0.000067930014,0.00027806291,0.000011829348,0.00011795942,0.0002576533,0.0024047615,0.0050866585,0.6457791,0.04978196,0.2961019],"study_design_scores_gemma":[0.000017032064,0.00009250045,0.0001435228,0.00016778332,0.000015499561,0.0007235011,0.000065264736,0.006741454,0.0093453415,0.39305517,0.58959484,0.000038069382],"about_ca_topic_score_codex":0.0003081955,"about_ca_topic_score_gemma":0.00032766708,"teacher_disagreement_score":0.027408378,"about_ca_system_score_codex":0.00085673947,"about_ca_system_score_gemma":0.00056758994,"threshold_uncertainty_score":0.09169018},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94961077,0.0005784776,0.019805467,0.00037922637,0.00013057157,0.00004784259,0.0006534899,0.0008126351,0.027981648],"genre_scores_gemma":[0.9965168,0.00007551182,0.0013564153,0.00005418442,0.000017214148,0.0000148383915,0.00019707315,0.00004208786,0.0017257882],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990201,0.0001811429,0.000026518464,0.00036346327,0.00026883578,0.00013999533],"domain_scores_gemma":[0.9989831,0.0004679496,0.00017515065,0.00013319282,0.000115344,0.00012518873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011012134,0.000595453,0.00020843744,0.0013583888,0.00036775676,0.001015404,0.00056715915,0.0009425284,0.0055665798],"category_scores_gemma":[0.0022917828,0.000360806,0.0001764434,0.00047741042,0.00058844587,0.0007833484,0.00070989225,0.00072545634,0.001121459],"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.002160883,0.00033583466,0.03152289,0.00014641818,0.00014196048,0.0012105525,0.00011881905,0.0019597732,0.91026706,0.020904208,0.0020181013,0.029213425],"study_design_scores_gemma":[0.000116949814,0.0006336118,0.043144584,0.000026640435,0.000104067134,0.00204343,0.00007741714,0.02083704,0.92693955,0.002929572,0.0031016634,0.000045529036],"about_ca_topic_score_codex":0.00023260986,"about_ca_topic_score_gemma":0.00020103695,"teacher_disagreement_score":0.0055665798,"about_ca_system_score_codex":0.00031440708,"about_ca_system_score_gemma":0.000185377,"threshold_uncertainty_score":0.01862204},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017611291,0.026072495,0.043754917,0.0014182151,0.0020944555,0.00009867114,0.00020120044,0.0006899536,0.9239088],"genre_scores_gemma":[0.014325274,0.019349193,0.012109703,0.00047748841,0.0012963851,0.000054453536,0.00038464798,0.00027891045,0.95172393],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999451,0.00006425845,0.000019198147,0.00007589822,0.0003430902,0.000046501566],"domain_scores_gemma":[0.9996612,0.00007688841,0.00001808757,0.000093462906,0.0001185838,0.00003170214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037451042,0.0013147371,0.00078449026,0.0019405753,0.0010335437,0.0026602726,0.00083995156,0.00097293226,0.060955115],"category_scores_gemma":[0.0010509233,0.0005559471,0.00034404703,0.0025801864,0.0011856598,0.004124519,0.0016518807,0.0026386168,0.049075842],"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.000031937536,0.00008091976,0.000107121545,0.0003678511,0.000009981889,0.00007749288,0.0002664886,0.0012842144,0.0022678238,0.23604532,0.2302305,0.5292303],"study_design_scores_gemma":[0.000005599612,0.000023315592,0.000115331466,0.00018040025,0.000005622643,0.00023852792,0.000038255344,0.00074660144,0.0011963287,0.060304116,0.93713516,0.000010878665],"about_ca_topic_score_codex":0.00039807567,"about_ca_topic_score_gemma":0.00074209267,"teacher_disagreement_score":0.060955115,"about_ca_system_score_codex":0.0012166058,"about_ca_system_score_gemma":0.0011460765,"threshold_uncertainty_score":0.20391512},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008410571,0.01635741,0.03518356,0.011960383,0.002338783,0.00007003256,0.00026073115,0.00025462234,0.92516387],"genre_scores_gemma":[0.19260661,0.032507624,0.025890343,0.0027654679,0.00494121,0.00015125798,0.00088232005,0.00026637467,0.73998874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994802,0.00009207044,0.000021351101,0.00007226478,0.0002826767,0.000051572315],"domain_scores_gemma":[0.9996728,0.00012168746,0.000021256954,0.000085542175,0.00007043415,0.000028387469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048185707,0.00076153077,0.0006737698,0.0010106739,0.0012784853,0.0029475442,0.0006458985,0.00090026093,0.017812096],"category_scores_gemma":[0.0014778691,0.00031525953,0.00035162526,0.0017295083,0.0021088938,0.004951175,0.0015909252,0.0035440593,0.009268337],"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.000028572698,0.00005325168,0.0000785208,0.00016668111,0.000006256317,0.0000913602,0.00016132578,0.0010536289,0.00045258793,0.8072998,0.07574425,0.114863805],"study_design_scores_gemma":[0.000020067937,0.000020281965,0.00012474513,0.00012059184,0.000008077801,0.00036522112,0.000072034294,0.0012483934,0.00083689246,0.60650873,0.39066342,0.0000114752875],"about_ca_topic_score_codex":0.00031482553,"about_ca_topic_score_gemma":0.00022804439,"teacher_disagreement_score":0.017812096,"about_ca_system_score_codex":0.0015441461,"about_ca_system_score_gemma":0.0013541669,"threshold_uncertainty_score":0.05958742},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.924185,0.0030648874,0.05421233,0.00019984621,0.00018917593,0.00011871692,0.00026426432,0.0032715148,0.014494316],"genre_scores_gemma":[0.98315823,0.00032315805,0.0139372805,0.000030783227,0.00003591963,0.000046330326,0.00025004294,0.00007190949,0.0021463388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980915,0.00038262323,0.00014385527,0.00024320617,0.0006523685,0.00048636057],"domain_scores_gemma":[0.99640083,0.0018158433,0.0003930433,0.00049078313,0.0007884317,0.00011107747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007817884,0.00088836433,0.00059301336,0.0017108391,0.0005045812,0.0010425304,0.001164433,0.0004521432,0.0060566524],"category_scores_gemma":[0.0036969783,0.00025184624,0.00031933963,0.0015185825,0.00037232786,0.0013831609,0.0004753325,0.0004945257,0.0011399449],"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.014317985,0.0007918575,0.015904412,0.0015044415,0.00043297224,0.0009612278,0.00059484283,0.23914725,0.19829972,0.017720517,0.008731782,0.501593],"study_design_scores_gemma":[0.00053457235,0.0051291646,0.008902337,0.000120695026,0.00031588384,0.00089725654,0.00027110285,0.7508233,0.22313467,0.0018803654,0.007879053,0.00011153623],"about_ca_topic_score_codex":0.0020134451,"about_ca_topic_score_gemma":0.001490737,"teacher_disagreement_score":0.0060566524,"about_ca_system_score_codex":0.0010566395,"about_ca_system_score_gemma":0.0008695741,"threshold_uncertainty_score":0.020261586},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026647372,0.00092261075,0.9455089,0.00041034634,0.00040606316,0.0000776358,0.00012952246,0.0054127662,0.020484835],"genre_scores_gemma":[0.17727095,0.0004633873,0.7968471,0.00018154418,0.00016772134,0.0000662365,0.0003677793,0.0005866975,0.024048507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993413,0.00010223483,0.000025575386,0.00009664835,0.00035012394,0.00008409793],"domain_scores_gemma":[0.99939024,0.00019228984,0.000037470694,0.00017295055,0.0001746463,0.000032323143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049613573,0.0009785239,0.0007133836,0.0012711163,0.00048670892,0.0012074881,0.00089700683,0.0007434825,0.014688637],"category_scores_gemma":[0.0022706296,0.0002927224,0.0005361842,0.0011078544,0.0006409293,0.0017565867,0.0013746873,0.0011988464,0.0075857653],"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.0003941097,0.00007414376,0.0005885227,0.00016496296,0.000041610558,0.00012030177,0.000114259754,0.015979912,0.034412157,0.055126265,0.015579286,0.8774046],"study_design_scores_gemma":[0.00030712906,0.00041870374,0.0016067447,0.00013072744,0.00007191054,0.0012234047,0.00019267223,0.5656918,0.12905411,0.19255179,0.108630575,0.000120419805],"about_ca_topic_score_codex":0.0013631864,"about_ca_topic_score_gemma":0.0026225469,"teacher_disagreement_score":0.014688637,"about_ca_system_score_codex":0.0006686698,"about_ca_system_score_gemma":0.0010745892,"threshold_uncertainty_score":0.049138427},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18450926,0.00096324267,0.793924,0.0005516963,0.00020897108,0.00018588259,0.00015864134,0.0011326697,0.018365609],"genre_scores_gemma":[0.61050785,0.000500707,0.38022092,0.00017547369,0.0000692007,0.0001309257,0.00025255803,0.00003838867,0.008104012],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999149,0.000014429555,0.000008748788,0.000015706662,0.000036734848,0.000009530453],"domain_scores_gemma":[0.9998764,0.00002497291,0.000025102758,0.000018473249,0.000047815447,0.0000072587063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012303634,0.00028524478,0.00015113615,0.0003328955,0.00028425007,0.0004133969,0.000535874,0.00025636598,0.0035471423],"category_scores_gemma":[0.00035436623,0.000115146846,0.00022109764,0.00031061762,0.00015195867,0.00049210514,0.00020384345,0.0002597574,0.0008101213],"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.0006301429,0.00016476949,0.0017462039,0.00058832625,0.000077747914,0.00057046337,0.00027537337,0.03270526,0.50093395,0.086144194,0.005688664,0.37047502],"study_design_scores_gemma":[0.00029426202,0.0030340657,0.0028262644,0.00017995034,0.00013967286,0.0032840113,0.00020226263,0.45499924,0.42402613,0.03265851,0.078267515,0.0000882149],"about_ca_topic_score_codex":0.00039157955,"about_ca_topic_score_gemma":0.0012762613,"teacher_disagreement_score":0.0035471423,"about_ca_system_score_codex":0.00032525716,"about_ca_system_score_gemma":0.0008880135,"threshold_uncertainty_score":0.011866331},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2297833,0.0019228649,0.7397243,0.0008663585,0.00048075887,0.00042753908,0.00035461682,0.0017798372,0.0246605],"genre_scores_gemma":[0.6625201,0.00064119615,0.3260129,0.0003725856,0.00014139002,0.00031143325,0.00036424043,0.00007454854,0.009561711],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99987435,0.00002564365,0.000013287534,0.000027869388,0.00004148489,0.00001744208],"domain_scores_gemma":[0.99983203,0.000020465299,0.00004055597,0.00002829881,0.00006924067,0.000009391185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000108701766,0.00034125065,0.00023621395,0.00037813635,0.00026774613,0.00042054636,0.0006763925,0.00037668404,0.0037761864],"category_scores_gemma":[0.00038164738,0.00013638948,0.00023698276,0.0004998911,0.00019299865,0.00069398235,0.0002493642,0.00035977009,0.0012322998],"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.00073483394,0.00016018281,0.0013788994,0.0006907261,0.00009035591,0.0010131582,0.00023488159,0.01564257,0.7130381,0.059994336,0.00941779,0.19760421],"study_design_scores_gemma":[0.00046802938,0.006180507,0.0039094673,0.00026039436,0.0003339145,0.0063788625,0.00019858863,0.16576011,0.61064965,0.019729653,0.1859594,0.00017142382],"about_ca_topic_score_codex":0.00018120199,"about_ca_topic_score_gemma":0.0004337863,"teacher_disagreement_score":0.0037761864,"about_ca_system_score_codex":0.00033333246,"about_ca_system_score_gemma":0.00046065706,"threshold_uncertainty_score":0.012632608},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14467652,0.00053336564,0.8392114,0.00031597554,0.00013077035,0.0002222392,0.00032022336,0.0049399184,0.009649494],"genre_scores_gemma":[0.7193527,0.00023020555,0.27342367,0.00009883187,0.000074332915,0.00016927284,0.0005908366,0.00028482205,0.005775323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980044,0.00032020855,0.00016584467,0.00027531927,0.00082551845,0.0004086817],"domain_scores_gemma":[0.998178,0.00041578847,0.00016946964,0.0009364881,0.0002097694,0.000090501446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010470672,0.0006376319,0.0010155191,0.0010658213,0.0009934041,0.001759307,0.0016637318,0.00067682064,0.010030422],"category_scores_gemma":[0.003367848,0.00045523993,0.00082208595,0.0015397524,0.0011114368,0.0054770797,0.004842626,0.0016014178,0.0031274161],"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.0020571942,0.00031542213,0.0035151911,0.00077404856,0.00011246476,0.0005450739,0.00082469085,0.05729626,0.06591116,0.26501545,0.0090882955,0.59454477],"study_design_scores_gemma":[0.0004373658,0.0011437814,0.0020072914,0.0002284044,0.000126524,0.0013161459,0.0006424396,0.4203171,0.23266734,0.30018777,0.04073439,0.00019140974],"about_ca_topic_score_codex":0.0004838659,"about_ca_topic_score_gemma":0.0006030207,"teacher_disagreement_score":0.010030422,"about_ca_system_score_codex":0.0008850355,"about_ca_system_score_gemma":0.001515771,"threshold_uncertainty_score":0.03355509},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021348415,0.0020387857,0.049477965,0.0048107756,0.0016479138,0.000047514866,0.0002387684,0.0012888749,0.91910106],"genre_scores_gemma":[0.25157455,0.00554703,0.015129944,0.0009249473,0.0009983958,0.000051066774,0.00040971529,0.0010069128,0.7243574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997317,0.000035071862,0.000010492449,0.000036278143,0.00012807154,0.0000583433],"domain_scores_gemma":[0.99939907,0.00009336073,0.000050258488,0.0002827233,0.00010853205,0.00006608836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000280141,0.0006154686,0.00041669307,0.0005951143,0.0010411692,0.0020674388,0.0003760805,0.0008818519,0.05153758],"category_scores_gemma":[0.0019200057,0.00036634834,0.00036973198,0.00072162464,0.0014855023,0.0072067,0.0019909637,0.0026702033,0.02830472],"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.00006474691,0.00001708155,0.00017349362,0.00008106349,0.000011749856,0.00021759189,0.0006532624,0.0007917007,0.0029035797,0.82939196,0.07089141,0.094802365],"study_design_scores_gemma":[0.000012260168,0.000039529234,0.0001445853,0.000081184015,0.000010805453,0.0004515233,0.00023544315,0.0016487266,0.0030845895,0.35978845,0.6344841,0.000018729786],"about_ca_topic_score_codex":0.00048325816,"about_ca_topic_score_gemma":0.00048506772,"teacher_disagreement_score":0.05153758,"about_ca_system_score_codex":0.00063590327,"about_ca_system_score_gemma":0.00036161402,"threshold_uncertainty_score":0.17241037},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123353034,0.0008775069,0.86013126,0.00017205451,0.00012436025,0.00015345139,0.00008920182,0.0033415388,0.011757552],"genre_scores_gemma":[0.6039459,0.00036003132,0.3900998,0.00009422553,0.00006214827,0.00014118943,0.00022526113,0.00010107246,0.004970425],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99982905,0.000025886304,0.0000192842,0.000035850604,0.0000584168,0.000031512238],"domain_scores_gemma":[0.99986255,0.00002621261,0.000021211776,0.000034612727,0.00004678584,0.000008568713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013862265,0.00046864248,0.0002787311,0.00038923803,0.00026781406,0.0004804518,0.0006867841,0.00024872358,0.0024328954],"category_scores_gemma":[0.0002597762,0.00016207363,0.00027190614,0.0004051547,0.00016175373,0.0005586649,0.0002851735,0.0003099671,0.0010336486],"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.00063302385,0.00015932306,0.0020500012,0.00036865618,0.00009825039,0.0005969446,0.00022958375,0.039120555,0.39623246,0.017066086,0.0054708915,0.5379742],"study_design_scores_gemma":[0.0002269538,0.00198412,0.0034256177,0.00007788283,0.00014501056,0.0024489819,0.00010615738,0.45950907,0.48623353,0.005599262,0.040159907,0.00008348502],"about_ca_topic_score_codex":0.00044848447,"about_ca_topic_score_gemma":0.0007007776,"teacher_disagreement_score":0.0024328954,"about_ca_system_score_codex":0.0002275661,"about_ca_system_score_gemma":0.0004224865,"threshold_uncertainty_score":0.008138776},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2118284,0.002198042,0.69547415,0.00068013836,0.0005129779,0.00029534806,0.00037075483,0.018433193,0.070207074],"genre_scores_gemma":[0.7095465,0.00046017845,0.26815432,0.00016958783,0.00010531907,0.00010465036,0.00072249526,0.0002729472,0.020463955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959856,0.00006426083,0.00003366036,0.00006441336,0.00018682616,0.000052383122],"domain_scores_gemma":[0.9997695,0.000041769774,0.000026957894,0.000053522625,0.000095362266,0.00001290588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003528084,0.00062103785,0.00047011807,0.00068104453,0.000305939,0.00063047954,0.00070904475,0.00021644188,0.00669062],"category_scores_gemma":[0.0005969481,0.00016512684,0.00032527206,0.0006775157,0.00023104755,0.00094811624,0.00044632005,0.00039635846,0.0032935992],"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.0010451355,0.00023926709,0.002420846,0.00057663507,0.000109254725,0.00071117986,0.00028931088,0.026711898,0.29320666,0.04207111,0.024130043,0.60848874],"study_design_scores_gemma":[0.00025886483,0.0010176338,0.0029113647,0.0000796776,0.000110879424,0.002206869,0.000091825365,0.37363812,0.48013756,0.009353398,0.13007289,0.00012099236],"about_ca_topic_score_codex":0.00070141634,"about_ca_topic_score_gemma":0.0009974508,"teacher_disagreement_score":0.00669062,"about_ca_system_score_codex":0.000587999,"about_ca_system_score_gemma":0.0006286381,"threshold_uncertainty_score":0.022382379},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59494436,0.00040772455,0.3783313,0.0007901434,0.0001044809,0.000115194554,0.00029154608,0.001181202,0.023834055],"genre_scores_gemma":[0.88675964,0.00029370128,0.104777455,0.00016042966,0.000054953023,0.000031825337,0.00037746626,0.00016359931,0.007380851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959236,0.000050361876,0.000024782921,0.00014978732,0.00009790998,0.00008474016],"domain_scores_gemma":[0.9991517,0.00025225972,0.00009607252,0.0003305504,0.0000984671,0.00007082612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028377512,0.00036051375,0.00040758186,0.00045785922,0.00054342224,0.0013787617,0.00055529544,0.0005060859,0.0029978657],"category_scores_gemma":[0.001387553,0.00025136454,0.0005836783,0.0004961156,0.0012674979,0.0028822673,0.0018323341,0.0011929946,0.0007232175],"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.00037880146,0.00013448576,0.0044816043,0.00020741252,0.00003585741,0.0005310267,0.0010772455,0.025517963,0.027112193,0.7270888,0.0046468177,0.20878771],"study_design_scores_gemma":[0.000059026588,0.0002585932,0.0017779013,0.00004149231,0.000050586295,0.0006018169,0.0004348189,0.120274454,0.028918648,0.824739,0.022775445,0.00006830964],"about_ca_topic_score_codex":0.0012922143,"about_ca_topic_score_gemma":0.0009467216,"teacher_disagreement_score":0.0029978657,"about_ca_system_score_codex":0.000774147,"about_ca_system_score_gemma":0.00050972146,"threshold_uncertainty_score":0.010028899},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011835056,0.00053868734,0.8584303,0.00037646462,0.0003967664,0.00012784939,0.0015618049,0.077294014,0.049438965],"genre_scores_gemma":[0.20550634,0.0011038366,0.67369837,0.0012410264,0.00048555518,0.0004488185,0.0076409504,0.035828136,0.07404691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973878,0.00046457184,0.00019770832,0.00041310655,0.0011659882,0.00037075934],"domain_scores_gemma":[0.99824,0.00038545683,0.000079047204,0.0006779717,0.0004908343,0.00012672986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021092312,0.0007913366,0.0007456974,0.0013443552,0.00092322024,0.002888555,0.0025434482,0.0009147831,0.03268501],"category_scores_gemma":[0.005137169,0.00066955393,0.0011654772,0.0013741663,0.0013486865,0.0062753926,0.0036949043,0.003071647,0.018942984],"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.0005388735,0.00021387023,0.0012737624,0.00060742977,0.00009944268,0.00028750417,0.001437601,0.0057322127,0.024009958,0.6242021,0.07444449,0.26715273],"study_design_scores_gemma":[0.00019032303,0.00013961615,0.0005529261,0.00023183272,0.00006415129,0.0004853228,0.00015179404,0.021225877,0.052971147,0.2895294,0.63426775,0.000189784],"about_ca_topic_score_codex":0.0010643136,"about_ca_topic_score_gemma":0.0014656186,"teacher_disagreement_score":0.03268501,"about_ca_system_score_codex":0.00080891803,"about_ca_system_score_gemma":0.0011172662,"threshold_uncertainty_score":0.10934228},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022333657,0.00046423462,0.9686612,0.00011097495,0.000079216705,0.000079681704,0.000042823434,0.00032029272,0.0079079075],"genre_scores_gemma":[0.42548203,0.00059113646,0.56465715,0.000116260766,0.00010008933,0.00021949835,0.00015233475,0.000058221012,0.008623288],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99979764,0.000039748265,0.00001652455,0.00003511236,0.000085320724,0.000025616608],"domain_scores_gemma":[0.9997844,0.00005172201,0.000035198427,0.00003266091,0.00008201302,0.000014013911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025224348,0.00063267996,0.00025030796,0.00043619153,0.00032703293,0.0007740076,0.0008799357,0.00051476224,0.004560181],"category_scores_gemma":[0.00073915126,0.00023825374,0.00028463325,0.00052882836,0.0002895722,0.0010207463,0.00042493685,0.0006708631,0.0012485131],"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.00056069955,0.00018832037,0.00080487266,0.00058566785,0.000088210545,0.0003849013,0.00047179314,0.067524604,0.19566025,0.17186168,0.004271977,0.557597],"study_design_scores_gemma":[0.00015718615,0.00078640383,0.00097401004,0.00012708617,0.00008241634,0.0010841563,0.00018498901,0.7798553,0.12998107,0.04036943,0.046302974,0.00009488126],"about_ca_topic_score_codex":0.00036276053,"about_ca_topic_score_gemma":0.00093049556,"teacher_disagreement_score":0.004560181,"about_ca_system_score_codex":0.0004189035,"about_ca_system_score_gemma":0.00055549876,"threshold_uncertainty_score":0.015255272},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046923682,0.00017112035,0.93677926,0.00074647553,0.00010794309,0.00034495204,0.00008948771,0.002213155,0.0126240095],"genre_scores_gemma":[0.62421495,0.0002749512,0.36229715,0.00026383135,0.00005600524,0.00022931126,0.00029993503,0.000121771714,0.012242041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838805,0.00029605272,0.00014905572,0.00022367701,0.00065079075,0.00029239187],"domain_scores_gemma":[0.99881315,0.00012921607,0.00007163282,0.0006297545,0.00026322168,0.00009299596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018152023,0.00034063938,0.0004570357,0.00061118416,0.0009548108,0.0024837626,0.0015783395,0.0011997827,0.0036841652],"category_scores_gemma":[0.0020643736,0.00044156954,0.00053876714,0.0006287277,0.0013784027,0.004475708,0.0033926761,0.0028084647,0.0022564428],"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.00023790232,0.0002884612,0.0013454236,0.0001521785,0.00004172678,0.000411531,0.0008109668,0.010991646,0.04251502,0.84800494,0.0036910865,0.09150911],"study_design_scores_gemma":[0.0002347579,0.0007116498,0.0013782325,0.00013725286,0.00013847124,0.0015880455,0.0004638031,0.34036392,0.19506006,0.33983824,0.11992148,0.00016404083],"about_ca_topic_score_codex":0.00064612355,"about_ca_topic_score_gemma":0.00042152728,"teacher_disagreement_score":0.0036841652,"about_ca_system_score_codex":0.00087389175,"about_ca_system_score_gemma":0.0013297638,"threshold_uncertainty_score":0.01232475},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2371977,0.0030223923,0.65336126,0.00093556324,0.0008608947,0.00013922827,0.0011094811,0.0020621906,0.10131125],"genre_scores_gemma":[0.768729,0.0017721378,0.19761916,0.0004155106,0.00059704477,0.0001254612,0.0013574986,0.00073654775,0.028647609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990402,0.00015795784,0.0000886359,0.00015676103,0.0004487394,0.00010767783],"domain_scores_gemma":[0.99853265,0.000680989,0.00017404354,0.00030001646,0.00023260723,0.000079714024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009361044,0.00082656596,0.00060804695,0.0013218222,0.00049192837,0.0020594834,0.0005908095,0.00050692575,0.016852418],"category_scores_gemma":[0.0052037737,0.000354128,0.00045941235,0.0010435684,0.0012632657,0.004452455,0.0023962099,0.0015512414,0.0046956167],"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.0008049705,0.00006689965,0.000768084,0.0004435833,0.000029514036,0.0006504033,0.0003978724,0.030017344,0.02006397,0.7464557,0.011254715,0.18904686],"study_design_scores_gemma":[0.000037979753,0.0001663515,0.00027954497,0.00010142143,0.000012703754,0.0005389054,0.00006272089,0.03298037,0.01652845,0.9290372,0.02022241,0.000031834392],"about_ca_topic_score_codex":0.00019061896,"about_ca_topic_score_gemma":0.00027000482,"teacher_disagreement_score":0.016852418,"about_ca_system_score_codex":0.0005768973,"about_ca_system_score_gemma":0.00041544682,"threshold_uncertainty_score":0.056376934},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018999461,0.0021090712,0.020271258,0.0017920225,0.0033113617,0.00020298694,0.0021948249,0.0029360156,0.9652825],"genre_scores_gemma":[0.014071236,0.0020698225,0.010293363,0.001721114,0.0006746648,0.00018285823,0.00388268,0.00074797083,0.9663562],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992078,0.000071325274,0.000024221237,0.00014553533,0.00043910663,0.000112107395],"domain_scores_gemma":[0.99928015,0.00006273554,0.000022270257,0.00013524886,0.0003700525,0.00012956529],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00058503426,0.00097337214,0.00052148366,0.0013855769,0.001332015,0.0027963612,0.0014869998,0.0011429519,0.35831925],"category_scores_gemma":[0.0017898873,0.00027047633,0.0005187065,0.0012950321,0.00041885077,0.0016105213,0.0024150203,0.0012037703,0.26791885],"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.00011105596,0.000085288935,0.0003081969,0.00035866164,0.000010182397,0.00014263757,0.00013764405,0.00053963263,0.0048703514,0.049937837,0.60494214,0.33855635],"study_design_scores_gemma":[0.0000067572714,0.000016697315,0.00010762194,0.00004437128,0.0000037410196,0.000092655035,0.00003754016,0.00028586425,0.0011506862,0.0055248137,0.992724,0.000005349419],"about_ca_topic_score_codex":0.0013205084,"about_ca_topic_score_gemma":0.0018496661,"teacher_disagreement_score":0.35831925,"about_ca_system_score_codex":0.0007792818,"about_ca_system_score_gemma":0.0013303491,"threshold_uncertainty_score":0.9152797},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14830722,0.0010962484,0.7677354,0.00067089853,0.00032509462,0.00024387432,0.00022306528,0.0021397974,0.07925838],"genre_scores_gemma":[0.62275267,0.0011063046,0.34463856,0.0002799775,0.0002239094,0.00012756488,0.00026007358,0.000114244875,0.030496696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996977,0.000050984032,0.000018231383,0.000064376756,0.0001167153,0.00005201981],"domain_scores_gemma":[0.9998462,0.000022492191,0.000016360063,0.000069999216,0.000033055014,0.000011870561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018796278,0.0006778493,0.00033489006,0.0005224601,0.00040711433,0.0013260937,0.0007231251,0.0005154629,0.006081161],"category_scores_gemma":[0.0003189855,0.0002344566,0.00043099932,0.00053308095,0.0004887084,0.001590096,0.0009784438,0.0007052806,0.002613033],"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.00074201263,0.00022584054,0.00096198265,0.00071989663,0.00007642,0.0009412698,0.00038269188,0.05226069,0.27736935,0.3793054,0.007976808,0.27903765],"study_design_scores_gemma":[0.00015574391,0.0010966655,0.0022283397,0.00022299372,0.00016446118,0.0017812968,0.00016244303,0.514334,0.18539469,0.20361201,0.090696074,0.00015118008],"about_ca_topic_score_codex":0.000372074,"about_ca_topic_score_gemma":0.00043037266,"teacher_disagreement_score":0.006081161,"about_ca_system_score_codex":0.0003819187,"about_ca_system_score_gemma":0.0003540262,"threshold_uncertainty_score":0.020343542},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031304862,0.008551492,0.5334967,0.0053844233,0.0030639172,0.000120265555,0.00020213697,0.0004827733,0.41739354],"genre_scores_gemma":[0.5106341,0.011274806,0.25193864,0.0029844786,0.0048393467,0.00036552653,0.00040106144,0.000676979,0.21688505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993736,0.00019115867,0.000034493343,0.00010458003,0.00020125767,0.00009486688],"domain_scores_gemma":[0.99950624,0.0002268207,0.000040828912,0.00011098756,0.000077845616,0.000037310296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009244103,0.0012242461,0.0010609844,0.0020641633,0.0019211601,0.00441538,0.0017640163,0.0019318784,0.012499501],"category_scores_gemma":[0.0018517122,0.0006803883,0.0015382702,0.0024913242,0.0053639216,0.007840073,0.0026429307,0.0066662626,0.0034108285],"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.000003532122,0.000007940654,0.00001612166,0.000013010648,0.0000012826973,0.00001600183,0.000052427567,0.0003589111,0.00012929944,0.99457896,0.0011020675,0.0037204376],"study_design_scores_gemma":[0.0000028065658,0.000006219754,0.00001516288,0.000007378016,0.0000011991146,0.00004527296,0.000023334302,0.0010307784,0.00007811061,0.9918532,0.0069324304,0.000004170146],"about_ca_topic_score_codex":0.00048183155,"about_ca_topic_score_gemma":0.00063860934,"teacher_disagreement_score":0.012499501,"about_ca_system_score_codex":0.0017740856,"about_ca_system_score_gemma":0.00084251433,"threshold_uncertainty_score":0.041815042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14694007,0.0030658743,0.82834136,0.0008097302,0.00047501878,0.00024887436,0.00023513162,0.0052302545,0.014653722],"genre_scores_gemma":[0.8064423,0.0011495138,0.18789472,0.00010939064,0.00012587063,0.000057290337,0.00027005462,0.00028301118,0.0036678195],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978787,0.0005423134,0.0002062758,0.00028483086,0.00092291884,0.00016509571],"domain_scores_gemma":[0.9969399,0.001039961,0.00034357948,0.0009712143,0.0006679551,0.000037474834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013752544,0.0008559692,0.0006947274,0.0010550694,0.00041067332,0.0011433298,0.0008833126,0.0007433603,0.0029166387],"category_scores_gemma":[0.0064713857,0.00023386406,0.00072378037,0.0007454079,0.0005114875,0.0026719563,0.0007379439,0.0008194595,0.0021696722],"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.0013506818,0.00025157272,0.005440199,0.00086745305,0.0001903794,0.00086015475,0.0003917692,0.049077034,0.4237093,0.034632847,0.0032574954,0.47997117],"study_design_scores_gemma":[0.00012939892,0.0007959233,0.0026384054,0.00010350324,0.00015263913,0.0032193083,0.00009078635,0.26119205,0.6979498,0.0111540025,0.022419993,0.00015414631],"about_ca_topic_score_codex":0.00024155524,"about_ca_topic_score_gemma":0.00015331103,"teacher_disagreement_score":0.0029166387,"about_ca_system_score_codex":0.00039995703,"about_ca_system_score_gemma":0.00036523765,"threshold_uncertainty_score":0.009757102},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18811528,0.00017184419,0.7706972,0.0007895656,0.00007758614,0.0001809078,0.00045829403,0.016919158,0.022590218],"genre_scores_gemma":[0.5854063,0.00022376054,0.39896128,0.00017023519,0.000056255507,0.00011050603,0.0012609628,0.002065248,0.011745542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991616,0.00011560989,0.00006077549,0.00019256365,0.00034166168,0.00012788308],"domain_scores_gemma":[0.9988146,0.00033255195,0.0001211842,0.00054015586,0.000097486016,0.000094027535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095260964,0.0005650788,0.0005950371,0.0007242724,0.00070094055,0.0018031407,0.0011728404,0.0006777663,0.010183082],"category_scores_gemma":[0.002850518,0.00042564026,0.0006338324,0.0010855452,0.0013474488,0.004405204,0.0030272047,0.0016461476,0.0036532572],"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.001182871,0.0002512128,0.007849959,0.0003786207,0.000056200617,0.001275084,0.0019512867,0.029451359,0.043348625,0.52041864,0.02048106,0.37335503],"study_design_scores_gemma":[0.0004283996,0.00039097545,0.0032483635,0.00014362883,0.00006707748,0.0016567616,0.00084167114,0.3141574,0.1637065,0.42430663,0.09089995,0.0001526394],"about_ca_topic_score_codex":0.00073037005,"about_ca_topic_score_gemma":0.0011076808,"teacher_disagreement_score":0.010183082,"about_ca_system_score_codex":0.00090020645,"about_ca_system_score_gemma":0.0011352878,"threshold_uncertainty_score":0.034065843},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50991553,0.0006046215,0.24265455,0.001713983,0.00070710643,0.00024379205,0.00059102365,0.00093954714,0.24262983],"genre_scores_gemma":[0.8586864,0.0005636622,0.034301437,0.00026218148,0.00040669437,0.00010887301,0.00063683285,0.0006151611,0.10441878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995963,0.000076838995,0.00001486969,0.00006845558,0.00015842136,0.00008517234],"domain_scores_gemma":[0.9996437,0.00008740374,0.00004672009,0.000102141785,0.0000574673,0.000062584615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044292028,0.00084817864,0.0006777356,0.00091866043,0.0010124501,0.0020264583,0.00074233173,0.0009535372,0.012242906],"category_scores_gemma":[0.0010057617,0.0004118805,0.00090324704,0.00065497967,0.0012661386,0.0024180147,0.0022364045,0.0015610141,0.003284397],"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.000087915054,0.0000528903,0.00031881058,0.000070993396,0.0000109580005,0.00029516697,0.00028730152,0.0024637738,0.0058029997,0.9679359,0.0027872892,0.019886017],"study_design_scores_gemma":[0.000055013166,0.00010194446,0.00042032302,0.000039889295,0.000023270235,0.00059094775,0.00016829613,0.019075615,0.01247232,0.9476912,0.019330487,0.0000307401],"about_ca_topic_score_codex":0.00015087165,"about_ca_topic_score_gemma":0.00019622082,"teacher_disagreement_score":0.012242906,"about_ca_system_score_codex":0.0007501978,"about_ca_system_score_gemma":0.00041677055,"threshold_uncertainty_score":0.040956616},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013990897,0.0019415768,0.90004706,0.00091837614,0.00087896467,0.00009706745,0.00026141215,0.001376578,0.08048806],"genre_scores_gemma":[0.22126745,0.0022857867,0.6658604,0.0008065613,0.0005767615,0.00031190526,0.000581416,0.004012,0.10429772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991285,0.00025275114,0.000034027365,0.000095797746,0.000377248,0.00011167383],"domain_scores_gemma":[0.9993284,0.00035505838,0.000026620795,0.00018351732,0.000081521495,0.000024981036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010351415,0.0011815373,0.0013104129,0.0010237888,0.00086643576,0.0013173976,0.0017488211,0.000897203,0.022233015],"category_scores_gemma":[0.0040506544,0.0005239924,0.0007646304,0.002430262,0.0018762356,0.0031669722,0.002261933,0.0032480776,0.004722991],"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.00027621022,0.0001026753,0.000233888,0.00027647772,0.000046135152,0.00007645433,0.00013437413,0.052751906,0.003948225,0.56986004,0.027901713,0.3443919],"study_design_scores_gemma":[0.00008269326,0.000081808605,0.00025086524,0.00007227045,0.00002629815,0.00014106993,0.00005472043,0.2459501,0.0048083425,0.7035738,0.044911217,0.00004677207],"about_ca_topic_score_codex":0.0018851694,"about_ca_topic_score_gemma":0.0032621052,"teacher_disagreement_score":0.022233015,"about_ca_system_score_codex":0.0009582247,"about_ca_system_score_gemma":0.0012687801,"threshold_uncertainty_score":0.07437682},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22186883,0.0014881205,0.74974954,0.00037883973,0.00032776012,0.00032505507,0.00040071743,0.004817321,0.020643895],"genre_scores_gemma":[0.63301265,0.00052086235,0.349887,0.00018293782,0.00013112159,0.00014804996,0.00074867136,0.00009675412,0.015271844],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999094,0.0000118834305,0.000008459772,0.000020271926,0.000037831,0.000012149679],"domain_scores_gemma":[0.99988055,0.000019538982,0.000017171707,0.000018464907,0.00005617744,0.0000081481985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011205732,0.00030426556,0.00022361691,0.00035824414,0.00029831717,0.00030718994,0.0005619285,0.000215507,0.005301822],"category_scores_gemma":[0.00028889359,0.00010454129,0.00016102445,0.00058250653,0.00012383188,0.0005143052,0.00023164423,0.00033530474,0.0016253059],"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.0006123508,0.00015130434,0.0016250173,0.0004434127,0.000052076084,0.00053826626,0.00018386843,0.0058988775,0.44784456,0.011333085,0.013636169,0.517681],"study_design_scores_gemma":[0.00029051627,0.0035920716,0.0052515822,0.000116104486,0.00016475449,0.0053236308,0.00019031465,0.17617953,0.6707397,0.0041371253,0.1339339,0.00008072921],"about_ca_topic_score_codex":0.00019486627,"about_ca_topic_score_gemma":0.0004609564,"teacher_disagreement_score":0.005301822,"about_ca_system_score_codex":0.00020437884,"about_ca_system_score_gemma":0.0003989105,"threshold_uncertainty_score":0.017736375},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1529897,0.0005248151,0.82972765,0.00034648043,0.00014335694,0.0001501908,0.00012185892,0.0009629299,0.015032951],"genre_scores_gemma":[0.74342346,0.00030488404,0.2513886,0.00012317912,0.000043699765,0.0001145191,0.00014139847,0.000048284863,0.0044120033],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99986005,0.000038444392,0.000011873601,0.000021754333,0.000048174148,0.000019666564],"domain_scores_gemma":[0.9998016,0.000035584206,0.0000567466,0.000026410265,0.000067451074,0.000012200313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002061239,0.00032856327,0.00019354063,0.00031045298,0.00022216371,0.00051682815,0.00065618893,0.000244305,0.0021679983],"category_scores_gemma":[0.00043785584,0.00010866663,0.00019762112,0.0003239398,0.0001984196,0.00044953072,0.00023888129,0.00027497904,0.00071435334],"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.0007535158,0.00024352837,0.0025081052,0.0004471784,0.00010804732,0.0009115569,0.00037269737,0.18539128,0.43097296,0.089602396,0.006909864,0.2817788],"study_design_scores_gemma":[0.00015895194,0.00219014,0.0010939334,0.00006897564,0.00006668474,0.0010259219,0.00011224974,0.7422795,0.20961267,0.0117535805,0.031583335,0.000054022526],"about_ca_topic_score_codex":0.0003634785,"about_ca_topic_score_gemma":0.0008272593,"teacher_disagreement_score":0.0021679983,"about_ca_system_score_codex":0.0003608435,"about_ca_system_score_gemma":0.00061131874,"threshold_uncertainty_score":0.007252693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025050996,0.0010964018,0.940101,0.00091111485,0.0012225014,0.0005944806,0.0006336634,0.0031150752,0.027274756],"genre_scores_gemma":[0.17818025,0.0008183649,0.804245,0.0006133907,0.0005941715,0.0007757487,0.0009721415,0.00057400734,0.013227019],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9913395,0.0017399418,0.0006336257,0.0022354124,0.0036114717,0.0004399931],"domain_scores_gemma":[0.9867798,0.0059976913,0.0012040471,0.0023215523,0.0031020034,0.00059486483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032485747,0.0014665402,0.0012177541,0.0064225197,0.0015721074,0.003124259,0.0017064422,0.0017194942,0.0148678105],"category_scores_gemma":[0.01936839,0.0006066085,0.0011866112,0.0022646054,0.0034744036,0.008772979,0.0032132631,0.0027799003,0.00559715],"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.0014459668,0.00035732516,0.012631578,0.0007978331,0.00019926188,0.00072378805,0.0009223538,0.0034189736,0.06792931,0.20492233,0.015050944,0.69160026],"study_design_scores_gemma":[0.0006151501,0.0026969544,0.012774745,0.00070883473,0.0004476766,0.011504696,0.0012681092,0.14522502,0.20134538,0.38449806,0.23802851,0.0008869599],"about_ca_topic_score_codex":0.00048019973,"about_ca_topic_score_gemma":0.0003943626,"teacher_disagreement_score":0.0148678105,"about_ca_system_score_codex":0.0009881608,"about_ca_system_score_gemma":0.0013538497,"threshold_uncertainty_score":0.04973781},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19426468,0.0004365051,0.7850252,0.001113671,0.00016813773,0.00022613326,0.0003363327,0.001496757,0.016932666],"genre_scores_gemma":[0.8538334,0.000151611,0.14085905,0.00012048697,0.0000365706,0.00007178363,0.0002459036,0.00006491478,0.0046163863],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895227,0.00019353337,0.00005825013,0.00017026893,0.00044095085,0.00018470835],"domain_scores_gemma":[0.99834263,0.0005123164,0.00026108063,0.0004154832,0.00035416157,0.000114224655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010196505,0.00029712304,0.000493765,0.00071802776,0.0005853837,0.00089294143,0.0006692302,0.0007182751,0.0040994054],"category_scores_gemma":[0.0054560886,0.00010558431,0.0004430444,0.000855233,0.00089667307,0.0019280162,0.0010913064,0.0013185863,0.0008720015],"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.0012044951,0.00023161498,0.0058416775,0.00021972615,0.00007371326,0.000497356,0.00032080986,0.21233451,0.03837888,0.3387049,0.00918866,0.39300364],"study_design_scores_gemma":[0.000111162924,0.0002988777,0.0012023516,0.000038466187,0.000028268376,0.0006618496,0.00006424781,0.85225415,0.035182178,0.10049582,0.009585819,0.000076819146],"about_ca_topic_score_codex":0.0008959352,"about_ca_topic_score_gemma":0.00097466813,"teacher_disagreement_score":0.0040994054,"about_ca_system_score_codex":0.0009873337,"about_ca_system_score_gemma":0.0020256687,"threshold_uncertainty_score":0.013713837},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13550524,0.0010864397,0.8195667,0.0005772806,0.00027082697,0.00030167095,0.00024937047,0.002659656,0.03978284],"genre_scores_gemma":[0.6683324,0.0008978359,0.31077322,0.0003744322,0.0002872161,0.00036208794,0.00062220043,0.0007430122,0.017607544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978206,0.00031179257,0.00017454337,0.0004881521,0.00096680946,0.00023814513],"domain_scores_gemma":[0.9966272,0.0011589711,0.0003861539,0.0010556644,0.00061018264,0.00016191283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015308055,0.0007635353,0.00087396667,0.0017655048,0.000812523,0.003113309,0.0011528395,0.00082028605,0.010163918],"category_scores_gemma":[0.008416718,0.00042810498,0.0009321936,0.0013239445,0.0022725577,0.008024138,0.0032826148,0.0020752007,0.003033533],"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.00016814805,0.00008476822,0.0009113399,0.00013024402,0.000014945038,0.00022933698,0.0004868396,0.013480386,0.013875675,0.8707125,0.0030692643,0.09683658],"study_design_scores_gemma":[0.0001119445,0.00036793613,0.0007308914,0.00016781285,0.00003549081,0.0005773766,0.00024648575,0.13206755,0.03769078,0.75871104,0.06917693,0.000115719384],"about_ca_topic_score_codex":0.0006689315,"about_ca_topic_score_gemma":0.00064076536,"teacher_disagreement_score":0.010163918,"about_ca_system_score_codex":0.0011914569,"about_ca_system_score_gemma":0.0008337855,"threshold_uncertainty_score":0.034001768},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5353925,0.0007216874,0.40681025,0.0014892244,0.0003282605,0.00029666192,0.0008454344,0.0015881417,0.05252787],"genre_scores_gemma":[0.8015467,0.00026509791,0.19046292,0.00023237309,0.00019150288,0.00014856215,0.0011829489,0.00023170192,0.0057381955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991217,0.00023440618,0.00006891753,0.0001589706,0.00023800107,0.00017794118],"domain_scores_gemma":[0.9946877,0.0035230126,0.00037129127,0.000539741,0.0005984759,0.00027981776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015798745,0.0005715635,0.00074620143,0.0017957713,0.001468289,0.0014442502,0.00068894314,0.00077847234,0.0048053744],"category_scores_gemma":[0.011441566,0.00044923063,0.0007837502,0.0013083159,0.0024460847,0.0021908632,0.0011310467,0.0023158754,0.0008535498],"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.001464584,0.00017941523,0.0056507327,0.00038751302,0.000027003125,0.0010925108,0.00066038687,0.022307862,0.02943843,0.75729555,0.0085669225,0.17292906],"study_design_scores_gemma":[0.00024677883,0.00083429326,0.0031820182,0.00013891666,0.00006471935,0.0014436736,0.00033191132,0.116264045,0.059517335,0.7955184,0.022285614,0.00017232935],"about_ca_topic_score_codex":0.00078489626,"about_ca_topic_score_gemma":0.0007776876,"teacher_disagreement_score":0.0048053744,"about_ca_system_score_codex":0.0011065871,"about_ca_system_score_gemma":0.0012832474,"threshold_uncertainty_score":0.016075611},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.267449,0.0029391225,0.69206315,0.00046354983,0.00022200825,0.00025678656,0.00018273607,0.0014611061,0.034962606],"genre_scores_gemma":[0.75976646,0.0009975284,0.22771335,0.00011326942,0.000071262984,0.00008831642,0.00024949058,0.00006883668,0.010931514],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909353,0.0001612897,0.00005998114,0.00009478098,0.000477258,0.000113126094],"domain_scores_gemma":[0.9992756,0.00017868799,0.00009130354,0.00017536792,0.00025232133,0.000026738258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000599469,0.00040659634,0.00035224546,0.00097632624,0.00030391043,0.000644678,0.0005662906,0.0005150747,0.0032071127],"category_scores_gemma":[0.0016073579,0.00012429492,0.00037428024,0.000583912,0.0003290087,0.001754556,0.00050874875,0.0005001175,0.0008720168],"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.0012998333,0.0001764075,0.0036791929,0.0004360019,0.00011109998,0.00094195636,0.00022369265,0.027681654,0.2644553,0.0833797,0.0035006953,0.61411446],"study_design_scores_gemma":[0.00013442294,0.0015155717,0.006286293,0.00014656407,0.00013231834,0.0077661006,0.00022567064,0.32179764,0.54203385,0.031765506,0.08804886,0.00014722739],"about_ca_topic_score_codex":0.00037040515,"about_ca_topic_score_gemma":0.00031888636,"teacher_disagreement_score":0.0032071127,"about_ca_system_score_codex":0.00032738197,"about_ca_system_score_gemma":0.0005675869,"threshold_uncertainty_score":0.010728896},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03288871,0.0014361185,0.921704,0.002179593,0.000432229,0.0001462239,0.000051514635,0.00052720413,0.040634353],"genre_scores_gemma":[0.6236806,0.0033988273,0.34833008,0.0005779519,0.00078859174,0.00012043569,0.00010854672,0.00017653032,0.02281836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986022,0.00031721947,0.000069205846,0.00023386195,0.0006171533,0.00016047027],"domain_scores_gemma":[0.99944025,0.00013148622,0.00003993376,0.00018866693,0.00012929103,0.00007035701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008380341,0.0005948381,0.0008225909,0.0015490251,0.00126906,0.0025492725,0.0011963744,0.0013228989,0.004073071],"category_scores_gemma":[0.00217585,0.0002757748,0.00067435054,0.0012777044,0.0021951862,0.0065464377,0.003464737,0.0026307043,0.0013262882],"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.00011494018,0.000074313226,0.0002788406,0.000114353046,0.000018517545,0.00021121388,0.00035504808,0.009931192,0.011326645,0.890637,0.0025560623,0.08438189],"study_design_scores_gemma":[0.000042609176,0.00016007382,0.00012643031,0.00007993275,0.000040046554,0.0007465894,0.0002133358,0.21646641,0.015007455,0.7290118,0.038051847,0.000053395073],"about_ca_topic_score_codex":0.0004315116,"about_ca_topic_score_gemma":0.00036252974,"teacher_disagreement_score":0.004073071,"about_ca_system_score_codex":0.000843244,"about_ca_system_score_gemma":0.00091994886,"threshold_uncertainty_score":0.013625801},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007129999,0.00020840237,0.7697936,0.00037479063,0.00020073116,0.0004132491,0.00085664535,0.20949122,0.011531332],"genre_scores_gemma":[0.20567453,0.00045483134,0.6675621,0.0010308974,0.00023307015,0.0016851895,0.0044141924,0.09567285,0.02327229],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99638724,0.00078674,0.0002636961,0.0006644722,0.0013484929,0.000549397],"domain_scores_gemma":[0.9935183,0.0020914108,0.00038397804,0.0031618613,0.00061780575,0.00022664863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046017435,0.0022550926,0.0010418539,0.001029314,0.0010145617,0.0028456254,0.0043067,0.0017651872,0.049206737],"category_scores_gemma":[0.015079695,0.0018327858,0.0017821039,0.0010676617,0.0028449083,0.0063677174,0.006895196,0.0043276744,0.02378924],"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.00445313,0.0005587392,0.008179623,0.0022184239,0.00023466378,0.0018928581,0.0016648241,0.025918694,0.06204692,0.23553272,0.23779069,0.41950867],"study_design_scores_gemma":[0.0010866744,0.00040478003,0.00189761,0.0005921868,0.00011908083,0.0014775854,0.00023745894,0.2276996,0.15539578,0.16339868,0.44725475,0.00043583347],"about_ca_topic_score_codex":0.0010616847,"about_ca_topic_score_gemma":0.00095728715,"teacher_disagreement_score":0.049206737,"about_ca_system_score_codex":0.0018346746,"about_ca_system_score_gemma":0.001881523,"threshold_uncertainty_score":0.16461295},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7511412,0.0077426643,0.07673349,0.019995773,0.00078745146,0.00008982208,0.0013726327,0.00023138162,0.14190559],"genre_scores_gemma":[0.97515875,0.0025519412,0.006983122,0.00030854729,0.0012641057,0.00008225986,0.0005064161,0.00006359684,0.013081397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973363,0.00066459505,0.00013903061,0.00039652208,0.0010966681,0.0003669437],"domain_scores_gemma":[0.9854687,0.010777697,0.0011412207,0.0010188818,0.0007565666,0.00083700457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002583003,0.0010174933,0.0016937476,0.0037515818,0.0018783575,0.0076823714,0.0025914698,0.0018407012,0.009238462],"category_scores_gemma":[0.01540251,0.0009488468,0.0007464653,0.004194469,0.0066008656,0.018806309,0.0037327255,0.0051822537,0.0010135556],"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.0001454238,0.000067599656,0.0011804267,0.00007711631,0.000014621876,0.00009106926,0.00036289738,0.0054217265,0.0004886584,0.98104376,0.0022417079,0.008864951],"study_design_scores_gemma":[0.000021246116,0.00001352794,0.00037003722,0.00002007906,0.0000075515377,0.00007502328,0.00006502216,0.011311153,0.00026743422,0.9864184,0.0014136946,0.000016778507],"about_ca_topic_score_codex":0.0011204397,"about_ca_topic_score_gemma":0.00096605084,"teacher_disagreement_score":0.009238462,"about_ca_system_score_codex":0.003461579,"about_ca_system_score_gemma":0.0015540776,"threshold_uncertainty_score":0.030905724},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016260771,0.002729495,0.023034576,0.0010044249,0.0019189512,0.00005253974,0.0002298405,0.0003463376,0.9690579],"genre_scores_gemma":[0.034020297,0.0034026746,0.011283816,0.0006114942,0.0011106308,0.00010308833,0.0005034647,0.0003742956,0.9485901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994923,0.000113118265,0.000021936694,0.000100599864,0.00021117275,0.000060891864],"domain_scores_gemma":[0.9997433,0.000060092083,0.000014221001,0.00008504395,0.00006336822,0.00003403064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041112615,0.0011686332,0.0007772908,0.0016677459,0.0022320282,0.0035691354,0.0007607018,0.0008550472,0.09830112],"category_scores_gemma":[0.0011858027,0.0004752623,0.0004981485,0.0017815179,0.0021783207,0.00490002,0.0023679368,0.0028956323,0.058004398],"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.00001660929,0.000017386463,0.000022160752,0.00006943796,0.0000029117773,0.000022810502,0.00012528058,0.00019330326,0.00046343895,0.8726334,0.066814326,0.059619047],"study_design_scores_gemma":[0.0000054600832,0.000018593828,0.000044565797,0.000061649596,0.000003469227,0.00014982103,0.00005348788,0.0003390424,0.0006634056,0.37318903,0.62546325,0.000008258912],"about_ca_topic_score_codex":0.00032151808,"about_ca_topic_score_gemma":0.0004249709,"teacher_disagreement_score":0.09830112,"about_ca_system_score_codex":0.0011300069,"about_ca_system_score_gemma":0.0007812938,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004712405,0.004197348,0.04919753,0.0011309481,0.0014760124,0.000046009995,0.0001276232,0.0005402261,0.9385719],"genre_scores_gemma":[0.068177514,0.00761461,0.016662903,0.00049428974,0.0011881154,0.00006022325,0.00028997473,0.00054833526,0.90496397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99959534,0.000083109786,0.000011316482,0.00004631459,0.00021919789,0.000044647782],"domain_scores_gemma":[0.9997873,0.000054624794,0.000013574824,0.00006536074,0.000051358034,0.000027762608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039590625,0.0010113757,0.00047557632,0.0010983978,0.0011233483,0.002385663,0.00052636646,0.0006980707,0.042046186],"category_scores_gemma":[0.0012206964,0.00041830575,0.00034088013,0.0012934394,0.0011885886,0.0035921242,0.002097078,0.0026085568,0.02739471],"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.000025262098,0.000030922412,0.000043090877,0.00010669773,0.0000034554441,0.000058322363,0.00019960945,0.000798546,0.0018335002,0.86267823,0.054693177,0.079529144],"study_design_scores_gemma":[0.00000791037,0.000028957127,0.00009965606,0.0001042984,0.0000044824596,0.00028983995,0.00006374011,0.0011902878,0.002419644,0.3965661,0.5992126,0.000012544901],"about_ca_topic_score_codex":0.00018913277,"about_ca_topic_score_gemma":0.00026978378,"teacher_disagreement_score":0.042046186,"about_ca_system_score_codex":0.00080859853,"about_ca_system_score_gemma":0.00048459775,"threshold_uncertainty_score":0.1406585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004414857,0.008776748,0.01798805,0.008744327,0.001699304,0.000041715357,0.00020791644,0.00019183593,0.9579352],"genre_scores_gemma":[0.11616677,0.017356645,0.012783271,0.0022418345,0.0035574555,0.000086277774,0.0006249182,0.00021087227,0.8469719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995517,0.00007742875,0.000014749587,0.000063359046,0.00024937044,0.000043359138],"domain_scores_gemma":[0.999688,0.00012333423,0.000020166312,0.00007868235,0.00006054549,0.000029298277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042252216,0.0007515301,0.00062377314,0.00095543877,0.0012974346,0.0031646534,0.00066004036,0.00091881363,0.027912475],"category_scores_gemma":[0.0014928565,0.0002975287,0.00030725318,0.0015885003,0.0018354885,0.0046756314,0.0016366341,0.0033751717,0.014420074],"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.000027543943,0.00005180364,0.00006515732,0.00013893894,0.000004843529,0.000075348114,0.00013654493,0.0008483699,0.00040093824,0.7940881,0.11166236,0.092500076],"study_design_scores_gemma":[0.000014815365,0.000018750894,0.00011368129,0.000101519814,0.0000056937106,0.0002936996,0.00007202446,0.0011283885,0.0006627845,0.55191797,0.44566202,0.000008687281],"about_ca_topic_score_codex":0.00033712745,"about_ca_topic_score_gemma":0.00026151052,"teacher_disagreement_score":0.027912475,"about_ca_system_score_codex":0.001515663,"about_ca_system_score_gemma":0.001112574,"threshold_uncertainty_score":0.09337652},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008024655,0.011320544,0.016199354,0.0008129404,0.0013180762,0.000059509493,0.00015421846,0.00044589708,0.968887],"genre_scores_gemma":[0.0061310646,0.007916143,0.004320736,0.0003037257,0.0007010187,0.000026312191,0.00022607773,0.00017795325,0.9801971],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995347,0.000053632055,0.000013205405,0.000060831644,0.00029596736,0.000041588315],"domain_scores_gemma":[0.9997068,0.000069490976,0.000015775337,0.00007921487,0.00009641888,0.000032368243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033343196,0.001317936,0.00070750143,0.0018588204,0.0011040763,0.0028993618,0.0008393543,0.0009923134,0.1123575],"category_scores_gemma":[0.0009894336,0.00056477566,0.00033789905,0.0023690062,0.0010496356,0.003634966,0.0017599771,0.0024100498,0.08856867],"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.00003263775,0.00008092694,0.00008876109,0.00032446437,0.0000084085195,0.00006460309,0.00021869098,0.0010122589,0.0021442277,0.21606824,0.3524667,0.42749017],"study_design_scores_gemma":[0.0000037387383,0.000018870194,0.00010091115,0.00013403867,0.000003341898,0.0001462887,0.00003184289,0.000513306,0.00076700584,0.039486874,0.9587868,0.000006863666],"about_ca_topic_score_codex":0.00048810226,"about_ca_topic_score_gemma":0.0009537221,"teacher_disagreement_score":0.1123575,"about_ca_system_score_codex":0.0011732376,"about_ca_system_score_gemma":0.00095576386,"threshold_uncertainty_score":0.37587327},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012744745,0.0054310015,0.007582962,0.00071325304,0.0010931953,0.000023469904,0.00009806613,0.00021014655,0.9835734],"genre_scores_gemma":[0.01654701,0.0068307146,0.003029539,0.00027606095,0.00093877956,0.000021328136,0.00018463694,0.00019011898,0.97198176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99965394,0.000044182463,0.000009162701,0.00004299703,0.00021580025,0.00003388479],"domain_scores_gemma":[0.99979466,0.00005009928,0.000011730685,0.00006188229,0.000058905633,0.000022813949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002843371,0.00090858276,0.0005721503,0.0016945476,0.0009462716,0.0029517622,0.0006530754,0.000647576,0.06938458],"category_scores_gemma":[0.00094683707,0.0003702253,0.00025492278,0.0019204096,0.0014166232,0.00317773,0.001516602,0.0021352537,0.040407807],"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.000021061764,0.0000372566,0.000049406706,0.00017056703,0.0000037674183,0.000048637852,0.00023259007,0.00045495652,0.0009390475,0.6475762,0.16312085,0.18734565],"study_design_scores_gemma":[0.0000038958406,0.000014964365,0.000094753195,0.00008558328,0.0000032956375,0.00014602381,0.00004160377,0.0003338269,0.00062224193,0.12893976,0.8697084,0.0000057069365],"about_ca_topic_score_codex":0.000374522,"about_ca_topic_score_gemma":0.00057299726,"teacher_disagreement_score":0.06938458,"about_ca_system_score_codex":0.0011490012,"about_ca_system_score_gemma":0.00058086764,"threshold_uncertainty_score":0.23211455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002003016,0.0047718366,0.017294494,0.0008591846,0.00075511786,0.000052813524,0.00021579656,0.00041201175,0.97363585],"genre_scores_gemma":[0.020441333,0.0048585497,0.005397114,0.00024626922,0.00042918703,0.000031157168,0.00033514912,0.0001636867,0.96809757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996592,0.000045932215,0.000010977466,0.000038954666,0.00021257141,0.000032389988],"domain_scores_gemma":[0.9998117,0.00004191555,0.000009949012,0.000060669918,0.000056339086,0.00001950063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028213573,0.00087216566,0.0005019923,0.0011721635,0.00094085594,0.0022635283,0.00059856666,0.00062485517,0.06816083],"category_scores_gemma":[0.0007246151,0.00041466363,0.0002415133,0.0020258115,0.0009882983,0.0032586805,0.0013520599,0.0018194858,0.037652824],"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.000033800283,0.000065422966,0.00006792358,0.00021233743,0.000005627023,0.000049292514,0.00030995888,0.0009170711,0.002292643,0.5384494,0.18074785,0.27684867],"study_design_scores_gemma":[0.000006017028,0.000022633136,0.00010583216,0.00009118866,0.0000033578488,0.00014227087,0.00004724583,0.0006708641,0.0011614752,0.11375871,0.88398355,0.0000068738245],"about_ca_topic_score_codex":0.0003461343,"about_ca_topic_score_gemma":0.0005750944,"teacher_disagreement_score":0.06816083,"about_ca_system_score_codex":0.0012316,"about_ca_system_score_gemma":0.00074828713,"threshold_uncertainty_score":0.22802073},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008156549,0.010538642,0.22393508,0.001170694,0.0023033915,0.00012409611,0.00020510236,0.0018974649,0.751669],"genre_scores_gemma":[0.102183595,0.012488525,0.08703548,0.00072992704,0.0011364201,0.00011626357,0.00040270918,0.0010474031,0.79485965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995431,0.00007343856,0.000019108911,0.00006269623,0.0002595984,0.000042149622],"domain_scores_gemma":[0.9996345,0.00012375896,0.000016917353,0.000112350426,0.00009545329,0.000016991327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037648386,0.0013294062,0.0008083,0.0014299232,0.00092116767,0.002726642,0.0008962789,0.0007275448,0.026878735],"category_scores_gemma":[0.0013688873,0.0004936372,0.00049758045,0.0017980677,0.0018737832,0.003476096,0.0016413423,0.0028236061,0.021063745],"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.00007246811,0.000039161598,0.00006769706,0.00026758702,0.0000120706145,0.00011800251,0.00025610736,0.0023589465,0.0050992817,0.6601495,0.045965392,0.2855939],"study_design_scores_gemma":[0.000017734068,0.00009521679,0.00014301846,0.00016719724,0.000016367221,0.00073067663,0.00006670223,0.007094131,0.00999454,0.41799355,0.56364244,0.000038358994],"about_ca_topic_score_codex":0.00030504633,"about_ca_topic_score_gemma":0.00032228653,"teacher_disagreement_score":0.026878735,"about_ca_system_score_codex":0.00085142604,"about_ca_system_score_gemma":0.00055314094,"threshold_uncertainty_score":0.089918375},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024465316,0.006995367,0.008247435,0.00081605156,0.00072722475,0.000024521818,0.00017112173,0.00027585073,0.98029596],"genre_scores_gemma":[0.033127967,0.009470117,0.005244752,0.00029118857,0.0004812219,0.000028450164,0.00027586773,0.00031265666,0.95076776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975055,0.000027275722,0.000010069771,0.000037580525,0.00014591868,0.000028688106],"domain_scores_gemma":[0.9998597,0.000030801937,0.000012373285,0.000042578282,0.000038051203,0.000016457994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022729745,0.0011526006,0.0005753664,0.0020206056,0.0013353094,0.002912875,0.0006013348,0.0007181324,0.055760767],"category_scores_gemma":[0.00084082165,0.00047263183,0.00027401594,0.0022512388,0.0012519485,0.0041677244,0.0015383967,0.0023072076,0.036117997],"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.00003781184,0.000036222733,0.00007257958,0.0002106193,0.0000066945013,0.00006288012,0.00026249094,0.0006910942,0.0016204442,0.7043994,0.11592111,0.1766786],"study_design_scores_gemma":[0.000005422605,0.0000139914255,0.00016047453,0.00011699581,0.000006171749,0.0002249796,0.000049740527,0.00047721225,0.0010638823,0.18030597,0.81756526,0.000009860424],"about_ca_topic_score_codex":0.0005812656,"about_ca_topic_score_gemma":0.00092399237,"teacher_disagreement_score":0.055760767,"about_ca_system_score_codex":0.0012674979,"about_ca_system_score_gemma":0.0006061953,"threshold_uncertainty_score":0.18653834},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9440824,0.0007893803,0.020901391,0.0005225313,0.00002877383,0.000023285142,0.00018958174,0.00005935231,0.03340329],"genre_scores_gemma":[0.98790026,0.0005951371,0.005901756,0.000047648966,0.000075737116,0.000028825083,0.00029688244,0.000015055641,0.0051386096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994147,0.00012735384,0.000022834874,0.00017361317,0.00014410286,0.0001173468],"domain_scores_gemma":[0.99825186,0.00071622216,0.00043984188,0.00009680519,0.00025547858,0.00023972907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061578373,0.0003716686,0.00030495267,0.0029975064,0.0016033783,0.0018699655,0.0007703985,0.0006694561,0.004230826],"category_scores_gemma":[0.0031653077,0.0002878211,0.00039552408,0.0014389079,0.001994911,0.0032563999,0.0010724642,0.0011682921,0.000296336],"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.00010049384,0.000029502815,0.0068614916,0.000062179024,0.000016639913,0.00040954433,0.0008203629,0.0031671529,0.002557689,0.97665036,0.0006322524,0.008692324],"study_design_scores_gemma":[0.000053825515,0.00017836422,0.017016362,0.00014057175,0.00006684349,0.0015082968,0.0013010834,0.030023169,0.0044272095,0.9294294,0.01577805,0.000076801196],"about_ca_topic_score_codex":0.0012512071,"about_ca_topic_score_gemma":0.00063550187,"teacher_disagreement_score":0.004230826,"about_ca_system_score_codex":0.0015903338,"about_ca_system_score_gemma":0.00037511965,"threshold_uncertainty_score":0.01415354},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010861234,0.00021345906,0.9840479,0.00011027329,0.00003531376,0.00012818609,0.000036858317,0.001129542,0.0034372462],"genre_scores_gemma":[0.29867005,0.00042233092,0.6940219,0.000113037626,0.000072173934,0.00025005438,0.00017128586,0.00024840984,0.00603074],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839634,0.00027122608,0.000113343034,0.00024629183,0.0007422645,0.00023046159],"domain_scores_gemma":[0.9978465,0.0007874647,0.00016555282,0.0009329796,0.00021016058,0.000057284335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001128136,0.00077364285,0.0008769137,0.0013262673,0.0006244087,0.0014784124,0.0014403207,0.0009075566,0.006855527],"category_scores_gemma":[0.0033577685,0.0005343171,0.0010845906,0.000912645,0.0014645389,0.0032624695,0.0030040503,0.0018651888,0.0022766676],"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.0004422124,0.0002616642,0.00081176014,0.00044575488,0.00009578022,0.00024810896,0.00037232638,0.040164117,0.06202606,0.22865027,0.004244761,0.6622372],"study_design_scores_gemma":[0.0003423311,0.00042902288,0.00061476906,0.00009104098,0.000068067,0.0014687862,0.00018566445,0.62411904,0.12173107,0.22987074,0.020973612,0.00010582636],"about_ca_topic_score_codex":0.0003971489,"about_ca_topic_score_gemma":0.00061308465,"teacher_disagreement_score":0.006855527,"about_ca_system_score_codex":0.00071957585,"about_ca_system_score_gemma":0.0012490209,"threshold_uncertainty_score":0.02293402},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27630064,0.03948095,0.5824376,0.0011706761,0.00091928005,0.00035670865,0.0001867684,0.0016371489,0.09751026],"genre_scores_gemma":[0.8682441,0.016573474,0.09443931,0.00019342247,0.00022098306,0.000099669,0.00026536963,0.00004958573,0.01991402],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996655,0.00004641557,0.000023521323,0.00006475422,0.00015382098,0.000046033325],"domain_scores_gemma":[0.9998179,0.00003220206,0.000018943509,0.000026494654,0.00009437726,0.000010077127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026934533,0.0003663087,0.0003030052,0.0006769932,0.0002830013,0.0005689657,0.00043609677,0.00033157342,0.002117462],"category_scores_gemma":[0.00037845853,0.00018208253,0.00027636308,0.0006271486,0.00023395776,0.0013592403,0.00021178275,0.00035215952,0.00059801183],"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.00047480996,0.00015043872,0.005356756,0.0014242003,0.00010670582,0.00089827256,0.00042881802,0.039071005,0.23973535,0.08262221,0.0062263436,0.62350523],"study_design_scores_gemma":[0.00021256898,0.0030084488,0.00970937,0.0005896748,0.00023236539,0.005705269,0.00037188694,0.25682613,0.4681034,0.01381749,0.24121526,0.00020806465],"about_ca_topic_score_codex":0.0008034976,"about_ca_topic_score_gemma":0.00039852355,"teacher_disagreement_score":0.002117462,"about_ca_system_score_codex":0.000455706,"about_ca_system_score_gemma":0.0004320162,"threshold_uncertainty_score":0.007083595},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5819855,0.0016864066,0.32983395,0.0015839817,0.0004021599,0.000116301926,0.0007359675,0.0006326954,0.083022945],"genre_scores_gemma":[0.9473104,0.00032452942,0.03604446,0.00039573328,0.00035477194,0.00013296616,0.0004981771,0.00008594008,0.014852876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990256,0.00019617824,0.00006655915,0.0002663031,0.00022661111,0.00021874101],"domain_scores_gemma":[0.9971079,0.0016481928,0.00030494304,0.00032934366,0.00028244746,0.0003272126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018868805,0.0007050514,0.0007191696,0.0021092964,0.001777823,0.002886696,0.0012033468,0.00076126447,0.0070683686],"category_scores_gemma":[0.0031747175,0.0005815194,0.0015246179,0.0010310168,0.0033899269,0.0074371854,0.002591942,0.0022025965,0.0008488893],"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.000108562075,0.00003303223,0.001797398,0.00010120864,0.00002150018,0.00036351813,0.00073265744,0.0013393022,0.004528125,0.983073,0.0012091085,0.0066926135],"study_design_scores_gemma":[0.00004432213,0.000096409494,0.0011839756,0.000047512625,0.000026203805,0.00045231965,0.00015915929,0.007374303,0.0037616799,0.9803894,0.0064310427,0.000033608445],"about_ca_topic_score_codex":0.0005914941,"about_ca_topic_score_gemma":0.0005060859,"teacher_disagreement_score":0.0070683686,"about_ca_system_score_codex":0.0012175576,"about_ca_system_score_gemma":0.0004581563,"threshold_uncertainty_score":0.023646057},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019052102,0.027974213,0.016873216,0.0014308003,0.0015484936,0.000028219143,0.00037286963,0.0005092903,0.94935757],"genre_scores_gemma":[0.08258338,0.029044757,0.020701932,0.0010982946,0.0021642079,0.0001400034,0.0011745661,0.0004318028,0.8626611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997415,0.000056040626,0.0000116148385,0.000040796207,0.00012246809,0.000027526597],"domain_scores_gemma":[0.9998416,0.000045135886,0.00001264004,0.00004145498,0.00004132224,0.000017876318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026369424,0.00088840025,0.00058570766,0.0015319423,0.0008026857,0.004366688,0.0006962847,0.00057653314,0.034768697],"category_scores_gemma":[0.0010490847,0.00039844395,0.00029071493,0.0022996673,0.0015967587,0.0029577338,0.00095848535,0.0021546737,0.01767151],"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.000006234343,0.00000759572,0.000033838613,0.00006077332,0.0000023695031,0.000015274834,0.00018486862,0.00016274118,0.0002877599,0.9067411,0.048231933,0.044265635],"study_design_scores_gemma":[0.000004962708,0.000008434148,0.00012983869,0.00007599404,0.0000029969983,0.00009716181,0.000083501895,0.00037787572,0.00018541046,0.4745436,0.52448475,0.000005417514],"about_ca_topic_score_codex":0.00095050264,"about_ca_topic_score_gemma":0.0010066269,"teacher_disagreement_score":0.034768697,"about_ca_system_score_codex":0.0014570056,"about_ca_system_score_gemma":0.0006867992,"threshold_uncertainty_score":0.11631286},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014633971,0.018896105,0.022560218,0.0045139557,0.001636905,0.00003722854,0.0003663059,0.000119444056,0.9372359],"genre_scores_gemma":[0.19792646,0.020918367,0.012642617,0.0019393704,0.0022309194,0.0000830401,0.0005854657,0.00020950494,0.76346433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99972695,0.00003827791,0.000013379372,0.000039622453,0.00014635662,0.00003539888],"domain_scores_gemma":[0.99982893,0.00006769245,0.0000132262585,0.000034422843,0.000041037896,0.000014739488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032313872,0.0007100716,0.0007416451,0.0009216623,0.0012184597,0.0018083879,0.00073881075,0.00064958987,0.021653367],"category_scores_gemma":[0.0009824712,0.00047636149,0.00044828866,0.0017228543,0.0014992958,0.0033622524,0.0010018211,0.0038394458,0.006127989],"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.000009126344,0.000018903947,0.00003888016,0.00006448459,0.0000040012087,0.000038308306,0.00021719515,0.00035128044,0.00030445805,0.96276796,0.015789082,0.020396179],"study_design_scores_gemma":[0.00001093149,0.000010171385,0.00017396625,0.0000439656,0.0000053266986,0.00015143494,0.000056460267,0.0007892169,0.00028530613,0.8834531,0.11501309,0.0000070000106],"about_ca_topic_score_codex":0.0010165137,"about_ca_topic_score_gemma":0.0009487375,"teacher_disagreement_score":0.021653367,"about_ca_system_score_codex":0.001876272,"about_ca_system_score_gemma":0.00082012627,"threshold_uncertainty_score":0.0724377},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013491212,0.003685031,0.0059365123,0.00081708713,0.0008011503,0.000014824278,0.0002224663,0.00023388829,0.98693997],"genre_scores_gemma":[0.05046644,0.0050892388,0.007091066,0.0007861215,0.0012057122,0.000054832388,0.00051990955,0.00035909496,0.9344275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997093,0.000041306488,0.000009648658,0.000066254484,0.00013764144,0.000035763813],"domain_scores_gemma":[0.99977773,0.000055693145,0.000015893855,0.00005876391,0.00006593672,0.000026049458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026090784,0.00080406753,0.0005509686,0.0010694034,0.00093017163,0.0035404745,0.0005138575,0.0004226924,0.09325934],"category_scores_gemma":[0.0011784111,0.00035102473,0.00029104855,0.0012490496,0.0013932958,0.002967354,0.0010836528,0.0024434985,0.047209278],"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.00002644331,0.000016658923,0.00006483918,0.00008761821,0.0000039982333,0.000036810154,0.00020666995,0.00018441763,0.0006842778,0.8295187,0.09093462,0.078234985],"study_design_scores_gemma":[0.0000074757413,0.000010952836,0.00014121491,0.000053887383,0.0000039028264,0.00012361759,0.00004333774,0.00024860367,0.0004376831,0.31180328,0.687121,0.0000050750973],"about_ca_topic_score_codex":0.00042877867,"about_ca_topic_score_gemma":0.00063429255,"teacher_disagreement_score":0.09325934,"about_ca_system_score_codex":0.00088289106,"about_ca_system_score_gemma":0.00050834013,"threshold_uncertainty_score":0.31198353},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020716034,0.18104263,0.04161474,0.0050764377,0.0025564302,0.00004341043,0.00020034988,0.00031401071,0.748436],"genre_scores_gemma":[0.38422167,0.25577533,0.03878353,0.0023187844,0.006422923,0.00007741951,0.00050977775,0.00027765078,0.31161287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998124,0.00004420924,0.000008205768,0.000030063238,0.000081053324,0.00002403571],"domain_scores_gemma":[0.99974626,0.00011545259,0.000029880095,0.00003703957,0.000043104963,0.000028239554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023803391,0.00062853267,0.0003425528,0.0018958506,0.0010654279,0.0023521483,0.0003878969,0.0005567473,0.011546753],"category_scores_gemma":[0.00064679235,0.00025564057,0.0002410438,0.0034443964,0.0021770399,0.0037095607,0.0010298466,0.0015860694,0.0027062767],"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.0000059053427,0.000007145179,0.000087155415,0.00014220018,0.000002004145,0.00005084118,0.00020477315,0.00080990663,0.0003794573,0.950471,0.011582777,0.036256768],"study_design_scores_gemma":[0.0000023610996,0.000013702692,0.00025564368,0.0001367415,0.0000028409472,0.00036194414,0.0002162627,0.0012381412,0.00038561525,0.7195423,0.27783477,0.000009534944],"about_ca_topic_score_codex":0.0007882745,"about_ca_topic_score_gemma":0.0008309797,"teacher_disagreement_score":0.011546753,"about_ca_system_score_codex":0.0013234705,"about_ca_system_score_gemma":0.00046669898,"threshold_uncertainty_score":0.038627744},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11499354,0.00043361512,0.8769678,0.0002808489,0.00012622771,0.00020852653,0.0000718604,0.0013555493,0.005562164],"genre_scores_gemma":[0.82708013,0.00025556204,0.16964221,0.000096406315,0.00007851911,0.00013767935,0.000093670395,0.00009690907,0.0025190343],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99713814,0.00094607397,0.00022041984,0.0003635686,0.0011033674,0.00022845424],"domain_scores_gemma":[0.9949173,0.0011380704,0.0009675931,0.0022589422,0.00062834326,0.0000898345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002021729,0.00068190345,0.0005417626,0.00069863844,0.0003690835,0.0010306833,0.00063202303,0.00071732973,0.0015099534],"category_scores_gemma":[0.0070543,0.00025792723,0.00037032162,0.0006568087,0.0011217373,0.0017889701,0.0008399284,0.0007797353,0.0010777285],"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.001522751,0.00030771783,0.0045883306,0.0004629032,0.00017856246,0.0008189828,0.00036133645,0.12810872,0.26048416,0.23000987,0.0028154403,0.37034115],"study_design_scores_gemma":[0.00023199353,0.0014688404,0.0014885071,0.00010213344,0.00008364373,0.00223684,0.00007022655,0.53584963,0.38411713,0.059157267,0.015065801,0.00012791262],"about_ca_topic_score_codex":0.00008956926,"about_ca_topic_score_gemma":0.00008809165,"teacher_disagreement_score":0.002021729,"about_ca_system_score_codex":0.00039345742,"about_ca_system_score_gemma":0.00073346455,"threshold_uncertainty_score":0.01069206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10567674,0.0017015102,0.8758538,0.0022217203,0.00023159823,0.00023940977,0.0004391154,0.0016103077,0.0120258415],"genre_scores_gemma":[0.8537996,0.0013371652,0.12872078,0.0005274218,0.0009624298,0.0004802425,0.0008419107,0.0006361534,0.012694367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99388427,0.0019060766,0.00027271447,0.0010803553,0.0020262005,0.0008302561],"domain_scores_gemma":[0.9227876,0.06113306,0.0036897277,0.0064739147,0.0042537395,0.00166193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010588113,0.002065423,0.002380351,0.0034807571,0.0016578434,0.0038359019,0.004406244,0.0024337694,0.00801583],"category_scores_gemma":[0.066015445,0.0010330383,0.0019402936,0.0027749976,0.004138916,0.006087205,0.0040538544,0.0034835797,0.0017485913],"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.0016725573,0.00031621108,0.015269757,0.0005676963,0.00029491354,0.00034716047,0.000533548,0.40336755,0.008330411,0.42845452,0.014991696,0.12585397],"study_design_scores_gemma":[0.000050313804,0.00013158709,0.0010567221,0.000052307398,0.00008137395,0.00023116443,0.000052375384,0.93130904,0.0020900415,0.06399869,0.00090984826,0.000036553865],"about_ca_topic_score_codex":0.0019393602,"about_ca_topic_score_gemma":0.0014396954,"teacher_disagreement_score":0.010588113,"about_ca_system_score_codex":0.0037348613,"about_ca_system_score_gemma":0.0036470403,"threshold_uncertainty_score":0.05599594},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9392476,0.00035333692,0.026561249,0.00057074527,0.000042433177,0.000030346568,0.00019133877,0.00010762354,0.032895304],"genre_scores_gemma":[0.99001956,0.0001803206,0.005768262,0.0000426364,0.000051249575,0.000018475132,0.0001438877,0.000025166011,0.0037504758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936277,0.00012394902,0.000027067877,0.000104127575,0.0002247811,0.00015727083],"domain_scores_gemma":[0.9988912,0.00025770668,0.00027881906,0.00008537174,0.000119450284,0.00036741694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060809735,0.0004017188,0.00042370195,0.0017678594,0.0010743283,0.0023027565,0.00050186313,0.00041262087,0.0028990696],"category_scores_gemma":[0.0022678864,0.00028784745,0.00035570186,0.000635141,0.0033767584,0.0026957982,0.0017251143,0.0012575525,0.00043126504],"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.0001065722,0.000018276449,0.0012276924,0.000023618619,0.00000542084,0.00016074482,0.00030806294,0.0032563556,0.0027139056,0.9874769,0.0003665165,0.0043359403],"study_design_scores_gemma":[0.000038653365,0.00006939813,0.0016981469,0.000020219826,0.000007935101,0.0002274327,0.0003382427,0.01500359,0.003708574,0.9752755,0.003580574,0.000031733533],"about_ca_topic_score_codex":0.001054238,"about_ca_topic_score_gemma":0.000840605,"teacher_disagreement_score":0.0028990696,"about_ca_system_score_codex":0.0015828573,"about_ca_system_score_gemma":0.0006562399,"threshold_uncertainty_score":0.011484504},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1155758,0.0008147593,0.85783297,0.00046967453,0.00030538414,0.00022957365,0.00034262252,0.0058447313,0.018584555],"genre_scores_gemma":[0.5496904,0.00035601627,0.43108705,0.0002749681,0.000087005115,0.00016037571,0.000754783,0.00014753692,0.01744188],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99988854,0.00001377606,0.000009160903,0.000017340128,0.00005322302,0.000017857461],"domain_scores_gemma":[0.9998704,0.000022115948,0.000021640151,0.00003443097,0.000034776054,0.000016562468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017348607,0.00040448204,0.00022105822,0.00033154374,0.00024250528,0.00038776363,0.00069173396,0.0002712394,0.008393687],"category_scores_gemma":[0.00039367838,0.00015136201,0.00018323165,0.00033653516,0.0001516411,0.00077400275,0.00037242335,0.00041622936,0.0024265377],"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.0013423039,0.00020535073,0.0021458694,0.0004762061,0.00006046929,0.0008692507,0.00018767874,0.033071578,0.42949256,0.03414755,0.022175774,0.47582552],"study_design_scores_gemma":[0.00037193057,0.0017986657,0.0029963413,0.00009944616,0.00006861879,0.0018322925,0.000109212844,0.5487437,0.31854168,0.008125148,0.11722303,0.00008992904],"about_ca_topic_score_codex":0.00042471453,"about_ca_topic_score_gemma":0.0008228011,"teacher_disagreement_score":0.008393687,"about_ca_system_score_codex":0.00030274558,"about_ca_system_score_gemma":0.00045907524,"threshold_uncertainty_score":0.028079629},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083911434,0.00067945896,0.7719959,0.0017541108,0.0008344896,0.00042754743,0.00075392623,0.002901806,0.13674136],"genre_scores_gemma":[0.8173263,0.0005632939,0.09220979,0.00068533083,0.0004594173,0.0006218483,0.00063658284,0.0010210607,0.08647649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983907,0.00037312234,0.00006224318,0.00022623978,0.0006136518,0.0003340576],"domain_scores_gemma":[0.99864835,0.00053085596,0.00013247337,0.00041459186,0.00015686237,0.000116871546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001144753,0.00079806196,0.00087608106,0.0009850318,0.0014252511,0.0025066028,0.0009278012,0.0013059742,0.016183129],"category_scores_gemma":[0.0033949437,0.00047564073,0.0007058208,0.0012520005,0.0015178656,0.0031180216,0.0027885775,0.0026243525,0.004980041],"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.0000894472,0.00003647511,0.00008511166,0.000034118788,0.00000972147,0.00009150047,0.00007253097,0.0021242828,0.0030048694,0.9753059,0.003675586,0.0154705085],"study_design_scores_gemma":[0.00004076201,0.000060153074,0.00016239037,0.000059502072,0.000015072714,0.0002427183,0.000032674605,0.027034516,0.01371269,0.9421607,0.0164335,0.000045255565],"about_ca_topic_score_codex":0.00020613906,"about_ca_topic_score_gemma":0.00035512395,"teacher_disagreement_score":0.016183129,"about_ca_system_score_codex":0.00096044305,"about_ca_system_score_gemma":0.0008506431,"threshold_uncertainty_score":0.054138005},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9991534,0.00014091608,0.000077227865,0.000011513861,0.000002375102,0.000015902953,0.00034428056,0.0000046329073,0.00024972364],"genre_scores_gemma":[0.99922645,0.00006059683,0.00007196587,0.000014247971,0.0000069872117,0.000014609088,0.00054599176,0.0000025380107,0.000056613717],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991854,0.000121538855,0.00009327314,0.0002652102,0.00017349655,0.00016108193],"domain_scores_gemma":[0.9981482,0.00018768913,0.0011522002,0.00020358412,0.000105575346,0.00020282176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006026068,0.00029981064,0.0005892228,0.0012519212,0.0006945295,0.0008053446,0.00051868375,0.0004896146,0.0020645426],"category_scores_gemma":[0.002374136,0.00030048253,0.0005700383,0.0014160434,0.00038010825,0.0007158653,0.00072667765,0.0004888314,0.00032703634],"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.00010270599,0.00002335447,0.9986052,0.000008757567,0.000017657854,0.00018852978,0.000026363876,0.000028089315,0.00010712435,0.0000128331985,0.000039969364,0.0008394214],"study_design_scores_gemma":[0.00002092731,0.0002796432,0.99663675,0.000011423807,0.000029218212,0.0023475536,0.00017530676,0.00012825448,0.000086947424,0.00003438937,0.00024272432,0.0000067405294],"about_ca_topic_score_codex":0.0015229355,"about_ca_topic_score_gemma":0.0025096256,"teacher_disagreement_score":0.0020645426,"about_ca_system_score_codex":0.00035424193,"about_ca_system_score_gemma":0.00055930804,"threshold_uncertainty_score":0.0069066286},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029031688,0.0019970606,0.0029254586,0.001025956,0.0023003952,0.00033798788,0.10825411,0.0031645403,0.87709135],"genre_scores_gemma":[0.019211045,0.0027816503,0.0074251583,0.00044098377,0.00039910007,0.00020241404,0.078487635,0.0030350296,0.888017],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99974936,0.000010674979,0.0000123643595,0.00004463265,0.00014368311,0.000039213443],"domain_scores_gemma":[0.9995933,0.00007356268,0.000045778936,0.00005908808,0.00015984364,0.000068538015],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014684783,0.0011607723,0.00054071925,0.0024613498,0.0013323354,0.0014507164,0.0011008783,0.00066636596,0.8010521],"category_scores_gemma":[0.0013508036,0.0003702117,0.00048469196,0.0024750542,0.0007170448,0.0017487413,0.0012200756,0.0012577723,0.5281268],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000036703026,0.00001582341,0.00032625347,0.00022949852,0.00000514002,0.00013611375,0.00014070782,0.00009593536,0.0003910284,0.001666238,0.963003,0.03395357],"study_design_scores_gemma":[0.0000047388044,0.000003835391,0.0016183768,0.00006458682,0.0000030296835,0.00018340473,0.00004892852,0.000036531874,0.00011540593,0.00048527183,0.9974322,0.0000037770524],"about_ca_topic_score_codex":0.036316898,"about_ca_topic_score_gemma":0.12663928,"teacher_disagreement_score":0.9636831,"about_ca_system_score_codex":0.0015122413,"about_ca_system_score_gemma":0.0014283212,"threshold_uncertainty_score":0.28377497},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117268965,0.018235588,0.019945823,0.0016313815,0.0012978937,0.0014506805,0.020796236,0.0023870738,0.8169864],"genre_scores_gemma":[0.6624914,0.009935058,0.032258425,0.0021358605,0.00066557113,0.00071379624,0.025725687,0.00057487225,0.26549935],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996377,0.000039290513,0.000040578885,0.00013207026,0.00010665663,0.000043560576],"domain_scores_gemma":[0.9997973,0.000025926172,0.000053106975,0.000026615893,0.000058427424,0.000038680864],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018380262,0.0011892437,0.00081755687,0.0027886876,0.0026770285,0.0010972442,0.0011810501,0.0007899284,0.062446788],"category_scores_gemma":[0.00054107216,0.00039716446,0.0003815477,0.0012152398,0.00075655826,0.002462979,0.0018726821,0.0013786723,0.01938685],"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.0010737021,0.0002850425,0.012743788,0.0021842269,0.00009115773,0.0015235511,0.002426538,0.0010627168,0.08464491,0.028212812,0.05471875,0.81103283],"study_design_scores_gemma":[0.00007092807,0.00027540696,0.041910663,0.00048231182,0.00010150128,0.00399183,0.0009681275,0.00054159266,0.004511452,0.004936523,0.9421552,0.000054479977],"about_ca_topic_score_codex":0.0033855943,"about_ca_topic_score_gemma":0.006162123,"teacher_disagreement_score":0.9375532,"about_ca_system_score_codex":0.0009364635,"about_ca_system_score_gemma":0.0006968268,"threshold_uncertainty_score":0.20890534},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"reproducibility","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"reproducibility","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030887248,0.0422974,0.02436296,0.055242907,0.034977112,0.0009740826,0.25453267,0.034959063,0.5495651],"genre_scores_gemma":[0.045282356,0.0459874,0.060602043,0.009075611,0.02169539,0.0017348623,0.19278336,0.037778266,0.5850607],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9890298,0.0019811932,0.0014594074,0.00078391604,0.006097557,0.00064819824],"domain_scores_gemma":[0.92397213,0.022193437,0.006141377,0.014593987,0.027777735,0.005321249],"candidate_categories":["metaresearch","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.010354442,0.0016124308,0.0023483604,0.046874125,0.003407284,0.018087065,0.001675447,0.002564236,0.35035175],"category_scores_gemma":[0.0863388,0.0007573961,0.00083148386,0.08189721,0.0019487094,0.0091467155,0.006351058,0.0021180885,0.16844073],"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.00004135094,0.000011954485,0.00023105356,0.0005689891,0.000010339421,0.00007854397,0.00023575408,0.00008555858,0.00024793675,0.00887908,0.9123331,0.077276394],"study_design_scores_gemma":[0.0000072192524,0.0000063775337,0.00035048,0.0005536521,0.000004593806,0.0000621509,0.00010731957,0.00009148199,0.00010319276,0.001435184,0.99726427,0.000014116923],"about_ca_topic_score_codex":0.024598897,"about_ca_topic_score_gemma":0.02298147,"teacher_disagreement_score":0.98964554,"about_ca_system_score_codex":0.006324662,"about_ca_system_score_gemma":0.014975454,"threshold_uncertainty_score":0.9266444},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032044798,0.0015603638,0.001591571,0.05497824,0.0020876988,0.00037944588,0.8412072,0.00090759946,0.09408346],"genre_scores_gemma":[0.029877746,0.0025117742,0.0051108054,0.028519753,0.0006534382,0.0009540395,0.8495077,0.0008198837,0.08204481],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98836285,0.0010868086,0.0004453483,0.0010420536,0.0065745316,0.0024883894],"domain_scores_gemma":[0.9592803,0.0027877337,0.00062047015,0.002689343,0.026827212,0.007794833],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.011977028,0.0006679785,0.0010529984,0.004319156,0.0057291654,0.009251132,0.0033898768,0.0018532587,0.04027111],"category_scores_gemma":[0.027153142,0.00065574225,0.000946341,0.011632002,0.0018396254,0.0032862006,0.0046473746,0.004991585,0.013834727],"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":false,"study_design_scores_codex":[0.000032743486,0.000004437024,0.0012398874,0.00004627605,0.0000049044293,0.000008457914,0.000047895097,0.00005657227,0.000050497896,0.0040274523,0.9896443,0.0048365993],"study_design_scores_gemma":[0.000019039773,0.000003209945,0.006200152,0.000115184484,0.000005820047,0.000011555973,0.00021533419,0.00012791668,0.00011319558,0.00091249176,0.99225676,0.000019376288],"about_ca_topic_score_codex":0.9567842,"about_ca_topic_score_gemma":0.9775754,"teacher_disagreement_score":0.9966101,"about_ca_system_score_codex":0.03973234,"about_ca_system_score_gemma":0.13141663,"threshold_uncertainty_score":0.28827965},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29061058,0.090316586,0.009107781,0.001303242,0.0010152874,0.00029552382,0.0048279436,0.0011682091,0.6013547],"genre_scores_gemma":[0.90107274,0.010769554,0.0050284737,0.0010728663,0.00021370602,0.00011577782,0.0035978358,0.000058767593,0.07807022],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99985945,0.000010193692,0.000008478233,0.000044474647,0.000039056667,0.00003825167],"domain_scores_gemma":[0.9999063,0.000014504957,0.00003383318,0.0000079756755,0.000021162612,0.000016099268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016002252,0.00070833357,0.00037518312,0.0017581744,0.0012260899,0.0004792794,0.0004903402,0.00042183942,0.011858897],"category_scores_gemma":[0.00036987002,0.00024091355,0.00020631445,0.0006312437,0.0003668764,0.000914381,0.0009098996,0.00051735924,0.0041206367],"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.00064322184,0.00014320179,0.024615245,0.00094544323,0.000057777477,0.0019280356,0.0017028393,0.00079354114,0.080367856,0.0077701434,0.032108597,0.8489242],"study_design_scores_gemma":[0.00008859328,0.0005198073,0.33428618,0.0015056113,0.00014925495,0.009534715,0.0013277889,0.0010729505,0.010097193,0.0031999366,0.63812035,0.000097629265],"about_ca_topic_score_codex":0.026235407,"about_ca_topic_score_gemma":0.04190451,"teacher_disagreement_score":0.026235407,"about_ca_system_score_codex":0.0012510016,"about_ca_system_score_gemma":0.0005039222,"threshold_uncertainty_score":0.05216539},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18535301,0.00062193844,0.057439614,0.006547543,0.0022983695,0.00096219924,0.0032937524,0.02975088,0.7137327],"genre_scores_gemma":[0.6325596,0.00023398933,0.036287505,0.0011610835,0.00012926938,0.00010852983,0.0016523709,0.0013756593,0.326492],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99798715,0.00015286762,0.000046434034,0.00015232002,0.0012394489,0.0004217817],"domain_scores_gemma":[0.9972024,0.00020486565,0.00007706501,0.0006743519,0.0015758045,0.0002656154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013914838,0.0004143114,0.00044238966,0.0011259796,0.0017392641,0.0013471422,0.00089028187,0.00084934477,0.050926942],"category_scores_gemma":[0.0051593487,0.00029011327,0.00032690042,0.0008997275,0.0009379976,0.0014473612,0.0019360174,0.0011644657,0.018848693],"study_design_candidate":"not_applicable","study_design_consensus":null,"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.0037538419,0.0004384199,0.010416286,0.00031153948,0.00007047756,0.000599349,0.0008706682,0.007247422,0.048431434,0.08955576,0.3315469,0.50675786],"study_design_scores_gemma":[0.0004910187,0.00076806673,0.008339381,0.00016357108,0.00009514984,0.00084934256,0.0007469112,0.05269318,0.11170968,0.013855935,0.8100833,0.00020452726],"about_ca_topic_score_codex":0.0867376,"about_ca_topic_score_gemma":0.1592166,"teacher_disagreement_score":0.91326237,"about_ca_system_score_codex":0.0034112146,"about_ca_system_score_gemma":0.008994346,"threshold_uncertainty_score":0.17246544},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37220082,0.0014191802,0.34986517,0.0047114906,0.0006434218,0.00032004816,0.00017307365,0.0018739826,0.26879284],"genre_scores_gemma":[0.8426586,0.0007932242,0.111993946,0.00039263177,0.000094181756,0.00011003363,0.00014623483,0.00017362271,0.043637447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861574,0.00035743555,0.000035734436,0.00010963578,0.0005906535,0.00029072943],"domain_scores_gemma":[0.9993838,0.00024676853,0.000028954699,0.00021763754,0.00008244549,0.00004035788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011763782,0.00050057034,0.0005856301,0.0005444566,0.0013147785,0.0012399011,0.0005840679,0.0009203574,0.003601929],"category_scores_gemma":[0.0027435448,0.00036201172,0.00046874568,0.00045058524,0.0019127933,0.0023254966,0.0026912943,0.0023524964,0.0010895078],"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.00034921346,0.00018811222,0.00078484736,0.00013059886,0.000031682634,0.00035624785,0.0013663566,0.016107783,0.019566426,0.8482103,0.011124335,0.1017841],"study_design_scores_gemma":[0.00026894067,0.0004897388,0.0011345156,0.00018918462,0.0000728095,0.00061508844,0.0005683996,0.23747467,0.11015581,0.5301649,0.11876252,0.00010342357],"about_ca_topic_score_codex":0.0017034693,"about_ca_topic_score_gemma":0.0020480978,"teacher_disagreement_score":0.003601929,"about_ca_system_score_codex":0.0015480113,"about_ca_system_score_gemma":0.0012941752,"threshold_uncertainty_score":0.012049675},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14600396,0.055203456,0.053671055,0.06597864,0.0065225856,0.00013807154,0.0015358086,0.0004280891,0.6705183],"genre_scores_gemma":[0.7570653,0.05201266,0.011930873,0.0018166376,0.013443402,0.00013816448,0.0013008751,0.00024276756,0.16204931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987954,0.00039651748,0.00004404002,0.0001361457,0.00039064753,0.00023715718],"domain_scores_gemma":[0.995175,0.0036235712,0.00027782604,0.0002736265,0.0002817529,0.00036821928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014197696,0.0017709782,0.0023510007,0.003326909,0.002825868,0.0055210507,0.0012510635,0.0018936069,0.017949978],"category_scores_gemma":[0.00733383,0.00059767364,0.0006403917,0.006824811,0.005248248,0.008219312,0.002743109,0.0045776735,0.0021135611],"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.0002004351,0.00010707124,0.0007529729,0.00027320045,0.000029668316,0.00029210397,0.00045605222,0.0093306955,0.00031701662,0.91407,0.046170197,0.028000489],"study_design_scores_gemma":[0.000056484012,0.000019050025,0.00047411548,0.00010581989,0.00001388362,0.00007405935,0.0002030904,0.009834128,0.00017909218,0.9722572,0.016760625,0.000022526316],"about_ca_topic_score_codex":0.011446745,"about_ca_topic_score_gemma":0.011579514,"teacher_disagreement_score":0.017949978,"about_ca_system_score_codex":0.005525069,"about_ca_system_score_gemma":0.0026668569,"threshold_uncertainty_score":0.06004864},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120218456,0.039666153,0.14740929,0.013145482,0.0021180788,0.00019016914,0.00040450852,0.0009918888,0.675856],"genre_scores_gemma":[0.87415534,0.022572238,0.03175335,0.00082591496,0.0020763304,0.00010123979,0.00021217705,0.00013342754,0.068170056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994185,0.00012251122,0.000025173857,0.0000884249,0.00025278036,0.00009260534],"domain_scores_gemma":[0.9995276,0.00015017523,0.000046870056,0.00013161288,0.000082049606,0.000061711835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065343647,0.0005774736,0.00044418982,0.0013354307,0.0013654837,0.0028527689,0.0004306396,0.0007359472,0.005609169],"category_scores_gemma":[0.0016279783,0.00018047675,0.00037751012,0.0015180917,0.006255892,0.0037730322,0.0015258386,0.0017906203,0.0013537363],"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.0000056036247,0.0000041313574,0.00006389232,0.00002844567,0.0000013067712,0.000039575134,0.00013468992,0.00091247866,0.00024119952,0.9882813,0.0017805141,0.008506769],"study_design_scores_gemma":[0.000007918915,0.000014108083,0.00013097681,0.000031398933,0.0000020966272,0.000112574475,0.000098033415,0.0021797798,0.00032586712,0.946452,0.05063595,0.000009262248],"about_ca_topic_score_codex":0.0057736435,"about_ca_topic_score_gemma":0.0029853657,"teacher_disagreement_score":0.0057736435,"about_ca_system_score_codex":0.0034043123,"about_ca_system_score_gemma":0.0019697167,"threshold_uncertainty_score":0.024700165},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012609822,0.00022964238,0.02276827,0.00042553322,0.0004152928,0.0001184194,0.018962363,0.89620274,0.05961678],"genre_scores_gemma":[0.034628946,0.00028928337,0.016075855,0.0011782477,0.00031743242,0.0003146085,0.06804071,0.7833692,0.09578571],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985927,0.00016136358,0.00007455362,0.00026515347,0.00060135254,0.00030493175],"domain_scores_gemma":[0.9969477,0.00042076377,0.00011536989,0.0014213419,0.0007951391,0.00029963083],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0018542574,0.0029168327,0.0017307822,0.002041725,0.001079556,0.00433382,0.005742564,0.003354931,0.5273917],"category_scores_gemma":[0.007636556,0.0031203064,0.0014629867,0.0017874722,0.0010433492,0.005823183,0.0049034185,0.0037586761,0.56557584],"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.00036823473,0.000045399396,0.00052551745,0.00028598998,0.000033171986,0.000076714394,0.00007527905,0.00043916184,0.0024693739,0.0031858836,0.9647181,0.027777048],"study_design_scores_gemma":[0.00057043234,0.00013206387,0.0014162892,0.00015741559,0.00003717888,0.00032111004,0.00006727951,0.006899235,0.025288964,0.012435273,0.95251226,0.00016232439],"about_ca_topic_score_codex":0.0053414144,"about_ca_topic_score_gemma":0.0039289226,"teacher_disagreement_score":0.47260833,"about_ca_system_score_codex":0.0020614315,"about_ca_system_score_gemma":0.001131413,"threshold_uncertainty_score":0.6741184},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06256815,0.0004738794,0.92156446,0.000366427,0.00017203332,0.00018736317,0.00016956692,0.0005405451,0.013957518],"genre_scores_gemma":[0.694631,0.0007144681,0.29166502,0.00038830916,0.00022078396,0.0002792792,0.0004496079,0.00015868356,0.011492839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886215,0.0002860081,0.0001036752,0.00021773687,0.00042444526,0.00010586903],"domain_scores_gemma":[0.9981219,0.0006018196,0.00038460636,0.00062067,0.00018690382,0.0000841186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087005144,0.0005069147,0.00051648467,0.0008517814,0.00054432766,0.0012945961,0.0005352614,0.0008087083,0.0038420036],"category_scores_gemma":[0.0046729916,0.00027564392,0.0006276315,0.00074862945,0.0012998403,0.0031229611,0.001780515,0.0013763288,0.0014378869],"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.0003891013,0.000053391665,0.0006555001,0.00027760465,0.000027966977,0.00026869262,0.00042502803,0.019660573,0.038623635,0.80395526,0.0018931634,0.13377014],"study_design_scores_gemma":[0.00009442511,0.00035532637,0.0005212862,0.0001264126,0.000040593844,0.0014478089,0.0001846421,0.16086881,0.08062754,0.7265736,0.029051412,0.00010816542],"about_ca_topic_score_codex":0.00012898743,"about_ca_topic_score_gemma":0.0001547399,"teacher_disagreement_score":0.0038420036,"about_ca_system_score_codex":0.00052770093,"about_ca_system_score_gemma":0.0012235112,"threshold_uncertainty_score":0.012852728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99434835,0.00046047565,0.0016224557,0.000031589334,0.0000056443732,0.000029155071,0.00026535633,0.000056062334,0.0031809402],"genre_scores_gemma":[0.9928255,0.000459571,0.0042039133,0.00002488313,0.0000035061453,0.000029654864,0.00020194617,0.000019816098,0.0022311988],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9997527,0.000033754055,0.000010226682,0.00006994016,0.000095941825,0.000037356527],"domain_scores_gemma":[0.9998591,0.000023820681,0.000037018428,0.000009577956,0.000060306884,0.000010146048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028219196,0.00038951662,0.0005064404,0.0011974067,0.0003734471,0.0006299459,0.0004601337,0.00055900664,0.0007354985],"category_scores_gemma":[0.00032897858,0.0003062501,0.00034143255,0.0011329099,0.00044538692,0.0001735534,0.00040873903,0.00023115442,0.0003289946],"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.0004790098,0.00006440079,0.3145078,0.0005410117,0.00013236205,0.0007175519,0.003005156,0.0013483906,0.63263446,0.00050611276,0.00018046153,0.0458832],"study_design_scores_gemma":[0.000020800015,0.00047410192,0.8965626,0.00007452581,0.00012153254,0.00069378794,0.0024549745,0.0034510784,0.08833996,0.00021911976,0.0075545153,0.000032950116],"about_ca_topic_score_codex":0.044141706,"about_ca_topic_score_gemma":0.08330696,"teacher_disagreement_score":0.044141706,"about_ca_system_score_codex":0.0006243349,"about_ca_system_score_gemma":0.00052207225,"threshold_uncertainty_score":0.08776957},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0096599115,0.026894316,0.0474089,0.20071988,0.07890904,0.000685346,0.02535985,0.006062361,0.60430044],"genre_scores_gemma":[0.053527027,0.0072159474,0.017172648,0.013223441,0.008749749,0.00015186892,0.005657203,0.0025598595,0.8917423],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986089,0.00038864062,0.00006492545,0.00019831788,0.0006442509,0.00009499628],"domain_scores_gemma":[0.9926133,0.001627592,0.00025740018,0.000419643,0.004355583,0.00072647934],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002465479,0.0009256745,0.0014830501,0.0021877466,0.0014742294,0.0015244895,0.0012910604,0.0010384268,0.4073073],"category_scores_gemma":[0.010964075,0.00040057674,0.0005769408,0.0017767746,0.0004916075,0.0025531615,0.0013175468,0.0019396509,0.15315452],"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.000067954315,0.000026879308,0.0004623009,0.00013119138,0.000008290878,0.00012935023,0.00033947907,0.00026186768,0.0008466089,0.006985526,0.9618438,0.028896721],"study_design_scores_gemma":[0.000013593312,0.00001938921,0.0007156031,0.00008457535,0.000013096033,0.00018663102,0.00050185906,0.0007049644,0.0010031525,0.00574585,0.99098396,0.000027240647],"about_ca_topic_score_codex":0.009694609,"about_ca_topic_score_gemma":0.014588294,"teacher_disagreement_score":0.59269273,"about_ca_system_score_codex":0.0025955676,"about_ca_system_score_gemma":0.0010313857,"threshold_uncertainty_score":0.8454042},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113794126,0.0058828564,0.0015669457,0.034041256,0.00053538254,0.000032776188,0.0008326841,0.00006078365,0.8432532],"genre_scores_gemma":[0.9437083,0.003456983,0.0004365866,0.003216719,0.00026455717,0.000017933275,0.00014760185,0.00003517754,0.048716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978908,0.00019864397,0.000044261367,0.00013111271,0.00093703554,0.00079824054],"domain_scores_gemma":[0.99754107,0.0006082135,0.00015922789,0.00015348119,0.0012731036,0.00026486925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013252724,0.00047275753,0.0008013586,0.0017634613,0.005082081,0.0056578154,0.0008292502,0.002910483,0.017041292],"category_scores_gemma":[0.009056608,0.000246953,0.0004917071,0.003080747,0.003586481,0.003206887,0.0019561034,0.003233932,0.0007117467],"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.00025115337,0.0000288031,0.0017914014,0.000053011223,0.0000237153,0.00011620209,0.0002742652,0.0015606057,0.0001701062,0.9609527,0.021367624,0.013410441],"study_design_scores_gemma":[0.00016820991,0.000057831756,0.020077363,0.00030712853,0.00019293677,0.00019326474,0.0023797657,0.0042054467,0.0006711414,0.6979516,0.2736705,0.00012478943],"about_ca_topic_score_codex":0.70104164,"about_ca_topic_score_gemma":0.7597619,"teacher_disagreement_score":0.29895836,"about_ca_system_score_codex":0.024204107,"about_ca_system_score_gemma":0.019865783,"threshold_uncertainty_score":0.6014379},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010360043,0.0015007718,0.9587201,0.0006321336,0.00056147977,0.000068471876,0.00015357838,0.0013180105,0.026685433],"genre_scores_gemma":[0.35320973,0.0052442937,0.61534494,0.00093696325,0.0010451389,0.00015187186,0.000566876,0.0011359587,0.02236429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981008,0.00032747627,0.00013663668,0.00032725398,0.0008179543,0.0002899116],"domain_scores_gemma":[0.9984157,0.000704944,0.00010890122,0.00050718087,0.00021798875,0.000045178414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001546382,0.0008006625,0.0007658748,0.0015015648,0.0013465547,0.0023188374,0.0016225321,0.000553006,0.0087090125],"category_scores_gemma":[0.00391879,0.00040395107,0.0010977314,0.0016725399,0.0020595824,0.0064760135,0.0025745647,0.002464031,0.0032909533],"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.00006182773,0.00002605756,0.00012610115,0.00018132194,0.000012669755,0.00011305101,0.0002732183,0.0023750537,0.0062547275,0.8857092,0.0037830656,0.10108363],"study_design_scores_gemma":[0.00006312606,0.00011124887,0.00017355224,0.0001609403,0.000047534177,0.0005394798,0.00014072996,0.012483625,0.024128018,0.7877534,0.17432584,0.000072503506],"about_ca_topic_score_codex":0.00076701713,"about_ca_topic_score_gemma":0.00095533684,"teacher_disagreement_score":0.0087090125,"about_ca_system_score_codex":0.00072207523,"about_ca_system_score_gemma":0.0010922133,"threshold_uncertainty_score":0.029134572},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022635553,0.006086327,0.010588194,0.0012768084,0.001884233,0.00036653742,0.015840208,0.014593972,0.94710016],"genre_scores_gemma":[0.005205941,0.002805507,0.0021150215,0.00073539343,0.00018221335,0.00016927959,0.00789137,0.0025720154,0.9783232],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99921453,0.00006141766,0.000070162314,0.00022324178,0.00026692738,0.00016368362],"domain_scores_gemma":[0.99836737,0.0003354385,0.000094955096,0.00061046745,0.0003539433,0.00023784269],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016346173,0.0037446413,0.002546568,0.0034451396,0.0028889684,0.004452639,0.002484533,0.0047307126,0.93199825],"category_scores_gemma":[0.0030749268,0.001811477,0.0013484084,0.010012417,0.0017049919,0.011383851,0.005496422,0.0028918984,0.95517004],"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.0003293684,0.00014590788,0.0005718378,0.0007054362,0.00004625047,0.00025423666,0.00010733208,0.0008075473,0.0017674599,0.010336556,0.6369268,0.34800133],"study_design_scores_gemma":[0.00004204737,0.000041389012,0.0007686933,0.0002899183,0.000045286848,0.00020658974,0.000071436705,0.0008792234,0.00080322823,0.0028214494,0.99399275,0.00003794033],"about_ca_topic_score_codex":0.014200974,"about_ca_topic_score_gemma":0.01023683,"teacher_disagreement_score":0.06800175,"about_ca_system_score_codex":0.0027808165,"about_ca_system_score_gemma":0.0010786534,"threshold_uncertainty_score":0.09699619},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040297894,0.994491,0.0026663188,0.0005832256,0.00020189524,0.000056305078,0.00011138045,0.000030962936,0.0014558627],"genre_scores_gemma":[0.002268595,0.9936273,0.002985664,0.00043220754,0.000109554036,0.000081901606,0.0001296912,0.000019128393,0.0003461012],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.99706906,0.0007573785,0.0008284731,0.0003480862,0.00089007727,0.00010697069],"domain_scores_gemma":[0.9800724,0.015178404,0.0017272992,0.0007384309,0.0020820366,0.0002014275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005006627,0.001129336,0.00217215,0.007065599,0.00061492366,0.0021645783,0.0014021645,0.0013861412,0.0057343584],"category_scores_gemma":[0.02199719,0.0008400673,0.002027368,0.006422246,0.0013378118,0.004361436,0.0014287457,0.0017233719,0.0016215205],"study_design_candidate":"systematic_review","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001101661,0.000052337797,0.0005765369,0.21606103,0.00041127668,0.00017077167,0.00042883566,0.0009816501,0.0013818003,0.0201442,0.016389811,0.7432916],"study_design_scores_gemma":[0.00004463097,0.0002757193,0.0013377434,0.15807301,0.0013938464,0.0010190419,0.0004171645,0.00043646956,0.0012972985,0.011826443,0.8237989,0.00007977377],"about_ca_topic_score_codex":0.0017543572,"about_ca_topic_score_gemma":0.0035100973,"teacher_disagreement_score":0.007065599,"about_ca_system_score_codex":0.0012243348,"about_ca_system_score_gemma":0.007814133,"threshold_uncertainty_score":0.026477873},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12752682,0.044731576,0.077882186,0.006425308,0.0026966645,0.00015838825,0.00044490618,0.0004198659,0.73971426],"genre_scores_gemma":[0.60495824,0.035951182,0.05087078,0.0009854789,0.006026611,0.00023690794,0.0007740544,0.00024719673,0.2999496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997638,0.0000492713,0.000009627014,0.000036629637,0.000105429644,0.000035217043],"domain_scores_gemma":[0.999742,0.00008253184,0.000025778982,0.000046367924,0.000058837064,0.000044515164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037342025,0.0009839531,0.0009199941,0.0024011286,0.0013723355,0.0026724122,0.000882518,0.0008409895,0.0086309],"category_scores_gemma":[0.00075110304,0.00039665212,0.00039034107,0.0027921756,0.002780478,0.0031019992,0.0010331421,0.0021870201,0.002116532],"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.000012626382,0.000030045321,0.000090063666,0.00007316533,0.0000031764569,0.00005047986,0.00041549726,0.00072788436,0.0007735862,0.9734167,0.0057011526,0.01870572],"study_design_scores_gemma":[0.000007078066,0.00001932864,0.00012065662,0.00003311349,0.000002524711,0.00010163253,0.00010501531,0.0009951552,0.00026156698,0.96189725,0.03644957,0.0000070904703],"about_ca_topic_score_codex":0.00067578134,"about_ca_topic_score_gemma":0.0005827114,"teacher_disagreement_score":0.0086309,"about_ca_system_score_codex":0.0012214727,"about_ca_system_score_gemma":0.00075808936,"threshold_uncertainty_score":0.028873265},"labels":[],"label_agreement":null}]}