{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Hoi‐Kwong Lo","is_ca":true},{"name":"H. F. Chau","is_ca":false},{"name":"M. Ardehali","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003294307,0.001102625,0.001771191,0.00156232,0.003759892,0.004270399,0.002389501,0.003816883,0.008625939],"category_scores_gemma":[0.008619491,0.001443168,0.002054954,0.001920128,0.007281849,0.007226405,0.007915758,0.00764887,0.002368981],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002869361,"about_ca_system_score_gemma":0.003930644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007297018,"about_ca_topic_score_gemma":0.0005765515,"domain_scores_codex":[0.9957366,0.0009042821,0.0002341935,0.00063491,0.001692301,0.0007976754],"domain_scores_gemma":[0.9923522,0.004433335,0.0003910332,0.001529283,0.0007983306,0.000495826],"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.0001567847,0.00008788703,0.0001166799,0.00007289147,0.00002890335,0.0001008094,0.0002067126,0.002359292,0.0026794,0.9850131,0.002658063,0.006519398],"study_design_scores_gemma":[0.0001561549,0.00008998077,0.0002117088,0.00004499946,0.00005215934,0.0002047882,0.00003949811,0.02301582,0.00474401,0.9633536,0.008017632,0.00006958628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08072206,0.001075285,0.8104371,0.01232677,0.001093331,0.0006860555,0.000981205,0.001164202,0.09151404],"genre_scores_gemma":[0.8614417,0.0007065686,0.1121638,0.001574005,0.0006547361,0.0005988783,0.0003480819,0.0001748632,0.02233718],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008625939,"threshold_uncertainty_score":0.02885669,"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","authors":[{"name":"David Mandell Freeman","is_ca":false},{"name":"Michael Scott","is_ca":false},{"name":"Edlyn Teske","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002517964,0.001515537,0.0009791483,0.005322881,0.003092693,0.004636196,0.001327248,0.00213601,0.00355876],"category_scores_gemma":[0.005842295,0.0007010254,0.001091752,0.005485117,0.003117461,0.009326097,0.004007085,0.003828437,0.002016609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00101318,"about_ca_system_score_gemma":0.001573964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003391204,"about_ca_topic_score_gemma":0.0002038178,"domain_scores_codex":[0.9962255,0.0007591451,0.0005821622,0.000499872,0.001481499,0.0004518289],"domain_scores_gemma":[0.9966345,0.0006173608,0.0005078559,0.001123151,0.0007067581,0.0004102956],"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.00003864486,0.00005347929,0.00136378,0.0002060783,0.00001043498,0.0003191523,0.0007215491,0.00157786,0.002045849,0.9396433,0.002894811,0.05112524],"study_design_scores_gemma":[0.00002966184,0.000278093,0.001347492,0.0004948846,0.0000286763,0.004916003,0.0007070812,0.008386095,0.004278073,0.6644677,0.3149571,0.0001091153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09870838,0.0142872,0.7200987,0.003584358,0.0008043916,0.00123104,0.001228089,0.00204973,0.1580082],"genre_scores_gemma":[0.408436,0.02416803,0.5342545,0.001054854,0.0008186192,0.0009758609,0.00219036,0.0004171392,0.02768459],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005322881,"threshold_uncertainty_score":0.01331645,"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","authors":[{"name":"Denis Charles","is_ca":false},{"name":"Kristin Lauter","is_ca":false},{"name":"Eyal Z. Goren","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001370174,0.0007940476,0.0008544343,0.002216818,0.001034772,0.002576618,0.00108221,0.001625095,0.008531124],"category_scores_gemma":[0.009050383,0.0007306395,0.0007394644,0.001810083,0.00275231,0.00886441,0.004076444,0.003615788,0.001780107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009426896,"about_ca_system_score_gemma":0.0005439838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000182395,"about_ca_topic_score_gemma":0.0002459646,"domain_scores_codex":[0.998889,0.0003395621,0.00005196628,0.0001426669,0.0004410542,0.0001357506],"domain_scores_gemma":[0.9923644,0.00521089,0.0004634381,0.001400887,0.000335634,0.0002246776],"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.0002431019,0.0000473883,0.0002520251,0.00008894812,0.00001613747,0.0001174638,0.0002333794,0.00794162,0.003064351,0.9522787,0.003499157,0.03221774],"study_design_scores_gemma":[0.00004086067,0.00003868902,0.0001192184,0.00002206907,0.00001464811,0.0001680504,0.00003270023,0.02138347,0.003483309,0.9706739,0.004001327,0.00002190736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.204922,0.001639015,0.7302169,0.004813623,0.0005226855,0.0003362025,0.0007151376,0.001963477,0.054871],"genre_scores_gemma":[0.8814663,0.001446225,0.08560733,0.001239271,0.0008861529,0.0002877068,0.0007637703,0.0005802616,0.027723],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008531124,"threshold_uncertainty_score":0.02853948,"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","authors":[{"name":"Eli Biham","is_ca":false},{"name":"Michel Boyer","is_ca":true},{"name":"P. Oscar Boykin","is_ca":false},{"name":"Tal Mor","is_ca":false},{"name":"Vwani Roychowdhury","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003331167,0.001362838,0.001663799,0.001975379,0.003500252,0.003951988,0.002536899,0.004251229,0.01599653],"category_scores_gemma":[0.01531583,0.001255871,0.002470474,0.001768697,0.009870153,0.008475524,0.008143683,0.009252172,0.00332477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002318179,"about_ca_system_score_gemma":0.002504908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001006025,"about_ca_topic_score_gemma":0.0005474281,"domain_scores_codex":[0.9964393,0.0008482649,0.0001641568,0.0005338437,0.001447041,0.0005673488],"domain_scores_gemma":[0.979719,0.01469257,0.0007366344,0.002381331,0.001692869,0.0007775741],"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.0001298378,0.00004832724,0.0001010107,0.0001194431,0.0000351879,0.00013368,0.0001450147,0.001532124,0.001353794,0.9830687,0.00622629,0.007106589],"study_design_scores_gemma":[0.00009809228,0.00003323136,0.00009903091,0.0000398973,0.00002041433,0.00009118414,0.00002614563,0.005327011,0.001144082,0.9837794,0.009314244,0.00002734489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06187483,0.004942789,0.6316236,0.05900858,0.005876723,0.0004254144,0.001466404,0.001209483,0.2335722],"genre_scores_gemma":[0.8620559,0.002661689,0.0932358,0.006469067,0.004021103,0.0004179054,0.0005255009,0.0003386978,0.03027439],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01599653,"threshold_uncertainty_score":0.05351371,"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","authors":[{"name":"Erez Petrank","is_ca":false},{"name":"Charles Rackoff","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003996875,0.001050279,0.0009904584,0.002654541,0.001896274,0.004714101,0.002317321,0.002105912,0.01427399],"category_scores_gemma":[0.01572729,0.0005592707,0.0005744502,0.001884772,0.001912511,0.005101031,0.002943924,0.002949184,0.006479819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002793375,"about_ca_system_score_gemma":0.003476933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001813826,"about_ca_topic_score_gemma":0.001768431,"domain_scores_codex":[0.9957955,0.0006406135,0.0004385874,0.0005604723,0.002084671,0.0004802137],"domain_scores_gemma":[0.9845405,0.002403515,0.001068654,0.007572729,0.004020606,0.0003939545],"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.00272038,0.0001670019,0.001664614,0.0009249804,0.0001538388,0.0006378387,0.0006171089,0.009396793,0.04742496,0.532286,0.05641059,0.347596],"study_design_scores_gemma":[0.0004164445,0.0005226763,0.001339307,0.0007626007,0.0003347671,0.001667479,0.000227819,0.3136851,0.1728648,0.2916855,0.2162137,0.0002798752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0134328,0.001647306,0.9563068,0.0013681,0.0008966683,0.0002863113,0.0004099812,0.01040683,0.01524525],"genre_scores_gemma":[0.4677103,0.001034848,0.4836815,0.001897671,0.0009537287,0.0007269998,0.001341995,0.001361768,0.04129105],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01427399,"threshold_uncertainty_score":0.04775131,"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","authors":[{"name":"Magliveras","is_ca":false},{"name":"Stinson","is_ca":true},{"name":"Tran van Trung","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003437744,0.00129364,0.001199504,0.001934309,0.001862719,0.003533844,0.002655425,0.002034623,0.00370141],"category_scores_gemma":[0.006253029,0.001418343,0.001896284,0.001346898,0.006040527,0.0156843,0.003629432,0.005031402,0.001251032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001428661,"about_ca_system_score_gemma":0.0009385778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002117783,"about_ca_topic_score_gemma":0.0005227661,"domain_scores_codex":[0.9974929,0.0007436127,0.0001986699,0.0003544282,0.000977342,0.0002329912],"domain_scores_gemma":[0.9949705,0.002495685,0.0002720989,0.001685492,0.0004327336,0.0001435334],"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.0001639909,0.0001285217,0.0002615968,0.0003186417,0.00005452825,0.00008976455,0.0005782322,0.01535718,0.009886484,0.9112817,0.001332883,0.06054651],"study_design_scores_gemma":[0.0001113826,0.0001430025,0.00005377275,0.00007805124,0.00009284863,0.0002456086,0.0001262865,0.1079869,0.01757189,0.8602276,0.01329622,0.00006646765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01234272,0.0004335371,0.982115,0.0005190846,0.00009197449,0.00007771672,0.00001774821,0.000437717,0.003964404],"genre_scores_gemma":[0.2247552,0.001017442,0.7665882,0.0004024907,0.0002245037,0.0003136556,0.00006803781,0.0002956816,0.006334623],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00370141,"threshold_uncertainty_score":0.01818073,"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","authors":[{"name":"Benjamin Dowling","is_ca":false},{"name":"Marc Fischlin","is_ca":false},{"name":"Felix Günther","is_ca":false},{"name":"Douglas Stebila","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001520817,0.0005903589,0.0004351099,0.00136949,0.0009748967,0.001541723,0.0008979818,0.0008945769,0.00466439],"category_scores_gemma":[0.004185447,0.0003133941,0.00154814,0.0008064904,0.002423854,0.002884628,0.001414824,0.001920618,0.00111484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001696964,"about_ca_system_score_gemma":0.001834862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001054594,"about_ca_topic_score_gemma":0.0004212662,"domain_scores_codex":[0.9978861,0.0004030603,0.00009503024,0.0001560051,0.001150751,0.0003089404],"domain_scores_gemma":[0.9973207,0.001263433,0.0003705435,0.000539689,0.0004442025,0.00006139463],"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.0001461779,0.00006269874,0.000567197,0.0001067092,0.00003272398,0.0003745834,0.0002983383,0.05228444,0.008299261,0.9242904,0.001673966,0.01186353],"study_design_scores_gemma":[0.00006065127,0.0002043287,0.0009214708,0.00006966207,0.00007901106,0.0007454242,0.0001552578,0.4862266,0.01520054,0.4760108,0.02025545,0.00007077455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1651262,0.0007247327,0.7649461,0.001843745,0.0002133311,0.0005741714,0.0003827217,0.0007675858,0.0654214],"genre_scores_gemma":[0.9397221,0.0004808397,0.04856947,0.0003059308,0.0001576976,0.0002555608,0.0002597074,0.0001073116,0.01014124],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00466439,"threshold_uncertainty_score":0.01560396,"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","authors":[{"name":"Christina Boura","is_ca":false},{"name":"Virginie Lallemand","is_ca":false},{"name":"María Naya‐Plasencia","is_ca":false},{"name":"Valentin Suder","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003680432,0.0007326514,0.0007755779,0.0008352797,0.005810619,0.007362838,0.00117755,0.004917582,0.02463573],"category_scores_gemma":[0.01382818,0.0004855433,0.0006675304,0.0005451306,0.02214077,0.01982834,0.005835759,0.01214315,0.006007088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001978196,"about_ca_system_score_gemma":0.002514063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001539755,"about_ca_topic_score_gemma":0.001673669,"domain_scores_codex":[0.9969434,0.001369678,0.00009107395,0.0004641368,0.0007335847,0.0003981098],"domain_scores_gemma":[0.994929,0.002454227,0.0002375798,0.001356504,0.0006031168,0.0004197152],"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.00001532341,0.00001130422,0.00006825426,0.00002832498,0.000006752327,0.00003512228,0.0002557198,0.0001293329,0.00006053863,0.9744634,0.01987251,0.00505355],"study_design_scores_gemma":[0.000008934197,0.000007188605,0.00003912,0.00006114681,0.000004444116,0.00004920895,0.0002151623,0.0002282993,0.0001049403,0.909054,0.090219,0.000008575831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.01074923,0.01543725,0.03500773,0.2484813,0.008990381,0.00004675237,0.0002527826,0.0002703448,0.6807642],"genre_scores_gemma":[0.7240244,0.01297825,0.02207719,0.04553365,0.00625096,0.0002721392,0.0002779529,0.0005568506,0.1880286],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02463573,"threshold_uncertainty_score":0.08241475,"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","authors":[{"name":"Gilles Brassard","is_ca":true},{"name":"Claude Crépeau","is_ca":true},{"name":"Stefan Wolf","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040364,0.001179526,0.001495368,0.001853118,0.003093276,0.005036305,0.002369284,0.003449956,0.01258797],"category_scores_gemma":[0.0234653,0.001501077,0.001648123,0.002648447,0.009637493,0.01793287,0.008395835,0.007682215,0.002152858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002767631,"about_ca_system_score_gemma":0.002029422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004703825,"about_ca_topic_score_gemma":0.0003096767,"domain_scores_codex":[0.9934581,0.002524675,0.0002643865,0.0007069715,0.001798455,0.0012475],"domain_scores_gemma":[0.97255,0.01881835,0.001265991,0.006067235,0.0008443114,0.0004540245],"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.0002321693,0.00004626689,0.0001462866,0.00004435585,0.00001598644,0.0001062275,0.0003184018,0.00629859,0.0009145975,0.9821839,0.00165623,0.008036984],"study_design_scores_gemma":[0.00001996626,0.00001102527,0.00003193547,0.000009819593,0.00001279879,0.00009409201,0.00003009289,0.01208452,0.001522487,0.9848486,0.001323493,0.00001119119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.15802,0.001636711,0.6794756,0.01526301,0.0004993546,0.0003243956,0.000388267,0.001636777,0.142756],"genre_scores_gemma":[0.9452035,0.0006274146,0.01874392,0.0007564566,0.0003223044,0.0002068294,0.0001018671,0.0002410399,0.03379668],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01258797,"threshold_uncertainty_score":0.04211092,"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","authors":[{"name":"Jonathan Katz","is_ca":false},{"name":"Vinod Vaikuntanathan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002129762,0.0005891543,0.001828758,0.0007420074,0.001098589,0.001922204,0.002077904,0.001875571,0.007628805],"category_scores_gemma":[0.00625964,0.0006325985,0.0005926992,0.0009937854,0.001186017,0.004039048,0.005323553,0.00143992,0.003506779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000834227,"about_ca_system_score_gemma":0.002230546,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004206799,"about_ca_topic_score_gemma":0.0006771703,"domain_scores_codex":[0.994424,0.001472137,0.0004916609,0.00078068,0.001748406,0.001083127],"domain_scores_gemma":[0.9953671,0.001218498,0.0003113728,0.002268848,0.0005947542,0.0002395358],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.009340987,0.0006793532,0.001755339,0.0005629856,0.0002539935,0.0007943201,0.0007460972,0.1363634,0.09293034,0.3653778,0.01685446,0.3743409],"study_design_scores_gemma":[0.0005450869,0.0006421817,0.00090236,0.00006452041,0.0001066724,0.0008843365,0.0001572195,0.7164053,0.06359413,0.2060727,0.01043353,0.0001919702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06553004,0.000467971,0.9152879,0.0006158824,0.0002284008,0.0003065808,0.0005000784,0.001985772,0.01507746],"genre_scores_gemma":[0.8641285,0.0001760507,0.127581,0.0001167479,0.00006672966,0.0001190346,0.0003840371,0.0001134377,0.007314341],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007628805,"threshold_uncertainty_score":0.02552086,"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","authors":[{"name":"Yongge Wang","is_ca":true},{"name":"Yvo Desmedt","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005661124,0.0006043729,0.001426317,0.001042774,0.003493813,0.003475202,0.001634291,0.01143135,0.008709589],"category_scores_gemma":[0.03610626,0.0006625481,0.0007634778,0.001442262,0.008996131,0.03261415,0.005568821,0.00802186,0.002425358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001854434,"about_ca_system_score_gemma":0.001739568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008747143,"about_ca_topic_score_gemma":0.0004747558,"domain_scores_codex":[0.9967661,0.001213332,0.0001193793,0.0004543445,0.001030786,0.0004160629],"domain_scores_gemma":[0.9807264,0.01348009,0.0007507648,0.002736612,0.001900856,0.000405258],"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.0001342925,0.00002204702,0.0001214919,0.00008108802,0.00001427536,0.00004086038,0.0002442629,0.0008159481,0.000263442,0.9562209,0.02755054,0.01449099],"study_design_scores_gemma":[0.00003244205,0.00000813593,0.00004173801,0.00002408182,0.000006279709,0.0000513596,0.00007982909,0.00157585,0.0002183706,0.9844633,0.01348619,0.00001241059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.06721897,0.01748211,0.1921115,0.5808322,0.007560103,0.0001006158,0.0005606539,0.0004837711,0.1336502],"genre_scores_gemma":[0.888809,0.0122142,0.03483084,0.0251638,0.01205461,0.0001815887,0.0002238797,0.0002541878,0.02626777],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01143135,"threshold_uncertainty_score":0.02993929,"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","authors":[{"name":"Kaoru Kurosawa","is_ca":false},{"name":"Thomas Johansson","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005875173,0.001123964,0.001550654,0.003670998,0.001810221,0.004457425,0.002035168,0.002255492,0.004481414],"category_scores_gemma":[0.03705792,0.001156791,0.001251496,0.004581102,0.007968412,0.01028214,0.006118459,0.005619295,0.0007322242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001841522,"about_ca_system_score_gemma":0.001277414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002964352,"about_ca_topic_score_gemma":0.0002690953,"domain_scores_codex":[0.9943897,0.002890188,0.0001997215,0.0006629093,0.001439865,0.0004174978],"domain_scores_gemma":[0.9552112,0.03543901,0.002530948,0.004233116,0.001369241,0.001216473],"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.0001218994,0.00002163921,0.0002844329,0.00004568939,0.0000205614,0.00004459917,0.0001055579,0.004126901,0.0002389421,0.9842207,0.0009673034,0.009801797],"study_design_scores_gemma":[0.00002300401,0.00002437625,0.0001539159,0.0000193193,0.00001186786,0.0001422344,0.00003518468,0.02780909,0.0004885937,0.9696403,0.001633673,0.00001845787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.106563,0.004888749,0.8501589,0.005913618,0.0003371054,0.00008893492,0.0004654535,0.0004543471,0.03112976],"genre_scores_gemma":[0.8674049,0.002982853,0.1127459,0.0009041522,0.001388874,0.000288707,0.0004092189,0.0001471927,0.01372815],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005875173,"threshold_uncertainty_score":0.03107125,"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","authors":[{"name":"Ämin Baumeler","is_ca":false},{"name":"Anne Broadbent","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00449239,0.001342145,0.004306124,0.002135885,0.003611081,0.009847103,0.003644922,0.006010198,0.02623758],"category_scores_gemma":[0.04047849,0.001824603,0.002222191,0.004616975,0.006920155,0.02406677,0.006796559,0.008092777,0.006216159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007261307,"about_ca_system_score_gemma":0.007541329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002426252,"about_ca_topic_score_gemma":0.002592637,"domain_scores_codex":[0.9878141,0.00322138,0.0004816452,0.001701211,0.004896683,0.001885073],"domain_scores_gemma":[0.8918428,0.08501419,0.003088066,0.0147255,0.003998691,0.001330828],"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.0009958136,0.0003099565,0.0009398109,0.0004445861,0.000114075,0.0002091695,0.0002904864,0.0312865,0.003279421,0.9044219,0.01613402,0.0415743],"study_design_scores_gemma":[0.0001828165,0.00006454115,0.0003207581,0.00003765858,0.00005070387,0.0001736274,0.00005094463,0.1075634,0.002354339,0.886251,0.002892258,0.00005790343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.186776,0.004875203,0.6244097,0.05094136,0.0009765607,0.0007034382,0.003571189,0.003635677,0.1241109],"genre_scores_gemma":[0.8968939,0.001929856,0.05198803,0.003435603,0.002289742,0.0006918783,0.001414378,0.0006465315,0.04071018],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02623758,"threshold_uncertainty_score":0.08777344,"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","authors":[{"name":"Carlo Blundo","is_ca":false},{"name":"Paolo D’Arco","is_ca":false},{"name":"Alfredo De Santis","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002700117,0.001597129,0.002118762,0.001718767,0.002985807,0.003503582,0.002935315,0.002833491,0.01210138],"category_scores_gemma":[0.009258163,0.001180808,0.001196522,0.002624563,0.006719638,0.01400141,0.01232064,0.006698689,0.002738214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003208451,"about_ca_system_score_gemma":0.001918278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009627645,"about_ca_topic_score_gemma":0.0009112582,"domain_scores_codex":[0.9969341,0.0006141091,0.0001438358,0.0004401941,0.001155159,0.0007126229],"domain_scores_gemma":[0.9932652,0.004029569,0.00023565,0.0018308,0.0004190145,0.0002197692],"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.0002121186,0.0000374135,0.0001010044,0.000055222,0.00001161244,0.00007430749,0.0002134012,0.00652276,0.0008441819,0.9769866,0.002924794,0.01201659],"study_design_scores_gemma":[0.00002334593,0.00001773465,0.00004061174,0.00001799755,0.00001193881,0.00003351835,0.00001622018,0.01781431,0.000758213,0.9787418,0.002509756,0.00001452787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06455386,0.001302516,0.8357959,0.006258651,0.001166435,0.0001990676,0.0003923528,0.001748491,0.08858278],"genre_scores_gemma":[0.8915575,0.001300446,0.04820093,0.001448485,0.0008271781,0.0003740596,0.0004371307,0.0006917401,0.05516252],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01210138,"threshold_uncertainty_score":0.04048318,"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","authors":[{"name":"Ran Canetti","is_ca":false},{"name":"Eyal Kushilevitz","is_ca":false},{"name":"Rafail Ostrovsky","is_ca":false},{"name":"Adi Rosén","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003663195,0.0005850031,0.00129717,0.001297605,0.00148872,0.003936769,0.001611784,0.003523338,0.005691571],"category_scores_gemma":[0.02228248,0.000460035,0.0006123167,0.001347979,0.009488245,0.01489612,0.002876188,0.004952361,0.0009937694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001170519,"about_ca_system_score_gemma":0.0008071209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000166605,"about_ca_topic_score_gemma":0.0001177645,"domain_scores_codex":[0.9963741,0.001435603,0.0002091221,0.0005194768,0.001035656,0.0004260459],"domain_scores_gemma":[0.9680815,0.02042877,0.001734253,0.007860593,0.001237865,0.0006570464],"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.0001252455,0.00001723477,0.0002789533,0.00006294279,0.00001387473,0.00004823387,0.0001221709,0.005330293,0.0004403271,0.9772267,0.001493786,0.01484023],"study_design_scores_gemma":[0.00002968243,0.00006876996,0.0001003224,0.00003411663,0.00002044228,0.0001797679,0.00006695727,0.007997344,0.001171202,0.9839277,0.00638703,0.00001675393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1998436,0.02041864,0.6018415,0.04855802,0.003987808,0.00014609,0.0002753218,0.001183532,0.1237456],"genre_scores_gemma":[0.9671942,0.001918886,0.01796139,0.001252579,0.001597688,0.00007075697,0.00005463052,0.0001436713,0.009806218],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005691571,"threshold_uncertainty_score":0.01937306,"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","authors":[{"name":"Iftach Haitner","is_ca":false},{"name":"Eran Omri","is_ca":false},{"name":"Hila Zarosim","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04595279,0.002037752,0.003997577,0.007068054,0.002103647,0.01254248,0.006663564,0.008084119,0.009737061],"category_scores_gemma":[0.2977647,0.002499715,0.002078083,0.00373766,0.01407022,0.04050466,0.01179396,0.01239202,0.00250701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002409343,"about_ca_system_score_gemma":0.002034716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003995996,"about_ca_topic_score_gemma":0.0002327707,"domain_scores_codex":[0.9561275,0.0219829,0.002262464,0.004052592,0.01166524,0.003909263],"domain_scores_gemma":[0.2940134,0.6344876,0.007626792,0.04879085,0.01018228,0.004899051],"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.001066604,0.0001481177,0.001400942,0.0004332543,0.00007652189,0.0002549324,0.0006245145,0.01494925,0.00214426,0.9449943,0.003164712,0.03074255],"study_design_scores_gemma":[0.0001464059,0.0001659666,0.0006013764,0.0003146238,0.00008275289,0.000686358,0.0001056572,0.07811643,0.002385525,0.9133359,0.003985173,0.00007375849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2959411,0.02707432,0.4585954,0.04286987,0.0008292562,0.000226947,0.001095237,0.002663427,0.1707045],"genre_scores_gemma":[0.9678092,0.00485912,0.01757405,0.001311431,0.001756212,0.0001973141,0.0001912111,0.0005775231,0.005723955],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04595279,"threshold_uncertainty_score":0.2430245,"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","authors":[{"name":"E. Müller","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02077532,0.001205155,0.001654823,0.003761523,0.003186122,0.003874809,0.003964232,0.008126307,0.01754726],"category_scores_gemma":[0.2025997,0.0009201698,0.001737736,0.001993756,0.006890917,0.005965577,0.003504181,0.004030552,0.003178925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006632244,"about_ca_system_score_gemma":0.00147512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003928274,"about_ca_topic_score_gemma":0.0003632466,"domain_scores_codex":[0.9790495,0.008502081,0.001165004,0.004341229,0.005273205,0.001669024],"domain_scores_gemma":[0.6306944,0.3229485,0.009302214,0.02303397,0.007842997,0.006177912],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.02768623,0.00126033,0.412227,0.001885702,0.002098121,0.01390886,0.002227482,0.02892643,0.02751834,0.2642995,0.03207429,0.1858877],"study_design_scores_gemma":[0.003244216,0.002597542,0.06089906,0.0003589885,0.0008971328,0.02670611,0.001357702,0.1891647,0.04730095,0.6424224,0.02454197,0.0005093339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6815574,0.001453642,0.2586142,0.01807381,0.001208026,0.0002921822,0.002237184,0.001792392,0.03477122],"genre_scores_gemma":[0.9768463,0.00007710358,0.01982466,0.001080576,0.0005013316,0.00005601055,0.0005872454,0.00004207682,0.0009846545],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02077532,"threshold_uncertainty_score":0.1098717,"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","authors":[{"name":"Mikael Goldmann","is_ca":false},{"name":"Mats Näslund","is_ca":false},{"name":"Alexander Russell","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007107592,0.002933419,0.004481378,0.005472562,0.005175658,0.01317008,0.007371981,0.0048081,0.02484987],"category_scores_gemma":[0.05425226,0.002413259,0.00420678,0.007029257,0.007771983,0.05077597,0.01197381,0.01656541,0.003371576],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.01009452,"about_ca_system_score_gemma":0.005678485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003426607,"about_ca_topic_score_gemma":0.004804506,"domain_scores_codex":[0.9899477,0.001691599,0.0003417106,0.001819107,0.003058449,0.003141305],"domain_scores_gemma":[0.8814443,0.09748183,0.002768735,0.01092782,0.003502838,0.003874368],"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.001876189,0.0005793921,0.002526909,0.000844852,0.00016258,0.0001871095,0.000634103,0.04786864,0.003769042,0.8727549,0.03035945,0.03843694],"study_design_scores_gemma":[0.0001122837,0.00005627521,0.0005465802,0.00006934298,0.0001052531,0.0001179037,0.0001034532,0.06271227,0.001514602,0.9306458,0.003974524,0.00004168643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2509044,0.009193669,0.4686143,0.03648305,0.001347254,0.0008315144,0.00553838,0.003550624,0.2235367],"genre_scores_gemma":[0.8799818,0.006183045,0.07145858,0.004866468,0.003011127,0.000804243,0.004954849,0.002575551,0.02616437],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02484987,"threshold_uncertainty_score":0.08313107,"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","authors":[{"name":"Rahul Jain","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01452156,0.001304051,0.002734682,0.002084409,0.003488825,0.009528658,0.006127515,0.00780168,0.01825945],"category_scores_gemma":[0.06640819,0.002022629,0.001516238,0.002865667,0.01065695,0.02409726,0.008436715,0.01295219,0.00224746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004002431,"about_ca_system_score_gemma":0.002622896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004311062,"about_ca_topic_score_gemma":0.0006632035,"domain_scores_codex":[0.9903727,0.004214168,0.0004967476,0.001123181,0.002697024,0.001096128],"domain_scores_gemma":[0.9412542,0.04109698,0.002087681,0.01160101,0.002183416,0.001776676],"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.0003173377,0.00006586282,0.0001343267,0.00005840222,0.00001923995,0.00004577285,0.0001357189,0.01289704,0.001422442,0.9698713,0.001610878,0.01342158],"study_design_scores_gemma":[0.00003701175,0.0000314135,0.00005002754,0.00002144367,0.00001470295,0.00004559075,0.00003243603,0.07369341,0.0007272882,0.9246214,0.0006971398,0.00002814548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1123708,0.002020504,0.7975247,0.008019657,0.0006078961,0.0002246827,0.0002746571,0.0009621482,0.07799494],"genre_scores_gemma":[0.9022121,0.0006647893,0.08189446,0.0007390934,0.0004251869,0.0001991057,0.00009316808,0.000489158,0.01328301],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01825945,"threshold_uncertainty_score":0.07679832,"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","authors":[{"name":"Agustín Domínguez-Oviedo","is_ca":false},{"name":"M.A. Hasan","is_ca":true},{"name":"Bijan Ansari","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006519163,0.0004478795,0.0006237301,0.001201756,0.0009018738,0.0008575619,0.0007128284,0.001584783,0.003950488],"category_scores_gemma":[0.002539639,0.0002089873,0.0004782512,0.0009492026,0.0008441745,0.001607257,0.00158358,0.0007859584,0.0009239959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009413796,"about_ca_system_score_gemma":0.0008902849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007708248,"about_ca_topic_score_gemma":0.0007053165,"domain_scores_codex":[0.9989014,0.0002322331,0.00005765851,0.000133654,0.0004222966,0.0002528364],"domain_scores_gemma":[0.9987682,0.0004057937,0.0001362408,0.0003981083,0.000210851,0.00008087961],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.004209715,0.0004171387,0.007655593,0.0003979148,0.0002972571,0.00250869,0.000983812,0.07356071,0.1629127,0.3523677,0.01339832,0.3812905],"study_design_scores_gemma":[0.0004919328,0.001491559,0.004042657,0.0001677923,0.000267402,0.003127282,0.0002341258,0.542316,0.1657685,0.2587916,0.02313897,0.0001621632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6297041,0.0008309886,0.3228523,0.003087322,0.0003510189,0.0001193574,0.0002013293,0.002900272,0.03995318],"genre_scores_gemma":[0.9732956,0.0001183547,0.02190859,0.000160441,0.00003119044,0.00001878728,0.00006410204,0.00003764518,0.00436525],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003950488,"threshold_uncertainty_score":0.01321566,"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","authors":[{"name":"Mohammad Hajiabadi","is_ca":true},{"name":"Shahram Khazaei","is_ca":false},{"name":"Behzad Vahdani","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003387187,0.0009061931,0.001516883,0.001079445,0.001658148,0.00262441,0.003226954,0.002604789,0.00958142],"category_scores_gemma":[0.006876824,0.0007921344,0.001305718,0.00175451,0.002393806,0.006108692,0.006170898,0.004341401,0.002826181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001884997,"about_ca_system_score_gemma":0.00195973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002477943,"about_ca_topic_score_gemma":0.0002512709,"domain_scores_codex":[0.9940864,0.00151744,0.0003270412,0.0008080553,0.002333457,0.000927573],"domain_scores_gemma":[0.9920818,0.002735003,0.000662671,0.003796821,0.0004069664,0.0003168494],"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.00130158,0.0002257646,0.0004849747,0.0003264341,0.0001499331,0.0003663394,0.0004788227,0.03619047,0.01988506,0.8715947,0.007624313,0.06137164],"study_design_scores_gemma":[0.0005974053,0.000390953,0.0004390907,0.0001431994,0.0001630063,0.0007134672,0.00009939071,0.1663547,0.04181326,0.7655706,0.02353491,0.0001799852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1024879,0.002193597,0.8377168,0.004346939,0.0004728585,0.0005895082,0.001256048,0.002814635,0.04812167],"genre_scores_gemma":[0.8767764,0.0008223408,0.09114584,0.0006891579,0.0003170318,0.0003242685,0.0009770783,0.0002261763,0.02872172],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00958142,"threshold_uncertainty_score":0.03205305,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}