{"meta":{"query_hash":"44d73b0cb73f","filters":{"venue":"Journal of Mathematical Cryptology"},"cohort_total":43,"direct_labels_cover":0,"predictions_cover":43,"exported":43,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/44d73b0cb73f","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Mathematical+Cryptology"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.010417435029722071,"score_gpt":0.26236414663922075,"score_spread":0.25194671160949866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971243765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24213946,0.000041367297,0.75582886,0.0015934837,0.00018528411,0.00003601856,2.0002078e-7,0.000011096703,0.00016421101],"genre_scores_gemma":[0.7690515,0.000002064673,0.23081018,0.00006600348,0.00006344815,3.8976137e-7,1.2635664e-7,0.0000049095684,0.0000014053875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983557,0.00023293491,0.00078805303,0.00013714006,0.00027380497,0.00021238397],"domain_scores_gemma":[0.9986603,0.00046005356,0.00050072826,0.00018082923,0.000117372285,0.000080674006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010688775,0.00011307858,0.0005035441,0.00023223666,0.00002592483,0.000023438555,0.00054729875,0.00008656611,0.0000032504151],"category_scores_gemma":[0.00039439817,0.000081700964,0.00011638797,0.00024190199,0.000058055808,0.000116100695,0.00012824053,0.00032350505,0.000006669956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034689776,0.00038361605,0.0007261809,0.00022684153,0.000041768537,0.00007726727,0.0019043171,0.015762543,0.0010678238,0.94509786,0.00024450853,0.034432597],"study_design_scores_gemma":[0.00038324363,0.00032495058,0.0013333336,0.000115300005,0.0000050478775,0.00038144438,0.00003462205,0.61325645,0.00017854353,0.3838871,0.000035438024,0.000064488246],"about_ca_topic_score_codex":0.00000193127,"about_ca_topic_score_gemma":9.935962e-7,"teacher_disagreement_score":0.59749395,"about_ca_system_score_codex":0.000016523982,"about_ca_system_score_gemma":0.000038375205,"threshold_uncertainty_score":0.33316687},"labels":[],"label_agreement":null},{"id":"W1985273268","doi":"10.1515/jmc.2008.006","title":"On the security of multi-prime RSA","year":2008,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Prime (order theory); Factoring; Exponent; Public-key cryptography; Mathematics; Cryptography; Algebraic number; Arithmetic; Discrete mathematics; Computer science; Computer security; Combinatorics; Algorithm; Encryption; Business","score_opus":0.029800146658772037,"score_gpt":0.2613415051658113,"score_spread":0.23154135850703925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985273268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42305064,0.00021880915,0.57044035,0.0049255886,0.00022489004,0.00009175792,6.281184e-7,0.000014528067,0.0010328201],"genre_scores_gemma":[0.939787,0.000032248605,0.05991672,0.00021531426,0.000036534857,0.0000011461207,2.9882283e-8,0.0000042646184,0.0000067906462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986547,0.00019161595,0.0005396521,0.00010425818,0.00032589657,0.00018386255],"domain_scores_gemma":[0.99815756,0.00087815704,0.0003697963,0.00035358995,0.00015710156,0.00008381353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006188429,0.000102711565,0.0003583301,0.00014383087,0.00008833481,0.000011121832,0.0008567806,0.000085733154,0.000045672918],"category_scores_gemma":[0.0005534776,0.00005469794,0.00023855749,0.0002536776,0.0001988813,0.000094085146,0.00010437429,0.00034692648,0.000031113916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024083272,0.0006398139,0.0001694462,0.000027948085,0.00006735406,0.0001377109,0.001623507,0.00001382442,0.0007089302,0.9947127,0.0013810989,0.00049354683],"study_design_scores_gemma":[0.0008936528,0.0007610981,0.0025588134,0.00009474038,0.000031106294,0.0032151528,0.00017737209,0.0065226783,0.009064719,0.976318,0.00021782806,0.00014483734],"about_ca_topic_score_codex":8.38892e-7,"about_ca_topic_score_gemma":4.039012e-7,"teacher_disagreement_score":0.5167363,"about_ca_system_score_codex":0.000009636894,"about_ca_system_score_gemma":0.00006245102,"threshold_uncertainty_score":0.22305171},"labels":[],"label_agreement":null},{"id":"W1987475429","doi":"10.1515/jmc-2012-0015","title":"Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies","year":2014,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":398,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Isogeny; Mathematics; Cryptosystem; Supersingular elliptic curve; Endomorphism ring; Public-key cryptography; Elliptic curve; Mathematical proof; Post-quantum cryptography; Endomorphism; Commutative property; Cryptography; Scheme (mathematics); Discrete mathematics; Pure mathematics; Algebra over a field; Encryption; Computer science; Algorithm; Mathematical analysis","score_opus":0.01353937373835186,"score_gpt":0.23846793185032228,"score_spread":0.22492855811197043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987475429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24287827,0.00096517755,0.75181586,0.002550386,0.00073839,0.00009155259,0.0000022223599,0.000047097863,0.0009110697],"genre_scores_gemma":[0.8619688,0.000032493925,0.13750699,0.00015549417,0.00030965428,0.0000027508183,6.008739e-7,0.000016372633,0.0000068501117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970293,0.00049057254,0.0010898612,0.00030015822,0.0006339776,0.00045612745],"domain_scores_gemma":[0.99763876,0.00069981697,0.0004931267,0.0005966424,0.00029241157,0.00027924933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012213548,0.00026001074,0.00086109515,0.00032775378,0.00013840527,0.00016234585,0.0012966418,0.00020918244,0.000060383576],"category_scores_gemma":[0.000680181,0.00018606384,0.000439582,0.00036676158,0.00015095923,0.00031782629,0.00017276841,0.00041129667,0.00009938988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006030841,0.00029247045,0.00025252107,0.0001113728,0.00019731416,0.00012716108,0.0012644427,0.00002867005,0.00689372,0.98818874,0.0006127975,0.0019705072],"study_design_scores_gemma":[0.0009865756,0.00087876536,0.0013523875,0.00023444851,0.000118751625,0.00071455474,0.0005007332,0.017191732,0.003112915,0.97164506,0.0029279436,0.00033610698],"about_ca_topic_score_codex":0.000015298745,"about_ca_topic_score_gemma":0.00000355316,"teacher_disagreement_score":0.6190905,"about_ca_system_score_codex":0.0000402773,"about_ca_system_score_gemma":0.000105266925,"threshold_uncertainty_score":0.7587464},"labels":[],"label_agreement":null},{"id":"W1996714756","doi":"10.1515/jmc.2008.011","title":"Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formulæ","year":2008,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Universidad de Talca","keywords":"Hyperelliptic curve cryptography; Arithmetic; Jacobian matrix and determinant; Binary number; Mathematics; Genus; Field (mathematics); Pure mathematics; Computer science; Applied mathematics; Biology; Zoology","score_opus":0.016394329432625573,"score_gpt":0.2547704709577174,"score_spread":0.2383761415250918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996714756","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64516586,0.00064673607,0.35201392,0.0014396753,0.00025796783,0.000103324026,5.80462e-7,0.000018748762,0.00035315045],"genre_scores_gemma":[0.8810002,0.00022623828,0.11826897,0.00039909116,0.00007521604,0.00000315894,1.5951736e-7,0.000011808249,0.000015127592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978156,0.00014943283,0.0009997884,0.00025492025,0.00041563463,0.0003646434],"domain_scores_gemma":[0.997599,0.001108914,0.0005009593,0.00042187455,0.00017444196,0.00019483293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005722675,0.00022434037,0.00073648297,0.00046637846,0.00012438727,0.000040114006,0.00075101113,0.00026893144,0.000052131178],"category_scores_gemma":[0.00050059636,0.00017006765,0.0002784245,0.00036710166,0.0001609543,0.00032357825,0.0002639305,0.00063509244,0.000008646444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006692267,0.0040562646,0.010833047,0.0032589359,0.0013750651,0.0067214435,0.0429027,0.00026298937,0.015892556,0.85984194,0.005598686,0.048587114],"study_design_scores_gemma":[0.003013241,0.0048572193,0.007967371,0.0013376017,0.0002459294,0.024090651,0.0005861097,0.032383494,0.011194942,0.91322356,0.00029931348,0.00080053374],"about_ca_topic_score_codex":0.000006472347,"about_ca_topic_score_gemma":0.000002784137,"teacher_disagreement_score":0.23583435,"about_ca_system_score_codex":0.00001934078,"about_ca_system_score_gemma":0.00008124842,"threshold_uncertainty_score":0.6935158},"labels":[],"label_agreement":null},{"id":"W2005895372","doi":"10.1515/jmc.2007.015","title":"Minimal weight and colexicographically minimal integer representations","year":2007,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Dimension (graph theory); Integer (computer science); Discrete mathematics; Set (abstract data type); Representation (politics); Minimal models; Arithmetic; Combinatorics; Algebra over a field; Pure mathematics; Computer science","score_opus":0.012608873498279837,"score_gpt":0.27983659282903395,"score_spread":0.2672277193307541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005895372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19193448,0.0003274129,0.79962796,0.0052443435,0.00027814682,0.000080247424,4.8569524e-7,0.000024155346,0.0024827758],"genre_scores_gemma":[0.7005167,0.000028589871,0.2991148,0.00021482972,0.000104215505,0.0000013512267,1.2955991e-7,0.000006225909,0.00001316719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982443,0.00009872596,0.00080297055,0.00019869389,0.0003333343,0.00032201526],"domain_scores_gemma":[0.99813586,0.00081632973,0.0003180505,0.00024878708,0.00022257926,0.0002584015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011113607,0.00013760808,0.00037579914,0.00046978358,0.00010986422,0.00006973399,0.00051817996,0.00014534855,0.00003126229],"category_scores_gemma":[0.00038877837,0.00009965879,0.00019296218,0.0004781518,0.00026699406,0.000257001,0.00015340233,0.0003684729,0.000011040284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095155665,0.00039274458,0.0035792121,0.00004753995,0.000115463634,0.0004772819,0.000812178,0.000001255665,0.0018719577,0.9843369,0.0011093674,0.0071609286],"study_design_scores_gemma":[0.0018794489,0.0014033866,0.0715209,0.00013290397,0.00013111222,0.009480582,0.0010271155,0.0015024538,0.0026403756,0.9083299,0.0015687904,0.00038302463],"about_ca_topic_score_codex":8.7655667e-7,"about_ca_topic_score_gemma":0.0000029624202,"teacher_disagreement_score":0.50858223,"about_ca_system_score_codex":0.000010106929,"about_ca_system_score_gemma":0.000047052585,"threshold_uncertainty_score":0.40639678},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023604472969428802,"score_gpt":0.29158145283883463,"score_spread":0.26797697986940583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008487746","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16158639,0.000044733955,0.83290887,0.0023468817,0.00039943637,0.0023742865,0.000063067266,0.000049831884,0.0002265233],"genre_scores_gemma":[0.41471756,0.00006169573,0.5819413,0.0014078179,0.0013544178,0.0003883863,0.00008783103,0.000027822534,0.0000131394345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998279,0.000055623346,0.00094259233,0.0001621267,0.00032648895,0.00023418042],"domain_scores_gemma":[0.9977031,0.000726511,0.0007060373,0.00022198696,0.00050872506,0.00013364357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015829856,0.00014268619,0.0002907434,0.00036400344,0.00018244107,0.00013235475,0.0002956245,0.00017374012,0.000006316502],"category_scores_gemma":[0.0014552062,0.0001117185,0.00009710166,0.0003518257,0.0000965998,0.0024582676,0.00006680983,0.0002984529,0.000009620681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016372006,0.00028599467,0.00008938167,0.0005539274,0.00005907671,0.0000136938315,0.00041893497,0.000012282099,0.00020154058,0.9921995,0.0023191436,0.0022093647],"study_design_scores_gemma":[0.002289629,0.0020628618,0.0019513095,0.00032417104,0.000030179088,0.0014646741,0.0002548458,0.0004106401,0.00096030615,0.9847875,0.005266846,0.00019703618],"about_ca_topic_score_codex":2.549889e-7,"about_ca_topic_score_gemma":0.0000018367417,"teacher_disagreement_score":0.25313118,"about_ca_system_score_codex":0.000042218122,"about_ca_system_score_gemma":0.00015937407,"threshold_uncertainty_score":0.45557484},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Hash function; Key (lock); Pairwise comparison; Scheme (mathematics); Cryptography; Theoretical computer science; Graph; Function (biology); Computer network; Distributed computing; Computer security; Mathematics","score_opus":0.03865162738862765,"score_gpt":0.286290799396298,"score_spread":0.24763917200767033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018752355","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02661763,0.0002566598,0.9670937,0.0036062037,0.0014423144,0.00053039455,0.000023876044,0.00011460299,0.00031461686],"genre_scores_gemma":[0.4945532,0.000040929834,0.504878,0.00010790498,0.0003021571,0.000037615857,0.000057595942,0.000020864727,0.0000017074622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965063,0.00049778365,0.0016087944,0.00041127368,0.0005378385,0.00043801244],"domain_scores_gemma":[0.9941637,0.0013391093,0.0020827884,0.0011709515,0.0010380493,0.000205382],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015735509,0.00035561217,0.0010454801,0.00037474505,0.00024645988,0.00023950456,0.0016092479,0.00079473614,0.000027323944],"category_scores_gemma":[0.00084680476,0.00034971192,0.00050140935,0.00021462719,0.00024398723,0.00024161465,0.00047567312,0.0014878039,0.0000127479425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019755276,0.00037707237,0.000022801016,0.00044231242,0.0002463672,0.0000045287893,0.00020719638,0.016038898,0.00021445872,0.97773015,0.0029440387,0.0015746278],"study_design_scores_gemma":[0.0012094155,0.00037254783,0.00009937928,0.00061020965,0.00025885034,0.0002942768,0.00010967841,0.3540162,0.0008511621,0.6408966,0.00095012103,0.00033150226],"about_ca_topic_score_codex":0.0000024599585,"about_ca_topic_score_gemma":0.0000022527267,"teacher_disagreement_score":0.4679356,"about_ca_system_score_codex":0.00021417931,"about_ca_system_score_gemma":0.0002469125,"threshold_uncertainty_score":0.9998955},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016815841446691154,"score_gpt":0.3360632588257027,"score_spread":0.3192474173790115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023005004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02878214,0.000018837818,0.96452,0.0014462515,0.00024358071,0.004479948,0.000006329007,0.000052915893,0.00045000552],"genre_scores_gemma":[0.9301125,0.0000024316307,0.06884186,0.00039457603,0.00018995,0.00044560808,0.000004789956,0.000007386163,9.3232404e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977298,0.0002395468,0.0009542609,0.00026235636,0.00049845217,0.00031559673],"domain_scores_gemma":[0.9980857,0.00011327667,0.00063266966,0.00059171725,0.00031616577,0.00026049704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001096334,0.0001741744,0.00040253127,0.00024040276,0.00010630814,0.00018486667,0.0012989023,0.00014259631,0.00003097638],"category_scores_gemma":[0.00023957022,0.00013215003,0.00018369572,0.0003619183,0.00007028955,0.00051755144,0.00007207611,0.00040774213,0.00004820833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044083146,0.0015047994,0.000042059128,0.00006773228,0.000022303659,0.00007125477,0.0009055814,0.00014201684,0.0023369822,0.9753726,0.002296087,0.0171945],"study_design_scores_gemma":[0.0031424651,0.0023969437,0.0025764038,0.00021309844,0.0000523623,0.0011737865,0.0003849707,0.10278133,0.004338589,0.87588954,0.0064659053,0.0005846058],"about_ca_topic_score_codex":1.4440774e-7,"about_ca_topic_score_gemma":3.8795739e-7,"teacher_disagreement_score":0.90133035,"about_ca_system_score_codex":0.000029838635,"about_ca_system_score_gemma":0.00008038004,"threshold_uncertainty_score":0.5388922},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024771305483093333,"score_gpt":0.29786622476499747,"score_spread":0.27309491928190416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024310614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.439723,0.000053652147,0.5592324,0.0006067569,0.000079882724,0.00004105863,0.0000023741725,0.00000810206,0.000252754],"genre_scores_gemma":[0.90407044,0.000031180545,0.09578798,0.00007988317,0.000023462204,0.000001233406,6.169808e-7,0.000002871176,0.0000023194923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842036,0.000108789376,0.0008774534,0.000119420816,0.00028440444,0.00018958178],"domain_scores_gemma":[0.99844813,0.0002506972,0.0005700225,0.00030399684,0.00032012502,0.00010701832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005775906,0.00009667728,0.00061170704,0.00060253823,0.0000646428,0.000013289375,0.00056682964,0.00006911757,0.00011760471],"category_scores_gemma":[0.00019328945,0.000073816525,0.0004059512,0.0011207333,0.000093129136,0.00019732732,0.00010045238,0.00018236449,0.0000028821582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034538076,0.0008017264,0.004336869,0.00005810605,0.0014730869,0.00010153737,0.0056720893,0.000023559993,0.0019084075,0.983514,0.0009648676,0.0011112115],"study_design_scores_gemma":[0.0026176274,0.001526956,0.025418354,0.000038343813,0.0016040439,0.002465302,0.0013033961,0.14587168,0.004377262,0.8133079,0.00096617924,0.00050295633],"about_ca_topic_score_codex":0.0000046133528,"about_ca_topic_score_gemma":0.0000066037237,"teacher_disagreement_score":0.46434745,"about_ca_system_score_codex":0.000015688418,"about_ca_system_score_gemma":0.00007828006,"threshold_uncertainty_score":0.30101505},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03649148341082455,"score_gpt":0.2945608209996092,"score_spread":0.25806933758878464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026017982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23903328,0.00015660963,0.75850195,0.0018107215,0.00016900773,0.0002027225,0.00002831395,0.000020555719,0.00007681845],"genre_scores_gemma":[0.6375954,0.000010988067,0.36188072,0.00033769934,0.00014858218,0.000010624517,0.0000058520645,0.000008566427,0.0000015319172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985776,0.000028708055,0.00057427847,0.00025721896,0.0002660906,0.000296136],"domain_scores_gemma":[0.99853885,0.0003409917,0.00035169284,0.00028136378,0.00028631132,0.00020079192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003172287,0.00017511925,0.00042333532,0.00017820201,0.000119202195,0.00031811782,0.0010939095,0.00017137911,0.00017424354],"category_scores_gemma":[0.00026865795,0.0001293508,0.0001366611,0.00011737892,0.00008823586,0.0013407315,0.0004043877,0.0003480736,0.0000047039307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018184446,0.000078202705,0.0011232483,0.00016905335,0.00007226631,0.000012570381,0.00024577306,0.000021367925,0.00037895972,0.9928424,0.0038607486,0.0011772776],"study_design_scores_gemma":[0.0007287971,0.00011951505,0.00327527,0.00006346892,0.000024001483,0.00053220487,0.000062291765,0.022317449,0.00032125527,0.971854,0.0005494431,0.00015231782],"about_ca_topic_score_codex":0.000001879278,"about_ca_topic_score_gemma":0.0000033813617,"teacher_disagreement_score":0.39856216,"about_ca_system_score_codex":0.000015384614,"about_ca_system_score_gemma":0.00004786937,"threshold_uncertainty_score":0.52747726},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015423903347543066,"score_gpt":0.3342108138883982,"score_spread":0.3187869105408551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037126171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03810719,0.000031943207,0.95803785,0.00027805052,0.00016872553,0.0029593778,0.0000016345134,0.000031264062,0.00038393892],"genre_scores_gemma":[0.6839525,0.0000013074089,0.31555486,0.00007274046,0.00014634256,0.00026150869,8.2709914e-7,0.000008556333,0.0000013778181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828905,0.00014231469,0.0007853471,0.00022515039,0.00027850643,0.00027962498],"domain_scores_gemma":[0.99843204,0.00022850752,0.0004093724,0.00041310381,0.00025984205,0.00025715772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024290758,0.0001383828,0.00031198194,0.00026013085,0.00010244059,0.0001221218,0.00066854677,0.000109970475,0.000017264576],"category_scores_gemma":[0.00019152183,0.000105009,0.00009446571,0.0003080628,0.000097308686,0.00037613147,0.00012157427,0.00030101257,0.00002299572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007863055,0.0010402787,0.00021733936,0.00013983516,0.000025133799,0.00006481859,0.0020503292,0.0000425465,0.0021511528,0.98070556,0.000500826,0.0129835345],"study_design_scores_gemma":[0.002497255,0.00096009014,0.003928626,0.00011694665,0.00004616702,0.00263715,0.00035958432,0.07734446,0.0043783975,0.9049109,0.002461969,0.0003584253],"about_ca_topic_score_codex":3.896293e-7,"about_ca_topic_score_gemma":0.0000028106392,"teacher_disagreement_score":0.6458453,"about_ca_system_score_codex":0.00002242084,"about_ca_system_score_gemma":0.000052889827,"threshold_uncertainty_score":0.42821425},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Exponent; Cryptography; Modulus; Cryptanalysis; Mathematics; Computer science; Computer security; Arithmetic; Philosophy","score_opus":0.017956054032233937,"score_gpt":0.28069872628965564,"score_spread":0.2627426722574217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041780131","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79175556,0.00006989185,0.19924401,0.007368061,0.00066640053,0.00014396102,0.000003103969,0.000021807879,0.00072721747],"genre_scores_gemma":[0.7699774,0.000043789394,0.22926323,0.00058629806,0.00011671103,0.0000028370002,4.9377286e-7,0.000008035731,0.0000011955267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825585,0.0002043996,0.00069058756,0.00023896295,0.00029242484,0.0003177864],"domain_scores_gemma":[0.99812585,0.00066500483,0.0004353338,0.00047382974,0.00008525715,0.00021474653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012563763,0.00016855651,0.00047759284,0.00025955105,0.000063033105,0.00010889979,0.00072762056,0.00017420689,0.000017616243],"category_scores_gemma":[0.00071839895,0.00012911916,0.00009261296,0.00017967685,0.00009374683,0.00067985675,0.00027032668,0.0009438006,0.000026584434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099383746,0.00079600204,0.0004060712,0.000036671612,0.000032944303,0.00036777218,0.0005795264,0.0000037518082,0.0019023122,0.9908163,0.00017826045,0.004781028],"study_design_scores_gemma":[0.0018154255,0.0009210593,0.011502576,0.0001236791,0.000042988235,0.003465628,0.00017497742,0.0060416204,0.00094158563,0.97263944,0.0020454712,0.00028555622],"about_ca_topic_score_codex":0.0000034245954,"about_ca_topic_score_gemma":0.000012002378,"teacher_disagreement_score":0.030019226,"about_ca_system_score_codex":0.000016621963,"about_ca_system_score_gemma":0.000040609357,"threshold_uncertainty_score":0.52653265},"labels":[],"label_agreement":null},{"id":"W2045890225","doi":"10.1515/jmc-2012-0016","title":"Constructing elliptic curve isogenies in quantum subexponential time","year":2013,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":187,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Isogeny; Finite field; Cardinality (data modeling); Quantum algorithm; Quantum Fourier transform; Elliptic curve; Quantum; Cryptosystem; Endomorphism; Discrete logarithm","score_opus":0.0096042011635041,"score_gpt":0.2281385526665449,"score_spread":0.2185343515030408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045890225","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72202784,0.00023017189,0.27383655,0.0027363363,0.00031634266,0.00012028999,3.1570752e-7,0.000022921862,0.0007092394],"genre_scores_gemma":[0.8626419,0.000012270462,0.13717048,0.00007122349,0.00008172056,0.0000037502966,1.6017417e-7,0.000007682998,0.000010859047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818367,0.00019894322,0.000827746,0.00016103462,0.0002788909,0.00034969219],"domain_scores_gemma":[0.9986447,0.00048106347,0.000353732,0.00023251578,0.00015934285,0.00012865181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057825766,0.00014261427,0.0004914841,0.00037758859,0.000047265094,0.00009968667,0.0006684976,0.000121258,0.00021888112],"category_scores_gemma":[0.00032171907,0.00010591675,0.0001865223,0.0003502695,0.0001335951,0.00043772988,0.00013434705,0.0003664798,0.00033496137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023116372,0.0004325335,0.0041111954,0.00010688481,0.0001068963,0.00027074912,0.0011801261,0.000033891367,0.006959332,0.9796296,0.0009724178,0.0061732833],"study_design_scores_gemma":[0.0011063623,0.00040825,0.0036033622,0.0001552658,0.0000322418,0.0042746933,0.0007909066,0.050183516,0.0016583201,0.9374172,0.00008200917,0.0002878751],"about_ca_topic_score_codex":0.0000050455733,"about_ca_topic_score_gemma":0.000001403978,"teacher_disagreement_score":0.14061402,"about_ca_system_score_codex":0.000027748327,"about_ca_system_score_gemma":0.000059134407,"threshold_uncertainty_score":0.43191597},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019730090165529124,"score_gpt":0.27596826765672267,"score_spread":0.25623817749119354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064190686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28963366,0.00009828333,0.7002338,0.0073301787,0.00022106407,0.00012143868,4.9298643e-7,0.000021200309,0.0023398753],"genre_scores_gemma":[0.8400448,0.000012136776,0.15893704,0.00084628526,0.000077713456,0.000006667432,2.1566333e-7,0.000007293085,0.000067827845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882406,0.00007897557,0.0005283281,0.00010536726,0.00023836023,0.0002249024],"domain_scores_gemma":[0.99907225,0.00016359873,0.00026188855,0.00022420671,0.00017853959,0.000099488105],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000327276,0.00009265921,0.00026287534,0.00014727967,0.000068213965,0.000057041696,0.0005180656,0.00006068463,0.0013860232],"category_scores_gemma":[0.000086852844,0.000065356624,0.0001347067,0.00016872094,0.000038014517,0.00031175688,0.00014677121,0.00014339873,0.00038511597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005823323,0.00020583575,0.0005707502,0.000025869067,0.000053095704,0.000032017044,0.0008347355,0.0000018575187,0.002012798,0.970737,0.021921864,0.0035984002],"study_design_scores_gemma":[0.00077311316,0.0003141097,0.0020189125,0.000021431808,0.000019250756,0.0014561618,0.00024745165,0.0036843512,0.0011406498,0.98453176,0.0056313076,0.00016151612],"about_ca_topic_score_codex":0.000002103319,"about_ca_topic_score_gemma":0.00000201211,"teacher_disagreement_score":0.55041116,"about_ca_system_score_codex":0.000029199851,"about_ca_system_score_gemma":0.00003301764,"threshold_uncertainty_score":0.99952686},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028690374475523445,"score_gpt":0.2826695385318816,"score_spread":0.2539791640563581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064998746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10141026,0.00011316245,0.89215714,0.0012355521,0.0003341786,0.000057613604,6.4174986e-7,0.000037661317,0.004653807],"genre_scores_gemma":[0.82353866,0.0000018495135,0.17607792,0.00014195462,0.00020542431,0.000002109285,1.6543925e-7,0.0000090934545,0.000022796332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985757,0.00015450046,0.00043428302,0.00012328138,0.00029376204,0.00041849332],"domain_scores_gemma":[0.998642,0.00038571277,0.00034998686,0.00028521693,0.000108395085,0.00022864429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010948884,0.00015061034,0.0003842618,0.00016258965,0.00009456664,0.00007232847,0.00065638934,0.000082556515,0.00007780689],"category_scores_gemma":[0.0003391745,0.00009449262,0.0001414028,0.0002896103,0.00008975787,0.00045259175,0.00014425372,0.00033451218,0.00004187378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005106285,0.00015635353,0.004324383,0.000046306897,0.000081363556,0.0000848954,0.0015399429,0.000004535446,0.00010418211,0.9914035,0.000699827,0.0015036062],"study_design_scores_gemma":[0.0014616742,0.0013797155,0.0042331764,0.0003521354,0.00016117649,0.010189442,0.0008102332,0.0014356507,0.00076473935,0.9729682,0.0056769126,0.00056690496],"about_ca_topic_score_codex":2.913178e-7,"about_ca_topic_score_gemma":3.1105344e-7,"teacher_disagreement_score":0.7221284,"about_ca_system_score_codex":0.000021618254,"about_ca_system_score_gemma":0.000034674707,"threshold_uncertainty_score":0.38532972},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Computer science; Arithmetic","score_opus":0.016047903562670104,"score_gpt":0.2496530297266319,"score_spread":0.23360512616396178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065483996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6795543,0.000045474197,0.2991902,0.014898222,0.00042135027,0.000082049555,2.705314e-7,0.000017535443,0.005790622],"genre_scores_gemma":[0.9800821,0.000005038035,0.01874292,0.00082796987,0.00033191434,2.673898e-7,1.8877321e-8,0.0000022902832,0.000007511631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890435,0.00017090561,0.000422954,0.000086687745,0.000262292,0.00015281243],"domain_scores_gemma":[0.99853814,0.0006871867,0.00032494252,0.0002881458,0.00010134779,0.00006021192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009002091,0.000087801636,0.0003127718,0.00011509773,0.00005652086,0.000023569706,0.00077670196,0.00006020945,0.00006080774],"category_scores_gemma":[0.00047421156,0.00004928091,0.00020251842,0.00016178591,0.00007821501,0.00013246931,0.00005498197,0.0002441947,0.000023916004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049611717,0.00019823016,0.000023528159,0.000005763326,0.000019718154,0.000021892105,0.00026773888,0.0000026790815,0.0006432534,0.9937172,0.0019340715,0.0031162908],"study_design_scores_gemma":[0.00017490234,0.0006768728,0.0011329412,0.0000350527,0.0000126703835,0.0002235384,0.00003531293,0.00011526759,0.004049796,0.9933542,0.00013894483,0.000050483475],"about_ca_topic_score_codex":4.5821672e-8,"about_ca_topic_score_gemma":5.7759543e-8,"teacher_disagreement_score":0.30052778,"about_ca_system_score_codex":0.000009518072,"about_ca_system_score_gemma":0.000037426245,"threshold_uncertainty_score":0.20096171},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Mathematics; Genus; Standard Model (mathematical formulation); Discrete mathematics; Theoretical computer science; Computer science; Computer security; Public-key cryptography; Encryption; Geography","score_opus":0.017243321205712477,"score_gpt":0.24333549800228965,"score_spread":0.22609217679657717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069036743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19130829,0.00040662734,0.8044756,0.0020575859,0.00015809052,0.000117870055,0.0000056328,0.000024536565,0.0014457759],"genre_scores_gemma":[0.8090518,0.0003054651,0.18995169,0.0004896877,0.0001423074,0.000004307011,9.974506e-7,0.00001746028,0.00003627215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984365,0.000086627275,0.0005914341,0.00022602566,0.00034446732,0.00031491826],"domain_scores_gemma":[0.9988126,0.00019867075,0.00032613473,0.00037194023,0.00010593177,0.00018470298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004469863,0.00017446517,0.00052491366,0.00015438932,0.00015898158,0.000044255197,0.0005828982,0.00012883525,0.000077898825],"category_scores_gemma":[0.00010085351,0.00012173731,0.00015523026,0.00017500661,0.00025013625,0.00036913235,0.00032538822,0.00029260467,0.000035391186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038582823,0.0009391382,0.010309614,0.00053035293,0.00031320238,0.0013938412,0.008561227,0.000019961139,0.0043994035,0.93829143,0.031469118,0.0033869112],"study_design_scores_gemma":[0.0035489423,0.0020449925,0.0074750884,0.00025129315,0.000084670326,0.017988402,0.00018749606,0.0033713735,0.0023380779,0.9426259,0.01941857,0.00066523376],"about_ca_topic_score_codex":8.712888e-7,"about_ca_topic_score_gemma":0.0000039126976,"teacher_disagreement_score":0.61774355,"about_ca_system_score_codex":0.00002754954,"about_ca_system_score_gemma":0.000047887224,"threshold_uncertainty_score":0.49643034},"labels":[],"label_agreement":null},{"id":"W2070823145","doi":"10.1515/jmc.2011.007","title":"Compact elliptic curve representations","year":2011,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Elliptic curve; Isomorphism (crystallography); Prime (order theory); Upper and lower bounds; Combinatorics; Reduction (mathematics); Discrete mathematics; Jacobian curve; Pure mathematics; Schoof's algorithm; Mathematical analysis; Quarter period; Geometry; Crystallography; Chemistry","score_opus":0.04824862023982155,"score_gpt":0.28889269733479933,"score_spread":0.2406440770949778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070823145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04755655,0.00020261534,0.93803984,0.0016690954,0.00036984903,0.00007651135,4.1286862e-7,0.000033178432,0.012051958],"genre_scores_gemma":[0.772788,0.000019014396,0.22700603,0.000104902036,0.000056768702,8.684342e-7,9.063172e-8,0.0000055811533,0.000018781906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866444,0.00015196913,0.00058225065,0.00012890871,0.00024549774,0.00022692143],"domain_scores_gemma":[0.99873126,0.0002671794,0.00032445416,0.0003448194,0.00017163172,0.00016063167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048134767,0.0001054321,0.00033197424,0.00024545862,0.0000648941,0.000035079323,0.0007562562,0.00007496509,0.00013596428],"category_scores_gemma":[0.00024153298,0.00007425329,0.00021528515,0.00031652153,0.00009138113,0.00029083356,0.00006877343,0.0002592023,0.00010827663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016695232,0.00040359658,0.0016022219,0.000027431197,0.00008536689,0.00019105396,0.0018232462,0.000007719771,0.00026486846,0.99313766,0.0015383982,0.00090173923],"study_design_scores_gemma":[0.0004968486,0.0004093578,0.014375146,0.000046549518,0.00005114342,0.002565488,0.00033141742,0.0015080728,0.0018255878,0.9779579,0.000289713,0.00014277677],"about_ca_topic_score_codex":0.0000024302674,"about_ca_topic_score_gemma":6.9660626e-7,"teacher_disagreement_score":0.7252314,"about_ca_system_score_codex":0.000011618783,"about_ca_system_score_gemma":0.00005182288,"threshold_uncertainty_score":0.30279613},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics; Computer science","score_opus":0.12123808306032284,"score_gpt":0.3780973235038994,"score_spread":0.25685924044357655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071803996","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009997687,0.00014500969,0.934527,0.053598166,0.00044666525,0.000062172134,0.000017448381,0.000026932754,0.0011789608],"genre_scores_gemma":[0.43422523,0.000021516775,0.5616235,0.003406012,0.0006717395,8.379655e-7,0.000012663074,0.000016006275,0.00002246341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979181,0.00030117336,0.0007126356,0.00031252627,0.00045218403,0.00030333185],"domain_scores_gemma":[0.9939872,0.0019339476,0.00058224547,0.0032267796,0.00013983787,0.000129986],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0032938484,0.00012354272,0.00034359863,0.00007761362,0.00021954441,0.00027669113,0.0070059933,0.000087685614,0.00007252261],"category_scores_gemma":[0.006060113,0.00007884518,0.000056310393,0.00021487883,0.00011094476,0.0013974576,0.0028698375,0.0005789208,0.00020890117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000099220615,0.0002817319,0.00008648322,0.000053783297,0.00008995153,0.00006767964,0.0014406774,0.0000054348047,0.00039420355,0.91564476,0.059924353,0.022001022],"study_design_scores_gemma":[0.0004452524,0.0001433034,0.00025405324,0.00013343299,0.00009931848,0.008788299,0.0005506322,0.26558486,0.00013356908,0.669622,0.054036647,0.00020864412],"about_ca_topic_score_codex":0.0000070872366,"about_ca_topic_score_gemma":0.000006409805,"teacher_disagreement_score":0.42422754,"about_ca_system_score_codex":0.000022207903,"about_ca_system_score_gemma":0.00014862146,"threshold_uncertainty_score":0.9983666},"labels":[],"label_agreement":null},{"id":"W2078293442","doi":"10.1515/jmc.2010.001","title":"Factor-4 and 6 compression of cyclotomic subgroups of and","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pairing; Exponentiation; Mathematics; Discrete logarithm; Finite field; Multiplicative group; Prime (order theory); Elliptic curve; Cryptography; Order (exchange); Embedding; Prime factor; Discrete mathematics; Multiplicative function; Combinatorics; Pure mathematics; Algorithm; Public-key cryptography; Computer science; Mathematical analysis","score_opus":0.01011419312858089,"score_gpt":0.2554686893593438,"score_spread":0.24535449623076291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078293442","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90766567,0.00019602108,0.09147183,0.000396065,0.0001045481,0.00004373322,7.6847954e-7,0.000004190634,0.00011716517],"genre_scores_gemma":[0.9030739,0.000039350274,0.09685141,0.000013428999,0.000017721857,2.9870102e-7,2.983506e-8,0.0000029009802,9.41747e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911535,0.00005663572,0.000470585,0.00008821914,0.0001612809,0.0001079371],"domain_scores_gemma":[0.99890107,0.00037109916,0.0003696089,0.00016403655,0.00010196203,0.000092213035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028562214,0.00007715954,0.00038568402,0.00016359854,0.000024481358,0.000012180727,0.00027482412,0.000098112556,0.000013097413],"category_scores_gemma":[0.00014090636,0.000050907653,0.00006935662,0.00009570716,0.00020173007,0.00012008015,0.00012559384,0.00024538115,5.257113e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056776156,0.00036550974,0.013149419,0.00040470847,0.00007785731,0.000032451557,0.0014701486,0.0000019757772,0.2651183,0.7077324,0.00007608636,0.011514414],"study_design_scores_gemma":[0.0017853345,0.0009489477,0.13736339,0.00025080077,0.000065857545,0.0031577502,0.00021061146,0.005414052,0.047022272,0.80344445,0.00012429965,0.00021224849],"about_ca_topic_score_codex":0.0000013074583,"about_ca_topic_score_gemma":0.0000012385714,"teacher_disagreement_score":0.21809603,"about_ca_system_score_codex":0.0000015397954,"about_ca_system_score_gemma":0.000021313392,"threshold_uncertainty_score":0.20759538},"labels":[],"label_agreement":null},{"id":"W2092202686","doi":"10.1515/jmc.2009.008","title":"Another look at some fast modular arithmetic methods","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"Arithmetic; Modular arithmetic; Modular design; Computer science; Algebra over a field; Saturation arithmetic; Mathematics; Programming language; Arbitrary-precision arithmetic; Pure mathematics","score_opus":0.01735023518713309,"score_gpt":0.3037783712800312,"score_spread":0.28642813609289813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092202686","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022982715,0.0009314331,0.9663944,0.00801603,0.0003205993,0.00009777967,3.9927258e-7,0.00004283193,0.0012138156],"genre_scores_gemma":[0.16049814,0.00004663749,0.8377877,0.0014085267,0.0001654876,0.0000017098702,1.2999666e-7,0.000011689511,0.00008001089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977664,0.0003703795,0.00079794676,0.00024736644,0.00039648314,0.0004214613],"domain_scores_gemma":[0.9983754,0.0003621707,0.0004117822,0.00050160906,0.00015524027,0.00019380923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001210031,0.00021109554,0.00065294444,0.0003726829,0.0001080141,0.000074146374,0.0010261306,0.00018158536,0.00008301773],"category_scores_gemma":[0.00026712075,0.00014864416,0.000368042,0.0003647608,0.00010797445,0.00036604228,0.00015044685,0.00038112266,0.00008512928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032266387,0.00064932846,0.00007070025,0.000051237712,0.00012680286,0.00030729434,0.00068790343,0.00009165205,0.01520826,0.9290536,0.0014543642,0.052266575],"study_design_scores_gemma":[0.00073584117,0.00070930773,0.0015908319,0.000059409922,0.000058272355,0.0030426162,0.000052459152,0.0063984124,0.0059847306,0.97965825,0.0014857375,0.00022411036],"about_ca_topic_score_codex":3.1340895e-7,"about_ca_topic_score_gemma":2.0587966e-7,"teacher_disagreement_score":0.13751544,"about_ca_system_score_codex":0.00004780332,"about_ca_system_score_gemma":0.000054883916,"threshold_uncertainty_score":0.60615325},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.034336978482490815,"score_gpt":0.3210987023680869,"score_spread":0.28676172388559606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104145890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08204827,0.00029859392,0.9123619,0.003400884,0.00019054234,0.000058991307,0.0000017315699,0.000018345914,0.0016207416],"genre_scores_gemma":[0.7746815,0.000010394968,0.2250887,0.00016312432,0.00005249507,2.7720026e-7,3.8605953e-7,0.0000025164702,5.752548e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998274,0.00011014491,0.0008928715,0.00013398583,0.00036824742,0.00022070728],"domain_scores_gemma":[0.99844116,0.00025023177,0.0006048671,0.0003550125,0.00020988948,0.0001388452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005662395,0.00011683134,0.00064233877,0.00021237924,0.00003852174,0.000039504874,0.0009575323,0.00012709406,0.000037958733],"category_scores_gemma":[0.0002811441,0.00009493074,0.00021973468,0.00031069998,0.00007946237,0.0003681274,0.00008231144,0.00039960555,0.000014329374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003724013,0.00078798324,0.00017391097,0.000042929736,0.000041048177,0.000016112155,0.0011765301,0.0000072573025,0.0009202861,0.9878827,0.0018275965,0.0070864563],"study_design_scores_gemma":[0.00050004345,0.0011178196,0.0011899025,0.00009767796,0.00003701439,0.00027177137,0.00036351357,0.0019700578,0.0024241214,0.9912785,0.0006269237,0.00012261204],"about_ca_topic_score_codex":5.3262573e-7,"about_ca_topic_score_gemma":9.682108e-7,"teacher_disagreement_score":0.6926333,"about_ca_system_score_codex":0.000016923223,"about_ca_system_score_gemma":0.000056855504,"threshold_uncertainty_score":0.3871163},"labels":[],"label_agreement":null},{"id":"W2114535050","doi":"10.1515/jmc.2010.007","title":"On the asymptotic effectiveness of Weil descent attacks","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo; National Science Foundation","keywords":"Descent (aeronautics); Generalization; Mathematics; Discrete logarithm; Logarithm; Genus; Gradient descent; Pure mathematics; Discrete mathematics; Applied mathematics; Combinatorics; Mathematical analysis; Computer science; Public-key cryptography; Artificial intelligence; Artificial neural network; Computer security","score_opus":0.009872256274622604,"score_gpt":0.2513074244030055,"score_spread":0.24143516812838292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114535050","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6675806,0.000034099194,0.3289383,0.0019425834,0.00052111625,0.00012065304,3.0290093e-7,0.00001008271,0.0008522503],"genre_scores_gemma":[0.9745952,0.000004505158,0.02524746,0.00009528351,0.000046452835,0.0000029809057,3.8676585e-8,0.000005953957,0.0000021075507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848497,0.0003623669,0.000480034,0.00012320736,0.00034267546,0.00020671745],"domain_scores_gemma":[0.9960027,0.0029691749,0.00032963618,0.00041301863,0.00019072379,0.00009479314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018189179,0.00012001086,0.00039214402,0.0001581188,0.00006559825,0.000030816944,0.0009370522,0.00011186649,0.00004604566],"category_scores_gemma":[0.00090507447,0.00006286414,0.00023966478,0.00025678865,0.00017034415,0.000091004746,0.000104786326,0.00058414007,0.000028205466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043188087,0.0003648191,0.00026238765,0.00009636764,0.000059147464,0.00003112986,0.00013836115,0.00001658259,0.008626561,0.98919535,0.00015628421,0.0010098345],"study_design_scores_gemma":[0.00063354225,0.0007225015,0.009976446,0.00020138924,0.000040596533,0.0009162946,0.00004598451,0.0011710436,0.019955466,0.96614146,0.00008109597,0.00011418867],"about_ca_topic_score_codex":4.709352e-7,"about_ca_topic_score_gemma":6.32019e-7,"teacher_disagreement_score":0.3070146,"about_ca_system_score_codex":0.000009768285,"about_ca_system_score_gemma":0.00006589468,"threshold_uncertainty_score":0.2563525},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.014223130582580516,"score_gpt":0.28989185318902166,"score_spread":0.27566872260644115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119589927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13597155,0.000045768953,0.86274236,0.00090767303,0.00011043442,0.00005238432,0.0000063536922,0.000009397744,0.00015408028],"genre_scores_gemma":[0.7632406,0.000007872379,0.23665409,0.000048449703,0.000040751118,4.0466304e-7,0.0000011278413,0.000003499722,0.000003207908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858314,0.000065390144,0.00071936694,0.00011097292,0.0003208898,0.00020027185],"domain_scores_gemma":[0.9980265,0.0010288734,0.00035806792,0.00015611737,0.00026400274,0.0001664628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013527534,0.00008880138,0.00033978684,0.00010694378,0.0000397023,0.000022248549,0.00026843595,0.00008506453,0.000028780883],"category_scores_gemma":[0.0012074292,0.0000685396,0.00006014208,0.00018649125,0.00012613191,0.00020632872,0.000092050985,0.00021304934,0.000011168778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060430415,0.00021669296,0.00027196947,0.000058391382,0.000020156802,0.00010497351,0.00014565983,0.000008285015,0.006329886,0.9872896,0.00086963194,0.0046242923],"study_design_scores_gemma":[0.0016850836,0.0015524927,0.021088077,0.0001734747,0.00008455779,0.0035496235,0.0002570713,0.015679562,0.01916264,0.93592596,0.00059827766,0.00024315123],"about_ca_topic_score_codex":9.838939e-7,"about_ca_topic_score_gemma":6.932215e-7,"teacher_disagreement_score":0.627269,"about_ca_system_score_codex":0.00004469035,"about_ca_system_score_gemma":0.00007069609,"threshold_uncertainty_score":0.27949637},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02216529395055507,"score_gpt":0.2667200353334149,"score_spread":0.2445547413828598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143987151","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70883274,0.00026048254,0.28874236,0.0014652115,0.00025864335,0.00007927491,0.0000015611516,0.00002133372,0.00033838418],"genre_scores_gemma":[0.8527814,0.0000886194,0.14667426,0.00013364873,0.0003063055,0.0000011204487,8.041201e-7,0.000008400646,0.0000054108777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815726,0.00018037703,0.0007551199,0.00018086503,0.00038545002,0.00034094523],"domain_scores_gemma":[0.99809897,0.0006667339,0.0005441258,0.00030120218,0.00022445105,0.00016450128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005370418,0.00016315204,0.0006021764,0.00007054461,0.000092424605,0.000021374915,0.00043483928,0.0001516992,0.0000133929025],"category_scores_gemma":[0.00037127,0.00012944733,0.00013749386,0.00023123845,0.00018401636,0.00015436656,0.00013384706,0.00047423973,0.000014854302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018177382,0.0004804535,0.0022443156,0.000103647646,0.00014067056,0.00047789494,0.0014027765,0.0010016374,0.0005236044,0.98747146,0.004312749,0.0016590111],"study_design_scores_gemma":[0.009457514,0.0057070144,0.01601417,0.0015626826,0.00021361993,0.04506666,0.00074176805,0.30479205,0.004946199,0.6066748,0.0033176027,0.001505909],"about_ca_topic_score_codex":7.514767e-7,"about_ca_topic_score_gemma":5.075924e-7,"teacher_disagreement_score":0.38079664,"about_ca_system_score_codex":0.000038615617,"about_ca_system_score_gemma":0.000048649013,"threshold_uncertainty_score":0.5278709},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Retrievability; Foundation (evidence); Computer science; Cloud computing; Coding (social sciences); Cloud storage; Mathematics; Theoretical computer science; Information retrieval; Statistics; Operating system; Law","score_opus":0.027978865857973833,"score_gpt":0.3078930306575395,"score_spread":0.27991416479956566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144731398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11067745,0.00007161848,0.8856461,0.0028386205,0.00018633719,0.0005042917,0.000049490955,0.000006706466,0.000019390085],"genre_scores_gemma":[0.7375276,0.000002483578,0.26219824,0.000080290076,0.0001176998,0.000045829845,0.000012526729,0.000005832221,0.000009484833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825466,0.00016948205,0.00092458894,0.00015732145,0.00030129676,0.00019263903],"domain_scores_gemma":[0.99370986,0.003904496,0.0008865467,0.00040156412,0.0010332345,0.00006432317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021190243,0.000110040965,0.0005488437,0.00021806896,0.0001119469,0.000043906995,0.0007689121,0.00009746201,0.00010953512],"category_scores_gemma":[0.0032615673,0.00007281938,0.00043166208,0.00050193764,0.00017834287,0.0003246504,0.00011504921,0.00015236417,0.000001858472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004440156,0.00022809813,0.00006137729,0.00013626809,0.00069975364,3.3359154e-7,0.00048705528,0.00023624832,0.0008390418,0.99488926,0.0010968422,0.0012813241],"study_design_scores_gemma":[0.0004780646,0.00024392613,0.0007263257,0.000025940184,0.00060087594,0.000026137492,0.0001735136,0.19954537,0.0014313958,0.79621035,0.0004571922,0.00008093282],"about_ca_topic_score_codex":0.0000019653692,"about_ca_topic_score_gemma":0.00000597147,"teacher_disagreement_score":0.6268502,"about_ca_system_score_codex":0.0000573313,"about_ca_system_score_gemma":0.0001658323,"threshold_uncertainty_score":0.39046365},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02101922251094666,"score_gpt":0.31189004347894705,"score_spread":0.2908708209680004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172194269","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00864895,0.00004037775,0.9857323,0.0022333092,0.00015489451,0.000377807,1.8404488e-7,0.000028214605,0.0027839195],"genre_scores_gemma":[0.45341802,0.0000021798999,0.54551774,0.0007231118,0.00011095151,0.000015169869,7.8514276e-8,0.000011848881,0.00020089453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850893,0.000064436565,0.00069208955,0.00013740157,0.0003192752,0.000277866],"domain_scores_gemma":[0.9985362,0.00032799362,0.00047734816,0.00034549396,0.00018783148,0.0001250896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010776778,0.00010453778,0.00029271166,0.00012446688,0.000053607313,0.00002298125,0.00073441083,0.0000912202,0.0001716404],"category_scores_gemma":[0.0003859099,0.00007845447,0.00010897056,0.00016155,0.000068281726,0.00027323986,0.00018903107,0.00020972113,0.00029986998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028972638,0.00020021894,0.00018331662,0.000028759341,0.000018269433,0.000091901165,0.0004874621,0.0000031258621,0.0022009122,0.9928493,0.00048687705,0.0034208794],"study_design_scores_gemma":[0.00051486486,0.00017141117,0.00045161825,0.000029827914,0.000008219312,0.0012494453,0.00004424254,0.00057354546,0.011091897,0.98189175,0.003869713,0.00010347205],"about_ca_topic_score_codex":8.102655e-8,"about_ca_topic_score_gemma":7.3915385e-7,"teacher_disagreement_score":0.44476905,"about_ca_system_score_codex":0.00008068726,"about_ca_system_score_gemma":0.00004054445,"threshold_uncertainty_score":0.3854322},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03915340734756542,"score_gpt":0.3104437271759212,"score_spread":0.27129031982835583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295167940","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060089163,0.00027059377,0.9370512,0.00089664455,0.0010312856,0.00028070877,0.000024845733,0.000022885257,0.00033268752],"genre_scores_gemma":[0.29863447,0.000016632892,0.7010592,0.00006316578,0.00020809037,0.0000041296034,0.0000017588798,0.000010586607,0.0000019054905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99665046,0.00032967393,0.0016993803,0.0004065701,0.00059568096,0.00031823793],"domain_scores_gemma":[0.9953213,0.00041693577,0.0018538495,0.0013045168,0.0009062568,0.00019718883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022184807,0.0002845469,0.0012211638,0.00030035333,0.000041475483,0.00006134636,0.002399079,0.000560845,0.00008890754],"category_scores_gemma":[0.002082991,0.00021424759,0.00058624544,0.00028185456,0.0003371816,0.00026276667,0.0018130715,0.0011308743,0.00001376258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005498419,0.007449652,0.002626715,0.0069883107,0.001025322,0.00024813233,0.004860306,0.00003206728,0.0017650415,0.9519231,0.014049364,0.0084821945],"study_design_scores_gemma":[0.00068086415,0.0006042341,0.0011646713,0.00034325029,0.000091920854,0.00031781182,0.000052097454,0.0065564024,0.004820596,0.98468536,0.00042627065,0.00025650373],"about_ca_topic_score_codex":0.000002041493,"about_ca_topic_score_gemma":0.0000023930716,"teacher_disagreement_score":0.23854531,"about_ca_system_score_codex":0.000046811645,"about_ca_system_score_gemma":0.00034374866,"threshold_uncertainty_score":0.8736763},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.12053861076230735,"score_gpt":0.2851397040136409,"score_spread":0.16460109325133357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408559501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13741124,0.00018514582,0.85367656,0.0075692483,0.00046128186,0.00014740201,1.3661e-7,0.00002464798,0.00052432145],"genre_scores_gemma":[0.60046536,0.000007755537,0.39889687,0.00031250273,0.00029271567,0.0000033921194,2.2389882e-7,0.000009809284,0.0000113402975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979757,0.00028054454,0.0007940444,0.00019530089,0.00040870992,0.000345696],"domain_scores_gemma":[0.9985148,0.0003459379,0.00030396017,0.0003484104,0.00016903112,0.00031788019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013509906,0.0001413664,0.0004662578,0.00026117777,0.000022814762,0.00004773293,0.00070890645,0.00017946359,0.000004803609],"category_scores_gemma":[0.00083758705,0.0001143181,0.00008476316,0.00045902558,0.000037341797,0.00020945395,0.00017350008,0.00045258025,0.00006121861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025702172,0.0009237685,0.0012157571,0.00006874857,0.00006637244,0.00074413005,0.00775073,0.37097183,0.000044091455,0.59177405,0.008010593,0.018172897],"study_design_scores_gemma":[0.0010524698,0.00058827834,0.0003758908,0.00017251036,0.000014413678,0.0015207139,0.0006641596,0.8748811,0.00028032914,0.119552806,0.0006539592,0.00024338983],"about_ca_topic_score_codex":0.00000128394,"about_ca_topic_score_gemma":0.000004113659,"teacher_disagreement_score":0.50390923,"about_ca_system_score_codex":0.000106730695,"about_ca_system_score_gemma":0.00007361963,"threshold_uncertainty_score":0.46617568},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; 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","score_opus":0.010639594115355061,"score_gpt":0.2518685554776877,"score_spread":0.24122896136233266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562444902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014580113,0.0003693917,0.97338206,0.010526653,0.0002069676,0.000062063096,0.0000125879515,0.000039489285,0.0008206977],"genre_scores_gemma":[0.65258414,0.000059452675,0.34630302,0.00076438434,0.00026570112,0.0000023359833,0.000001698551,0.00000923455,0.000010030581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850607,0.00012432283,0.00056879537,0.00017936123,0.0003815008,0.00023993042],"domain_scores_gemma":[0.9982869,0.0004888403,0.0003801273,0.00036150235,0.00031437154,0.00016826388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005730817,0.00013845439,0.00038061425,0.0001973164,0.00005588263,0.000048424958,0.0009510654,0.00016651543,0.00028148835],"category_scores_gemma":[0.0006471693,0.00007656834,0.00018010568,0.0002825846,0.000078918965,0.00062204374,0.00015872827,0.00026467568,0.00008897304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020030204,0.00012964621,0.0001264025,0.000032692064,0.00005053329,0.00009455434,0.0000776841,1.4982633e-7,0.003789798,0.9802401,0.01353357,0.00190485],"study_design_scores_gemma":[0.0006328703,0.00025163702,0.0004739671,0.00016259823,0.000020315008,0.0010781471,0.000018730396,0.00004315711,0.0011003,0.98273927,0.013348084,0.00013091983],"about_ca_topic_score_codex":5.8487892e-8,"about_ca_topic_score_gemma":2.3967104e-7,"teacher_disagreement_score":0.638004,"about_ca_system_score_codex":0.000021950056,"about_ca_system_score_gemma":0.00008247386,"threshold_uncertainty_score":0.31223664},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.04044575581766818,"score_gpt":0.305518014241802,"score_spread":0.26507225842413384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794450234","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13760144,0.00036045877,0.85919195,0.002274789,0.00011834979,0.00005636423,0.0000021978697,0.00004440391,0.00035005546],"genre_scores_gemma":[0.4909168,0.000026290754,0.50892043,0.0000986127,0.000022261067,9.1543757e-7,1.518179e-7,0.000003917524,0.000010642114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988588,0.000056410932,0.00055584236,0.00014096606,0.00021251742,0.00017542759],"domain_scores_gemma":[0.998526,0.00025908125,0.00043171854,0.00044074323,0.00028843456,0.000054036092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010075601,0.00009209314,0.0003881682,0.00013805008,0.000035197707,0.000016268234,0.0006748619,0.00008253641,0.00001994601],"category_scores_gemma":[0.0013691193,0.00006571337,0.000041578776,0.00019971836,0.00025793066,0.0002672177,0.00041975337,0.00016376804,0.000009382419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000533994,0.00022588299,0.0015589432,0.00009572806,0.00007307744,0.000057402158,0.0002762992,0.0000016357917,0.0029650654,0.9804362,0.0069294716,0.0073269135],"study_design_scores_gemma":[0.00085096154,0.0020652832,0.002438051,0.00013623352,0.000021436052,0.00095507485,0.00017106757,0.0043667243,0.018692348,0.96581644,0.0042753792,0.00021100199],"about_ca_topic_score_codex":0.0000010581165,"about_ca_topic_score_gemma":0.0000028786471,"teacher_disagreement_score":0.35331535,"about_ca_system_score_codex":0.0000172725,"about_ca_system_score_gemma":0.0000432598,"threshold_uncertainty_score":0.26797134},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; London Mathematical Society","keywords":"Equivalence (formal languages); Authentication (law); Computer science; Secret sharing; Theoretical computer science; Mathematics; Discrete mathematics; Computer security; Cryptography","score_opus":0.062021590250013615,"score_gpt":0.2836574490103651,"score_spread":0.2216358587603515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979325266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1200235,0.00035997803,0.851594,0.027074073,0.000271391,0.00016331598,0.0000031039433,0.00002492753,0.000485716],"genre_scores_gemma":[0.9258237,0.000070261616,0.073555976,0.00046360804,0.00006830873,0.0000054323996,2.9701283e-7,0.000008662437,0.0000037642099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824256,0.00023140856,0.00073254964,0.00024230836,0.00037823798,0.0001729352],"domain_scores_gemma":[0.99706167,0.0012276297,0.0008806216,0.0005295938,0.00019581475,0.00010465105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00126221,0.00019159167,0.00059282104,0.0001583431,0.000062997846,0.00008021621,0.0014258557,0.00017935509,0.00003339847],"category_scores_gemma":[0.0008725004,0.000119019714,0.00023174433,0.0001657962,0.00024313095,0.000085700034,0.00081180275,0.00077942334,0.0000074793797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041115447,0.00011692889,0.000020016078,0.00027242082,0.00009292867,0.000011930946,0.0006653564,0.00005887638,0.00063388824,0.9969357,0.0005948814,0.0005559045],"study_design_scores_gemma":[0.00014615209,0.00028849713,0.00008478449,0.0004328543,0.00006666521,0.00010895788,0.000093732924,0.010530382,0.0012439259,0.98684114,0.000055345725,0.00010753691],"about_ca_topic_score_codex":1.9938156e-7,"about_ca_topic_score_gemma":9.9112235e-8,"teacher_disagreement_score":0.8058002,"about_ca_system_score_codex":0.000012959992,"about_ca_system_score_gemma":0.000084191845,"threshold_uncertainty_score":0.4853483},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009955474349203255,"score_gpt":0.2534273374824649,"score_spread":0.24347186313326163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979943645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49540928,0.00013861049,0.50297576,0.0007563891,0.00022602156,0.00006548196,0.000003381663,0.000009359292,0.00041570837],"genre_scores_gemma":[0.7975557,0.00001752115,0.20233224,0.000030922758,0.00005100554,8.1248817e-7,8.7506083e-7,0.0000039037905,0.000007007671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998969,0.000072428964,0.0004910299,0.00011781847,0.00019915705,0.00015056731],"domain_scores_gemma":[0.99887824,0.00024033691,0.00033781605,0.00032923982,0.0001302603,0.00008413006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004892157,0.00008036567,0.000315379,0.0001727479,0.000037103662,0.000040797688,0.00050914416,0.000082667495,0.000091411806],"category_scores_gemma":[0.00025471652,0.00006436867,0.00009141199,0.00020163642,0.000040255592,0.0005677425,0.0002635829,0.00018327453,0.000017259108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014788061,0.000405801,0.005059743,0.00041419026,0.00012168502,0.00001743879,0.0013757548,0.000056138157,0.009761756,0.9725208,0.007908535,0.0022102718],"study_design_scores_gemma":[0.0034975803,0.001889103,0.0094101885,0.0003051151,0.0001372783,0.002177001,0.0011603911,0.04255714,0.0055119595,0.92433316,0.00855409,0.00046698842],"about_ca_topic_score_codex":0.000004195228,"about_ca_topic_score_gemma":9.357419e-7,"teacher_disagreement_score":0.3021464,"about_ca_system_score_codex":0.000010642493,"about_ca_system_score_gemma":0.000054316642,"threshold_uncertainty_score":0.26248783},"labels":[],"label_agreement":null},{"id":"W3036444063","doi":"10.1515/jmc-2015-0056","title":"New Techniques for SIDH-based NIKE","year":2020,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; York University; University of Toronto","funders":"Canada First Research Excellence Fund; Public Works and Government Services Canada; Royal Bank of Canada","keywords":"Key exchange; Computer science; Isogeny; Adversary; Key (lock); Computer security; Public-key cryptography; Protocol (science); Nike; Cryptography; Diffie–Hellman key exchange; Mathematics; Elliptic curve; Advertising","score_opus":0.02557958490615122,"score_gpt":0.27494622182961026,"score_spread":0.24936663692345903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036444063","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058944063,0.000115155475,0.9543043,0.044272225,0.000109921246,0.00013462694,6.094406e-7,0.000056993205,0.0004167781],"genre_scores_gemma":[0.075525075,0.0000046206596,0.92182547,0.0023312976,0.00029548135,0.000003814501,1.4955896e-7,0.000008574682,0.000005530537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988602,0.000058220216,0.000509126,0.00014457709,0.00021303086,0.00021483951],"domain_scores_gemma":[0.9987284,0.00041495083,0.000266447,0.00017735965,0.00014681986,0.00026601765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031621126,0.00011528729,0.00038552747,0.00012570451,0.00004583678,0.000051291907,0.00075029867,0.000105495514,0.000030037334],"category_scores_gemma":[0.00046962846,0.00008259074,0.00027713302,0.0002536002,0.000035805133,0.00014620021,0.00006350463,0.0002038742,0.000014389465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114373564,0.00019216003,0.000071591654,0.00022285937,0.00007920842,0.00009459559,0.00051870756,0.000023878278,0.003562899,0.9134238,0.03352685,0.048169106],"study_design_scores_gemma":[0.0013714595,0.0023020266,0.000094211544,0.00009810327,0.00007258924,0.00041515983,0.000072417206,0.013614245,0.031119233,0.9262939,0.024283588,0.0002630596],"about_ca_topic_score_codex":3.3439744e-7,"about_ca_topic_score_gemma":2.0269202e-7,"teacher_disagreement_score":0.07493563,"about_ca_system_score_codex":0.000009677526,"about_ca_system_score_gemma":0.00015860364,"threshold_uncertainty_score":0.33679527},"labels":[],"label_agreement":null},{"id":"W3036855880","doi":"10.1515/jmc-2015-0057","title":"A subexponential-time, polynomial quantum space algorithm for inverting the CM group action","year":2020,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Canada First Research Excellence Fund; Public Works and Government Services Canada; Royal Bank of Canada","keywords":"Isogeny; Mathematics; Polynomial; Group (periodic table); Quantum algorithm; Action (physics); Quantum computer; Time complexity; Quantum; Cryptosystem; Multiplication (music); Group action; Discrete mathematics; Space (punctuation); Algorithm; Algebra over a field; Elliptic curve; Combinatorics; Pure mathematics; Computer science; Cryptography; Mathematical analysis; Quantum mechanics; Physics","score_opus":0.03095288594065633,"score_gpt":0.2680828124425766,"score_spread":0.23712992650192027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036855880","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0145295905,0.00013419086,0.958973,0.025621459,0.00041202272,0.0002256225,0.0000012202581,0.00003459966,0.000068288726],"genre_scores_gemma":[0.22976388,0.00002901679,0.7677798,0.0013360544,0.0010379485,0.000021408892,7.041799e-7,0.000023055776,0.0000081026365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839884,0.00018638087,0.0006243945,0.00018842082,0.00029326792,0.00030872133],"domain_scores_gemma":[0.99834955,0.00065908296,0.00046898285,0.00020623446,0.00013621188,0.00017992935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007159672,0.00014836655,0.00040861912,0.000106383675,0.00017530611,0.00010478609,0.0008045471,0.00011501735,0.000022603714],"category_scores_gemma":[0.00046854562,0.00009245505,0.00034311574,0.00031341964,0.000088691144,0.00028029043,0.00014856854,0.00034340247,0.000034576275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046549327,0.0008518602,0.0000709651,0.00037462031,0.00063908694,0.00019900933,0.005181497,0.00007742339,0.061879057,0.69819975,0.038906097,0.19315514],"study_design_scores_gemma":[0.0023102749,0.0021308078,0.00019198022,0.000088402245,0.0001843273,0.0015385925,0.00086450926,0.7086035,0.004739522,0.2712803,0.0077035963,0.00036419075],"about_ca_topic_score_codex":0.0000015177827,"about_ca_topic_score_gemma":4.698424e-7,"teacher_disagreement_score":0.7085261,"about_ca_system_score_codex":0.00001819993,"about_ca_system_score_gemma":0.000059685866,"threshold_uncertainty_score":0.37702075},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.018942253248732804,"score_gpt":0.2340439368169824,"score_spread":0.2151016835682496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081150612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3322114,0.00028986463,0.6574125,0.008097947,0.00055263384,0.00017322143,0.0000038042017,0.00015526579,0.0011033373],"genre_scores_gemma":[0.9561553,0.00011332215,0.03743077,0.0050845505,0.001129933,0.000007344858,0.0000024231044,0.000059599886,0.00001672528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99634206,0.00036593765,0.0012741071,0.00054077123,0.0007416282,0.00073549943],"domain_scores_gemma":[0.9967338,0.00071666914,0.0006289967,0.00067201327,0.00036874137,0.0008798096],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008619595,0.00044874017,0.0009886441,0.00030815386,0.0002380433,0.00022340768,0.0015211572,0.00032757552,0.00013165816],"category_scores_gemma":[0.000778042,0.00038040528,0.00060736947,0.0013699128,0.00015182665,0.0007067247,0.00045223726,0.0010423986,0.00073610863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065376284,0.0008717635,0.00038994427,0.00029749933,0.0006410152,0.0006069684,0.0032112505,0.00077447644,0.23501109,0.55778754,0.15130334,0.048451368],"study_design_scores_gemma":[0.0045664576,0.004215458,0.00041056215,0.00039654053,0.00060443254,0.0040247124,0.00057084364,0.016548924,0.16440473,0.77802104,0.02467651,0.0015598084],"about_ca_topic_score_codex":6.090407e-7,"about_ca_topic_score_gemma":0.0000011733031,"teacher_disagreement_score":0.6239439,"about_ca_system_score_codex":0.000052456562,"about_ca_system_score_gemma":0.00034824744,"threshold_uncertainty_score":0.9998648},"labels":[],"label_agreement":null},{"id":"W3111886287","doi":"10.1515/jmc-2020-0071","title":"Towards Isogeny-Based Password-Authenticated Key Establishment","year":2020,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund; Public Works and Government Services Canada; Royal Bank of Canada","keywords":"Password; Computer science; Key exchange; Zero-knowledge password proof; Authenticated Key Exchange; Computer security; Cryptography; Cryptographic primitive; Key (lock); Password strength; Public-key cryptography; Theoretical computer science; One-time password; Cryptographic protocol; Encryption","score_opus":0.024331022819154207,"score_gpt":0.25355519293764867,"score_spread":0.22922417011849447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111886287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024604367,0.00019118076,0.9286432,0.045316983,0.00024824875,0.000108078784,0.0000012462823,0.000059287624,0.0008273828],"genre_scores_gemma":[0.7185555,0.0000096986905,0.27957052,0.0017337048,0.00011379221,0.0000030500132,3.9483126e-7,0.000010581712,0.0000027351346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979541,0.00017126011,0.0007918914,0.00022915528,0.0005053828,0.00034823795],"domain_scores_gemma":[0.9984527,0.00022000431,0.0003902253,0.00030863544,0.000238759,0.00038965014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049688586,0.00018355376,0.0005310074,0.00019106567,0.00006721317,0.00011451044,0.0011485459,0.0001283539,0.0001153531],"category_scores_gemma":[0.0005175076,0.00013130037,0.00031552016,0.00060431974,0.0000899341,0.00022418518,0.00016172354,0.00037831333,0.000088407935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019907068,0.0013640992,0.0004920509,0.00041571775,0.00036686892,0.0010178381,0.0038662944,0.00020827143,0.00538952,0.9525849,0.009359152,0.024736207],"study_design_scores_gemma":[0.005202864,0.0036455076,0.0020430873,0.00028510878,0.0003668315,0.0014832448,0.0006861441,0.12534276,0.026340945,0.8203592,0.013260137,0.0009842085],"about_ca_topic_score_codex":6.8914306e-7,"about_ca_topic_score_gemma":2.1535034e-7,"teacher_disagreement_score":0.69395113,"about_ca_system_score_codex":0.000022483016,"about_ca_system_score_gemma":0.00017860763,"threshold_uncertainty_score":0.5354274},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada)","funders":"","keywords":"Cryptanalysis; Linear cryptanalysis; Computer science; Impossible differential cryptanalysis; Computer security; Cryptography","score_opus":0.01518316274001528,"score_gpt":0.2579301987313154,"score_spread":0.24274703599130013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211129862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055586223,0.00015709386,0.9392299,0.0036005976,0.00026875528,0.000065383065,0.000001947971,0.000020442068,0.0010696788],"genre_scores_gemma":[0.79734993,0.0000057982547,0.20226638,0.00026838103,0.000061739884,0.0000048912184,3.9530934e-7,0.000009168692,0.00003330405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754393,0.00034626774,0.0009774308,0.00016074731,0.00074430095,0.0002273383],"domain_scores_gemma":[0.9979739,0.00040217716,0.00086211995,0.0003891646,0.00025778485,0.00011486069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014396464,0.000121487705,0.00058030273,0.00040422703,0.000089946705,0.0000229735,0.0011315679,0.000046771478,0.00049834384],"category_scores_gemma":[0.00044856165,0.00010260036,0.0003221727,0.0006166746,0.00006083979,0.00019838892,0.0003708219,0.00041590026,0.000024537823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012927123,0.0011126992,0.0001894913,0.0001329987,0.00029391647,0.00040766838,0.0012578769,0.0025269133,0.030902956,0.9481654,0.0037747864,0.011106007],"study_design_scores_gemma":[0.0016357689,0.0018774989,0.0004454538,0.000047694964,0.000211613,0.0041947733,0.00082948245,0.055493955,0.008224366,0.92404646,0.002663546,0.00032940946],"about_ca_topic_score_codex":0.0000015535211,"about_ca_topic_score_gemma":3.9935372e-7,"teacher_disagreement_score":0.7417637,"about_ca_system_score_codex":0.00010096961,"about_ca_system_score_gemma":0.00015159018,"threshold_uncertainty_score":0.54565156},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05729437724278092,"score_gpt":0.3073742563585063,"score_spread":0.2500798791157254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226062551","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018096535,0.0002040839,0.97356975,0.0061224955,0.0014076012,0.0002110332,0.000041679046,0.00017032993,0.00017647965],"genre_scores_gemma":[0.17248376,0.0000636399,0.8265272,0.00041588928,0.00042424613,0.000021022894,0.00002069034,0.000038572536,0.0000049952896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966214,0.0003089426,0.0013898914,0.00047742628,0.0007447283,0.0004576552],"domain_scores_gemma":[0.9962851,0.00066072296,0.0012638599,0.001068722,0.00044382262,0.0002777937],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018046107,0.00036176518,0.0010599535,0.0006610954,0.0000836213,0.0002220276,0.0023668944,0.00039805463,0.00005958336],"category_scores_gemma":[0.00092482474,0.00030260687,0.00067796704,0.0003327019,0.00011878534,0.0002710805,0.0011570518,0.0015842078,0.00022262271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009539182,0.00071654,0.00012676338,0.0009620377,0.00024794036,0.0008980282,0.00026685337,0.00035803832,0.0004974131,0.9736672,0.020759022,0.0014047634],"study_design_scores_gemma":[0.00062477874,0.00026607586,0.00014461606,0.00039946544,0.00006713115,0.0004391733,0.00003216537,0.043093808,0.0006415702,0.95284796,0.0011284635,0.00031482274],"about_ca_topic_score_codex":0.0000019724628,"about_ca_topic_score_gemma":0.0000021024264,"teacher_disagreement_score":0.15438722,"about_ca_system_score_codex":0.00007494834,"about_ca_system_score_gemma":0.00046198315,"threshold_uncertainty_score":0.9999426},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02542509089501993,"score_gpt":0.279011769400209,"score_spread":0.25358667850518907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320925590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0673364,0.00013386417,0.92110074,0.007677382,0.00076183944,0.00010321752,0.000003162768,0.00009962881,0.0027837767],"genre_scores_gemma":[0.83207786,0.000087233566,0.16707802,0.00049602834,0.00022868998,0.00000500231,0.0000017026094,0.000011161823,0.000014313985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983351,0.00012281991,0.00061572745,0.00016334411,0.00043565733,0.0003273105],"domain_scores_gemma":[0.9985914,0.00038675914,0.00031369846,0.0003946865,0.00013202406,0.00018140598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010421238,0.00012660972,0.00036719543,0.00034038594,0.00007206967,0.00007215199,0.0009443369,0.00009573161,0.00011556186],"category_scores_gemma":[0.00044839398,0.000095032294,0.00019550895,0.0006387497,0.00005057135,0.00038488267,0.0002492289,0.00031095406,0.0005839485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020387011,0.00017483004,0.00011395642,0.000059970847,0.000053604505,0.00030136455,0.0008789828,0.000007718216,0.00028535043,0.9771434,0.019368304,0.0015921391],"study_design_scores_gemma":[0.00060117105,0.00037312615,0.0011018008,0.000050914958,0.00002697188,0.001078162,0.00025270478,0.0032886663,0.0003268446,0.9844335,0.008315172,0.00015096551],"about_ca_topic_score_codex":6.148007e-7,"about_ca_topic_score_gemma":0.000002020658,"teacher_disagreement_score":0.7647414,"about_ca_system_score_codex":0.000021450043,"about_ca_system_score_gemma":0.000065971995,"threshold_uncertainty_score":0.7505672},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Dihedral group; Coset; Quantum algorithm; Mathematics; Dihedral angle; Discrete mathematics; Quantum; Algorithm; Pure mathematics; Group (periodic table); Quantum mechanics","score_opus":0.01215892878859508,"score_gpt":0.26512857328252964,"score_spread":0.25296964449393455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392878815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010320195,0.002336203,0.9676427,0.015989732,0.0009152377,0.00009860144,0.0000019759646,0.00007635137,0.002618992],"genre_scores_gemma":[0.64066166,0.00019580603,0.3583683,0.00025085537,0.00047410684,0.000007738254,5.886178e-7,0.000015282008,0.000025631329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851686,0.00012963622,0.00057741796,0.00015377496,0.0003346889,0.00028762364],"domain_scores_gemma":[0.9985163,0.0007799987,0.00014152503,0.00034285957,0.000096501455,0.00012278798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011822279,0.00011669934,0.0002536932,0.00012086136,0.00012899956,0.0003786848,0.0011761526,0.00008354484,0.00002686625],"category_scores_gemma":[0.00017846825,0.00006234805,0.00022611368,0.00034657004,0.00010413142,0.0004905431,0.00021407692,0.00044107626,0.000104898725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009532395,0.00005562973,0.000020759153,0.000056410445,0.000050146966,0.00015060781,0.00041604476,3.374633e-7,0.00010012035,0.9757548,0.009010905,0.014374707],"study_design_scores_gemma":[0.00012368397,0.0001785791,0.00008972273,0.00006679125,0.0000207193,0.0017964229,0.00009389564,0.0021703227,0.00010025839,0.9709809,0.024298497,0.00008024236],"about_ca_topic_score_codex":5.802695e-7,"about_ca_topic_score_gemma":0.0000019686852,"teacher_disagreement_score":0.6303415,"about_ca_system_score_codex":0.000020255893,"about_ca_system_score_gemma":0.00009221123,"threshold_uncertainty_score":0.36516663},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; National Research Council Canada","funders":"University of Waterloo; Impact Fund; Silicon Valley Community Foundation","keywords":"Hash function; Computer science; Computer security; Theoretical computer science","score_opus":0.03226791542826929,"score_gpt":0.32149749840684977,"score_spread":0.2892295829785805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404803098","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026371522,0.0008909206,0.9645659,0.006932703,0.00044855586,0.000061272454,0.0000035218502,0.00006700846,0.0006586307],"genre_scores_gemma":[0.4891352,0.00002214545,0.5100257,0.0004322242,0.00036663335,0.0000013505214,5.4996264e-7,0.0000118586,0.0000043264345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984501,0.00012370916,0.00058611104,0.00019789534,0.0003326101,0.0003095975],"domain_scores_gemma":[0.9987666,0.00040893845,0.00019898516,0.00034487527,0.00011829504,0.00016227609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008898104,0.00014391304,0.0003954319,0.000501478,0.00007259834,0.0002312976,0.0007544266,0.00012097147,0.00005662397],"category_scores_gemma":[0.00032196153,0.00010720228,0.00023149326,0.0006720956,0.00007719867,0.00058899046,0.00012557833,0.00036839317,0.000051864616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012893243,0.0001350639,0.000052434865,0.00028254054,0.000050019848,0.0002390472,0.00031495243,0.000052006384,0.0008576502,0.9946287,0.0014533147,0.0019213645],"study_design_scores_gemma":[0.00032756335,0.00027255947,0.00005468359,0.0003991546,0.000053038446,0.0017326961,0.00007626299,0.1322916,0.0010524718,0.8567688,0.0067865555,0.0001846237],"about_ca_topic_score_codex":0.0000046598548,"about_ca_topic_score_gemma":0.0000015894486,"teacher_disagreement_score":0.4627637,"about_ca_system_score_codex":0.00004550331,"about_ca_system_score_gemma":0.0003451306,"threshold_uncertainty_score":0.4371582},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.017181849297748342,"score_gpt":0.2836623500587121,"score_spread":0.26648050076096375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405324345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008500132,0.0008307436,0.9804484,0.0059917285,0.0006982708,0.00003945354,7.3274833e-7,0.000095914496,0.0033946221],"genre_scores_gemma":[0.8532384,0.000021242464,0.14585273,0.00017289954,0.00058778166,0.0000026920811,2.3565828e-7,0.00001207496,0.00011191892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998714,0.00014212483,0.00054077554,0.00016073181,0.00022565859,0.00021670472],"domain_scores_gemma":[0.99887615,0.00051146577,0.00013729626,0.00024876307,0.00010723017,0.00011908364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010506713,0.000112544425,0.00029281556,0.0002598861,0.000081111204,0.00020770301,0.0005232118,0.00007322474,0.00010014151],"category_scores_gemma":[0.0003270662,0.00007931113,0.00028460065,0.00042397605,0.00004955216,0.00041458005,0.000111368405,0.00039777425,0.0001607874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010499383,0.000032046897,0.000011069174,0.00008518669,0.000063224834,0.00018698168,0.0002902811,0.0000053388194,0.0005031667,0.9724413,0.0008680485,0.025502829],"study_design_scores_gemma":[0.00015848971,0.0002903633,0.000106620835,0.00032662388,0.00005979824,0.0026893488,0.0001591672,0.010252598,0.00016930929,0.9785846,0.0070705945,0.00013249561],"about_ca_topic_score_codex":1.0414752e-7,"about_ca_topic_score_gemma":5.5068337e-8,"teacher_disagreement_score":0.8447383,"about_ca_system_score_codex":0.00001734474,"about_ca_system_score_gemma":0.000061021234,"threshold_uncertainty_score":0.32342142},"labels":[],"label_agreement":null}]}