{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":21,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":21,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"a5e740faf4ed","filters":{"venue":"Journal of Cryptology"}},"results":[{"id":"W2018263239","doi":"10.1007/s00145-004-0142-y","title":"Efficient Quantum Key Distribution Scheme and a Proof of Its Unconditional Security","year":2004,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":558,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Ontario Innovation Trust","keywords":"Eavesdropping; Quantum key distribution; BB84; Mathematical proof; Mathematics; Scheme (mathematics); Key (lock); Theoretical computer science; Security analysis; Computer science; Quantum cryptography; Quantum; Computer security; Quantum information; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.00828184864086077,"gpt":0.2410252201249297,"spread":0.232743371484069,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003487651,0.0000814387,0.0002069928,0.0001659832,0.00005889436,0.00002480131,0.0002519999,0.0000702409,0.00001597319],"category_scores_gemma":[0.00008499991,0.00006707339,0.00009207749,0.0002739159,0.0001116615,0.0002536728,0.00005757981,0.0001702571,0.00000367144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003136097,"about_ca_system_score_gemma":0.0001639939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.077007e-7,"about_ca_topic_score_gemma":8.332024e-7,"domain_scores_codex":[0.9989491,0.00003991936,0.0004995538,0.00008287327,0.000283608,0.000144974],"domain_scores_gemma":[0.9988286,0.00004081463,0.0005341015,0.0001045121,0.000399714,0.00009224678],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003054311,0.0001474582,0.0002252189,0.00003600521,0.00002508755,0.0000102816,0.0005817125,0.00109576,0.0004100653,0.9968157,0.0002642447,0.000357904],"study_design_scores_gemma":[0.009118514,0.003214658,0.03325018,0.00036162,0.00006364823,0.004764538,0.000489643,0.156811,0.05606895,0.7236795,0.01152663,0.0006511165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6375831,0.000242659,0.3605256,0.001279208,0.0001956367,0.00004895308,0.00001104564,0.000007754349,0.0001059858],"genre_scores_gemma":[0.993115,0.00001322403,0.006716691,0.0001157756,0.00003092402,0.000001288148,0.000004896397,0.00000183793,3.641156e-7],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3555319,"threshold_uncertainty_score":0.2735173,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021553056","doi":"10.1007/s00145-009-9048-z","title":"A Taxonomy of Pairing-Friendly Elliptic Curves","year":2009,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":467,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"National Defense Science and Engineering Graduate; Division of Mathematical Sciences; Directorate for Mathematical and Physical Sciences; Science Foundation Ireland; National Science Foundation","keywords":"Pairing; Embedding; Elliptic curve; Mathematics; Cryptography; Computer science; Pure mathematics; Theoretical computer science; Physics; Algorithm; Artificial intelligence; Superconductivity; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.01443367674452202,"gpt":0.2395251486617141,"spread":0.2250914719171921,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004036181,0.000100059,0.0003580968,0.0003087908,0.00003788587,0.00001717755,0.0007478212,0.00006566974,0.00002308457],"category_scores_gemma":[0.00008509577,0.00007733605,0.000216036,0.0003864318,0.0001020197,0.0002773457,0.00004469002,0.0002171094,0.000004864093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001002116,"about_ca_system_score_gemma":0.00009932247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001620893,"about_ca_topic_score_gemma":0.000001038389,"domain_scores_codex":[0.9988146,0.0001018016,0.0005368023,0.0001201679,0.0002163292,0.0002102488],"domain_scores_gemma":[0.9987715,0.0001426506,0.0005174169,0.0002643674,0.0002100678,0.00009399952],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001668566,0.001317808,0.01335418,0.0002795529,0.0003426105,0.0007821125,0.0009056068,0.0004314292,0.01171658,0.7484346,0.02674146,0.1955272],"study_design_scores_gemma":[0.007494398,0.01934653,0.31443,0.002218467,0.0004314538,0.01299345,0.0003156297,0.003656114,0.04558697,0.3818406,0.2100942,0.001592188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1304608,0.009470779,0.8500555,0.006815521,0.0006570779,0.0001334931,5.840767e-7,0.0000280413,0.002378224],"genre_scores_gemma":[0.8926212,0.0004790401,0.1062566,0.0005490644,0.00008107111,0.000001084594,1.008457e-7,0.000002935869,0.000008872351],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7621604,"threshold_uncertainty_score":0.3153673,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000932900","doi":"10.1007/s00145-007-9002-x","title":"Cryptographic Hash Functions from Expander Graphs","year":2007,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":366,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Hash function; Collision resistance; Expander graph; Mathematics; Ramanujan's sum; Double hashing; Discrete mathematics; Rolling hash; SWIFFT; Combinatorics; Perfect hash function; Cryptographic hash function; Cryptography; Graph; Computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.05928752648007167,"gpt":0.3675170399643483,"spread":0.3082295134842766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00186221,0.0001503511,0.0004759072,0.0006042474,0.0001121149,0.00002493691,0.0003567385,0.0001889616,0.001919042],"category_scores_gemma":[0.0007527929,0.0001197813,0.0003248038,0.0004227271,0.0002851997,0.000145193,0.00005647363,0.0006344664,0.00007470865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003951889,"about_ca_system_score_gemma":0.00009823707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001433029,"about_ca_topic_score_gemma":0.00009163411,"domain_scores_codex":[0.998013,0.0001520815,0.000801457,0.0001484844,0.0004654196,0.0004195422],"domain_scores_gemma":[0.9966003,0.00196535,0.0004695402,0.0003070033,0.0004247989,0.0002329551],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001284193,0.001021501,0.08310667,0.00005200872,0.002001535,0.0007507353,0.001418127,0.000008405753,0.01072608,0.8341087,0.05880111,0.006720969],"study_design_scores_gemma":[0.001052188,0.000208108,0.01208191,0.00002958319,0.0001789505,0.0004220362,0.000999236,0.000006784143,0.0005871499,0.9795209,0.004786846,0.000126348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.765299,0.0003280739,0.2264555,0.0005593936,0.0005463095,0.00007173997,0.00000318632,0.00002389069,0.006712932],"genre_scores_gemma":[0.9815836,0.00003962663,0.01748811,0.0001663859,0.0003757322,0.000001347863,0.000001241147,0.00002929877,0.0003146319],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2162846,"threshold_uncertainty_score":0.9989933,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029492597","doi":"10.1007/s00145-005-0011-3","title":"A Proof of the Security of Quantum Key Distribution","year":2006,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":149,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Army Research Office; European Commission; Natural Sciences and Engineering Research Council of Canada; Advanced Research Projects Agency; Defense Advanced Research Projects Agency; Deutscher Akademischer Austauschdienst","keywords":"Quantum key distribution; Key (lock); Computer science; Quantum cryptography; Computer security; Computation; Quantum; Key distribution; Quantum computer; Channel (broadcasting); Theoretical computer science; Computer network; Public-key cryptography; Quantum mechanics; Physics; Quantum information; Algorithm; Encryption","retraction":null,"screen_n_in":null,"score":{"opus":0.005146683076329867,"gpt":0.215549091423631,"spread":0.2104024083473011,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003811823,0.0000628402,0.0002165623,0.00009623868,0.0000374734,0.00001125371,0.0005843421,0.00006224261,0.00001125499],"category_scores_gemma":[0.00005800486,0.00003982255,0.0001911081,0.0003842642,0.0001435267,0.0002836757,0.00006670602,0.00014976,8.981477e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001342417,"about_ca_system_score_gemma":0.00009806122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008690164,"about_ca_topic_score_gemma":0.000004015489,"domain_scores_codex":[0.998809,0.00009714135,0.0006595469,0.00005006376,0.0002680208,0.0001161976],"domain_scores_gemma":[0.9982954,0.0000574374,0.001041131,0.0002086178,0.0003703136,0.00002715999],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002440707,0.0001283795,0.003809607,0.00002960783,0.00001671665,0.000001738178,0.0003313464,0.0001599391,0.0006643811,0.9903484,0.003767583,0.0007179076],"study_design_scores_gemma":[0.001887324,0.0009441722,0.1107273,0.0001219794,0.00004952108,0.0006826591,0.0001794198,0.03673672,0.09616155,0.724632,0.02765498,0.0002223595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.520559,0.0001620125,0.4769159,0.001235083,0.0003841216,0.00005560171,0.000005384873,0.000005154388,0.0006777109],"genre_scores_gemma":[0.9984748,0.00000689111,0.001424963,0.00005645871,0.00003240588,5.765143e-7,8.118328e-7,0.000001482092,0.000001565962],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4779158,"threshold_uncertainty_score":0.1623916,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022521688","doi":"10.1007/s001450010009","title":"CBC MAC for Real-Time Data Sources","year":2000,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":144,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Iran Telecommunication Research Center; University of Toronto; Ontario Centres of Excellence","keywords":"CBC-MAC; Computer science; Message authentication code; Message broker; Chaining; Authentication (law); Encryption; Computer network; Cryptography; Theoretical computer science; Computer security; Block cipher","retraction":null,"screen_n_in":null,"score":{"opus":0.03463365323646356,"gpt":0.3271469201360835,"spread":0.29251326689962,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004681634,0.00007906026,0.0002209572,0.0001489039,0.0001071076,0.00007020176,0.001307154,0.00004929939,0.0006303114],"category_scores_gemma":[0.00003601786,0.00006551483,0.00008588428,0.0001836206,0.00005607094,0.0004714936,0.0001010732,0.00009821902,0.00002063558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001182509,"about_ca_system_score_gemma":0.00008582593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001780131,"about_ca_topic_score_gemma":0.00001955643,"domain_scores_codex":[0.9989709,0.00006902579,0.0004276187,0.000162709,0.0001551475,0.000214614],"domain_scores_gemma":[0.9988966,0.0002114801,0.0002267398,0.0004691955,0.0001190077,0.00007698803],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003137711,0.0005546538,0.006478801,0.00004680546,0.0003828137,0.0001375353,0.002600633,0.0001028765,0.00430392,0.3449631,0.1662123,0.4739028],"study_design_scores_gemma":[0.003373684,0.001359686,0.008016561,0.00002791072,0.0001020022,0.001657401,0.0003087395,0.02034717,0.0006282642,0.1503677,0.8134059,0.0004049277],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5777072,0.0003016728,0.4131311,0.006315772,0.0004618976,0.0001745565,0.0000391392,0.00003878958,0.001829923],"genre_scores_gemma":[0.3918299,0.000881255,0.6051953,0.001106575,0.0007317042,0.000007181048,0.00003659432,0.00002017672,0.0001913435],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6471937,"threshold_uncertainty_score":0.6901468,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087377210","doi":"10.1007/s00145-001-0018-3","title":"New Approaches to Designing Public Key Cryptosystems Using One-Way Functions and Trapdoors in Finite Groups","year":2002,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":123,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; National Science Foundation","keywords":"ElGamal encryption; Discrete logarithm; Cryptosystem; Signature (topology); Key (lock); ElGamal signature scheme; Mathematics; Public-key cryptography; Permutation (music); Hybrid cryptosystem; Theoretical computer science; Computer science; Cryptography; Discrete mathematics; Blind signature; Algorithm; Encryption; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.1943988686853836,"gpt":0.2422027029784385,"spread":0.04780383429305485,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001057911,0.0001597554,0.0003925127,0.001039327,0.0001456168,0.0001895511,0.0005291823,0.0001187269,0.00004602692],"category_scores_gemma":[0.0001177214,0.000150166,0.0001160957,0.001022041,0.00005714658,0.0007394789,0.0001078924,0.0003496525,0.000008599663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004371021,"about_ca_system_score_gemma":0.00005420975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000723654,"about_ca_topic_score_gemma":0.00002104334,"domain_scores_codex":[0.998178,0.0004132728,0.0005704411,0.0002525414,0.0002141446,0.0003715966],"domain_scores_gemma":[0.9987593,0.0003677339,0.0002900694,0.0002401856,0.00005540739,0.0002873459],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007810743,0.0003303443,0.01753385,0.00004741387,0.0001773792,0.0001344343,0.008478371,0.003679262,0.004109793,0.8534512,0.0006254505,0.1113544],"study_design_scores_gemma":[0.01099159,0.006619954,0.03250249,0.001172758,0.0003354555,0.009932534,0.003970498,0.209112,0.002819358,0.6914378,0.02805862,0.003046979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2322035,0.0006432043,0.7637312,0.002271439,0.0003911718,0.00007975804,3.014214e-7,0.00002266668,0.0006568153],"genre_scores_gemma":[0.872207,0.00001986932,0.1274408,0.0001436968,0.0001629155,0.000002213099,1.057916e-7,0.000009285796,0.000014093],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6400036,"threshold_uncertainty_score":0.612359,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3083633640","doi":"10.1007/s00145-021-09384-1","title":"A Cryptographic Analysis of the TLS 1.3 Handshake Protocol","year":2021,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Bundesministerium für Bildung und Forschung; Technische Universität Darmstadt; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Handshake; Authenticated Key Exchange; Computer science; Key exchange; Transport Layer Security; Cryptographic protocol; Key (lock); Oakley protocol; Session key; Computer security; Ephemeral key; Computer network; Cryptography; Authentication (law); Protocol (science); Session (web analytics); Replay attack; Public-key cryptography; Encryption; Universal composability; Asynchronous communication; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.01229057274611682,"gpt":0.3103689383372021,"spread":0.2980783655910853,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004211881,0.00009426383,0.0004212551,0.0003240308,0.00006803164,0.00003417554,0.001041814,0.00007205967,0.0001064533],"category_scores_gemma":[0.0003253015,0.00006283171,0.0004453621,0.002500864,0.0001395917,0.0002566118,0.0002283134,0.0002449577,0.000001939339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002039212,"about_ca_system_score_gemma":0.0002709537,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.045976e-7,"about_ca_topic_score_gemma":0.0000122534,"domain_scores_codex":[0.998278,0.0003060583,0.0007183248,0.0001668048,0.0003625103,0.0001682816],"domain_scores_gemma":[0.9972086,0.0001671666,0.001104787,0.0006423688,0.0008116348,0.00006542275],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005004078,0.0006660363,0.03613712,0.00007852881,0.001369926,0.00006061616,0.001342716,0.001384631,0.01496793,0.9342083,0.0001679316,0.009566247],"study_design_scores_gemma":[0.00294554,0.0004270735,0.2076638,0.0001294221,0.0007070976,0.0006436644,0.0001045047,0.008900929,0.08732393,0.6704205,0.02040966,0.0003238035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009425473,0.00003146799,0.9746634,0.001901294,0.0001636419,0.0135112,0.00000162604,0.00001127575,0.0002906131],"genre_scores_gemma":[0.8757864,0.000004660198,0.1069953,0.0007043838,0.00007102879,0.01638546,4.135179e-7,0.00001154612,0.0000408567],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8676682,"threshold_uncertainty_score":0.2562203,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2585018408","doi":"10.1007/s00145-016-9251-7","title":"Making the Impossible Possible","year":2017,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Impossible differential cryptanalysis; Block cipher; Key schedule; Boomerang attack; Differential cryptanalysis; Computer science; Linear cryptanalysis; Higher-order differential cryptanalysis; Cipher; Differential (mechanical device); Cryptanalysis; Algorithm; Arithmetic; Theoretical computer science; Computer security; Cryptography; Mathematics; Encryption; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.06722823537149986,"gpt":0.3812333853457928,"spread":0.314005149974293,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006537486,0.00006582752,0.0001497022,0.0001118278,0.0007260392,0.000420838,0.001775824,0.00003751714,0.00004725208],"category_scores_gemma":[0.0001039985,0.00004022662,0.0001165049,0.00008490877,0.0001349901,0.0005919241,0.0002241675,0.0002000117,0.00000606814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000128475,"about_ca_system_score_gemma":0.0001012904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001098806,"about_ca_topic_score_gemma":0.00002696411,"domain_scores_codex":[0.9991615,0.00006563962,0.000317019,0.00008630798,0.000178869,0.0001906935],"domain_scores_gemma":[0.9984729,0.00009726543,0.0006632815,0.000563934,0.00016192,0.00004067954],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001567367,0.00005112488,0.02482158,0.000005426617,0.00005857984,0.00009179406,0.001269015,0.00001027484,0.0004312726,0.9354582,0.007820792,0.0299662],"study_design_scores_gemma":[0.001765452,0.0005824276,0.3595008,0.00004622068,0.0000475116,0.003126676,0.0004434528,0.002866266,0.001081605,0.5476255,0.08264728,0.0002667774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3639172,0.0005783425,0.6018905,0.02528875,0.002058526,0.00009306974,0.000001157403,0.00001755299,0.00615486],"genre_scores_gemma":[0.9690967,0.00004047847,0.03030688,0.0003942449,0.0001456976,0.00000108241,6.394051e-8,0.000002847986,0.00001198067],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6051795,"threshold_uncertainty_score":0.558418,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033966971","doi":"10.1007/s00145-002-0146-4","title":"Oblivious Transfers and Privacy Amplification","year":2003,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Communication source; Oblivious transfer; Computer science; String (physics); Constraint (computer-aided design); Theoretical computer science; Task (project management); Cryptography; Algorithm; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01160546112724178,"gpt":0.2381654914425756,"spread":0.2265600303153338,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003850159,0.0000670814,0.0001582915,0.0001690378,0.0000555506,0.00004956021,0.0003312782,0.00005824748,0.00001420943],"category_scores_gemma":[0.00009912674,0.00005666189,0.00005923586,0.0002071995,0.00007087769,0.0004179741,0.00001939275,0.0001569735,0.000002631787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008072797,"about_ca_system_score_gemma":0.00005499001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001429132,"about_ca_topic_score_gemma":0.000001809679,"domain_scores_codex":[0.9992491,0.0001139939,0.000268357,0.0001153539,0.0001180527,0.0001351355],"domain_scores_gemma":[0.9993783,0.0001030381,0.0001357941,0.0002013624,0.00009048847,0.00009098773],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001140166,0.00006037545,0.002736391,0.000006634665,0.00001801056,0.0000205561,0.0007052248,0.000002142028,0.001291535,0.9828989,0.0005708127,0.01167803],"study_design_scores_gemma":[0.002070221,0.001098642,0.05240972,0.00002619758,0.00004612048,0.004473319,0.0001552675,0.0002357068,0.00449889,0.7976079,0.1370564,0.0003216745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2444864,0.000514751,0.7533431,0.0008930356,0.0002549235,0.00003312621,8.802772e-7,0.00001039205,0.0004633901],"genre_scores_gemma":[0.9171864,0.0002461195,0.08234737,0.0001929043,0.00002337695,5.997073e-7,2.845846e-7,0.000002401651,5.670988e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6727,"threshold_uncertainty_score":0.2310605,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071265330","doi":"10.1007/s00145-012-9133-6","title":"Round-Optimal Password-Based Authenticated Key Exchange","year":2012,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Authenticated Key Exchange; Computer science; Password; Key (lock); Cryptosystem; Key exchange; Computer security; Bilinear interpolation; Protocol (science); Zero-knowledge password proof; Standard Model (mathematical formulation); Theoretical computer science; String (physics); Password strength; Cryptography; One-time password; Public-key cryptography; Encryption; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02237436579646068,"gpt":0.2993250014757068,"spread":0.2769506356792461,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000727002,0.0001451077,0.0003028434,0.0002286658,0.00008275206,0.00005274665,0.0009197596,0.0001108861,0.0001667914],"category_scores_gemma":[0.0001969794,0.0001235883,0.0001310507,0.0003117245,0.0001072029,0.001005469,0.0001286465,0.0003097906,0.000100993],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008280818,"about_ca_system_score_gemma":0.0001242363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.908655e-7,"about_ca_topic_score_gemma":6.37529e-7,"domain_scores_codex":[0.998289,0.0002206075,0.0005584403,0.0001513815,0.0003249575,0.0004556365],"domain_scores_gemma":[0.9981455,0.0001989015,0.0006880672,0.000414581,0.0003112981,0.0002416308],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000151124,0.001403214,0.009943146,0.00007951949,0.0001138258,0.00007421995,0.004531879,0.0002262241,0.0043312,0.9508942,0.001534347,0.0267171],"study_design_scores_gemma":[0.010875,0.002865188,0.05535906,0.000248119,0.0002359009,0.003349587,0.0002530531,0.0784959,0.06804086,0.4396304,0.3387551,0.001891769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02415636,0.0002844297,0.9712954,0.002683847,0.000769928,0.0004805483,8.434837e-7,0.00005040022,0.0002782922],"genre_scores_gemma":[0.8046991,0.000004319773,0.1945367,0.0004603545,0.0001979723,0.00006036369,6.011535e-7,0.00001032493,0.00003027811],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7805427,"threshold_uncertainty_score":0.5039786,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2095378187","doi":"10.1007/s00145-001-0002-y","title":"Secure Communication in Multicast Channels: The Answer to Franklin and Wright's Question","year":2001,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"123 Certification (Canada)","funders":"Defense Advanced Research Projects Agency","keywords":"Multicast; Communication source; Computer science; Computer network; Computation; Channel (broadcasting); Secure multicast; Scheme (mathematics); Wright; Authentication (law); Theoretical computer science; Xcast; Inter-domain; Mathematics; Algorithm; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.01114782572818797,"gpt":0.2749167811058279,"spread":0.2637689553776399,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008288032,0.0000742008,0.0001606552,0.0002061442,0.00008523012,0.00006890048,0.0006297768,0.00007419736,0.00001227033],"category_scores_gemma":[0.0001018577,0.00004980657,0.00003809883,0.000362954,0.00008039202,0.0004167318,0.0001393818,0.0003141037,0.000004430051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000134087,"about_ca_system_score_gemma":0.00002233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003574404,"about_ca_topic_score_gemma":0.0002161553,"domain_scores_codex":[0.9990379,0.0002783325,0.0003019436,0.0001085546,0.0001266632,0.0001466402],"domain_scores_gemma":[0.999118,0.0002169075,0.000150642,0.0003250244,0.0001172508,0.00007220027],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002183305,0.0003578749,0.02909654,0.00001446676,0.00004075353,0.0001489531,0.01293493,0.0002945873,0.0006117192,0.9055378,0.003229051,0.04751498],"study_design_scores_gemma":[0.003419514,0.001226308,0.313167,0.000283214,0.00004286937,0.004183744,0.00110356,0.0203046,0.0005059644,0.4335152,0.221714,0.0005340956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.604497,0.001465027,0.3748384,0.01860375,0.0003373494,0.0001014277,0.000001129806,0.00001064128,0.000145242],"genre_scores_gemma":[0.9650903,0.0005616482,0.03353094,0.0007351145,0.00007521384,0.000002414317,7.532449e-7,0.000002664526,9.227095e-7],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4720226,"threshold_uncertainty_score":0.2031053,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1809690300","doi":"10.1007/s00145-001-0010-y","title":"Almost k -Wise Independent Sample Spaces and Their Cryptologic Applications","year":2001,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Vetenskapsrådet","keywords":"Mathematics; Pseudorandom number generator; Block cipher; Hash function; Discrete mathematics; Random oracle; Key (lock); Decorrelation; Random function; Combinatorics; Random variable; Algorithm; Cryptography; Computer science; Encryption; Public-key cryptography; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01551617990863536,"gpt":0.2484218251798251,"spread":0.2329056452711898,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005218605,0.0001402243,0.0002978221,0.000277826,0.0001594307,0.00009701234,0.0007307665,0.0001016115,0.0000573187],"category_scores_gemma":[0.00007501095,0.0001019833,0.0001171637,0.0003813437,0.0001623232,0.0003136877,0.0001673524,0.0002652103,0.000008103592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001546039,"about_ca_system_score_gemma":0.0000525133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005214799,"about_ca_topic_score_gemma":0.000009925559,"domain_scores_codex":[0.9989152,0.0001483291,0.0003604346,0.0001971042,0.0001328844,0.0002460335],"domain_scores_gemma":[0.9985659,0.0004885097,0.0003514057,0.0003054655,0.0001483583,0.000140388],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009902514,0.0001761471,0.01931847,0.000009327375,0.00008066656,0.00005496763,0.0007716298,0.00002515135,0.001776677,0.8877581,0.0004331144,0.08949675],"study_design_scores_gemma":[0.0005526969,0.0006695686,0.009335397,0.00001587209,0.00001951872,0.00283168,0.0002412109,0.0003054258,0.0006803899,0.8519635,0.1331781,0.0002065737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2387631,0.0009987372,0.7566813,0.002508811,0.0002057084,0.00007977084,0.000001755528,0.00003295834,0.0007279339],"genre_scores_gemma":[0.9633657,0.0004649693,0.03548381,0.0005258485,0.0001379858,0.000008506316,4.394501e-7,0.000006081134,0.000006656837],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7246026,"threshold_uncertainty_score":0.415876,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094133109","doi":"10.1007/s00145-014-9180-2","title":"Quantum Private Information Retrieval has Linear Communication Complexity","year":2014,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"University of Waterloo; Industry Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Private information retrieval; Communication complexity; Computer science; Quantum; Protocol (science); Theoretical computer science; Sublinear function; Qubit; Analogy; Upper and lower bounds; Oblivious transfer; Quantum information science; Adversary; Quantum information; Verifiable secret sharing; Cryptography; Mathematics; Computer security; Discrete mathematics; Quantum entanglement; Quantum mechanics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03282833233878169,"gpt":0.2663926676220972,"spread":0.2335643352833155,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001207828,0.0001049491,0.0002591254,0.0003729119,0.0001922343,0.0001571057,0.001067565,0.0001012492,0.00003132543],"category_scores_gemma":[0.0002895603,0.00008838117,0.0001276299,0.0003935294,0.0002037012,0.002441383,0.0001372573,0.0003358326,0.0001002987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002644271,"about_ca_system_score_gemma":0.00007658218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002437103,"about_ca_topic_score_gemma":0.000001158239,"domain_scores_codex":[0.9983301,0.0002394919,0.0008584569,0.00005813684,0.0003286912,0.0001851956],"domain_scores_gemma":[0.9977546,0.0001534394,0.001039213,0.000451203,0.0004950559,0.0001065272],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005568326,0.0000341157,0.000351448,0.00001429545,0.0000195927,6.616517e-7,0.0009018392,0.0001638137,0.00007973513,0.9918464,0.002376972,0.004155398],"study_design_scores_gemma":[0.001990288,0.0007945057,0.01626204,0.00004760546,0.00001898561,0.0004887921,0.0001208533,0.2650635,0.001522122,0.2912005,0.4222117,0.0002790845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1180812,0.00004969697,0.8742082,0.005608833,0.0004522875,0.00006020994,7.596749e-7,0.00004636274,0.001492467],"genre_scores_gemma":[0.8900284,0.0000527354,0.108308,0.001541537,0.00005920236,5.865695e-7,0.000005173027,0.000003179513,0.000001277112],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7719471,"threshold_uncertainty_score":0.3604079,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120014373","doi":"10.1007/s00145-007-0327-2","title":"On Unconditionally Secure Distributed Oblivious Transfer","year":2007,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Oblivious transfer; Communication source; Computer science; Randomness; Server; Theoretical computer science; Impossibility; Set (abstract data type); Access structure; Secret sharing; Cryptography; Transfer (computing); Infimum and supremum; Upper and lower bounds; Discrete mathematics; Algorithm; Mathematics; Computer network; Parallel computing","retraction":null,"screen_n_in":null,"score":{"opus":0.007361256692201161,"gpt":0.2462951735661842,"spread":0.238933916873983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000700468,0.0001216581,0.0002471276,0.0003091064,0.00008172359,0.00004420812,0.0007069391,0.0001271919,0.00009744496],"category_scores_gemma":[0.00008675046,0.00009934636,0.0001880996,0.0004124111,0.00008820678,0.0003775161,0.00003732293,0.0004079179,0.00001706013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003210514,"about_ca_system_score_gemma":0.00009373139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001793689,"about_ca_topic_score_gemma":0.00002425331,"domain_scores_codex":[0.9986719,0.00007170985,0.0004721964,0.0001591532,0.0003412037,0.0002838646],"domain_scores_gemma":[0.9988,0.0004170909,0.0001445211,0.000246289,0.0002268795,0.0001651654],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001182812,0.0002060659,0.000586548,0.000005320127,0.00004731967,0.0004304017,0.0002058755,0.00003671825,0.0004253247,0.9887594,0.006975766,0.002203004],"study_design_scores_gemma":[0.002404923,0.001783917,0.06076983,0.00005042854,0.00003800618,0.002696717,0.00006534407,0.0001548115,0.00272662,0.882361,0.04660703,0.0003413956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1893546,0.0001283514,0.8080574,0.001189485,0.0006304546,0.00003731683,0.00003276798,0.00002231711,0.0005473551],"genre_scores_gemma":[0.9837294,0.00002185285,0.01511743,0.0009562118,0.0001555962,4.763074e-7,0.00001357583,0.000004607403,8.669572e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7943748,"threshold_uncertainty_score":0.4051227,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035912926","doi":"10.1007/s001459910005","title":"Randomness versus Fault-Tolerance","year":2000,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Randomness; Correctness; Fault tolerance; Computer science; Resilience (materials science); Upper and lower bounds; Function (biology); Polynomial; Protocol (science); State (computer science); Discrete mathematics; Theoretical computer science; Algorithm; Mathematics; Distributed computing; Statistics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01234812702544285,"gpt":0.2605606272442126,"spread":0.2482125002187698,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003599974,0.0001056743,0.0003148697,0.000135027,0.00007962939,0.00005844958,0.0009733813,0.00008450331,0.0004471934],"category_scores_gemma":[0.00004459868,0.00008648029,0.0001731934,0.0002718778,0.00009408937,0.0006478357,0.00004519524,0.0002681054,0.00007363789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001265636,"about_ca_system_score_gemma":0.00006704759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003867465,"about_ca_topic_score_gemma":0.000005682203,"domain_scores_codex":[0.9988593,0.0001234839,0.0004048927,0.0001495636,0.0002277827,0.0002349295],"domain_scores_gemma":[0.9989977,0.0002275698,0.0002057077,0.0003283904,0.0001265455,0.0001140975],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.003997525,0.0005185992,0.001144512,0.0000294079,0.0002156706,0.0006464345,0.001879179,0.0008937623,0.0006744471,0.6068878,0.01674687,0.3663658],"study_design_scores_gemma":[0.03277053,0.001882117,0.01124552,0.00007166917,0.00008581235,0.003007586,0.00009409389,0.004618721,0.001855551,0.1385652,0.8050845,0.0007187212],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6915895,0.001587884,0.2958617,0.001866277,0.002487964,0.00007135939,0.000003713159,0.00004522956,0.006486333],"genre_scores_gemma":[0.9434789,0.0004603892,0.05524987,0.0004487035,0.0003437778,0.000001674972,8.9642e-7,0.00000604818,0.000009708539],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7883376,"threshold_uncertainty_score":0.4896454,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030480083","doi":"10.1007/s00145-014-9194-9","title":"Limits on the Usefulness of Random Oracles","year":2014,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Israeli Centers for Research Excellence; Azrieli Foundation; Israel Science Foundation; Bar-Ilan University","keywords":"Impossibility; Random oracle; Oracle; Computer science; Key (lock); Black box; Protocol (science); Theoretical computer science; Product (mathematics); Computer security; Public-key cryptography; Mathematics; Encryption; Artificial intelligence; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02843023898195536,"gpt":0.2474534147835545,"spread":0.2190231758015991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00112096,0.00008126106,0.0002885129,0.0001479576,0.00006681178,0.00003105565,0.001021991,0.00006152484,0.00002698493],"category_scores_gemma":[0.0004430751,0.00004626154,0.0001519491,0.0002319189,0.0001305036,0.0002144212,0.00006976784,0.0002350472,0.000007520814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004669122,"about_ca_system_score_gemma":0.00003840875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002407494,"about_ca_topic_score_gemma":0.000004753742,"domain_scores_codex":[0.9988151,0.0003316723,0.0003801839,0.0000997723,0.0002307092,0.0001425745],"domain_scores_gemma":[0.9976597,0.001264391,0.0004625306,0.0003835689,0.0001749138,0.00005486054],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001416146,0.00009629742,0.0008401479,0.000007390116,0.00003311083,0.000008458594,0.0003497318,0.00002911158,0.000580693,0.983512,0.002948548,0.01145287],"study_design_scores_gemma":[0.005785313,0.002460188,0.04061528,0.0001547226,0.00007415371,0.0007874551,0.0002050065,0.003061648,0.04439453,0.8074575,0.09464199,0.0003622258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4622551,0.0001122808,0.5321272,0.00396833,0.000573827,0.00004176655,0.00000150659,0.000008826893,0.0009111561],"genre_scores_gemma":[0.9911618,0.00003088917,0.008101443,0.0005877993,0.0001133035,8.931101e-7,1.890481e-7,0.000003011802,7.248861e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5289066,"threshold_uncertainty_score":0.1899131,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W162865231","doi":"10.1007/s00145-002-0107-y","title":"A Probable Prime Test with Very High Confidence for n ≡ 3 mod 4","year":2003,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Austrian Science Fund","keywords":"Precomputation; Mathematics; Mod; Modulo; Prime (order theory); Arithmetic; Primality test; Square root; Discrete mathematics; Combinatorics; Prime number; Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.008341506126372444,"gpt":0.222028054337757,"spread":0.2136865482113846,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004063792,0.0001163286,0.0002964274,0.0001951552,0.00009475825,0.00006266119,0.000510573,0.00007892036,0.00001170122],"category_scores_gemma":[0.0002384041,0.00008022709,0.0001011094,0.0003168435,0.0001211945,0.0003391709,0.00002664735,0.0001833551,0.000004049891],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002077983,"about_ca_system_score_gemma":0.0003028343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003282907,"about_ca_topic_score_gemma":0.000007731048,"domain_scores_codex":[0.9989485,0.00007016583,0.0003275509,0.0001715883,0.0001951752,0.0002870271],"domain_scores_gemma":[0.9984888,0.000477732,0.0003391484,0.0002482367,0.0003400616,0.0001060122],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009067771,0.0002855202,0.005983987,0.00003390144,0.00009251528,0.0001473961,0.0002183337,0.0002920461,0.002427096,0.9880509,0.0008327024,0.001544879],"study_design_scores_gemma":[0.006895982,0.00874105,0.01173641,0.0002378598,0.0001547034,0.01083122,0.0001172683,0.001409904,0.05968527,0.8570461,0.04245929,0.0006849617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04807502,0.0005215818,0.9489082,0.001316882,0.000384826,0.0001753528,8.389871e-7,0.00001945928,0.0005978185],"genre_scores_gemma":[0.6862447,0.00002891849,0.3134192,0.0002115939,0.00004955961,0.00000745478,1.287185e-7,0.000006729385,0.00003172494],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6381696,"threshold_uncertainty_score":0.3271566,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1899845837","doi":"10.1007/s00145-001-0007-6","title":"Complexity Bounds on General Hard-Core Predicates","year":2001,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Kungliga Tekniska Högskolan; McGill University; University of Texas at Austin; National Science Foundation","keywords":"Predicate (mathematical logic); Boolean function; Mathematics; Discrete mathematics; Combinatorics; Monotone polygon; Core (optical fiber); Hard core; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.08349018298500696,"gpt":0.3071145670270946,"spread":0.2236243840420876,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000414434,0.0001419834,0.0003470977,0.0002688521,0.0001625657,0.00008337833,0.001221217,0.00009158616,0.000136866],"category_scores_gemma":[0.00008370256,0.0001159667,0.000186977,0.0003179841,0.0002797136,0.0002914435,0.0001511911,0.0004171486,0.00003320772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004129353,"about_ca_system_score_gemma":0.0000975205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008032502,"about_ca_topic_score_gemma":0.000007001829,"domain_scores_codex":[0.9985569,0.0001003465,0.0004707496,0.0001983975,0.000352235,0.0003214307],"domain_scores_gemma":[0.9987884,0.0001489453,0.0003570909,0.0003583857,0.000187999,0.000159174],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009872025,0.000330788,0.009560293,0.000008125099,0.0000889174,0.0005034669,0.0002919684,0.0001506345,0.0006368142,0.9460161,0.01566987,0.02664435],"study_design_scores_gemma":[0.001182005,0.001365341,0.09432337,0.00004044304,0.00001910984,0.004607395,0.00001994241,0.0193007,0.0005661686,0.7743759,0.1039377,0.0002619066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6104856,0.0003542304,0.3729003,0.009308256,0.002320121,0.00007013597,0.000002830259,0.00006783492,0.004490729],"genre_scores_gemma":[0.7084529,0.0001883422,0.2874211,0.002622132,0.001096937,0.000002548163,0.000001837806,0.00001347409,0.0002007782],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1716402,"threshold_uncertainty_score":0.4728986,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2039510779","doi":"10.1007/s00145-008-9025-y","title":"New Binding-Concealing Trade-Offs for Quantum String Commitment","year":2008,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Army Research Office; Deutscher Akademischer Austauschdienst","keywords":"Commitment scheme; Commit; String (physics); Alice (programming language); Cheating; Alice and Bob; Qubit; Protocol (science); Coin flipping; Computer science; Bit array; Scheme (mathematics); Discrete mathematics; Quantum; Mathematics; Cryptography; Physics; Computer security; Theoretical physics; Quantum mechanics; Statistics; Psychology; Social psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.02777837323684737,"gpt":0.2718527976568487,"spread":0.2440744244200013,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003632178,0.0001445659,0.0003971779,0.0002127636,0.0002340043,0.00004159931,0.0007855546,0.00008220349,0.000005175806],"category_scores_gemma":[0.00006592341,0.0001169027,0.000205825,0.0001923684,0.00004742002,0.000162431,0.00009018397,0.0003255286,0.000002818439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004244172,"about_ca_system_score_gemma":0.0002531677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000530148,"about_ca_topic_score_gemma":9.852379e-7,"domain_scores_codex":[0.9986308,0.00007119252,0.0005337073,0.000184599,0.0002258479,0.0003538377],"domain_scores_gemma":[0.9987267,0.0003570352,0.0004611078,0.0002092761,0.00006707959,0.0001787899],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002798589,0.0004551017,0.005630523,0.0001110855,0.0005693825,0.001716615,0.01209577,0.0344561,0.009527862,0.4645675,0.0486235,0.4219667],"study_design_scores_gemma":[0.009394759,0.005836044,0.009472947,0.0003488541,0.00009703806,0.02516085,0.000206312,0.6875283,0.01524589,0.1136956,0.1318586,0.001154786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2725271,0.0003720573,0.7219561,0.003818584,0.001198783,0.00007228641,8.624017e-7,0.00002903921,0.00002513045],"genre_scores_gemma":[0.6228122,0.00003605937,0.3761947,0.000281853,0.0006431406,9.539475e-7,4.291729e-7,0.00001081312,0.0000198776],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6530722,"threshold_uncertainty_score":0.4767153,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069859460","doi":"10.1007/s00145-010-9087-5","title":"Fault-Based Attack on Montgomery’s Ladder Algorithm","year":2010,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"NIST; Elliptic curve cryptography; Elliptic curve; Scalar multiplication; Algorithm; Elliptic curve point multiplication; Elliptic Curve Digital Signature Algorithm; Computer science; Cryptography; Tripling-oriented Doche–Icart–Kohel curve; Curve25519; Mathematics; Arithmetic; Discrete mathematics; Computer security; Public-key cryptography; Pure mathematics; Speech recognition; Encryption","retraction":null,"screen_n_in":null,"score":{"opus":0.01504991681177841,"gpt":0.2784208209006182,"spread":0.2633709040888398,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000416938,0.0001518197,0.0003140027,0.000449564,0.0000993237,0.00006900588,0.0009272149,0.0001752927,0.00009029185],"category_scores_gemma":[0.00009418929,0.0001124976,0.0002455587,0.0003625966,0.0001479886,0.0002213207,0.00005834683,0.0007762637,0.00005216547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001094724,"about_ca_system_score_gemma":0.0001418857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004135616,"about_ca_topic_score_gemma":0.00001243249,"domain_scores_codex":[0.9986236,0.000102051,0.0004265879,0.0001975112,0.0003426422,0.0003075782],"domain_scores_gemma":[0.9985185,0.0002985413,0.0003454958,0.0004190586,0.0002417485,0.0001766634],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001756565,0.001532053,0.004217833,0.00003439028,0.0003223205,0.001852838,0.0006538568,0.00169792,0.01531296,0.1692341,0.03216134,0.7728047],"study_design_scores_gemma":[0.01369163,0.01069315,0.1193443,0.0002093827,0.0002293315,0.007692735,0.0001748448,0.1199458,0.0463004,0.09998962,0.5795788,0.002149998],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2424221,0.0002557805,0.74199,0.008589478,0.004331267,0.0001015845,0.00000246193,0.00005980094,0.002247558],"genre_scores_gemma":[0.6272635,0.00001709248,0.3703831,0.001837102,0.0004440903,0.000002764098,5.485158e-7,0.00001422412,0.00003752818],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7706547,"threshold_uncertainty_score":0.4587518,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4401770362","doi":"10.1007/s00145-024-09515-4","title":"Randomness Recoverable Secret Sharing Schemes","year":2024,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Randomness; Cryptographic primitive; Cryptography; Theoretical computer science; Encryption; Computer science; Secret sharing; Access structure; SSS*; Mathematics; Discrete mathematics; Algorithm; Cryptographic protocol; Computer security; Statistics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01095844419410871,"gpt":0.266041723456768,"spread":0.2550832792626593,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007437338,0.00009970012,0.000274241,0.0003057431,0.00006463863,0.0002539716,0.0008541423,0.000083375,0.0001150671],"category_scores_gemma":[0.00008957412,0.0000786727,0.000189444,0.0004192481,0.00004671147,0.001109381,0.0001758208,0.0003690135,0.00002489691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002049705,"about_ca_system_score_gemma":0.0001082724,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003668889,"about_ca_topic_score_gemma":0.000002994322,"domain_scores_codex":[0.998948,0.00005936828,0.0003889005,0.0001973332,0.0001894816,0.0002169256],"domain_scores_gemma":[0.9991769,0.0002221161,0.0001295321,0.0002741163,0.0001052934,0.00009201097],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000549149,0.00004081136,0.0009949356,0.00006141517,0.0001058212,0.0003515766,0.0004355615,0.00001929169,0.0009700456,0.9726666,0.00691287,0.01738621],"study_design_scores_gemma":[0.001481735,0.0002722603,0.0006423198,0.0001895521,0.00004016918,0.002709905,0.00004322266,0.009649499,0.002543918,0.5885124,0.3936721,0.0002428771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09090915,0.005553119,0.8975143,0.001618999,0.002528341,0.00004287987,0.00000297024,0.00006561888,0.00176462],"genre_scores_gemma":[0.9030228,0.0006126093,0.09539661,0.0004056866,0.0005232459,0.000002619794,0.000002108639,0.0000121549,0.00002214675],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8121136,"threshold_uncertainty_score":0.3208179,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}