{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":43,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":43,"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":"44d73b0cb73f","filters":{"venue":"Journal of Mathematical Cryptology"}},"results":[{"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":"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":"W2172194269","doi":"10.1515/jmc.2007.004","title":"Another look at HMQV","year":2007,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":89,"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":"Mathematical proof; Computer science; Key (lock); Computer security; Theoretical computer science; Key exchange; Mathematics; Public-key cryptography","retraction":null,"screen_n_in":null,"score":{"opus":0.02101922251094666,"gpt":0.3118900434789471,"spread":0.2908708209680004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001077678,0.0001045378,0.0002927117,0.0001244669,0.00005360731,0.00002298125,0.0007344108,0.0000912202,0.0001716404],"category_scores_gemma":[0.0003859099,0.00007845447,0.0001089706,0.00016155,0.00006828173,0.0002732399,0.0001890311,0.0002097211,0.00029987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008068726,"about_ca_system_score_gemma":0.00004054445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.102655e-8,"about_ca_topic_score_gemma":7.391538e-7,"domain_scores_codex":[0.9985089,0.00006443656,0.0006920896,0.0001374016,0.0003192752,0.000277866],"domain_scores_gemma":[0.9985362,0.0003279936,0.0004773482,0.000345494,0.0001878315,0.0001250896],"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.00002897264,0.0002002189,0.0001833166,0.00002875934,0.00001826943,0.00009190117,0.0004874621,0.000003125862,0.002200912,0.9928493,0.000486877,0.003420879],"study_design_scores_gemma":[0.0005148649,0.0001714112,0.0004516183,0.00002982791,0.000008219312,0.001249445,0.00004424254,0.0005735455,0.0110919,0.9818918,0.003869713,0.000103472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00864895,0.00004037775,0.9857323,0.002233309,0.0001548945,0.000377807,1.840449e-7,0.0000282146,0.002783919],"genre_scores_gemma":[0.453418,0.0000021799,0.5455177,0.0007231118,0.0001109515,0.00001516987,7.851428e-8,0.00001184888,0.0002008945],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4447691,"threshold_uncertainty_score":0.3854322,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985273268","doi":"10.1515/jmc.2008.006","title":"On the security of multi-prime RSA","year":2008,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Prime (order theory); Factoring; Exponent; Public-key cryptography; Mathematics; Cryptography; Algebraic number; Arithmetic; Discrete mathematics; Computer science; Computer security; Combinatorics; Algorithm; Encryption; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.02980014665877204,"gpt":0.2613415051658113,"spread":0.2315413585070392,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006188429,0.0001027116,0.0003583301,0.0001438309,0.00008833481,0.00001112183,0.0008567806,0.00008573315,0.00004567292],"category_scores_gemma":[0.0005534776,0.00005469794,0.0002385575,0.0002536776,0.0001988813,0.00009408515,0.0001043743,0.0003469265,0.00003111392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009636894,"about_ca_system_score_gemma":0.00006245102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.38892e-7,"about_ca_topic_score_gemma":4.039012e-7,"domain_scores_codex":[0.9986547,0.000191616,0.0005396521,0.0001042582,0.0003258966,0.0001838625],"domain_scores_gemma":[0.9981576,0.000878157,0.0003697963,0.0003535899,0.0001571016,0.00008381353],"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.00002408327,0.0006398139,0.0001694462,0.00002794808,0.00006735406,0.0001377109,0.001623507,0.00001382442,0.0007089302,0.9947127,0.001381099,0.0004935468],"study_design_scores_gemma":[0.0008936528,0.0007610981,0.002558813,0.00009474038,0.00003110629,0.003215153,0.0001773721,0.006522678,0.009064719,0.976318,0.0002178281,0.0001448373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4230506,0.0002188091,0.5704404,0.004925589,0.00022489,0.00009175792,6.281184e-7,0.00001452807,0.00103282],"genre_scores_gemma":[0.939787,0.0000322486,0.05991672,0.0002153143,0.00003653486,0.000001146121,2.988228e-8,0.000004264618,0.000006790646],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5167363,"threshold_uncertainty_score":0.2230517,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971243765","doi":"10.1515/jmc-2013-0038","title":"Quantum computation of discrete logarithms in semigroups","year":2014,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":33,"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":"Discrete logarithm; Mathematics; Discrete mathematics; Semigroup; Abelian group; Order (exchange); Quantum; Quantum algorithm; Constructive; Cryptosystem; Logarithm; Quantum computer; Pure mathematics; Combinatorics; Cryptography; Algorithm; Computer science; Public-key cryptography; Encryption; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.01041743502972207,"gpt":0.2623641466392208,"spread":0.2519467116094987,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001068878,0.0001130786,0.0005035441,0.0002322367,0.00002592483,0.00002343856,0.0005472988,0.00008656611,0.000003250415],"category_scores_gemma":[0.0003943982,0.00008170096,0.000116388,0.000241902,0.00005805581,0.0001161007,0.0001282405,0.0003235051,0.000006669956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001652398,"about_ca_system_score_gemma":0.0000383752,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000193127,"about_ca_topic_score_gemma":9.935962e-7,"domain_scores_codex":[0.9983557,0.0002329349,0.000788053,0.0001371401,0.000273805,0.000212384],"domain_scores_gemma":[0.9986603,0.0004600536,0.0005007283,0.0001808292,0.0001173723,0.00008067401],"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.00003468978,0.000383616,0.0007261809,0.0002268415,0.00004176854,0.00007726727,0.001904317,0.01576254,0.001067824,0.9450979,0.0002445085,0.0344326],"study_design_scores_gemma":[0.0003832436,0.0003249506,0.001333334,0.0001153,0.000005047877,0.0003814444,0.00003462205,0.6132565,0.0001785435,0.3838871,0.00003543802,0.00006448825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2421395,0.0000413673,0.7558289,0.001593484,0.0001852841,0.00003601856,2.000208e-7,0.0000110967,0.000164211],"genre_scores_gemma":[0.7690515,0.000002064673,0.2308102,0.00006600348,0.00006344815,3.897614e-7,1.263566e-7,0.000004909568,0.000001405387],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5974939,"threshold_uncertainty_score":0.3331669,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069036743","doi":"10.1515/jmc.2008.014","title":"Another look at non-standard discrete log and Diffie-Hellman problems","year":2008,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":32,"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; Mathematics; Genus; Standard Model (mathematical formulation); Discrete mathematics; Theoretical computer science; Computer science; Computer security; Public-key cryptography; Encryption; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.01724332120571248,"gpt":0.2433354980022897,"spread":0.2260921767965772,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004469863,0.0001744652,0.0005249137,0.0001543893,0.0001589816,0.0000442552,0.0005828982,0.0001288353,0.00007789883],"category_scores_gemma":[0.0001008535,0.0001217373,0.0001552303,0.0001750066,0.0002501362,0.0003691324,0.0003253882,0.0002926047,0.00003539119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002754954,"about_ca_system_score_gemma":0.00004788722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.712888e-7,"about_ca_topic_score_gemma":0.000003912698,"domain_scores_codex":[0.9984365,0.00008662727,0.0005914341,0.0002260257,0.0003444673,0.0003149183],"domain_scores_gemma":[0.9988126,0.0001986708,0.0003261347,0.0003719402,0.0001059318,0.000184703],"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.0003858282,0.0009391382,0.01030961,0.0005303529,0.0003132024,0.001393841,0.008561227,0.00001996114,0.004399403,0.9382914,0.03146912,0.003386911],"study_design_scores_gemma":[0.003548942,0.002044993,0.007475088,0.0002512932,0.00008467033,0.0179884,0.0001874961,0.003371374,0.002338078,0.9426259,0.01941857,0.0006652338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1913083,0.0004066273,0.8044756,0.002057586,0.0001580905,0.0001178701,0.0000056328,0.00002453656,0.001445776],"genre_scores_gemma":[0.8090518,0.0003054651,0.1899517,0.0004896877,0.0001423074,0.000004307011,9.974506e-7,0.00001746028,0.00003627215],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6177436,"threshold_uncertainty_score":0.4964303,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996714756","doi":"10.1515/jmc.2008.011","title":"Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formulæ","year":2008,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Universidad de Talca","keywords":"Hyperelliptic curve cryptography; Arithmetic; Jacobian matrix and determinant; Binary number; Mathematics; Genus; Field (mathematics); Pure mathematics; Computer science; Applied mathematics; Biology; Zoology","retraction":null,"screen_n_in":null,"score":{"opus":0.01639432943262557,"gpt":0.2547704709577174,"spread":0.2383761415250918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005722675,0.0002243404,0.000736483,0.0004663785,0.0001243873,0.00004011401,0.0007510111,0.0002689314,0.00005213118],"category_scores_gemma":[0.0005005964,0.0001700677,0.0002784245,0.0003671017,0.0001609543,0.0003235782,0.0002639305,0.0006350924,0.000008646444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001934078,"about_ca_system_score_gemma":0.00008124842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006472347,"about_ca_topic_score_gemma":0.000002784137,"domain_scores_codex":[0.9978156,0.0001494328,0.0009997884,0.0002549202,0.0004156346,0.0003646434],"domain_scores_gemma":[0.997599,0.001108914,0.0005009593,0.0004218745,0.000174442,0.0001948329],"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.0006692267,0.004056265,0.01083305,0.003258936,0.001375065,0.006721443,0.0429027,0.0002629894,0.01589256,0.8598419,0.005598686,0.04858711],"study_design_scores_gemma":[0.003013241,0.004857219,0.007967371,0.001337602,0.0002459294,0.02409065,0.0005861097,0.03238349,0.01119494,0.9132236,0.0002993135,0.0008005337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6451659,0.0006467361,0.3520139,0.001439675,0.0002579678,0.000103324,5.80462e-7,0.00001874876,0.0003531504],"genre_scores_gemma":[0.8810002,0.0002262383,0.118269,0.0003990912,0.00007521604,0.00000315894,1.595174e-7,0.00001180825,0.00001512759],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2358343,"threshold_uncertainty_score":0.6935158,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064190686","doi":"10.1515/jmc-2013-5004","title":"Another look at HMAC","year":2013,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":23,"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":"Hash-based message authentication code; Hash function; Computer science; Message authentication code; Computer security; Cryptography; Authentication (law); Code (set theory); Cryptographic hash function; Cryptographic primitive; Theoretical computer science; Cryptographic protocol; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01973009016552912,"gpt":0.2759682676567227,"spread":0.2562381774911935,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000327276,0.00009265921,0.0002628753,0.0001472797,0.00006821397,0.0000570417,0.0005180656,0.00006068463,0.001386023],"category_scores_gemma":[0.00008685284,0.00006535662,0.0001347067,0.0001687209,0.00003801452,0.0003117569,0.0001467712,0.0001433987,0.000385116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002919985,"about_ca_system_score_gemma":0.00003301764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002103319,"about_ca_topic_score_gemma":0.00000201211,"domain_scores_codex":[0.9988241,0.00007897557,0.0005283281,0.0001053673,0.0002383602,0.0002249024],"domain_scores_gemma":[0.9990723,0.0001635987,0.0002618885,0.0002242067,0.0001785396,0.0000994881],"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.000005823323,0.0002058357,0.0005707502,0.00002586907,0.0000530957,0.00003201704,0.0008347355,0.000001857519,0.002012798,0.970737,0.02192186,0.0035984],"study_design_scores_gemma":[0.0007731132,0.0003141097,0.002018912,0.00002143181,0.00001925076,0.001456162,0.0002474517,0.003684351,0.00114065,0.9845318,0.005631308,0.0001615161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2896337,0.00009828333,0.7002338,0.007330179,0.0002210641,0.0001214387,4.929864e-7,0.00002120031,0.002339875],"genre_scores_gemma":[0.8400448,0.00001213678,0.158937,0.0008462853,0.00007771346,0.000006667432,2.156633e-7,0.000007293085,0.00006782784],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5504112,"threshold_uncertainty_score":0.9995269,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024310614","doi":"10.1515/jmc.2008.007","title":"Improved security analysis of PMAC","year":2008,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Regional Municipality of Waterloo; University of Waterloo","funders":"","keywords":"PMAC; Parallelizable manifold; Computer science; Message authentication code; Upper and lower bounds; Authentication (law); Provable security; Theoretical computer science; Algorithm; Mathematics; Cryptography; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.02477130548309333,"gpt":0.2978662247649975,"spread":0.2730949192819042,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005775906,0.00009667728,0.000611707,0.0006025382,0.0000646428,0.00001328937,0.0005668296,0.00006911757,0.0001176047],"category_scores_gemma":[0.0001932895,0.00007381653,0.0004059512,0.001120733,0.00009312914,0.0001973273,0.0001004524,0.0001823645,0.000002882158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001568842,"about_ca_system_score_gemma":0.00007828006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004613353,"about_ca_topic_score_gemma":0.000006603724,"domain_scores_codex":[0.9984204,0.0001087894,0.0008774534,0.0001194208,0.0002844044,0.0001895818],"domain_scores_gemma":[0.9984481,0.0002506972,0.0005700225,0.0003039968,0.000320125,0.0001070183],"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.00003453808,0.0008017264,0.004336869,0.00005810605,0.001473087,0.0001015374,0.005672089,0.00002355999,0.001908408,0.983514,0.0009648676,0.001111211],"study_design_scores_gemma":[0.002617627,0.001526956,0.02541835,0.00003834381,0.001604044,0.002465302,0.001303396,0.1458717,0.004377262,0.8133079,0.0009661792,0.0005029563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.439723,0.00005365215,0.5592324,0.0006067569,0.00007988272,0.00004105863,0.000002374172,0.00000810206,0.000252754],"genre_scores_gemma":[0.9040704,0.00003118055,0.09578798,0.00007988317,0.0000234622,0.000001233406,6.169808e-7,0.000002871176,0.000002319492],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4643475,"threshold_uncertainty_score":0.301015,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104145890","doi":"10.1515/jmc.2009.003","title":"One-round secure comparison of integers","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Predicate (mathematical logic); Extension (predicate logic); Computer science; Common value auction; Proxy (statistics); Set (abstract data type); Theoretical computer science; Encryption; Cryptography; Discrete mathematics; Mathematics; Computer security; Programming language; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03433697848249082,"gpt":0.3210987023680869,"spread":0.2867617238855961,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005662395,0.0001168313,0.0006423388,0.0002123792,0.00003852174,0.00003950487,0.0009575323,0.0001270941,0.00003795873],"category_scores_gemma":[0.0002811441,0.00009493074,0.0002197347,0.0003107,0.00007946237,0.0003681274,0.00008231144,0.0003996055,0.00001432937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001692322,"about_ca_system_score_gemma":0.0000568555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.326257e-7,"about_ca_topic_score_gemma":9.682108e-7,"domain_scores_codex":[0.998274,0.0001101449,0.0008928715,0.0001339858,0.0003682474,0.0002207073],"domain_scores_gemma":[0.9984412,0.0002502318,0.0006048671,0.0003550125,0.0002098895,0.0001388452],"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.00003724013,0.0007879832,0.000173911,0.00004292974,0.00004104818,0.00001611216,0.00117653,0.000007257303,0.0009202861,0.9878827,0.001827596,0.007086456],"study_design_scores_gemma":[0.0005000434,0.00111782,0.001189903,0.00009767796,0.00003701439,0.0002717714,0.0003635136,0.001970058,0.002424121,0.9912785,0.0006269237,0.000122612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08204827,0.0002985939,0.9123619,0.003400884,0.0001905423,0.00005899131,0.00000173157,0.00001834591,0.001620742],"genre_scores_gemma":[0.7746815,0.00001039497,0.2250887,0.0001631243,0.00005249507,2.772003e-7,3.860595e-7,0.00000251647,5.752548e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6926333,"threshold_uncertainty_score":0.3871163,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037126171","doi":"10.1515/jmc.2007.010","title":"An efficient and secure two-flow zero-knowledge identification protocol","year":2007,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"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":"Zero-knowledge proof; Identification (biology); Computer science; Protocol (science); Flow (mathematics); Zero (linguistics); Knowledge flow; Theoretical computer science; Cryptography; Computer security; Mathematics; Medicine; Knowledge management; Philosophy; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.01542390334754307,"gpt":0.3342108138883982,"spread":0.3187869105408551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002429076,0.0001383828,0.0003119819,0.0002601309,0.0001024406,0.0001221218,0.0006685468,0.0001099705,0.00001726458],"category_scores_gemma":[0.0001915218,0.000105009,0.00009446571,0.0003080628,0.00009730869,0.0003761315,0.0001215743,0.0003010126,0.00002299572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002242084,"about_ca_system_score_gemma":0.00005288983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.896293e-7,"about_ca_topic_score_gemma":0.000002810639,"domain_scores_codex":[0.998289,0.0001423147,0.0007853471,0.0002251504,0.0002785064,0.000279625],"domain_scores_gemma":[0.998432,0.0002285075,0.0004093724,0.0004131038,0.0002598421,0.0002571577],"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.00007863055,0.001040279,0.0002173394,0.0001398352,0.0000251338,0.00006481859,0.002050329,0.0000425465,0.002151153,0.9807056,0.000500826,0.01298353],"study_design_scores_gemma":[0.002497255,0.0009600901,0.003928626,0.0001169466,0.00004616702,0.00263715,0.0003595843,0.07734446,0.004378397,0.9049109,0.002461969,0.0003584253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03810719,0.00003194321,0.9580379,0.0002780505,0.0001687255,0.002959378,0.000001634513,0.00003126406,0.0003839389],"genre_scores_gemma":[0.6839525,0.000001307409,0.3155549,0.00007274046,0.0001463426,0.0002615087,8.270991e-7,0.000008556333,0.000001377818],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6458453,"threshold_uncertainty_score":0.4282143,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005895372","doi":"10.1515/jmc.2007.015","title":"Minimal weight and colexicographically minimal integer representations","year":2007,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Dimension (graph theory); Integer (computer science); Discrete mathematics; Set (abstract data type); Representation (politics); Minimal models; Arithmetic; Combinatorics; Algebra over a field; Pure mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01260887349827984,"gpt":0.2798365928290339,"spread":0.2672277193307541,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001111361,0.0001376081,0.0003757991,0.0004697836,0.0001098642,0.00006973399,0.00051818,0.0001453485,0.00003126229],"category_scores_gemma":[0.0003887784,0.00009965879,0.0001929622,0.0004781518,0.0002669941,0.000257001,0.0001534023,0.0003684729,0.00001104028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001010693,"about_ca_system_score_gemma":0.00004705258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.765567e-7,"about_ca_topic_score_gemma":0.00000296242,"domain_scores_codex":[0.9982443,0.00009872596,0.0008029705,0.0001986939,0.0003333343,0.0003220153],"domain_scores_gemma":[0.9981359,0.0008163297,0.0003180505,0.0002487871,0.0002225793,0.0002584015],"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.00009515566,0.0003927446,0.003579212,0.00004753995,0.0001154636,0.0004772819,0.000812178,0.000001255665,0.001871958,0.9843369,0.001109367,0.007160929],"study_design_scores_gemma":[0.001879449,0.001403387,0.0715209,0.000132904,0.0001311122,0.009480582,0.001027116,0.001502454,0.002640376,0.9083299,0.00156879,0.0003830246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1919345,0.0003274129,0.799628,0.005244344,0.0002781468,0.00008024742,4.856952e-7,0.00002415535,0.002482776],"genre_scores_gemma":[0.7005167,0.00002858987,0.2991148,0.0002148297,0.0001042155,0.000001351227,1.295599e-7,0.000006225909,0.00001316719],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5085822,"threshold_uncertainty_score":0.4063968,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3036444063","doi":"10.1515/jmc-2015-0056","title":"New Techniques for SIDH-based NIKE","year":2020,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; York University; University of Toronto","funders":"Canada First Research Excellence Fund; Public Works and Government Services Canada; Royal Bank of Canada","keywords":"Key exchange; Computer science; Isogeny; Adversary; Key (lock); Computer security; Public-key cryptography; Protocol (science); Nike; Cryptography; Diffie–Hellman key exchange; Mathematics; Elliptic curve; Advertising","retraction":null,"screen_n_in":null,"score":{"opus":0.02557958490615122,"gpt":0.2749462218296103,"spread":0.249366636923459,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003162113,0.0001152873,0.0003855275,0.0001257045,0.00004583678,0.00005129191,0.0007502987,0.0001054955,0.00003003733],"category_scores_gemma":[0.0004696285,0.00008259074,0.000277133,0.0002536002,0.00003580513,0.0001462002,0.00006350463,0.0002038742,0.00001438946],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009677526,"about_ca_system_score_gemma":0.0001586036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.343974e-7,"about_ca_topic_score_gemma":2.02692e-7,"domain_scores_codex":[0.9988602,0.00005822022,0.000509126,0.0001445771,0.0002130309,0.0002148395],"domain_scores_gemma":[0.9987284,0.0004149508,0.000266447,0.0001773596,0.0001468199,0.0002660177],"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.0001143736,0.00019216,0.00007159165,0.0002228594,0.00007920842,0.00009459559,0.0005187076,0.00002387828,0.003562899,0.9134238,0.03352685,0.04816911],"study_design_scores_gemma":[0.001371459,0.002302027,0.00009421154,0.00009810327,0.00007258924,0.0004151598,0.00007241721,0.01361424,0.03111923,0.9262939,0.02428359,0.0002630596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005894406,0.0001151555,0.9543043,0.04427223,0.0001099212,0.0001346269,6.094406e-7,0.00005699321,0.0004167781],"genre_scores_gemma":[0.07552508,0.00000462066,0.9218255,0.002331298,0.0002954814,0.000003814501,1.49559e-7,0.000008574682,0.000005530537],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.07493563,"threshold_uncertainty_score":0.3367953,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041780131","doi":"10.1515/jmc.2010.003","title":"Common modulus attacks on small private exponent RSA and some fast variants (in practice)","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Exponent; Cryptography; Modulus; Cryptanalysis; Mathematics; Computer science; Computer security; Arithmetic; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.01795605403223394,"gpt":0.2806987262896556,"spread":0.2627426722574217,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001256376,0.0001685565,0.0004775928,0.000259551,0.00006303311,0.0001088998,0.0007276206,0.0001742069,0.00001761624],"category_scores_gemma":[0.000718399,0.0001291192,0.00009261296,0.0001796768,0.00009374683,0.0006798567,0.0002703267,0.0009438006,0.00002658443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001662196,"about_ca_system_score_gemma":0.00004060936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003424595,"about_ca_topic_score_gemma":0.00001200238,"domain_scores_codex":[0.9982558,0.0002043996,0.0006905876,0.000238963,0.0002924248,0.0003177864],"domain_scores_gemma":[0.9981259,0.0006650048,0.0004353338,0.0004738297,0.00008525715,0.0002147465],"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.00009938375,0.000796002,0.0004060712,0.00003667161,0.0000329443,0.0003677722,0.0005795264,0.000003751808,0.001902312,0.9908163,0.0001782605,0.004781028],"study_design_scores_gemma":[0.001815425,0.0009210593,0.01150258,0.0001236791,0.00004298823,0.003465628,0.0001749774,0.00604162,0.0009415856,0.9726394,0.002045471,0.0002855562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7917556,0.00006989185,0.199244,0.007368061,0.0006664005,0.000143961,0.000003103969,0.00002180788,0.0007272175],"genre_scores_gemma":[0.7699774,0.00004378939,0.2292632,0.0005862981,0.000116711,0.000002837,4.937729e-7,0.000008035731,0.000001195527],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03001923,"threshold_uncertainty_score":0.5265326,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3111886287","doi":"10.1515/jmc-2020-0071","title":"Towards Isogeny-Based Password-Authenticated Key Establishment","year":2020,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"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; Canada First Research Excellence Fund; Public Works and Government Services Canada; Royal Bank of Canada","keywords":"Password; Computer science; Key exchange; Zero-knowledge password proof; Authenticated Key Exchange; Computer security; Cryptography; Cryptographic primitive; Key (lock); Password strength; Public-key cryptography; Theoretical computer science; One-time password; Cryptographic protocol; Encryption","retraction":null,"screen_n_in":null,"score":{"opus":0.02433102281915421,"gpt":0.2535551929376487,"spread":0.2292241701184945,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004968859,0.0001835538,0.0005310074,0.0001910657,0.00006721317,0.0001145104,0.001148546,0.0001283539,0.0001153531],"category_scores_gemma":[0.0005175076,0.0001313004,0.0003155202,0.0006043197,0.0000899341,0.0002241852,0.0001617235,0.0003783133,0.00008840793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002248302,"about_ca_system_score_gemma":0.0001786076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.891431e-7,"about_ca_topic_score_gemma":2.153503e-7,"domain_scores_codex":[0.9979541,0.0001712601,0.0007918914,0.0002291553,0.0005053828,0.000348238],"domain_scores_gemma":[0.9984527,0.0002200043,0.0003902253,0.0003086354,0.000238759,0.0003896501],"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.0001990707,0.001364099,0.0004920509,0.0004157177,0.0003668689,0.001017838,0.003866294,0.0002082714,0.00538952,0.9525849,0.009359152,0.02473621],"study_design_scores_gemma":[0.005202864,0.003645508,0.002043087,0.0002851088,0.0003668315,0.001483245,0.0006861441,0.1253428,0.02634094,0.8203592,0.01326014,0.0009842085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02460437,0.0001911808,0.9286432,0.04531698,0.0002482487,0.0001080788,0.000001246282,0.00005928762,0.0008273828],"genre_scores_gemma":[0.7185555,0.000009698691,0.2795705,0.001733705,0.0001137922,0.000003050013,3.948313e-7,0.00001058171,0.000002735135],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6939511,"threshold_uncertainty_score":0.5354274,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143987151","doi":"10.1515/jmc.2008.018","title":"Two attacks on a sensor network key distribution scheme of Cheng and Agrawal","year":2008,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Wireless sensor network; Node (physics); Computer science; Scheme (mathematics); Cluster (spacecraft); Pairwise comparison; Key (lock); Computer network; Topology (electrical circuits); Mathematics; Computer security; Artificial intelligence; Combinatorics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02216529395055507,"gpt":0.2667200353334149,"spread":0.2445547413828598,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005370418,0.000163152,0.0006021764,0.00007054461,0.00009242461,0.00002137492,0.0004348393,0.0001516992,0.0000133929],"category_scores_gemma":[0.00037127,0.0001294473,0.0001374939,0.0002312384,0.0001840164,0.0001543666,0.0001338471,0.0004742397,0.0000148543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003861562,"about_ca_system_score_gemma":0.00004864901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.514767e-7,"about_ca_topic_score_gemma":5.075924e-7,"domain_scores_codex":[0.9981573,0.000180377,0.0007551199,0.000180865,0.00038545,0.0003409452],"domain_scores_gemma":[0.998099,0.0006667339,0.0005441258,0.0003012022,0.0002244511,0.0001645013],"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.0001817738,0.0004804535,0.002244316,0.0001036476,0.0001406706,0.0004778949,0.001402776,0.001001637,0.0005236044,0.9874715,0.004312749,0.001659011],"study_design_scores_gemma":[0.009457514,0.005707014,0.01601417,0.001562683,0.0002136199,0.04506666,0.000741768,0.304792,0.004946199,0.6066748,0.003317603,0.001505909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7088327,0.0002604825,0.2887424,0.001465212,0.0002586434,0.00007927491,0.000001561152,0.00002133372,0.0003383842],"genre_scores_gemma":[0.8527814,0.0000886194,0.1466743,0.0001336487,0.0003063055,0.000001120449,8.041201e-7,0.000008400646,0.000005410878],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3807966,"threshold_uncertainty_score":0.5278709,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4211129862","doi":"10.1515/jmc-2021-0016","title":"Cryptanalysis of “MAKE”","year":2022,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Blackberry (Canada)","funders":"","keywords":"Cryptanalysis; Linear cryptanalysis; Computer science; Impossible differential cryptanalysis; Computer security; Cryptography","retraction":null,"screen_n_in":null,"score":{"opus":0.01518316274001528,"gpt":0.2579301987313154,"spread":0.2427470359913001,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001439646,0.0001214877,0.0005803027,0.000404227,0.0000899467,0.0000229735,0.001131568,0.00004677148,0.0004983438],"category_scores_gemma":[0.0004485617,0.0001026004,0.0003221727,0.0006166746,0.00006083979,0.0001983889,0.0003708219,0.0004159003,0.00002453782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001009696,"about_ca_system_score_gemma":0.0001515902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001553521,"about_ca_topic_score_gemma":3.993537e-7,"domain_scores_codex":[0.9975439,0.0003462677,0.0009774308,0.0001607473,0.000744301,0.0002273383],"domain_scores_gemma":[0.9979739,0.0004021772,0.00086212,0.0003891646,0.0002577848,0.0001148607],"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.0001292712,0.001112699,0.0001894913,0.0001329987,0.0002939165,0.0004076684,0.001257877,0.002526913,0.03090296,0.9481654,0.003774786,0.01110601],"study_design_scores_gemma":[0.001635769,0.001877499,0.0004454538,0.00004769496,0.000211613,0.004194773,0.0008294825,0.05549395,0.008224366,0.9240465,0.002663546,0.0003294095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05558622,0.0001570939,0.9392299,0.003600598,0.0002687553,0.00006538306,0.000001947971,0.00002044207,0.001069679],"genre_scores_gemma":[0.7973499,0.000005798255,0.2022664,0.000268381,0.00006173988,0.000004891218,3.953093e-7,0.000009168692,0.00003330405],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7417637,"threshold_uncertainty_score":0.5456516,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3036855880","doi":"10.1515/jmc-2015-0057","title":"A subexponential-time, polynomial quantum space algorithm for inverting the CM group action","year":2020,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Canada First Research Excellence Fund; Public Works and Government Services Canada; Royal Bank of Canada","keywords":"Isogeny; Mathematics; Polynomial; Group (periodic table); Quantum algorithm; Action (physics); Quantum computer; Time complexity; Quantum; Cryptosystem; Multiplication (music); Group action; Discrete mathematics; Space (punctuation); Algorithm; Algebra over a field; Elliptic curve; Combinatorics; Pure mathematics; Computer science; Cryptography; Mathematical analysis; Quantum mechanics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03095288594065633,"gpt":0.2680828124425766,"spread":0.2371299265019203,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007159672,0.0001483666,0.0004086191,0.0001063837,0.0001753061,0.0001047861,0.0008045471,0.0001150173,0.00002260371],"category_scores_gemma":[0.0004685456,0.00009245505,0.0003431157,0.0003134196,0.00008869114,0.0002802904,0.0001485685,0.0003434025,0.00003457627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001819993,"about_ca_system_score_gemma":0.00005968587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001517783,"about_ca_topic_score_gemma":4.698424e-7,"domain_scores_codex":[0.9983988,0.0001863809,0.0006243945,0.0001884208,0.0002932679,0.0003087213],"domain_scores_gemma":[0.9983495,0.000659083,0.0004689828,0.0002062345,0.0001362119,0.0001799294],"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.0004654933,0.0008518602,0.0000709651,0.0003746203,0.0006390869,0.0001990093,0.005181497,0.00007742339,0.06187906,0.6981997,0.0389061,0.1931551],"study_design_scores_gemma":[0.002310275,0.002130808,0.0001919802,0.00008840224,0.0001843273,0.001538593,0.0008645093,0.7086035,0.004739522,0.2712803,0.007703596,0.0003641908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01452959,0.0001341909,0.958973,0.02562146,0.0004120227,0.0002256225,0.000001220258,0.00003459966,0.00006828873],"genre_scores_gemma":[0.2297639,0.00002901679,0.7677798,0.001336054,0.001037949,0.00002140889,7.041799e-7,0.00002305578,0.000008102636],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7085261,"threshold_uncertainty_score":0.3770207,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078293442","doi":"10.1515/jmc.2010.001","title":"Factor-4 and 6 compression of cyclotomic subgroups of and","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Pairing; Exponentiation; Mathematics; Discrete logarithm; Finite field; Multiplicative group; Prime (order theory); Elliptic curve; Cryptography; Order (exchange); Embedding; Prime factor; Discrete mathematics; Multiplicative function; Combinatorics; Pure mathematics; Algorithm; Public-key cryptography; Computer science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01011419312858089,"gpt":0.2554686893593438,"spread":0.2453544962307629,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002856221,0.00007715954,0.000385684,0.0001635985,0.00002448136,0.00001218073,0.0002748241,0.00009811256,0.00001309741],"category_scores_gemma":[0.0001409064,0.00005090765,0.00006935662,0.00009570716,0.0002017301,0.0001200801,0.0001255938,0.0002453811,5.257113e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001539795,"about_ca_system_score_gemma":0.00002131339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001307458,"about_ca_topic_score_gemma":0.000001238571,"domain_scores_codex":[0.9991153,0.00005663572,0.000470585,0.00008821914,0.0001612809,0.0001079371],"domain_scores_gemma":[0.9989011,0.0003710992,0.0003696089,0.0001640366,0.000101962,0.00009221303],"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.00005677616,0.0003655097,0.01314942,0.0004047085,0.00007785731,0.00003245156,0.001470149,0.000001975777,0.2651183,0.7077324,0.00007608636,0.01151441],"study_design_scores_gemma":[0.001785335,0.0009489477,0.1373634,0.0002508008,0.00006585754,0.00315775,0.0002106115,0.005414052,0.04702227,0.8034444,0.0001242997,0.0002122485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9076657,0.0001960211,0.09147183,0.000396065,0.0001045481,0.00004373322,7.684795e-7,0.000004190634,0.0001171652],"genre_scores_gemma":[0.9030739,0.00003935027,0.09685141,0.000013429,0.00001772186,2.98701e-7,2.983506e-8,0.00000290098,9.41747e-7],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.218096,"threshold_uncertainty_score":0.2075954,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144731398","doi":"10.1515/jmc-2013-5002","title":"A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage","year":2013,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":8,"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":"Retrievability; Foundation (evidence); Computer science; Cloud computing; Coding (social sciences); Cloud storage; Mathematics; Theoretical computer science; Information retrieval; Statistics; Operating system; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.02797886585797383,"gpt":0.3078930306575395,"spread":0.2799141647995657,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002119024,0.000110041,0.0005488437,0.000218069,0.0001119469,0.000043907,0.0007689121,0.00009746201,0.0001095351],"category_scores_gemma":[0.003261567,0.00007281938,0.0004316621,0.0005019376,0.0001783429,0.0003246504,0.0001150492,0.0001523642,0.000001858472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000573313,"about_ca_system_score_gemma":0.0001658323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001965369,"about_ca_topic_score_gemma":0.00000597147,"domain_scores_codex":[0.9982547,0.0001694821,0.0009245889,0.0001573215,0.0003012968,0.000192639],"domain_scores_gemma":[0.9937099,0.003904496,0.0008865467,0.0004015641,0.001033235,0.00006432317],"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.00004440156,0.0002280981,0.00006137729,0.0001362681,0.0006997536,3.335915e-7,0.0004870553,0.0002362483,0.0008390418,0.9948893,0.001096842,0.001281324],"study_design_scores_gemma":[0.0004780646,0.0002439261,0.0007263257,0.00002594018,0.0006008759,0.00002613749,0.0001735136,0.1995454,0.001431396,0.7962103,0.0004571922,0.00008093282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1106775,0.00007161848,0.8856461,0.00283862,0.0001863372,0.0005042917,0.00004949095,0.000006706466,0.00001939009],"genre_scores_gemma":[0.7375276,0.000002483578,0.2621982,0.00008029008,0.0001176998,0.00004582985,0.00001252673,0.000005832221,0.000009484833],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6268502,"threshold_uncertainty_score":0.3904637,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2794450234","doi":"10.1515/jmc-2017-0058","title":"A survey and refinement of repairable threshold schemes","year":2018,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":7,"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; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Metric (unit); Theoretical computer science; Scheme (mathematics); Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04044575581766818,"gpt":0.305518014241802,"spread":0.2650722584241338,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00100756,0.00009209314,0.0003881682,0.0001380501,0.00003519771,0.00001626823,0.0006748619,0.00008253641,0.00001994601],"category_scores_gemma":[0.001369119,0.00006571337,0.00004157878,0.0001997184,0.0002579307,0.0002672177,0.0004197534,0.000163768,0.000009382419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000172725,"about_ca_system_score_gemma":0.0000432598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001058116,"about_ca_topic_score_gemma":0.000002878647,"domain_scores_codex":[0.9988588,0.00005641093,0.0005558424,0.0001409661,0.0002125174,0.0001754276],"domain_scores_gemma":[0.998526,0.0002590813,0.0004317185,0.0004407432,0.0002884346,0.00005403609],"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.0000533994,0.000225883,0.001558943,0.00009572806,0.00007307744,0.00005740216,0.0002762992,0.000001635792,0.002965065,0.9804362,0.006929472,0.007326914],"study_design_scores_gemma":[0.0008509615,0.002065283,0.002438051,0.0001362335,0.00002143605,0.0009550749,0.0001710676,0.004366724,0.01869235,0.9658164,0.004275379,0.000211002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1376014,0.0003604588,0.859192,0.002274789,0.0001183498,0.00005636423,0.00000219787,0.00004440391,0.0003500555],"genre_scores_gemma":[0.4909168,0.00002629075,0.5089204,0.0000986127,0.00002226107,9.154376e-7,1.518179e-7,0.000003917524,0.00001064211],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3533154,"threshold_uncertainty_score":0.2679713,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2408559501","doi":"10.1515/jmc-2015-0042","title":"Linear approaches to resilient aggregation in sensor networks","year":2015,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":7,"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":"Wireless sensor network; Computer science; Computer network; Network topology; Base station; Aggregate (composite); Protocol (science); Node (physics); Key distribution in wireless sensor networks; Distributed computing; Topology (electrical circuits); Wireless network; Wireless; Telecommunications; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1205386107623073,"gpt":0.2851397040136409,"spread":0.1646010932513336,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001350991,0.0001413664,0.0004662578,0.0002611778,0.00002281476,0.00004773293,0.0007089064,0.0001794636,0.000004803609],"category_scores_gemma":[0.0008375871,0.0001143181,0.00008476316,0.0004590256,0.0000373418,0.000209454,0.0001735001,0.0004525803,0.00006121861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001067307,"about_ca_system_score_gemma":0.00007361963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000128394,"about_ca_topic_score_gemma":0.000004113659,"domain_scores_codex":[0.9979757,0.0002805445,0.0007940444,0.0001953009,0.0004087099,0.000345696],"domain_scores_gemma":[0.9985148,0.0003459379,0.0003039602,0.0003484104,0.0001690311,0.0003178802],"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.0002570217,0.0009237685,0.001215757,0.00006874857,0.00006637244,0.0007441301,0.00775073,0.3709718,0.00004409146,0.591774,0.008010593,0.0181729],"study_design_scores_gemma":[0.00105247,0.0005882783,0.0003758908,0.0001725104,0.00001441368,0.001520714,0.0006641596,0.8748811,0.0002803291,0.1195528,0.0006539592,0.0002433898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1374112,0.0001851458,0.8536766,0.007569248,0.0004612819,0.000147402,1.3661e-7,0.00002464798,0.0005243215],"genre_scores_gemma":[0.6004654,0.000007755537,0.3988969,0.0003125027,0.0002927157,0.000003392119,2.238988e-7,0.000009809284,0.0000113403],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5039092,"threshold_uncertainty_score":0.4661757,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3081150612","doi":"10.1515/jmc-2019-0033","title":"New Zémor-Tillich Type Hash Functions Over GL <sub>2</sub> (𝔽 <sub> <i>p</i> <sup> <i>n</i> </sup> </sub> )","year":2020,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"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":"Hash function; Mathematics; Lemma (botany); Discrete mathematics; Type (biology); Combinatorics; Hash chain; Class (philosophy); Group (periodic table); Set (abstract data type); Computer science; Physics; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.0189422532487328,"gpt":0.2340439368169824,"spread":0.2151016835682496,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008619595,0.0004487402,0.0009886441,0.0003081539,0.0002380433,0.0002234077,0.001521157,0.0003275755,0.0001316582],"category_scores_gemma":[0.000778042,0.0003804053,0.0006073695,0.001369913,0.0001518267,0.0007067247,0.0004522373,0.001042399,0.0007361086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005245656,"about_ca_system_score_gemma":0.0003482474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.090407e-7,"about_ca_topic_score_gemma":0.000001173303,"domain_scores_codex":[0.9963421,0.0003659377,0.001274107,0.0005407712,0.0007416282,0.0007354994],"domain_scores_gemma":[0.9967338,0.0007166691,0.0006289967,0.0006720133,0.0003687414,0.0008798096],"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.0006537628,0.0008717635,0.0003899443,0.0002974993,0.0006410152,0.0006069684,0.003211251,0.0007744764,0.2350111,0.5577875,0.1513033,0.04845137],"study_design_scores_gemma":[0.004566458,0.004215458,0.0004105621,0.0003965405,0.0006044325,0.004024712,0.0005708436,0.01654892,0.1644047,0.778021,0.02467651,0.001559808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3322114,0.0002898646,0.6574125,0.008097947,0.0005526338,0.0001732214,0.000003804202,0.0001552658,0.001103337],"genre_scores_gemma":[0.9561553,0.0001133222,0.03743077,0.00508455,0.001129933,0.000007344858,0.000002423104,0.00005959989,0.00001672528],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6239439,"threshold_uncertainty_score":0.9998648,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114535050","doi":"10.1515/jmc.2010.007","title":"On the asymptotic effectiveness of Weil descent attacks","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"University of Waterloo; National Science Foundation","keywords":"Descent (aeronautics); Generalization; Mathematics; Discrete logarithm; Logarithm; Genus; Gradient descent; Pure mathematics; Discrete mathematics; Applied mathematics; Combinatorics; Mathematical analysis; Computer science; Public-key cryptography; Artificial intelligence; Artificial neural network; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.009872256274622604,"gpt":0.2513074244030055,"spread":0.2414351681283829,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001818918,0.0001200109,0.000392144,0.0001581188,0.00006559825,0.00003081694,0.0009370522,0.0001118665,0.00004604566],"category_scores_gemma":[0.0009050745,0.00006286414,0.0002396648,0.0002567887,0.0001703442,0.00009100475,0.0001047863,0.0005841401,0.00002820547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009768285,"about_ca_system_score_gemma":0.00006589468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.709352e-7,"about_ca_topic_score_gemma":6.32019e-7,"domain_scores_codex":[0.998485,0.0003623669,0.000480034,0.0001232074,0.0003426755,0.0002067175],"domain_scores_gemma":[0.9960027,0.002969175,0.0003296362,0.0004130186,0.0001907238,0.00009479314],"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.00004318809,0.0003648191,0.0002623876,0.00009636764,0.00005914746,0.00003112986,0.0001383612,0.00001658259,0.008626561,0.9891953,0.0001562842,0.001009834],"study_design_scores_gemma":[0.0006335423,0.0007225015,0.009976446,0.0002013892,0.00004059653,0.0009162946,0.00004598451,0.001171044,0.01995547,0.9661415,0.00008109597,0.0001141887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6675806,0.00003409919,0.3289383,0.001942583,0.0005211162,0.000120653,3.029009e-7,0.00001008271,0.0008522503],"genre_scores_gemma":[0.9745952,0.000004505158,0.02524746,0.00009528351,0.00004645283,0.000002980906,3.867659e-8,0.000005953957,0.000002107551],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3070146,"threshold_uncertainty_score":0.2563525,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023005004","doi":"10.1515/jmc.2009.021","title":"An efficient identification protocol secure against concurrent-reset attacks","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"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":"Reset (finance); Computer science; Identification (biology); Protocol (science); Simple (philosophy); Cryptographic protocol; Computer security; Theoretical computer science; Cryptography; Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.01681584144669115,"gpt":0.3360632588257027,"spread":0.3192474173790115,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001096334,0.0001741744,0.0004025313,0.0002404028,0.0001063081,0.0001848667,0.001298902,0.0001425963,0.00003097638],"category_scores_gemma":[0.0002395702,0.00013215,0.0001836957,0.0003619183,0.00007028955,0.0005175514,0.00007207611,0.0004077421,0.00004820833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002983863,"about_ca_system_score_gemma":0.00008038004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.444077e-7,"about_ca_topic_score_gemma":3.879574e-7,"domain_scores_codex":[0.9977298,0.0002395468,0.0009542609,0.0002623564,0.0004984522,0.0003155967],"domain_scores_gemma":[0.9980857,0.0001132767,0.0006326697,0.0005917173,0.0003161658,0.000260497],"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.00004408315,0.001504799,0.00004205913,0.00006773228,0.00002230366,0.00007125477,0.0009055814,0.0001420168,0.002336982,0.9753726,0.002296087,0.0171945],"study_design_scores_gemma":[0.003142465,0.002396944,0.002576404,0.0002130984,0.0000523623,0.001173786,0.0003849707,0.1027813,0.004338589,0.8758895,0.006465905,0.0005846058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02878214,0.00001883782,0.96452,0.001446252,0.0002435807,0.004479948,0.000006329007,0.00005291589,0.0004500055],"genre_scores_gemma":[0.9301125,0.000002431631,0.06884186,0.000394576,0.00018995,0.0004456081,0.000004789956,0.000007386163,9.32324e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9013304,"threshold_uncertainty_score":0.5388922,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119589927","doi":"10.1515/jmc.2007.016","title":"Statistical distribution and collisions of VSH","year":2007,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Collision; Hash function; Mathematics; Collision attack; Distribution (mathematics); Work (physics); Statistical physics; Computer science; Physics; Mathematical analysis; Thermodynamics; Cryptographic hash function; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.01422313058258052,"gpt":0.2898918531890217,"spread":0.2756687226064412,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001352753,0.00008880138,0.0003397868,0.0001069438,0.0000397023,0.00002224855,0.0002684359,0.00008506453,0.00002878088],"category_scores_gemma":[0.001207429,0.0000685396,0.00006014208,0.0001864912,0.0001261319,0.0002063287,0.00009205098,0.0002130493,0.00001116878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004469035,"about_ca_system_score_gemma":0.00007069609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.838939e-7,"about_ca_topic_score_gemma":6.932215e-7,"domain_scores_codex":[0.9985831,0.00006539014,0.0007193669,0.0001109729,0.0003208898,0.0002002719],"domain_scores_gemma":[0.9980265,0.001028873,0.0003580679,0.0001561174,0.0002640027,0.0001664628],"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.00006043042,0.000216693,0.0002719695,0.00005839138,0.0000201568,0.0001049735,0.0001456598,0.000008285015,0.006329886,0.9872896,0.0008696319,0.004624292],"study_design_scores_gemma":[0.001685084,0.001552493,0.02108808,0.0001734747,0.00008455779,0.003549624,0.0002570713,0.01567956,0.01916264,0.935926,0.0005982777,0.0002431512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1359715,0.00004576895,0.8627424,0.000907673,0.0001104344,0.00005238432,0.000006353692,0.000009397744,0.0001540803],"genre_scores_gemma":[0.7632406,0.000007872379,0.2366541,0.0000484497,0.00004075112,4.04663e-7,0.000001127841,0.000003499722,0.000003207908],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.627269,"threshold_uncertainty_score":0.2794964,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2562444902","doi":"10.1515/jmc-2016-0002","title":"Unconditionally secure signature schemes revisited","year":2016,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"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; Digital signature; Key (lock); Computer security; Public-key cryptography; Signature (topology); Robustness (evolution); Theoretical computer science; Public key infrastructure; Scheme (mathematics); Context (archaeology); Extension (predicate logic); Algorithm; Mathematics; Programming language; Encryption","retraction":null,"screen_n_in":null,"score":{"opus":0.01063959411535506,"gpt":0.2518685554776877,"spread":0.2412289613623327,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005730817,0.0001384544,0.0003806142,0.0001973164,0.00005588263,0.00004842496,0.0009510654,0.0001665154,0.0002814883],"category_scores_gemma":[0.0006471693,0.00007656834,0.0001801057,0.0002825846,0.00007891897,0.0006220437,0.0001587283,0.0002646757,0.00008897304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002195006,"about_ca_system_score_gemma":0.00008247386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.848789e-8,"about_ca_topic_score_gemma":2.39671e-7,"domain_scores_codex":[0.9985061,0.0001243228,0.0005687954,0.0001793612,0.0003815008,0.0002399304],"domain_scores_gemma":[0.9982869,0.0004888403,0.0003801273,0.0003615023,0.0003143715,0.0001682639],"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.0000200302,0.0001296462,0.0001264025,0.00003269206,0.00005053329,0.00009455434,0.0000776841,1.498263e-7,0.003789798,0.9802401,0.01353357,0.00190485],"study_design_scores_gemma":[0.0006328703,0.000251637,0.0004739671,0.0001625982,0.00002031501,0.001078147,0.0000187304,0.00004315711,0.0011003,0.9827393,0.01334808,0.0001309198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01458011,0.0003693917,0.9733821,0.01052665,0.0002069676,0.0000620631,0.00001258795,0.00003948928,0.0008206977],"genre_scores_gemma":[0.6525841,0.00005945268,0.346303,0.0007643843,0.0002657011,0.000002335983,0.000001698551,0.00000923455,0.00001003058],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.638004,"threshold_uncertainty_score":0.3122366,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2026017982","doi":"10.1515/jmc-2013-5006","title":"Unconditionally-secure ideal robust secret sharing schemes for threshold and multilevel access structure","year":2013,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Secret sharing; Secrecy; Verifiable secret sharing; Access structure; Secure multi-party computation; Homomorphic secret sharing; Scheme (mathematics); Computer science; Property (philosophy); Robustness (evolution); Shamir's Secret Sharing; Mathematics; Set (abstract data type); Theoretical computer science; Cryptography; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.03649148341082455,"gpt":0.2945608209996092,"spread":0.2580693375887846,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003172287,0.0001751192,0.0004233353,0.000178202,0.0001192022,0.0003181178,0.001093909,0.0001713791,0.0001742435],"category_scores_gemma":[0.000268658,0.0001293508,0.0001366611,0.0001173789,0.00008823586,0.001340732,0.0004043877,0.0003480736,0.000004703931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001538461,"about_ca_system_score_gemma":0.00004786937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001879278,"about_ca_topic_score_gemma":0.000003381362,"domain_scores_codex":[0.9985776,0.00002870805,0.0005742785,0.000257219,0.0002660906,0.000296136],"domain_scores_gemma":[0.9985389,0.0003409917,0.0003516928,0.0002813638,0.0002863113,0.0002007919],"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.00001818445,0.00007820271,0.001123248,0.0001690534,0.00007226631,0.00001257038,0.0002457731,0.00002136793,0.0003789597,0.9928424,0.003860749,0.001177278],"study_design_scores_gemma":[0.0007287971,0.000119515,0.00327527,0.00006346892,0.00002400148,0.0005322049,0.00006229177,0.02231745,0.0003212553,0.971854,0.0005494431,0.0001523178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2390333,0.0001566096,0.7585019,0.001810721,0.0001690077,0.0002027225,0.00002831395,0.00002055572,0.00007681845],"genre_scores_gemma":[0.6375954,0.00001098807,0.3618807,0.0003376993,0.0001485822,0.00001062452,0.000005852065,0.000008566427,0.000001531917],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3985622,"threshold_uncertainty_score":0.5274773,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070823145","doi":"10.1515/jmc.2011.007","title":"Compact elliptic curve representations","year":2011,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Elliptic curve; Isomorphism (crystallography); Prime (order theory); Upper and lower bounds; Combinatorics; Reduction (mathematics); Discrete mathematics; Jacobian curve; Pure mathematics; Schoof's algorithm; Mathematical analysis; Quarter period; Geometry; Crystallography; Chemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.04824862023982155,"gpt":0.2888926973347993,"spread":0.2406440770949778,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004813477,0.0001054321,0.0003319742,0.0002454586,0.0000648941,0.00003507932,0.0007562562,0.00007496509,0.0001359643],"category_scores_gemma":[0.000241533,0.00007425329,0.0002152852,0.0003165215,0.00009138113,0.0002908336,0.00006877343,0.0002592023,0.0001082766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001161878,"about_ca_system_score_gemma":0.00005182288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002430267,"about_ca_topic_score_gemma":6.966063e-7,"domain_scores_codex":[0.9986644,0.0001519691,0.0005822507,0.0001289087,0.0002454977,0.0002269214],"domain_scores_gemma":[0.9987313,0.0002671794,0.0003244542,0.0003448194,0.0001716317,0.0001606317],"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.00001669523,0.0004035966,0.001602222,0.0000274312,0.00008536689,0.000191054,0.001823246,0.000007719771,0.0002648685,0.9931377,0.001538398,0.0009017392],"study_design_scores_gemma":[0.0004968486,0.0004093578,0.01437515,0.00004654952,0.00005114342,0.002565488,0.0003314174,0.001508073,0.001825588,0.9779579,0.000289713,0.0001427768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04755655,0.0002026153,0.9380398,0.001669095,0.000369849,0.00007651135,4.128686e-7,0.00003317843,0.01205196],"genre_scores_gemma":[0.772788,0.0000190144,0.227006,0.000104902,0.0000567687,8.684342e-7,9.063172e-8,0.000005581153,0.00001878191],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7252314,"threshold_uncertainty_score":0.3027961,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4404803098","doi":"10.1515/jmc-2023-0012","title":"Revocable policy-based chameleon hash using lattices","year":2024,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; National Research Council Canada","funders":"University of Waterloo; Impact Fund; Silicon Valley Community Foundation","keywords":"Hash function; Computer science; Computer security; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03226791542826929,"gpt":0.3214974984068498,"spread":0.2892295829785805,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008898104,0.000143913,0.0003954319,0.000501478,0.00007259834,0.0002312976,0.0007544266,0.0001209715,0.00005662397],"category_scores_gemma":[0.0003219615,0.0001072023,0.0002314933,0.0006720956,0.00007719867,0.0005889905,0.0001255783,0.0003683932,0.00005186462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004550331,"about_ca_system_score_gemma":0.0003451306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004659855,"about_ca_topic_score_gemma":0.000001589449,"domain_scores_codex":[0.9984501,0.0001237092,0.000586111,0.0001978953,0.0003326101,0.0003095975],"domain_scores_gemma":[0.9987666,0.0004089384,0.0001989852,0.0003448753,0.000118295,0.0001622761],"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.00001289324,0.0001350639,0.00005243487,0.0002825405,0.00005001985,0.0002390472,0.0003149524,0.00005200638,0.0008576502,0.9946287,0.001453315,0.001921364],"study_design_scores_gemma":[0.0003275633,0.0002725595,0.00005468359,0.0003991546,0.00005303845,0.001732696,0.00007626299,0.1322916,0.001052472,0.8567688,0.006786556,0.0001846237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02637152,0.0008909206,0.9645659,0.006932703,0.0004485559,0.00006127245,0.00000352185,0.00006700846,0.0006586307],"genre_scores_gemma":[0.4891352,0.00002214545,0.5100257,0.0004322242,0.0003666334,0.000001350521,5.499626e-7,0.0000118586,0.000004326434],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4627637,"threshold_uncertainty_score":0.4371582,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065483996","doi":"10.1515/jmc.2009.016","title":"On the density of some special primes","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Computer science; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.0160479035626701,"gpt":0.2496530297266319,"spread":0.2336051261639618,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009002091,0.00008780164,0.0003127718,0.0001150977,0.00005652086,0.00002356971,0.000776702,0.00006020945,0.00006080774],"category_scores_gemma":[0.0004742116,0.00004928091,0.0002025184,0.0001617859,0.00007821501,0.0001324693,0.00005498197,0.0002441947,0.000023916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009518072,"about_ca_system_score_gemma":0.00003742625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.582167e-8,"about_ca_topic_score_gemma":5.775954e-8,"domain_scores_codex":[0.9989043,0.0001709056,0.000422954,0.00008668775,0.000262292,0.0001528124],"domain_scores_gemma":[0.9985381,0.0006871867,0.0003249425,0.0002881458,0.0001013478,0.00006021192],"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.00004961172,0.0001982302,0.00002352816,0.000005763326,0.00001971815,0.0000218921,0.0002677389,0.000002679081,0.0006432534,0.9937172,0.001934072,0.003116291],"study_design_scores_gemma":[0.0001749023,0.0006768728,0.001132941,0.0000350527,0.00001267038,0.0002235384,0.00003531293,0.0001152676,0.004049796,0.9933542,0.0001389448,0.00005048348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6795543,0.0000454742,0.2991902,0.01489822,0.0004213503,0.00008204956,2.705314e-7,0.00001753544,0.005790622],"genre_scores_gemma":[0.9800821,0.000005038035,0.01874292,0.0008279699,0.0003319143,2.673898e-7,1.887732e-8,0.000002290283,0.000007511631],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3005278,"threshold_uncertainty_score":0.2009617,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4320925590","doi":"10.1515/jmc-2022-0010","title":"Plactic key agreement (insecure?)","year":2023,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Blackberry (Canada)","funders":"","keywords":"Key (lock); Public-key cryptography; Computer science; Division (mathematics); Byte; Cryptography; Theoretical computer science; Computer security; Arithmetic; Mathematics; Encryption; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02542509089501993,"gpt":0.279011769400209,"spread":0.2535866785051891,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001042124,0.0001266097,0.0003671954,0.0003403859,0.00007206967,0.00007215199,0.0009443369,0.00009573161,0.0001155619],"category_scores_gemma":[0.000448394,0.00009503229,0.000195509,0.0006387497,0.00005057135,0.0003848827,0.0002492289,0.0003109541,0.0005839485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002145004,"about_ca_system_score_gemma":0.000065972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.148007e-7,"about_ca_topic_score_gemma":0.000002020658,"domain_scores_codex":[0.9983351,0.0001228199,0.0006157274,0.0001633441,0.0004356573,0.0003273105],"domain_scores_gemma":[0.9985914,0.0003867591,0.0003136985,0.0003946865,0.0001320241,0.000181406],"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.00002038701,0.00017483,0.0001139564,0.00005997085,0.0000536045,0.0003013645,0.0008789828,0.000007718216,0.0002853504,0.9771434,0.0193683,0.001592139],"study_design_scores_gemma":[0.0006011711,0.0003731262,0.001101801,0.00005091496,0.00002697188,0.001078162,0.0002527048,0.003288666,0.0003268446,0.9844335,0.008315172,0.0001509655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0673364,0.0001338642,0.9211007,0.007677382,0.0007618394,0.0001032175,0.000003162768,0.00009962881,0.002783777],"genre_scores_gemma":[0.8320779,0.00008723357,0.167078,0.0004960283,0.00022869,0.00000500231,0.000001702609,0.00001116182,0.00001431399],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7647414,"threshold_uncertainty_score":0.7505672,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4405324345","doi":"10.1515/jmc-2024-0010","title":"Revisiting linearly extended discrete functions","year":2024,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algebra over a field; Computer science; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01718184929774834,"gpt":0.2836623500587121,"spread":0.2664805007609637,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001050671,0.0001125444,0.0002928156,0.0002598861,0.0000811112,0.000207703,0.0005232118,0.00007322474,0.0001001415],"category_scores_gemma":[0.0003270662,0.00007931113,0.0002846007,0.000423976,0.00004955216,0.00041458,0.0001113684,0.0003977742,0.0001607874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001734474,"about_ca_system_score_gemma":0.00006102123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.041475e-7,"about_ca_topic_score_gemma":5.506834e-8,"domain_scores_codex":[0.998714,0.0001421248,0.0005407755,0.0001607318,0.0002256586,0.0002167047],"domain_scores_gemma":[0.9988762,0.0005114658,0.0001372963,0.0002487631,0.0001072302,0.0001190836],"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.00001049938,0.0000320469,0.00001106917,0.00008518669,0.00006322483,0.0001869817,0.0002902811,0.000005338819,0.0005031667,0.9724413,0.0008680485,0.02550283],"study_design_scores_gemma":[0.0001584897,0.0002903633,0.0001066208,0.0003266239,0.00005979824,0.002689349,0.0001591672,0.0102526,0.0001693093,0.9785846,0.007070594,0.0001324956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008500132,0.0008307436,0.9804484,0.005991729,0.0006982708,0.00003945354,7.327483e-7,0.0000959145,0.003394622],"genre_scores_gemma":[0.8532384,0.00002124246,0.1458527,0.0001728995,0.0005877817,0.000002692081,2.356583e-7,0.00001207496,0.0001119189],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8447383,"threshold_uncertainty_score":0.3234214,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2979943645","doi":"10.1515/jmc-2018-0039","title":"Privacy-preserving verifiable delegation of polynomial and matrix functions","year":2019,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"National Natural Science Foundation of China","keywords":"Computer science; Verifiable secret sharing; Theoretical computer science; Delegation; Homomorphic encryption; Security parameter; Outsourcing; Functional encryption; Secure multi-party computation; Boolean circuit; Encryption; Cryptography; Boolean function; Computer security; Ciphertext; Algorithm; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.009955474349203255,"gpt":0.2534273374824649,"spread":0.2434718631332616,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004892157,0.00008036567,0.000315379,0.0001727479,0.00003710366,0.00004079769,0.0005091442,0.0000826675,0.00009141181],"category_scores_gemma":[0.0002547165,0.00006436867,0.00009141199,0.0002016364,0.00004025559,0.0005677425,0.0002635829,0.0001832745,0.00001725911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001064249,"about_ca_system_score_gemma":0.00005431664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004195228,"about_ca_topic_score_gemma":9.357419e-7,"domain_scores_codex":[0.998969,0.00007242896,0.0004910299,0.0001178185,0.000199157,0.0001505673],"domain_scores_gemma":[0.9988782,0.0002403369,0.000337816,0.0003292398,0.0001302603,0.00008413006],"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.0001478806,0.000405801,0.005059743,0.0004141903,0.000121685,0.00001743879,0.001375755,0.00005613816,0.009761756,0.9725208,0.007908535,0.002210272],"study_design_scores_gemma":[0.00349758,0.001889103,0.009410189,0.0003051151,0.0001372783,0.002177001,0.001160391,0.04255714,0.00551196,0.9243332,0.00855409,0.0004669884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4954093,0.0001386105,0.5029758,0.0007563891,0.0002260216,0.00006548196,0.000003381663,0.000009359292,0.0004157084],"genre_scores_gemma":[0.7975557,0.00001752115,0.2023322,0.00003092276,0.00005100554,8.124882e-7,8.750608e-7,0.00000390379,0.000007007671],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3021464,"threshold_uncertainty_score":0.2624878,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071803996","doi":"10.1515/jmc-2013-0034","title":"Is extracting data the same as possessing data?","year":2014,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":1,"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":"Mathematics; Combinatorics; Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.1212380830603228,"gpt":0.3780973235038994,"spread":0.2568592404435766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.003293848,0.0001235427,0.0003435986,0.00007761362,0.0002195444,0.0002766911,0.007005993,0.00008768561,0.00007252261],"category_scores_gemma":[0.006060113,0.00007884518,0.00005631039,0.0002148788,0.0001109448,0.001397458,0.002869837,0.0005789208,0.0002089012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000222079,"about_ca_system_score_gemma":0.0001486215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007087237,"about_ca_topic_score_gemma":0.000006409805,"domain_scores_codex":[0.9979181,0.0003011734,0.0007126356,0.0003125263,0.000452184,0.0003033318],"domain_scores_gemma":[0.9939872,0.001933948,0.0005822455,0.00322678,0.0001398379,0.000129986],"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.000009922062,0.0002817319,0.00008648322,0.0000537833,0.00008995153,0.00006767964,0.001440677,0.000005434805,0.0003942036,0.9156448,0.05992435,0.02200102],"study_design_scores_gemma":[0.0004452524,0.0001433034,0.0002540532,0.000133433,0.00009931848,0.008788299,0.0005506322,0.2655849,0.0001335691,0.669622,0.05403665,0.0002086441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009997687,0.0001450097,0.934527,0.05359817,0.0004466652,0.00006217213,0.00001744838,0.00002693275,0.001178961],"genre_scores_gemma":[0.4342252,0.00002151677,0.5616235,0.003406012,0.0006717395,8.379655e-7,0.00001266307,0.00001600628,0.00002246341],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4242275,"threshold_uncertainty_score":0.9983666,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064998746","doi":"10.1515/jmc-2012-0002","title":"Finding discrete logarithms with a set orbit distinguisher","year":2012,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Logarithm; Orbit (dynamics); Set (abstract data type); Discrete logarithm; Mathematics; Arithmetic; Computer science; Mathematical analysis; Computer security; Programming language; Public-key cryptography","retraction":null,"screen_n_in":null,"score":{"opus":0.02869037447552344,"gpt":0.2826695385318816,"spread":0.2539791640563581,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001094888,0.0001506103,0.0003842618,0.0001625897,0.00009456664,0.00007232847,0.0006563893,0.00008255651,0.00007780689],"category_scores_gemma":[0.0003391745,0.00009449262,0.0001414028,0.0002896103,0.00008975787,0.0004525917,0.0001442537,0.0003345122,0.00004187378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002161825,"about_ca_system_score_gemma":0.00003467471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.913178e-7,"about_ca_topic_score_gemma":3.110534e-7,"domain_scores_codex":[0.9985757,0.0001545005,0.000434283,0.0001232814,0.000293762,0.0004184933],"domain_scores_gemma":[0.998642,0.0003857128,0.0003499869,0.0002852169,0.0001083951,0.0002286443],"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.00005106285,0.0001563535,0.004324383,0.0000463069,0.00008136356,0.0000848954,0.001539943,0.000004535446,0.0001041821,0.9914035,0.000699827,0.001503606],"study_design_scores_gemma":[0.001461674,0.001379716,0.004233176,0.0003521354,0.0001611765,0.01018944,0.0008102332,0.001435651,0.0007647394,0.9729682,0.005676913,0.000566905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1014103,0.0001131625,0.8921571,0.001235552,0.0003341786,0.0000576136,6.417499e-7,0.00003766132,0.004653807],"genre_scores_gemma":[0.8235387,0.000001849514,0.1760779,0.0001419546,0.0002054243,0.000002109285,1.654392e-7,0.000009093455,0.00002279633],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7221284,"threshold_uncertainty_score":0.3853297,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2295167940","doi":"10.1515/jmc-2018-0012","title":"Multi-prover proof of retrievability","year":2018,"lang":"en","type":"preprint","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"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":"Server; Computer science; Gas meter prover; Cryptography; Theoretical computer science; Retrievability; Scheme (mathematics); Protocol (science); Confidentiality; Discrete mathematics; Algorithm; Computer security; Mathematics; Mathematical proof; Computer network; Information retrieval","retraction":null,"screen_n_in":null,"score":{"opus":0.03915340734756542,"gpt":0.3104437271759212,"spread":0.2712903198283558,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002218481,0.0002845469,0.001221164,0.0003003533,0.00004147548,0.00006134636,0.002399079,0.000560845,0.00008890754],"category_scores_gemma":[0.002082991,0.0002142476,0.0005862454,0.0002818546,0.0003371816,0.0002627667,0.001813072,0.001130874,0.00001376258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004681165,"about_ca_system_score_gemma":0.0003437487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002041493,"about_ca_topic_score_gemma":0.000002393072,"domain_scores_codex":[0.9966505,0.0003296739,0.00169938,0.0004065701,0.000595681,0.0003182379],"domain_scores_gemma":[0.9953213,0.0004169358,0.00185385,0.001304517,0.0009062568,0.0001971888],"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.0005498419,0.007449652,0.002626715,0.006988311,0.001025322,0.0002481323,0.004860306,0.00003206728,0.001765041,0.9519231,0.01404936,0.008482195],"study_design_scores_gemma":[0.0006808641,0.0006042341,0.001164671,0.0003432503,0.00009192085,0.0003178118,0.00005209745,0.006556402,0.004820596,0.9846854,0.0004262706,0.0002565037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06008916,0.0002705938,0.9370512,0.0008966445,0.001031286,0.0002807088,0.00002484573,0.00002288526,0.0003326875],"genre_scores_gemma":[0.2986345,0.00001663289,0.7010592,0.00006316578,0.0002080904,0.000004129603,0.00000175888,0.00001058661,0.000001905491],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2385453,"threshold_uncertainty_score":0.8736763,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018752355","doi":"10.1515/jmc-2014-0031","title":"Optimal constructions for ID-based one-way-function key predistribution schemesrealizing specified communication graphs","year":2014,"lang":"en","type":"preprint","venue":"Journal of Mathematical Cryptology","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":0,"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; Hash function; Key (lock); Pairwise comparison; Scheme (mathematics); Cryptography; Theoretical computer science; Graph; Function (biology); Computer network; Distributed computing; Computer security; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03865162738862765,"gpt":0.286290799396298,"spread":0.2476391720076703,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001573551,0.0003556122,0.00104548,0.0003747451,0.0002464599,0.0002395046,0.001609248,0.0007947361,0.00002732394],"category_scores_gemma":[0.0008468048,0.0003497119,0.0005014093,0.0002146272,0.0002439872,0.0002416146,0.0004756731,0.001487804,0.00001274794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002141793,"about_ca_system_score_gemma":0.0002469125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002459959,"about_ca_topic_score_gemma":0.000002252727,"domain_scores_codex":[0.9965063,0.0004977837,0.001608794,0.0004112737,0.0005378385,0.0004380124],"domain_scores_gemma":[0.9941637,0.001339109,0.002082788,0.001170952,0.001038049,0.000205382],"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.0001975528,0.0003770724,0.00002280102,0.0004423124,0.0002463672,0.000004528789,0.0002071964,0.0160389,0.0002144587,0.9777302,0.002944039,0.001574628],"study_design_scores_gemma":[0.001209415,0.0003725478,0.00009937928,0.0006102097,0.0002588503,0.0002942768,0.0001096784,0.3540162,0.0008511621,0.6408966,0.000950121,0.0003315023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02661763,0.0002566598,0.9670937,0.003606204,0.001442314,0.0005303946,0.00002387604,0.000114603,0.0003146169],"genre_scores_gemma":[0.4945532,0.00004092983,0.504878,0.000107905,0.0003021571,0.00003761586,0.00005759594,0.00002086473,0.000001707462],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4679356,"threshold_uncertainty_score":0.9998955,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092202686","doi":"10.1515/jmc.2009.008","title":"Another look at some fast modular arithmetic methods","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"Arithmetic; Modular arithmetic; Modular design; Computer science; Algebra over a field; Saturation arithmetic; Mathematics; Programming language; Arbitrary-precision arithmetic; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01735023518713309,"gpt":0.3037783712800312,"spread":0.2864281360928981,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001210031,0.0002110955,0.0006529444,0.0003726829,0.0001080141,0.00007414637,0.001026131,0.0001815854,0.00008301773],"category_scores_gemma":[0.0002671207,0.0001486442,0.000368042,0.0003647608,0.0001079744,0.0003660423,0.0001504469,0.0003811227,0.00008512928],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004780332,"about_ca_system_score_gemma":0.00005488392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.134089e-7,"about_ca_topic_score_gemma":2.058797e-7,"domain_scores_codex":[0.9977664,0.0003703795,0.0007979468,0.0002473664,0.0003964831,0.0004214613],"domain_scores_gemma":[0.9983754,0.0003621707,0.0004117822,0.0005016091,0.0001552403,0.0001938092],"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.00003226639,0.0006493285,0.00007070025,0.00005123771,0.0001268029,0.0003072943,0.0006879034,0.00009165205,0.01520826,0.9290536,0.001454364,0.05226658],"study_design_scores_gemma":[0.0007358412,0.0007093077,0.001590832,0.00005940992,0.00005827236,0.003042616,0.00005245915,0.006398412,0.005984731,0.9796582,0.001485738,0.0002241104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02298271,0.0009314331,0.9663944,0.00801603,0.0003205993,0.00009777967,3.992726e-7,0.00004283193,0.001213816],"genre_scores_gemma":[0.1604981,0.00004663749,0.8377877,0.001408527,0.0001654876,0.00000170987,1.299967e-7,0.00001168951,0.00008001089],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1375154,"threshold_uncertainty_score":0.6061532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2979325266","doi":"10.1515/jmc-2019-0048","title":"On the equivalence of authentication codes and robust (2, 2)-threshold schemes","year":2020,"lang":"en","type":"preprint","venue":"Journal of Mathematical Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"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; London Mathematical Society","keywords":"Equivalence (formal languages); Authentication (law); Computer science; Secret sharing; Theoretical computer science; Mathematics; Discrete mathematics; Computer security; Cryptography","retraction":null,"screen_n_in":null,"score":{"opus":0.06202159025001362,"gpt":0.2836574490103651,"spread":0.2216358587603515,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00126221,0.0001915917,0.000592821,0.0001583431,0.00006299785,0.00008021621,0.001425856,0.0001793551,0.00003339847],"category_scores_gemma":[0.0008725004,0.0001190197,0.0002317443,0.0001657962,0.000243131,0.00008570003,0.0008118027,0.0007794233,0.00000747938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001295999,"about_ca_system_score_gemma":0.00008419184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.993816e-7,"about_ca_topic_score_gemma":9.911223e-8,"domain_scores_codex":[0.9982426,0.0002314086,0.0007325496,0.0002423084,0.000378238,0.0001729352],"domain_scores_gemma":[0.9970617,0.00122763,0.0008806216,0.0005295938,0.0001958147,0.0001046511],"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.00004111545,0.0001169289,0.00002001608,0.0002724208,0.00009292867,0.00001193095,0.0006653564,0.00005887638,0.0006338882,0.9969357,0.0005948814,0.0005559045],"study_design_scores_gemma":[0.0001461521,0.0002884971,0.00008478449,0.0004328543,0.00006666521,0.0001089579,0.00009373292,0.01053038,0.001243926,0.9868411,0.00005534572,0.0001075369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1200235,0.000359978,0.851594,0.02707407,0.000271391,0.000163316,0.000003103943,0.00002492753,0.000485716],"genre_scores_gemma":[0.9258237,0.00007026162,0.07355598,0.000463608,0.00006830873,0.0000054324,2.970128e-7,0.000008662437,0.00000376421],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8058002,"threshold_uncertainty_score":0.4853483,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4392878815","doi":"10.1515/jmc-2022-0029","title":"The dihedral hidden subgroup problem","year":2024,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"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; Universities Space Research Association","keywords":"Dihedral group; Coset; Quantum algorithm; Mathematics; Dihedral angle; Discrete mathematics; Quantum; Algorithm; Pure mathematics; Group (periodic table); Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.01215892878859508,"gpt":0.2651285732825296,"spread":0.2529696444939346,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001182228,0.0001166993,0.0002536932,0.0001208614,0.0001289996,0.0003786848,0.001176153,0.00008354484,0.00002686625],"category_scores_gemma":[0.0001784683,0.00006234805,0.0002261137,0.00034657,0.0001041314,0.0004905431,0.0002140769,0.0004410763,0.0001048987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002025589,"about_ca_system_score_gemma":0.00009221123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.802695e-7,"about_ca_topic_score_gemma":0.000001968685,"domain_scores_codex":[0.9985169,0.0001296362,0.000577418,0.000153775,0.0003346889,0.0002876236],"domain_scores_gemma":[0.9985163,0.0007799987,0.000141525,0.0003428596,0.00009650146,0.000122788],"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.000009532395,0.00005562973,0.00002075915,0.00005641044,0.00005014697,0.0001506078,0.0004160448,3.374633e-7,0.0001001203,0.9757548,0.009010905,0.01437471],"study_design_scores_gemma":[0.000123684,0.0001785791,0.00008972273,0.00006679125,0.0000207193,0.001796423,0.00009389564,0.002170323,0.0001002584,0.9709809,0.0242985,0.00008024236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01032019,0.002336203,0.9676427,0.01598973,0.0009152377,0.00009860144,0.000001975965,0.00007635137,0.002618992],"genre_scores_gemma":[0.6406617,0.000195806,0.3583683,0.0002508554,0.0004741068,0.000007738254,5.886178e-7,0.00001528201,0.00002563133],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6303415,"threshold_uncertainty_score":0.3651666,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4226062551","doi":"10.1515/jmc-2022-0002","title":"A code-based hybrid signcryption scheme","year":2023,"lang":"en","type":"preprint","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"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":"Impact Fund; Silicon Valley Community Foundation","keywords":"Signcryption; Key encapsulation; Ciphertext; Computer science; Code (set theory); Encryption; McEliece cryptosystem; Theoretical computer science; Ciphertext indistinguishability; Scheme (mathematics); Signature (topology); Public-key cryptography; Hybrid cryptosystem; Mathematics; Symmetric-key algorithm; Computer network; Malleability; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.05729437724278092,"gpt":0.3073742563585063,"spread":0.2500798791157254,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001804611,0.0003617652,0.001059953,0.0006610954,0.0000836213,0.0002220276,0.002366894,0.0003980546,0.00005958336],"category_scores_gemma":[0.0009248247,0.0003026069,0.000677967,0.0003327019,0.0001187853,0.0002710805,0.001157052,0.001584208,0.0002226227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007494834,"about_ca_system_score_gemma":0.0004619831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001972463,"about_ca_topic_score_gemma":0.000002102426,"domain_scores_codex":[0.9966214,0.0003089426,0.001389891,0.0004774263,0.0007447283,0.0004576552],"domain_scores_gemma":[0.9962851,0.000660723,0.00126386,0.001068722,0.0004438226,0.0002777937],"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.00009539182,0.00071654,0.0001267634,0.0009620377,0.0002479404,0.0008980282,0.0002668534,0.0003580383,0.0004974131,0.9736672,0.02075902,0.001404763],"study_design_scores_gemma":[0.0006247787,0.0002660759,0.0001446161,0.0003994654,0.00006713115,0.0004391733,0.00003216537,0.04309381,0.0006415702,0.952848,0.001128464,0.0003148227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01809653,0.0002040839,0.9735698,0.006122496,0.001407601,0.0002110332,0.00004167905,0.0001703299,0.0001764796],"genre_scores_gemma":[0.1724838,0.0000636399,0.8265272,0.0004158893,0.0004242461,0.00002102289,0.00002069034,0.00003857254,0.00000499529],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1543872,"threshold_uncertainty_score":0.9999426,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008487746","doi":"10.1515/jmc.2007.003","title":"Some results on query processes and reconstruction functions for unconditionally secure 2-server 1-round binary private information retrieval protocols","year":2007,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University; University of Waterloo","funders":"","keywords":"Binary number; Computer science; Boolean function; Theoretical computer science; Server; Boolean conjunctive query; Function (biology); Private information retrieval; Query optimization; Information retrieval; Mathematics; Algorithm; Sargable; Web search query; Search engine; Arithmetic; Computer security; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.0236044729694288,"gpt":0.2915814528388346,"spread":0.2679769798694058,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001582986,0.0001426862,0.0002907434,0.0003640034,0.0001824411,0.0001323547,0.0002956245,0.0001737401,0.000006316502],"category_scores_gemma":[0.001455206,0.0001117185,0.00009710166,0.0003518257,0.0000965998,0.002458268,0.00006680983,0.0002984529,0.000009620681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004221812,"about_ca_system_score_gemma":0.0001593741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.549889e-7,"about_ca_topic_score_gemma":0.000001836742,"domain_scores_codex":[0.998279,0.00005562335,0.0009425923,0.0001621267,0.000326489,0.0002341804],"domain_scores_gemma":[0.9977031,0.000726511,0.0007060373,0.000221987,0.0005087251,0.0001336436],"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.001637201,0.0002859947,0.00008938167,0.0005539274,0.00005907671,0.00001369383,0.000418935,0.0000122821,0.0002015406,0.9921995,0.002319144,0.002209365],"study_design_scores_gemma":[0.002289629,0.002062862,0.00195131,0.000324171,0.00003017909,0.001464674,0.0002548458,0.0004106401,0.0009603061,0.9847875,0.005266846,0.0001970362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1615864,0.00004473396,0.8329089,0.002346882,0.0003994364,0.002374287,0.00006306727,0.00004983188,0.0002265233],"genre_scores_gemma":[0.4147176,0.00006169573,0.5819413,0.001407818,0.001354418,0.0003883863,0.00008783103,0.00002782253,0.00001313943],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2531312,"threshold_uncertainty_score":0.4555748,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}