{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":211,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":211,"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":"8eb74faf2f3e","filters":{"venue":"IACR Cryptology ePrint Archive"}},"results":[{"id":"W34785529","doi":"","title":"Outsourcing Multi-Party Computation.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":174,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Protocol (science); Secure two-party computation; Outsourcing; Computation; Set (abstract data type); Construct (python library); Secure multi-party computation; Standard Model (mathematical formulation); Scheme (mathematics); Computer security; Programming language; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04780136964815156,"gpt":0.2858845172483337,"spread":0.2380831476001821,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005196469,0.0006175567,0.0007995312,0.0005439128,0.0002989748,0.0002061571,0.002898922,0.0004645553,0.00007262882],"category_scores_gemma":[0.0001255398,0.0006312649,0.0004898026,0.0002565713,0.0004988246,0.0002690744,0.007752725,0.001851939,0.0004222705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004872215,"about_ca_system_score_gemma":0.0002435636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002193863,"about_ca_topic_score_gemma":0.0002209851,"domain_scores_codex":[0.9958839,0.0005393481,0.0007544879,0.001736616,0.0003058679,0.0007797634],"domain_scores_gemma":[0.9966354,0.0004012966,0.0005445946,0.001952292,0.0001506332,0.0003157537],"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.00002362487,0.000273721,0.003757143,0.00008528998,0.0001647525,0.0001019918,0.007679288,0.0009711751,0.00009291212,0.9777247,0.0009525205,0.008172911],"study_design_scores_gemma":[0.0005347633,0.00005170446,0.02059432,0.00008519238,0.00003822666,0.00006276104,0.00006420327,0.03803987,0.0003173704,0.9383315,0.001201261,0.000678781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008473305,0.0002650617,0.9829398,0.0004375516,0.002041999,0.000603504,0.0001398123,0.0006670593,0.004431842],"genre_scores_gemma":[0.09869497,0.00007557149,0.9004261,0.0003427468,0.0001345889,0.0001071541,0.0001882081,0.00003011621,4.955048e-7],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09022167,"threshold_uncertainty_score":0.9996139,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2403115307","doi":"","title":"On Verifying Dynamic Multiple Data Copies over Cloud Servers.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Server; Scalability; Cloud computing; Outsourcing; File server; Computer network; Block (permutation group theory); Cloud storage; Database; Cheating; Service provider; Distributed computing; Service (business); Computer security; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.0590448383529274,"gpt":0.3044836691374198,"spread":0.2454388307844924,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science","research_integrity","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0005482528,0.0006988132,0.0008339136,0.0004085806,0.0003660589,0.0002085037,0.009466354,0.0005270175,0.0001497666],"category_scores_gemma":[0.0007757588,0.0007625474,0.000248394,0.0002137781,0.0006080848,0.0003883889,0.03482213,0.002444409,0.0009299988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002048255,"about_ca_system_score_gemma":0.0004165427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008152102,"about_ca_topic_score_gemma":0.002958495,"domain_scores_codex":[0.9946845,0.000552384,0.0007178072,0.002664348,0.0004461239,0.0009348138],"domain_scores_gemma":[0.9893132,0.001246061,0.0005090374,0.008578212,0.00008712868,0.0002663626],"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.00006263785,0.000275806,0.001598591,0.000113856,0.0002547801,0.0001486729,0.003307908,0.0004406572,0.000110709,0.9834627,0.008709792,0.001513907],"study_design_scores_gemma":[0.0006868708,0.00008451147,0.01340254,0.0002145875,0.00005631836,0.00005632122,0.00005324675,0.1507412,0.00007462218,0.8278391,0.005973653,0.0008169615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07349855,0.0002106281,0.9149344,0.001087503,0.004719035,0.0008016694,0.002148874,0.0006125436,0.00198677],"genre_scores_gemma":[0.2908898,0.0002841672,0.7046475,0.0008762489,0.0002489571,0.0001397625,0.00282911,0.00007870689,0.000005761674],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2173913,"threshold_uncertainty_score":0.999857,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2398056013","doi":"","title":"Efficient and Secure Delegation of Linear Algebra.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Homomorphic encryption; Delegation; Computer science; Multiplication (music); Matrix multiplication; Linear algebra; Encryption; Theoretical computer science; Oblivious transfer; Computation; Mathematics; Algorithm; Combinatorics; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.01632441907637648,"gpt":0.2448443606290776,"spread":0.2285199415527011,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000411431,0.0003661928,0.0005860603,0.0003983259,0.0001232921,0.00003953362,0.001303767,0.0003589717,0.00003160966],"category_scores_gemma":[0.00009868882,0.0003596518,0.0002181299,0.0001981948,0.0005447895,0.0000686497,0.004364612,0.0009317741,0.00002494326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001572388,"about_ca_system_score_gemma":0.0001534223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001301286,"about_ca_topic_score_gemma":0.00007878294,"domain_scores_codex":[0.9974792,0.0002890671,0.0005641826,0.001038256,0.0002407765,0.0003884967],"domain_scores_gemma":[0.9975767,0.000268757,0.0004694717,0.001380446,0.0001354989,0.0001691466],"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.00003775566,0.0001571394,0.00165164,0.0001506306,0.00009423614,0.00001911224,0.00665417,0.000391268,0.0002896136,0.987026,0.00009036354,0.003438057],"study_design_scores_gemma":[0.0003068113,0.00009332541,0.01097504,0.00009344944,0.00003790253,0.0000405408,0.00005461635,0.03249503,0.001749958,0.9535046,0.0003067304,0.0003420015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2606832,0.0003180831,0.7365228,0.0001771778,0.0004756207,0.0003468754,0.0001035467,0.0001070386,0.001265698],"genre_scores_gemma":[0.3772568,0.0001212027,0.6223748,0.00007249077,0.00005959077,0.00003727081,0.00006505554,0.00001269344,8.830783e-8],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1165736,"threshold_uncertainty_score":0.9998856,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3210270412","doi":"","title":"A taxonomy of pairing-friendly elliptic curves","year":2006,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Pairing; Embedding; Elliptic curve; Computer science; Cryptography; Mathematics; Pure mathematics; Theoretical computer science; Physics; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01777655156329359,"gpt":0.2360314912774119,"spread":0.2182549397141183,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004651122,0.0005625153,0.001006559,0.0006571921,0.0001288065,0.00006527438,0.00276717,0.0003563421,0.00003407035],"category_scores_gemma":[0.00009813795,0.0005419149,0.0006764964,0.0003825974,0.0008492573,0.0001195229,0.004119733,0.001271148,0.00007142762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003679369,"about_ca_system_score_gemma":0.000344875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002653087,"about_ca_topic_score_gemma":0.00008942457,"domain_scores_codex":[0.9962028,0.0004604297,0.0009348058,0.001298975,0.0003917387,0.0007112488],"domain_scores_gemma":[0.9962746,0.000605889,0.0007196971,0.002067348,0.0001587646,0.0001737269],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002228165,0.0003589422,0.0149993,0.001048241,0.0002879322,0.0001344772,0.0004676939,0.001466851,0.0002228489,0.9668884,0.004318765,0.009784292],"study_design_scores_gemma":[0.0005809871,0.0002270384,0.05111358,0.001166956,0.0001292691,0.0001143773,0.00002984108,0.006745407,0.001509563,0.9282556,0.009179887,0.0009475191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02559049,0.002802506,0.9603639,0.001145339,0.0009538734,0.0009654189,0.00005009477,0.000267252,0.007861153],"genre_scores_gemma":[0.1150941,0.0006340969,0.8833967,0.0002142226,0.0001425035,0.0004239076,0.00005445414,0.00003433713,0.000005631538],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.08950362,"threshold_uncertainty_score":0.9997032,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W115500278","doi":"","title":"On the Use of Financial Data as a Random Beacon.","year":2010,"lang":"en","type":"article","venue":"IACR Cryptology ePrint Archive","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Randomness; Computer science; Random number generation; Cryptography; Beacon; Entropy (arrow of time); Randomness tests; Pseudorandom number generator; Pseudorandomness; Theoretical computer science; Algorithm; Computer network; Statistics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03695438671327419,"gpt":0.2636028940946578,"spread":0.2266485073813836,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005076766,0.000138094,0.0002725731,0.00008811185,0.0001131581,0.00005788555,0.002088183,0.00007457259,0.0001158366],"category_scores_gemma":[0.001414438,0.00009066991,0.0001199785,0.0001189333,0.0002837208,0.0001532542,0.00102405,0.0005761689,0.0001432748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004001557,"about_ca_system_score_gemma":0.00009575947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004092081,"about_ca_topic_score_gemma":0.0004263222,"domain_scores_codex":[0.9985736,0.0002074673,0.0003118654,0.0004679826,0.0001811419,0.0002579707],"domain_scores_gemma":[0.9968544,0.001801338,0.000171615,0.001061708,0.00005597595,0.00005502506],"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.00004984361,0.00005929076,0.0001074874,0.000001868866,0.00003869557,0.00001894728,0.0010949,0.0003760954,0.000500217,0.9895627,0.002434856,0.005755083],"study_design_scores_gemma":[0.001018665,0.000162982,0.002783925,0.00003150633,0.00004154426,0.00007334366,0.00003365795,0.846455,0.001068447,0.1287102,0.01934063,0.0002800151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3406975,0.000004071537,0.6570975,0.001150487,0.0003253364,0.0001055043,0.000009012468,0.0000273343,0.0005833134],"genre_scores_gemma":[0.8936723,0.000003339619,0.1053979,0.0008243304,0.0000738082,0.000007658527,0.00001021524,0.000005560754,0.0000048832],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8608525,"threshold_uncertainty_score":0.3880399,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W36205663","doi":"","title":"Attribute-Based Encryption with Key Cloning Protection.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"Encryption; Computer science; Security token; Computer security; Attribute-based encryption; Probabilistic encryption; Scheme (mathematics); Key (lock); Ciphertext; Delegation; Theoretical computer science; Public-key cryptography; Mathematics; Law; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.02518052485577259,"gpt":0.2350324610392741,"spread":0.2098519361835015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0004382277,0.0006959953,0.0007692473,0.0006974703,0.0005341246,0.0002094475,0.002113209,0.0005276541,0.00003501461],"category_scores_gemma":[0.0001193266,0.0006464222,0.0003763188,0.0005368551,0.0006826257,0.0003185052,0.002346815,0.002356849,0.0001356059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001169808,"about_ca_system_score_gemma":0.0006894378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002140578,"about_ca_topic_score_gemma":0.0002251972,"domain_scores_codex":[0.995527,0.0005821172,0.000631922,0.001869511,0.0005487928,0.0008406398],"domain_scores_gemma":[0.9962919,0.0003091324,0.0005974952,0.002281024,0.0002393527,0.0002810558],"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.0002135115,0.0003359381,0.005045721,0.0001672845,0.0002027119,0.0003282952,0.002309718,0.005592425,0.0004632303,0.9807421,0.0006081138,0.003990953],"study_design_scores_gemma":[0.001829005,0.0005333596,0.02811146,0.0004481124,0.0000805672,0.0005571796,0.0000671062,0.04490237,0.003572704,0.9071845,0.01100811,0.001705525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04448408,0.0001386413,0.9497981,0.001678881,0.0007905547,0.00121089,0.0001440957,0.0007607032,0.0009940679],"genre_scores_gemma":[0.1435361,0.0001557066,0.8548452,0.0003016072,0.0002091466,0.000597176,0.0003160927,0.00003858999,3.751125e-7],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09905201,"threshold_uncertainty_score":0.9999447,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2396907655","doi":"","title":"Re-Encryption-Based Key Management Towards Secure and Scalable Mobile Applications in Clouds.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cloud computing; Mobile cloud computing; Encryption; Client-side encryption; Scalability; Computer security; Mobile device; Key management; Cloud computing security; Computer network; Distributed computing; On-the-fly encryption; Database; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01521569710605519,"gpt":0.2575426950589091,"spread":0.242326997952854,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005569724,0.0005415723,0.0006584573,0.0007201416,0.0002108585,0.0001554021,0.002104799,0.0004119981,0.00009310846],"category_scores_gemma":[0.00002177012,0.000559942,0.0002285936,0.0004721544,0.0005043529,0.0001772097,0.004398779,0.001249455,0.00006956197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007301934,"about_ca_system_score_gemma":0.0001820737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003361903,"about_ca_topic_score_gemma":0.0006178623,"domain_scores_codex":[0.9962903,0.0003320074,0.0006583707,0.001761962,0.0002931788,0.0006641707],"domain_scores_gemma":[0.9968637,0.0002378988,0.0003177827,0.002252641,0.00008098659,0.0002469895],"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.00003512549,0.0003705324,0.006859096,0.0003077729,0.00008376834,0.0000472113,0.003170077,0.0004451507,0.00001618391,0.979642,0.0003174736,0.008705622],"study_design_scores_gemma":[0.0005701507,0.00007526681,0.02345233,0.0001202861,0.00004194366,0.000006383408,0.0003017238,0.005453621,0.0001976424,0.9625555,0.006655233,0.0005699428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02273078,0.0005019178,0.9614832,0.0003857469,0.0003749346,0.002028145,0.000181366,0.0002775547,0.01203637],"genre_scores_gemma":[0.1892602,0.0005944142,0.8069315,0.0002884567,0.00006829178,0.002504404,0.000322855,0.00002892598,9.325182e-7],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1665294,"threshold_uncertainty_score":0.9996852,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2399698160","doi":"","title":"Scalable, Server-Passive, User-Anonymous Timed Release Public Key Encryption from Bilinear Pairing.","year":2004,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Anonymity; Computer network; Communication source; Encryption; Network Time Protocol; Key (lock); Public-key cryptography; Broadcast encryption; Computer security; Scheme (mathematics); Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01804911491935102,"gpt":0.2395105284474859,"spread":0.2214614135281349,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006490599,0.001149281,0.001359561,0.001002491,0.0004933143,0.0006911971,0.004984591,0.001085403,0.0004034744],"category_scores_gemma":[0.00059286,0.00119576,0.0008669739,0.0007848925,0.0008400689,0.0008561672,0.0092568,0.003122925,0.001055142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003035792,"about_ca_system_score_gemma":0.001383879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001606461,"about_ca_topic_score_gemma":0.001264009,"domain_scores_codex":[0.9919642,0.001040281,0.001335045,0.003296218,0.0008815749,0.001482687],"domain_scores_gemma":[0.9923185,0.0008610819,0.0009571741,0.004675784,0.0003713967,0.0008161399],"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.0001244185,0.0007594853,0.006568126,0.0001541019,0.0004318229,0.0004479541,0.001758659,0.001518176,0.0005977604,0.9776081,0.001742824,0.008288519],"study_design_scores_gemma":[0.001448058,0.0001540636,0.02191493,0.0002423645,0.0001008357,0.00006464587,0.00006123704,0.0115219,0.001347716,0.9523687,0.009479538,0.001295966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1901772,0.0004136467,0.8004218,0.003158066,0.001849617,0.000999296,0.0007123926,0.001030601,0.00123735],"genre_scores_gemma":[0.2133983,0.0004783325,0.7824112,0.0008177391,0.000538194,0.000333426,0.001931047,0.00008871725,0.000002981825],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02523941,"threshold_uncertainty_score":0.9997227,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949485271","doi":"","title":"Public Key Encryption with Keyword Search Revisited.","year":2005,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Scheme (mathematics); Encryption; Inefficiency; Keyword search; Key (lock); Computer security; Public-key cryptography; Channel (broadcasting); Theoretical computer science; Information retrieval; Computer network; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03917362331164062,"gpt":0.263392807182281,"spread":0.2242191838706404,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001036354,0.0008050582,0.0009627301,0.001080744,0.0003906498,0.0006292858,0.004188031,0.0005947549,0.0002389157],"category_scores_gemma":[0.0001328951,0.0007322154,0.0004159794,0.0007759833,0.0007870997,0.0006741165,0.007060301,0.003039049,0.0004914151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001345304,"about_ca_system_score_gemma":0.000634835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008959617,"about_ca_topic_score_gemma":0.0003041044,"domain_scores_codex":[0.9938338,0.0009033393,0.0007930359,0.002370695,0.0008015613,0.001297499],"domain_scores_gemma":[0.9946384,0.0004861046,0.0004488455,0.003541926,0.0003537702,0.0005309449],"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.00007879356,0.0002531763,0.006218746,0.0001273998,0.0002105101,0.0001335421,0.002528301,0.000231193,0.0001240024,0.9626275,0.001121016,0.02634585],"study_design_scores_gemma":[0.0008151866,0.0002551899,0.02122271,0.0002662884,0.00005875132,0.0002844323,0.000081155,0.007546072,0.0002859952,0.9399949,0.02798493,0.001204358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03066734,0.0005630511,0.9490552,0.005302378,0.0005073681,0.0009361434,0.0001840027,0.0006825178,0.01210201],"genre_scores_gemma":[0.1095511,0.0008707994,0.8877031,0.0005964313,0.0004971151,0.0002007046,0.0005290813,0.00005003217,0.000001601967],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.07888375,"threshold_uncertainty_score":0.9995129,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W181112729","doi":"","title":"A 32-bit RC4-like Keystream Generator.","year":2005,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Keystream; RC4; Computer science; Generator (circuit theory); Stream cipher; Self-shrinking generator; Randomness; Encryption; Bit (key); Software; State (computer science); Algorithm; Computer hardware; Cryptography; Mathematics; Power (physics); Computer network; Electrical engineering; Operating system; Induction generator; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01928593122520285,"gpt":0.2828424928633809,"spread":0.263556561638178,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000475086,0.0006994384,0.0008132813,0.0006845743,0.000378718,0.000325565,0.002822866,0.0003801029,0.0002870584],"category_scores_gemma":[0.00005409094,0.0007240883,0.0005469475,0.0003682075,0.0004022602,0.0002073933,0.005517431,0.001567071,0.0003317408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001222629,"about_ca_system_score_gemma":0.0005154807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000249328,"about_ca_topic_score_gemma":0.0008094603,"domain_scores_codex":[0.9953406,0.0004780314,0.0009379031,0.001767347,0.0004765684,0.0009995376],"domain_scores_gemma":[0.9962844,0.0003093331,0.0004930624,0.002392065,0.0001764371,0.000344699],"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.00001602456,0.0002435797,0.003276516,0.0000470729,0.0002315632,0.0001063381,0.003932498,0.0005179621,0.0003066965,0.9603016,0.005295608,0.02572458],"study_design_scores_gemma":[0.0008703272,0.0001229236,0.01355051,0.00006501094,0.00007279713,0.0001703085,0.0001419522,0.0168696,0.0006189088,0.9113793,0.05503492,0.00110343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1142527,0.0002790759,0.8745086,0.002598149,0.001952273,0.0007355288,0.0001468879,0.0004399646,0.005086882],"genre_scores_gemma":[0.1677813,0.000376574,0.8292869,0.001261438,0.0005947137,0.0004039917,0.0002397744,0.00004702319,0.000008314174],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05352859,"threshold_uncertainty_score":0.999521,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3029452169","doi":"","title":"Another Look at \"Provable Security\". II.","year":2004,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Provable security; Computer security; Cryptography","retraction":null,"screen_n_in":null,"score":{"opus":0.01645337355455491,"gpt":0.2709123745534825,"spread":0.2544590009989276,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0004397916,0.0006284308,0.0007409751,0.0005609773,0.0006681876,0.000176144,0.002364246,0.0004217955,0.0006428953],"category_scores_gemma":[0.00004869601,0.0006469626,0.000482696,0.0003256179,0.0005108889,0.0001860796,0.01068459,0.001280409,0.0003267525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002835033,"about_ca_system_score_gemma":0.0005332884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004192064,"about_ca_topic_score_gemma":0.001311439,"domain_scores_codex":[0.9958611,0.0002893244,0.0007671853,0.001670497,0.0004423744,0.0009695009],"domain_scores_gemma":[0.9968122,0.0001950189,0.0004575354,0.002187628,0.0001383218,0.0002093083],"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.00002557956,0.0002600433,0.001887157,0.00008785896,0.000182718,0.00009876598,0.009834456,0.0004148568,0.0003077516,0.9833375,0.00194802,0.001615318],"study_design_scores_gemma":[0.0008211385,0.0001286509,0.001989872,0.00007380832,0.00003584129,0.0001093852,0.00009093161,0.002415776,0.001108237,0.9670392,0.0255137,0.0006734053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.12139,0.0002847285,0.8607975,0.003055354,0.001333904,0.0009490742,0.0001261472,0.0004299237,0.01163336],"genre_scores_gemma":[0.3816227,0.0002895022,0.6152831,0.001676292,0.0002758039,0.0004886448,0.0002553685,0.00007725177,0.00003132855],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2602327,"threshold_uncertainty_score":0.9995981,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2950596278","doi":"","title":"Privacy-aware Attribute-based Encryption with User Accountability.","year":2009,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Ciphertext; Attribute-based encryption; Computer science; Encryption; Computer security; Access control; Accountability; Key (lock); Scheme (mathematics); Public-key cryptography; Access structure; Cryptography; Secret sharing; Mathematics; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.01708966988669608,"gpt":0.2629797871105366,"spread":0.2458901172238405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0007797859,0.0009277575,0.001062065,0.0006385276,0.0003379454,0.0004005565,0.004166444,0.0006910078,0.0001070632],"category_scores_gemma":[0.0001207006,0.0008392014,0.0004933944,0.000562963,0.0006684114,0.0005026244,0.003690086,0.002333959,0.0001533588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000171116,"about_ca_system_score_gemma":0.0008213051,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001635399,"about_ca_topic_score_gemma":0.0003921035,"domain_scores_codex":[0.9941711,0.0007220377,0.0008297501,0.002489705,0.0007129011,0.00107448],"domain_scores_gemma":[0.9937452,0.0006153101,0.0006327816,0.004305545,0.0003301308,0.0003710274],"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.0002645657,0.0006626093,0.03460083,0.0002091258,0.0001701123,0.0001535475,0.00160241,0.001253303,0.0001440198,0.9537557,0.001176594,0.006007131],"study_design_scores_gemma":[0.00123835,0.0003897798,0.1020038,0.0002732549,0.00008732132,0.00007461305,0.00005821691,0.007439231,0.000863796,0.8788161,0.007528916,0.001226592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1019953,0.0001195491,0.8922824,0.002265937,0.0006081379,0.001148116,0.0003533163,0.0007232676,0.0005039267],"genre_scores_gemma":[0.2542506,0.000069623,0.743514,0.0009151692,0.0001860396,0.0002379518,0.0007889505,0.00003735259,2.521601e-7],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1522554,"threshold_uncertainty_score":0.9999677,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949439822","doi":"","title":"Cryptographic hash functions from expander graphs.","year":2006,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Hash function; Collision resistance; Expander graph; Ramanujan's sum; Rolling hash; Double hashing; Cryptographic hash function; Discrete mathematics; SWIFFT; Mathematics; SHA-2; Computer science; Graph; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01506809800087223,"gpt":0.2339711279922226,"spread":0.2189030299913503,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0005116249,0.0009794469,0.00107916,0.001411809,0.00059289,0.0004188957,0.003620242,0.0007702746,0.000265242],"category_scores_gemma":[0.00007395791,0.001015699,0.001275474,0.0008127254,0.001009141,0.0002604671,0.004998552,0.002468397,0.0003768132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005301115,"about_ca_system_score_gemma":0.0002618992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005573297,"about_ca_topic_score_gemma":0.0005644762,"domain_scores_codex":[0.9941847,0.000744389,0.0009693098,0.002473719,0.0005290252,0.001098796],"domain_scores_gemma":[0.9945466,0.000985164,0.000590614,0.003353755,0.0001761426,0.0003477209],"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.00005980674,0.0003283001,0.01631255,0.00003649208,0.0004962057,0.00007765178,0.001017602,0.0007641549,0.0005259451,0.9649897,0.00512515,0.01026644],"study_design_scores_gemma":[0.0005720832,0.00009094008,0.0652702,0.0001156995,0.000120369,0.00002956582,0.00005195544,0.001066438,0.0001841917,0.9265984,0.004948955,0.0009512533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1509871,0.0005941605,0.8308852,0.001017762,0.003361306,0.0005655088,0.00020979,0.001119277,0.01125989],"genre_scores_gemma":[0.4103392,0.000173749,0.5868588,0.0008231766,0.0005565641,0.0006129207,0.0005240298,0.00009835151,0.00001321278],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.259352,"threshold_uncertainty_score":0.9998329,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3212030079","doi":"","title":"Iron: Functional Encryption using Intel SGX","year":2016,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Guard (computer science); Cryptographic primitive; Cryptography; Encryption; Context (archaeology); Theoretical computer science; Functional encryption; Construct (python library); Cryptographic protocol; Computer security; Programming language; Ciphertext","retraction":null,"screen_n_in":null,"score":{"opus":0.05872375147886557,"gpt":0.2922273820116055,"spread":0.2335036305327399,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005481455,0.0004287232,0.0004698755,0.0003934669,0.0003358927,0.0001696023,0.001716519,0.0004313045,0.0001759181],"category_scores_gemma":[0.0002477576,0.0004089835,0.0002845528,0.0001571388,0.0003733371,0.0002313469,0.004146776,0.001155632,0.0004309089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002287062,"about_ca_system_score_gemma":0.0004331807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002553137,"about_ca_topic_score_gemma":0.000007374972,"domain_scores_codex":[0.9965539,0.0004603808,0.000669151,0.001380289,0.0003750376,0.0005612379],"domain_scores_gemma":[0.9968308,0.0008157306,0.0005493065,0.001439206,0.0001953809,0.0001695815],"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.000024249,0.00006825323,0.001360929,0.00005338403,0.00006200206,0.00001806216,0.001282423,0.002569875,0.002252909,0.9811967,0.0003748205,0.01073638],"study_design_scores_gemma":[0.0002842008,0.00002947863,0.005418396,0.0001705092,0.00001876717,0.0001102888,0.00003728906,0.1123153,0.0007744191,0.8783542,0.002024553,0.0004626068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03699733,0.0001175224,0.9525559,0.001620665,0.004719831,0.0003419513,0.00001962554,0.0003882431,0.003238949],"genre_scores_gemma":[0.3204944,0.00004594445,0.6779408,0.0004302252,0.0009512287,0.00006604759,0.00003884578,0.0000278844,0.000004634087],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.283497,"threshold_uncertainty_score":0.9998362,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2403185010","doi":"","title":"Imperfect Decryption and an Attack on the NTRU Encryption Scheme.","year":2003,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"NTRU; Padding; Computer science; Cryptosystem; Encryption; Public-key cryptography; Computer security; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.04247813839381644,"gpt":0.3088640541697436,"spread":0.2663859157759271,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001116317,0.0006368845,0.0005745146,0.0003683408,0.0005131845,0.0003836527,0.00189107,0.0004950127,0.0001040169],"category_scores_gemma":[0.0002521758,0.0005037994,0.0002777767,0.0002724597,0.0006593892,0.0003554402,0.002317206,0.001943214,0.0001473862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006104449,"about_ca_system_score_gemma":0.0001730013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005402648,"about_ca_topic_score_gemma":0.0001204825,"domain_scores_codex":[0.9953064,0.001304075,0.0005442603,0.00175749,0.0003974569,0.0006902922],"domain_scores_gemma":[0.9958009,0.0007992069,0.0003868716,0.002621604,0.0001038071,0.0002876647],"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.00005621113,0.0001751235,0.001908253,0.00004352911,0.00008830825,0.00002398335,0.001753638,0.00006855007,0.0009858861,0.9891764,0.0009371381,0.004782987],"study_design_scores_gemma":[0.0003952784,0.0002822832,0.0172573,0.0000882125,0.00003323624,0.00008447172,0.0001006876,0.008977366,0.0006266673,0.9674201,0.004124715,0.0006096878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3610467,0.0001765509,0.6334644,0.001308612,0.0007689618,0.0006506607,0.00006011328,0.0002050411,0.002318958],"genre_scores_gemma":[0.3154096,0.000995526,0.6806105,0.001957817,0.0003603603,0.0003611799,0.0002520027,0.00005234065,6.612112e-7],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04714609,"threshold_uncertainty_score":0.9997414,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2950443886","doi":"","title":"Pass-thoughts: Authenticating With Our Minds.","year":2005,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Status quo; Brain–computer interface; Human–computer interaction; Space (punctuation); Interface (matter); Authentication (law); Computer security; Psychology; Neuroscience","retraction":null,"screen_n_in":null,"score":{"opus":0.01701529740211745,"gpt":0.2679101938523389,"spread":0.2508948964502214,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005467808,0.0005955825,0.0007921215,0.0003829852,0.0002326059,0.0003407169,0.003130884,0.000382095,0.00002245104],"category_scores_gemma":[0.0001057679,0.0005204781,0.0002633597,0.0002354994,0.0001926351,0.0001909431,0.00298331,0.001381142,0.0007005055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001049694,"about_ca_system_score_gemma":0.0003790161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000379835,"about_ca_topic_score_gemma":0.0001776508,"domain_scores_codex":[0.9957111,0.0005563835,0.0008283298,0.001632808,0.0004900256,0.0007813874],"domain_scores_gemma":[0.995991,0.0002243662,0.0006958055,0.002593202,0.0001858501,0.0003097898],"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.00003103955,0.0003311547,0.004530656,0.0001793902,0.0003564499,0.0001061421,0.1009578,0.0001274622,0.0002263703,0.882062,0.001259833,0.009831681],"study_design_scores_gemma":[0.001288346,0.000169749,0.01366458,0.0005790083,0.0001436968,0.0004628377,0.001307737,0.1626719,0.001171497,0.7994658,0.01732184,0.001752961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04812003,0.0001575464,0.9368198,0.009114351,0.001167316,0.0008378853,0.00002942411,0.0005125263,0.003241142],"genre_scores_gemma":[0.6103112,0.00002743865,0.3884725,0.000362183,0.0004638598,0.0002446216,0.00004235655,0.0000394641,0.00003637311],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5621912,"threshold_uncertainty_score":0.9997247,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2495523385","doi":"","title":"Resource Fairness and Composability of Cryptographic Protocols.","year":2005,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Universal composability; Composability; Impossibility; Commit; Protocol (science); Cryptography; Cryptographic primitive; Proof-of-work system; Cryptographic protocol; Computer security; Secure multi-party computation; Resource (disambiguation); Theoretical computer science; Distributed computing; Computer network; Cryptocurrency","retraction":null,"screen_n_in":null,"score":{"opus":0.01821921392728335,"gpt":0.2822069954822428,"spread":0.2639877815549594,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001014863,0.0006567055,0.001211937,0.0006486514,0.0002010481,0.0001444076,0.002985859,0.0005561398,0.00003824059],"category_scores_gemma":[0.0001614218,0.0006560269,0.0004681949,0.0004509138,0.001905362,0.0002386567,0.008395399,0.00174941,0.00001219134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003154189,"about_ca_system_score_gemma":0.0002339007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001136456,"about_ca_topic_score_gemma":0.0001724249,"domain_scores_codex":[0.9950213,0.0008661614,0.001087819,0.001868619,0.0004706429,0.0006854261],"domain_scores_gemma":[0.9949312,0.0007402444,0.0007541953,0.003088346,0.0001739499,0.000312042],"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.0001209981,0.0004408812,0.02570596,0.0005204118,0.0001385014,0.00001969486,0.002847162,0.0001097556,0.0003631834,0.9577287,0.0002403137,0.01176441],"study_design_scores_gemma":[0.0006735462,0.0001577965,0.06729713,0.000245204,0.00003502987,0.00005916426,0.00007763201,0.002624487,0.0007607819,0.919165,0.008302209,0.000601986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09686528,0.0002521682,0.8916301,0.001184718,0.0001954727,0.007095553,0.0002439995,0.0002969663,0.002235726],"genre_scores_gemma":[0.1788679,0.00009591904,0.8172897,0.0001796733,0.0001405949,0.003296935,0.00009773937,0.00003142057,1.487811e-7],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.08200265,"threshold_uncertainty_score":0.9996245,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2479395603","doi":"","title":"Authenticated Network Time Synchronization","year":2015,"lang":"en","type":"article","venue":"IACR Cryptology ePrint Archive","topic":"Network Time Synchronization Technologies","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Network Time Protocol; Computer science; Key exchange; Synchronization (alternating current); Authentication (law); Cryptography; Public-key cryptography; Computer network; Computer security; Key (lock); Time synchronization; Encryption","retraction":null,"screen_n_in":null,"score":{"opus":0.01273441275611105,"gpt":0.2235404354263354,"spread":0.2108060226702244,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003654882,0.0002106523,0.0002713495,0.0001628667,0.0001405753,0.0000829963,0.001319399,0.0001501847,0.000106504],"category_scores_gemma":[0.0002833416,0.0002077464,0.00005686747,0.0007423283,0.0003102424,0.0002774775,0.001075953,0.0002533728,0.003279491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001028721,"about_ca_system_score_gemma":0.0001915106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004410871,"about_ca_topic_score_gemma":0.000004790675,"domain_scores_codex":[0.9980751,0.0002376261,0.0003392772,0.000558707,0.0002298867,0.000559355],"domain_scores_gemma":[0.9984002,0.0001844191,0.0001783099,0.0009148096,0.0001617887,0.0001604788],"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.000007816401,0.00004020986,0.002074682,0.000003209315,0.00003818483,0.00002450391,0.0004808273,0.008773338,0.00009292555,0.9564855,0.01554457,0.01643429],"study_design_scores_gemma":[0.0003130079,0.00007915568,0.0007179371,0.00001245425,0.000007888625,0.00005080731,0.00001531327,0.2768658,0.0003280167,0.7165864,0.004817209,0.0002059994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002285338,0.000144982,0.9864554,0.00250024,0.0004568785,0.0002646659,0.000001620545,0.001476645,0.006414193],"genre_scores_gemma":[0.1588902,0.00001565977,0.8405288,0.0002645687,0.0001636665,0.00004209482,0.00003204547,0.00002492134,0.00003807406],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2680925,"threshold_uncertainty_score":0.9974965,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3031052868","doi":"","title":"Squaring in cyclotomic subgroups.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"French Language Learning Methods","field":"Social Sciences","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Computer science; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.02348332380350394,"gpt":0.3467552850420604,"spread":0.3232719612385564,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003101813,0.0004320201,0.0008058113,0.0006251873,0.0003068451,0.000114761,0.001504376,0.001195868,0.0008541842],"category_scores_gemma":[0.003034122,0.000490444,0.0002741196,0.0002388345,0.00145723,0.00008052055,0.001759071,0.005792386,0.000301596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002804226,"about_ca_system_score_gemma":0.0007541051,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.01877588,"about_ca_topic_score_gemma":0.09401812,"domain_scores_codex":[0.9938969,0.002843539,0.0006345251,0.001128858,0.0004129724,0.001083206],"domain_scores_gemma":[0.996628,0.001663858,0.000410574,0.0009672095,0.00007016368,0.0002602009],"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.00004129068,0.0001078216,0.1075229,0.0000693902,0.00005569277,0.000305011,0.05129934,0.0008939306,0.002326749,0.8060063,0.0001141949,0.03125742],"study_design_scores_gemma":[0.0004105015,0.00002534266,0.09778838,0.0001521502,0.00003119627,0.00001264309,0.001484592,0.0005877371,0.0002896583,0.8779216,0.02061223,0.0006840042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.7556649,0.0002881672,0.1481307,0.001809407,0.003096318,0.0009056564,0.00001327573,0.0003488446,0.08974268],"genre_scores_gemma":[0.4489298,0.0001386419,0.5495118,0.0002104379,0.0008107649,0.0002465316,0.00004110401,0.00006689497,0.00004390718],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4013812,"threshold_uncertainty_score":0.9997547,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3185400193","doi":"10.48550/arxiv.2004.02264","title":"PrivFL: Practical Privacy-preserving Federated Regressions on High-dimensional Data over Mobile Networks","year":2020,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Homomorphic encryption; Encryption; Protocol (science); Federated learning; Information privacy; Semantic security; Scheme (mathematics); Robustness (evolution); Computer network; Machine learning; Artificial intelligence; Computer security; Public-key cryptography","retraction":null,"screen_n_in":null,"score":{"opus":0.07637538680421993,"gpt":0.3490333168209711,"spread":0.2726579300167511,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","open_science","research_integrity"],"consensus_categories":["open_science","research_integrity"],"category_scores_codex":[0.001176547,0.001256928,0.001536854,0.0005170893,0.0007087414,0.0006906964,0.07830168,0.0014879,0.0002764086],"category_scores_gemma":[0.05182274,0.001185951,0.0002746021,0.0006640683,0.0008909305,0.0009086984,0.6989697,0.007884679,0.0003967245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000265322,"about_ca_system_score_gemma":0.001120661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001619905,"about_ca_topic_score_gemma":0.00006018176,"domain_scores_codex":[0.9889466,0.001512538,0.001399132,0.005297154,0.001211924,0.00163269],"domain_scores_gemma":[0.9552268,0.003931825,0.001205216,0.03882801,0.0002239722,0.000584188],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003045863,0.0006433515,0.0008623829,0.0001380214,0.00064555,0.001656136,0.0001590233,0.007881016,0.000552417,0.2568408,0.7217402,0.008576472],"study_design_scores_gemma":[0.0004426209,0.0001420465,0.001507018,0.0003577006,0.00004473526,0.00008845986,0.00001156876,0.4943043,0.0002644015,0.4989259,0.003238351,0.0006728738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01250371,0.0002414851,0.8863254,0.09227453,0.002887648,0.001697674,0.0006384972,0.002615627,0.0008154053],"genre_scores_gemma":[0.07561184,0.0003065445,0.9188904,0.001769439,0.0004606707,0.0004300156,0.002400945,0.0001267294,0.000003403226],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7185019,"threshold_uncertainty_score":0.9998084,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2185939662","doi":"","title":"Asynchronous Distributed Private-Key Generators for Identity-Based Cryptography","year":2009,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Random oracle; Computer science; Asynchronous communication; Scheme (mathematics); Encryption; The Internet; Public-key cryptography; Key (lock); Computer security; Bilinear interpolation; Cryptography; Protocol (science); Computer network; Theoretical computer science; Distributed computing; Mathematics; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.01574802926459836,"gpt":0.2727249808000736,"spread":0.2569769515354753,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009076115,0.001083617,0.001311074,0.001106584,0.0005864272,0.0006804444,0.00491436,0.0008528635,0.00004180571],"category_scores_gemma":[0.0002558876,0.001157686,0.001378786,0.0008822806,0.0006821167,0.0005481513,0.003168141,0.001700652,0.00006505838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000133263,"about_ca_system_score_gemma":0.0006125773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003560592,"about_ca_topic_score_gemma":0.0002025738,"domain_scores_codex":[0.9936772,0.0006165801,0.00118312,0.002487546,0.0006207274,0.001414823],"domain_scores_gemma":[0.9943289,0.000695689,0.0008412066,0.003284455,0.000317701,0.0005320029],"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.0001165644,0.0005136125,0.002476439,0.0002219742,0.0002882359,0.00007386255,0.0004258475,0.001651112,0.0003209162,0.9881742,0.001638386,0.004098873],"study_design_scores_gemma":[0.0012137,0.0002949352,0.005406538,0.0001228587,0.000115484,0.00002148576,0.0000148124,0.01044991,0.002282462,0.9730087,0.005918885,0.001150234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01609248,0.0004934059,0.9746441,0.001386228,0.001921753,0.001954882,0.002294307,0.0008927624,0.000320128],"genre_scores_gemma":[0.01305352,0.0001339401,0.9822119,0.0009519325,0.0003684848,0.0006067133,0.002618683,0.00005485559,4.048391e-9],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01516548,"threshold_uncertainty_score":0.9990873,"prediction_status":"machine_predicted_unvalidated"},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"agree"},{"id":"W2397122158","doi":"","title":"Setting Speed Records with the (Fractional) Multibase Non-Adjacent Form Method for Efficient Elliptic Curve Scalar Multiplication.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Scalar multiplication; Precomputation; Scalar (mathematics); Elliptic curve; Complex multiplication; Jacobian matrix and determinant; Mathematics; Computer science; Generalization; Speedup; Algorithm; Arithmetic; Applied mathematics; Pure mathematics; Parallel computing; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01474522547207931,"gpt":0.2799320463613278,"spread":0.2651868208892486,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001263406,0.0007097368,0.0007672574,0.0004932049,0.000955675,0.0001637382,0.002233513,0.0003629402,0.00001068429],"category_scores_gemma":[0.0002443668,0.0004996516,0.0006452606,0.0004430427,0.0006024614,0.0001088879,0.001951335,0.001649515,0.00005712834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000164608,"about_ca_system_score_gemma":0.0005088133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001794134,"about_ca_topic_score_gemma":0.0001522085,"domain_scores_codex":[0.995347,0.0005654396,0.0007726514,0.001827921,0.0005496099,0.0009373768],"domain_scores_gemma":[0.9927636,0.003563481,0.0008669943,0.002115919,0.0004325236,0.0002575292],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007883954,0.00173789,0.007554922,0.0006316295,0.001630149,0.0001675677,0.02120867,0.4548529,0.00194989,0.4344007,0.003010011,0.07206724],"study_design_scores_gemma":[0.001504715,0.0001999182,0.01995962,0.0001833356,0.0001391072,0.0003224413,0.0002745059,0.8815754,0.001848434,0.08957487,0.003602291,0.0008153397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.032675,0.0001862131,0.9555116,0.006895991,0.000908428,0.003096076,0.00008782685,0.0002333516,0.0004055687],"genre_scores_gemma":[0.04845347,0.0001919392,0.9495874,0.0004640379,0.0002719628,0.0008670871,0.00009857601,0.00005868364,0.00000683015],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4267225,"threshold_uncertainty_score":0.9997455,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2890774540","doi":"","title":"On Post-Modern Cryptography.","year":2006,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Triviality; Cryptography; Relevance (law); Computer science; Quarter (Canadian coin); Point (geometry); Epistemology; Computer security; Mathematics; Mathematical economics; Philosophy; Law; Pure mathematics; Political science; History","retraction":null,"screen_n_in":null,"score":{"opus":0.009665921524565033,"gpt":0.244235066854762,"spread":0.234569145330197,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005387049,0.001004167,0.001001123,0.001257407,0.0002792153,0.0003105654,0.003478762,0.0006528348,0.0001040834],"category_scores_gemma":[0.0002285955,0.001036504,0.0008234963,0.0003837697,0.0005910709,0.0002552618,0.004183405,0.00268489,0.0009493281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002166599,"about_ca_system_score_gemma":0.0004957874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003271551,"about_ca_topic_score_gemma":0.000171186,"domain_scores_codex":[0.9939185,0.0007231518,0.0009441607,0.002479205,0.0007813609,0.001153656],"domain_scores_gemma":[0.9946676,0.001024897,0.0006843063,0.002982456,0.0003151089,0.0003256102],"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.000119969,0.0003889966,0.0005209516,0.00009213621,0.0001447825,0.000282366,0.0008662973,0.007473728,0.004788392,0.960245,0.002874413,0.02220294],"study_design_scores_gemma":[0.0006920831,0.0003078722,0.01213041,0.0001744985,0.00004178605,0.00007856906,0.000008715706,0.02938391,0.001579638,0.9539153,0.0007298549,0.0009573768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05326152,0.0001705978,0.9261903,0.002678812,0.001937461,0.0009246122,0.0001284108,0.0009458797,0.01376247],"genre_scores_gemma":[0.134982,0.00004369948,0.8616221,0.002168312,0.0004062926,0.000331431,0.0003371184,0.0001026205,0.000006372141],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.08172053,"threshold_uncertainty_score":0.9998286,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126852669","doi":"","title":"An Efficient Identification Protocol and the Knowledge-of-Exponent Assumption.","year":2007,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Identification (biology); Computer science; Protocol (science); Exponent; Simple (philosophy); Adversary; Algorithm; Theoretical computer science; Computer security; Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.02027962401737626,"gpt":0.3545070374627575,"spread":0.3342274134453813,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002190733,0.0003814619,0.0005557903,0.0003371026,0.0002412544,0.0001392273,0.002242421,0.0002575567,0.00001816346],"category_scores_gemma":[0.0002339276,0.0002977263,0.0001722252,0.0002099213,0.001364601,0.0001403653,0.002911039,0.0009441251,0.0000697198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008431057,"about_ca_system_score_gemma":0.0002233492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001989264,"about_ca_topic_score_gemma":0.0000204982,"domain_scores_codex":[0.9958902,0.001072321,0.001092422,0.00120335,0.0003305203,0.0004112089],"domain_scores_gemma":[0.9952953,0.0007026068,0.001123342,0.002384477,0.0003355581,0.0001587402],"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.0001430773,0.0003135405,0.0004244275,0.0002221154,0.00004410164,0.000002324424,0.008372181,0.002296844,0.0007323113,0.975071,0.000006190096,0.0123719],"study_design_scores_gemma":[0.001232291,0.0000505546,0.01607697,0.0000903047,0.00002121803,0.00001793988,0.0000691126,0.1273013,0.003191206,0.8512666,0.0004118213,0.000270752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005287167,0.00003356581,0.857252,0.0004922925,0.0002893239,0.1360233,0.00001244689,0.0001536565,0.0004561791],"genre_scores_gemma":[0.2218444,0.000008495148,0.4141559,0.00006389405,0.00009659068,0.3637761,0.0000230895,0.00002845311,0.000003004764],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4430961,"threshold_uncertainty_score":0.9999475,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3031215330","doi":"","title":"Some observations on the theory of cryptographic hash functions.","year":2001,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Hash function; Random oracle; Collision resistance; Security of cryptographic hash functions; Cryptographic hash function; Computer science; Oracle; SWIFFT; Function (biology); Theoretical computer science; SHA-2; Cryptography; Cryptographic primitive; Collision attack; Mathematics; Double hashing; Algorithm; Computer security; Cryptographic protocol; Encryption; Programming language; Public-key cryptography","retraction":null,"screen_n_in":null,"score":{"opus":0.05900874040137442,"gpt":0.2818161552245252,"spread":0.2228074148231508,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001135973,0.0004928978,0.0006023349,0.0008194829,0.0005638844,0.0001391116,0.002531032,0.0002809116,0.0002151359],"category_scores_gemma":[0.0002420176,0.0003879799,0.0006225705,0.0007819496,0.0009159052,0.0001788737,0.002351629,0.001487508,0.00006716399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004120132,"about_ca_system_score_gemma":0.0002948559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009508249,"about_ca_topic_score_gemma":0.0001604374,"domain_scores_codex":[0.9960003,0.001014553,0.0009017396,0.001019671,0.0004739632,0.0005897379],"domain_scores_gemma":[0.9942275,0.002215833,0.0006556213,0.002531999,0.0002368095,0.000132248],"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.00003237408,0.0002821668,0.005236854,0.0000333114,0.0002866166,0.0000109814,0.001954074,0.0004055425,0.0002108664,0.9867876,0.001641682,0.003117936],"study_design_scores_gemma":[0.0003042387,0.0001195485,0.05277174,0.0000725396,0.0000592468,0.00001736919,0.0004248528,0.001513693,0.0001278802,0.9413515,0.002901049,0.000336356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1535282,0.0002146043,0.8352496,0.006392287,0.001317528,0.0008796341,0.0001541982,0.0001948807,0.002069043],"genre_scores_gemma":[0.6832969,0.001259107,0.3102099,0.003112996,0.0005242414,0.001221442,0.0002867953,0.00007342521,0.00001528037],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5297686,"threshold_uncertainty_score":0.9998572,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2579035965","doi":"","title":"Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck.","year":2016,"lang":"en","type":"article","venue":"IACR Cryptology ePrint Archive","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Proof complexity; Mathematical proof; Oracle; Constant (computer programming); Mathematics; Sublinear function; Satisfiability; Combinatorial proof; Discrete mathematics; Gas meter prover; Upper and lower bounds; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02470146613603537,"gpt":0.2633926433495877,"spread":0.2386911772135523,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002176496,0.000209249,0.0003221858,0.00011446,0.0001582955,0.00007428809,0.000400222,0.00006824997,0.00001658649],"category_scores_gemma":[0.00001735646,0.0001310511,0.00004902423,0.0001010592,0.0007995684,0.0003106653,0.0004682734,0.0001816414,0.00007821188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005183884,"about_ca_system_score_gemma":0.00005688286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005653336,"about_ca_topic_score_gemma":0.0001783417,"domain_scores_codex":[0.9983597,0.0002592212,0.0002625904,0.0005733016,0.0001629859,0.0003821523],"domain_scores_gemma":[0.9989049,0.000305179,0.0001275163,0.0004213743,0.00009892037,0.000142102],"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.00009700601,0.00009958515,0.02374907,0.00001997352,0.00007297534,0.00009370243,0.001299721,7.18889e-7,0.00432483,0.9313591,0.00004333227,0.03884001],"study_design_scores_gemma":[0.0009134909,0.0005095375,0.0396665,0.00005346115,0.00002031223,0.001163956,0.0001424113,0.001157714,0.005747424,0.9489104,0.001295506,0.0004192572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05877104,0.00004151648,0.9332566,0.001047149,0.0001982327,0.0004382915,0.000004320123,0.0001717257,0.006071149],"genre_scores_gemma":[0.8936335,0.000009708908,0.106145,0.0000988029,0.00004125069,0.00005322307,0.000004855969,0.00001038151,0.000003334871],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8348624,"threshold_uncertainty_score":0.5344109,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2401020796","doi":"","title":"A Cryptanalysis of HummingBird-2: The Differential Sequence Analysis.","year":2012,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Block cipher; Computer science; Key (lock); Differential cryptanalysis; Cipher; Cryptanalysis; Theoretical computer science; Sequence (biology); Algorithm; Differential (mechanical device); Symmetric-key algorithm; Encryption; Cryptography; Computer security; Public-key cryptography","retraction":null,"screen_n_in":null,"score":{"opus":0.04197999025954345,"gpt":0.3194083773701073,"spread":0.2774283871105638,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007641766,0.0004923293,0.001127609,0.001060303,0.0003211158,0.0001468332,0.003307328,0.0002535759,0.0003529128],"category_scores_gemma":[0.00009438916,0.0003736526,0.001366236,0.001411289,0.000765898,0.0001436648,0.004528478,0.00111671,0.00002746963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005505635,"about_ca_system_score_gemma":0.0002025726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006188046,"about_ca_topic_score_gemma":0.001056957,"domain_scores_codex":[0.9957895,0.0008174608,0.001081036,0.001007899,0.0005806474,0.0007234497],"domain_scores_gemma":[0.9952061,0.0007121314,0.0009997755,0.002678905,0.0002239709,0.0001791004],"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.00001418252,0.0001784539,0.02406393,0.00004681384,0.003300223,0.000009645529,0.006775758,0.0006167133,0.0007940304,0.96015,0.00009636887,0.003953865],"study_design_scores_gemma":[0.0003565206,0.00004675419,0.1185349,0.00002973358,0.002859958,0.00001841959,0.0003511329,0.03700936,0.0006919673,0.8388336,0.0006280482,0.0006395659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1741812,0.0001970659,0.8230245,0.0009717714,0.0005133078,0.0003956446,0.0001232407,0.00009721635,0.00049608],"genre_scores_gemma":[0.7896651,0.0001186282,0.2097543,0.0001033702,0.0001004635,0.0001305099,0.0001122973,0.00001454253,7.947474e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6154839,"threshold_uncertainty_score":0.9998716,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3037557713","doi":"","title":"Uncloneable Quantum Encryption via Oracles","year":2019,"lang":"en","type":"article","venue":"IACR Cryptology ePrint Archive","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Encryption; Computer science; Theoretical computer science; Pseudorandom function family; Probabilistic encryption; Quantum cryptography; Random oracle; Cryptography; Quantum; Quantum information; Algorithm; Computer security; Public-key cryptography; Physics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.005727296969806965,"gpt":0.2157169969128803,"spread":0.2099896999430733,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003303394,0.0002637595,0.0003504739,0.0002134452,0.0001897107,0.00008655668,0.00112217,0.0001107604,0.00009583382],"category_scores_gemma":[0.0000404429,0.0002349433,0.0001465386,0.0002899403,0.0001385727,0.0001992857,0.0008240806,0.0004866223,0.001877021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000031035,"about_ca_system_score_gemma":0.00008033739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005344695,"about_ca_topic_score_gemma":0.00001218115,"domain_scores_codex":[0.997785,0.0002351112,0.0003346026,0.0007792224,0.000253906,0.0006121981],"domain_scores_gemma":[0.9983562,0.0003629136,0.0001632976,0.000911956,0.00005980222,0.0001457895],"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.00001744092,0.00007658951,0.003368558,0.00001931886,0.00003321016,0.0000393328,0.001139835,0.004766265,0.009885889,0.9464896,0.0001976721,0.03396629],"study_design_scores_gemma":[0.0002981564,0.0001452347,0.00858627,0.00002156628,0.000003993538,0.0001336172,0.00002317959,0.4412709,0.001002051,0.5453279,0.00294974,0.0002373347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3479948,0.00005006329,0.6481479,0.001017074,0.000744172,0.0001851197,0.000002206482,0.0002706713,0.001588029],"genre_scores_gemma":[0.5185095,0.00001170805,0.4809702,0.0003558636,0.0001081445,0.00001299302,0.000007110893,0.00001715688,0.00000728756],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4365047,"threshold_uncertainty_score":0.9989001,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3030978102","doi":"","title":"Exact Maximum Expected Differential and Linear Probability for 2-Round Advanced Encryption Standard (AES).","year":2005,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Mount Allison University","funders":"","keywords":"Linear cryptanalysis; Block cipher; Advanced Encryption Standard; Upper and lower bounds; Encryption; Mathematics; Differential cryptanalysis; Differential (mechanical device); Impossible differential cryptanalysis; Value (mathematics); Provable security; Computer science; Algorithm; Statistics; Computer security; Physics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02407413391174426,"gpt":0.3070008694113259,"spread":0.2829267354995816,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004474562,0.0005866424,0.0008243393,0.0003917745,0.0004060995,0.0002209467,0.001019073,0.0003452905,0.00009747245],"category_scores_gemma":[0.0001651703,0.0005882362,0.0003462447,0.0001796104,0.0004592845,0.0002740341,0.002294554,0.0008707732,0.000007176533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001461203,"about_ca_system_score_gemma":0.0002810421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004717715,"about_ca_topic_score_gemma":0.0004591724,"domain_scores_codex":[0.9959546,0.0003684225,0.0008751175,0.001692373,0.0003605675,0.0007488971],"domain_scores_gemma":[0.9971755,0.0005243298,0.0004874315,0.001307418,0.0002722592,0.0002331221],"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.0004895357,0.000336603,0.003439692,0.0002894695,0.0002373428,0.000010797,0.005840237,0.000306756,0.001550661,0.9157792,0.0001561013,0.07156356],"study_design_scores_gemma":[0.001933856,0.0003540634,0.01800606,0.0000623031,0.00006463477,0.00002728957,0.0001646897,0.01292933,0.0006175747,0.9624443,0.002748169,0.0006477371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3820144,0.00009145075,0.6142321,0.0009394813,0.0006046671,0.001557974,0.0002783906,0.0001950012,0.00008648018],"genre_scores_gemma":[0.3023342,0.0001903768,0.6961814,0.00006249088,0.0002106129,0.000688665,0.0003051505,0.00002626963,8.923971e-7],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.08194922,"threshold_uncertainty_score":0.9996569,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2950244776","doi":"","title":"Performance and Security Improvements for Tor: A Survey.","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Anonymity; Computer science; Software deployment; Computer security; State (computer science); Network security; Point (geometry); Dozen; Internet privacy; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.0259892599939159,"gpt":0.2749678279110856,"spread":0.2489785679171697,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001604544,0.000424792,0.0007319042,0.0001994311,0.0001495887,0.0001671338,0.001425735,0.000291312,0.000009773307],"category_scores_gemma":[0.0002144615,0.0004003642,0.0002082104,0.00008872701,0.0002039856,0.000133983,0.003616826,0.0007812298,0.00002593227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008081644,"about_ca_system_score_gemma":0.0002528278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009193298,"about_ca_topic_score_gemma":0.0006194992,"domain_scores_codex":[0.9970219,0.0003261672,0.0005855493,0.001215569,0.0002560105,0.0005948315],"domain_scores_gemma":[0.9980624,0.0003874142,0.0004044863,0.0006322088,0.0003057279,0.0002077427],"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.0001157056,0.0001600605,0.01225332,0.0002862539,0.0004986489,0.00001487547,0.009005672,0.001815021,0.00002848692,0.9574812,0.003533363,0.01480737],"study_design_scores_gemma":[0.0005760351,0.0002013089,0.007898784,0.00007104977,0.00004666226,0.0000178302,0.00005346906,0.9288743,0.00005146443,0.06055221,0.001161161,0.0004957386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3768901,0.00008523557,0.620944,0.0001524689,0.000727503,0.0004442586,0.00006684259,0.00008579315,0.0006038103],"genre_scores_gemma":[0.8769171,0.00005346164,0.122457,0.0001555777,0.0001412889,0.0001344459,0.0001139605,0.00002027451,0.000006932199],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9270593,"threshold_uncertainty_score":0.9998448,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2951981597","doi":"","title":"Provisions: Privacy-preserving proofs of solvency for Bitcoin exchanges.","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Solvency; Mathematical proof; Computer science; Computer security; Extension (predicate logic); Business; Cover (algebra); Function (biology); Finance; Mathematics; Market liquidity; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.04102507242458837,"gpt":0.302501910919838,"spread":0.2614768384952496,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001065994,0.000453297,0.000885389,0.0005493251,0.0001796469,0.00004836988,0.005355719,0.0007496589,0.0000158793],"category_scores_gemma":[0.0008457902,0.0004443357,0.0003050103,0.0002935783,0.0005274016,0.0001029282,0.01344624,0.001162229,0.00002401039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007893675,"about_ca_system_score_gemma":0.0006687052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005849637,"about_ca_topic_score_gemma":0.0001171079,"domain_scores_codex":[0.9965938,0.0002222428,0.000834037,0.001421635,0.0002790161,0.0006492774],"domain_scores_gemma":[0.9944634,0.0005483809,0.0007946577,0.003536379,0.0004864296,0.000170793],"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.00002846466,0.000296999,0.0005365799,0.0003678093,0.0001128311,0.000007086031,0.003608493,0.0001143333,0.0005367079,0.9690231,0.003700825,0.02166679],"study_design_scores_gemma":[0.0004607633,0.0001668805,0.0004246317,0.0001395395,0.0000320769,0.00002208468,0.00007574737,0.03975666,0.002555627,0.9488916,0.007090345,0.0003840633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02314422,0.0009413283,0.9636838,0.006954648,0.0005040998,0.002954165,0.0001341465,0.0004575617,0.001225964],"genre_scores_gemma":[0.09079953,0.0001271857,0.906083,0.0001079415,0.0001063534,0.002659598,0.00007390691,0.00003643358,0.000006044451],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0676553,"threshold_uncertainty_score":0.9998009,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2395604259","doi":"","title":"Secure Computation with Sublinear Amortized Work.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bell (Canada)","funders":"","keywords":"Sublinear function; Secure two-party computation; Computer science; Computation; Secure multi-party computation; Protocol (science); Theoretical computer science; Function (biology); Simple (philosophy); Security parameter; Algorithm; Cryptography; Mathematics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0223179254063797,"gpt":0.2463094695259464,"spread":0.2239915441195667,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004260853,0.0006556265,0.0008466495,0.0005554869,0.0002171242,0.0002380397,0.002399424,0.0004652301,0.0000771828],"category_scores_gemma":[0.00005717812,0.0005825297,0.000327237,0.0005501574,0.0006100537,0.0002923138,0.003959493,0.001929749,0.0001799769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004115091,"about_ca_system_score_gemma":0.0003280171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001169455,"about_ca_topic_score_gemma":0.0002138272,"domain_scores_codex":[0.9960058,0.0004871048,0.0006494125,0.001704713,0.0004128682,0.0007400605],"domain_scores_gemma":[0.9966558,0.0003215023,0.0006175931,0.001884141,0.0002199005,0.0003010249],"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.000266068,0.0002401554,0.006892865,0.00008642066,0.0002564777,0.0001891979,0.004618159,0.0005464857,0.00002419884,0.9806398,0.001269,0.004971152],"study_design_scores_gemma":[0.0008831287,0.0001584724,0.02083165,0.0001481974,0.00006493813,0.00008608328,0.00004954395,0.004610984,0.0002066747,0.9709376,0.001267664,0.000755111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05954093,0.0001683881,0.9333706,0.0006075701,0.0009082266,0.0007527257,0.00008700797,0.0006019495,0.003962613],"genre_scores_gemma":[0.1571694,0.00007643914,0.8418033,0.0002598357,0.0001391371,0.0001362504,0.0003794815,0.00003573834,4.189149e-7],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09762847,"threshold_uncertainty_score":0.9996626,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2407643022","doi":"","title":"How to Compress (Reusable) Garbled Circuits.","year":2013,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Ciphertext; IBM; Key (lock); Computer science; Encryption; Homomorphic encryption; Learning with errors; Electronic circuit; Multilinear map; Scheme (mathematics); Functional encryption; Multiplicative function; Boolean circuit; Theoretical computer science; Security parameter; Arithmetic; Algorithm; Mathematics; Computer network; Logic gate; Computer security; Electrical engineering; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02216625853187726,"gpt":0.2505621489034478,"spread":0.2283958903715705,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0004478453,0.0008634499,0.00119455,0.0007637542,0.0002885442,0.0009843647,0.006291837,0.0005932022,0.0001417193],"category_scores_gemma":[0.0002446659,0.0008761941,0.0005212736,0.0004529333,0.0004254957,0.0004503524,0.01354655,0.002092347,0.000779395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007705317,"about_ca_system_score_gemma":0.000264683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002211104,"about_ca_topic_score_gemma":0.0001603791,"domain_scores_codex":[0.9944178,0.0006095485,0.0006791854,0.002459139,0.0005585951,0.00127576],"domain_scores_gemma":[0.9936332,0.0006137158,0.0004446277,0.004318409,0.0002655408,0.0007245264],"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.00001556982,0.0001860653,0.001067193,0.0001274601,0.000199971,0.00009360367,0.002455255,0.0002628194,0.000956188,0.972994,0.01109276,0.01054911],"study_design_scores_gemma":[0.0004492978,0.0001052233,0.008653664,0.000129422,0.00003722834,0.00006441697,0.00007290495,0.004020838,0.0008784106,0.9528,0.03178441,0.001004199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0281394,0.0002575356,0.9534226,0.006283413,0.002462943,0.001536265,0.0002575194,0.0006483155,0.00699201],"genre_scores_gemma":[0.123113,0.0001490124,0.8738258,0.001491793,0.0003869323,0.000735055,0.000233959,0.00005875169,0.000005597471],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09497364,"threshold_uncertainty_score":0.9999986,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W173447543","doi":"","title":"On the use of Continued Fractions for Stream Ciphers.","year":2009,"lang":"en","type":"article","venue":"IACR Cryptology ePrint Archive","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Stream cipher; Computer science; Key (lock); Key schedule; Cryptanalysis; Cryptography; Stream cipher attack; Theoretical computer science; Algorithm; Arithmetic; Mathematics; Computer security; Differential cryptanalysis","retraction":null,"screen_n_in":null,"score":{"opus":0.04822066608377977,"gpt":0.2781522351455353,"spread":0.2299315690617555,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001871251,0.000141891,0.0002039922,0.0001150603,0.00013847,0.00004363983,0.0005352663,0.00005657467,0.00003856262],"category_scores_gemma":[0.0005076071,0.0001093838,0.00014592,0.0001540794,0.0001703713,0.0002119652,0.00008715285,0.0002331005,0.00004792996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002995632,"about_ca_system_score_gemma":0.00006104862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002274784,"about_ca_topic_score_gemma":0.00002259999,"domain_scores_codex":[0.998813,0.0001705568,0.0002607965,0.000344184,0.0001428424,0.0002686117],"domain_scores_gemma":[0.9966757,0.002344121,0.0001890908,0.0006339225,0.00009755461,0.00005962158],"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.00007548982,0.0001374555,0.00009521168,0.000002630334,0.00002436709,0.000004212242,0.0004997976,0.0009670904,0.01425683,0.9688308,0.003199186,0.01190695],"study_design_scores_gemma":[0.0006406414,0.0005625515,0.012738,0.00002834237,0.00001704672,0.00001525231,0.00004991544,0.03010416,0.0144213,0.9364873,0.004763076,0.0001724485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08349994,0.000005869573,0.9083983,0.006438095,0.0001725391,0.0004294518,0.00001857441,0.0000819448,0.0009553239],"genre_scores_gemma":[0.5570498,0.000005995293,0.4411029,0.001716134,0.00004663259,0.00005491262,0.000008354442,0.000008198731,0.000007064142],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4735498,"threshold_uncertainty_score":0.4460542,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2907648450","doi":"","title":"EzPC: Programmable, Efficient, and Scalable Secure Two-Party Computation for Machine Learning","year":2017,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Correctness; Scalability; Secure multi-party computation; Compiler; Computation; Oblivious transfer; Theoretical computer science; Programming language; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02202174771668337,"gpt":0.2977916640176854,"spread":0.275769916301002,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009408733,0.0005710804,0.0007960285,0.0003727208,0.001002117,0.0006832863,0.001671017,0.0003435829,0.000009230802],"category_scores_gemma":[0.0003065223,0.0005679144,0.0003103134,0.000137058,0.0006398862,0.0002160456,0.004622873,0.001569398,0.00002210461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003704047,"about_ca_system_score_gemma":0.0001917917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001978907,"about_ca_topic_score_gemma":0.0002819451,"domain_scores_codex":[0.9962436,0.0003876289,0.0005499767,0.001709627,0.0002874246,0.0008217405],"domain_scores_gemma":[0.9968334,0.000664636,0.000740014,0.001288277,0.0001990418,0.0002746218],"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.000114727,0.000205216,0.007100722,0.0003411405,0.000170659,0.00003183691,0.002311439,0.01225545,0.0001198344,0.9426728,0.000305389,0.03437074],"study_design_scores_gemma":[0.0009452646,0.0001283918,0.001797399,0.00009864802,0.00004651779,0.00005132444,0.00002298042,0.413925,0.0001176039,0.576708,0.005728128,0.0004308386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04260921,0.0006971655,0.9518229,0.0008191063,0.0009184218,0.001549631,0.0002721052,0.0003968843,0.0009145249],"genre_scores_gemma":[0.1848669,0.0001380158,0.813667,0.00007956054,0.0001589811,0.0003400833,0.000712495,0.00003540789,0.000001575865],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4016695,"threshold_uncertainty_score":0.9996772,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949376982","doi":"","title":"Combinatorial Properties of Frameproof and Traceability Codes.","year":2000,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Copyright and Intellectual Property","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University; University of Waterloo","funders":"","keywords":"Computer science; Traceability; Disjoint sets; Hash function; Combinatorial design; Coding (social sciences); Theoretical computer science; Order (exchange); Discrete mathematics; Mathematics; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.02797596289779946,"gpt":0.2209522293025324,"spread":0.1929762664047329,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005699404,0.0004883404,0.0009752458,0.0003120702,0.0001647029,0.0001551269,0.0006045995,0.000420507,0.002121679],"category_scores_gemma":[0.0005689125,0.0003820577,0.000237005,0.0001269639,0.00116581,0.0002602383,0.001836508,0.001144889,0.0001712694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003191989,"about_ca_system_score_gemma":0.0001121035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00104533,"about_ca_topic_score_gemma":0.0001530148,"domain_scores_codex":[0.9975371,0.0001149004,0.0007418487,0.0009097318,0.0002673551,0.0004290527],"domain_scores_gemma":[0.9984415,0.0001703579,0.0004018162,0.000724479,0.0002309595,0.00003091472],"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.005715248,0.001608829,0.01731012,0.005395763,0.0007945091,0.00003911447,0.004371307,0.000135446,0.00548834,0.912433,0.01588143,0.03082686],"study_design_scores_gemma":[0.0007445642,0.00005260297,0.005557945,0.0002970815,0.0001482492,0.000005986875,0.0001188331,0.0129823,0.001579134,0.9643852,0.01356687,0.0005613072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9117196,0.0007104038,0.002449912,0.001003657,0.001493837,0.001185255,0.00002323304,0.0002528684,0.08116125],"genre_scores_gemma":[0.996592,0.0001157104,0.002100827,0.0002648065,0.0007363025,0.00009605914,0.00004276849,0.0000445108,0.000007054041],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08487237,"threshold_uncertainty_score":0.9998631,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3193336782","doi":"","title":"Functional Encryption: New Perspectives and Lower Bounds.","year":2012,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Functional encryption; Encryption; Computer science; Theoretical computer science; Computation; Exploit; Key (lock); Upper and lower bounds; Computer security; Algorithm; Mathematics; Ciphertext","retraction":null,"screen_n_in":null,"score":{"opus":0.02247108557450471,"gpt":0.2501553859783875,"spread":0.2276843004038828,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000377014,0.0005363331,0.0005674785,0.0003948759,0.0003041864,0.0002884339,0.001179834,0.0004234993,0.0004138008],"category_scores_gemma":[0.0001000565,0.0005411603,0.0003213728,0.0002036558,0.0007119143,0.0004838753,0.004882745,0.001508909,0.0002340749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006512993,"about_ca_system_score_gemma":0.0003911761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000122087,"about_ca_topic_score_gemma":0.00008553665,"domain_scores_codex":[0.9967764,0.0002744805,0.0004367592,0.0014664,0.0003591674,0.0006868092],"domain_scores_gemma":[0.9972972,0.0003582813,0.000282738,0.001472431,0.0001124939,0.0004768033],"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.00006375393,0.0001864701,0.002974602,0.00003793136,0.0001673802,0.00002633968,0.006329912,0.00002056009,0.0001257718,0.9778789,0.006466373,0.005722009],"study_design_scores_gemma":[0.0004201535,0.00006182175,0.06714453,0.00004244373,0.00004528684,0.0001710828,0.0002421206,0.0003884048,0.00004876122,0.9185501,0.01233733,0.0005480122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01954376,0.003488314,0.9666639,0.002525635,0.002640377,0.0003809776,0.00007812047,0.0003133253,0.004365593],"genre_scores_gemma":[0.1397802,0.001097823,0.8571307,0.0003738844,0.001347463,0.00008848419,0.0001454644,0.00003158581,0.000004353342],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1202365,"threshold_uncertainty_score":0.999704,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2951754992","doi":"","title":"Resilient Aggregation in Simple Linear Sensor Networks.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Wireless sensor network; Computer science; Computer network; Aggregate (composite); Base station; Key distribution in wireless sensor networks; Simple (philosophy); Protocol (science); Node (physics); Wireless; Wireless network; Telecommunications; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01424304818891629,"gpt":0.2647413245042318,"spread":0.2504982763153155,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0008541702,0.0007001333,0.001067244,0.000590342,0.0001661307,0.0001490292,0.002654098,0.000893045,0.00003528199],"category_scores_gemma":[0.0003490582,0.0007687234,0.0003221662,0.0003749934,0.0003948274,0.0001286034,0.004893874,0.002941882,0.000232938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002137906,"about_ca_system_score_gemma":0.0001800219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000215101,"about_ca_topic_score_gemma":0.0005873263,"domain_scores_codex":[0.9940113,0.00131451,0.001110431,0.001940833,0.0004598394,0.001163097],"domain_scores_gemma":[0.9948633,0.001379028,0.0006709502,0.002671254,0.0001528846,0.0002626313],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005199986,0.0001240226,0.00565967,0.0000646696,0.00006309822,0.0001888263,0.002256268,0.5922947,0.0000271971,0.3822134,0.0008795488,0.01617658],"study_design_scores_gemma":[0.0004055905,0.00005046245,0.005459165,0.0001549916,0.00001266887,0.00004751989,0.00003329707,0.658631,0.0001361885,0.33211,0.002395606,0.0005634534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1383845,0.0002686779,0.8554624,0.001369721,0.002024296,0.0008479818,0.00001248494,0.0003969053,0.001233007],"genre_scores_gemma":[0.5163932,0.0004607479,0.4812413,0.0007170106,0.0008039172,0.0001653296,0.0001527638,0.00006289747,0.000002768763],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3780087,"threshold_uncertainty_score":0.9994764,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2950781338","doi":"","title":"Efficient Hardware Implementations of the Warbler Pseudorandom Number Generator.","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Pseudorandom number generator; Application-specific integrated circuit; Computer science; CMOS; Computer hardware; Embedded system; Electronic engineering; Engineering; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.03076629392048703,"gpt":0.3129129739134178,"spread":0.2821466799929307,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007344615,0.000419818,0.0006174824,0.0002260935,0.0003335435,0.0001128882,0.002299412,0.000193664,0.0002462924],"category_scores_gemma":[0.0001063429,0.0003287589,0.0005039286,0.0004502791,0.000456415,0.00005314636,0.005092849,0.0008270518,0.00005726929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009417231,"about_ca_system_score_gemma":0.0007660576,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003097274,"about_ca_topic_score_gemma":0.000449916,"domain_scores_codex":[0.9963546,0.0006761485,0.0009372385,0.0008915134,0.0005771106,0.0005633433],"domain_scores_gemma":[0.9964784,0.0002888435,0.0006576264,0.001959831,0.0004360263,0.0001792894],"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.000023714,0.0002132071,0.01839598,0.000074205,0.0002357235,0.000008894469,0.008440681,0.005849693,0.0002135271,0.9589126,0.006395617,0.00123621],"study_design_scores_gemma":[0.002181998,0.00004969183,0.01935029,0.00007842977,0.0001334773,0.00006713253,0.0006480538,0.02987582,0.001127155,0.9399492,0.005911791,0.0006269346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2839125,0.00009110342,0.7096925,0.001544812,0.001607036,0.000940785,0.0003857129,0.00008751262,0.001737993],"genre_scores_gemma":[0.6297858,0.00004109256,0.3692242,0.0003193627,0.0001325085,0.0003483729,0.0001166487,0.00002887448,0.00000319809],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3458733,"threshold_uncertainty_score":0.9999164,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3193291579","doi":"","title":"Improved OT Extension for Transferring Short Secrets.","year":2013,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bell (Canada)","funders":"","keywords":"Sublinear function; Extension (predicate logic); Generalization; Computation; Factor (programming language); Security parameter; Computer science; Block (permutation group theory); Provable security; Work (physics); Protocol (science); Theoretical computer science; Discrete mathematics; Mathematics; Algorithm; Cryptography; Combinatorics; Physics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02803369439283846,"gpt":0.275520161173267,"spread":0.2474864667804285,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005925648,0.000719111,0.0009680282,0.0004667175,0.0003150045,0.0002694153,0.002892287,0.0006302259,0.00005549712],"category_scores_gemma":[0.0001371897,0.000711037,0.000769912,0.0001839452,0.0003801998,0.0003383347,0.003619573,0.001536212,0.00004599598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005447573,"about_ca_system_score_gemma":0.0002422323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001618361,"about_ca_topic_score_gemma":0.0002029159,"domain_scores_codex":[0.9954207,0.0002595729,0.0008182012,0.002203987,0.0002810051,0.001016517],"domain_scores_gemma":[0.9959659,0.0006221299,0.0002030529,0.002630336,0.0002238597,0.0003547242],"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.00007532206,0.0001460523,0.0003070342,0.000214998,0.0001748597,0.00002366341,0.002077959,0.0001035771,0.006399266,0.9640544,0.0006871764,0.02573571],"study_design_scores_gemma":[0.0004907352,0.0001662491,0.003368485,0.0001114408,0.00006038861,0.00005301584,0.00005445937,0.08637804,0.002491961,0.9027414,0.003305522,0.0007783062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0527257,0.0002565395,0.9402127,0.0009212546,0.001985459,0.002093448,0.0002943821,0.0005082793,0.001002295],"genre_scores_gemma":[0.1678097,0.0001876551,0.8300244,0.0003896408,0.0002580219,0.0009191802,0.0003620855,0.00004879176,5.452488e-7],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.115084,"threshold_uncertainty_score":0.9995341,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2951256639","doi":"","title":"Verifiable Sealed-Bid Auction on the Ethereum Blockchain.","year":2018,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Smart contract; Blockchain; Computer science; Computer security; Verifiable secret sharing; Correctness; Protocol (science); Homomorphic encryption; Transparency (behavior); Scheme (mathematics); Vickrey–Clarke–Groves auction; Encryption; Auction theory; Common value auction; Microeconomics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01905914272387012,"gpt":0.2538417123297927,"spread":0.2347825696059226,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008882335,0.0005040683,0.0005249431,0.0003066311,0.0006237744,0.0001118285,0.003853071,0.0008292719,0.0001588687],"category_scores_gemma":[0.0001693742,0.0003970383,0.0002550721,0.0003176185,0.001134541,0.00003160972,0.004280757,0.002539643,0.0009633484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001096078,"about_ca_system_score_gemma":0.0002395036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008482522,"about_ca_topic_score_gemma":0.00007730883,"domain_scores_codex":[0.9964946,0.0005144706,0.0005029356,0.001485318,0.0003078482,0.0006948552],"domain_scores_gemma":[0.994849,0.0006197433,0.0004244011,0.003819891,0.0001635363,0.0001234065],"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.00002057774,0.0001489379,0.0001847241,0.00002127015,0.0001195026,0.00001276132,0.00103628,0.0005442689,0.0001652406,0.9885983,0.00617565,0.002972526],"study_design_scores_gemma":[0.0001716116,0.0001286933,0.001045699,0.00005273966,0.00002036002,0.00005118149,0.0000622491,0.0400654,0.002607147,0.9383035,0.01711077,0.0003806917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1117794,0.00009813598,0.8460142,0.02969633,0.001289948,0.001007411,0.0000352697,0.0007867275,0.009292549],"genre_scores_gemma":[0.6377071,0.0001992202,0.3558773,0.003392235,0.000752802,0.001896259,0.00004488892,0.00008078686,0.00004945644],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5259277,"threshold_uncertainty_score":0.9998481,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949160893","doi":"","title":"A double large prime variation for small genus hyperelliptic index calculus.","year":2004,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Prime (order theory); Logarithm; Genus; Variation (astronomy); Context (archaeology); Heuristic; Hyperelliptic curve cryptography; Mathematics; Algorithm; Discrete logarithm; Computer science; Combinatorics; Mathematical optimization; Mathematical analysis; Zoology","retraction":null,"screen_n_in":null,"score":{"opus":0.02083633222881232,"gpt":0.2587462555160087,"spread":0.2379099232871963,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006446296,0.0006172328,0.0008575928,0.0006640134,0.0003479974,0.0002225309,0.002185212,0.0005522723,0.0000171205],"category_scores_gemma":[0.00008931917,0.000609729,0.0006542833,0.0003621893,0.0003312474,0.0001154508,0.002950071,0.001286086,0.0001106658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001536499,"about_ca_system_score_gemma":0.0007324928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004446567,"about_ca_topic_score_gemma":0.0006575501,"domain_scores_codex":[0.9959502,0.0002406052,0.0007338955,0.001679949,0.00030879,0.001086544],"domain_scores_gemma":[0.9967583,0.0004607937,0.0005697202,0.001740274,0.0002044635,0.0002664039],"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.0001609208,0.0003940292,0.001294869,0.0001899236,0.0003326677,0.00006302352,0.003784447,0.004694772,0.0002880463,0.9836485,0.00003967211,0.005109114],"study_design_scores_gemma":[0.00275267,0.0001947934,0.03165515,0.0001269918,0.0001128807,0.00008656726,0.00003342045,0.04318081,0.0006698745,0.9183242,0.002087129,0.0007754582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05427494,0.0003107579,0.939275,0.00144431,0.001641751,0.001834835,0.00007510063,0.0003725391,0.0007708223],"genre_scores_gemma":[0.3578525,0.0001001621,0.6405911,0.0003375241,0.0002866017,0.0006772987,0.00009665304,0.00005261263,0.000005507954],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3035776,"threshold_uncertainty_score":0.9996354,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2403999494","doi":"","title":"IBAKE: Identity-Based Authenticated Key Exchange Protocol.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Authenticated Key Exchange; Computer security; Key (lock); Key exchange; Public-key cryptography; Identity (music); Authentication (law); Protocol (science); Encryption; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03765234709929096,"gpt":0.3014489787261447,"spread":0.2637966316268538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0009238616,0.000818475,0.0009435315,0.000884257,0.0003101658,0.0003753693,0.005539685,0.0006811055,0.0005821607],"category_scores_gemma":[0.0001758323,0.0008255693,0.0006566613,0.0005277409,0.0008075627,0.0005267177,0.008479163,0.002087879,0.0007553566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007126629,"about_ca_system_score_gemma":0.0005233373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000250983,"about_ca_topic_score_gemma":0.0004329236,"domain_scores_codex":[0.9943736,0.0008656515,0.0009293497,0.002186613,0.0005786124,0.001066153],"domain_scores_gemma":[0.9944993,0.0003050182,0.0007404726,0.003800125,0.0002318098,0.00042326],"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.0001154748,0.0005683933,0.001374212,0.0004903752,0.0001643206,0.0001706904,0.003339263,0.00001778306,0.0001513899,0.9885595,0.001641651,0.003406981],"study_design_scores_gemma":[0.0009633108,0.000137424,0.005820801,0.0001714653,0.00005540298,0.0000286563,0.00001850738,0.004370368,0.001110437,0.970443,0.01604607,0.0008346034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001493513,0.00004561169,0.9567658,0.0006275919,0.001272113,0.03148217,0.0002217791,0.00084315,0.007248247],"genre_scores_gemma":[0.005734931,0.00001843574,0.9101332,0.0006015926,0.0002168855,0.08293184,0.0003008578,0.0000610896,0.000001200263],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05144967,"threshold_uncertainty_score":0.9998408,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949285224","doi":"","title":"Noninteractive two-channel message authentication based on hybrid-collision resistant hash functions.","year":2006,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Hash function; Computer network; Message authentication code; Computer security; Protocol (science); Hash-based message authentication code; Key (lock); Hash chain; Collision resistance; Channel (broadcasting); Context (archaeology); Authentication (law); Cryptographic hash function; Cryptography; Perfect hash function","retraction":null,"screen_n_in":null,"score":{"opus":0.01337245603226996,"gpt":0.2622821550418686,"spread":0.2489096990095987,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007234199,0.000747234,0.0007804725,0.001038066,0.0005057471,0.0003598674,0.002173655,0.0003047281,0.00006382483],"category_scores_gemma":[0.0002066564,0.0007534568,0.0006016145,0.0003853953,0.0004452753,0.0003098117,0.002594271,0.001906122,0.000294868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002134755,"about_ca_system_score_gemma":0.0003857593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003724325,"about_ca_topic_score_gemma":0.0002912979,"domain_scores_codex":[0.9946396,0.0008458129,0.0008723082,0.002235634,0.0006480506,0.000758564],"domain_scores_gemma":[0.9945385,0.001154927,0.0007648034,0.003047533,0.0002483249,0.0002458698],"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.0007138305,0.001228665,0.0003431841,0.0001190368,0.0001878291,0.0002535675,0.001249421,0.01596449,0.000852032,0.9669768,0.006988085,0.005123069],"study_design_scores_gemma":[0.001065794,0.0002401851,0.009617042,0.000317177,0.00008494859,0.00002485751,0.00004614939,0.1926225,0.002827853,0.7902459,0.002132899,0.0007747222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0374443,0.00007387812,0.9478679,0.001851208,0.002180976,0.00102259,0.000839011,0.000460916,0.008259249],"genre_scores_gemma":[0.6486861,0.00002088155,0.3487301,0.0004559993,0.0002274822,0.0004070995,0.001420255,0.00004812759,0.000003963508],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6112418,"threshold_uncertainty_score":0.9994916,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949736952","doi":"","title":"Human Assisted Randomness Generation Using Video Games.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Randomness; Computer science; Entropy (arrow of time); Randomness tests; Set (abstract data type); Theoretical computer science; Human–computer interaction; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05109110243666436,"gpt":0.3099897016658757,"spread":0.2588985992292114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001167006,0.0007211446,0.001080592,0.0006651194,0.0004308543,0.0003856911,0.002082116,0.0005438653,0.00008611516],"category_scores_gemma":[0.0002613121,0.0007632575,0.0004727198,0.0002439948,0.0004423876,0.0003060611,0.003320609,0.001555828,0.0001790087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003266532,"about_ca_system_score_gemma":0.000422242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002253305,"about_ca_topic_score_gemma":0.0001307386,"domain_scores_codex":[0.9942327,0.001505633,0.001044062,0.001907532,0.0005493503,0.0007607783],"domain_scores_gemma":[0.9960127,0.0003691758,0.000919749,0.002154549,0.0002895478,0.0002542856],"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.00009153772,0.0002604257,0.000479465,0.0002206958,0.0002849239,0.0001584928,0.001617641,0.05198988,0.2904603,0.6352812,0.001415046,0.01774034],"study_design_scores_gemma":[0.002456541,0.0000958468,0.004862606,0.0002114969,0.0001090562,0.0001977813,0.00001239494,0.5700626,0.0107504,0.4095173,0.0006958651,0.001028103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1684512,0.00008479735,0.8267409,0.0005996008,0.001905189,0.0007842235,0.00001655589,0.0004219983,0.0009955949],"genre_scores_gemma":[0.4188297,0.0000131782,0.5794924,0.000480146,0.0007677849,0.0001836421,0.0001707754,0.00005697672,0.000005316157],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5180727,"threshold_uncertainty_score":0.9994819,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3030140832","doi":"","title":"Elliptic Curve Cryptography: The Serpentine Course of a Paradigm Shift.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cryptography; Ideal (ethics); Elliptic curve cryptography; Function (biology); Key (lock); Computer security; Elliptic curve; Public-key cryptography; Political science; Mathematics; Law; Pure mathematics; Encryption","retraction":null,"screen_n_in":null,"score":{"opus":0.01493298593194446,"gpt":0.2538706889830655,"spread":0.238937703051121,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006848015,0.0008097207,0.001215366,0.0006319031,0.0004040353,0.0001133454,0.004750171,0.0004790562,0.00004614021],"category_scores_gemma":[0.00007277698,0.0005925145,0.001243037,0.000802482,0.002337916,0.0001433893,0.004333816,0.002195309,0.00007940103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002578287,"about_ca_system_score_gemma":0.0005045829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001886197,"about_ca_topic_score_gemma":0.0001415021,"domain_scores_codex":[0.994817,0.0009617868,0.001130448,0.001515463,0.0005816286,0.0009936923],"domain_scores_gemma":[0.9940013,0.001274665,0.000939657,0.003406026,0.0001162464,0.0002620991],"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.00005465226,0.000462778,0.01362273,0.0001441413,0.0007093525,0.000145482,0.006158567,0.001480117,0.00008802426,0.9736958,0.0005411814,0.002897206],"study_design_scores_gemma":[0.0005015802,0.0001318308,0.1041793,0.000160353,0.0001145426,0.0001937267,0.00006370575,0.00462612,0.0006234139,0.8867542,0.002065039,0.0005862038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1059285,0.002495898,0.8819624,0.005340644,0.00146469,0.001056043,0.00008227281,0.0002512735,0.001418291],"genre_scores_gemma":[0.7027375,0.003049486,0.2932405,0.0003557184,0.000226778,0.0002740328,0.00005703922,0.00005775557,0.000001145905],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.596809,"threshold_uncertainty_score":0.9996526,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3204067048","doi":"","title":"Post-Quantum Cryptography on FPGA Based on Isogenies on Elliptic Curves","year":2016,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Isogeny; Computer science; Key exchange; Parallel computing; Cryptography; Public-key cryptography; Supersingular elliptic curve; Software; Curve25519; Shared secret; Multiplier (economics); Elliptic curve cryptography; Arithmetic; Elliptic curve; Algorithm; Encryption; Mathematics; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01288095458855957,"gpt":0.2479428629866351,"spread":0.2350619083980756,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0006516502,0.001288912,0.001277695,0.002292021,0.0004612112,0.0002056354,0.003786522,0.0006724244,0.0001234983],"category_scores_gemma":[0.0003423845,0.0009959942,0.001428796,0.0005583267,0.001114694,0.0001246759,0.001849602,0.002400756,0.001026626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008602918,"about_ca_system_score_gemma":0.0003768594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002930039,"about_ca_topic_score_gemma":0.00001775882,"domain_scores_codex":[0.9926665,0.001198936,0.0009564958,0.002781241,0.001018496,0.001378377],"domain_scores_gemma":[0.991801,0.002939126,0.0006604456,0.003899297,0.0002402769,0.0004598972],"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.0004436667,0.0008946386,0.001103675,0.0003520336,0.0003370272,0.0002765731,0.0005008822,0.001617677,0.0006183439,0.9844504,0.002043525,0.007361544],"study_design_scores_gemma":[0.00119748,0.002264178,0.02210806,0.003148523,0.00009829312,0.00003438783,0.00002747398,0.006722949,0.003743196,0.9568991,0.002247373,0.001509008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04593645,0.0007217564,0.9146875,0.01917361,0.003570368,0.00165478,0.0003398814,0.0008678457,0.01304778],"genre_scores_gemma":[0.7656479,0.002139917,0.2103341,0.01957597,0.0007916674,0.001043197,0.0002149038,0.0002405193,0.00001178611],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7197115,"threshold_uncertainty_score":0.9999863,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3028966272","doi":"","title":"Salus: A System for Server-Aided Secure Function Evaluation.","year":2012,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Server; Implementation; Set (abstract data type); Function (biology); Cloud computing; Representation (politics); Work (physics); Focus (optics); Distributed computing; Operating system; Software engineering; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.05256112980436337,"gpt":0.3047204043262798,"spread":0.2521592745219164,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002367054,0.0004687889,0.0006230076,0.0003223747,0.0004182867,0.0002125814,0.001819801,0.0005340377,0.00004093385],"category_scores_gemma":[0.0002998585,0.000501234,0.0003876806,0.0002095164,0.0001325166,0.0002534381,0.002216393,0.0009451629,0.0002099576],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003481032,"about_ca_system_score_gemma":0.0005680732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003621895,"about_ca_topic_score_gemma":0.00002825491,"domain_scores_codex":[0.9957483,0.0008886601,0.0008117507,0.001323792,0.0005474728,0.0006800215],"domain_scores_gemma":[0.9957123,0.0008771957,0.0007952811,0.001819498,0.0005938988,0.0002018583],"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.00005095708,0.00008845448,0.0004803452,0.0004886728,0.0001991692,0.000001990125,0.003860925,0.003662732,0.0001327924,0.980966,0.0008516287,0.009216352],"study_design_scores_gemma":[0.0007636918,0.00006641769,0.004131475,0.0002386769,0.0001694256,0.00005741177,0.0002767448,0.3362223,0.0003748416,0.6536074,0.003554329,0.0005373032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01612475,0.0006255973,0.9700751,0.001002555,0.007612048,0.002076149,0.00004415933,0.0006430576,0.001796558],"genre_scores_gemma":[0.5689533,0.00001226649,0.4286428,0.0002170038,0.000860978,0.00108335,0.00019602,0.00003243733,0.00000181615],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5528286,"threshold_uncertainty_score":0.9997439,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3081740921","doi":"","title":"Further Optimizations of CSIDH: A Systematic Approach to Efficient Strategies, Permutations, and Bound Vectors.","year":2019,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Speedup; Computer science; Partition (number theory); Class (philosophy); Supersingular elliptic curve; Theoretical computer science; Algorithm; Elliptic curve; Parallel computing; Mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01194958658092149,"gpt":0.2437269256537538,"spread":0.2317773390728323,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004450295,0.0004120239,0.0009048391,0.0007545829,0.0001516455,0.0002447606,0.001217638,0.0002520975,0.000006572513],"category_scores_gemma":[0.0001229075,0.0003650172,0.0002352599,0.0004050062,0.0003725619,0.00008049384,0.001985181,0.0005716567,0.000028935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004002039,"about_ca_system_score_gemma":0.0004568158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007237621,"about_ca_topic_score_gemma":0.00002640589,"domain_scores_codex":[0.9969027,0.0005531255,0.000750695,0.001035828,0.000331453,0.000426222],"domain_scores_gemma":[0.9972131,0.00058566,0.0004364518,0.001406044,0.0001758951,0.0001828284],"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.00000941872,0.0002077304,0.0004216211,0.004114649,0.000205428,0.000005712762,0.01278305,0.266289,0.0001116454,0.7157676,0.00002960952,0.00005460573],"study_design_scores_gemma":[0.0007820671,0.0002329621,0.01890233,0.002701661,0.0003099587,0.0001965168,0.003720591,0.4473546,0.0001520727,0.5245348,0.00002648213,0.001085981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0569565,0.0007202823,0.9360887,0.0003788272,0.0004792087,0.002059428,0.00004547958,0.0001148011,0.003156792],"genre_scores_gemma":[0.5389143,0.00004136049,0.4606745,0.00004564246,0.00002201913,0.0002539169,0.00002531108,0.00002118512,0.000001767098],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4819578,"threshold_uncertainty_score":0.9998802,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2405997985","doi":"","title":"Sequential Secret Sharing as a New Hierarchical Access Structure.","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Secret sharing; Computer science; Access structure; Theoretical computer science; Context (archaeology); Verifiable secret sharing; Cryptography; Set (abstract data type); Computer security; Secure multi-party computation; Cryptographic primitive; Homomorphic secret sharing; Distributed computing; Cryptographic protocol; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.04896042530811537,"gpt":0.3320779916451271,"spread":0.2831175663370118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0005505133,0.0008653018,0.001079046,0.0007427104,0.0002596191,0.001019135,0.009033997,0.0008062059,0.0003901857],"category_scores_gemma":[0.0004837381,0.0008728526,0.0005214538,0.000454404,0.0005939729,0.0006680752,0.03025786,0.003659168,0.0001875728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001265493,"about_ca_system_score_gemma":0.002246974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000945304,"about_ca_topic_score_gemma":0.0007107928,"domain_scores_codex":[0.9940199,0.000496298,0.0008750672,0.002711946,0.0007419308,0.001154835],"domain_scores_gemma":[0.9942357,0.0003071426,0.0005239383,0.003419697,0.0001751102,0.001338443],"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.000124589,0.00008178921,0.003164662,0.00008863204,0.0002520383,0.0003141151,0.003340838,0.0005599327,0.0002243961,0.9808612,0.00633397,0.004653797],"study_design_scores_gemma":[0.0007364281,0.00009568612,0.002293453,0.0001040375,0.00005708101,0.0003153301,0.00002238951,0.007653381,0.0004399384,0.9804946,0.006931659,0.0008560102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08807197,0.0002405092,0.8998316,0.002400108,0.002918894,0.0007299447,0.0003801547,0.0005825268,0.00484432],"genre_scores_gemma":[0.1301378,0.0001265023,0.8656846,0.00151593,0.00139128,0.00008777221,0.000975051,0.00007817669,0.000002898956],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04206587,"threshold_uncertainty_score":0.9993722,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}