{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":438,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":438,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"3ef37ca07c93","filters":{"topic":"Cryptography and Residue Arithmetic"}},"results":[{"id":"W1880212920","doi":"10.1007/b97644","title":"Guide to Elliptic Curve Cryptography","year":2004,"lang":"en","type":"book","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":3089,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Elliptic curve cryptography; Elliptic curve; Cryptography; Computer science; Computer security; Mathematics; Public-key cryptography; Mathematical analysis; Encryption","retraction":null,"screen_n_in":null,"score":{"opus":0.007210403771848686,"gpt":0.2367032915151741,"spread":0.2294928877433254,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002351316,0.0004768097,0.000449284,0.001047839,0.0001494522,0.0003091182,0.002250283,0.0003437907,0.0001839807],"category_scores_gemma":[0.00001695632,0.0004089712,0.0005515899,0.0008597066,0.0001094981,0.0001907961,0.0005432816,0.0004136605,0.0009725675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001898881,"about_ca_system_score_gemma":0.001112284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006703436,"about_ca_topic_score_gemma":0.00006534314,"domain_scores_codex":[0.9973629,0.00003494574,0.0004749824,0.0009487103,0.0006181233,0.0005602985],"domain_scores_gemma":[0.99773,0.0001074082,0.0001110475,0.001519501,0.0001578976,0.0003741029],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000002014185,0.00004577527,0.00001060672,0.00004299368,0.00006575361,0.00007118703,0.0002051041,0.00009667646,0.000008955535,0.8045745,0.1791205,0.01575595],"study_design_scores_gemma":[0.0002009088,0.000171951,0.00007676522,0.0001714935,0.0000241016,0.00002313047,0.000002791579,0.00005198262,0.00007739868,0.1342274,0.8643975,0.0005746274],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000001149112,0.0009333841,0.4498116,0.0004820177,0.0005256636,0.0002908255,0.000004235997,0.00033286,0.5476183],"genre_scores_gemma":[0.00002921389,0.0001427053,0.2447021,0.002077738,0.0002936785,0.00003174108,0.00001224872,0.00004554721,0.752665],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.6852769,"threshold_uncertainty_score":0.9998362,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013613544","doi":"10.1007/s102070100002","title":"The Elliptic Curve Digital Signature Algorithm (ECDSA)","year":2001,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2198,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Research Canada","funders":"","keywords":"Elliptic Curve Digital Signature Algorithm; Elliptic curve cryptography; Elliptic curve point multiplication; Post-quantum cryptography; Algorithm; Curve25519; Computer science; Hessian form of an elliptic curve; Digital Signature Algorithm; Tripling-oriented Doche–Icart–Kohel curve; Digital signature; Schoof's algorithm; NIST; Elliptic curve; Discrete logarithm; ElGamal signature scheme; Cryptography; Mathematics; Public-key cryptography; Hash function; Blind signature; Encryption; Pure mathematics; Computer security; Quarter period","retraction":null,"screen_n_in":null,"score":{"opus":0.004100972361733678,"gpt":0.2268713816543628,"spread":0.2227704092926291,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004991014,0.00009558118,0.00009627147,0.0002369654,0.0001379667,0.00111997,0.001458624,0.00005832359,0.00001321089],"category_scores_gemma":[0.0001676159,0.00006178924,0.0001697427,0.0002921681,0.00006204489,0.004704982,0.0001380196,0.000322388,0.00004839119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004697496,"about_ca_system_score_gemma":0.00008481037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003401187,"about_ca_topic_score_gemma":0.000001353217,"domain_scores_codex":[0.9983374,0.00003248261,0.0005663498,0.0000589231,0.0008569825,0.0001478043],"domain_scores_gemma":[0.997987,0.0002047976,0.0005075847,0.0001647164,0.001051801,0.00008413567],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007343487,0.0001274016,0.001561168,0.000005070308,0.0002723102,0.0000960811,0.004661753,0.0002801313,0.00001194141,0.1371631,0.006566596,0.849181],"study_design_scores_gemma":[0.00168476,0.0002443317,0.01091452,0.00009244442,0.00001541602,0.002940906,0.0007557034,0.06586606,0.0004393824,0.1343029,0.7823927,0.0003509257],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02200514,0.0006487983,0.9597526,0.008689934,0.003820628,0.0001097826,0.00001990875,0.00005051726,0.004902689],"genre_scores_gemma":[0.9934317,0.0005750403,0.005139044,0.0004897139,0.0003292246,0.000001538975,0.000007088487,0.00000287504,0.00002370415],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9714266,"threshold_uncertainty_score":0.999917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1754939103","doi":"10.1023/a:1008354106356","title":"The State of Elliptic Curve Cryptography","year":2000,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":668,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Public-key cryptography; Multiplicative function; Mathematics; Modulo; Cryptosystem; Elliptic curve cryptography; Elliptic curve; Cryptography; Arithmetic; Key (lock); Diffie–Hellman key exchange; Prime (order theory); Discrete mathematics; Logarithm; Computer science; Pure mathematics; Algorithm; Combinatorics; Computer security; Key exchange; Encryption","retraction":null,"screen_n_in":null,"score":{"opus":0.0106775203571429,"gpt":0.2186878329867931,"spread":0.2080103126296502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006021254,0.000298266,0.000322198,0.0003809034,0.0006083882,0.0003315289,0.0009891054,0.00007515667,0.00003673139],"category_scores_gemma":[0.00001071246,0.0002032301,0.0003819042,0.002093245,0.0007393414,0.0003043691,0.00009236912,0.0002185965,0.00001127114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003683677,"about_ca_system_score_gemma":0.00003308125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006571151,"about_ca_topic_score_gemma":0.00002681689,"domain_scores_codex":[0.997804,0.0002198909,0.0004802786,0.0005049793,0.000419497,0.0005713096],"domain_scores_gemma":[0.9982553,0.0004647254,0.000145731,0.0008194829,0.0001189554,0.0001958277],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001041677,0.0002548586,0.007782164,0.00006424931,0.0003490626,0.00002207487,0.00150921,0.0001952336,0.001812335,0.2916914,0.0009121015,0.6953031],"study_design_scores_gemma":[0.002363901,0.001675181,0.1076018,0.0002193906,0.0001838841,0.0001251491,0.0003146019,0.01184244,0.009489758,0.7794228,0.08497875,0.001782439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4611519,0.01873948,0.5132601,0.0006335622,0.0003031685,0.0007051441,0.00002772202,0.000337496,0.004841458],"genre_scores_gemma":[0.9502386,0.01152114,0.03786011,0.0002136602,0.00003998049,0.00005041094,0.000003133445,0.00002420926,0.00004870294],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6935207,"threshold_uncertainty_score":0.8287482,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1562630396","doi":"10.1017/cbo9780511546570","title":"Advances in Elliptic Curve Cryptography","year":2005,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":506,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Cryptography; Elliptic curve cryptography; Computer science; Theoretical computer science; Computer security; Field (mathematics); Elliptic curve; Mathematics; Public-key cryptography; Encryption; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.008789292478801355,"gpt":0.194320597010347,"spread":0.1855313045315456,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001597005,0.0004498174,0.0004945401,0.0009926911,0.000168862,0.00011687,0.002039438,0.0003880961,0.00000153986],"category_scores_gemma":[0.000006581123,0.0005125923,0.0003962497,0.0001479973,0.0003154969,0.0005434382,0.0006206473,0.0007376169,0.00001656397],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001836458,"about_ca_system_score_gemma":0.0002535626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004139487,"about_ca_topic_score_gemma":0.00001644557,"domain_scores_codex":[0.9977807,0.0001300568,0.0002756529,0.0008737959,0.0004033866,0.0005363452],"domain_scores_gemma":[0.998329,0.0001505028,0.0002298801,0.0009856683,0.0001051963,0.0001997668],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002106575,0.00004269257,0.00002876808,0.0001111897,0.00004129905,0.0003874922,0.00009763187,0.00004254863,0.000004683268,0.9648593,0.01538237,0.01898093],"study_design_scores_gemma":[0.0006363511,0.000059676,0.0001484419,0.0002573743,0.00004761451,0.0000168944,0.00001442962,0.0005134287,0.00006353779,0.000182666,0.9974447,0.0006148315],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00003795327,0.004378442,0.0337996,0.00002509292,0.0003717972,0.0003945747,0.00003422987,0.0002470343,0.9607113],"genre_scores_gemma":[0.000514686,0.003935855,0.005822348,0.0001087097,0.0002208893,0.000002943265,0.00002450196,0.00003857396,0.9893315],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9820624,"threshold_uncertainty_score":0.9997326,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021553056","doi":"10.1007/s00145-009-9048-z","title":"A Taxonomy of Pairing-Friendly Elliptic Curves","year":2009,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":467,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"National Defense Science and Engineering Graduate; Division of Mathematical Sciences; Directorate for Mathematical and Physical Sciences; Science Foundation Ireland; National Science Foundation","keywords":"Pairing; Embedding; Elliptic curve; Mathematics; Cryptography; Computer science; Pure mathematics; Theoretical computer science; Physics; Algorithm; Artificial intelligence; Superconductivity; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.01443367674452202,"gpt":0.2395251486617141,"spread":0.2250914719171921,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004036181,0.000100059,0.0003580968,0.0003087908,0.00003788587,0.00001717755,0.0007478212,0.00006566974,0.00002308457],"category_scores_gemma":[0.00008509577,0.00007733605,0.000216036,0.0003864318,0.0001020197,0.0002773457,0.00004469002,0.0002171094,0.000004864093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001002116,"about_ca_system_score_gemma":0.00009932247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001620893,"about_ca_topic_score_gemma":0.000001038389,"domain_scores_codex":[0.9988146,0.0001018016,0.0005368023,0.0001201679,0.0002163292,0.0002102488],"domain_scores_gemma":[0.9987715,0.0001426506,0.0005174169,0.0002643674,0.0002100678,0.00009399952],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001668566,0.001317808,0.01335418,0.0002795529,0.0003426105,0.0007821125,0.0009056068,0.0004314292,0.01171658,0.7484346,0.02674146,0.1955272],"study_design_scores_gemma":[0.007494398,0.01934653,0.31443,0.002218467,0.0004314538,0.01299345,0.0003156297,0.003656114,0.04558697,0.3818406,0.2100942,0.001592188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1304608,0.009470779,0.8500555,0.006815521,0.0006570779,0.0001334931,5.840767e-7,0.0000280413,0.002378224],"genre_scores_gemma":[0.8926212,0.0004790401,0.1062566,0.0005490644,0.00008107111,0.000001084594,1.008457e-7,0.000002935869,0.000008872351],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7621604,"threshold_uncertainty_score":0.3153673,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1987475429","doi":"10.1515/jmc-2012-0015","title":"Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies","year":2014,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":398,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Isogeny; Mathematics; Cryptosystem; Supersingular elliptic curve; Endomorphism ring; Public-key cryptography; Elliptic curve; Mathematical proof; Post-quantum cryptography; Endomorphism; Commutative property; Cryptography; Scheme (mathematics); Discrete mathematics; Pure mathematics; Algebra over a field; Encryption; Computer science; Algorithm; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01353937373835186,"gpt":0.2384679318503223,"spread":0.2249285581119704,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001221355,0.0002600107,0.0008610951,0.0003277538,0.0001384053,0.0001623459,0.001296642,0.0002091824,0.00006038358],"category_scores_gemma":[0.000680181,0.0001860638,0.000439582,0.0003667616,0.0001509592,0.0003178263,0.0001727684,0.0004112967,0.00009938988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000402773,"about_ca_system_score_gemma":0.0001052669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001529874,"about_ca_topic_score_gemma":0.00000355316,"domain_scores_codex":[0.9970293,0.0004905725,0.001089861,0.0003001582,0.0006339776,0.0004561275],"domain_scores_gemma":[0.9976388,0.000699817,0.0004931267,0.0005966424,0.0002924116,0.0002792493],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006030841,0.0002924704,0.0002525211,0.0001113728,0.0001973142,0.0001271611,0.001264443,0.00002867005,0.00689372,0.9881887,0.0006127975,0.001970507],"study_design_scores_gemma":[0.0009865756,0.0008787654,0.001352387,0.0002344485,0.0001187516,0.0007145547,0.0005007332,0.01719173,0.003112915,0.9716451,0.002927944,0.000336107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2428783,0.0009651775,0.7518159,0.002550386,0.00073839,0.00009155259,0.00000222236,0.00004709786,0.0009110697],"genre_scores_gemma":[0.8619688,0.00003249392,0.137507,0.0001554942,0.0003096543,0.000002750818,6.008739e-7,0.00001637263,0.000006850112],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6190905,"threshold_uncertainty_score":0.7587464,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2135205181","doi":"10.26421/qic3.4-3","title":"Shor's discrete logarithm quantum algorithm for elliptic curves","year":2003,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":327,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Post-quantum cryptography; Quantum algorithm; Quantum computer; Integer factorization; Qubit; Mathematics; Elliptic curve; Quantum Fourier transform; Schoof's algorithm; Elliptic curve cryptography; Discrete mathematics; Counting points on elliptic curves; Logarithm; Modulo; Algorithm; Cryptography; Quantum phase estimation algorithm; Quantum; Quantum error correction; Public-key cryptography; Computer science; Quantum mechanics; Pure mathematics; Encryption; Mathematical analysis; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01243195162450697,"gpt":0.2534901271177673,"spread":0.2410581754932603,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004458039,0.0001555485,0.000162517,0.0002231997,0.0002759581,0.0002858561,0.000180647,0.00006692736,0.000004515508],"category_scores_gemma":[0.00005468096,0.0001394497,0.00008046361,0.0003913559,0.00005635751,0.001741524,0.00003553711,0.00009263041,0.00002299198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000159693,"about_ca_system_score_gemma":0.00005379566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001031108,"about_ca_topic_score_gemma":0.000001066365,"domain_scores_codex":[0.9988285,0.00006719334,0.0004445403,0.0001823647,0.0002380318,0.0002393332],"domain_scores_gemma":[0.9992293,0.0001449656,0.0001857742,0.0001681739,0.0001756353,0.0000962011],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005028072,0.00003987625,0.00004408344,0.000200665,0.00002761104,9.00162e-7,0.0008596792,0.001196929,0.000008870349,0.7240327,0.001525495,0.2720582],"study_design_scores_gemma":[0.0005606254,0.0001559291,0.0005655373,0.00006024872,0.00001336901,0.00003128211,0.000162628,0.9477159,0.0001029602,0.03899558,0.01142491,0.0002109877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001703009,0.0006276761,0.995652,0.0005734826,0.000423187,0.000421563,0.00001010527,0.000154276,0.0004347098],"genre_scores_gemma":[0.6847903,0.0008652827,0.3118315,0.002107678,0.00005366497,0.0001201442,0.0001866699,0.0000151861,0.00002958138],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.946519,"threshold_uncertainty_score":0.5686593,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149204794","doi":"10.1109/tc.2004.47","title":"Low complexity bit parallel architectures for polynomial basis multiplication over GF(2m)","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":242,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite field; Trinomial; Polynomial basis; Multiplier (economics); Multiplication (music); Irreducible polynomial; GF(2); Mathematics; Finite field arithmetic; Primitive polynomial; Arithmetic; Polynomial; Matrix multiplication; Discrete mathematics; Computer science; Matrix polynomial; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.02133126280777332,"gpt":0.2522161742658325,"spread":0.2308849114580592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001118113,0.0002432002,0.0002169571,0.0003503959,0.0004556835,0.000139736,0.0006864045,0.0001003035,0.000007645794],"category_scores_gemma":[0.00000225631,0.0002311176,0.0003470175,0.0004759012,0.0001590751,0.0001202021,0.000005923181,0.0002272635,0.00001910243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008121479,"about_ca_system_score_gemma":0.00006851986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001819998,"about_ca_topic_score_gemma":0.0001585506,"domain_scores_codex":[0.9984819,0.00004993699,0.0002762181,0.0005683577,0.0002501192,0.0003735234],"domain_scores_gemma":[0.9988847,0.0002259498,0.00008332726,0.0005945611,0.00005617458,0.0001553338],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001212031,0.0007048628,0.0000203069,0.00004395243,0.00009976063,0.000004598626,0.0008388769,0.8638676,0.0009770012,0.002075817,0.0003674298,0.1308786],"study_design_scores_gemma":[0.01243186,0.001475459,0.01764209,0.0002783984,0.0001252487,0.0001014912,0.00004460104,0.8355883,0.1094717,0.01931191,0.001711769,0.001817185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06233222,0.00001814767,0.9340206,0.001645454,0.001075225,0.0005410055,0.0000351101,0.000303785,0.00002848106],"genre_scores_gemma":[0.7646026,0.000006126675,0.2345812,0.0006243513,0.00008136847,0.00007725094,0.000002973822,0.00001446323,0.00000969774],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7022704,"threshold_uncertainty_score":0.9424703,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3101994345","doi":"","title":"Constructing elliptic curve isogenies in quantum subexponential time","year":2010,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":235,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Isogeny; Mathematics; Quantum algorithm; Elliptic curve; Cryptosystem; Quantum; Discrete mathematics; Quantum Fourier transform; Endomorphism ring; Finite field; Cryptography; Pure mathematics; Algorithm; Endomorphism; Quantum mechanics; Quantum error correction","retraction":null,"screen_n_in":null,"score":{"opus":0.005256157962366835,"gpt":0.2073080397679782,"spread":0.2020518818056113,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002501693,0.0001027549,0.0001273253,0.0002059158,0.00007471305,0.0001323698,0.0005051224,0.00006969762,0.0001648941],"category_scores_gemma":[0.00003496755,0.00008741152,0.00007148214,0.000464217,0.0001233984,0.0002852333,0.0001498388,0.0002498675,0.0001859182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005861671,"about_ca_system_score_gemma":0.00003417797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001229713,"about_ca_topic_score_gemma":0.0002278827,"domain_scores_codex":[0.9990595,0.00003923799,0.0001984089,0.0002738232,0.0001556123,0.0002734256],"domain_scores_gemma":[0.9994021,0.0001210045,0.00004269392,0.0003397513,0.00003092439,0.00006353963],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007194523,0.0001196992,0.04732511,0.0000143275,0.00002233312,0.00005734165,0.0007703505,0.00001748516,0.07523277,0.8563771,0.0002481524,0.01980819],"study_design_scores_gemma":[0.002787886,0.0002789813,0.08366787,0.00007489562,0.00002931325,0.0007139093,0.000741156,0.7080496,0.09708072,0.1007397,0.004015052,0.001820922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9527712,0.00004636706,0.04106528,0.0004383285,0.0007156104,0.00009149576,7.997803e-7,0.0001478893,0.004723066],"genre_scores_gemma":[0.9615771,0.000003588407,0.03819405,0.00004921815,0.00005609513,0.000003611598,9.794151e-7,0.000004955396,0.0001104427],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7556373,"threshold_uncertainty_score":0.3564538,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045890225","doi":"10.1515/jmc-2012-0016","title":"Constructing elliptic curve isogenies in quantum subexponential time","year":2013,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":187,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Isogeny; Finite field; Cardinality (data modeling); Quantum algorithm; Quantum Fourier transform; Elliptic curve; Quantum; Cryptosystem; Endomorphism; Discrete logarithm","retraction":null,"screen_n_in":null,"score":{"opus":0.0096042011635041,"gpt":0.2281385526665449,"spread":0.2185343515030408,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005782577,0.0001426143,0.0004914841,0.0003775886,0.00004726509,0.00009968667,0.0006684976,0.000121258,0.0002188811],"category_scores_gemma":[0.0003217191,0.0001059167,0.0001865223,0.0003502695,0.0001335951,0.0004377299,0.0001343471,0.0003664798,0.0003349614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002774833,"about_ca_system_score_gemma":0.00005913441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005045573,"about_ca_topic_score_gemma":0.000001403978,"domain_scores_codex":[0.9981837,0.0001989432,0.000827746,0.0001610346,0.0002788909,0.0003496922],"domain_scores_gemma":[0.9986447,0.0004810635,0.000353732,0.0002325158,0.0001593428,0.0001286518],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002311637,0.0004325335,0.004111195,0.0001068848,0.0001068963,0.0002707491,0.001180126,0.00003389137,0.006959332,0.9796296,0.0009724178,0.006173283],"study_design_scores_gemma":[0.001106362,0.00040825,0.003603362,0.0001552658,0.0000322418,0.004274693,0.0007909066,0.05018352,0.00165832,0.9374172,0.00008200917,0.0002878751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7220278,0.0002301719,0.2738366,0.002736336,0.0003163427,0.00012029,3.157075e-7,0.00002292186,0.0007092394],"genre_scores_gemma":[0.8626419,0.00001227046,0.1371705,0.00007122349,0.00008172056,0.000003750297,1.601742e-7,0.000007682998,0.00001085905],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.140614,"threshold_uncertainty_score":0.431916,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2540113050","doi":"10.1109/tcsi.2016.2611561","title":"Post-Quantum Cryptography on FPGA Based on Isogenies on Elliptic Curves","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":179,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Isogeny; Computer science; Key exchange; Cryptography; Supersingular elliptic curve; Software; Public-key cryptography; Parallel computing; Elliptic curve cryptography; Curve25519; Shared secret; Arithmetic; Elliptic curve; Algorithm; Operating system; Mathematics; Encryption","retraction":null,"screen_n_in":null,"score":{"opus":0.01194929650327333,"gpt":0.2063620050636738,"spread":0.1944127085604005,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003791743,0.0004109936,0.0003980996,0.0007287421,0.0005228255,0.0001823196,0.0004834772,0.000177138,0.00002784162],"category_scores_gemma":[0.00001516788,0.0002702254,0.0003840817,0.0006329477,0.0002114774,0.0001881927,0.000002083162,0.000242406,0.0000664332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004665271,"about_ca_system_score_gemma":0.00006761361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003061835,"about_ca_topic_score_gemma":0.000009874474,"domain_scores_codex":[0.9972475,0.0003059483,0.000394452,0.0008385426,0.0007241621,0.0004894176],"domain_scores_gemma":[0.9979216,0.0005488992,0.0001246018,0.0009969717,0.00009783557,0.0003101287],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000560345,0.004414295,0.0002519532,0.002061062,0.001468409,0.0003509511,0.001959084,0.02933347,0.1974839,0.1689078,0.003138822,0.5900699],"study_design_scores_gemma":[0.0449069,0.08298218,0.03675342,0.08057795,0.002171071,0.001338918,0.003634994,0.1257969,0.4521087,0.008788543,0.1395256,0.02141488],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09946921,0.002327945,0.87744,0.00700251,0.004863484,0.001874118,0.0002151388,0.0008344706,0.005973148],"genre_scores_gemma":[0.9973881,0.0005581203,0.00006012455,0.001570147,0.00006019841,0.00009147884,0.000001447532,0.00003368815,0.0002366682],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8979189,"threshold_uncertainty_score":0.999975,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1557014463","doi":"10.1007/3-540-46766-1_20","title":"New Public-Key Schemes Based on Elliptic Curves over the Ring Zn","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":173,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Factoring; Public key cryptosystem; Public-key cryptography; Elliptic curve; Cryptosystem; Mathematics; Multiplier (economics); Class (philosophy); Digital signature; Computer science; Ring (chemistry); Arithmetic; Discrete mathematics; Cryptography; Computer security; Pure mathematics; Algorithm; Encryption","retraction":null,"screen_n_in":null,"score":{"opus":0.02363073939586826,"gpt":0.252383862852978,"spread":0.2287531234571097,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001460606,0.0005957481,0.0004436449,0.00123939,0.000475952,0.0009591915,0.00494657,0.0002931794,0.00006905277],"category_scores_gemma":[0.0001440448,0.000410057,0.0002727356,0.001534571,0.0007647322,0.0005164607,0.0009391449,0.00125148,0.00004717808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001460439,"about_ca_system_score_gemma":0.0007990488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003765701,"about_ca_topic_score_gemma":0.00009606207,"domain_scores_codex":[0.9954154,0.00005151791,0.0004928197,0.001470675,0.001663514,0.0009061026],"domain_scores_gemma":[0.9959735,0.001224905,0.0002651177,0.002075098,0.0001740971,0.000287338],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007646081,0.00005384486,0.0002419811,0.0001028694,0.0000246707,0.0001065505,0.0003143599,0.01382491,0.00003129451,0.1629573,0.0002980616,0.8220365],"study_design_scores_gemma":[0.0007053107,0.0003755128,0.002065564,0.002660159,0.00002824985,0.00006559181,2.382566e-7,0.8362015,0.001384415,0.1187657,0.036205,0.001542749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003842619,0.002517782,0.984196,0.003865708,0.001594577,0.0004027288,0.000001785227,0.0001891986,0.007193763],"genre_scores_gemma":[0.1144137,0.0004535835,0.8548449,0.02773309,0.001743613,0.00001506269,0.000007474117,0.000102043,0.000686524],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8223765,"threshold_uncertainty_score":0.9998351,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111459803","doi":"10.1109/tc.2002.1017695","title":"Bit-parallel finite field multiplier and squarer using polynomial basis","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":160,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Trinomial; Finite field; Mathematics; Polynomial basis; Irreducible polynomial; Multiplier (economics); Primitive polynomial; Polynomial; Multiplication (music); Basis (linear algebra); Normal basis; Inverse; Discrete mathematics; Modulo; Arithmetic; Matrix polynomial; Combinatorics; Galois theory; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02397500966732785,"gpt":0.225899180900632,"spread":0.2019241712333042,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000648405,0.0001845747,0.0001664838,0.0003291793,0.0003294556,0.0001606482,0.0003338596,0.00009746928,0.00004752124],"category_scores_gemma":[0.000001984656,0.0001774602,0.0001460389,0.0004336226,0.00006785679,0.0002927828,0.000006266126,0.0002342821,0.00002766672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002057985,"about_ca_system_score_gemma":0.00001062369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007721198,"about_ca_topic_score_gemma":0.00001514168,"domain_scores_codex":[0.9988735,0.00005488522,0.0001980444,0.0004090538,0.000180725,0.0002837365],"domain_scores_gemma":[0.999056,0.0003562881,0.00004353872,0.0003811611,0.00002727383,0.0001356963],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005417009,0.0006328535,0.0001966993,0.00003945599,0.0002121667,0.00007711178,0.003152088,0.3150009,0.0009826857,0.0003229177,0.002741497,0.6765874],"study_design_scores_gemma":[0.0008188303,0.0001784138,0.0002094521,0.00004355343,0.000022825,0.0000422051,0.00001792481,0.9946799,0.002683732,0.00004820543,0.0009667879,0.0002882071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02420429,0.00008713514,0.9731923,0.0008968933,0.001193076,0.0001340865,0.000004082758,0.0001484047,0.0001397286],"genre_scores_gemma":[0.875339,0.00006274605,0.123539,0.0009319498,0.00005585836,0.000006956778,1.739364e-7,0.00001095967,0.00005329697],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8511348,"threshold_uncertainty_score":0.7236618,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160886236","doi":"10.1090/s0025-5718-06-01900-4","title":"A double large prime variation for small genus hyperelliptic index calculus","year":2006,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":135,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Prime (order theory); Hyperelliptic curve cryptography; Genus; Logarithm; Context (archaeology); Variation (astronomy); Discrete logarithm; Heuristic; Field (mathematics); Algorithm; Calculus (dental); Pure mathematics; Combinatorics; Computer science; Mathematical optimization; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.0146945947311421,"gpt":0.2393141835337826,"spread":0.2246195888026405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003409777,0.000109216,0.0001937112,0.0001760744,0.00009021877,0.00007761233,0.0002606495,0.00005288514,0.000001210009],"category_scores_gemma":[0.00001602715,0.000102602,0.0001014074,0.000375313,0.00002755118,0.0001309129,0.00005605912,0.00004873311,0.000006836096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001925615,"about_ca_system_score_gemma":0.00003694401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006477145,"about_ca_topic_score_gemma":0.00002934015,"domain_scores_codex":[0.9990281,0.00002051229,0.0003668134,0.0001885351,0.0002045351,0.0001914826],"domain_scores_gemma":[0.999083,0.0001987929,0.000280221,0.0002239912,0.0001846833,0.00002930042],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002603495,0.0009649009,0.00022245,0.0004248683,0.00005615194,0.000002279166,0.002414425,0.03786847,0.001739057,0.9472824,0.0001267452,0.008872201],"study_design_scores_gemma":[0.00099346,0.00007991727,0.003946462,0.0000284134,0.0000215584,0.000005829997,0.00001904251,0.8494511,0.001653419,0.1435928,0.00008848859,0.0001195037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1360646,0.00004809714,0.8629118,0.00009796158,0.0001081616,0.0003814434,0.000003154415,0.00007690899,0.0003079113],"genre_scores_gemma":[0.6667925,9.712181e-7,0.3330977,0.00001284443,0.00003320171,0.00001854485,0.000008931393,0.000007684403,0.00002755639],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8115827,"threshold_uncertainty_score":0.4183986,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114353618","doi":"10.1109/tc.2002.1004590","title":"A new construction of Massey-Omura parallel multiplier over GF(2/sup m/)","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":121,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite field; Multiplier (economics); GF(2); Mathematics; Very-large-scale integration; Primitive polynomial; Redundancy (engineering); Irreducible polynomial; Normal basis; Discrete mathematics; Arithmetic; Computer science; Polynomial; Galois theory; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01364235175092877,"gpt":0.2101195772906375,"spread":0.1964772255397088,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006860971,0.0002055771,0.0002315357,0.000375774,0.0001620639,0.00008002317,0.0005106534,0.0001056451,0.0001587494],"category_scores_gemma":[0.000001149071,0.0001979691,0.0002583278,0.0007339425,0.0001104911,0.0003569159,0.000003792935,0.0002428623,0.00005626782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003048075,"about_ca_system_score_gemma":0.00002725444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008023509,"about_ca_topic_score_gemma":0.000009832575,"domain_scores_codex":[0.9985993,0.00006002623,0.0003238378,0.0004137661,0.00032153,0.0002815259],"domain_scores_gemma":[0.9989808,0.000155904,0.0001008931,0.0005489879,0.00005000114,0.0001633713],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004401739,0.0005355663,0.0001828292,0.00004104555,0.0002657357,0.00002719984,0.001997962,0.1684688,0.001005701,0.007456385,0.004616653,0.8153582],"study_design_scores_gemma":[0.003373045,0.0004851545,0.001688801,0.0001558189,0.00007103776,0.0001650015,0.00007171794,0.9780891,0.009962717,0.002032985,0.003180914,0.0007237162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008817822,0.00006503244,0.9884586,0.0004984614,0.001366241,0.0001856161,0.000005336224,0.0001946793,0.0004082005],"genre_scores_gemma":[0.6722986,0.00007169209,0.3272614,0.0001729337,0.00004743138,0.000007608084,4.05132e-7,0.0000117001,0.0001282963],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8146344,"threshold_uncertainty_score":0.8072947,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978602192","doi":"10.1109/tcsi.2013.2283691","title":"Efficient algorithm and architecture for elliptic curve cryptography for extremely constrained secure applications","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Computer science; Elliptic curve cryptography; Application-specific integrated circuit; Cryptography; Multiplier (economics); Edwards curve; Elliptic curve; Affine transformation; Multiplication (music); Algorithm; Arithmetic; Theoretical computer science; Computer hardware; Encryption; Mathematics; Public-key cryptography","retraction":null,"screen_n_in":null,"score":{"opus":0.009798990862371267,"gpt":0.2117982830050289,"spread":0.2019992921426577,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004081156,0.0002543972,0.0003124481,0.0003055166,0.000642824,0.0002085137,0.0002379667,0.0001487338,0.000001291162],"category_scores_gemma":[0.000006490272,0.0002171158,0.0002231676,0.0003781339,0.0002200598,0.00004666323,0.000002136288,0.0001417602,7.355309e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001297132,"about_ca_system_score_gemma":0.00003753357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009789639,"about_ca_topic_score_gemma":0.000007954694,"domain_scores_codex":[0.9984117,0.00009255992,0.0003046836,0.0006278576,0.0002114756,0.0003516987],"domain_scores_gemma":[0.9986777,0.0004469241,0.0001012284,0.0004209899,0.0001084949,0.0002446866],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001408863,0.0002020522,0.000006719723,0.0005175567,0.0002340671,0.000001087067,0.001002812,0.01653345,0.005343295,0.0926151,0.00005156215,0.8834782],"study_design_scores_gemma":[0.005412584,0.001434086,0.000205542,0.0004135508,0.0003883494,0.0003472969,0.0008545231,0.870469,0.002128168,0.009214109,0.1076288,0.001504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001165515,0.0008614977,0.9950203,0.000307226,0.0003783119,0.001863825,0.0001116037,0.0001289153,0.0001628602],"genre_scores_gemma":[0.9662527,0.00006261199,0.03219696,0.0001292781,0.000108196,0.001159601,0.000005976341,0.00002898906,0.00005564058],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9650872,"threshold_uncertainty_score":0.8853727,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2604763720","doi":"10.1007/978-3-319-70972-7_9","title":"A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":96,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Random oracle; Computer science; Scheme (mathematics); Digital signature; Mathematical proof; Oracle; Theoretical computer science; Key (lock); Elliptic Curve Digital Signature Algorithm; Quantum computer; Schnorr signature; Algorithm; Topology (electrical circuits); Quantum; Public-key cryptography; Mathematics; Blind signature; Elliptic curve cryptography; Programming language; Quantum mechanics; Computer network; Physics; Geometry; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.009965248540184131,"gpt":0.223138600505358,"spread":0.2131733519651738,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004746626,0.0007121561,0.000580885,0.001350706,0.0007417034,0.0022448,0.005175922,0.0005390129,0.00001813841],"category_scores_gemma":[0.0002072838,0.0006002467,0.0003810759,0.0003599943,0.001414283,0.0009483815,0.001010829,0.001269785,0.00005363733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000138705,"about_ca_system_score_gemma":0.0006719258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001264991,"about_ca_topic_score_gemma":0.00001779096,"domain_scores_codex":[0.9955565,0.0000261136,0.0003943731,0.001839497,0.00136023,0.0008232939],"domain_scores_gemma":[0.9960904,0.0004671206,0.0002706442,0.002582038,0.0003427474,0.0002471175],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000831718,0.0003018228,0.0003376425,0.0001920983,0.00008373024,0.001529327,0.001739231,0.02432831,0.001529271,0.09698766,0.0001155181,0.8727722],"study_design_scores_gemma":[0.0007186977,0.0009870407,0.0004149557,0.001261742,0.00001830542,0.0001138358,4.492479e-7,0.8181944,0.002051638,0.1702417,0.004302209,0.001694948],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003276131,0.0007316394,0.990353,0.002060316,0.001811444,0.0003835882,0.00003118889,0.0002154369,0.004085761],"genre_scores_gemma":[0.7947944,0.00002706468,0.200616,0.003438749,0.0006518207,0.000009273769,0.00002318174,0.00007180384,0.0003677035],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8710773,"threshold_uncertainty_score":0.9996449,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037497641","doi":"10.1016/j.jnt.2009.01.006","title":"Elliptic curve cryptography: The serpentine course of a paradigm shift","year":2009,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":96,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptography; Ideal (ethics); Elliptic curve cryptography; Function (biology); Computer science; Key (lock); Elliptic curve; Computer security; Mathematics; Public-key cryptography; Political science; Pure mathematics; Law; Encryption","retraction":null,"screen_n_in":null,"score":{"opus":0.007320077022190979,"gpt":0.2511822582921134,"spread":0.2438621812699224,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001445187,0.0001523628,0.0002977776,0.0001378733,0.0001096646,0.00007736752,0.001212922,0.00005788959,0.0001853884],"category_scores_gemma":[0.00004079484,0.00008802921,0.0004623772,0.0007000169,0.0001921399,0.000351932,0.0000566418,0.0003456426,0.00001382855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007644913,"about_ca_system_score_gemma":0.00008351748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002221857,"about_ca_topic_score_gemma":0.000001345882,"domain_scores_codex":[0.9983688,0.0003214001,0.0005292284,0.0001394573,0.0003921833,0.0002489329],"domain_scores_gemma":[0.9982152,0.0005238104,0.0005512628,0.0004958722,0.000102572,0.0001112609],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001091768,0.0005934442,0.004348092,0.00001581927,0.0002405585,0.00008209772,0.002257688,0.00009077713,0.0002084704,0.9683654,0.002772822,0.0209157],"study_design_scores_gemma":[0.000543482,0.0002660982,0.09980829,0.00011317,0.00007318033,0.0004135582,0.0001138095,0.0001722196,0.0006157483,0.8930811,0.004649183,0.0001502029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4194262,0.006257348,0.5550335,0.01259733,0.001299754,0.0003209097,0.00001775063,0.00006967765,0.004977558],"genre_scores_gemma":[0.9932908,0.0001440419,0.00593704,0.0004585963,0.0001447974,9.087702e-7,4.421228e-7,0.000006308834,0.0000170895],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5738646,"threshold_uncertainty_score":0.3589727,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W189254053","doi":"10.1007/978-3-319-13039-2_25","title":"A Quantum Algorithm for Computing Isogenies between Supersingular Elliptic Curves","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Isogeny; Supersingular elliptic curve; Quantum algorithm; Quantum computer; Elliptic curve; Finite field; Field (mathematics); Computer science; Quantum; Cryptography; Base (topology); Schoof's algorithm; Algorithm; Post-quantum cryptography; Mathematics; Discrete mathematics; Pure mathematics; Physics; Quantum mechanics; Mathematical analysis; Quarter period","retraction":null,"screen_n_in":null,"score":{"opus":0.01731719029527132,"gpt":0.2471992145101962,"spread":0.2298820242149249,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001539517,0.000702544,0.0009395921,0.001108063,0.0006067456,0.0005814959,0.003726234,0.0003786225,0.000005605219],"category_scores_gemma":[0.000103362,0.0006424433,0.0004214858,0.0008076387,0.001059307,0.0003309734,0.001071173,0.0007438739,0.00001841463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00013447,"about_ca_system_score_gemma":0.0003559414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002168001,"about_ca_topic_score_gemma":0.00001138063,"domain_scores_codex":[0.995295,0.00006382857,0.0007285308,0.001857919,0.001011021,0.001043731],"domain_scores_gemma":[0.9961386,0.001526334,0.0003334832,0.001400181,0.0003540957,0.0002473454],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001750517,0.00002021325,0.00008241208,0.0002553932,0.00004421215,0.00002335333,0.0005470939,0.00221779,0.0000329057,0.0199124,0.00006296438,0.9767995],"study_design_scores_gemma":[0.0003980059,0.0003860957,0.0001547516,0.001814489,0.00005128893,0.00006058045,3.369055e-7,0.8490806,0.0006954744,0.1433119,0.003021956,0.001024476],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00008965838,0.004422442,0.9917055,0.000918854,0.001647663,0.000752346,0.00001632534,0.0002450356,0.0002021118],"genre_scores_gemma":[0.04091093,0.0002097257,0.9557076,0.001635384,0.001339132,0.00001164574,0.00002179461,0.00006749418,0.00009634041],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9757751,"threshold_uncertainty_score":0.9996027,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048276889","doi":"10.1090/s0025-5718-08-02066-8","title":"Fast algorithms for computing isogenies between elliptic curves","year":2008,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Isogeny; Elliptic curve; Prime (order theory); Degree (music); Algorithm; Field (mathematics); Schoof's algorithm; Power series; Finite field; Discrete mathematics; Pure mathematics; Combinatorics; Mathematical analysis; Quarter period","retraction":null,"screen_n_in":null,"score":{"opus":0.04918734259861358,"gpt":0.2914900139444828,"spread":0.2423026713458692,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002864839,0.0001293722,0.0002924003,0.0001611927,0.0001776567,0.00002992766,0.0003968093,0.00004478625,0.000001065633],"category_scores_gemma":[0.00005100951,0.0001200611,0.0001396866,0.0003734336,0.00009263838,0.000178069,0.0000902113,0.00006102258,0.000005855862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009480763,"about_ca_system_score_gemma":0.00003415108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003523888,"about_ca_topic_score_gemma":3.225047e-7,"domain_scores_codex":[0.9988524,0.00002958972,0.0004445702,0.0001990998,0.0002861919,0.0001881979],"domain_scores_gemma":[0.9986371,0.0006258401,0.0002685123,0.0002206352,0.0001997606,0.00004812714],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003030805,0.00325653,0.009673555,0.02110512,0.001531467,0.00004666866,0.08779833,0.1474749,0.003826084,0.3157562,0.009674973,0.3998259],"study_design_scores_gemma":[0.0004957641,0.0001874915,0.003866001,0.0003837516,0.00004199034,0.00003552192,0.00009828119,0.9412798,0.004388957,0.04892794,0.00004186077,0.0002525871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07772832,0.0003976023,0.9210101,0.0001824004,0.0001004448,0.0003186227,0.000005362724,0.000103334,0.0001538482],"genre_scores_gemma":[0.4817684,0.00003066333,0.518104,0.00002481745,0.00004031906,0.000004638128,0.000008288127,0.000007662641,0.0000111808],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.793805,"threshold_uncertainty_score":0.4895949,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136119832","doi":"10.1109/itcc.2004.1286701","title":"High performance FPGA based elliptic curve cryptographic co-processor","year":2004,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Scalar multiplication; Elliptic curve cryptography; Coprocessor; Field-programmable gate array; Elliptic curve; Computer science; NIST; Elliptic curve point multiplication; Finite field; Parallel computing; Binary number; Arithmetic; Mathematics; Embedded system; Discrete mathematics; Encryption; Public-key cryptography; Operating system; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01026675438707201,"gpt":0.2228050695944466,"spread":0.2125383152073746,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002546315,0.0002294368,0.0002071791,0.0003914833,0.0002860204,0.0001929925,0.001032517,0.00009661665,0.00007705022],"category_scores_gemma":[0.00001382107,0.0001838116,0.0001407767,0.001519409,0.0001592726,0.0005434602,0.0000727735,0.0002117265,0.000218157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002339641,"about_ca_system_score_gemma":0.0001352539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007815338,"about_ca_topic_score_gemma":0.00001344078,"domain_scores_codex":[0.9982728,0.00003416461,0.0002749906,0.0005066844,0.0004274778,0.0004839025],"domain_scores_gemma":[0.99889,0.00006902571,0.00008124506,0.0006904373,0.0001038712,0.0001653521],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00008744169,0.001784884,0.02147973,0.0005964554,0.0001990408,0.000159801,0.001271042,0.0466738,0.005721193,0.8626745,0.0009243977,0.05842769],"study_design_scores_gemma":[0.01199575,0.002536163,0.3548255,0.000552466,0.0001160201,0.000170062,0.0001322262,0.09049007,0.4179251,0.1084657,0.008956003,0.003835038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4913062,0.0001862193,0.504371,0.001100844,0.0002658897,0.0001746475,0.000001568403,0.0004343247,0.002159185],"genre_scores_gemma":[0.9212102,0.00006455487,0.07776042,0.0008173149,0.00005322646,0.00002585901,0.000003376699,0.00001270729,0.00005239123],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7542089,"threshold_uncertainty_score":0.7495621,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2085540322","doi":"10.1109/tvlsi.2011.2158595","title":"Efficient FPGA Implementations of Point Multiplication on Binary Edwards and Generalized Hessian Curves Using Gaussian Normal Basis","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Division of Electrical, Communications and Cyber Systems; CMC Microsystems","keywords":"Elliptic curve cryptography; Hessian matrix; Lookup table; Elliptic curve point multiplication; Multiplication (music); Elliptic curve; Binary number; Edwards curve; Mathematics; Computer science; Parallel computing; Arithmetic; Algorithm; Applied mathematics; Combinatorics; Schoof's algorithm; Pure mathematics; Encryption; Public-key cryptography","retraction":null,"screen_n_in":null,"score":{"opus":0.02770676403880055,"gpt":0.2670120190335478,"spread":0.2393052549947472,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005001448,0.0002623208,0.0003114582,0.0005873707,0.0004694387,0.00008950717,0.0002998187,0.0001181298,0.00005707434],"category_scores_gemma":[0.000005514912,0.0002251235,0.0002033452,0.0007085874,0.00009593721,0.0003027206,0.000006426014,0.0002143946,0.00001210417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008899107,"about_ca_system_score_gemma":0.00006382837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008598232,"about_ca_topic_score_gemma":0.0002656477,"domain_scores_codex":[0.9977809,0.0003108757,0.0006703339,0.0004976201,0.0004261829,0.0003140764],"domain_scores_gemma":[0.998749,0.00008703457,0.0002572644,0.0005732175,0.0001878912,0.0001456348],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002153405,0.02330417,0.006368637,0.004670491,0.002639809,0.0001140152,0.1040554,0.3802366,0.2420561,0.07565103,0.004158005,0.1545924],"study_design_scores_gemma":[0.002767296,0.0009724105,0.01292809,0.001521981,0.0002279663,0.0001040364,0.003037572,0.7878017,0.1893399,0.0001390118,0.0002752506,0.0008847645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1769188,0.0001553065,0.8207852,0.0002228509,0.0007911043,0.0006040579,0.0001363876,0.000106753,0.0002795411],"genre_scores_gemma":[0.9890704,0.00008748692,0.01046739,0.000122063,0.00003376208,0.0001360343,0.00001293953,0.00001903541,0.00005090099],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8121516,"threshold_uncertainty_score":0.9180269,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2122183684","doi":"10.1109/tc.2007.70815","title":"Fast and Flexible Elliptic Curve Point Arithmetic over Prime Fields","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"SIMD; Atomicity; Multiplication (music); Computer science; Elliptic curve cryptography; Elliptic curve; Parallel computing; Elliptic curve point multiplication; Curve25519; Multiprocessing; Prime (order theory); Arithmetic; Mathematics; Public-key cryptography; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01401900193872338,"gpt":0.2205330533353361,"spread":0.2065140513966127,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001077315,0.0002214062,0.0002168943,0.0003431721,0.0003977106,0.0001094113,0.0004281889,0.0001044643,0.00002226457],"category_scores_gemma":[0.000001373749,0.0002074804,0.0001617183,0.0005724892,0.0001697584,0.0003519643,0.000008555277,0.0003281901,0.0000410618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003015612,"about_ca_system_score_gemma":0.00005131015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007657188,"about_ca_topic_score_gemma":0.00001154175,"domain_scores_codex":[0.9985848,0.00007109103,0.000238919,0.0004927798,0.0002770405,0.0003353525],"domain_scores_gemma":[0.9990138,0.000196751,0.00005229076,0.0005186184,0.00004199295,0.0001764841],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000169417,0.002920095,0.001084978,0.0001894083,0.0008256142,0.0007503737,0.01348934,0.2092548,0.002337751,0.01186695,0.005050764,0.7520605],"study_design_scores_gemma":[0.003976698,0.001800874,0.01755149,0.000290598,0.0001125874,0.001656269,0.00008783935,0.9171302,0.05000574,0.003275654,0.002237507,0.001874553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03512949,0.0001175426,0.9623333,0.0006035345,0.001106798,0.0001813454,0.000003476936,0.0002830198,0.000241441],"genre_scores_gemma":[0.9507229,0.0001592399,0.04826424,0.0006054985,0.00004476375,0.00001407209,5.422785e-7,0.00001381432,0.0001748883],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9155934,"threshold_uncertainty_score":0.8460805,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136484227","doi":"10.1109/tc.2009.70","title":"Bit-Serial and Bit-Parallel Montgomery Multiplication and Squaring over GF(2^m)","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Trinomial; Finite field; Multiplication (music); Arithmetic; Cryptosystem; Mathematics; GF(2); Binary number; Cryptography; XOR gate; Normal basis; Computer science; Discrete mathematics; Galois theory; Algorithm; Logic gate; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.009825076464437171,"gpt":0.224169664099868,"spread":0.2143445876354309,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009690155,0.000174049,0.0001610294,0.0002898718,0.0002772493,0.0002001116,0.0002379209,0.00008160526,0.000002391921],"category_scores_gemma":[0.000001021425,0.0001680439,0.00007643861,0.0003625466,0.00007034235,0.0004059741,0.000004601361,0.0001765889,0.000004933606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001853472,"about_ca_system_score_gemma":0.00001516576,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005973,"about_ca_topic_score_gemma":0.00001915471,"domain_scores_codex":[0.9989145,0.00004245723,0.0001937493,0.0004527473,0.0001673574,0.0002291912],"domain_scores_gemma":[0.9993458,0.0001063449,0.00005059902,0.0003383773,0.0000259814,0.0001329361],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001034391,0.000458136,0.000223312,0.00002959869,0.00009188295,0.00002003619,0.001793112,0.04473786,0.007501842,0.004065007,0.0002728239,0.940703],"study_design_scores_gemma":[0.00392195,0.0009306147,0.07525023,0.0001473079,0.00006399894,0.0001303574,0.00004890977,0.9072695,0.006853373,0.003494589,0.0009383372,0.0009508816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.171288,0.0001014745,0.8270371,0.0006837252,0.0005121563,0.0001673141,0.000002078332,0.0001638017,0.00004434826],"genre_scores_gemma":[0.9423974,0.0001416334,0.05694732,0.0004288719,0.00005244473,0.000009759497,6.349875e-7,0.000007162519,0.00001480729],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.939752,"threshold_uncertainty_score":0.685263,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1798342512","doi":"10.1007/3-540-47555-9_14","title":"Public-Key Cryptosystems with Very Small Key Lengths","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptosystem; Key (lock); Public-key cryptography; Hybrid cryptosystem; Key size; Computer science; Public key cryptosystem; Computer security; Cryptography; Elliptic curve cryptography; Encryption","retraction":null,"screen_n_in":null,"score":{"opus":0.03096137160042576,"gpt":0.2275835416561387,"spread":0.1966221700557129,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001597329,0.0008394724,0.0007677347,0.00222247,0.0004800798,0.001395619,0.005103903,0.0005543163,0.00001999902],"category_scores_gemma":[0.00007931334,0.0006593989,0.0002433864,0.001851422,0.00126591,0.0008345609,0.001346669,0.001361457,0.00006429819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002752682,"about_ca_system_score_gemma":0.0009114937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006575621,"about_ca_topic_score_gemma":0.0007227882,"domain_scores_codex":[0.9941185,0.00006189089,0.0007113123,0.002176591,0.001605521,0.001326237],"domain_scores_gemma":[0.9956582,0.0007439924,0.0004093281,0.002228165,0.0005187275,0.000441569],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002442358,0.0001154443,0.0006483142,0.0001644473,0.00007781684,0.0007635402,0.001569944,0.006115071,0.0000701946,0.2939,0.0000333389,0.6965174],"study_design_scores_gemma":[0.00370781,0.003114163,0.00233173,0.004958829,0.0001143362,0.002325854,0.000004084788,0.3750287,0.004566407,0.4944181,0.1008754,0.008554594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002339267,0.001129198,0.9753943,0.0009107721,0.002015908,0.000539314,0.000004520851,0.0003433492,0.0194287],"genre_scores_gemma":[0.1867949,0.0001361386,0.8091549,0.002256518,0.001151713,0.00002078365,0.0000092387,0.0001040566,0.0003717222],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6879628,"threshold_uncertainty_score":0.999641,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129089669","doi":"10.1016/j.jsc.2011.09.003","title":"Genus 2 point counting over prime fields","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Genus; Prime (order theory); Jacobian matrix and determinant; Twists of curves; Computation; Prime number; Twist; Discrete mathematics; Combinatorics; Elliptic curve; Algorithm; Schoof's algorithm; Pure mathematics; Applied mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01778078805688415,"gpt":0.2393396749367503,"spread":0.2215588868798661,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003809896,0.00008045394,0.0001499644,0.0002350267,0.00007188778,0.00007032941,0.0003304101,0.00004966879,0.00002027826],"category_scores_gemma":[0.0000250254,0.00006683704,0.0001220956,0.0003042084,0.00002397716,0.0004675102,0.00006261183,0.0001721384,0.000007989123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002069641,"about_ca_system_score_gemma":0.00006304046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002993975,"about_ca_topic_score_gemma":0.000002467131,"domain_scores_codex":[0.9990719,0.00004775445,0.0003652172,0.0001045239,0.0002701214,0.0001404909],"domain_scores_gemma":[0.9992057,0.0000642017,0.000349858,0.000120453,0.0001900587,0.00006973411],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0001285026,0.001115195,0.02142642,0.0001304797,0.0005303305,0.0006531927,0.05623443,0.006410369,0.003245598,0.08983021,0.004521675,0.8157736],"study_design_scores_gemma":[0.00228369,0.0009841616,0.7006918,0.0002650312,0.00009307531,0.00152685,0.0003221034,0.1728571,0.005959429,0.1127681,0.001650288,0.0005984002],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3011017,0.0001611436,0.6969822,0.0001636508,0.0004709559,0.00003934849,1.348596e-7,0.00002050744,0.001060349],"genre_scores_gemma":[0.9480934,0.00001610438,0.05157604,0.0001642206,0.0001376593,4.365957e-7,1.858518e-7,0.000004418871,0.000007601037],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8151752,"threshold_uncertainty_score":0.2725535,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2539629874","doi":"10.1007/978-3-319-48965-0_6","title":"NEON-SIDH: Efficient Implementation of Supersingular Isogeny Diffie-Hellman Key Exchange Protocol on ARM","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Isogeny; Computer science; Cryptosystem; Speedup; Key exchange; Parallel computing; Supersingular elliptic curve; Affine transformation; Cryptography; Arithmetic; Encryption; Public-key cryptography; Mathematics; Algorithm; Elliptic curve; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01393316525482611,"gpt":0.2700190224437448,"spread":0.2560858571889186,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000745255,0.0005484749,0.0005248886,0.001342435,0.0002664565,0.0002206263,0.00244952,0.0002581612,0.00008675128],"category_scores_gemma":[0.00002405277,0.0004137123,0.0002533002,0.0007084626,0.0007410913,0.0002218915,0.0008551044,0.0004315421,0.00002793912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002036947,"about_ca_system_score_gemma":0.0003412472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002815539,"about_ca_topic_score_gemma":0.00006588369,"domain_scores_codex":[0.9958414,0.00006451722,0.0006487802,0.001437343,0.001293695,0.0007142274],"domain_scores_gemma":[0.9974207,0.0003426544,0.0003979674,0.001417699,0.0002422006,0.0001788142],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002568382,0.0001605707,0.0001093416,0.0001949102,0.00002647298,0.00005905821,0.002924343,0.003506362,0.001188782,0.03623426,0.00004173135,0.9555285],"study_design_scores_gemma":[0.011683,0.0117699,0.005156423,0.008912511,0.0001426393,0.000328909,0.00001575115,0.2510349,0.2269265,0.4355478,0.04067827,0.007803458],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004220636,0.00009877782,0.9808279,0.000799798,0.0008079963,0.01463363,0.00001374734,0.0001017639,0.002294355],"genre_scores_gemma":[0.5453597,0.00009713359,0.4353135,0.004698457,0.002663476,0.01072101,0.00002137029,0.0002846691,0.000840762],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.947725,"threshold_uncertainty_score":0.9998315,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144693841","doi":"10.1109/tc.2008.126","title":"The Mixed-Radix Chinese Remainder Theorem and Its Applications to Residue Comparison","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Modulo; Chinese remainder theorem; Residue number system; Binary number; Mathematics; Modulo operation; Moduli; Arithmetic; Comparator; Adder; Residue (chemistry); Remainder; Discrete mathematics; Algorithm; Computer science; Voltage; Physics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01577423187320397,"gpt":0.2544011287992291,"spread":0.2386268969260251,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0002023892,0.0002076758,0.0001895473,0.0002172309,0.001447318,0.0001414908,0.000779069,0.00006679283,0.00000226943],"category_scores_gemma":[0.000003905722,0.0001471833,0.000117895,0.0009656218,0.0001422981,0.0001784573,0.00001120445,0.0002765599,0.00005485378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002695848,"about_ca_system_score_gemma":0.00004141412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001781994,"about_ca_topic_score_gemma":0.00009986531,"domain_scores_codex":[0.9985382,0.0001176629,0.0002730541,0.0004628387,0.0002875032,0.000320716],"domain_scores_gemma":[0.9983271,0.0006796889,0.00005785491,0.0006508562,0.00007309889,0.0002114099],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002015991,0.001560871,0.0008648889,0.00007434026,0.0005551898,0.00007897415,0.0128713,0.2087567,0.001852778,0.1019437,0.01237382,0.6588658],"study_design_scores_gemma":[0.00437021,0.001733208,0.05677591,0.0002670938,0.0001416399,0.001444182,0.0005114465,0.8163079,0.03294253,0.0179865,0.06433866,0.003180737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03440955,0.0002614853,0.9609904,0.002763771,0.0006787626,0.0004851999,0.000004944045,0.0002112592,0.0001946629],"genre_scores_gemma":[0.9815542,0.000172591,0.0175548,0.0004515785,0.00005982356,0.0001109814,5.39695e-7,0.00001387746,0.00008159296],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9471447,"threshold_uncertainty_score":0.9998527,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065654144","doi":"10.1016/j.jalgor.2005.01.009","title":"Refinements of Miller's algorithm for computing the Weil/Tate pairing","year":2005,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computation; Cryptography; Algorithm; Hamming weight; Integer (computer science); Hamming distance; Computer science; Field (mathematics); Binary number; Finite field; Pairing; Elliptic curve; Mathematics; Theoretical computer science; Discrete mathematics; Hamming code; Arithmetic; Programming language; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01407102858777722,"gpt":0.2615776276533546,"spread":0.2475065990655774,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001240056,0.0001431799,0.0002976006,0.0002193843,0.0001988225,0.0000794293,0.001020072,0.00005003242,0.000006287328],"category_scores_gemma":[0.00003925797,0.00009124276,0.0003339035,0.0004178489,0.00007983023,0.0003115248,0.000153381,0.0002308017,0.000002062861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002949866,"about_ca_system_score_gemma":0.00007061672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009144029,"about_ca_topic_score_gemma":0.000002186459,"domain_scores_codex":[0.9982921,0.00006944085,0.000719336,0.0001629722,0.00045973,0.0002963521],"domain_scores_gemma":[0.9982922,0.0002941721,0.0006669588,0.0002920528,0.0003621456,0.00009245629],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000668715,0.0001149583,0.00009316044,0.00001499342,0.0001337064,0.000008254715,0.0008098407,0.001216727,0.0002314038,0.000604343,0.001325043,0.9954409],"study_design_scores_gemma":[0.003199789,0.0009029263,0.005318552,0.0002904726,0.00009869975,0.0004548057,0.0003961042,0.9271824,0.0108712,0.003322058,0.04759488,0.0003681009],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00960762,0.001375476,0.9854995,0.00241507,0.0007584885,0.0001561548,0.000003883957,0.00002020036,0.0001636309],"genre_scores_gemma":[0.08474067,0.0001502823,0.9140199,0.0002723543,0.0007339377,0.000002137851,4.421067e-7,0.00001317209,0.00006705099],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9950728,"threshold_uncertainty_score":0.3720772,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061405134","doi":"10.1090/s0025-5718-07-02048-0","title":"The double-base number system and its application to elliptic curve cryptography","year":2007,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; University of Calgary","keywords":"Scalar multiplication; Mathematics; Elliptic curve; Elliptic curve cryptography; Elliptic curve point multiplication; Side channel attack; Edwards curve; Multiplication (music); Cryptography; Scalar (mathematics); Schoof's algorithm; Base (topology); Binary number; Point (geometry); Arithmetic; Algorithm; Pure mathematics; Combinatorics; Computer science; Public-key cryptography; Mathematical analysis; Encryption; Quarter period; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01174996913210005,"gpt":0.2629183333873865,"spread":0.2511683642552864,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000879121,0.0001087375,0.0001405646,0.0001417751,0.000189525,0.00009856753,0.0003196486,0.00004319193,3.664501e-7],"category_scores_gemma":[0.00001437499,0.00008093512,0.000058519,0.0007350962,0.00004032045,0.0001224918,0.00008479853,0.00006147693,0.00002568671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001430205,"about_ca_system_score_gemma":0.00001306845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006435463,"about_ca_topic_score_gemma":0.000006376189,"domain_scores_codex":[0.9989183,0.00002595856,0.0003824173,0.0001917588,0.0003012854,0.0001803019],"domain_scores_gemma":[0.9988272,0.0004345061,0.000184856,0.0002711896,0.0001977481,0.00008445281],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000013731,0.00007785434,0.0001873287,0.0002442732,0.00002110534,0.000001332432,0.001627745,0.001581315,0.0008635341,0.980492,0.00003221965,0.01485755],"study_design_scores_gemma":[0.00125183,0.0001868405,0.006727315,0.0002943529,0.00005760686,0.00007483737,0.001017109,0.8697045,0.01657752,0.1032728,0.0003832679,0.0004519926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.147756,0.0001749605,0.8505381,0.0001528769,0.00009020854,0.0004416603,6.708756e-7,0.00008118066,0.000764353],"genre_scores_gemma":[0.880784,0.000007817996,0.1191374,0.00001794351,0.00002133137,0.00001878279,0.000001135795,0.000007267955,0.000004369998],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8772192,"threshold_uncertainty_score":0.3300439,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070633734","doi":"10.1049/el:20020192","title":"RNS-enabled digital signal processor design","year":2002,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Council","keywords":"Computer science; Reduced instruction set computing; SIMD; Very-large-scale integration; Residue number system; Digital signal; Digital signal processor; Computer architecture; Digital signal processing; Instruction set; Signal processing; Embedded system; Logic synthesis; Computer hardware; Logic gate; Parallel computing","retraction":null,"screen_n_in":null,"score":{"opus":0.01125234640413127,"gpt":0.1842898343625872,"spread":0.1730374879584559,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001443426,0.0001764678,0.0001419114,0.0001545657,0.000175152,0.0004224981,0.0008209459,0.00005280077,0.0000475002],"category_scores_gemma":[0.00001562856,0.0001587039,0.0001046218,0.0006971961,0.00005737872,0.0006719405,0.0000773131,0.0002656121,0.000143376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005339392,"about_ca_system_score_gemma":0.00003602821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001281191,"about_ca_topic_score_gemma":7.765969e-7,"domain_scores_codex":[0.9983928,0.00004626505,0.0001764926,0.0004017213,0.0003081555,0.0006745946],"domain_scores_gemma":[0.9993472,0.0001000859,0.00006419173,0.0003569015,0.00003354473,0.00009806448],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000105806,0.001727233,0.001491226,0.0001796994,0.0007673839,0.0007931248,0.00594366,0.01541315,0.1664314,0.1228603,0.2156369,0.4686501],"study_design_scores_gemma":[0.004469835,0.002067021,0.0006273742,0.0001153801,0.00009633774,0.0006025744,0.00004787194,0.7095405,0.1132682,0.03820521,0.127583,0.003376654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01656724,0.00155395,0.9724683,0.007861502,0.00009690915,0.0002216011,8.296356e-7,0.0002933083,0.0009363671],"genre_scores_gemma":[0.9874305,0.00006181595,0.009721253,0.002457598,0.00008712467,0.00002674492,0.000001499526,0.00001763857,0.000195824],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9708633,"threshold_uncertainty_score":0.6471758,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1809742378","doi":"10.1023/a:1008312401197","title":"Analysis of the Xedni Calculus Attack","year":2000,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Elliptic curve; Logarithm; Discrete logarithm; Finite field; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01767769015688338,"gpt":0.2412242157429259,"spread":0.2235465255860425,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002206359,0.0001545316,0.0002840036,0.0004290162,0.0002343206,0.00009990855,0.0006900005,0.00006976848,0.0001074463],"category_scores_gemma":[0.000005351608,0.0001004922,0.0005162055,0.004696368,0.0002831941,0.0001369783,0.00008273555,0.0001075612,0.000002811581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003116146,"about_ca_system_score_gemma":0.00001790426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008858378,"about_ca_topic_score_gemma":0.00005077577,"domain_scores_codex":[0.9987561,0.0001259583,0.0002502525,0.0003403963,0.0002720734,0.0002552564],"domain_scores_gemma":[0.9989992,0.0001090778,0.00007731236,0.0006697868,0.00005300093,0.00009167018],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0000714583,0.0006750011,0.2351714,0.00008601299,0.005016072,0.00002646875,0.004355509,0.004911673,0.003563214,0.3545502,0.002127612,0.3894454],"study_design_scores_gemma":[0.0009009444,0.0002891534,0.8869902,0.00006368266,0.00172941,0.0000243845,0.0001626337,0.07780282,0.00313729,0.009822682,0.01829905,0.0007776933],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7532316,0.001853604,0.2397522,0.0004667098,0.0001118168,0.0002405662,0.0000206006,0.0001041273,0.004218783],"genre_scores_gemma":[0.992092,0.0003761601,0.007204591,0.0002579044,0.00001307971,0.00000966304,0.000001829996,0.000005706401,0.00003903919],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6518189,"threshold_uncertainty_score":0.4097953,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2106876320","doi":"10.1109/12.956092","title":"Power analysis attacks and algorithmic approaches to their countermeasures for Koblitz curve cryptosystems","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Scalar multiplication; Power analysis; Elliptic curve cryptography; Cryptosystem; Elliptic curve point multiplication; Computer science; Elliptic Curve Digital Signature Algorithm; Elliptic curve; Arithmetic; Cryptography; Side channel attack; Key (lock); Hessian form of an elliptic curve; Scalar (mathematics); Public-key cryptography; Key size; Mathematics; Algorithm; Computer security; Encryption; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05501079801963862,"gpt":0.241829707477477,"spread":0.1868189094578384,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003300833,0.0002712455,0.0003622684,0.0008527586,0.0003553784,0.0003251796,0.0005822828,0.00009475082,0.000005593145],"category_scores_gemma":[0.000001840384,0.0002319991,0.0003694346,0.001620719,0.00007421437,0.0002757807,0.000006701783,0.0001566094,0.000007630946],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004233377,"about_ca_system_score_gemma":0.00002980962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004349976,"about_ca_topic_score_gemma":0.00007746677,"domain_scores_codex":[0.9982739,0.00009910093,0.000299323,0.000672146,0.0002647562,0.000390754],"domain_scores_gemma":[0.998743,0.0002975801,0.00006834188,0.0005923056,0.00008050449,0.0002182581],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003318913,0.001584766,0.001930753,0.0001558861,0.005935135,0.00005132638,0.01326232,0.4720022,0.0006528298,0.005631271,0.001983091,0.4964785],"study_design_scores_gemma":[0.001470552,0.0008513908,0.004981503,0.0001038487,0.0002941434,0.0001008857,0.0003307505,0.9809247,0.001980666,0.0007196923,0.007299498,0.0009423781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02671224,0.0001050996,0.9705374,0.0009445567,0.0008225497,0.0005561969,0.00003488706,0.0001926999,0.00009440832],"genre_scores_gemma":[0.9597234,0.00002740697,0.03969638,0.0003392329,0.00004687327,0.0001116521,0.000002070377,0.00001608856,0.00003690589],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9330112,"threshold_uncertainty_score":0.9460651,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052917298","doi":"10.1090/s0025-5718-01-01363-1","title":"Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time","year":2001,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Waterloo","keywords":"Mathematics; Logarithm; Genus; Finite field; Combinatorics; Discrete logarithm; Field (mathematics); Binary logarithm; Discrete mathematics; Mathematical analysis; Pure mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.008492376036877417,"gpt":0.2311297978497164,"spread":0.2226374218128389,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004708964,0.0001565738,0.0003257221,0.0004825104,0.00004828333,0.00007392118,0.0004261533,0.00007769776,0.000005874892],"category_scores_gemma":[0.00003712939,0.0001528464,0.00007272125,0.0009780764,0.00005971064,0.0002458827,0.0001324622,0.0001512702,0.00002896981],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003676471,"about_ca_system_score_gemma":0.00003842995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000107579,"about_ca_topic_score_gemma":0.00004970524,"domain_scores_codex":[0.99843,0.00008510302,0.0006062474,0.0002790132,0.0003172119,0.0002824259],"domain_scores_gemma":[0.9991742,0.0002427259,0.0002171733,0.0002549543,0.00006588706,0.0000450285],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008552998,0.003901027,0.01322357,0.001237005,0.0001386336,0.0005017782,0.03308444,0.7364379,0.01193425,0.1026777,0.0001822257,0.096596],"study_design_scores_gemma":[0.0008016802,0.00009282313,0.01279467,0.0002007809,0.000008036871,0.00003634198,0.00008741951,0.9496947,0.0003522685,0.03573433,0.00001027719,0.0001866658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5004359,0.00003254609,0.4988671,0.0001416623,0.00007446665,0.0001940911,7.320725e-7,0.00004023963,0.0002132351],"genre_scores_gemma":[0.8218463,0.000007705693,0.1780694,0.00001526641,0.00001990922,0.000004122904,0.000005962196,0.00001064026,0.00002071783],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3214104,"threshold_uncertainty_score":0.6232893,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167706997","doi":"10.1109/iwsoc.2004.56","title":"RNS application for digital image processing","year":2004,"lang":"en","type":"article","venue":"IEEE International Workshop on System-on-Chip for Real-Time Applications","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; Western University","funders":"","keywords":"Very-large-scale integration; Computer science; Residue number system; MATLAB; Image processing; Digital image processing; Digital image; Coding (social sciences); Grayscale; Encoder; Binary number; Computer hardware; Binary image; Image (mathematics); Computer vision; Algorithm; Embedded system; Arithmetic; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01554083003520035,"gpt":0.2918521422020731,"spread":0.2763113121668727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002716305,0.0003208114,0.0002737869,0.00041837,0.0005133282,0.000583323,0.001380483,0.0001422371,0.000003118749],"category_scores_gemma":[0.00004203355,0.0002966482,0.0003202229,0.0005959215,0.00009085358,0.0004354997,0.00005394564,0.0001624204,0.0003947021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002791927,"about_ca_system_score_gemma":0.0001178671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001024647,"about_ca_topic_score_gemma":0.000003047846,"domain_scores_codex":[0.9975935,0.00001781837,0.0005665521,0.0009078001,0.0005285327,0.000385843],"domain_scores_gemma":[0.9976188,0.0006128324,0.000351096,0.0008484609,0.0004081146,0.000160705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001507497,0.0009302444,0.0000247157,0.0001545819,0.000133701,0.000002032207,0.000253654,0.008572235,0.005118615,0.9169551,0.001840641,0.06586378],"study_design_scores_gemma":[0.02264381,0.003087774,0.003080987,0.006492407,0.0004034154,0.0004246077,0.001863381,0.2892368,0.06881925,0.3285098,0.268341,0.007096678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002050922,0.00001665157,0.9736685,0.002895912,0.0003131393,0.003124166,0.0002846622,0.0005206048,0.01712545],"genre_scores_gemma":[0.9568694,0.00001035812,0.03194764,0.0002663214,0.0007473388,0.009136884,0.0002637577,0.00006378283,0.0006945021],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9548185,"threshold_uncertainty_score":0.9999486,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078731783","doi":"10.1109/tvlsi.2014.2375640","title":"Scalable Elliptic Curve Cryptosystem FPGA Processor for NIST Prime Curves","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"NIST; Elliptic curve cryptography; Field-programmable gate array; Computer science; Elliptic curve point multiplication; Elliptic curve; Scalability; Parallel computing; Hessian form of an elliptic curve; Scalar multiplication; Schoof's algorithm; Embedded system; Arithmetic; Mathematics; Encryption; Public-key cryptography; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02465452726244105,"gpt":0.2566337248512674,"spread":0.2319791975888263,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00129691,0.0004470015,0.0005766052,0.0004532396,0.0005823627,0.0005883661,0.0008636894,0.0002652735,0.00001789405],"category_scores_gemma":[0.00003792711,0.0003770857,0.0003752293,0.001123923,0.00009534824,0.00103522,0.000006386144,0.0003872937,0.0002386672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002207142,"about_ca_system_score_gemma":0.0002861462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001517188,"about_ca_topic_score_gemma":0.0002547865,"domain_scores_codex":[0.9964343,0.0003358822,0.000875412,0.0008588593,0.0008297568,0.0006657992],"domain_scores_gemma":[0.9972858,0.0002569111,0.0003022363,0.0009244134,0.0008568582,0.0003737797],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.004261544,0.0350242,0.00214786,0.03292779,0.005574689,0.0002829154,0.06203163,0.2098692,0.04398873,0.134712,0.320912,0.1482674],"study_design_scores_gemma":[0.007168159,0.002608053,0.0001576015,0.006388092,0.0004204801,0.0003922097,0.005061499,0.7289105,0.1757696,0.001515479,0.06879968,0.002808644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003275986,0.001413147,0.9865239,0.000672339,0.004782426,0.001896689,0.0001607019,0.0005524121,0.0007224021],"genre_scores_gemma":[0.9901062,0.00009924568,0.005280228,0.0002130723,0.0002166967,0.001074083,0.00002923784,0.00005173837,0.002929478],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9868302,"threshold_uncertainty_score":0.9998681,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100201258","doi":"10.1016/j.jnt.2008.11.006","title":"Expander graphs based on GRH with an application to elliptic curve cryptography","year":2009,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Institute of Standards and Technology; Alfred P. Sloan Foundation; U.S. Department of Commerce; National Science Foundation","keywords":"Mathematics; Expander graph; Cayley graph; Elliptic curve; Logarithm; Riemann hypothesis; Prime (order theory); Eigenvalues and eigenvectors; Graph; Discrete mathematics; Schoof's algorithm; Combinatorics; Pure mathematics; Mathematical analysis; Quarter period","retraction":null,"screen_n_in":null,"score":{"opus":0.006488179172410969,"gpt":0.247618420138361,"spread":0.24113024096595,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000719985,0.0001690118,0.0002104174,0.0004504493,0.0001177564,0.0001198165,0.0007171459,0.00005929845,0.00006119609],"category_scores_gemma":[0.00001821006,0.0001163762,0.0001822894,0.0010787,0.00005702544,0.0004031521,0.00001571666,0.0002480046,0.00002295689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001668642,"about_ca_system_score_gemma":0.00005299111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001593512,"about_ca_topic_score_gemma":0.000001877348,"domain_scores_codex":[0.998558,0.0001794947,0.0003021697,0.0002444313,0.0004765863,0.0002393615],"domain_scores_gemma":[0.9985939,0.0001982031,0.0002224296,0.0005296535,0.0001928762,0.0002628934],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001396834,0.002217432,0.008931094,0.00002001091,0.0001200621,0.0001555263,0.00176645,0.005150356,0.002017796,0.7521954,0.002343804,0.2236853],"study_design_scores_gemma":[0.002426299,0.00678156,0.1258811,0.0002980208,0.00009217378,0.0004038524,0.000256741,0.004551904,0.002282943,0.8511791,0.005065883,0.0007804841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09689355,0.0000708475,0.8997878,0.0007722155,0.0001174675,0.0001639619,0.000002314978,0.00005179577,0.002140036],"genre_scores_gemma":[0.9401143,0.000008572481,0.05744747,0.002314491,0.00008963064,0.000005724204,0.000001257592,0.00001008461,0.000008468613],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8432208,"threshold_uncertainty_score":0.4745682,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1601407566","doi":"10.1007/978-3-540-75496-1_26","title":"Efficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication Using Multibase Number Representation","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Scalar multiplication; Elliptic curve point multiplication; Scalar (mathematics); Elliptic curve; Elliptic curve cryptography; Mathematics; Multiplication algorithm; Computer science; Algorithm; Arithmetic; Pure mathematics; Public-key cryptography; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.0299563786403336,"gpt":0.3021222506696207,"spread":0.272165872029287,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001216718,0.0004507173,0.000437217,0.0007499077,0.0004514683,0.000312098,0.001087707,0.0002574254,0.000005025317],"category_scores_gemma":[0.0001573662,0.0004093749,0.0001820833,0.0008155657,0.0006445849,0.0001792387,0.0006073821,0.0003875611,0.000008144528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001881144,"about_ca_system_score_gemma":0.0001768819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005991367,"about_ca_topic_score_gemma":0.0000326121,"domain_scores_codex":[0.9963214,0.00003377415,0.0006032293,0.001567751,0.0008256086,0.0006482092],"domain_scores_gemma":[0.997147,0.0008773008,0.0003477101,0.001046004,0.0003817337,0.0002002986],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002833501,0.0001591499,0.0003462798,0.0004220793,0.00002497582,0.00002510435,0.001294309,0.6263188,0.001309534,0.0138288,0.000008061931,0.3562346],"study_design_scores_gemma":[0.0004876352,0.00007469724,0.0004410357,0.0008475684,0.00002436728,0.00006936157,6.490494e-7,0.986341,0.003006988,0.008119036,0.00009935638,0.0004883016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01067698,0.001177161,0.9855732,0.0002269375,0.0007764985,0.001306602,0.000007941062,0.0001111959,0.0001434341],"genre_scores_gemma":[0.3406927,0.00008748965,0.658398,0.0005153901,0.0002107022,0.00002344527,0.00001061416,0.00003589149,0.00002573993],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3600222,"threshold_uncertainty_score":0.9998358,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1853876455","doi":"10.1007/3-540-36400-5_10","title":"Secure Elliptic Curve Implementations: An Analysis of Resistance to Power-Attacks in a DSP Processor","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Computer science; Elliptic curve cryptography; Very long instruction word; Power analysis; Elliptic Curve Digital Signature Algorithm; Embedded system; Cryptography; Wireless; Smart card; Computer hardware; Computer network; Computer security; Encryption; Public-key cryptography; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01361785389862258,"gpt":0.2836948517287285,"spread":0.270076997830106,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001104104,0.0004576391,0.000768384,0.003951085,0.0001592928,0.0003030326,0.002770363,0.0002209733,0.00003120142],"category_scores_gemma":[0.00008989683,0.0004282583,0.0002171035,0.006242683,0.0003925523,0.0005726093,0.0004251182,0.0005022651,0.000004849085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001871373,"about_ca_system_score_gemma":0.0003793664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004416951,"about_ca_topic_score_gemma":0.00378451,"domain_scores_codex":[0.9958044,0.00008714016,0.0008308119,0.001612601,0.001016986,0.0006480732],"domain_scores_gemma":[0.9972366,0.000354742,0.0003677261,0.001465514,0.0003647552,0.0002106685],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001119767,0.000962262,0.01700576,0.0006243087,0.0007446714,0.0004766587,0.04719664,0.5072085,0.001090942,0.2460397,0.0001640319,0.1783746],"study_design_scores_gemma":[0.002493118,0.0025297,0.03987842,0.00283989,0.0006688282,0.00006049344,0.00003825254,0.4810758,0.007385046,0.4526563,0.004673045,0.005701191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003613131,0.0006966423,0.9934208,0.000658221,0.0003478178,0.0005756576,0.00002488826,0.00005024235,0.0006125445],"genre_scores_gemma":[0.6082142,0.00005707487,0.3899088,0.001596972,0.00004888963,0.00003350694,0.00001391599,0.00002863376,0.00009799226],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6046011,"threshold_uncertainty_score":0.9998169,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080886024","doi":"10.1112/s1461157009000187","title":"The Mordell–Weil sieve: proving non-existence of rational points on curves","year":2010,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sieve (category theory); Rational point; Algebra over a field; Genus; Rational number; Simple (philosophy)","retraction":null,"screen_n_in":null,"score":{"opus":0.008561974885662713,"gpt":0.2542585128835853,"spread":0.2456965379979226,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006340114,0.00007043234,0.0001366052,0.00008192987,0.0001119407,0.00008332545,0.0002870049,0.00002651778,0.000001935475],"category_scores_gemma":[0.0001387248,0.00004345066,0.00006214107,0.0001644157,0.00009259119,0.0001797487,0.00004301908,0.0001826378,0.00000120201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003022244,"about_ca_system_score_gemma":0.0000665221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.853135e-7,"about_ca_topic_score_gemma":0.000001968754,"domain_scores_codex":[0.9990959,0.0000273557,0.0003896543,0.00006741833,0.0003373017,0.00008241965],"domain_scores_gemma":[0.9985656,0.0005179078,0.0004636646,0.0001189144,0.0002831451,0.00005076676],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005654218,0.0008816512,0.0004428775,0.0009660524,0.0001687932,0.00002648461,0.007983275,0.003090968,0.009862925,0.8721175,0.003066116,0.1013368],"study_design_scores_gemma":[0.001409183,0.0007639309,0.01083862,0.001233102,0.0000562108,0.0006676615,0.0004986203,0.4391126,0.006706796,0.5375775,0.000821651,0.0003141773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.171459,0.0001948758,0.8253754,0.001847239,0.0004099373,0.0001192515,6.799834e-7,0.000009037641,0.0005845124],"genre_scores_gemma":[0.7587404,0.0001573175,0.2408591,0.0001582385,0.0000512992,9.98952e-7,2.899142e-7,0.000004312335,0.00002799262],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5872814,"threshold_uncertainty_score":0.1771867,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1505980332","doi":"10.1007/978-3-642-15031-9_6","title":"Efficient Techniques for High-Speed Elliptic Curve Cryptography","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Speedup; Scalar multiplication; Elliptic curve point multiplication; Curve25519; Hyperelliptic curve cryptography; Elliptic curve cryptography; Elliptic Curve Digital Signature Algorithm; Computer science; Elliptic curve; x86; Parallel computing; Tripling-oriented Doche–Icart–Kohel curve; Jacobian matrix and determinant; Hessian form of an elliptic curve; Cryptography; Arithmetic; Algorithm; Mathematics; Public-key cryptography; Applied mathematics; Encryption; Software; Programming language; Pure mathematics; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.009903618559944876,"gpt":0.2346329583487652,"spread":0.2247293397888203,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001216456,0.0007492652,0.0007152897,0.002172799,0.0005371975,0.0007056806,0.00428911,0.0006842269,0.00001732855],"category_scores_gemma":[0.00008765931,0.0006455567,0.0004267915,0.001302444,0.001515607,0.0002164753,0.00102744,0.001293311,0.00001941767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001012721,"about_ca_system_score_gemma":0.0003717601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002736635,"about_ca_topic_score_gemma":0.00004962573,"domain_scores_codex":[0.9951945,0.00003456232,0.0006724452,0.002041059,0.00105651,0.001000931],"domain_scores_gemma":[0.9961051,0.000829021,0.0003762626,0.001971464,0.0004591911,0.0002589569],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002046365,0.0001639327,0.00005804093,0.0001441145,0.00004549501,0.00006447111,0.0006784984,0.008913463,0.004007761,0.3519542,0.00003099784,0.6339186],"study_design_scores_gemma":[0.0005520635,0.0006220067,0.0002340422,0.0005395666,0.00003804607,0.0000808934,1.895151e-7,0.2178241,0.03445737,0.7395291,0.00447485,0.00164777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003512373,0.00054415,0.9931061,0.0007239408,0.002689264,0.001198037,0.00001559354,0.0004576345,0.0009140747],"genre_scores_gemma":[0.09715607,0.00004692168,0.9012156,0.0007861299,0.0006400695,0.00003753554,0.000007775753,0.0000561412,0.0000537886],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6322708,"threshold_uncertainty_score":0.9995996,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1963863611","doi":"10.1109/tc.2012.22","title":"Low-Complexity Multiplier Architectures for Single and Hybrid-Double Multiplications in Gaussian Normal Bases","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"CMC Microsystems","keywords":"Exponentiation; Modular exponentiation; Computer science; Multiplier (economics); Multiplication algorithm; Cryptography; Cryptosystem; Multiplication (music); Arithmetic; Finite field; Parallel computing; Public-key cryptography; Algorithm; Encryption; Mathematics; Discrete mathematics; Binary number","retraction":null,"screen_n_in":null,"score":{"opus":0.03090075671251214,"gpt":0.254870268879105,"spread":0.2239695121665928,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001465972,0.0001900665,0.0001747217,0.0003837781,0.0003349849,0.00009288094,0.0003372329,0.00005118069,0.000005009094],"category_scores_gemma":[0.000002314948,0.0001807274,0.000125746,0.0003513169,0.0001443401,0.000210441,0.000007265189,0.0001945809,0.000005939242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003499186,"about_ca_system_score_gemma":0.00002075037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000948438,"about_ca_topic_score_gemma":0.0001357743,"domain_scores_codex":[0.9987791,0.00004704317,0.0002325091,0.0003615264,0.0001412943,0.0004384966],"domain_scores_gemma":[0.9990137,0.000331797,0.00005143718,0.0003880772,0.00003005893,0.000184968],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004915926,0.007895916,0.002920093,0.0003400206,0.0002222308,0.00001874035,0.0105987,0.2405853,0.0136175,0.008225444,0.0004388334,0.7146457],"study_design_scores_gemma":[0.009299259,0.0007434479,0.03863967,0.0002901357,0.00008104941,0.0002912184,0.0001811381,0.6384623,0.3062581,0.002457527,0.001609972,0.001686239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1773042,0.00004612957,0.8210903,0.000419118,0.0005201676,0.0004034174,0.00002085688,0.0001214351,0.00007434441],"genre_scores_gemma":[0.8896251,0.000004067584,0.1099556,0.0002380177,0.00005464347,0.00009768484,0.000002218127,0.00001217449,0.0000104497],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7129594,"threshold_uncertainty_score":0.7369849,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094812471","doi":"10.1109/tcsi.2006.883855","title":"Fast Bit Parallel-Shifted Polynomial Basis Multipliers in <formula formulatype=\"inline\"><tex>$GF(2^{n})$</tex></formula>","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Ampere; Mathematics; Polynomial; Physics; Mathematical analysis; Quantum mechanics; Voltage","retraction":null,"screen_n_in":null,"score":{"opus":0.02082547069802777,"gpt":0.250921884981296,"spread":0.2300964142832683,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.002113653,0.001690472,0.001693526,0.001708508,0.003145493,0.001367917,0.001675654,0.00102594,0.0003074263],"category_scores_gemma":[0.00004323889,0.001615032,0.0009282913,0.002899001,0.001056277,0.001393266,0.000105628,0.001384245,0.0007224043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004793971,"about_ca_system_score_gemma":0.0002413967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006000513,"about_ca_topic_score_gemma":0.007890922,"domain_scores_codex":[0.9904645,0.0008222699,0.002591382,0.002680979,0.001361964,0.002078883],"domain_scores_gemma":[0.9934745,0.001364784,0.0008971023,0.002890268,0.0003291693,0.001044153],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.002359625,0.01567765,0.003855125,0.002760631,0.003731629,0.00003922536,0.02158348,0.05999202,0.240731,0.37273,0.007629979,0.2689096],"study_design_scores_gemma":[0.0104978,0.0004260347,0.005148339,0.001354565,0.00109875,0.0009906978,0.0007577262,0.002695487,0.0009467021,0.01404183,0.9565057,0.005536439],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2601806,0.003046124,0.7270656,0.0003943208,0.001160208,0.003426696,0.001301085,0.0006733815,0.002751941],"genre_scores_gemma":[0.979838,0.0007614322,0.009290916,0.0003281479,0.0006273493,0.001714089,0.000766629,0.0002025433,0.006470945],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9488757,"threshold_uncertainty_score":0.9996688,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1920416369","doi":"10.1007/11693383_21","title":"Accelerated Verification of ECDSA Signatures","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Elliptic Curve Digital Signature Algorithm; Computer science; ElGamal encryption; Signature (topology); Digital Signature Algorithm; ElGamal signature scheme; Digital signature; Public-key cryptography; Elliptic curve cryptography; Computer security; Encryption; Mathematics; Blind signature","retraction":null,"screen_n_in":null,"score":{"opus":0.01479910046521686,"gpt":0.2348103690615239,"spread":0.2200112685963071,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004500391,0.0003651021,0.00041525,0.001043315,0.0001539237,0.0002475601,0.002667806,0.0003491042,0.0000121619],"category_scores_gemma":[0.00003257536,0.0003199306,0.0001499865,0.001036385,0.0006892894,0.0003741948,0.0005027451,0.0005824957,0.000009297363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007823771,"about_ca_system_score_gemma":0.0003191256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004771481,"about_ca_topic_score_gemma":0.00002994424,"domain_scores_codex":[0.9972472,0.00003029193,0.0004966299,0.001042002,0.0007779904,0.0004059015],"domain_scores_gemma":[0.997853,0.0002705863,0.0003358579,0.001161332,0.0002964606,0.00008280011],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001179875,0.0001140786,0.000165292,0.0001097697,0.00002888544,0.00007066971,0.0006491963,0.08909379,0.004607207,0.08003943,0.0001756959,0.8249342],"study_design_scores_gemma":[0.0006859482,0.0004119822,0.005813625,0.0007435012,0.00002955791,0.00004971103,1.907778e-7,0.5119076,0.04633477,0.4291283,0.003368802,0.001525906],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003669322,0.0009906103,0.9931827,0.0002791525,0.0008495346,0.0002664277,0.000005219102,0.0001102128,0.00394922],"genre_scores_gemma":[0.7735946,0.00006235723,0.2255111,0.0003675843,0.0002411743,0.000006054308,0.0000127925,0.00002557327,0.0001787605],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8234083,"threshold_uncertainty_score":0.9999253,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999613060","doi":"10.1007/s13389-011-0017-8","title":"Speeding scalar multiplication over binary elliptic curves using the new carry-less multiplication instruction","year":2011,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Consejo Nacional de Ciencia y Tecnología; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; University of Waterloo; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Scalar multiplication; Elliptic curve cryptography; Edwards curve; Arithmetic; Elliptic curve; Elliptic curve point multiplication; Parallel computing; Computer science; Binary number; Side channel attack; Multiplication (music); Curve25519; Mathematics; Cryptography; Algorithm; Public-key cryptography; Encryption; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02652695602035042,"gpt":0.2340954477578505,"spread":0.2075684917375001,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005344739,0.0001975653,0.0002283398,0.0006918443,0.0001581067,0.00008847602,0.0007639508,0.00009511761,0.000005387595],"category_scores_gemma":[0.00006385953,0.0001495444,0.0002706105,0.00149715,0.00005737474,0.0009600141,0.00008948102,0.0004075369,9.161196e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003868046,"about_ca_system_score_gemma":0.00005597488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006031783,"about_ca_topic_score_gemma":0.000002710704,"domain_scores_codex":[0.9985021,0.00004655173,0.0005563395,0.0002155634,0.0004153138,0.0002641219],"domain_scores_gemma":[0.99869,0.00008846505,0.0004394365,0.000423698,0.0002013193,0.0001570698],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.0001369111,0.0006207106,0.1468981,0.001014948,0.001083152,0.00009093747,0.009170949,0.1040616,0.5939267,0.05716816,0.0005503571,0.08527755],"study_design_scores_gemma":[0.001476123,0.000215427,0.5289707,0.001361334,0.0002115811,0.0007571293,0.0001966837,0.4467318,0.01621336,0.002430273,0.0008251281,0.0006104718],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5071194,0.002276824,0.4897794,0.0001355968,0.0005045275,0.0001164804,2.818113e-7,0.00004913579,0.00001828278],"genre_scores_gemma":[0.8865669,0.0008832482,0.1122154,0.00004922132,0.0002622768,0.000002920579,4.081525e-7,0.00001828666,0.000001291794],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5777133,"threshold_uncertainty_score":0.6098242,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4299660901","doi":"10.1007/978-1-4419-5906-5_245","title":"Elliptic Curve Cryptography","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Elliptic curve cryptography; Elliptic curve; Cryptography; Computer science; Mathematics; Computer security; Pure mathematics; Public-key cryptography; Encryption","retraction":null,"screen_n_in":null,"score":{"opus":0.02090620744628524,"gpt":0.2027429563935639,"spread":0.1818367489472786,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001483729,0.0004264884,0.0003706834,0.0006436414,0.0001207832,0.0001370256,0.001507784,0.0003750209,0.001264244],"category_scores_gemma":[0.000003595871,0.000350963,0.0005715447,0.0001480221,0.000188065,0.000207406,0.0003609537,0.0004344486,0.001218697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001103969,"about_ca_system_score_gemma":0.00005692809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002334268,"about_ca_topic_score_gemma":0.00001494817,"domain_scores_codex":[0.9982069,0.00001658315,0.000341916,0.000710797,0.0003649957,0.000358836],"domain_scores_gemma":[0.9981948,0.00007116813,0.0001629002,0.001277459,0.0001060748,0.0001876356],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001662571,0.00001878172,0.0000196683,0.00001905175,0.00009147776,0.00003856644,0.00008516628,2.98734e-7,0.000003251876,0.9782369,0.003858455,0.01762679],"study_design_scores_gemma":[0.0001124196,0.00009201057,0.0001156242,0.00006532168,0.00003469663,0.00002451622,0.000001034734,0.00004597086,0.00005880156,0.66214,0.3368066,0.0005031041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000001761654,0.001623418,0.250221,0.00008856823,0.0005216746,0.000159214,0.000002935325,0.0003355062,0.7470459],"genre_scores_gemma":[0.003093006,0.003005212,0.1430356,0.001197727,0.0004457334,0.00002695795,0.00001790251,0.0001369802,0.8490409],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.3329481,"threshold_uncertainty_score":0.9998943,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3210270412","doi":"","title":"A taxonomy of pairing-friendly elliptic curves","year":2006,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Pairing; Embedding; Elliptic curve; Computer science; Cryptography; Mathematics; Pure mathematics; Theoretical computer science; Physics; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01777655156329359,"gpt":0.2360314912774119,"spread":0.2182549397141183,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004651122,0.0005625153,0.001006559,0.0006571921,0.0001288065,0.00006527438,0.00276717,0.0003563421,0.00003407035],"category_scores_gemma":[0.00009813795,0.0005419149,0.0006764964,0.0003825974,0.0008492573,0.0001195229,0.004119733,0.001271148,0.00007142762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003679369,"about_ca_system_score_gemma":0.000344875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002653087,"about_ca_topic_score_gemma":0.00008942457,"domain_scores_codex":[0.9962028,0.0004604297,0.0009348058,0.001298975,0.0003917387,0.0007112488],"domain_scores_gemma":[0.9962746,0.000605889,0.0007196971,0.002067348,0.0001587646,0.0001737269],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002228165,0.0003589422,0.0149993,0.001048241,0.0002879322,0.0001344772,0.0004676939,0.001466851,0.0002228489,0.9668884,0.004318765,0.009784292],"study_design_scores_gemma":[0.0005809871,0.0002270384,0.05111358,0.001166956,0.0001292691,0.0001143773,0.00002984108,0.006745407,0.001509563,0.9282556,0.009179887,0.0009475191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02559049,0.002802506,0.9603639,0.001145339,0.0009538734,0.0009654189,0.00005009477,0.000267252,0.007861153],"genre_scores_gemma":[0.1150941,0.0006340969,0.8833967,0.0002142226,0.0001425035,0.0004239076,0.00005445414,0.00003433713,0.000005631538],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.08950362,"threshold_uncertainty_score":0.9997032,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162548688","doi":"10.1109/arith.2007.11","title":"Asymmetric Squaring Formulae","year":2007,"lang":"en","type":"article","venue":"Proceedings/Proceedings - Symposium on Computer Arithmetic","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Pohang University of Science and Technology","keywords":"Pentium; Constant (computer programming); Operand; Mathematics; Division (mathematics); Interpolation (computer graphics); Multiplication (music); Algorithm; Arithmetic; Overhead (engineering); Computer science; Combinatorics; Parallel computing; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.00907540417949722,"gpt":0.2275200321209442,"spread":0.218444627941447,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002396259,0.001009236,0.0008537266,0.003193521,0.0008886363,0.001896183,0.003124759,0.0004363127,0.00001156714],"category_scores_gemma":[0.0001010356,0.0009490487,0.0005428863,0.005913692,0.0002191807,0.002096423,0.001150134,0.001124849,0.0002289314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002925428,"about_ca_system_score_gemma":0.00007215811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002785324,"about_ca_topic_score_gemma":0.000001982817,"domain_scores_codex":[0.9927505,0.00001100187,0.00128157,0.002138999,0.001693128,0.002124763],"domain_scores_gemma":[0.9967937,0.0003304869,0.0005568482,0.0004980971,0.0009747999,0.0008460755],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001974683,0.001611368,0.02082964,0.0007587701,0.0003546663,0.0001383481,0.004226103,0.00009390712,0.01323203,0.7905648,0.009253467,0.1587394],"study_design_scores_gemma":[0.01505606,0.01244323,0.1806663,0.002640176,0.0006626194,0.004374602,0.001059977,0.37928,0.2079354,0.08032769,0.1027714,0.01278248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2281978,0.0005374188,0.6192499,0.003524108,0.003871501,0.001941299,0.000005152953,0.003938117,0.1387347],"genre_scores_gemma":[0.8499635,0.00007827084,0.1468025,0.001570478,0.001207008,0.00005861746,0.000002975738,0.0001073874,0.0002093076],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7102371,"threshold_uncertainty_score":0.999296,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127583645","doi":"10.1109/glsv.1999.757457","title":"A new algorithm for RNS magnitude comparison based on New Chinese Remainder Theorem II","year":2003,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Concordia University","funders":"","keywords":"Chinese remainder theorem; Remainder; Residue number system; Modulo; Modulo operation; Algorithm; Modulus; Computer science; Mathematics; Arithmetic; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01288153511888522,"gpt":0.267321806846309,"spread":0.2544402717274238,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003108904,0.0002394749,0.0002584347,0.0002067422,0.0002686997,0.0001519886,0.0006314524,0.00009353266,0.0001711943],"category_scores_gemma":[0.00006801096,0.0001685434,0.0002215672,0.000712152,0.00003207845,0.0001628932,0.00006947706,0.000153487,0.00002770965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001951586,"about_ca_system_score_gemma":0.0002609687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008913873,"about_ca_topic_score_gemma":0.00006746148,"domain_scores_codex":[0.9984493,0.00007527271,0.0002564341,0.0004908656,0.0003165365,0.0004115559],"domain_scores_gemma":[0.9986281,0.0002795685,0.00007056584,0.000671097,0.00005782518,0.0002928881],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003046721,0.0005851504,0.001768097,0.00001763097,0.00005890843,0.00001179338,0.000840764,0.001260125,0.00012025,0.5121789,0.0422674,0.4408605],"study_design_scores_gemma":[0.005260174,0.001349776,0.006473181,0.00005516909,0.00003794939,0.00002137849,0.00007242383,0.7484467,0.003399818,0.1824281,0.05158636,0.0008689829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006307274,0.000125488,0.9837415,0.001645934,0.0003987534,0.0004045644,0.000001798371,0.0002108607,0.0128404],"genre_scores_gemma":[0.1112856,0.000003453311,0.8846985,0.001548637,0.0001236699,0.00001359415,0.000003365072,0.00001684991,0.00230631],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7471865,"threshold_uncertainty_score":0.6873,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149110203","doi":"10.1109/tc.2009.62","title":"Concurrent Error Detection in Finite-Field Arithmetic Operations Using Pipelined and Systolic Architectures","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing; Finite field; Finite field arithmetic; Arithmetic; Field (mathematics); Algorithm; Mathematics; Cryptography; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0182988739172879,"gpt":0.2632636006046212,"spread":0.2449647266873333,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119274,0.0001857212,0.0001907103,0.000657808,0.0002670601,0.0001577962,0.0002586846,0.00008338489,0.000002276665],"category_scores_gemma":[0.000006491963,0.0001780675,0.00009459082,0.0007224067,0.00004737969,0.000153037,0.000003218148,0.000334382,0.000002944887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004162648,"about_ca_system_score_gemma":0.00003899715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001312811,"about_ca_topic_score_gemma":0.0002937818,"domain_scores_codex":[0.9987857,0.0001095115,0.0002758252,0.0003958883,0.0001762024,0.0002569004],"domain_scores_gemma":[0.9993069,0.0002391853,0.00003459274,0.0002782343,0.00003631765,0.0001047825],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009064168,0.0001652995,0.00000912088,0.00001031079,0.00001422052,0.00001322947,0.0006277355,0.5875343,0.001292977,0.0002197515,0.000003228951,0.4101008],"study_design_scores_gemma":[0.0005950738,0.0003554713,0.0006609581,0.0000964847,0.00001650829,0.00007258834,0.00002193542,0.9866518,0.01100245,0.0002892864,0.00002113152,0.0002163393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1432562,0.00007776359,0.8549391,0.0006161013,0.00075981,0.0002201066,0.000002196282,0.0001160559,0.00001269455],"genre_scores_gemma":[0.9768327,0.00001940919,0.02250886,0.0005850157,0.00003333877,0.00001022782,3.531176e-7,0.000006414165,0.00000365642],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8335766,"threshold_uncertainty_score":0.7261383,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}