{"meta":{"query_hash":"8eb74faf2f3e","filters":{"venue":"IACR Cryptology ePrint Archive"},"cohort_total":211,"direct_labels_cover":1,"predictions_cover":211,"exported":211,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/8eb74faf2f3e","api":"https://metacan.xera.ac/api/v1/cohort?venue=IACR+Cryptology+ePrint+Archive"},"results":[{"id":"W112134986","doi":"","title":"Designing Against the 'Overdefined System of Equations' Attack.","year":2004,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Substitution (logic); Variety (cybernetics); Rotation (mathematics); Computer science; Property (philosophy); Function (biology); Algebraic number; Dimension (graph theory); Mathematics; Pure mathematics; Algebra over a field; Mathematical analysis; Artificial intelligence; Programming language","score_opus":0.029049713962477023,"score_gpt":0.26757102581896575,"score_spread":0.23852131185648873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112134986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011704285,0.00019816922,0.9797256,0.0014721212,0.0012152522,0.0010509857,0.000042401207,0.00039138243,0.004199786],"genre_scores_gemma":[0.5361439,0.00002583544,0.46323365,0.00020562143,0.00012447574,0.00018404303,0.00004910699,0.000031627103,0.0000017557487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99569774,0.0009248846,0.0010358505,0.001151786,0.0005788208,0.00061090715],"domain_scores_gemma":[0.9946144,0.001742297,0.0010614175,0.0021653536,0.00027606802,0.00014042915],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011094162,0.0005360426,0.00078504754,0.00042453382,0.00028164464,0.00013639862,0.0029154872,0.00032711317,0.000013680885],"category_scores_gemma":[0.00045583927,0.00045131805,0.00043049635,0.00035583472,0.00054175005,0.00018398081,0.0034104143,0.0013699031,0.00021037836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003600533,0.00008273213,0.00012704889,0.00028573873,0.00014487105,0.000058555892,0.0025186627,0.13599965,0.008430284,0.8494503,0.000113688635,0.0027524985],"study_design_scores_gemma":[0.0015232529,0.00020104741,0.0023914282,0.0014897917,0.00014224171,0.00011363558,0.00047935496,0.29049835,0.017807567,0.6840318,0.0002556657,0.0010658968],"about_ca_topic_score_codex":0.00013718146,"about_ca_topic_score_gemma":0.000041631614,"teacher_disagreement_score":0.5244396,"about_ca_system_score_codex":0.0004376986,"about_ca_system_score_gemma":0.0010525904,"threshold_uncertainty_score":0.9997938},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03695438671327419,"score_gpt":0.2636028940946578,"score_spread":0.22664850738138362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W115500278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34069747,0.0000040715368,0.65709746,0.0011504872,0.00032533638,0.000105504274,0.000009012468,0.000027334298,0.0005833134],"genre_scores_gemma":[0.89367235,0.0000033396186,0.10539785,0.0008243304,0.0000738082,0.0000076585275,0.000010215242,0.0000055607543,0.0000048832003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985736,0.00020746731,0.00031186544,0.00046798255,0.00018114186,0.0002579707],"domain_scores_gemma":[0.99685436,0.0018013378,0.00017161497,0.0010617076,0.000055975946,0.000055025055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050767657,0.000138094,0.00027257315,0.00008811185,0.00011315806,0.000057885547,0.0020881833,0.00007457259,0.00011583659],"category_scores_gemma":[0.0014144382,0.00009066991,0.000119978504,0.000118933276,0.00028372084,0.00015325418,0.0010240496,0.00057616894,0.00014327482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049843613,0.00005929076,0.00010748742,0.0000018688658,0.000038695565,0.000018947283,0.0010949004,0.00037609536,0.000500217,0.9895627,0.0024348558,0.005755083],"study_design_scores_gemma":[0.0010186651,0.00016298205,0.0027839253,0.000031506326,0.000041544263,0.00007334366,0.000033657954,0.84645504,0.0010684466,0.12871023,0.019340629,0.00028001508],"about_ca_topic_score_codex":0.000040920808,"about_ca_topic_score_gemma":0.00042632222,"teacher_disagreement_score":0.8608525,"about_ca_system_score_codex":0.0000040015575,"about_ca_system_score_gemma":0.00009575947,"threshold_uncertainty_score":0.38803986},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04822066608377977,"score_gpt":0.27815223514553533,"score_spread":0.22993156906175555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W173447543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08349994,0.000005869573,0.9083983,0.0064380947,0.00017253908,0.00042945176,0.000018574412,0.000081944796,0.0009553239],"genre_scores_gemma":[0.5570498,0.0000059952927,0.44110292,0.0017161337,0.000046632595,0.000054912623,0.000008354442,0.000008198731,0.0000070641418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881303,0.00017055684,0.00026079654,0.00034418402,0.00014284241,0.00026861174],"domain_scores_gemma":[0.99667567,0.002344121,0.00018909085,0.0006339225,0.00009755461,0.000059621583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018712506,0.000141891,0.00020399218,0.00011506034,0.00013846996,0.00004363983,0.0005352663,0.00005657467,0.000038562623],"category_scores_gemma":[0.00050760707,0.00010938379,0.00014592004,0.0001540794,0.00017037135,0.0002119652,0.00008715285,0.00023310048,0.00004792996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007548982,0.00013745546,0.00009521168,0.0000026303337,0.00002436709,0.000004212242,0.0004997976,0.0009670904,0.014256831,0.96883076,0.003199186,0.01190695],"study_design_scores_gemma":[0.0006406414,0.00056255155,0.012738004,0.00002834237,0.000017046716,0.000015252309,0.00004991544,0.030104158,0.014421298,0.93648726,0.004763076,0.0001724485],"about_ca_topic_score_codex":0.000022747836,"about_ca_topic_score_gemma":0.00002259999,"teacher_disagreement_score":0.47354984,"about_ca_system_score_codex":0.000029956322,"about_ca_system_score_gemma":0.000061048624,"threshold_uncertainty_score":0.44605416},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019285931225202845,"score_gpt":0.28284249286338087,"score_spread":0.26355656163817803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W181112729","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11425268,0.00027907593,0.87450856,0.0025981495,0.0019522728,0.0007355288,0.00014688789,0.00043996464,0.005086882],"genre_scores_gemma":[0.16778126,0.000376574,0.8292869,0.0012614382,0.00059471367,0.0004039917,0.0002397744,0.000047023193,0.000008314174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953406,0.0004780314,0.00093790307,0.0017673468,0.0004765684,0.0009995376],"domain_scores_gemma":[0.9962844,0.0003093331,0.00049306237,0.0023920652,0.00017643713,0.00034469896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047508604,0.0006994384,0.0008132813,0.0006845743,0.000378718,0.00032556496,0.0028228662,0.00038010292,0.00028705838],"category_scores_gemma":[0.000054090935,0.00072408834,0.00054694747,0.00036820752,0.00040226022,0.0002073933,0.0055174306,0.0015670706,0.0003317408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016024558,0.00024357969,0.0032765162,0.000047072903,0.00023156323,0.00010633815,0.003932498,0.0005179621,0.00030669651,0.9603016,0.005295608,0.025724582],"study_design_scores_gemma":[0.00087032723,0.0001229236,0.013550513,0.000065010936,0.00007279713,0.00017030853,0.00014195222,0.016869603,0.0006189088,0.9113793,0.055034924,0.0011034299],"about_ca_topic_score_codex":0.000249328,"about_ca_topic_score_gemma":0.0008094603,"teacher_disagreement_score":0.053528592,"about_ca_system_score_codex":0.00012226294,"about_ca_system_score_gemma":0.0005154807,"threshold_uncertainty_score":0.999521},"labels":[],"label_agreement":null},{"id":"W2105469151","doi":"","title":"New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields (full version).","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Waterloo","funders":"","keywords":"Precomputation; Scalar multiplication; Cryptosystem; Scalar (mathematics); Elliptic curve; Computer science; Mathematics; Scheme (mathematics); Integer (computer science); Algorithm; Arithmetic; Cryptography; Pure mathematics; Mathematical analysis; Geometry; Computation","score_opus":0.013658149343092615,"score_gpt":0.25966409044013494,"score_spread":0.24600594109704232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105469151","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11447151,0.00058124046,0.8802577,0.0012539092,0.0013722177,0.0014287676,0.000052243387,0.0002164608,0.00036589467],"genre_scores_gemma":[0.088309854,0.0004069345,0.91042155,0.00018797272,0.00028909763,0.00018038494,0.0001618476,0.000033190237,0.000009151693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683875,0.00031975834,0.00068378804,0.0013087788,0.00028929356,0.0005596467],"domain_scores_gemma":[0.99751794,0.00074746454,0.00027720447,0.0009773369,0.00017543146,0.00030464458],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025882846,0.00051546015,0.00070540933,0.0004976142,0.0004845021,0.0002580896,0.0010888691,0.00050275016,0.000023141954],"category_scores_gemma":[0.00007596316,0.00051539997,0.0003590515,0.00021730257,0.00023946902,0.00024122027,0.0018187035,0.0008947166,0.00005178109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022434672,0.0003135877,0.0054067182,0.00048901513,0.00078610214,0.00006520667,0.008482008,0.03091476,0.0037813128,0.93096685,0.0045831376,0.013986945],"study_design_scores_gemma":[0.002242361,0.00045163915,0.0195911,0.0003504978,0.00012267414,0.0003090468,0.000053099684,0.50435066,0.0015671683,0.4658023,0.0040106922,0.0011487753],"about_ca_topic_score_codex":0.00025373517,"about_ca_topic_score_gemma":0.00016292722,"teacher_disagreement_score":0.47343588,"about_ca_system_score_codex":0.000060329374,"about_ca_system_score_gemma":0.00044233643,"threshold_uncertainty_score":0.99972975},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020279624017376263,"score_gpt":0.3545070374627575,"score_spread":0.33422741344538126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126852669","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005287167,0.000033565808,0.857252,0.0004922925,0.0002893239,0.13602334,0.000012446886,0.00015365653,0.00045617906],"genre_scores_gemma":[0.22184442,0.000008495148,0.4141559,0.000063894055,0.00009659068,0.36377615,0.0000230895,0.000028453107,0.0000030047636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958902,0.0010723205,0.0010924218,0.0012033499,0.00033052033,0.00041120886],"domain_scores_gemma":[0.9952953,0.0007026068,0.0011233417,0.0023844773,0.0003355581,0.00015874021],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021907326,0.00038146187,0.0005557903,0.00033710263,0.00024125438,0.00013922734,0.0022424206,0.0002575567,0.000018163462],"category_scores_gemma":[0.00023392764,0.00029772634,0.00017222516,0.00020992127,0.0013646012,0.00014036527,0.002911039,0.00094412506,0.0000697198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001430773,0.00031354054,0.00042442748,0.00022211538,0.000044101642,0.0000023244243,0.008372181,0.002296844,0.00073231134,0.975071,0.000006190096,0.012371902],"study_design_scores_gemma":[0.0012322909,0.000050554605,0.016076975,0.000090304704,0.000021218028,0.000017939885,0.0000691126,0.12730128,0.0031912061,0.85126656,0.0004118213,0.000270752],"about_ca_topic_score_codex":0.000019892643,"about_ca_topic_score_gemma":0.000020498199,"teacher_disagreement_score":0.4430961,"about_ca_system_score_codex":0.000084310566,"about_ca_system_score_gemma":0.00022334923,"threshold_uncertainty_score":0.9999475},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015748029264598357,"score_gpt":0.2727249808000736,"score_spread":0.2569769515354753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185939662","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016092476,0.0004934059,0.97464406,0.0013862279,0.0019217528,0.001954882,0.0022943066,0.00089276244,0.00032012802],"genre_scores_gemma":[0.013053516,0.00013394015,0.9822119,0.0009519325,0.00036848482,0.0006067133,0.002618683,0.000054855587,4.0483914e-9],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936772,0.0006165801,0.0011831198,0.0024875463,0.00062072737,0.001414823],"domain_scores_gemma":[0.9943289,0.000695689,0.0008412066,0.003284455,0.00031770096,0.0005320029],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009076115,0.0010836173,0.0013110742,0.0011065844,0.0005864272,0.00068044435,0.0049143597,0.00085286354,0.000041805713],"category_scores_gemma":[0.00025588763,0.001157686,0.0013787857,0.00088228064,0.0006821167,0.0005481513,0.0031681408,0.0017006521,0.000065058375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011656442,0.0005136125,0.0024764393,0.00022197417,0.00028823593,0.00007386255,0.0004258475,0.0016511118,0.00032091615,0.9881742,0.0016383857,0.0040988727],"study_design_scores_gemma":[0.0012136996,0.00029493525,0.005406538,0.00012285872,0.00011548397,0.000021485755,0.0000148124,0.01044991,0.0022824616,0.9730087,0.005918885,0.001150234],"about_ca_topic_score_codex":0.00003560592,"about_ca_topic_score_gemma":0.00020257378,"teacher_disagreement_score":0.015165482,"about_ca_system_score_codex":0.00013326299,"about_ca_system_score_gemma":0.0006125773,"threshold_uncertainty_score":0.99908733},"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":"W2187022892","doi":"","title":"Fast computation of Tate pairing on general divisors of genus 3 hyperelliptic curves.","year":2006,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Pairing; Pointwise; Computation; Mathematics; Divisor (algebraic geometry); Generalization; Degenerate energy levels; Genus; Hyperelliptic curve cryptography; Hyperelliptic curve; Algebra over a field; Pure mathematics; Discrete mathematics; Algorithm; Computer science; Mathematical analysis","score_opus":0.01528944342629144,"score_gpt":0.24983086574990987,"score_spread":0.23454142232361844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187022892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36533794,0.0005672295,0.63165945,0.00027884613,0.0005396331,0.00036988786,0.000037034413,0.00007698112,0.0011330129],"genre_scores_gemma":[0.6081387,0.0003374196,0.39122057,0.00010174498,0.00007184679,0.00004254448,0.00005859374,0.000026500997,0.0000021186781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967251,0.0004851388,0.0009437533,0.00093290594,0.0004375984,0.00047549215],"domain_scores_gemma":[0.99745685,0.00043399565,0.00084807567,0.000990617,0.00016242912,0.00010801654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037939288,0.0004405736,0.0009075849,0.00067268225,0.000090901616,0.000028529497,0.0013431164,0.00024119014,0.000006538996],"category_scores_gemma":[0.000056431207,0.00042791868,0.000497853,0.00032426594,0.0005974609,0.00006690839,0.0017080497,0.00084484415,0.000020184441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008256896,0.0008177429,0.021801796,0.002111527,0.0005152891,0.00012245183,0.0025688894,0.28321365,0.0019342616,0.625438,0.00065953325,0.06073432],"study_design_scores_gemma":[0.00085430243,0.00040091918,0.1993926,0.0017363513,0.00012722814,0.00005218656,0.000027218852,0.122831665,0.004649719,0.6690487,0.00009849769,0.00078057806],"about_ca_topic_score_codex":0.00032657626,"about_ca_topic_score_gemma":0.000044271845,"teacher_disagreement_score":0.2428007,"about_ca_system_score_codex":0.00003285796,"about_ca_system_score_gemma":0.0001562522,"threshold_uncertainty_score":0.99981725},"labels":[],"label_agreement":null},{"id":"W2395288854","doi":"","title":"Privacy-Preserving Data Publish-Subscribe Service on Cloud-based Platforms.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cloud computing; Publication; Computer security; Encryption; Information privacy; Service (business); Scheme (mathematics); Database; Business","score_opus":0.06187660414737324,"score_gpt":0.29404678921625904,"score_spread":0.23217018506888581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395288854","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033388656,0.000117092495,0.94569194,0.008373205,0.003529808,0.001005656,0.0011875065,0.0008924993,0.0058136396],"genre_scores_gemma":[0.09144355,0.00006981788,0.8948423,0.0070806704,0.0008933582,0.00020276046,0.005374784,0.000092171955,5.5853343e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921775,0.00055475434,0.001128067,0.0037969297,0.0009377313,0.0014050204],"domain_scores_gemma":[0.9804455,0.0016988423,0.0008785289,0.016108967,0.00029601317,0.0005721383],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0017871036,0.001070944,0.0012470898,0.00088387245,0.00045913146,0.00093598315,0.025464041,0.0008373735,0.00016631595],"category_scores_gemma":[0.0011252606,0.0010436347,0.00039544838,0.00070080324,0.00038733133,0.0010831691,0.05097663,0.003571174,0.0004883869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016352498,0.0003726203,0.001626437,0.00038793238,0.00020937691,0.000091325244,0.0012887251,0.0016669116,0.00005785359,0.9681309,0.02229734,0.0037070517],"study_design_scores_gemma":[0.0008769117,0.00011019325,0.003964103,0.00028463046,0.000053242828,0.000027525715,0.00003184022,0.16764091,0.00023936943,0.79030085,0.035498746,0.00097167474],"about_ca_topic_score_codex":0.0004050013,"about_ca_topic_score_gemma":0.00082724146,"teacher_disagreement_score":0.17783004,"about_ca_system_score_codex":0.000090193666,"about_ca_system_score_gemma":0.0007227382,"threshold_uncertainty_score":0.9992014},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022317925406379703,"score_gpt":0.24630946952594637,"score_spread":0.22399154411956668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395604259","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05954093,0.00016838813,0.9333706,0.00060757005,0.0009082266,0.0007527257,0.000087007975,0.0006019495,0.0039626127],"genre_scores_gemma":[0.1571694,0.000076439144,0.8418033,0.00025983568,0.00013913708,0.00013625037,0.00037948147,0.000035738336,4.1891485e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99600583,0.0004871048,0.00064941245,0.0017047129,0.00041286825,0.0007400605],"domain_scores_gemma":[0.9966558,0.00032150233,0.00061759306,0.0018841405,0.00021990052,0.00030102488],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004260853,0.00065562647,0.00084664946,0.00055548694,0.00021712415,0.00023803966,0.0023994239,0.00046523006,0.0000771828],"category_scores_gemma":[0.000057178124,0.0005825297,0.000327237,0.0005501574,0.00061005366,0.00029231375,0.0039594932,0.0019297494,0.00017997691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026606803,0.00024015536,0.0068928646,0.00008642066,0.00025647765,0.00018919793,0.0046181586,0.00054648565,0.000024198836,0.9806398,0.0012690001,0.0049711517],"study_design_scores_gemma":[0.00088312867,0.00015847235,0.020831646,0.00014819737,0.00006493813,0.00008608328,0.000049543953,0.0046109837,0.0002066747,0.97093755,0.0012676645,0.00075511105],"about_ca_topic_score_codex":0.000116945455,"about_ca_topic_score_gemma":0.00021382722,"teacher_disagreement_score":0.09762847,"about_ca_system_score_codex":0.000041150906,"about_ca_system_score_gemma":0.00032801714,"threshold_uncertainty_score":0.99966264},"labels":[],"label_agreement":null},{"id":"W2396596880","doi":"","title":"Recognition in Ad Hoc Pervasive Networks.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mobile ad hoc network; Protocol (science); Wireless ad hoc network; Context (archaeology); Computer security; Computer network; Wireless; Network packet","score_opus":0.027165206803068373,"score_gpt":0.24989831255773465,"score_spread":0.22273310575466626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396596880","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14899863,0.0016014569,0.8401826,0.0014668959,0.0029917108,0.0009776583,0.000031741412,0.0004593087,0.0032899834],"genre_scores_gemma":[0.2064424,0.020244218,0.7702702,0.0012940482,0.00071858516,0.0005446886,0.0003775099,0.00010501774,0.0000033110337],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99436605,0.0010133195,0.0009918439,0.0020187357,0.00041249552,0.0011975411],"domain_scores_gemma":[0.995787,0.0011471104,0.0005931233,0.002026713,0.00018485523,0.00026116008],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00041338208,0.00075553986,0.0011057137,0.00067182665,0.000178831,0.00013304925,0.002814604,0.0010150478,0.0000500863],"category_scores_gemma":[0.00021520988,0.00086832955,0.0004098253,0.00043157235,0.00057013705,0.00022055293,0.004921376,0.0038051459,0.00039678937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036863345,0.0010343002,0.0077766893,0.0002613046,0.0005460396,0.005650134,0.033775643,0.20795576,0.000091844355,0.3510601,0.0060900087,0.38538957],"study_design_scores_gemma":[0.00084422575,0.00011834554,0.01157337,0.0004358799,0.000024755034,0.00052198383,0.00011450697,0.27661535,0.000098182376,0.7069646,0.0015577958,0.0011309906],"about_ca_topic_score_codex":0.00008334965,"about_ca_topic_score_gemma":0.0005572515,"teacher_disagreement_score":0.38425857,"about_ca_system_score_codex":0.00025319486,"about_ca_system_score_gemma":0.00031361604,"threshold_uncertainty_score":0.9993767},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01521569710605519,"score_gpt":0.25754269505890914,"score_spread":0.24232699795285395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396907655","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022730784,0.00050191785,0.9614832,0.00038574688,0.00037493464,0.0020281451,0.00018136596,0.00027755473,0.012036367],"genre_scores_gemma":[0.18926023,0.00059441425,0.8069315,0.0002884567,0.00006829178,0.002504404,0.00032285496,0.000028925984,9.3251816e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962903,0.00033200745,0.0006583707,0.0017619618,0.0002931788,0.00066417066],"domain_scores_gemma":[0.9968637,0.00023789876,0.00031778275,0.0022526411,0.00008098659,0.0002469895],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005569724,0.0005415723,0.00065845734,0.00072014163,0.0002108585,0.0001554021,0.0021047995,0.00041199807,0.00009310846],"category_scores_gemma":[0.000021770124,0.00055994204,0.0002285936,0.0004721544,0.0005043529,0.00017720966,0.0043987795,0.0012494555,0.000069561975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035125486,0.00037053236,0.006859096,0.00030777292,0.00008376834,0.0000472113,0.0031700772,0.0004451507,0.00001618391,0.979642,0.00031747358,0.008705622],"study_design_scores_gemma":[0.00057015073,0.00007526681,0.023452332,0.000120286146,0.00004194366,0.000006383408,0.00030172383,0.005453621,0.00019764237,0.96255547,0.006655233,0.0005699428],"about_ca_topic_score_codex":0.00033619034,"about_ca_topic_score_gemma":0.00061786233,"teacher_disagreement_score":0.16652945,"about_ca_system_score_codex":0.000073019335,"about_ca_system_score_gemma":0.00018207371,"threshold_uncertainty_score":0.9996852},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014745225472079307,"score_gpt":0.27993204636132785,"score_spread":0.26518682088924855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397122158","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032675,0.00018621315,0.95551157,0.006895991,0.00090842805,0.0030960764,0.000087826855,0.00023335156,0.0004055687],"genre_scores_gemma":[0.048453473,0.00019193922,0.9495874,0.00046403793,0.00027196284,0.0008670871,0.000098576005,0.000058683636,0.0000068301497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","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.00025752917],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012634064,0.00070973684,0.0007672574,0.0004932049,0.00095567503,0.00016373821,0.002233513,0.00036294016,0.00001068429],"category_scores_gemma":[0.00024436682,0.0004996516,0.00064526056,0.00044304266,0.0006024614,0.000108887856,0.0019513349,0.0016495147,0.00005712834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078839535,0.0017378898,0.007554922,0.00063162955,0.0016301485,0.00016756775,0.021208668,0.4548529,0.0019498898,0.43440074,0.003010011,0.07206724],"study_design_scores_gemma":[0.001504715,0.00019991821,0.019959623,0.00018333558,0.00013910721,0.00032244125,0.00027450593,0.8815754,0.0018484335,0.089574866,0.0036022908,0.00081533974],"about_ca_topic_score_codex":0.0001794134,"about_ca_topic_score_gemma":0.00015220848,"teacher_disagreement_score":0.4267225,"about_ca_system_score_codex":0.00016460796,"about_ca_system_score_gemma":0.0005088133,"threshold_uncertainty_score":0.9997455},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016324419076376485,"score_gpt":0.24484436062907758,"score_spread":0.22851994155270108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398056013","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26068318,0.0003180831,0.7365228,0.00017717778,0.00047562068,0.00034687537,0.00010354674,0.00010703862,0.0012656979],"genre_scores_gemma":[0.37725678,0.00012120275,0.62237483,0.000072490766,0.000059590766,0.000037270813,0.00006505554,0.000012693444,8.830783e-8],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974792,0.00028906713,0.00056418264,0.0010382556,0.00024077654,0.00038849673],"domain_scores_gemma":[0.99757665,0.00026875696,0.0004694717,0.0013804461,0.0001354989,0.00016914659],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041143098,0.0003661928,0.0005860603,0.00039832588,0.00012329208,0.00003953362,0.0013037674,0.00035897174,0.00003160966],"category_scores_gemma":[0.00009868882,0.00035965184,0.00021812989,0.00019819483,0.00054478954,0.0000686497,0.0043646116,0.00093177415,0.000024943263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037755657,0.00015713941,0.0016516403,0.00015063064,0.00009423614,0.000019112242,0.0066541703,0.00039126797,0.00028961356,0.98702604,0.000090363545,0.0034380571],"study_design_scores_gemma":[0.00030681133,0.000093325405,0.0109750405,0.00009344944,0.00003790253,0.000040540803,0.000054616346,0.032495033,0.0017499579,0.9535046,0.0003067304,0.00034200153],"about_ca_topic_score_codex":0.00013012861,"about_ca_topic_score_gemma":0.00007878294,"teacher_disagreement_score":0.11657359,"about_ca_system_score_codex":0.000015723876,"about_ca_system_score_gemma":0.00015342225,"threshold_uncertainty_score":0.99988556},"labels":[],"label_agreement":null},{"id":"W2399399600","doi":"","title":"Gambling, Computational Information and Encryption Security.","year":2015,"lang":"en","type":"article","venue":"IACR Cryptology ePrint Archive","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Encryption; Equivalence (formal languages); Computer science; Theoretical computer science; Characterization (materials science); Semantic security; Adversary; Rationality; Mathematics; Computer security; Discrete mathematics; Attribute-based encryption; Political science; Law; Public-key cryptography","score_opus":0.020148281271157975,"score_gpt":0.2614881055601711,"score_spread":0.24133982428901313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399399600","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095905155,0.000039583123,0.8994721,0.0013980215,0.0002829882,0.0002029148,0.000006868263,0.00020042786,0.002491924],"genre_scores_gemma":[0.46554074,0.0000119791375,0.53367347,0.00062132237,0.00006109305,0.000025371424,0.000059236983,0.000006128749,6.570664e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985376,0.00018698334,0.00035817866,0.0003161052,0.00031968323,0.00028144257],"domain_scores_gemma":[0.9988865,0.00022029197,0.00018563536,0.00028280637,0.00020932325,0.0002154057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005019495,0.00017007613,0.00018429669,0.00031358423,0.000111229405,0.00013936577,0.00036698813,0.00008134375,0.000015764597],"category_scores_gemma":[0.00021596349,0.00017659478,0.000047714257,0.00021528857,0.00019198444,0.0014046452,0.00039507166,0.00026185357,0.00037901677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003619528,0.00003650562,0.0015377604,0.000013546735,0.000014943608,0.000009716347,0.005180115,0.003437123,0.00026599798,0.9765954,0.00085983356,0.012012841],"study_design_scores_gemma":[0.00075360824,0.000115789764,0.0059913313,0.000011997984,0.000005271524,0.00013670187,0.00012365938,0.22476052,0.00023212869,0.7648417,0.0028554124,0.00017191641],"about_ca_topic_score_codex":0.00004394289,"about_ca_topic_score_gemma":0.000015678812,"teacher_disagreement_score":0.36963558,"about_ca_system_score_codex":0.000074508294,"about_ca_system_score_gemma":0.0001815698,"threshold_uncertainty_score":0.72013265},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01804911491935102,"score_gpt":0.23951052844748588,"score_spread":0.22146141352813487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399698160","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19017717,0.00041364672,0.80042183,0.0031580657,0.0018496173,0.000999296,0.0007123926,0.0010306006,0.00123735],"genre_scores_gemma":[0.21339834,0.0004783325,0.7824112,0.00081773906,0.00053819397,0.00033342597,0.0019310471,0.00008871725,0.0000029818254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919642,0.0010402808,0.0013350451,0.0032962183,0.0008815749,0.0014826867],"domain_scores_gemma":[0.99231845,0.00086108193,0.00095717405,0.0046757837,0.00037139666,0.0008161399],"candidate_categories":["metaepi_narrow","open_science","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006490599,0.001149281,0.0013595606,0.0010024913,0.0004933143,0.0006911971,0.004984591,0.0010854026,0.0004034744],"category_scores_gemma":[0.00059286004,0.0011957603,0.0008669739,0.00078489253,0.00084006885,0.0008561672,0.0092568,0.0031229253,0.0010551425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001244185,0.0007594853,0.006568126,0.00015410194,0.00043182287,0.0004479541,0.0017586587,0.0015181759,0.00059776043,0.97760814,0.0017428236,0.008288519],"study_design_scores_gemma":[0.0014480577,0.00015406359,0.021914935,0.00024236453,0.00010083572,0.00006464587,0.00006123704,0.011521901,0.0013477155,0.95236874,0.009479538,0.001295966],"about_ca_topic_score_codex":0.0016064608,"about_ca_topic_score_gemma":0.0012640093,"teacher_disagreement_score":0.025239414,"about_ca_system_score_codex":0.00030357917,"about_ca_system_score_gemma":0.0013838791,"threshold_uncertainty_score":0.99972266},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04197999025954345,"score_gpt":0.3194083773701073,"score_spread":0.27742838711056383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401020796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17418116,0.00019706592,0.8230245,0.0009717714,0.0005133078,0.00039564463,0.00012324065,0.00009721635,0.00049607997],"genre_scores_gemma":[0.7896651,0.00011862817,0.20975427,0.00010337016,0.00010046355,0.00013050988,0.000112297304,0.000014542528,7.947474e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957895,0.0008174608,0.0010810358,0.001007899,0.00058064744,0.0007234497],"domain_scores_gemma":[0.9952061,0.0007121314,0.0009997755,0.0026789047,0.00022397094,0.00017910036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007641766,0.0004923293,0.0011276086,0.001060303,0.0003211158,0.00014683319,0.0033073283,0.00025357588,0.00035291276],"category_scores_gemma":[0.00009438916,0.00037365264,0.0013662362,0.0014112891,0.00076589803,0.00014366483,0.004528478,0.0011167098,0.000027469627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000141825185,0.00017845393,0.024063934,0.00004681384,0.003300223,0.000009645529,0.006775758,0.0006167133,0.00079403043,0.96015,0.00009636887,0.0039538653],"study_design_scores_gemma":[0.00035652064,0.000046754194,0.118534915,0.000029733585,0.0028599584,0.000018419585,0.00035113285,0.03700936,0.0006919673,0.83883363,0.0006280482,0.00063956593],"about_ca_topic_score_codex":0.0006188046,"about_ca_topic_score_gemma":0.0010569571,"teacher_disagreement_score":0.61548394,"about_ca_system_score_codex":0.00005505635,"about_ca_system_score_gemma":0.00020257258,"threshold_uncertainty_score":0.99987155},"labels":[],"label_agreement":null},{"id":"W2401830601","doi":"","title":"On \"identities\", \"names\", \"NAMES\", \"ROLES\" and Security: A Manifesto.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Key (lock); Identity (music); Pseudonym; Manifesto; Internet privacy; Confusion; Computer science; The Internet; Session (web analytics); Computer security; Political science; World Wide Web; Law; Psychology","score_opus":0.0168470842744169,"score_gpt":0.2742616828883731,"score_spread":0.2574145986139562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401830601","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024056625,0.00017946793,0.9482774,0.00073103164,0.0009879424,0.005241896,0.00007158465,0.00061561255,0.019838413],"genre_scores_gemma":[0.38108328,0.0003848899,0.61022395,0.0012690702,0.00018540311,0.0066247326,0.0000662108,0.000116672505,0.00004578159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948097,0.00059315027,0.00085917313,0.0023210614,0.0005141636,0.0009027437],"domain_scores_gemma":[0.9954018,0.00046742262,0.00071188976,0.0028627247,0.0001641316,0.00039202382],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00048604002,0.0008304909,0.0009291237,0.0006646938,0.00029219463,0.00022035246,0.0029015525,0.0005379031,0.00013135726],"category_scores_gemma":[0.00016407775,0.00087892544,0.00030891225,0.00020811625,0.0010290375,0.0003091049,0.0081089055,0.0021103001,0.00059288845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065431224,0.00025157924,0.0005111703,0.00023176632,0.00015577239,0.000254833,0.010070103,0.00003674744,0.000038729082,0.98433036,0.00024493437,0.0038085629],"study_design_scores_gemma":[0.0006788379,0.00014701614,0.0022048138,0.0002835219,0.000044989036,0.00026752456,0.00011869087,0.00261504,0.00051851035,0.9916609,0.0006665812,0.00079357164],"about_ca_topic_score_codex":0.000023047543,"about_ca_topic_score_gemma":0.000040468913,"teacher_disagreement_score":0.35702667,"about_ca_system_score_codex":0.00012699612,"about_ca_system_score_gemma":0.0002114657,"threshold_uncertainty_score":0.99991333},"labels":[],"label_agreement":null},{"id":"W2402401357","doi":"","title":"A Zero-Knowledge Identification and Key Agreement Protocol.","year":2007,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Zero-knowledge proof; Protocol (science); Computer science; Key (lock); Overhead (engineering); Identification (biology); Zero (linguistics); Key-agreement protocol; Mathematical proof; Property (philosophy); Theoretical computer science; Computer security; Mathematics; Public-key cryptography; Cryptography; Key distribution; Programming language; Medicine","score_opus":0.027893098033815476,"score_gpt":0.34836525692026293,"score_spread":0.3204721588864475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402401357","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006644901,0.000031144325,0.85525185,0.00059348106,0.00039905816,0.1393074,0.000016402497,0.00027414347,0.0034620233],"genre_scores_gemma":[0.01777891,0.0000101730275,0.5927637,0.00013243505,0.00009778518,0.3891354,0.000029264083,0.000029949657,0.000022374683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99576,0.0004497137,0.0010366124,0.0017522601,0.00036764337,0.00063376804],"domain_scores_gemma":[0.9961495,0.00033160587,0.00084745686,0.0021145297,0.00029396484,0.00026298093],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011064972,0.00051980146,0.00055580016,0.00046433613,0.00024093704,0.0002282861,0.0019940818,0.00036283108,0.00004023975],"category_scores_gemma":[0.00023069626,0.00054090214,0.00016159145,0.00022812843,0.0005241706,0.00025615166,0.0062341867,0.0011834295,0.0004107977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037170266,0.00029228025,0.0010856725,0.00033415956,0.00005901521,0.000017668457,0.0048540314,0.00007023319,0.0008263776,0.9649946,0.000112694055,0.027316092],"study_design_scores_gemma":[0.0006367937,0.00006652577,0.011466231,0.00014056094,0.00001624769,0.000035650617,0.00002507626,0.008566025,0.0036872404,0.9660979,0.008778351,0.0004834234],"about_ca_topic_score_codex":0.000011691069,"about_ca_topic_score_gemma":0.000044911765,"teacher_disagreement_score":0.26248816,"about_ca_system_score_codex":0.00016221199,"about_ca_system_score_gemma":0.00028924027,"threshold_uncertainty_score":0.99970424},"labels":[],"label_agreement":null},{"id":"W2402407337","doi":"","title":"KIST: A new encryption algorithm based on splay.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Encryption; Computer science; Asynchronous communication; Key space; Theoretical computer science; Key (lock); Probabilistic encryption; Sequence (biology); Algorithm; Computer security; Computer network","score_opus":0.013615349898749544,"score_gpt":0.26011269866136133,"score_spread":0.24649734876261178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402407337","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042546904,0.000046233738,0.9801753,0.0046740496,0.003974871,0.0011252209,0.00008651525,0.00085056666,0.0048125517],"genre_scores_gemma":[0.016760511,0.000033037293,0.9797935,0.0018898206,0.00092804746,0.00021824085,0.00027263656,0.00008451141,0.000019716203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938679,0.0006717638,0.0009469379,0.0025341867,0.0008925791,0.0010866777],"domain_scores_gemma":[0.9941678,0.0009780588,0.00077224127,0.0032370384,0.00021194266,0.00063289126],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008207807,0.0010133592,0.0009920945,0.0010386778,0.0002731917,0.0003456832,0.003318149,0.0010029344,0.00037454188],"category_scores_gemma":[0.00037123225,0.0010631297,0.00062053686,0.0003719857,0.00045656724,0.0002837725,0.0027580615,0.0044991714,0.0016721813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002112061,0.0005961621,0.00030067432,0.00013849305,0.00014085801,0.0005386421,0.0014048653,0.014857597,0.014146471,0.7252097,0.0044750334,0.23798026],"study_design_scores_gemma":[0.0009898165,0.00026336996,0.003053357,0.00018541918,0.00004209829,0.000074974785,0.000007920103,0.43427896,0.004169901,0.55233294,0.0037698355,0.0008314187],"about_ca_topic_score_codex":0.00039583276,"about_ca_topic_score_gemma":0.00013673617,"teacher_disagreement_score":0.41942137,"about_ca_system_score_codex":0.00030540224,"about_ca_system_score_gemma":0.0015582086,"threshold_uncertainty_score":0.99918187},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.059044838352927405,"score_gpt":0.30448366913741975,"score_spread":0.24543883078449236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403115307","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073498555,0.00021062812,0.9149344,0.0010875034,0.004719035,0.0008016694,0.0021488739,0.0006125436,0.00198677],"genre_scores_gemma":[0.29088983,0.00028416724,0.7046475,0.0008762489,0.00024895708,0.00013976255,0.00282911,0.00007870689,0.000005761674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946845,0.000552384,0.00071780715,0.002664348,0.00044612394,0.0009348138],"domain_scores_gemma":[0.9893132,0.0012460611,0.0005090374,0.008578212,0.000087128676,0.00026636256],"candidate_categories":["metaepi_narrow","open_science","research_integrity","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.00054825284,0.00069881324,0.00083391357,0.00040858058,0.00036605893,0.00020850365,0.009466354,0.0005270175,0.00014976658],"category_scores_gemma":[0.00077575876,0.00076254737,0.00024839403,0.00021377808,0.00060808484,0.0003883889,0.03482213,0.0024444086,0.0009299988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062637846,0.00027580597,0.0015985906,0.00011385596,0.00025478008,0.00014867295,0.0033079083,0.00044065717,0.000110709014,0.9834627,0.008709792,0.0015139069],"study_design_scores_gemma":[0.0006868708,0.00008451147,0.013402542,0.00021458755,0.00005631836,0.000056321223,0.000053246746,0.15074125,0.000074622185,0.82783914,0.005973653,0.0008169615],"about_ca_topic_score_codex":0.0008152102,"about_ca_topic_score_gemma":0.002958495,"teacher_disagreement_score":0.21739127,"about_ca_system_score_codex":0.00020482551,"about_ca_system_score_gemma":0.0004165427,"threshold_uncertainty_score":0.999857},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"NTRU; Padding; Computer science; Cryptosystem; Encryption; Public-key cryptography; Computer security; Theoretical computer science","score_opus":0.04247813839381644,"score_gpt":0.30886405416974355,"score_spread":0.26638591577592713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403185010","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36104667,0.0001765509,0.6334644,0.0013086118,0.0007689618,0.0006506607,0.000060113278,0.00020504107,0.0023189576],"genre_scores_gemma":[0.3154096,0.000995526,0.68061054,0.0019578168,0.00036036025,0.00036117993,0.00025200268,0.000052340645,6.6121123e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99530643,0.0013040749,0.00054426026,0.0017574904,0.00039745693,0.00069029216],"domain_scores_gemma":[0.99580085,0.0007992069,0.00038687163,0.0026216041,0.00010380715,0.00028766473],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011163172,0.00063688454,0.0005745146,0.00036834084,0.00051318447,0.00038365272,0.0018910699,0.0004950127,0.00010401686],"category_scores_gemma":[0.00025217579,0.00050379935,0.00027777674,0.0002724597,0.00065938925,0.0003554402,0.0023172058,0.0019432139,0.00014738624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056211127,0.00017512345,0.0019082527,0.000043529115,0.00008830825,0.000023983353,0.0017536384,0.00006855007,0.0009858861,0.9891764,0.0009371381,0.004782987],"study_design_scores_gemma":[0.0003952784,0.00028228317,0.017257296,0.000088212495,0.000033236236,0.00008447172,0.00010068762,0.008977366,0.00062666734,0.9674201,0.004124715,0.00060968776],"about_ca_topic_score_codex":0.000054026485,"about_ca_topic_score_gemma":0.00012048248,"teacher_disagreement_score":0.04714609,"about_ca_system_score_codex":0.00006104449,"about_ca_system_score_gemma":0.00017300127,"threshold_uncertainty_score":0.9997414},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03765234709929096,"score_gpt":0.30144897872614473,"score_spread":0.2637966316268538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403999494","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014935131,0.00004561169,0.95676583,0.0006275919,0.0012721134,0.031482175,0.00022177909,0.00084315,0.007248247],"genre_scores_gemma":[0.005734931,0.000018435743,0.9101332,0.00060159265,0.00021688553,0.08293184,0.00030085785,0.0000610896,0.000001200263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943736,0.00086565147,0.0009293497,0.0021866134,0.0005786124,0.0010661526],"domain_scores_gemma":[0.9944993,0.00030501818,0.0007404726,0.0038001246,0.00023180975,0.00042326003],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00092386163,0.00081847503,0.00094353146,0.000884257,0.00031016584,0.0003753693,0.0055396846,0.0006811055,0.00058216066],"category_scores_gemma":[0.00017583228,0.00082556927,0.0006566613,0.00052774086,0.0008075627,0.00052671775,0.008479163,0.0020878795,0.0007553566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011547484,0.00056839327,0.0013742115,0.00049037515,0.00016432063,0.00017069039,0.0033392634,0.00001778306,0.0001513899,0.9885595,0.0016416507,0.0034069808],"study_design_scores_gemma":[0.0009633108,0.00013742398,0.005820801,0.00017146535,0.000055402983,0.000028656299,0.00001850738,0.004370368,0.0011104373,0.97044295,0.01604607,0.00083460344],"about_ca_topic_score_codex":0.000250983,"about_ca_topic_score_gemma":0.00043292364,"teacher_disagreement_score":0.051449668,"about_ca_system_score_codex":0.000071266295,"about_ca_system_score_gemma":0.00052333734,"threshold_uncertainty_score":0.9998408},"labels":[],"label_agreement":null},{"id":"W2405026724","doi":"","title":"Channel Equalization for Side Channel Attacks.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Side channel attack; Computer science; Channel (broadcasting); Power analysis; Equalization (audio); Algorithm; Telecommunications; Cryptography","score_opus":0.04181677102258774,"score_gpt":0.326520209169371,"score_spread":0.2847034381467833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405026724","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008331151,0.00009770691,0.98352915,0.0029853038,0.0022339015,0.0015475012,0.0001915392,0.0003435341,0.00074019993],"genre_scores_gemma":[0.4413974,0.00017643561,0.55385315,0.0013848417,0.0006038384,0.0015414373,0.000969626,0.00006887694,0.0000043907444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961979,0.00039424445,0.00083676755,0.001429267,0.00031376604,0.0008280466],"domain_scores_gemma":[0.9964742,0.00093407894,0.00061123515,0.001490146,0.00027788721,0.00021246089],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008130304,0.0005405044,0.0007415267,0.0006230458,0.00039413985,0.00021615752,0.0018420256,0.00038351945,0.000026467233],"category_scores_gemma":[0.0002806224,0.0005721977,0.00047259932,0.00024663148,0.00024271414,0.00015943688,0.0027520123,0.00065739,0.000057717385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002745232,0.00011175204,0.000118117576,0.00017880353,0.00013669423,0.00000663551,0.00467723,0.0033134494,0.00009143789,0.9861215,0.0019722502,0.0032447176],"study_design_scores_gemma":[0.0006897921,0.00012830572,0.0012841015,0.000060294984,0.000040332703,0.000019413881,0.00011169911,0.1358642,0.0003678514,0.8559776,0.004913929,0.0005424613],"about_ca_topic_score_codex":0.00008965507,"about_ca_topic_score_gemma":0.00028510817,"teacher_disagreement_score":0.43306625,"about_ca_system_score_codex":0.00006586352,"about_ca_system_score_gemma":0.0002198683,"threshold_uncertainty_score":0.99967295},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04896042530811537,"score_gpt":0.33207799164512714,"score_spread":0.2831175663370118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405997985","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08807197,0.00024050924,0.8998316,0.0024001077,0.0029188944,0.00072994473,0.00038015467,0.00058252685,0.0048443205],"genre_scores_gemma":[0.13013785,0.00012650226,0.86568457,0.0015159299,0.0013912795,0.000087772205,0.00097505096,0.00007817669,0.0000028989557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940199,0.00049629796,0.0008750672,0.0027119461,0.0007419308,0.0011548351],"domain_scores_gemma":[0.9942357,0.00030714256,0.0005239383,0.0034196973,0.00017511021,0.0013384427],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.00055051333,0.00086530176,0.0010790456,0.00074271037,0.00025961906,0.0010191349,0.009033997,0.0008062059,0.00039018568],"category_scores_gemma":[0.00048373808,0.00087285263,0.0005214538,0.000454404,0.0005939729,0.0006680752,0.030257858,0.0036591678,0.00018757282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000124589,0.000081789214,0.0031646623,0.00008863204,0.0002520383,0.00031411508,0.0033408378,0.0005599327,0.00022439614,0.98086125,0.0063339695,0.004653797],"study_design_scores_gemma":[0.0007364281,0.00009568612,0.0022934533,0.00010403747,0.000057081008,0.00031533014,0.000022389511,0.007653381,0.00043993845,0.9804946,0.006931659,0.00085601024],"about_ca_topic_score_codex":0.000945304,"about_ca_topic_score_gemma":0.00071079284,"teacher_disagreement_score":0.04206587,"about_ca_system_score_codex":0.00012654929,"about_ca_system_score_gemma":0.0022469738,"threshold_uncertainty_score":0.99937224},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022166258531877262,"score_gpt":0.2505621489034478,"score_spread":0.22839589037157054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407643022","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028139405,0.00025753563,0.9534226,0.006283413,0.002462943,0.0015362654,0.0002575194,0.00064831553,0.0069920104],"genre_scores_gemma":[0.12311304,0.00014901235,0.87382585,0.0014917925,0.0003869323,0.00073505496,0.00023395897,0.00005875169,0.000005597471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944178,0.00060954853,0.00067918544,0.0024591389,0.0005585951,0.0012757605],"domain_scores_gemma":[0.99363315,0.0006137158,0.00044462772,0.004318409,0.00026554085,0.00072452636],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.00044784532,0.00086344994,0.0011945502,0.0007637542,0.0002885442,0.0009843647,0.006291837,0.0005932022,0.00014171927],"category_scores_gemma":[0.00024466595,0.0008761941,0.0005212736,0.00045293328,0.0004254957,0.00045035238,0.013546551,0.0020923465,0.00077939505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015569818,0.00018606527,0.0010671935,0.00012746008,0.00019997104,0.00009360367,0.0024552548,0.00026281938,0.000956188,0.972994,0.011092762,0.010549111],"study_design_scores_gemma":[0.00044929783,0.00010522335,0.008653664,0.00012942197,0.000037228343,0.00006441697,0.00007290495,0.004020838,0.0008784106,0.9528,0.031784408,0.0010041989],"about_ca_topic_score_codex":0.00022111041,"about_ca_topic_score_gemma":0.00016037906,"teacher_disagreement_score":0.09497364,"about_ca_system_score_codex":0.00007705317,"about_ca_system_score_gemma":0.00026468295,"threshold_uncertainty_score":0.9999986},"labels":[],"label_agreement":null},{"id":"W2470027437","doi":"","title":"Key Exchange Using Passwords and Long Keys.","year":2006,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Hermeneutics and Narrative Identity","field":"Arts and Humanities","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Password; Computer science; Key exchange; Computer security; Server; Cryptography; Key (lock); Protocol (science); Denial-of-service attack; Dictionary attack; Public-key cryptography; Computer network; Encryption; Operating system; The Internet","score_opus":0.04514150658639628,"score_gpt":0.26989651793604763,"score_spread":0.22475501134965137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2470027437","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90928614,0.0006883996,0.019190423,0.00062206166,0.0021588136,0.00063325587,0.00031992173,0.00012842049,0.06697254],"genre_scores_gemma":[0.9779314,0.00047258096,0.016973028,0.00046542054,0.0031158805,0.00015064894,0.00030701404,0.00013288362,0.00045115085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976902,0.00029958627,0.000495902,0.00077050686,0.00020528657,0.0005384928],"domain_scores_gemma":[0.99877846,0.00015262673,0.00032261456,0.0004772648,0.0001342984,0.00013471275],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002735913,0.00046532231,0.00066716963,0.00029884197,0.0004978307,0.00030476163,0.00032769577,0.0002445832,0.0014983335],"category_scores_gemma":[0.000039590068,0.0004559006,0.00020139912,0.0000246876,0.0011660387,0.000092585266,0.0015955154,0.0009681457,0.00008668886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036717393,0.00013785972,0.023498418,0.00032823105,0.00024970976,0.00015557259,0.015001741,0.00009490735,0.00010445188,0.954101,0.003202577,0.0030887702],"study_design_scores_gemma":[0.000511371,0.00007512921,0.041504975,0.00021644357,0.00018350493,0.00003035335,0.00038464204,0.0016199554,0.000084356725,0.8852289,0.0693009,0.0008595015],"about_ca_topic_score_codex":0.0026878775,"about_ca_topic_score_gemma":0.037951116,"teacher_disagreement_score":0.068872176,"about_ca_system_score_codex":0.000081722974,"about_ca_system_score_gemma":0.00012588827,"threshold_uncertainty_score":0.9997893},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012734412756111046,"score_gpt":0.22354043542633542,"score_spread":0.21080602267022439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2479395603","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022853385,0.00014498201,0.98645544,0.0025002402,0.00045687848,0.0002646659,0.0000016205448,0.0014766455,0.0064141927],"genre_scores_gemma":[0.15889017,0.000015659765,0.8405288,0.0002645687,0.00016366645,0.00004209482,0.000032045475,0.000024921339,0.00003807406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980751,0.00023762614,0.00033927718,0.000558707,0.00022988667,0.000559355],"domain_scores_gemma":[0.9984002,0.00018441914,0.00017830989,0.00091480964,0.00016178872,0.00016047881],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036548823,0.00021065226,0.00027134953,0.00016286671,0.00014057533,0.0000829963,0.0013193989,0.00015018471,0.000106504005],"category_scores_gemma":[0.00028334156,0.00020774643,0.000056867466,0.0007423283,0.00031024244,0.00027747746,0.0010759535,0.00025337277,0.0032794913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007816401,0.000040209863,0.0020746824,0.0000032093149,0.000038184833,0.000024503908,0.00048082732,0.008773338,0.00009292555,0.95648545,0.015544567,0.016434291],"study_design_scores_gemma":[0.00031300788,0.00007915568,0.00071793713,0.0000124542485,0.000007888625,0.000050807314,0.000015313271,0.27686578,0.00032801673,0.7165864,0.0048172087,0.0002059994],"about_ca_topic_score_codex":0.0000044108706,"about_ca_topic_score_gemma":0.0000047906747,"teacher_disagreement_score":0.26809245,"about_ca_system_score_codex":0.000102872094,"about_ca_system_score_gemma":0.0001915106,"threshold_uncertainty_score":0.99749655},"labels":[],"label_agreement":null},{"id":"W2488354164","doi":"","title":"An Access Control Scheme for Partially Ordered Set Hierarchy with Provable Security.","year":2004,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Access Control and Trust","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Hierarchy; Scheme (mathematics); Access control; Provable security; Set (abstract data type); Partially ordered set; Theoretical computer science; Access structure; Concrete security; Security analysis; Computer security model; Computer security; Cryptography; Secret sharing; Discrete mathematics; Mathematics","score_opus":0.03019837584626652,"score_gpt":0.3619801880290875,"score_spread":0.331781812182821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2488354164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12977925,0.0001759351,0.83871835,0.008790221,0.000872643,0.0062996023,0.0007496243,0.000519871,0.014094526],"genre_scores_gemma":[0.9348682,0.00007955856,0.06056563,0.0007119077,0.00089847646,0.002468661,0.00031697156,0.00007961639,0.000010982147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99513876,0.00079784024,0.00066249457,0.001477513,0.0005425048,0.0013809042],"domain_scores_gemma":[0.9967611,0.0006275841,0.0006439512,0.0009691917,0.00048594657,0.0005122601],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009888483,0.00062652724,0.0011587035,0.00027936188,0.0010083664,0.0005615184,0.0023509737,0.0006823438,0.00027823087],"category_scores_gemma":[0.00040095774,0.0005635251,0.00030307702,0.00020403435,0.0016809877,0.0005137156,0.0006985497,0.0013277163,0.00004013777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018675306,0.0004185557,0.02367799,0.00021503613,0.000649788,0.00008379843,0.0134100355,0.0038621642,0.00008350625,0.9535699,0.00022149905,0.001940213],"study_design_scores_gemma":[0.004320445,0.0003423207,0.0037813508,0.00013381557,0.00020542408,0.000007844115,0.00090752303,0.002615425,0.00010699024,0.97469795,0.0120469,0.0008339954],"about_ca_topic_score_codex":0.004248924,"about_ca_topic_score_gemma":0.032800205,"teacher_disagreement_score":0.80508894,"about_ca_system_score_codex":0.00020304188,"about_ca_system_score_gemma":0.0032610332,"threshold_uncertainty_score":0.99968165},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018219213927283345,"score_gpt":0.28220699548224276,"score_spread":0.2639877815549594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2495523385","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09686528,0.00025216822,0.8916301,0.0011847182,0.00019547266,0.007095553,0.00024399953,0.00029696635,0.0022357262],"genre_scores_gemma":[0.17886794,0.000095919044,0.81728965,0.00017967325,0.00014059493,0.0032969355,0.00009773937,0.00003142057,1.4878106e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99502134,0.0008661614,0.001087819,0.0018686189,0.00047064293,0.00068542606],"domain_scores_gemma":[0.9949312,0.0007402444,0.0007541953,0.0030883458,0.00017394993,0.00031204196],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010148634,0.00065670547,0.001211937,0.0006486514,0.00020104805,0.00014440756,0.002985859,0.0005561398,0.000038240585],"category_scores_gemma":[0.00016142179,0.0006560269,0.0004681949,0.00045091382,0.0019053619,0.00023865666,0.008395399,0.0017494103,0.000012191344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012099808,0.00044088118,0.025705958,0.00052041176,0.0001385014,0.00001969486,0.0028471618,0.000109755565,0.00036318338,0.95772874,0.00024031368,0.01176441],"study_design_scores_gemma":[0.0006735462,0.00015779647,0.06729713,0.00024520396,0.000035029865,0.000059164257,0.00007763201,0.0026244868,0.0007607819,0.919165,0.008302209,0.00060198596],"about_ca_topic_score_codex":0.000113645634,"about_ca_topic_score_gemma":0.00017242489,"teacher_disagreement_score":0.082002655,"about_ca_system_score_codex":0.000031541895,"about_ca_system_score_gemma":0.00023390075,"threshold_uncertainty_score":0.9996245},"labels":[],"label_agreement":null},{"id":"W2577487606","doi":"","title":"Faster individual discrete logarithms in non-prime finite fields with the NFS and FFS algorithms","year":2016,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; University of Calgary","funders":"","keywords":"Finite field; Discrete logarithm; Mathematics; Algorithm; Logarithm; Polynomial; Exponent; Field (mathematics); Discrete mathematics; Computer science; Pure mathematics; Mathematical analysis; Encryption","score_opus":0.010758184280191353,"score_gpt":0.23940175702582236,"score_spread":0.22864357274563102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577487606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047042515,0.0002580514,0.93968385,0.009612476,0.0005212809,0.0007761522,0.000068217596,0.00009476156,0.0019426931],"genre_scores_gemma":[0.69311637,0.00024416787,0.30500636,0.0009878713,0.00023249713,0.00032407584,0.000028747454,0.000045796216,0.000014107055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963526,0.00048730616,0.00050576887,0.0014139042,0.00041079207,0.00082964386],"domain_scores_gemma":[0.99653155,0.0013319922,0.00032279541,0.0015565997,0.00006653178,0.00019055566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006035341,0.0006077202,0.00070439297,0.0005414972,0.0002351108,0.00026565438,0.0023424113,0.00047859037,0.000022089202],"category_scores_gemma":[0.00005280334,0.00035426306,0.00020393102,0.00028400743,0.0011900964,0.00017919268,0.005505325,0.0019176478,0.000036718553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003213696,0.0003833235,0.06740982,0.00026141392,0.0013377569,0.001408142,0.040576782,0.0014753086,0.00022241512,0.72073764,0.00077627506,0.16508976],"study_design_scores_gemma":[0.0017227117,0.00035555978,0.20769615,0.00043677006,0.00008642192,0.00021489832,0.0002536288,0.011083741,0.00031756933,0.7760101,0.0008324607,0.0009899936],"about_ca_topic_score_codex":0.00012662387,"about_ca_topic_score_gemma":0.0005678638,"teacher_disagreement_score":0.6460739,"about_ca_system_score_codex":0.00002633225,"about_ca_system_score_gemma":0.0001850909,"threshold_uncertainty_score":0.9998909},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024701466136035372,"score_gpt":0.2633926433495877,"score_spread":0.2386911772135523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579035965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058771037,0.00004151648,0.93325657,0.0010471487,0.00019823266,0.0004382915,0.0000043201226,0.0001717257,0.006071149],"genre_scores_gemma":[0.8936335,0.000009708908,0.10614498,0.0000988029,0.00004125069,0.00005322307,0.0000048559687,0.000010381511,0.0000033348708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835974,0.00025922124,0.00026259042,0.0005733016,0.00016298595,0.0003821523],"domain_scores_gemma":[0.9989049,0.00030517898,0.00012751625,0.00042137425,0.00009892037,0.00014210201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021764963,0.00020924896,0.0003221858,0.000114459974,0.00015829546,0.000074288095,0.00040022196,0.00006824997,0.000016586493],"category_scores_gemma":[0.000017356462,0.0001310511,0.000049024227,0.00010105918,0.00079956837,0.0003106653,0.0004682734,0.0001816414,0.00007821188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097006014,0.00009958515,0.023749067,0.000019973517,0.000072975345,0.00009370243,0.0012997211,7.18889e-7,0.00432483,0.93135905,0.000043332268,0.038840014],"study_design_scores_gemma":[0.00091349095,0.00050953747,0.039666496,0.00005346115,0.000020312227,0.0011639557,0.00014241127,0.001157714,0.0057474235,0.9489104,0.0012955063,0.00041925718],"about_ca_topic_score_codex":0.000056533365,"about_ca_topic_score_gemma":0.0001783417,"teacher_disagreement_score":0.8348624,"about_ca_system_score_codex":0.000051838837,"about_ca_system_score_gemma":0.00005688286,"threshold_uncertainty_score":0.5344109},"labels":[],"label_agreement":null},{"id":"W2584558163","doi":"","title":"Seifert's RSA Fault Attack: Simplified Analysis and Generalizations.","year":2005,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Hermeneutics and Narrative Identity","field":"Arts and Humanities","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Signature (topology); Public-key cryptography; Adversary; Key (lock); Fault (geology); Algorithm; Theoretical computer science; Computer security; Mathematics; Encryption; Biology","score_opus":0.04087114391319847,"score_gpt":0.2876850525547492,"score_spread":0.24681390864155073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2584558163","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87209636,0.00033727277,0.06816907,0.0026775564,0.0009990804,0.0006911984,0.000806466,0.00019577247,0.05402725],"genre_scores_gemma":[0.9830315,0.0007885412,0.0119497515,0.0010628963,0.0014234722,0.00016770187,0.0009563391,0.00006422905,0.00055558287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745303,0.00033358939,0.0006349015,0.0008906915,0.00022053011,0.0004672247],"domain_scores_gemma":[0.998393,0.00018974028,0.00034423225,0.00065885304,0.00022630753,0.00018789152],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002392395,0.00046694878,0.0008715443,0.0006579061,0.00055324985,0.00035312623,0.00040539788,0.0002490368,0.0036747274],"category_scores_gemma":[0.00007492187,0.0004474579,0.00038662803,0.00009597611,0.00088579906,0.00009526316,0.0011481742,0.00077191513,0.0001683193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030529445,0.00013867953,0.011284164,0.000067566296,0.0023348958,0.000024585079,0.01515522,0.0031067051,0.00008922005,0.9613302,0.004104725,0.0023335305],"study_design_scores_gemma":[0.00078233256,0.00009133426,0.06765997,0.000062038445,0.0025981523,0.000011902257,0.0012704256,0.016061943,0.00019516103,0.6457529,0.26404557,0.0014682813],"about_ca_topic_score_codex":0.00074348797,"about_ca_topic_score_gemma":0.042261705,"teacher_disagreement_score":0.3155773,"about_ca_system_score_codex":0.00006549811,"about_ca_system_score_gemma":0.00013067415,"threshold_uncertainty_score":0.9997977},"labels":[],"label_agreement":null},{"id":"W2610386497","doi":"","title":"Efficient Primitives from Exponentiation in Zp.","year":2006,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Hermeneutics and Narrative Identity","field":"Arts and Humanities","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Precomputation; Discrete logarithm; Modular exponentiation; Computer science; Random oracle; Hash function; Generator (circuit theory); Cryptography; Theoretical computer science; Pseudorandom number generator; Exponentiation; Cryptosystem; Oracle; Algorithm; Encryption; Mathematics; Public-key cryptography; Computer security; Programming language","score_opus":0.025262499356245815,"score_gpt":0.2440150283154283,"score_spread":0.21875252895918249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610386497","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9344058,0.00017339361,0.009975166,0.00047631023,0.0017714297,0.0005910654,0.00052460586,0.00008450881,0.051997703],"genre_scores_gemma":[0.9936355,0.00003615742,0.0045712036,0.00011240023,0.00072546426,0.00016922916,0.0006596261,0.00003826924,0.000052172265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748725,0.0004062548,0.0006464359,0.0007928318,0.00023513695,0.00043207154],"domain_scores_gemma":[0.9987428,0.00027315126,0.00035228205,0.00045775514,0.00010225696,0.00007170988],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023366332,0.00038280536,0.000581923,0.00037170266,0.00020570339,0.00017016873,0.00037311445,0.0002113372,0.001602906],"category_scores_gemma":[0.000065176464,0.00038693173,0.0002229405,0.000029264826,0.0005976078,0.000037663438,0.000850751,0.0009386072,0.0003126327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006174079,0.00045492017,0.017106498,0.000051225972,0.0001284621,0.00006318206,0.022752918,0.003334236,0.0004215364,0.9534626,0.0010798862,0.0010827722],"study_design_scores_gemma":[0.00055252964,0.000035238518,0.22062156,0.00016041567,0.00005276492,9.5183526e-7,0.000670258,0.0041043805,0.0002870315,0.7648117,0.0081994515,0.00050373946],"about_ca_topic_score_codex":0.0055959336,"about_ca_topic_score_gemma":0.047152586,"teacher_disagreement_score":0.20351507,"about_ca_system_score_codex":0.00013496385,"about_ca_system_score_gemma":0.00013471436,"threshold_uncertainty_score":0.99985826},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009665921524565033,"score_gpt":0.244235066854762,"score_spread":0.234569145330197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890774540","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05326152,0.00017059778,0.92619026,0.002678812,0.0019374607,0.0009246122,0.0001284108,0.00094587967,0.0137624685],"genre_scores_gemma":[0.13498205,0.000043699478,0.8616221,0.0021683117,0.00040629256,0.000331431,0.00033711843,0.00010262049,0.000006372141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939185,0.0007231518,0.0009441607,0.0024792051,0.0007813609,0.0011536564],"domain_scores_gemma":[0.99466765,0.001024897,0.00068430626,0.0029824562,0.00031510892,0.0003256102],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00053870486,0.0010041668,0.0010011225,0.0012574067,0.0002792153,0.0003105654,0.003478762,0.00065283483,0.00010408335],"category_scores_gemma":[0.00022859553,0.0010365039,0.00082349626,0.0003837697,0.0005910709,0.00025526184,0.0041834046,0.0026848903,0.00094932807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011996896,0.00038899665,0.00052095164,0.00009213621,0.00014478248,0.00028236597,0.0008662973,0.007473728,0.004788392,0.960245,0.002874413,0.022202944],"study_design_scores_gemma":[0.0006920831,0.00030787222,0.01213041,0.00017449855,0.00004178605,0.000078569064,0.000008715706,0.029383905,0.0015796379,0.9539153,0.0007298549,0.0009573768],"about_ca_topic_score_codex":0.00032715505,"about_ca_topic_score_gemma":0.00017118601,"teacher_disagreement_score":0.08172053,"about_ca_system_score_codex":0.00021665992,"about_ca_system_score_gemma":0.0004957874,"threshold_uncertainty_score":0.9998286},"labels":[],"label_agreement":null},{"id":"W2899238141","doi":"","title":"Cybersecurity in an Era With Quantum Computers: Will We Be Ready?","year":2015,"lang":"en","type":"article","venue":"IACR Cryptology ePrint Archive","topic":"Information and Cyber Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer security; Plan (archaeology); Quantum computer; Computer science; Quantum; Physics; Geology","score_opus":0.031123796185820753,"score_gpt":0.2703885434113868,"score_spread":0.23926474722556604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899238141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27244645,0.00001972336,0.7159757,0.004586892,0.00036065007,0.00022700922,0.0000068713757,0.00019247936,0.006184202],"genre_scores_gemma":[0.65837353,0.000012382953,0.33973035,0.0017635003,0.00005167734,0.000028217535,0.000028783254,0.0000103809325,0.0000011729256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980851,0.0003136997,0.00036907525,0.00046420452,0.00028950672,0.0004784523],"domain_scores_gemma":[0.99853855,0.00012493508,0.00014918178,0.0007564104,0.00012734144,0.00030356928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004294077,0.00022506501,0.00030896117,0.00024359874,0.00008874154,0.000106549036,0.0010129702,0.00009907609,0.000016057444],"category_scores_gemma":[0.00003232234,0.00019656727,0.00004417335,0.00027704175,0.0002568267,0.0013260765,0.00045107974,0.0005059472,0.00014197617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059826027,0.00013824024,0.004715054,0.000007453394,0.000012336184,0.00008480727,0.036520246,0.00019270458,0.000012176924,0.9551808,0.000686471,0.0023898487],"study_design_scores_gemma":[0.0023806875,0.00072091527,0.020841926,0.000053109117,0.0000072808,0.0002773723,0.0019223186,0.15018828,0.0001914578,0.80493915,0.017853208,0.00062430504],"about_ca_topic_score_codex":0.00013596764,"about_ca_topic_score_gemma":0.00087194087,"teacher_disagreement_score":0.38592708,"about_ca_system_score_codex":0.000067345536,"about_ca_system_score_gemma":0.00023354655,"threshold_uncertainty_score":0.80157804},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022021747716683374,"score_gpt":0.29779166401768536,"score_spread":0.275769916301002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907648450","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04260921,0.0006971655,0.95182294,0.0008191063,0.0009184218,0.0015496315,0.0002721052,0.00039688428,0.0009145249],"genre_scores_gemma":[0.18486688,0.00013801582,0.813667,0.00007956054,0.00015898113,0.00034008332,0.000712495,0.00003540789,0.0000015758654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962436,0.0003876289,0.0005499767,0.0017096268,0.00028742463,0.0008217405],"domain_scores_gemma":[0.9968334,0.00066463597,0.00074001396,0.001288277,0.0001990418,0.00027462177],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094087335,0.0005710804,0.0007960285,0.0003727208,0.0010021174,0.00068328634,0.0016710169,0.0003435829,0.000009230802],"category_scores_gemma":[0.00030652233,0.0005679144,0.00031031342,0.00013705798,0.0006398862,0.00021604564,0.0046228734,0.0015693983,0.000022104614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011472698,0.00020521598,0.007100722,0.0003411405,0.00017065898,0.00003183691,0.002311439,0.01225545,0.000119834396,0.94267285,0.00030538903,0.034370743],"study_design_scores_gemma":[0.0009452646,0.00012839184,0.0017973991,0.000098648015,0.000046517795,0.000051324438,0.000022980419,0.41392496,0.00011760392,0.57670796,0.0057281284,0.00043083855],"about_ca_topic_score_codex":0.00019789065,"about_ca_topic_score_gemma":0.0002819451,"teacher_disagreement_score":0.4016695,"about_ca_system_score_codex":0.000037040467,"about_ca_system_score_gemma":0.00019179173,"threshold_uncertainty_score":0.99967724},"labels":[],"label_agreement":null},{"id":"W2949109729","doi":"","title":"Large Universe Ciphertext-Policy Attribute-Based Encryption with White-Box Traceability","year":2014,"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Traitor tracing; Attribute-based encryption; Traceability; Encryption; Ciphertext; Key (lock); Computer security; Access control; Overhead (engineering); Database; Public-key cryptography; Operating system; Software engineering","score_opus":0.011705749169046225,"score_gpt":0.24977428949183525,"score_spread":0.238068540322789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949109729","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06249198,0.00005675826,0.9288173,0.0032790757,0.0005790199,0.0010455105,0.0007003198,0.0009090244,0.0021210439],"genre_scores_gemma":[0.48463205,0.000040500734,0.5135936,0.0006584801,0.00024709225,0.0001516734,0.000634017,0.000041740794,8.2663206e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934288,0.0013523633,0.000791948,0.0024929922,0.00061959616,0.001314301],"domain_scores_gemma":[0.9938334,0.00070431136,0.0007141153,0.0039219367,0.00030944,0.00051680097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011749169,0.0009364136,0.0011680231,0.00086787133,0.00044293544,0.0002504892,0.0032778727,0.0007342087,0.00017842994],"category_scores_gemma":[0.00025396023,0.00088070775,0.00057601556,0.00077239267,0.00089501287,0.00037896947,0.004477647,0.0022714315,0.0001913115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024311345,0.0006664142,0.01858204,0.00022185444,0.00016314289,0.000098041644,0.0025700901,0.0022324582,0.00006156943,0.97182244,0.0008696528,0.0024691946],"study_design_scores_gemma":[0.0023464654,0.00041973728,0.050514765,0.00019106729,0.00010324496,0.000054920092,0.00020357048,0.038755447,0.00026194705,0.8968191,0.009012548,0.0013171603],"about_ca_topic_score_codex":0.0001872952,"about_ca_topic_score_gemma":0.00094998,"teacher_disagreement_score":0.42214006,"about_ca_system_score_codex":0.00023818258,"about_ca_system_score_gemma":0.0012137546,"threshold_uncertainty_score":0.9993644},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Prime (order theory); Logarithm; Genus; Variation (astronomy); Context (archaeology); Heuristic; Hyperelliptic curve cryptography; Mathematics; Algorithm; Discrete logarithm; Computer science; Combinatorics; Mathematical optimization; Mathematical analysis; Zoology","score_opus":0.020836332228812322,"score_gpt":0.25874625551600866,"score_spread":0.23790992328719635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949160893","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05427494,0.0003107579,0.93927497,0.0014443096,0.0016417507,0.0018348354,0.00007510063,0.00037253907,0.00077082234],"genre_scores_gemma":[0.35785255,0.000100162084,0.6405911,0.00033752408,0.0002866017,0.0006772987,0.000096653035,0.000052612628,0.000005507954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959502,0.00024060522,0.0007338955,0.0016799492,0.00030879,0.0010865439],"domain_scores_gemma":[0.99675834,0.00046079373,0.00056972017,0.0017402741,0.00020446352,0.00026640386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064462965,0.00061723276,0.0008575928,0.0006640134,0.00034799738,0.00022253086,0.0021852115,0.0005522723,0.000017120503],"category_scores_gemma":[0.00008931917,0.000609729,0.00065428327,0.00036218928,0.00033124743,0.00011545081,0.0029500711,0.0012860859,0.0001106658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016092083,0.00039402922,0.0012948695,0.00018992362,0.00033266767,0.00006302352,0.0037844472,0.004694772,0.00028804634,0.98364854,0.000039672108,0.005109114],"study_design_scores_gemma":[0.0027526699,0.00019479336,0.031655148,0.00012699176,0.00011288067,0.000086567255,0.000033420445,0.043180812,0.00066987454,0.91832423,0.0020871293,0.00077545823],"about_ca_topic_score_codex":0.00044465667,"about_ca_topic_score_gemma":0.0006575501,"teacher_disagreement_score":0.3035776,"about_ca_system_score_codex":0.00015364993,"about_ca_system_score_gemma":0.0007324928,"threshold_uncertainty_score":0.9996354},"labels":[],"label_agreement":null},{"id":"W2949234615","doi":"","title":"Functional Encryption for Inner Product Predicates from Learning with Errors.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Functional encryption; Encryption; Scheme (mathematics); Computer science; Bilinear interpolation; Theoretical computer science; Learning with errors; Probabilistic encryption; Lattice (music); Identity (music); Mathematics; Algorithm; Computer security","score_opus":0.02731640463955579,"score_gpt":0.23638325127767076,"score_spread":0.20906684663811498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949234615","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06953553,0.00024723297,0.9257852,0.00082486175,0.0011414982,0.0009809497,0.00024638145,0.0004678591,0.0007704749],"genre_scores_gemma":[0.21482399,0.000073415176,0.7820935,0.00012240175,0.00047354685,0.00072715647,0.0016467691,0.000037742513,0.0000014690439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961297,0.00036225075,0.0005296021,0.0020126856,0.00034435443,0.00062144006],"domain_scores_gemma":[0.99701023,0.00053398864,0.00055538927,0.001461722,0.00023893353,0.0001997592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047906235,0.0005532291,0.0006305281,0.00039402826,0.00033155442,0.00013200345,0.001546796,0.00032947838,0.00014334008],"category_scores_gemma":[0.00022365016,0.00048596578,0.00029058172,0.00020670601,0.0005278627,0.00032343814,0.0024094975,0.0016380858,0.00008764261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037341838,0.00023086544,0.014695899,0.00009291062,0.00037079625,0.000016446837,0.0032384275,0.00070537336,0.00059587334,0.9726555,0.0013957795,0.0056287353],"study_design_scores_gemma":[0.000648859,0.00020906366,0.043770682,0.00011439363,0.000089445726,0.000028867678,0.00005854689,0.006773027,0.0016147484,0.9419556,0.0041435375,0.0005932136],"about_ca_topic_score_codex":0.0002934342,"about_ca_topic_score_gemma":0.00024811682,"teacher_disagreement_score":0.14528847,"about_ca_system_score_codex":0.00004163121,"about_ca_system_score_gemma":0.00032354594,"threshold_uncertainty_score":0.9997592},"labels":[],"label_agreement":null},{"id":"W2949277723","doi":"","title":"On Isogeny Graphs of Supersingular Elliptic Curves over Finite Fields.","year":2018,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Isogeny; Supersingular elliptic curve; Finite field; Mathematics; Elliptic curve; Pure mathematics; Discrete mathematics","score_opus":0.015041918843179607,"score_gpt":0.2532680040649097,"score_spread":0.23822608522173008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949277723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21724625,0.0006944473,0.7737211,0.0006463654,0.0015799478,0.0004189814,0.000040284784,0.00018818729,0.0054644686],"genre_scores_gemma":[0.8028279,0.0010053305,0.1937261,0.0020611319,0.00017941325,0.000092411385,0.000052961776,0.00004916735,0.000005595975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99650985,0.0006157945,0.0006467407,0.0012390176,0.00038820773,0.0006003904],"domain_scores_gemma":[0.99552953,0.0014284488,0.00041514818,0.0023156006,0.00013993778,0.00017131785],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006175069,0.0005324048,0.0008139601,0.0006891591,0.00016382478,0.000057798286,0.0025992529,0.00041162453,0.00028451878],"category_scores_gemma":[0.00029810332,0.0005245445,0.000726849,0.0003448043,0.0009106702,0.000096317606,0.0026788271,0.0011690281,0.00012013063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009937519,0.00020334897,0.0016683255,0.00031741697,0.00026326813,0.000044356366,0.0021403073,0.00036070918,0.00022097491,0.99119574,0.0019047235,0.0015814473],"study_design_scores_gemma":[0.00030128096,0.0004237042,0.0032275908,0.0008587022,0.00006548587,0.000016467891,0.000018086124,0.002706866,0.0017734437,0.9895092,0.0006047019,0.00049446494],"about_ca_topic_score_codex":0.00003004943,"about_ca_topic_score_gemma":0.000020551724,"teacher_disagreement_score":0.58558166,"about_ca_system_score_codex":0.000023667399,"about_ca_system_score_gemma":0.00015781887,"threshold_uncertainty_score":0.99972063},"labels":[],"label_agreement":null},{"id":"W2949283829","doi":"","title":"The Simeck Family of Lightweight Block Ciphers.","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Block cipher; Computer science; Application-specific integrated circuit; Cipher; CMOS; Block (permutation group theory); Power consumption; Power analysis; Embedded system; Throughput; Cryptanalysis; Differential cryptanalysis; Differential (mechanical device); Cryptography; Power (physics); Computer security; Operating system; Electrical engineering; Engineering; Mathematics; Encryption; Wireless","score_opus":0.029131919527570188,"score_gpt":0.2935757807247714,"score_spread":0.2644438611972012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949283829","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10783832,0.0015428347,0.86927044,0.0034708073,0.002303426,0.00093523576,0.00010690829,0.00019667779,0.014335374],"genre_scores_gemma":[0.48263994,0.0011455367,0.51514536,0.00038606513,0.00026666207,0.0002849437,0.00007648457,0.000046897123,0.000008085911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965614,0.0005286303,0.00089354074,0.00088620145,0.0004969416,0.0006332825],"domain_scores_gemma":[0.99591076,0.0007651018,0.0006464687,0.0021126769,0.00036282497,0.00020213534],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009535552,0.00041879958,0.00062093075,0.00027749632,0.00032742968,0.00015277801,0.0031351487,0.00026218727,0.000018398294],"category_scores_gemma":[0.0001113058,0.00031931195,0.00038124327,0.00032916665,0.0006972668,0.000094597046,0.004926598,0.0010403594,0.000054834658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024941033,0.00009956988,0.001133827,0.0000320658,0.0002170225,0.000020853111,0.0036733786,0.0001813965,0.000279465,0.98179173,0.00540603,0.0071396865],"study_design_scores_gemma":[0.00043559616,0.0001089122,0.0042286473,0.000037541733,0.000041815583,0.000023806831,0.00044541497,0.0044665225,0.00047677464,0.95505214,0.034323156,0.00035970044],"about_ca_topic_score_codex":0.00016821685,"about_ca_topic_score_gemma":0.00030696552,"teacher_disagreement_score":0.37480164,"about_ca_system_score_codex":0.000056417837,"about_ca_system_score_gemma":0.00059999543,"threshold_uncertainty_score":0.9999259},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013372456032269959,"score_gpt":0.26228215504186864,"score_spread":0.24890969900959867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949285224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037444297,0.000073878124,0.9478679,0.0018512078,0.002180976,0.0010225902,0.00083901105,0.00046091597,0.008259249],"genre_scores_gemma":[0.64868605,0.000020881545,0.34873015,0.00045599925,0.00022748222,0.00040709955,0.001420255,0.000048127593,0.0000039635083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99463964,0.0008458129,0.00087230816,0.0022356345,0.0006480506,0.00075856404],"domain_scores_gemma":[0.99453855,0.0011549274,0.0007648034,0.0030475333,0.00024832494,0.00024586977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007234199,0.000747234,0.00078047253,0.0010380662,0.0005057471,0.00035986744,0.0021736552,0.00030472814,0.00006382483],"category_scores_gemma":[0.00020665639,0.0007534568,0.0006016145,0.00038539528,0.0004452753,0.00030981173,0.002594271,0.0019061221,0.00029486802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071383046,0.0012286645,0.00034318407,0.000119036835,0.0001878291,0.00025356747,0.0012494206,0.015964486,0.000852032,0.9669768,0.006988085,0.005123069],"study_design_scores_gemma":[0.0010657943,0.00024018512,0.009617042,0.00031717698,0.00008494859,0.000024857505,0.00004614939,0.19262248,0.002827853,0.7902459,0.0021328987,0.0007747222],"about_ca_topic_score_codex":0.00037243252,"about_ca_topic_score_gemma":0.00029129785,"teacher_disagreement_score":0.61124176,"about_ca_system_score_codex":0.00021347549,"about_ca_system_score_gemma":0.0003857593,"threshold_uncertainty_score":0.99949163},"labels":[],"label_agreement":null},{"id":"W2949312368","doi":"","title":"Tate pairing computation on the divisors of hyperelliptic curves for cryptosystems.","year":2005,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Pairing; Hyperelliptic curve; Mathematics; Hyperelliptic curve cryptography; Divisor (algebraic geometry); Computation; Cryptosystem; Finite field; Discrete mathematics; Pure mathematics; Algebra over a field; Cryptography; Algorithm; Computer science; Elliptic curve cryptography; Encryption; Public-key cryptography; Physics","score_opus":0.03451022781561683,"score_gpt":0.2734379639903689,"score_spread":0.23892773617475208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949312368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071588665,0.0009447354,0.9178378,0.00559602,0.0009489328,0.001694525,0.000056115743,0.00016900546,0.0011642124],"genre_scores_gemma":[0.6378699,0.00065870845,0.36005566,0.0006221481,0.00019820048,0.00050633843,0.000043814995,0.000042632524,0.0000026348391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965698,0.0006432485,0.00085265865,0.0009874001,0.00038907173,0.00055782445],"domain_scores_gemma":[0.99472976,0.003020815,0.00074189215,0.001209547,0.00018718012,0.00011081125],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009253367,0.00047839567,0.000788537,0.00042115463,0.00026326027,0.0000805353,0.0019595833,0.0002348558,0.000011294724],"category_scores_gemma":[0.00024964055,0.00035679174,0.0006040693,0.0002584847,0.00046998836,0.000081651044,0.001478758,0.0008871166,0.000038708746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004885507,0.00020959764,0.00083667005,0.0009607716,0.000322123,0.000009197997,0.00226948,0.022887865,0.00034737136,0.957289,0.0010431784,0.013775929],"study_design_scores_gemma":[0.00056279876,0.00028409963,0.00873538,0.0017304032,0.00010479722,0.000030270934,0.00011990215,0.09501117,0.0018336048,0.890059,0.0009460931,0.00058249664],"about_ca_topic_score_codex":0.000041055388,"about_ca_topic_score_gemma":0.000043979766,"teacher_disagreement_score":0.5662812,"about_ca_system_score_codex":0.000040349052,"about_ca_system_score_gemma":0.0001642938,"threshold_uncertainty_score":0.9998884},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Waterloo","funders":"","keywords":"Computer science; Traceability; Disjoint sets; Hash function; Combinatorial design; Coding (social sciences); Theoretical computer science; Order (exchange); Discrete mathematics; Mathematics; Computer security","score_opus":0.027975962897799463,"score_gpt":0.2209522293025324,"score_spread":0.19297626640473292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949376982","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9117196,0.00071040384,0.0024499116,0.0010036568,0.0014938372,0.0011852548,0.000023233042,0.00025286837,0.081161246],"genre_scores_gemma":[0.996592,0.000115710376,0.0021008274,0.0002648065,0.00073630246,0.00009605914,0.000042768494,0.0000445108,0.000007054041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753714,0.00011490038,0.00074184866,0.0009097318,0.00026735506,0.00042905266],"domain_scores_gemma":[0.99844146,0.00017035789,0.00040181616,0.000724479,0.00023095949,0.000030914718],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005699404,0.00048834045,0.0009752458,0.00031207016,0.00016470285,0.0001551269,0.00060459954,0.00042050699,0.0021216795],"category_scores_gemma":[0.00056891254,0.00038205774,0.00023700496,0.0001269639,0.0011658099,0.00026023833,0.0018365083,0.0011448887,0.0001712694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005715248,0.0016088285,0.017310116,0.005395763,0.00079450913,0.00003911447,0.0043713073,0.00013544595,0.00548834,0.912433,0.01588143,0.03082686],"study_design_scores_gemma":[0.0007445642,0.000052602965,0.005557945,0.00029708148,0.00014824924,0.0000059868753,0.00011883306,0.0129823005,0.0015791343,0.96438515,0.013566867,0.00056130724],"about_ca_topic_score_codex":0.0010453298,"about_ca_topic_score_gemma":0.00015301484,"teacher_disagreement_score":0.08487237,"about_ca_system_score_codex":0.00003191989,"about_ca_system_score_gemma":0.00011210347,"threshold_uncertainty_score":0.99986315},"labels":[],"label_agreement":null},{"id":"W2949421005","doi":"","title":"Garbled Circuits for Leakage-Resilience: Hardware Implementation and Evaluation of One-Time Programs.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Side channel attack; Embedded system; Cryptography; Application-specific integrated circuit; Smart card; Field-programmable gate array; Resilience (materials science); Power analysis; Leakage (economics); Information leakage; Tamper resistance; Implementation; Hardware security module; Computer hardware; Computer security; Software engineering","score_opus":0.0483773076526309,"score_gpt":0.35682744812970824,"score_spread":0.3084501404770773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949421005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39161143,0.00007264037,0.6042594,0.00048762772,0.00034498223,0.0027357605,0.00013392478,0.00007653355,0.0002777128],"genre_scores_gemma":[0.63123316,0.000048186153,0.3666236,0.00005105537,0.00007635904,0.0013772501,0.00056789577,0.000021765441,6.93874e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964245,0.00045594468,0.0008444559,0.0011031951,0.00065539073,0.00051650725],"domain_scores_gemma":[0.9970346,0.000356745,0.00074006437,0.00097654766,0.0007513638,0.0001406527],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019945872,0.0003622387,0.00059942185,0.00047649513,0.00025272352,0.0001586586,0.0009643915,0.00028791136,0.00012308953],"category_scores_gemma":[0.00014056997,0.0003944763,0.00023577343,0.00022142164,0.0003819672,0.0002071067,0.0013184077,0.000611677,0.00000722762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022480262,0.00022796832,0.0048694545,0.00022819679,0.00021133985,0.0000014501377,0.0063248053,0.0001131008,0.0082275225,0.68861264,0.00012424844,0.29103678],"study_design_scores_gemma":[0.0019458807,0.0002694194,0.04059911,0.00007897578,0.0002583372,0.000015995196,0.0004565527,0.04178675,0.0036904828,0.9100234,0.00040653985,0.00046854012],"about_ca_topic_score_codex":0.00015262651,"about_ca_topic_score_gemma":0.00085894443,"teacher_disagreement_score":0.29056823,"about_ca_system_score_codex":0.0000562183,"about_ca_system_score_gemma":0.0005818981,"threshold_uncertainty_score":0.9998507},"labels":[],"label_agreement":null},{"id":"W2949422853","doi":"","title":"How to Delegate and Verify in Public: Verifiable Computation from Attribute-based Encryption.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Verifiable secret sharing; Delegate; Computer science; Delegation; Theoretical computer science; Computation; Encryption; Cryptography; Scheme (mathematics); Function (biology); Cryptographic primitive; Computer security; Algorithm; Mathematics; Cryptographic protocol; Programming language; Law","score_opus":0.04026779600464832,"score_gpt":0.2518847595403582,"score_spread":0.2116169635357099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949422853","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15740345,0.00019076669,0.8369392,0.0030670755,0.00073428056,0.00068031414,0.00041201108,0.00021526427,0.0003576284],"genre_scores_gemma":[0.41471547,0.000053543914,0.5840886,0.00038643627,0.000062637664,0.00015979604,0.0005157431,0.000017611044,1.3612764e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960655,0.00055030955,0.0005437695,0.0017875723,0.00030904484,0.0007438293],"domain_scores_gemma":[0.9972561,0.00050916686,0.00032543062,0.0013547392,0.00015328235,0.00040125856],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049130234,0.0005367593,0.0007551792,0.0008593818,0.00017235782,0.00059940456,0.0016706845,0.00047353128,0.000028466788],"category_scores_gemma":[0.00021659811,0.0005864503,0.00017818717,0.00047732526,0.00031273067,0.0005089639,0.0035262026,0.0012787954,0.000064077794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010002352,0.00023029589,0.013761828,0.00007056502,0.000101114725,0.000095169926,0.0023747885,0.00067622634,0.0005247531,0.97462004,0.000588019,0.006857169],"study_design_scores_gemma":[0.00083551713,0.000119619595,0.06687182,0.00010846824,0.000022834318,0.000009016509,0.00006155798,0.021926876,0.0007527796,0.90547985,0.0031555507,0.0006560848],"about_ca_topic_score_codex":0.001030236,"about_ca_topic_score_gemma":0.0010950613,"teacher_disagreement_score":0.257312,"about_ca_system_score_codex":0.000088240515,"about_ca_system_score_gemma":0.00033127717,"threshold_uncertainty_score":0.9996587},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015068098000872231,"score_gpt":0.23397112799222256,"score_spread":0.21890302999135033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949439822","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15098715,0.00059416046,0.8308852,0.0010177615,0.0033613064,0.00056550885,0.00020978996,0.0011192769,0.011259895],"genre_scores_gemma":[0.41033918,0.00017374904,0.5868588,0.0008231766,0.0005565641,0.0006129207,0.0005240298,0.00009835151,0.000013212782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99418473,0.00074438896,0.00096930977,0.0024737194,0.00052902516,0.0010987959],"domain_scores_gemma":[0.9945466,0.000985164,0.00059061404,0.0033537555,0.00017614258,0.00034772087],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0005116249,0.0009794469,0.0010791596,0.0014118091,0.00059288996,0.0004188957,0.0036202425,0.0007702746,0.00026524204],"category_scores_gemma":[0.00007395791,0.0010156994,0.0012754737,0.0008127254,0.001009141,0.00026046712,0.0049985517,0.0024683971,0.0003768132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059806738,0.00032830014,0.016312554,0.000036492078,0.0004962057,0.00007765178,0.001017602,0.0007641549,0.0005259451,0.9649897,0.0051251496,0.010266438],"study_design_scores_gemma":[0.0005720832,0.00009094008,0.0652702,0.00011569951,0.00012036895,0.000029565823,0.000051955438,0.0010664376,0.00018419171,0.92659837,0.0049489555,0.00095125334],"about_ca_topic_score_codex":0.0005573297,"about_ca_topic_score_gemma":0.00056447624,"teacher_disagreement_score":0.25935203,"about_ca_system_score_codex":0.000053011154,"about_ca_system_score_gemma":0.00026189917,"threshold_uncertainty_score":0.9998329},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03917362331164062,"score_gpt":0.26339280718228103,"score_spread":0.2242191838706404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949485271","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030667344,0.00056305114,0.9490552,0.0053023775,0.00050736807,0.00093614345,0.0001840027,0.00068251777,0.012102012],"genre_scores_gemma":[0.109551094,0.0008707994,0.8877031,0.00059643126,0.0004971151,0.00020070461,0.0005290813,0.000050032173,0.0000016019666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99383384,0.0009033393,0.0007930359,0.0023706954,0.00080156134,0.0012974987],"domain_scores_gemma":[0.9946384,0.00048610463,0.00044884547,0.0035419262,0.00035377016,0.0005309449],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0010363543,0.00080505817,0.0009627301,0.0010807442,0.0003906498,0.0006292858,0.004188031,0.00059475494,0.00023891566],"category_scores_gemma":[0.00013289515,0.0007322154,0.00041597936,0.0007759833,0.0007870997,0.0006741165,0.007060301,0.003039049,0.0004914151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007879356,0.0002531763,0.006218746,0.00012739982,0.00021051012,0.0001335421,0.0025283007,0.00023119301,0.00012400236,0.9626275,0.0011210159,0.026345849],"study_design_scores_gemma":[0.0008151866,0.00025518992,0.021222709,0.0002662884,0.000058751324,0.00028443235,0.000081155,0.007546072,0.00028599516,0.93999493,0.027984928,0.0012043578],"about_ca_topic_score_codex":0.00008959617,"about_ca_topic_score_gemma":0.00030410435,"teacher_disagreement_score":0.07888375,"about_ca_system_score_codex":0.00013453038,"about_ca_system_score_gemma":0.000634835,"threshold_uncertainty_score":0.9995129},"labels":[],"label_agreement":null},{"id":"W2949581086","doi":"","title":"CommitCoin: Carbon Dating Commitments with Bitcoin.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Communication source; Proof-of-work system; Computer science; Cash; Protocol (science); Scheme (mathematics); Computer security; Commitment scheme; Power (physics); Electronic cash; Internet privacy; Business; Computer network; Payment; Cryptocurrency; World Wide Web; Cryptography; Mathematics; Finance","score_opus":0.0210170690199519,"score_gpt":0.24289619785402813,"score_spread":0.22187912883407623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949581086","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108967766,0.00016097144,0.8567293,0.0016269414,0.00039681236,0.00094846525,0.00002795268,0.0008628254,0.03027892],"genre_scores_gemma":[0.39421442,0.000050497696,0.60476106,0.00028844492,0.000051482988,0.0005502209,0.000045986042,0.000034731092,0.0000031454338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965074,0.00033076745,0.000609945,0.0015473556,0.00026618462,0.0007383375],"domain_scores_gemma":[0.9952205,0.00028565404,0.0006096456,0.0035700602,0.00013450798,0.00017962823],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00041235777,0.00060601707,0.0008095008,0.00040621602,0.00030422266,0.00007881904,0.003921302,0.0006439067,0.000036938978],"category_scores_gemma":[0.000046817986,0.00055200874,0.000156931,0.00028880854,0.00081971625,0.000073382216,0.0073260716,0.0024304618,0.000083879364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002047732,0.00024507727,0.011089929,0.000052326795,0.00021728472,0.00008540091,0.0017376805,0.000057498306,0.00008153008,0.9796829,0.00025335076,0.006476551],"study_design_scores_gemma":[0.0005120935,0.00015766306,0.0058388487,0.000107692635,0.000052405703,0.0001552458,0.000080676255,0.012354315,0.0014640153,0.97706383,0.0015505867,0.00066265074],"about_ca_topic_score_codex":0.0004196314,"about_ca_topic_score_gemma":0.00039947714,"teacher_disagreement_score":0.28524667,"about_ca_system_score_codex":0.00008351381,"about_ca_system_score_gemma":0.00025160555,"threshold_uncertainty_score":0.99987096},"labels":[],"label_agreement":null},{"id":"W2949609940","doi":"","title":"Alternative Implementations of Secure Real Numbers.","year":2016,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Implementation; Computer science; Computation; Floating point; Point (geometry); Arithmetic; Elementary function; Scheme (mathematics); Theoretical computer science; Algorithm; Mathematics; Programming language","score_opus":0.027726830641980345,"score_gpt":0.34933784493661135,"score_spread":0.321611014294631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949609940","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004940633,0.00003135522,0.9785776,0.0019865823,0.0014222914,0.00041535817,0.00025829172,0.00011223239,0.012255642],"genre_scores_gemma":[0.021583062,0.00017703968,0.97771335,0.00013050172,0.00022433668,0.00012256711,0.000023406981,0.000021072497,0.000004670488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969521,0.00064398034,0.00065724447,0.00095229584,0.00030162395,0.0004927547],"domain_scores_gemma":[0.99698454,0.0009225584,0.0006524492,0.001103678,0.00016220404,0.00017459392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037771318,0.00035242073,0.0006808234,0.00021720745,0.00009366367,0.000040697487,0.001871357,0.00018005304,0.00012002992],"category_scores_gemma":[0.00011678933,0.00028383645,0.0003051764,0.00014384519,0.00040164293,0.0001116822,0.003977123,0.00066505803,0.00006757081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001215703,0.00007166404,0.0015976628,0.000034441942,0.00018054924,0.000034223234,0.0022131342,0.000053346997,0.0007254954,0.94855696,0.00025376354,0.046266608],"study_design_scores_gemma":[0.0003626939,0.00009062744,0.0042137755,0.00008046531,0.000022665445,0.000019250067,0.00006068018,0.0037099654,0.0025909634,0.98774374,0.0008011927,0.00030400563],"about_ca_topic_score_codex":0.00036693245,"about_ca_topic_score_gemma":0.00003967246,"teacher_disagreement_score":0.045962602,"about_ca_system_score_codex":0.000065162436,"about_ca_system_score_gemma":0.00023129817,"threshold_uncertainty_score":0.9999614},"labels":[],"label_agreement":null},{"id":"W2949671922","doi":"","title":"Quantum algorithms for the subset-sum problem","year":2013,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Heuristic; Exponent; Computer science; Algorithm; Subset sum problem; Quantum algorithm; Quantum walk; Discrete mathematics; Quantum; Theoretical computer science; Combinatorics; Mathematics; Artificial intelligence; Quantum mechanics; Physics","score_opus":0.02324731095667313,"score_gpt":0.26864942616591614,"score_spread":0.24540211520924302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949671922","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007799031,0.0007141427,0.9706783,0.013314673,0.003653293,0.002636451,0.0001004939,0.00060315244,0.0005004262],"genre_scores_gemma":[0.013199676,0.00014178212,0.98337966,0.0008075702,0.00094187853,0.0013637437,0.000068671805,0.00008112841,0.000015911148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949855,0.0004412753,0.000877002,0.0019316353,0.00044913057,0.0013154268],"domain_scores_gemma":[0.9936945,0.0024800994,0.00065789477,0.0026461598,0.0002580473,0.0002633441],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00090477645,0.00084483484,0.0009352278,0.0002895787,0.00072619086,0.00050879526,0.005427276,0.00048625295,0.000031481653],"category_scores_gemma":[0.00016447292,0.00059210695,0.0006844505,0.00023492455,0.00060271093,0.00011552218,0.006943001,0.0023614173,0.00021473701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001734656,0.000107126594,0.00010760519,0.00014245912,0.00029097576,0.000025726742,0.0027191727,0.016219838,0.00008986775,0.8817463,0.0047782226,0.093755364],"study_design_scores_gemma":[0.0002590736,0.000091525035,0.00088443613,0.00007035949,0.000030395517,0.000068984824,0.000028111,0.47867373,0.00008070822,0.5106042,0.00880289,0.0004056133],"about_ca_topic_score_codex":0.00021968453,"about_ca_topic_score_gemma":0.000041461735,"teacher_disagreement_score":0.46245387,"about_ca_system_score_codex":0.00006775478,"about_ca_system_score_gemma":0.00043101833,"threshold_uncertainty_score":0.99995387},"labels":[],"label_agreement":null},{"id":"W2949680590","doi":"","title":"Password Based Key Exchange with Mutual Authentication.","year":2004,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Random oracle; Password; Mutual authentication; Computer security; Oracle; Dictionary attack; Authenticated Key Exchange; Protocol (science); Provable security; Key exchange; Key (lock); Theoretical computer science; Computer network; Cryptography; Encryption; Public-key cryptography","score_opus":0.01550311590009613,"score_gpt":0.2675190365596111,"score_spread":0.252015920659515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949680590","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025376298,0.000058774676,0.9836615,0.004428994,0.000464489,0.0062403735,0.000057874116,0.0006655552,0.0018848537],"genre_scores_gemma":[0.1979156,0.000010675458,0.79381204,0.0005256676,0.000107984255,0.0074648224,0.00010365082,0.000051601517,0.000007938033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99563056,0.0004471361,0.00069110136,0.0018646424,0.0005741643,0.00079239794],"domain_scores_gemma":[0.9952536,0.00041222142,0.00074960233,0.0030014066,0.0002765557,0.00030657172],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038213356,0.0006588411,0.000687789,0.00043185748,0.00024154906,0.00018331189,0.0030175198,0.00036677363,0.00016257576],"category_scores_gemma":[0.0001626112,0.0006165734,0.0002262904,0.0003243928,0.00071011845,0.00025078782,0.0030141934,0.0014474922,0.00054178486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000635099,0.00032213822,0.0007128999,0.00020680192,0.00008756286,0.000068757734,0.004471327,0.0030910592,0.00012735206,0.98749727,0.000043643184,0.0033076962],"study_design_scores_gemma":[0.0010581776,0.00014762946,0.0052148723,0.00025077735,0.000039546758,0.000040633266,0.000028487178,0.02697164,0.0014114177,0.96214175,0.0020084318,0.0006866628],"about_ca_topic_score_codex":0.000026058819,"about_ca_topic_score_gemma":0.00009021409,"teacher_disagreement_score":0.19537798,"about_ca_system_score_codex":0.00026932263,"about_ca_system_score_gemma":0.0010534711,"threshold_uncertainty_score":0.99962854},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05109110243666436,"score_gpt":0.30998970166587575,"score_spread":0.2588985992292114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949736952","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16845118,0.00008479735,0.82674086,0.00059960084,0.0019051889,0.00078422355,0.000016555889,0.0004219983,0.0009955949],"genre_scores_gemma":[0.4188297,0.000013178198,0.57949245,0.00048014603,0.00076778495,0.00018364206,0.00017077538,0.00005697672,0.0000053161566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99423265,0.0015056329,0.0010440616,0.0019075321,0.0005493503,0.00076077826],"domain_scores_gemma":[0.9960127,0.00036917577,0.000919749,0.0021545494,0.0002895478,0.00025428558],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011670055,0.0007211446,0.0010805917,0.00066511944,0.0004308543,0.00038569106,0.0020821162,0.0005438653,0.000086115164],"category_scores_gemma":[0.00026131212,0.0007632575,0.00047271984,0.0002439948,0.0004423876,0.00030606112,0.0033206095,0.0015558276,0.00017900865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009153772,0.0002604257,0.000479465,0.0002206958,0.00028492394,0.00015849275,0.0016176411,0.05198988,0.29046035,0.6352812,0.0014150459,0.017740339],"study_design_scores_gemma":[0.0024565407,0.0000958468,0.004862606,0.00021149694,0.00010905618,0.00019778134,0.000012394936,0.57006264,0.010750404,0.4095173,0.0006958651,0.0010281029],"about_ca_topic_score_codex":0.00022533047,"about_ca_topic_score_gemma":0.00013073857,"teacher_disagreement_score":0.5180727,"about_ca_system_score_codex":0.00032665324,"about_ca_system_score_gemma":0.00042224198,"threshold_uncertainty_score":0.99948186},"labels":[],"label_agreement":null},{"id":"W2949753337","doi":"","title":"Weakness of F 3 6*1429 and F 2 4*3041 for Discrete Logarithm Cryptography.","year":2013,"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Logarithm; Computer science; Cryptography; Embedding; Finite field; Bilinear interpolation; Discrete mathematics; Mathematics; Algorithm; Public-key cryptography; Computer security; Artificial intelligence; Encryption; Mathematical analysis","score_opus":0.011148643630385546,"score_gpt":0.25280815396348205,"score_spread":0.24165951033309652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949753337","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056403976,0.0011358785,0.9367378,0.0014549991,0.0011477831,0.0015830601,0.00015632524,0.00019210989,0.0011880712],"genre_scores_gemma":[0.12174551,0.0006810467,0.87656486,0.00014015044,0.00013495672,0.0006301035,0.000055600332,0.000045884335,0.0000018929652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960026,0.0003385808,0.00090507977,0.0015916006,0.0003302108,0.0008319226],"domain_scores_gemma":[0.9958917,0.0011235044,0.00068472914,0.0017247655,0.00027595213,0.00029938557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047636038,0.0006806711,0.00120617,0.0009053516,0.00023973263,0.00017038379,0.002102038,0.0005729261,0.000030568186],"category_scores_gemma":[0.00013686149,0.0006137051,0.0007104753,0.0003387429,0.0014293384,0.00019824269,0.004149336,0.0010126795,0.000016031569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051238647,0.00013665702,0.0042025493,0.0005052136,0.00039707933,0.000015914815,0.0014869015,0.00015384969,0.00074005866,0.9764235,0.00049635925,0.015390668],"study_design_scores_gemma":[0.0008513189,0.00023224713,0.024657793,0.0002118277,0.00010632316,0.0000617231,0.000100583675,0.008196622,0.001307829,0.9619579,0.0016494306,0.00066641625],"about_ca_topic_score_codex":0.0001752902,"about_ca_topic_score_gemma":0.0000691733,"teacher_disagreement_score":0.06534154,"about_ca_system_score_codex":0.000018555309,"about_ca_system_score_gemma":0.00019150873,"threshold_uncertainty_score":0.9996314},"labels":[],"label_agreement":null},{"id":"W2949894824","doi":"","title":"On Cipher-Dependent Related-Key Attacks in the Ideal-Cipher Model.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cipher; Ideal (ethics); Key (lock); Computer science; Pseudorandom permutation; Theoretical computer science; Set (abstract data type); Exploit; Brute-force attack; Computer security; Block cipher; Cryptography; Encryption","score_opus":0.039522491679589586,"score_gpt":0.3044025286411247,"score_spread":0.2648800369615351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949894824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15355489,0.0001204572,0.8102442,0.0023516333,0.0009254328,0.0011168867,0.000050044673,0.00017572343,0.031460714],"genre_scores_gemma":[0.8233632,0.0002050991,0.17454547,0.0012388292,0.000055988516,0.0004854852,0.000061976796,0.000038278013,0.000005701715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995039,0.000980586,0.0010103179,0.0015192394,0.00057957834,0.0008712674],"domain_scores_gemma":[0.99607044,0.00065457326,0.0004725932,0.0025654172,0.000089205125,0.0001477675],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0013111971,0.00060516386,0.00065683376,0.0005689111,0.00027078015,0.00017926768,0.00359443,0.00045946252,0.00021478695],"category_scores_gemma":[0.00008907618,0.00048740258,0.0004120712,0.00034265182,0.000359252,0.00014128174,0.0031151762,0.0026824581,0.00022429864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003667741,0.00029072215,0.0014567,0.00002620151,0.00010019486,0.0001335841,0.024162028,0.0072014397,0.000022652715,0.9627134,0.0011470085,0.0027093776],"study_design_scores_gemma":[0.0006105935,0.000116928815,0.0068698404,0.00006378799,0.000028041602,0.000056706223,0.0002959731,0.041592963,0.00003193289,0.94948786,0.00036385457,0.0004815335],"about_ca_topic_score_codex":0.0005709435,"about_ca_topic_score_gemma":0.0018361992,"teacher_disagreement_score":0.66980827,"about_ca_system_score_codex":0.00010011652,"about_ca_system_score_gemma":0.00027743282,"threshold_uncertainty_score":0.99975777},"labels":[],"label_agreement":null},{"id":"W2949933527","doi":"","title":"Unified Point Addition Formulæ and Side-Channel Attacks.","year":2005,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Side channel attack; Computer science; Affine transformation; Elliptic curve; Point (geometry); Cryptography; Elliptic curve point multiplication; Elliptic curve cryptography; Channel (broadcasting); Tripling-oriented Doche–Icart–Kohel curve; Arithmetic; Key (lock); Algorithm; Mathematics; Computer security; Pure mathematics; Encryption; Public-key cryptography; Geometry; Telecommunications","score_opus":0.014385521650330664,"score_gpt":0.24689157852929033,"score_spread":0.23250605687895967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949933527","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02733872,0.00059823197,0.9559648,0.004896464,0.0009984436,0.0007246148,0.00009634046,0.000402694,0.008979666],"genre_scores_gemma":[0.36498907,0.0010669362,0.6322499,0.00082496315,0.000412377,0.00024021813,0.00016002888,0.000048649184,0.000007853722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963759,0.00035437325,0.0006689302,0.0015045059,0.00031981032,0.00077647314],"domain_scores_gemma":[0.9971137,0.000586737,0.00040686334,0.0014567565,0.00012035666,0.00031556055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042337892,0.0006074932,0.0007346542,0.0006864039,0.00030365816,0.00020497938,0.0014307594,0.0005258908,0.000049658604],"category_scores_gemma":[0.000108318076,0.0005847268,0.00036446247,0.00023505521,0.0005790364,0.0002675595,0.0043297415,0.0015153182,0.00012761784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048017304,0.00016076436,0.00023271768,0.000120829776,0.00021235942,0.00014099696,0.003433922,0.0010197136,0.00026706877,0.9584372,0.0010806731,0.034845706],"study_design_scores_gemma":[0.00063867547,0.00012375387,0.017352788,0.00015819202,0.00005322178,0.00025026093,0.00010103765,0.014924937,0.00067582703,0.9629782,0.0020662292,0.0006768904],"about_ca_topic_score_codex":0.000081048645,"about_ca_topic_score_gemma":0.00023544958,"teacher_disagreement_score":0.33765036,"about_ca_system_score_codex":0.000058279118,"about_ca_system_score_gemma":0.00018381009,"threshold_uncertainty_score":0.99966043},"labels":[],"label_agreement":null},{"id":"W2949962707","doi":"","title":"Preimage attacks on Reduced-round Stribog.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hash function; Computer science; GOST (hash function); Collision attack; Cryptographic hash function; Function (biology); Compression (physics); Collision resistance; SHA-2; Theoretical computer science; Algorithm; Perfect hash function; Double hashing; Computer security","score_opus":0.026824657496467428,"score_gpt":0.31276562901185756,"score_spread":0.2859409715153901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949962707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16951297,0.00004066083,0.81688887,0.0024184037,0.001755891,0.00076469517,0.00011775589,0.0003407714,0.008160005],"genre_scores_gemma":[0.57719696,0.00008733567,0.4209598,0.0008507052,0.0003424733,0.00028462708,0.00023234283,0.00004149921,0.00000422412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953557,0.0006814413,0.0008176059,0.0017745534,0.0004932019,0.0008774793],"domain_scores_gemma":[0.99565506,0.000737436,0.00053195306,0.0026477508,0.0001494181,0.0002784029],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006643213,0.00064714235,0.0007799642,0.0006385404,0.00035944892,0.00034811615,0.0027184316,0.00039175185,0.00016670648],"category_scores_gemma":[0.0001489251,0.00065151096,0.00046290117,0.0002660494,0.0004290891,0.00014828834,0.0040916135,0.00190708,0.00033987657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030878276,0.00020208555,0.0007621822,0.00006198389,0.00015221772,0.000049681927,0.002216792,0.0003519885,0.00026654743,0.9825203,0.004018528,0.009366823],"study_design_scores_gemma":[0.00063733343,0.00025972424,0.011877504,0.00009719522,0.000040577022,0.0000510419,0.00007310503,0.008707223,0.00068171875,0.9617508,0.015099983,0.00072380714],"about_ca_topic_score_codex":0.00012889465,"about_ca_topic_score_gemma":0.00015008805,"teacher_disagreement_score":0.407684,"about_ca_system_score_codex":0.00010274958,"about_ca_system_score_gemma":0.00031117158,"threshold_uncertainty_score":0.9995936},"labels":[],"label_agreement":null},{"id":"W2949970207","doi":"","title":"Some New Results on Binary Polynomial Multiplication.","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiplication (music); Finite field; Binary number; Mathematics; Multiplication algorithm; Polynomial; Logarithm; Field (mathematics); Binary operation; Arithmetic; Time complexity; Algorithm; Discrete mathematics; Combinatorics; Pure mathematics","score_opus":0.03608209612606198,"score_gpt":0.2823102171917265,"score_spread":0.24622812106566452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949970207","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03293107,0.00041563887,0.93296164,0.01575066,0.0043770196,0.0010070836,0.00019359587,0.0010704831,0.011292834],"genre_scores_gemma":[0.15366942,0.0002368204,0.83958244,0.0028027652,0.0029728778,0.0002784709,0.00030048814,0.00009440468,0.00006232487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956359,0.0006355676,0.0007449029,0.001892093,0.00039035323,0.0007011547],"domain_scores_gemma":[0.9948861,0.0008130796,0.0005382675,0.0031254762,0.00011813279,0.0005189189],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008382808,0.0006132526,0.00068429764,0.000712297,0.00021767076,0.00016991624,0.0035349042,0.00048851175,0.000014266069],"category_scores_gemma":[0.00038299634,0.0006133022,0.0004308988,0.00027261305,0.00048317687,0.00019814023,0.0050926544,0.0016847253,0.00079357746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058331474,0.0002033893,0.00010417473,0.000018963809,0.00012024629,0.000064237975,0.0024872948,0.002060907,0.00038826378,0.9329702,0.047590997,0.013408015],"study_design_scores_gemma":[0.0012443599,0.00032639125,0.0020725552,0.00008550969,0.000025270154,0.000030609233,0.000021888967,0.0037156336,0.0005055906,0.96590203,0.025445912,0.0006242235],"about_ca_topic_score_codex":0.0000713807,"about_ca_topic_score_gemma":0.000016702445,"teacher_disagreement_score":0.12073835,"about_ca_system_score_codex":0.000115635616,"about_ca_system_score_gemma":0.00074144115,"threshold_uncertainty_score":0.99998444},"labels":[],"label_agreement":null},{"id":"W2949982555","doi":"","title":"Anonymity in Shared Symmetric Key Primitives.","year":2009,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Anonymity; Computer science; Key (lock); Context (archaeology); Set (abstract data type); Scheme (mathematics); Symmetric-key algorithm; Computer security; Theoretical computer science; Public-key cryptography; Mathematics; Programming language; Encryption","score_opus":0.017725872563437186,"score_gpt":0.25889678365440627,"score_spread":0.24117091109096908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949982555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07448682,0.0003367178,0.9100031,0.0010646257,0.00067034696,0.0005082801,0.000020255096,0.0002559667,0.012653847],"genre_scores_gemma":[0.68319833,0.0000861302,0.3160574,0.00040225437,0.00012750518,0.00004851782,0.000055647306,0.000019279076,0.000004934411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99482465,0.000806781,0.0010539811,0.0019091171,0.00045071193,0.0009547795],"domain_scores_gemma":[0.9974526,0.0005759819,0.0005706065,0.0010381794,0.00015163752,0.00021099481],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0009463336,0.00064197846,0.0011990868,0.0014160796,0.0001134253,0.00025619424,0.0031682188,0.00053657836,0.00007952796],"category_scores_gemma":[0.0003979177,0.0006448643,0.00055893534,0.00072177354,0.0002161764,0.00019495336,0.0037653488,0.0024385734,0.00022483854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022850545,0.00023315179,0.0015235109,0.00004281498,0.00013104935,0.00037776044,0.0033002063,0.007246758,0.000021837162,0.97174495,0.00035365918,0.015001433],"study_design_scores_gemma":[0.0007613197,0.0001362961,0.07643401,0.00033736174,0.000057272526,0.00007532006,0.00009205483,0.6397933,0.00012441067,0.28035986,0.00075007847,0.0010787431],"about_ca_topic_score_codex":0.00008174965,"about_ca_topic_score_gemma":0.0004805359,"teacher_disagreement_score":0.6913851,"about_ca_system_score_codex":0.00022498604,"about_ca_system_score_gemma":0.0003393347,"threshold_uncertainty_score":0.99986285},"labels":[],"label_agreement":null},{"id":"W2949982754","doi":"","title":"Compact Accumulator using Lattices.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Accumulator (cryptography); Mathematical proof; Computer science; Chinese remainder theorem; Possession (linguistics); Integer (computer science); Set (abstract data type); Scheme (mathematics); Algorithm; Discrete mathematics; Mathematics; Theoretical computer science; Programming language; Mathematical analysis","score_opus":0.04581020450018873,"score_gpt":0.31717089790005487,"score_spread":0.2713606933998661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949982754","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11688646,0.0002574005,0.87724173,0.00057512795,0.0018492774,0.00046998536,0.00013786917,0.00042566494,0.002156494],"genre_scores_gemma":[0.22205853,0.000067448265,0.7768511,0.00052688277,0.0003286554,0.000018479182,0.00011359708,0.000035132693,1.6390779e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99558985,0.00067723874,0.00073410105,0.0016862258,0.00041647567,0.00089612725],"domain_scores_gemma":[0.9950877,0.0007146442,0.00062932144,0.0030636026,0.00012164836,0.00038308415],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006626676,0.00067925354,0.0010194196,0.00055170635,0.00029727753,0.00034759162,0.0037529622,0.0005274829,0.00008817449],"category_scores_gemma":[0.00011626297,0.00068639644,0.000549529,0.00027602533,0.0005228712,0.00029904908,0.0058950135,0.0018917307,0.00022555694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025931648,0.00013005144,0.00613466,0.00011889832,0.00018270648,0.00005978105,0.0011908861,0.0029969339,0.0003234657,0.9862693,0.000987905,0.001579475],"study_design_scores_gemma":[0.0004023728,0.000047025842,0.011311787,0.000121881676,0.000060349008,0.00008442115,0.000019482468,0.11016584,0.00032224588,0.86472213,0.012018046,0.00072439405],"about_ca_topic_score_codex":0.00024090224,"about_ca_topic_score_gemma":0.000087746695,"teacher_disagreement_score":0.121547155,"about_ca_system_score_codex":0.00007654996,"about_ca_system_score_gemma":0.00032271296,"threshold_uncertainty_score":0.99955875},"labels":[],"label_agreement":null},{"id":"W2949983631","doi":"","title":"A Security Enhancement and Proof for Authentication and Key Agreement (AKA).","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; AKA; Computer security; Key (lock); Protocol (science); Cryptography; Authentication (law); Cryptographic protocol; Key-agreement protocol; Computer network; Key distribution; Public-key cryptography; Encryption","score_opus":0.014882039135295398,"score_gpt":0.2973316631732003,"score_spread":0.2824496240379049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949983631","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038564984,0.00012278989,0.94568944,0.0030455515,0.00044337875,0.011675731,0.00005173107,0.00010410508,0.0003022948],"genre_scores_gemma":[0.28513795,0.00003970871,0.7013896,0.00017253599,0.00008024266,0.013100221,0.00005287364,0.000020586978,0.0000062976305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969254,0.00019379436,0.000618709,0.001504779,0.0002591443,0.00049816363],"domain_scores_gemma":[0.99731636,0.00035217244,0.00057320925,0.0013370746,0.0002024697,0.00021869336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006239088,0.00042671058,0.0005117713,0.00019605854,0.00023999356,0.00016191893,0.00096036406,0.00031733979,0.000025729889],"category_scores_gemma":[0.00023416865,0.00043505963,0.000106064974,0.00007168847,0.0005065071,0.00018232684,0.0037282943,0.0009085047,0.000017231083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000375138,0.00020166356,0.0003048763,0.00036565284,0.00006883308,0.000002367187,0.008171825,0.000008317037,0.002814538,0.9737118,0.000031910815,0.014280726],"study_design_scores_gemma":[0.0006291716,0.00013200872,0.0017182945,0.00008906419,0.00003647105,0.000018756831,0.000033936554,0.035965044,0.013181068,0.9453332,0.0024711047,0.00039189807],"about_ca_topic_score_codex":0.000010858075,"about_ca_topic_score_gemma":0.00006979561,"teacher_disagreement_score":0.24657296,"about_ca_system_score_codex":0.0000604195,"about_ca_system_score_gemma":0.00017326369,"threshold_uncertainty_score":0.9998101},"labels":[],"label_agreement":null},{"id":"W2949987681","doi":"","title":"Generalized mix functions and orthogonal equitable rectangles.","year":2007,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Generalization; Block cipher; Simple (philosophy); Mathematics; Computer science; Context (archaeology); Cryptography; Symmetric-key algorithm; Block (permutation group theory); Construct (python library); Discrete mathematics; Combinatorics; Encryption; Algorithm; Public-key cryptography","score_opus":0.0233944121876038,"score_gpt":0.2677684308100168,"score_spread":0.24437401862241298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949987681","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14542043,0.0009104319,0.8379332,0.0008092592,0.0017338918,0.0003731225,0.00004764609,0.00041981132,0.012352228],"genre_scores_gemma":[0.13395734,0.00040026382,0.86396945,0.0008153598,0.00044431677,0.00020622883,0.00010799842,0.00005444994,0.0000445934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962441,0.0005029853,0.0005763091,0.0014410507,0.000291678,0.0009439333],"domain_scores_gemma":[0.99717456,0.0006738218,0.00030613257,0.0014267417,0.00011479975,0.0003039494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011648785,0.00052489166,0.000668,0.00069582515,0.00044829023,0.00020212568,0.001415628,0.00043464673,0.00008376777],"category_scores_gemma":[0.000094896975,0.0005342039,0.00036563448,0.00035445625,0.00060751685,0.00015217689,0.0057638353,0.0014015685,0.00008413891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009347681,0.00009569169,0.003090729,0.00004861399,0.0001996771,0.00009394412,0.00091374514,0.00017614516,0.0006764529,0.9701011,0.0010827989,0.023427619],"study_design_scores_gemma":[0.00048592765,0.000105247585,0.0053968676,0.00007145016,0.00005841765,0.00019144903,0.000058089896,0.0021591536,0.0002443094,0.9826887,0.007965993,0.00057435007],"about_ca_topic_score_codex":0.00004124572,"about_ca_topic_score_gemma":0.00016043334,"teacher_disagreement_score":0.026036277,"about_ca_system_score_codex":0.0000569784,"about_ca_system_score_gemma":0.00024271436,"threshold_uncertainty_score":0.999711},"labels":[],"label_agreement":null},{"id":"W2950159141","doi":"","title":"On Continual Leakage of Discrete Log Representations.","year":2012,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Bounded function; Subspace topology; Discrete mathematics; Binary logarithm; Combinatorics; Mathematics; Element (criminal law); Representation (politics); Encryption; Affine transformation; Computer science; Pure mathematics","score_opus":0.02421039201129341,"score_gpt":0.31992005946404867,"score_spread":0.29570966745275523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950159141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1097192,0.00010016671,0.8796155,0.0012650425,0.0011276074,0.0006412998,0.00019996589,0.0001286748,0.007202537],"genre_scores_gemma":[0.6897318,0.00006431769,0.30953023,0.00023189238,0.000102131315,0.00014827588,0.00016773358,0.000020615526,0.0000029891435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967025,0.00052310794,0.00084315496,0.0009376457,0.00039528837,0.00059829233],"domain_scores_gemma":[0.9959757,0.0012139,0.00066505687,0.0018203668,0.00014453361,0.00018046006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053561066,0.00040084575,0.00067318423,0.00053327467,0.00016727654,0.000076768745,0.0015997896,0.00024136249,0.00019826142],"category_scores_gemma":[0.00023786684,0.00039153566,0.00040591243,0.0002488914,0.0005184418,0.00016558368,0.0029637988,0.0009951284,0.000081205355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003552476,0.00019051808,0.0061954902,0.000055183435,0.00015783722,0.000017325352,0.0057427166,0.00020376369,0.00028813718,0.9821997,0.001328163,0.0035856215],"study_design_scores_gemma":[0.0005763705,0.00010732629,0.04087253,0.000063759064,0.000049238875,0.00002361338,0.0002474605,0.0015065569,0.0011239918,0.95403445,0.0009925623,0.00040214535],"about_ca_topic_score_codex":0.00020839137,"about_ca_topic_score_gemma":0.00016787021,"teacher_disagreement_score":0.5800126,"about_ca_system_score_codex":0.000037614584,"about_ca_system_score_gemma":0.00015929183,"threshold_uncertainty_score":0.9998537},"labels":[],"label_agreement":null},{"id":"W2950233671","doi":"","title":"Weak Fields for ECC.","year":2003,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Elliptic curve cryptography; Discrete logarithm; Elliptic curve; Schoof's algorithm; Tripling-oriented Doche–Icart–Kohel curve; Hessian form of an elliptic curve; Logarithm; Elliptic curve point multiplication; Hyperelliptic curve cryptography; Finite field; Mathematics; Cryptography; Jacobian curve; Computer science; Supersingular elliptic curve; Discrete mathematics; Pure mathematics; Mathematical analysis; Algorithm; Public-key cryptography; Quarter period; Encryption; Computer security","score_opus":0.01859423242820427,"score_gpt":0.2680903661080963,"score_spread":0.249496133679892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950233671","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00481776,0.0004520406,0.97123426,0.0032518976,0.0028914502,0.0009934034,0.000045912217,0.0002657544,0.016047522],"genre_scores_gemma":[0.030358987,0.0002166374,0.9678015,0.0007829086,0.00021127908,0.00053169864,0.000041546686,0.000035598936,0.00001983117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967681,0.00031064136,0.0005558993,0.0013597906,0.00022717264,0.0007783571],"domain_scores_gemma":[0.9967968,0.00080822455,0.0003006393,0.001759146,0.00012295673,0.00021227254],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004228296,0.00049630937,0.00068758836,0.00042308564,0.00025090823,0.00015270199,0.0022240186,0.00060594577,0.000051559167],"category_scores_gemma":[0.00016837743,0.00047498877,0.0006691888,0.00019722931,0.00033871472,0.000087870205,0.0021963995,0.0012155774,0.00008570434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002280544,0.000115454895,0.0006817626,0.00012290024,0.00018093757,0.000028428454,0.00083632366,0.0005195128,0.000093800605,0.98465854,0.0046210885,0.008118454],"study_design_scores_gemma":[0.0004918438,0.00012382116,0.002512955,0.000065681976,0.00004470859,0.000066585344,0.000034398083,0.004180206,0.00063217664,0.9722584,0.019051908,0.00053734466],"about_ca_topic_score_codex":0.00003169828,"about_ca_topic_score_gemma":0.000091967675,"teacher_disagreement_score":0.025541227,"about_ca_system_score_codex":0.000033668748,"about_ca_system_score_gemma":0.00028639362,"threshold_uncertainty_score":0.99977016},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0259892599939159,"score_gpt":0.2749678279110856,"score_spread":0.24897856791716969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950244776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37689006,0.000085235566,0.620944,0.00015246894,0.00072750304,0.0004442586,0.000066842586,0.00008579315,0.0006038103],"genre_scores_gemma":[0.87691706,0.000053461637,0.122457005,0.0001555777,0.00014128888,0.00013444595,0.00011396053,0.000020274512,0.0000069321986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702185,0.0003261672,0.00058554934,0.001215569,0.00025601048,0.0005948315],"domain_scores_gemma":[0.99806243,0.00038741418,0.00040448635,0.00063220883,0.00030572785,0.00020774273],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001604544,0.00042479203,0.00073190423,0.00019943112,0.0001495887,0.00016713383,0.001425735,0.00029131197,0.000009773307],"category_scores_gemma":[0.0002144615,0.00040036422,0.00020821036,0.00008872701,0.00020398562,0.000133983,0.0036168264,0.0007812298,0.000025932266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001157056,0.00016006055,0.012253318,0.00028625393,0.0004986489,0.000014875474,0.009005672,0.0018150206,0.000028486922,0.9574812,0.0035333633,0.014807368],"study_design_scores_gemma":[0.00057603506,0.00020130885,0.007898784,0.00007104977,0.00004666226,0.000017830202,0.00005346906,0.9288743,0.000051464427,0.060552206,0.0011611613,0.0004957386],"about_ca_topic_score_codex":0.000091932976,"about_ca_topic_score_gemma":0.00061949925,"teacher_disagreement_score":0.9270593,"about_ca_system_score_codex":0.00008081644,"about_ca_system_score_gemma":0.00025282777,"threshold_uncertainty_score":0.99984485},"labels":[],"label_agreement":null},{"id":"W2950259505","doi":"","title":"Quantum One-Time Memories from Stateless Hardware","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Stateless protocol; Computer science; Oblivious transfer; Cryptography; Simple (philosophy); Quantum; Universal composability; Theoretical computer science; Composability; Programming language; Physics; Algorithm; Cryptographic protocol; Quantum mechanics; State (computer science)","score_opus":0.032199288086200144,"score_gpt":0.266768905432742,"score_spread":0.23456961734654186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950259505","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08823033,0.000661635,0.90015686,0.001427046,0.0023978609,0.0006289921,0.0028054125,0.00075054966,0.002941327],"genre_scores_gemma":[0.039842386,0.00032495402,0.9561011,0.0004296568,0.00058490137,0.00020914336,0.0024371077,0.00006896218,0.0000017587998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943732,0.0008224949,0.00087768456,0.0022584472,0.00068583,0.0009823274],"domain_scores_gemma":[0.9941754,0.00075327733,0.0005976987,0.0036022668,0.0003331295,0.0005382263],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006707918,0.0008174566,0.0013751659,0.00046476314,0.0002517933,0.0004346346,0.0047877626,0.00061801093,0.00024194478],"category_scores_gemma":[0.00025795773,0.00085520436,0.00046417557,0.00030200635,0.0007884577,0.00043592727,0.011525373,0.0021332717,0.0011290433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011575351,0.00027989107,0.0012071495,0.00007443704,0.00041769544,0.00022332637,0.007910566,0.00018561343,0.00031685413,0.97703665,0.007821454,0.004410575],"study_design_scores_gemma":[0.0005572041,0.00008967927,0.0037938852,0.00013584783,0.00006886178,0.000021973112,0.00015765248,0.008932947,0.0008545281,0.975093,0.009394907,0.000899488],"about_ca_topic_score_codex":0.00061988033,"about_ca_topic_score_gemma":0.00036065292,"teacher_disagreement_score":0.05594428,"about_ca_system_score_codex":0.00010278542,"about_ca_system_score_gemma":0.00074638275,"threshold_uncertainty_score":0.9996487},"labels":[],"label_agreement":null},{"id":"W2950338809","doi":"","title":"Unconditionally Secure Social Secret Sharing Scheme.","year":2009,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Privacy, Security, and Data Protection","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reputation; Scheme (mathematics); Computer security; Secret sharing; Computer science; Internet privacy; Cryptography; Mathematics; Law; Political science","score_opus":0.03578776201781827,"score_gpt":0.3330522904423484,"score_spread":0.29726452842453016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950338809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28538296,0.000628255,0.46472046,0.038128965,0.0051622028,0.0033599385,0.0017376905,0.0016220356,0.19925751],"genre_scores_gemma":[0.6763907,0.0012987953,0.30211133,0.0029762874,0.011285136,0.00076994626,0.0049437094,0.0001580716,0.00006604304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99572784,0.0007863095,0.0005985914,0.0013024176,0.00066592527,0.00091891066],"domain_scores_gemma":[0.99797124,0.00023174509,0.00050800934,0.000804078,0.00021032676,0.00027462526],"candidate_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012466703,0.00048605242,0.00067653874,0.00033705437,0.0015290051,0.00024662333,0.0021602684,0.0010565568,0.0009993871],"category_scores_gemma":[0.0009626628,0.0005738481,0.0003976044,0.00020694007,0.0010653699,0.00025154641,0.0037423999,0.0025407337,0.00035300534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077971876,0.00012384572,0.002103858,0.000070438866,0.00013924469,0.000049831946,0.017291943,0.000020720125,0.00016962616,0.9709632,0.0069731716,0.0020161972],"study_design_scores_gemma":[0.000366393,0.00003706004,0.011025861,0.0000799279,0.000050669158,0.0000099557965,0.0010993022,0.00014211998,0.000057816946,0.9510494,0.035526905,0.0005545857],"about_ca_topic_score_codex":0.0014415332,"about_ca_topic_score_gemma":0.0053607295,"teacher_disagreement_score":0.39100775,"about_ca_system_score_codex":0.0003609638,"about_ca_system_score_gemma":0.0009438785,"threshold_uncertainty_score":0.9999138},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017015297402117446,"score_gpt":0.2679101938523389,"score_spread":0.25089489645022145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950443886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048120026,0.00015754637,0.9368198,0.009114351,0.0011673159,0.0008378853,0.000029424105,0.00051252625,0.0032411425],"genre_scores_gemma":[0.6103112,0.000027438653,0.38847253,0.00036218303,0.0004638598,0.00024462162,0.000042356547,0.0000394641,0.00003637311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957111,0.00055638346,0.00082832976,0.0016328078,0.00049002556,0.0007813874],"domain_scores_gemma":[0.995991,0.00022436623,0.00069580553,0.002593202,0.00018585015,0.00030978982],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054678076,0.0005955825,0.0007921215,0.00038298522,0.00023260595,0.00034071686,0.0031308837,0.00038209496,0.000022451039],"category_scores_gemma":[0.00010576787,0.00052047806,0.0002633597,0.00023549938,0.0001926351,0.00019094307,0.0029833103,0.0013811424,0.0007005055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003103955,0.00033115468,0.004530656,0.00017939022,0.00035644986,0.00010614207,0.10095779,0.0001274622,0.00022637029,0.882062,0.0012598325,0.009831681],"study_design_scores_gemma":[0.0012883459,0.00016974898,0.013664581,0.00057900825,0.00014369685,0.00046283772,0.0013077367,0.16267191,0.0011714968,0.79946584,0.017321838,0.0017529606],"about_ca_topic_score_codex":0.000037983496,"about_ca_topic_score_gemma":0.00017765076,"teacher_disagreement_score":0.5621912,"about_ca_system_score_codex":0.00010496939,"about_ca_system_score_gemma":0.0003790161,"threshold_uncertainty_score":0.9997247},"labels":[],"label_agreement":null},{"id":"W2950457841","doi":"","title":"Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS.","year":2007,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Protocol (science); Computer science; Simple (philosophy); Key (lock); Computer security; Theoretical computer science","score_opus":0.01809040060129538,"score_gpt":0.31242804238016564,"score_spread":0.29433764177887023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950457841","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015952827,0.000056166617,0.868243,0.0006828051,0.00021168492,0.1133625,0.000045750166,0.000216101,0.0012291993],"genre_scores_gemma":[0.042490754,0.000009476019,0.7613776,0.0003213256,0.00010855606,0.1956327,0.000026097236,0.000031365915,0.0000021403423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99562126,0.00040708712,0.0008197712,0.001977771,0.00045627545,0.0007178577],"domain_scores_gemma":[0.9967078,0.00061313395,0.000683262,0.0014995793,0.00014926775,0.0003469736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007222867,0.0006104602,0.0007045553,0.00032527072,0.00026799343,0.00021965985,0.0012917892,0.00038378275,0.000048966678],"category_scores_gemma":[0.00019798534,0.00060433726,0.000120284196,0.00015508912,0.0006301213,0.00011886604,0.0078081726,0.0014631052,0.000053311676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009702628,0.00021016882,0.0032166727,0.0002331749,0.000112623886,0.00008853265,0.015602227,0.00060579815,0.0003520349,0.9573283,0.000022469152,0.022130964],"study_design_scores_gemma":[0.0011749603,0.00011427951,0.012373353,0.00028980276,0.000022727309,0.000042584343,0.00014203013,0.047962513,0.0010009006,0.9333336,0.002948076,0.0005952182],"about_ca_topic_score_codex":0.000057588994,"about_ca_topic_score_gemma":0.000056906585,"teacher_disagreement_score":0.106865376,"about_ca_system_score_codex":0.00011044986,"about_ca_system_score_gemma":0.00022134723,"threshold_uncertainty_score":0.9996408},"labels":[],"label_agreement":null},{"id":"W2950511820","doi":"","title":"Single Layer Optical-scan Voting with Fully Distributed Trust.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Secrecy; Computer science; Verifiable secret sharing; Ballot; Computer security; Voting; Electronic voting; Cryptography; Audit; Programming language; Political science; Accounting; Business; Law","score_opus":0.025651813408602744,"score_gpt":0.24919250908715293,"score_spread":0.22354069567855017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950511820","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029700872,0.000059963997,0.95578206,0.0005069845,0.00043081265,0.0005817611,0.000057096484,0.0012370014,0.011643426],"genre_scores_gemma":[0.40009537,0.000013181593,0.5994947,0.00010520916,0.000068542955,0.00012552374,0.00006442652,0.000031154632,0.0000018536628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99630255,0.00028331502,0.00061381795,0.0015392542,0.0003057983,0.000955266],"domain_scores_gemma":[0.99708396,0.00026758376,0.0005065336,0.0017144736,0.0001657162,0.0002617398],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032146022,0.0006769239,0.00080744247,0.00037559762,0.00025694226,0.00016878886,0.0025776608,0.00042805157,0.000019761892],"category_scores_gemma":[0.00007701895,0.0005791562,0.00030890742,0.00027710845,0.0006995303,0.00022782589,0.004176487,0.0016541561,0.000028329801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001139981,0.00021362634,0.005107315,0.00007380382,0.00018764647,0.0002872062,0.0012885984,0.00022388644,0.0011080218,0.9759434,0.00013832576,0.0153142],"study_design_scores_gemma":[0.0003668802,0.00036704482,0.008128926,0.00029780922,0.000058428737,0.00020879989,0.000031211024,0.0020828731,0.023443935,0.9623292,0.001766398,0.00091847236],"about_ca_topic_score_codex":0.000038266393,"about_ca_topic_score_gemma":0.000066625566,"teacher_disagreement_score":0.37039453,"about_ca_system_score_codex":0.000086743086,"about_ca_system_score_gemma":0.00016342595,"threshold_uncertainty_score":0.999666},"labels":[],"label_agreement":null},{"id":"W2950512683","doi":"","title":"Common Randomness and Secret Key Capacities of Two-way Channels.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Randomness; Upper and lower bounds; Channel (broadcasting); Computer science; Channel capacity; Coding (social sciences); Binary number; Key (lock); Theoretical computer science; Cryptography; Channel code; Binary erasure channel; Key generation; Information theory; Binary symmetric channel; Information-theoretic security; Discrete mathematics; Algorithm; Mathematics; Computer network; Decoding methods; Computer security; Arithmetic; Statistics","score_opus":0.023761823754686454,"score_gpt":0.2554894605825143,"score_spread":0.23172763682782788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950512683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6870448,0.0016112896,0.28760216,0.00010089401,0.0005560424,0.00076077116,0.00016984981,0.0008043058,0.02134988],"genre_scores_gemma":[0.9008906,0.0022853508,0.09622746,0.000027576249,0.00006002021,0.0003111946,0.00011920935,0.000077361336,0.0000012227235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979787,0.0003855025,0.0006996678,0.00041448505,0.00015231987,0.00036932938],"domain_scores_gemma":[0.9976764,0.00047019552,0.00026259324,0.0013798199,0.00009454535,0.00011647769],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037583205,0.00047411257,0.0011351274,0.00038386518,0.00007005644,0.00002648748,0.0009370983,0.00041632185,0.00008580088],"category_scores_gemma":[0.000049766095,0.0005203759,0.00017986613,0.000067803674,0.0011892008,0.0000687738,0.00173771,0.0014725411,0.00001357246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012288638,0.000068371584,0.001810671,0.0009694133,0.00041966818,0.000015749827,0.032489423,0.0017734607,0.0028157972,0.9564265,0.00035051937,0.0027375605],"study_design_scores_gemma":[0.00094164466,0.000040938798,0.0010773707,0.00039528546,0.000072288334,0.0000485224,0.00040068143,0.0057988786,0.034926027,0.9550754,0.0006433264,0.0005796672],"about_ca_topic_score_codex":0.0003725075,"about_ca_topic_score_gemma":0.0003284915,"teacher_disagreement_score":0.21384579,"about_ca_system_score_codex":0.000043364427,"about_ca_system_score_gemma":0.000036674282,"threshold_uncertainty_score":0.9997248},"labels":[],"label_agreement":null},{"id":"W2950520523","doi":"","title":"Analyzing the Galbraith-Lin-Scott Point Multiplication Method for Elliptic Curves over Binary Fields.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Elliptic curve; Edwards curve; Schoof's algorithm; Elliptic curve point multiplication; Mathematics; Supersingular elliptic curve; Prime (order theory); Binary number; Endomorphism; Multiplication (music); Complex multiplication; Point (geometry); Counting points on elliptic curves; Pure mathematics; Arithmetic; Discrete mathematics; Combinatorics; Geometry; Quarter period","score_opus":0.021403926248101324,"score_gpt":0.30008111093833556,"score_spread":0.2786771846902342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950520523","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008672649,0.002890171,0.9739951,0.010775861,0.0009814337,0.0018166109,0.000036603782,0.0002496686,0.0005818845],"genre_scores_gemma":[0.027888771,0.0052893492,0.9641699,0.0014029603,0.00027238583,0.00084563775,0.00008156993,0.000043751217,0.0000056361832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99585843,0.00079813827,0.00080207473,0.0015253009,0.00029033932,0.0007257099],"domain_scores_gemma":[0.99363476,0.0031052674,0.00060534134,0.0023076644,0.00017933639,0.00016760215],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096363714,0.0005696008,0.0007717808,0.00047135114,0.0005355088,0.00011951747,0.0027194666,0.00043194692,0.000023706947],"category_scores_gemma":[0.00032482305,0.00043537348,0.0008574629,0.0003927631,0.00047889454,0.00015584011,0.002782949,0.0015200996,0.000035404748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013439542,0.0004466008,0.003833326,0.0008974768,0.00092171994,0.000078758705,0.00767885,0.012472198,0.0016942744,0.9248829,0.009268431,0.037691087],"study_design_scores_gemma":[0.00065262755,0.00015618392,0.026908377,0.0004359485,0.00016206087,0.00014530883,0.000060524544,0.19848038,0.0014245367,0.7677601,0.003051628,0.0007623223],"about_ca_topic_score_codex":0.00015334478,"about_ca_topic_score_gemma":0.000083092185,"teacher_disagreement_score":0.18600819,"about_ca_system_score_codex":0.000049200247,"about_ca_system_score_gemma":0.00024739138,"threshold_uncertainty_score":0.9998098},"labels":[],"label_agreement":null},{"id":"W2950525928","doi":"","title":"Information-Theoretically Secure Voting Without an Honest Majority","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Correctness; Computer science; Computer security; Protocol (science); Voting; Ballot; Cryptography; Internet privacy; Law; Algorithm; Political science","score_opus":0.011234327692040542,"score_gpt":0.2525672033103528,"score_spread":0.24133287561831226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950525928","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084910296,0.000051149735,0.9059654,0.0008634954,0.0012641795,0.0006589238,0.00028553396,0.0006565085,0.005344524],"genre_scores_gemma":[0.29396543,0.0001553662,0.70434356,0.0006052659,0.00023271226,0.00010483101,0.00057031424,0.000022419674,1.228944e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958077,0.0006599691,0.0009810019,0.0010917601,0.00056121923,0.0008983476],"domain_scores_gemma":[0.9957332,0.00039952848,0.0006257808,0.0024679916,0.00028834163,0.00048515378],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0006821282,0.0007023413,0.0008568278,0.0005601454,0.00048470823,0.00039758653,0.0037012496,0.0006661432,0.00005557399],"category_scores_gemma":[0.0003119293,0.0007105675,0.0003878605,0.00033961574,0.0010653452,0.0012757159,0.0058242264,0.0025684906,0.00029855428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052163177,0.00017349768,0.009822451,0.0001045463,0.000092641865,0.00006094224,0.010740073,0.00026915292,0.00002362425,0.9735948,0.0004118252,0.004654299],"study_design_scores_gemma":[0.000495314,0.00012014951,0.015769247,0.00008779899,0.000032134772,0.00033208466,0.00014867082,0.025329689,0.00011509231,0.9528927,0.0038412332,0.0008358856],"about_ca_topic_score_codex":0.00012984025,"about_ca_topic_score_gemma":0.00016122258,"teacher_disagreement_score":0.20905513,"about_ca_system_score_codex":0.000058079146,"about_ca_system_score_gemma":0.00048133064,"threshold_uncertainty_score":0.9997326},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017089669886696076,"score_gpt":0.2629797871105366,"score_spread":0.24589011722384052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950596278","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101995304,0.00011954907,0.8922824,0.0022659372,0.00060813787,0.0011481156,0.00035331625,0.0007232676,0.0005039267],"genre_scores_gemma":[0.25425065,0.000069623,0.743514,0.0009151692,0.00018603964,0.00023795184,0.0007889505,0.00003735259,2.5216013e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99417114,0.0007220377,0.0008297501,0.0024897046,0.00071290106,0.0010744797],"domain_scores_gemma":[0.9937452,0.0006153101,0.0006327816,0.004305545,0.00033013077,0.00037102736],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0007797859,0.0009277575,0.0010620654,0.0006385276,0.0003379454,0.00040055646,0.004166444,0.00069100776,0.000107063235],"category_scores_gemma":[0.000120700584,0.0008392014,0.0004933944,0.000562963,0.0006684114,0.0005026244,0.0036900858,0.0023339586,0.00015335882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002645657,0.0006626093,0.034600828,0.00020912579,0.00017011227,0.00015354746,0.0016024105,0.0012533031,0.00014401978,0.95375574,0.0011765944,0.006007131],"study_design_scores_gemma":[0.0012383499,0.00038977983,0.102003776,0.0002732549,0.00008732132,0.000074613046,0.000058216912,0.007439231,0.000863796,0.8788161,0.007528916,0.001226592],"about_ca_topic_score_codex":0.00016353985,"about_ca_topic_score_gemma":0.0003921035,"teacher_disagreement_score":0.15225536,"about_ca_system_score_codex":0.00017111601,"about_ca_system_score_gemma":0.00082130515,"threshold_uncertainty_score":0.9999677},"labels":[],"label_agreement":null},{"id":"W2950604697","doi":"","title":"Secure Key Exchange and Sessions Without Credentials.","year":2013,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Bell (Canada)","funders":"","keywords":"Credential; Computer science; Computer security; Session (web analytics); Adversary; Key exchange; Authenticated Key Exchange; Session key; Key (lock); Cryptography; Password; Public key infrastructure; Computer network; Public-key cryptography; Encryption; World Wide Web","score_opus":0.019674946090443814,"score_gpt":0.2992968283228972,"score_spread":0.27962188223245343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950604697","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01653417,0.00025884982,0.9713073,0.0023242175,0.0007918248,0.0059396853,0.00004993913,0.00042334027,0.0023707205],"genre_scores_gemma":[0.13051826,0.00018996364,0.8609502,0.0004202787,0.00017528352,0.0076251943,0.000048023318,0.00004719125,0.000025645975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962455,0.0005537803,0.00061029306,0.0015988485,0.0003433067,0.000648269],"domain_scores_gemma":[0.9966147,0.00030763957,0.00059074134,0.0019526606,0.00018636124,0.00034793167],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00031805912,0.00054917054,0.0007148655,0.0003054734,0.0002861121,0.0002717079,0.0020104083,0.00043587165,0.00026891226],"category_scores_gemma":[0.00019647527,0.00052778464,0.00016921294,0.00014103627,0.0005705869,0.00034178921,0.009502326,0.001451829,0.00037021836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009925631,0.00010598566,0.0017514025,0.0001860968,0.000072762254,0.00002232853,0.007104178,0.000051047286,0.00046885735,0.9827724,0.00035913478,0.0070958924],"study_design_scores_gemma":[0.0004249762,0.000042625303,0.0068033016,0.00017812109,0.000026309051,0.00007353784,0.000055704335,0.01249203,0.0005959363,0.97490805,0.0038838664,0.0005155504],"about_ca_topic_score_codex":0.000048475384,"about_ca_topic_score_gemma":0.000056421242,"teacher_disagreement_score":0.113984086,"about_ca_system_score_codex":0.000060549908,"about_ca_system_score_gemma":0.00021368898,"threshold_uncertainty_score":0.99971735},"labels":[],"label_agreement":null},{"id":"W2950629364","doi":"","title":"SpecTre: A Tiny Side-Channel Resistant Speck Core for FPGAs.","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Side channel attack; Computer science; Field-programmable gate array; Cryptography; Block cipher; Embedded system; Core (optical fiber); Cipher; Computer security; Encryption; Telecommunications","score_opus":0.0747030586666773,"score_gpt":0.334163614491068,"score_spread":0.2594605558243907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950629364","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0337389,0.00026399145,0.9528505,0.0034494854,0.001840034,0.0018205266,0.00053598883,0.00034883284,0.0051516937],"genre_scores_gemma":[0.12635426,0.0001390404,0.8710757,0.0005342834,0.00052793167,0.0008130757,0.0004756789,0.00006774418,0.000012284647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99557334,0.00025582025,0.0009650335,0.0017240065,0.0004576032,0.0010242212],"domain_scores_gemma":[0.9958769,0.0006722743,0.0006273275,0.002031023,0.00041281673,0.00037965042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009965474,0.0006526142,0.0009271485,0.0006016405,0.00032772406,0.00023540264,0.0023422837,0.00035805808,0.000061627354],"category_scores_gemma":[0.00030545235,0.0006613346,0.00056487916,0.00032091912,0.0004041109,0.00013670346,0.0038121853,0.0010802672,0.000084819025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013775648,0.00017814629,0.00025724995,0.00013145531,0.00020280931,0.00009030258,0.0057311244,0.0002401015,0.00026464064,0.97924984,0.011393064,0.0021234963],"study_design_scores_gemma":[0.0010522475,0.00023805539,0.0022554188,0.00008150341,0.000062624546,0.000061513885,0.00036145977,0.015259045,0.00024653514,0.9695822,0.010129084,0.0006702881],"about_ca_topic_score_codex":0.00022734373,"about_ca_topic_score_gemma":0.001371465,"teacher_disagreement_score":0.09261536,"about_ca_system_score_codex":0.00017068053,"about_ca_system_score_gemma":0.0007058902,"threshold_uncertainty_score":0.9995838},"labels":[],"label_agreement":null},{"id":"W2950683093","doi":"","title":"On the Complexity of the Herding Attack and Some Related Attacks on Hash Functions.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hash function; Herding; Computer science; Theoretical computer science; Computational complexity theory; Iterated function; Mathematics; Algorithm; Computer security","score_opus":0.04691549099858613,"score_gpt":0.26865511557032656,"score_spread":0.22173962457174043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950683093","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8027415,0.000058560327,0.17148872,0.013486257,0.0026784732,0.0007563263,0.000045637902,0.00017873135,0.00856574],"genre_scores_gemma":[0.98511285,0.000028016817,0.013766042,0.0008963028,0.000083223174,0.00007286981,0.000007579516,0.00002325714,0.000009867856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681133,0.0010183568,0.0005001861,0.0009474954,0.00030991557,0.0004127193],"domain_scores_gemma":[0.99502784,0.001913656,0.0005126518,0.0023757815,0.000072145536,0.000097914046],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00092477474,0.0004179702,0.00051310495,0.00023414598,0.0006341224,0.00010395847,0.0023390462,0.00037066612,0.00007993894],"category_scores_gemma":[0.00029051324,0.00026366214,0.0004161028,0.00025075205,0.0027488125,0.0000725721,0.0041018636,0.0031693191,0.000068572066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006542916,0.000109184235,0.0010448437,0.000029227767,0.0001502967,0.0000049961395,0.0014164964,0.00054117676,0.0004753144,0.9932536,0.00065935816,0.002250109],"study_design_scores_gemma":[0.00025701209,0.00012309659,0.023336107,0.0001824316,0.000033744556,0.000029424551,0.00005133828,0.0036575284,0.0006318799,0.9707304,0.0007056626,0.00026133753],"about_ca_topic_score_codex":0.000017939601,"about_ca_topic_score_gemma":0.000045283155,"teacher_disagreement_score":0.18237129,"about_ca_system_score_codex":0.000027333848,"about_ca_system_score_gemma":0.000102062666,"threshold_uncertainty_score":0.9999816},"labels":[],"label_agreement":null},{"id":"W2950716479","doi":"","title":"Deniable Authentication on the Internet.","year":2007,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Random oracle; Computer science; Computer security; Authentication (law); Extension (predicate logic); Oracle; Construct (python library); Key (lock); The Internet; Key exchange; Computer network; Public-key cryptography; World Wide Web; Encryption","score_opus":0.031941347478616634,"score_gpt":0.30528815438329315,"score_spread":0.2733468069046765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950716479","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007535175,0.00002996984,0.97312737,0.005467061,0.0008575541,0.0047490792,0.000010587974,0.00033871934,0.00788449],"genre_scores_gemma":[0.40662,0.000016503143,0.5871651,0.0015663384,0.00015549544,0.004359445,0.000031359898,0.000040948737,0.0000448353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966233,0.00048269605,0.00063878164,0.0012274247,0.00043447933,0.000593326],"domain_scores_gemma":[0.99519485,0.0011774,0.00058066664,0.0027399303,0.00016345346,0.00014367752],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00094954856,0.00042611032,0.000393712,0.00028615023,0.00018492037,0.00018170389,0.0037867995,0.0002958867,0.00015573238],"category_scores_gemma":[0.00045272635,0.0003335646,0.00022324458,0.00021068526,0.00046321566,0.000126811,0.004360121,0.0017282079,0.0013887326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002464469,0.00014178087,0.00027055774,0.000031053478,0.000058192494,0.000013648268,0.0032099583,0.00020922253,0.00022397918,0.9908486,0.00031666097,0.00465172],"study_design_scores_gemma":[0.00016421327,0.000052726573,0.0026187885,0.00010700119,0.000013724758,0.000019579742,0.00003281315,0.025358474,0.005407414,0.96207494,0.0038399154,0.0003103978],"about_ca_topic_score_codex":0.000018853825,"about_ca_topic_score_gemma":0.000024662255,"teacher_disagreement_score":0.3990848,"about_ca_system_score_codex":0.0001532792,"about_ca_system_score_gemma":0.00018578784,"threshold_uncertainty_score":0.99991167},"labels":[],"label_agreement":null},{"id":"W2950758769","doi":"","title":"Resilience to Distinguishing Attacks on WG-7 Cipher and Their Generalizations.","year":2012,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stream cipher; Stream cipher attack; Computer science; Cipher; Correlation attack; Transposition cipher; Resilience (materials science); Cryptography; Computer security; Block cipher mode of operation; Arithmetic; Theoretical computer science; Running key cipher; Mathematics; Encryption","score_opus":0.022609844201641523,"score_gpt":0.2711592093576486,"score_spread":0.24854936515600706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950758769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1467275,0.0001830636,0.8421589,0.0015306385,0.0011606385,0.0004126635,0.00002811178,0.00027218502,0.0075262995],"genre_scores_gemma":[0.6820853,0.000049734004,0.3159302,0.001381891,0.00034295718,0.00015039193,0.000019810332,0.000033321,0.0000064449946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99682856,0.0005672383,0.00042857803,0.0012772958,0.00020484113,0.0006934906],"domain_scores_gemma":[0.9969614,0.0007611294,0.00024164128,0.0015905981,0.000090224785,0.00035497342],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068551826,0.000503304,0.0005171011,0.0003881532,0.00038383316,0.00024926863,0.0018713542,0.00024493563,0.000035957186],"category_scores_gemma":[0.00038163498,0.0004487255,0.00018651628,0.00029673253,0.00033237177,0.00013005534,0.0048812903,0.0009355928,0.000075696546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031704632,0.00007611016,0.0064675948,0.000036428897,0.00005692978,0.000012416132,0.0074563725,0.001651618,0.00040020762,0.96468204,0.0005551194,0.018573444],"study_design_scores_gemma":[0.00016594821,0.00009566424,0.01988716,0.00020018437,0.000018096653,0.000036843834,0.00009222909,0.0035606655,0.0007525027,0.9684643,0.0060806354,0.0006457697],"about_ca_topic_score_codex":0.00002891307,"about_ca_topic_score_gemma":0.000049589868,"teacher_disagreement_score":0.5353578,"about_ca_system_score_codex":0.000042994143,"about_ca_system_score_gemma":0.000083347026,"threshold_uncertainty_score":0.99979645},"labels":[],"label_agreement":null},{"id":"W2950769433","doi":"","title":"On the Arithmetic Complexity of Strassen-Like Matrix Multiplications.","year":2013,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Strassen algorithm; Matrix multiplication; Mathematics; Arithmetic; Dimension (graph theory); Multiplication (music); Matrix (chemical analysis); Multiplication algorithm; Discrete mathematics; Combinatorics; Binary number","score_opus":0.02792268647726698,"score_gpt":0.2523565732619038,"score_spread":0.22443388678463683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950769433","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7379699,0.00023117788,0.24808519,0.000496225,0.0012270143,0.0014600566,0.00025263292,0.00032466082,0.009953175],"genre_scores_gemma":[0.976649,0.00005982466,0.02256368,0.000044566776,0.00006870483,0.00048793852,0.00006941169,0.00005174294,0.000005129384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979345,0.00041559344,0.000630684,0.0004535502,0.00018810546,0.0003775597],"domain_scores_gemma":[0.99715185,0.001089958,0.0002297318,0.0013595194,0.000073455005,0.00009550158],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034212339,0.00041097903,0.0006282057,0.00021443369,0.00010700057,0.00003127372,0.0008844029,0.0003045614,0.00029031961],"category_scores_gemma":[0.000087709755,0.0003249654,0.00029369898,0.000105503495,0.0008429346,0.000024211062,0.00043549773,0.0012813761,0.00044175924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016755472,0.00007159733,0.000356102,0.00024450244,0.00028061596,0.000003406497,0.00077630545,0.016829427,0.0025694657,0.9775234,0.0010038149,0.00032464127],"study_design_scores_gemma":[0.00018283901,0.000029966137,0.008837933,0.00014727739,0.000046006488,0.000017299497,0.00018499205,0.020592937,0.0014089468,0.967865,0.0003912783,0.00029550624],"about_ca_topic_score_codex":0.000077896344,"about_ca_topic_score_gemma":0.000046413097,"teacher_disagreement_score":0.23867914,"about_ca_system_score_codex":0.000040683684,"about_ca_system_score_gemma":0.000037183265,"threshold_uncertainty_score":0.99992025},"labels":[],"label_agreement":null},{"id":"W2950778505","doi":"","title":"Another Look at Tightness.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mathematical proof; Encryption; Computer security; Scheme (mathematics); Authentication (law); Authenticated encryption; Reduction (mathematics); Theoretical computer science; Computer network; Mathematics","score_opus":0.03257999446250517,"score_gpt":0.2821622425962087,"score_spread":0.24958224813370353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950778505","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026531285,0.00009044851,0.96755975,0.00083202944,0.0009166594,0.0042459513,0.000027061404,0.0005282273,0.023146769],"genre_scores_gemma":[0.045067746,0.000038859318,0.9483638,0.00075639616,0.00014829847,0.0054335375,0.00003957814,0.000067529974,0.00008426914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962121,0.00042833344,0.00064887595,0.001707443,0.00031291728,0.00069028995],"domain_scores_gemma":[0.99579626,0.00024987475,0.00063570973,0.0029934507,0.00013753596,0.00018715729],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000300672,0.00055212394,0.00066255545,0.00026750725,0.00020282078,0.00007389708,0.0033882984,0.0004187255,0.0006511964],"category_scores_gemma":[0.0000979478,0.0005435605,0.0002881947,0.0001344238,0.00061891234,0.00018799363,0.0105793215,0.0011379386,0.002448167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003089506,0.0001504354,0.0014684009,0.00007546199,0.00007937768,0.000052620922,0.0038940792,0.000078818695,0.0005470796,0.98965156,0.0003243541,0.0036469244],"study_design_scores_gemma":[0.0003420857,0.000042803927,0.0036112526,0.00006914961,0.000016769573,0.00005505225,0.000008493932,0.00221189,0.007536693,0.97872984,0.00683063,0.0005453202],"about_ca_topic_score_codex":0.000022722454,"about_ca_topic_score_gemma":0.00006220602,"teacher_disagreement_score":0.04241462,"about_ca_system_score_codex":0.00016707086,"about_ca_system_score_gemma":0.0002510305,"threshold_uncertainty_score":0.9997016},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030766293920487034,"score_gpt":0.31291297391341777,"score_spread":0.28214667999293075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950781338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2839125,0.00009110342,0.70969254,0.0015448121,0.001607036,0.00094078504,0.00038571295,0.00008751262,0.0017379929],"genre_scores_gemma":[0.6297858,0.00004109256,0.36922416,0.00031936273,0.00013250853,0.00034837288,0.00011664873,0.000028874483,0.0000031980896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635464,0.0006761485,0.0009372385,0.00089151337,0.00057711056,0.00056334335],"domain_scores_gemma":[0.9964784,0.00028884353,0.00065762637,0.0019598308,0.00043602634,0.00017928942],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073446153,0.00041981795,0.00061748235,0.00022609346,0.00033354355,0.00011288821,0.002299412,0.00019366402,0.00024629245],"category_scores_gemma":[0.0001063429,0.00032875894,0.00050392863,0.00045027913,0.000456415,0.00005314636,0.005092849,0.0008270518,0.000057269288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023713996,0.00021320714,0.018395977,0.000074204996,0.00023572354,0.000008894469,0.008440681,0.0058496934,0.00021352712,0.95891255,0.0063956166,0.0012362102],"study_design_scores_gemma":[0.002181998,0.00004969183,0.019350294,0.000078429766,0.0001334773,0.000067132525,0.00064805377,0.029875824,0.001127155,0.9399492,0.0059117908,0.00062693463],"about_ca_topic_score_codex":0.00030972745,"about_ca_topic_score_gemma":0.000449916,"teacher_disagreement_score":0.3458733,"about_ca_system_score_codex":0.00009417231,"about_ca_system_score_gemma":0.00076605764,"threshold_uncertainty_score":0.99991643},"labels":[],"label_agreement":null},{"id":"W2950802487","doi":"","title":"Efficient Techniques for High-Speed Elliptic Curve Cryptography.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Speedup; Elliptic curve point multiplication; Curve25519; Scalar multiplication; Elliptic Curve Digital Signature Algorithm; Computer science; Hyperelliptic curve cryptography; Elliptic curve cryptography; Elliptic curve; Tripling-oriented Doche–Icart–Kohel curve; Parallel computing; Jacobian matrix and determinant; x86; Hessian form of an elliptic curve; Cryptography; Arithmetic; Algorithm; Mathematics; Public-key cryptography; Applied mathematics; Encryption; Software; Programming language; Mathematical analysis; Operating system","score_opus":0.011869446846587419,"score_gpt":0.2587890616558372,"score_spread":0.2469196148092498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950802487","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073322825,0.00036457946,0.9160516,0.0019202641,0.0032132335,0.0025667169,0.00014872414,0.0011094061,0.0013026453],"genre_scores_gemma":[0.15116237,0.00013294382,0.84711516,0.00029409217,0.00042135824,0.000705023,0.000091916685,0.000075619595,0.0000015139324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942104,0.0004334589,0.0010769016,0.0023917614,0.00053347676,0.001353971],"domain_scores_gemma":[0.9941399,0.0013138149,0.0007432008,0.0030239366,0.00038070278,0.0003984621],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0009711057,0.0010080712,0.0012713813,0.0014897557,0.00049288827,0.0003268743,0.0040475274,0.0011816174,0.000046718793],"category_scores_gemma":[0.00022894812,0.0009451796,0.0011607376,0.00058508595,0.0011767615,0.00007697586,0.004162165,0.0029685036,0.000083300954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070657814,0.00041058756,0.00064223015,0.00021923863,0.00028860618,0.00005150296,0.0010599103,0.0011311269,0.004758717,0.97878295,0.00044941859,0.012135055],"study_design_scores_gemma":[0.00062410365,0.0002649713,0.004866981,0.00017138601,0.000117996155,0.000070642214,0.000031078966,0.021793105,0.012041467,0.95619625,0.0027161178,0.0011058833],"about_ca_topic_score_codex":0.00011978594,"about_ca_topic_score_gemma":0.00010166577,"teacher_disagreement_score":0.077839546,"about_ca_system_score_codex":0.000055449043,"about_ca_system_score_gemma":0.0003608029,"threshold_uncertainty_score":0.9993317},"labels":[],"label_agreement":null},{"id":"W2950808142","doi":"","title":"A General Construction for 1-round δ-RMT and (0, δ)-SMT.","year":2012,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Communication source; Message authentication code; Reliability (semiconductor); Disjoint sets; Node (physics); Computer network; Transmission (telecommunications); Adversary; Theoretical computer science; Authentication (law); Protocol (science); Relation (database); Power (physics); Cryptography; Algorithm; Computer security; Mathematics; Discrete mathematics; Telecommunications","score_opus":0.021138895533528768,"score_gpt":0.2656808496929594,"score_spread":0.24454195415943064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950808142","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14848354,0.0004108026,0.8459316,0.00070127274,0.0020924571,0.000616474,0.000044846118,0.00023219547,0.0014868028],"genre_scores_gemma":[0.08378498,0.00013152529,0.91500056,0.00024935053,0.0004573171,0.0003113157,0.000036410904,0.000025642641,0.000002918467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974665,0.00031511183,0.0004138509,0.0010165087,0.00014761463,0.0006404376],"domain_scores_gemma":[0.99785113,0.0005513126,0.00030516298,0.0009807695,0.000088413304,0.00022322198],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056022994,0.0004196301,0.0005504385,0.00033732172,0.0002855961,0.00017161616,0.000983754,0.00034939463,0.00002339541],"category_scores_gemma":[0.000079081954,0.00042809796,0.00030386393,0.000116127674,0.00065632473,0.00017839097,0.0024702398,0.00071156566,0.00002213487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000652919,0.00005294446,0.00324007,0.00008937257,0.00015001987,0.0000059269823,0.0013150973,0.000032751865,0.0006129129,0.95507413,0.00017943459,0.03918207],"study_design_scores_gemma":[0.00044612229,0.000071930066,0.004997105,0.00004472724,0.000063999265,0.0002131175,0.00003824725,0.0030351288,0.00044324456,0.9844086,0.005782887,0.0004548958],"about_ca_topic_score_codex":0.000019282801,"about_ca_topic_score_gemma":0.000024745674,"teacher_disagreement_score":0.06906894,"about_ca_system_score_codex":0.00003546769,"about_ca_system_score_gemma":0.00012395695,"threshold_uncertainty_score":0.9998171},"labels":[],"label_agreement":null},{"id":"W2950813750","doi":"","title":"An Elliptic Curve Trapdoor System.","year":2003,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hessian form of an elliptic curve; Jacobian curve; Key escrow; Hyperelliptic curve; Elliptic curve; Tripling-oriented Doche–Icart–Kohel curve; Hyperelliptic curve cryptography; Elliptic curve point multiplication; Discrete logarithm; Elliptic curve cryptography; Computer science; Curve25519; Elliptic Curve Digital Signature Algorithm; Key (lock); Public-key cryptography; Mathematics; Discrete mathematics; Pure mathematics; Computer security; Finite field; Encryption","score_opus":0.012113897888469415,"score_gpt":0.253571463960746,"score_spread":0.24145756607227656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950813750","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052425493,0.00071460946,0.9327263,0.0004990653,0.0030387223,0.00086646515,0.000047264148,0.0007419993,0.008940066],"genre_scores_gemma":[0.3864549,0.000147885,0.6126155,0.00023890415,0.00020231596,0.00023570324,0.000048855352,0.000053081763,0.0000028128036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940866,0.0014514107,0.00086896046,0.0020851374,0.00046129868,0.001046549],"domain_scores_gemma":[0.9951895,0.00041065572,0.0004897318,0.0032793824,0.00014986208,0.00048089653],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076630036,0.0007757713,0.0010443534,0.00073900586,0.0003364693,0.00031740955,0.0036725893,0.0006613762,0.000047844343],"category_scores_gemma":[0.00005986367,0.0007355024,0.000619833,0.00041915197,0.00060814776,0.00022092919,0.001618635,0.0019115631,0.00034801773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020658332,0.00026306493,0.0021131097,0.00027821932,0.00022704122,0.0003178853,0.0019384406,0.0011747224,0.00047990377,0.98964864,0.0002490623,0.0032892607],"study_design_scores_gemma":[0.0007107275,0.00029112145,0.015750699,0.00029931904,0.0001285606,0.000578279,0.00030062627,0.024924807,0.0010404221,0.95284027,0.0018184794,0.0013166696],"about_ca_topic_score_codex":0.000088868925,"about_ca_topic_score_gemma":0.00006433972,"teacher_disagreement_score":0.3340294,"about_ca_system_score_codex":0.00009836959,"about_ca_system_score_gemma":0.0003998139,"threshold_uncertainty_score":0.9995096},"labels":[],"label_agreement":null},{"id":"W2950849703","doi":"","title":"Authorship Proof for Textual Document.","year":2007,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scheme (mathematics); Digital watermarking; Natural (archaeology); Information retrieval; Theoretical computer science; Computer security; Image (mathematics); Artificial intelligence; Mathematics","score_opus":0.028054050245686978,"score_gpt":0.3158970230375547,"score_spread":0.2878429727918677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950849703","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023799252,0.00016864018,0.98686016,0.00128774,0.0010297865,0.0017626573,0.000051572395,0.0009517417,0.0055078035],"genre_scores_gemma":[0.070501804,0.00004793733,0.9279586,0.00035886068,0.00025027993,0.00074653607,0.000083654704,0.00003964545,0.000012693847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961566,0.00029446208,0.00072371424,0.0015069061,0.0003015914,0.0010167693],"domain_scores_gemma":[0.9966891,0.00073197955,0.00049146893,0.0016966802,0.00015838719,0.000232413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011551158,0.0005937741,0.000707929,0.000680954,0.00026515438,0.0001654755,0.00294722,0.0006513019,0.000010504485],"category_scores_gemma":[0.00016053778,0.0005727623,0.00052520976,0.00020535433,0.00044329523,0.00020814707,0.003900459,0.0015004218,0.00001872343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092556285,0.00007717002,0.00051386934,0.00015105544,0.0001093547,0.00004977097,0.001529396,0.000110343884,0.0001726166,0.95540965,0.0008919448,0.04089227],"study_design_scores_gemma":[0.00030970527,0.00018345991,0.00057658355,0.0001478616,0.000026996338,0.0000470169,0.000018809515,0.0014240764,0.010776576,0.96841896,0.017462306,0.0006076659],"about_ca_topic_score_codex":0.000014644598,"about_ca_topic_score_gemma":0.00003117983,"teacher_disagreement_score":0.06812188,"about_ca_system_score_codex":0.00008144783,"about_ca_system_score_gemma":0.00018160451,"threshold_uncertainty_score":0.99967235},"labels":[],"label_agreement":null},{"id":"W2950852182","doi":"","title":"Strain: A Secure Auction for Blockchains.","year":2017,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer security; Mathematical proof; Adversary; Latency (audio); Blockchain; Confidentiality; Computer network; Mathematics; Telecommunications","score_opus":0.023046684101821598,"score_gpt":0.28743770944233915,"score_spread":0.26439102534051756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950852182","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008449172,0.00022399248,0.97102344,0.014789446,0.0012982446,0.001681003,0.00032288654,0.0007773911,0.0014344293],"genre_scores_gemma":[0.17364557,0.00013135296,0.8231388,0.0003209246,0.00036911757,0.0021853782,0.00015560476,0.00004130743,0.000011951923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967448,0.00014057015,0.000539926,0.0016659191,0.00019929765,0.000709458],"domain_scores_gemma":[0.9950106,0.00028661563,0.00072009396,0.003604739,0.0002180794,0.00015987687],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056704256,0.0005173646,0.00072175416,0.00037550638,0.0007580327,0.00018618997,0.004194441,0.0010712558,0.000016312506],"category_scores_gemma":[0.00022265215,0.0005459376,0.0004078068,0.00009276853,0.0007147421,0.000085188745,0.0041571218,0.0017158833,0.00005695619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017653647,0.00012649476,0.00012528176,0.00009209539,0.00014426587,0.000016193206,0.0011601254,0.00025142444,0.00021583975,0.9670783,0.0014887892,0.0292835],"study_design_scores_gemma":[0.00044065638,0.00008492885,0.001057482,0.00005113563,0.000037209727,0.0000814294,0.00003923911,0.04570047,0.00051535584,0.9317739,0.01973679,0.00048140725],"about_ca_topic_score_codex":0.000038758808,"about_ca_topic_score_gemma":0.00016108737,"teacher_disagreement_score":0.16519639,"about_ca_system_score_codex":0.000085138796,"about_ca_system_score_gemma":0.00035997303,"threshold_uncertainty_score":0.99969923},"labels":[],"label_agreement":null},{"id":"W2950879282","doi":"","title":"PEKSrand: Providing Predicate Privacy in Public-key Encryption with Keyword Search.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Predicate (mathematical logic); Computer science; Delegate; Encryption; Theoretical computer science; Property (philosophy); Scheme (mathematics); Computer security; Mathematics","score_opus":0.0250938705522213,"score_gpt":0.2579563578888173,"score_spread":0.23286248733659604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950879282","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25768518,0.00008318712,0.7343799,0.0031708635,0.00063588074,0.0012213993,0.00009103806,0.0004111979,0.0023213213],"genre_scores_gemma":[0.44999975,0.00017691511,0.54890144,0.00014768353,0.00016522108,0.0003374955,0.00023349641,0.000037565886,4.0882193e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937613,0.0008215374,0.0008937124,0.0023871416,0.0007637073,0.0013725931],"domain_scores_gemma":[0.99519795,0.0005566378,0.0005121817,0.0030305085,0.0002091006,0.00049364765],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0014933591,0.00077273895,0.00094872474,0.0014118939,0.00030258409,0.0005753658,0.004583856,0.0007720465,0.00007239784],"category_scores_gemma":[0.00029437532,0.0007027105,0.00029013611,0.00074516825,0.00091786624,0.00082739943,0.008081534,0.005217759,0.00009599973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017093655,0.00038852534,0.027943231,0.00020024118,0.00012019028,0.00020235438,0.00870032,0.00017457856,0.0007738106,0.95091945,0.00013285688,0.010273519],"study_design_scores_gemma":[0.0014609771,0.00023222523,0.044719204,0.00028912164,0.000032228018,0.000167195,0.000120970464,0.0150861,0.0008204115,0.9301715,0.0058988957,0.0010011587],"about_ca_topic_score_codex":0.0003270929,"about_ca_topic_score_gemma":0.0015107681,"teacher_disagreement_score":0.19231457,"about_ca_system_score_codex":0.00011005623,"about_ca_system_score_gemma":0.0010103177,"threshold_uncertainty_score":0.99994093},"labels":[],"label_agreement":null},{"id":"W2950940133","doi":"","title":"Oblivious Transfer from weakly Random Self-Reducible Public-Key Cryptosystem.","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Cryptosystem; Learning with errors; Oblivious transfer; Computer science; Public key cryptosystem; Public-key cryptography; Integer (computer science); Key (lock); Theoretical computer science; Quantum; Transfer (computing); Cryptography; Discrete mathematics; Mathematics; Algorithm; Encryption; Computer security; Physics; Quantum mechanics; Parallel computing","score_opus":0.027679791595706608,"score_gpt":0.25015450251888444,"score_spread":0.22247471092317783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950940133","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09297805,0.0014672279,0.88523567,0.0027652744,0.0042346283,0.0015992498,0.0012928869,0.0016178389,0.0088091865],"genre_scores_gemma":[0.30903283,0.0005765505,0.6872545,0.0005332542,0.0007950577,0.00060953124,0.0010943228,0.0001029355,0.0000010519547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99028295,0.0019336131,0.0015808296,0.0034920385,0.001055556,0.0016550068],"domain_scores_gemma":[0.99155223,0.0012151113,0.00047306,0.0051411367,0.0005330884,0.0010853742],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0017586799,0.001318651,0.0020962094,0.0010986786,0.00041056811,0.000960295,0.0066998512,0.0011730848,0.00022790981],"category_scores_gemma":[0.00032584643,0.0013007872,0.0010484987,0.00072202785,0.00058846397,0.0007958488,0.0063353344,0.0030686117,0.00074407127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020827068,0.0006858441,0.002073442,0.00015806769,0.00096373184,0.00022028112,0.011603573,0.00013918796,0.0004395642,0.973675,0.0075511932,0.0022818102],"study_design_scores_gemma":[0.0030695675,0.00015146018,0.0015518031,0.00018109515,0.00018068185,0.00009539624,0.00024057957,0.006148422,0.0005671203,0.9574037,0.028992187,0.0014179511],"about_ca_topic_score_codex":0.0008801445,"about_ca_topic_score_gemma":0.0009500711,"teacher_disagreement_score":0.21605478,"about_ca_system_score_codex":0.00021025995,"about_ca_system_score_gemma":0.0016385247,"threshold_uncertainty_score":0.9999565},"labels":[],"label_agreement":null},{"id":"W2951044488","doi":"","title":"Sphinx: A Compact and Provably Secure Mix Format.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Random oracle; Sphinx; Computer science; Cryptography; Computer network; Path (computing); Relay; Oracle; Computer security; Scheme (mathematics); Theoretical computer science; Set (abstract data type); Encryption; Public-key cryptography; Mathematics; Programming language","score_opus":0.014705069144193785,"score_gpt":0.24696399267778146,"score_spread":0.23225892353358768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951044488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1327708,0.0003782742,0.85891926,0.0013319702,0.0006608162,0.00049019314,0.000024670446,0.00029797043,0.0051260483],"genre_scores_gemma":[0.8239992,0.00030446984,0.17500646,0.00038607576,0.00018514041,0.000032960237,0.000048690938,0.000029405299,0.000007590802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962929,0.00033923937,0.0008061199,0.0013682034,0.00038337623,0.00081020175],"domain_scores_gemma":[0.99786943,0.00029971913,0.0005519525,0.0008670762,0.00014023614,0.00027159206],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039915805,0.0006506659,0.001079498,0.00039581617,0.00027487898,0.00023835157,0.0019194044,0.00042789057,0.00003295206],"category_scores_gemma":[0.00009025046,0.00058667205,0.00044919696,0.00016556976,0.0004566159,0.00021267727,0.0025429649,0.0019071229,0.00013499276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027837821,0.00010762255,0.0006530312,0.00011976556,0.00036802908,0.00027818777,0.0130648315,0.0047402806,0.000030040743,0.97287625,0.0032446394,0.004489468],"study_design_scores_gemma":[0.0006318469,0.00015933785,0.0035669534,0.00024462157,0.00008773664,0.0009912649,0.00021567495,0.8940072,0.00013484112,0.09267967,0.0062646773,0.0010161473],"about_ca_topic_score_codex":0.0000700861,"about_ca_topic_score_gemma":0.00018012748,"teacher_disagreement_score":0.88926697,"about_ca_system_score_codex":0.000072381634,"about_ca_system_score_gemma":0.00025426934,"threshold_uncertainty_score":0.99965847},"labels":[],"label_agreement":null},{"id":"W2951069447","doi":"","title":"Side Channel Power Analysis of an AES-256 Bootloader.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Advanced Encryption Standard; Side channel attack; Power analysis; Computer science; Initialization; Byte; AES implementations; Cryptography; Firmware; Computer security; Code (set theory); Encryption; Embedded system; Operating system; Programming language","score_opus":0.019499984699482484,"score_gpt":0.30282212920135526,"score_spread":0.28332214450187276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951069447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27247578,0.00005797353,0.72406805,0.00061686704,0.0005254013,0.00035191706,0.00014032882,0.00013728281,0.0016264224],"genre_scores_gemma":[0.73994136,0.000042958472,0.2592723,0.00031155456,0.000051450108,0.0000935083,0.0002657003,0.000020417643,7.560838e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956765,0.00071988814,0.0010287442,0.0014462158,0.00045419735,0.0006744558],"domain_scores_gemma":[0.9956451,0.0004590404,0.0007905233,0.0026106483,0.00022602385,0.000268632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008013794,0.00051222113,0.0012843105,0.0019004968,0.00019042303,0.00012248113,0.0024941438,0.0003355308,0.0001676572],"category_scores_gemma":[0.00009431478,0.0005198355,0.0008720076,0.00092714146,0.00045794644,0.00017282441,0.0031088716,0.0009090942,0.000026611895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030913143,0.0003120435,0.002783174,0.00005068879,0.0020663135,0.000034490953,0.008778433,0.0060811276,0.00032030273,0.9755514,0.00016461243,0.0038264522],"study_design_scores_gemma":[0.0004613102,0.0002218894,0.07748943,0.000032484248,0.00062733056,0.000018850538,0.00030862348,0.12435159,0.0005264645,0.79453015,0.0007829716,0.0006488953],"about_ca_topic_score_codex":0.00045102913,"about_ca_topic_score_gemma":0.0011995651,"teacher_disagreement_score":0.46746555,"about_ca_system_score_codex":0.000041693253,"about_ca_system_score_gemma":0.00020158675,"threshold_uncertainty_score":0.99972534},"labels":[],"label_agreement":null},{"id":"W2951114148","doi":"","title":"Comparing Two Pairing-Based Aggregate Signature Schemes.","year":2009,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Random oracle; Pairing; Bilinear interpolation; Computer science; Scheme (mathematics); Signature (topology); Oracle; Public-key cryptography; Mathematics; Computer security; Encryption; Physics","score_opus":0.023364742972495516,"score_gpt":0.273729136393664,"score_spread":0.25036439342116845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951114148","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04067031,0.0010157052,0.9498984,0.0017351408,0.0012520961,0.00070702593,0.00008887089,0.0010281237,0.003604312],"genre_scores_gemma":[0.3470126,0.00006673658,0.6513694,0.0009720558,0.00021064909,0.00007791971,0.00025943658,0.00003097985,2.1192345e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99452937,0.00064969796,0.00084188255,0.002263272,0.0005559599,0.0011597923],"domain_scores_gemma":[0.9949353,0.00049941597,0.0006855775,0.0032926614,0.00016712982,0.00041994124],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0007332854,0.0009228086,0.0012085519,0.0007497762,0.00034825542,0.00038311613,0.004736417,0.0006119425,0.000050704057],"category_scores_gemma":[0.00014998409,0.0009596382,0.00061615545,0.00046939673,0.00054958626,0.00027520326,0.00550187,0.0038066574,0.00015891259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007529254,0.0003044972,0.0052116276,0.0001280818,0.00015307576,0.00028783316,0.00061604084,0.0049857004,0.00047914774,0.9776065,0.0011181291,0.009034127],"study_design_scores_gemma":[0.0010873644,0.000108624525,0.007996787,0.00034502364,0.00005020029,0.000043767606,0.0000113521655,0.08175288,0.001990881,0.8991159,0.0065041385,0.0009930488],"about_ca_topic_score_codex":0.00008937262,"about_ca_topic_score_gemma":0.0002671346,"teacher_disagreement_score":0.3063423,"about_ca_system_score_codex":0.00009596323,"about_ca_system_score_gemma":0.00045565597,"threshold_uncertainty_score":0.9992854},"labels":[],"label_agreement":null},{"id":"W2951244793","doi":"","title":"SecureMed: Secure Medical Computation using GPU-Accelerated Homomorphic Encryption Scheme.","year":2016,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Homomorphic encryption; Computer science; Speedup; Encryption; Scheme (mathematics); Cloud computing; Computation; Computer security; Parallel computing; Algorithm; Operating system","score_opus":0.0437951450094653,"score_gpt":0.3112288715510061,"score_spread":0.2674337265415408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951244793","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103769846,0.00032013148,0.88886416,0.0020137676,0.002424891,0.0007706316,0.00019727863,0.00090186275,0.00073746085],"genre_scores_gemma":[0.29134288,0.0002777011,0.7066639,0.00052405865,0.0006121949,0.00010951297,0.0003955141,0.000074045645,1.7991843e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933224,0.0010631589,0.0011763178,0.00217372,0.0011953401,0.0010690917],"domain_scores_gemma":[0.9958058,0.0005955342,0.00085458526,0.001726607,0.0004076583,0.0006097982],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0011136447,0.00087205943,0.0010668759,0.00082376704,0.00043466565,0.00030886516,0.002988243,0.0012729078,0.00029072087],"category_scores_gemma":[0.00036922077,0.00080079545,0.0004887618,0.0005819806,0.00088495214,0.00052278506,0.0056163226,0.0025444909,0.00025904522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007203789,0.0002490383,0.001939662,0.00016665838,0.00025825357,0.00029516462,0.0017935133,0.00023332432,0.0029271604,0.98493713,0.00095456373,0.006173516],"study_design_scores_gemma":[0.00096887664,0.000082252714,0.0021870213,0.00049190683,0.00004675567,0.00032314187,0.000047594684,0.1257899,0.00066723773,0.8674484,0.0010688511,0.0008780805],"about_ca_topic_score_codex":0.00010032838,"about_ca_topic_score_gemma":0.00015558992,"teacher_disagreement_score":0.18757303,"about_ca_system_score_codex":0.0001722712,"about_ca_system_score_gemma":0.001123722,"threshold_uncertainty_score":0.9997567},"labels":[],"label_agreement":null},{"id":"W2951247826","doi":"","title":"Efficient Consistency Proofs for Generalized Queries on a Committed Database.","year":2004,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical proof; Computer science; Database; Range tree; View; Data structure; Range (aeronautics); Range query (database); Alias; Theoretical computer science; Protocol (science); Rectangle; Consistency (knowledge bases); Information retrieval; Mathematics; Database design; Web search query; Sargable; Tree structure; Programming language; Search engine; Interval tree","score_opus":0.027707611027542347,"score_gpt":0.2841236627902481,"score_spread":0.25641605176270577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951247826","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027848378,0.00044148945,0.96018344,0.0025085101,0.0019402393,0.0024868003,0.0022042603,0.0005355671,0.0018513121],"genre_scores_gemma":[0.057514984,0.00010282034,0.9384854,0.001064535,0.00019383793,0.0012347416,0.0013563827,0.000046772286,5.685602e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951455,0.00048787193,0.0008826291,0.0020959629,0.00043523597,0.00095282466],"domain_scores_gemma":[0.9946793,0.0009106969,0.0005628359,0.0033266356,0.00021777312,0.0003027757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063216884,0.00078656536,0.001072555,0.00058718363,0.00048339198,0.00022340984,0.002805721,0.00042942417,0.00003670854],"category_scores_gemma":[0.00036023353,0.00075788045,0.00065804675,0.00029422878,0.0009000023,0.00008456358,0.004570498,0.0013750433,0.00007437379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002862046,0.0005932066,0.00017243584,0.00034246602,0.00021756583,0.00007169831,0.0017957351,0.0042437464,0.00026899588,0.989054,0.001196141,0.001757754],"study_design_scores_gemma":[0.0017815742,0.0002762316,0.0011749149,0.00030898603,0.00008437931,0.000051636434,0.00004374352,0.019933831,0.0011141617,0.9700682,0.004317694,0.00084461045],"about_ca_topic_score_codex":0.00016714858,"about_ca_topic_score_gemma":0.00026515927,"teacher_disagreement_score":0.029666608,"about_ca_system_score_codex":0.00012341367,"about_ca_system_score_gemma":0.00079333485,"threshold_uncertainty_score":0.9994872},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019059142723870118,"score_gpt":0.2538417123297927,"score_spread":0.2347825696059226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951256639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11177941,0.000098135984,0.8460142,0.029696332,0.0012899481,0.0010074107,0.000035269695,0.00078672747,0.0092925485],"genre_scores_gemma":[0.6377071,0.00019922019,0.35587725,0.003392235,0.000752802,0.001896259,0.00004488892,0.000080786864,0.000049456437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964946,0.00051447056,0.0005029356,0.0014853178,0.00030784815,0.00069485523],"domain_scores_gemma":[0.994849,0.00061974325,0.00042440114,0.0038198915,0.00016353629,0.00012340654],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008882335,0.0005040683,0.0005249431,0.00030663112,0.00062377437,0.00011182846,0.0038530705,0.00082927186,0.00015886869],"category_scores_gemma":[0.00016937421,0.00039703833,0.00025507208,0.0003176185,0.001134541,0.000031609718,0.0042807567,0.0025396426,0.0009633484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020577738,0.00014893794,0.00018472414,0.000021270154,0.00011950259,0.000012761318,0.0010362797,0.0005442689,0.00016524065,0.9885983,0.0061756503,0.002972526],"study_design_scores_gemma":[0.00017161158,0.00012869328,0.0010456992,0.00005273966,0.000020360025,0.00005118149,0.0000622491,0.040065404,0.0026071474,0.9383035,0.017110769,0.0003806917],"about_ca_topic_score_codex":0.00008482522,"about_ca_topic_score_gemma":0.00007730883,"teacher_disagreement_score":0.52592766,"about_ca_system_score_codex":0.00010960779,"about_ca_system_score_gemma":0.00023950361,"threshold_uncertainty_score":0.9998481},"labels":[],"label_agreement":null},{"id":"W2951276012","doi":"","title":"Detection of Algebraic Manipulation in the Presence of Leakage.","year":2013,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Randomness; Computer science; Upper and lower bounds; Adversary; Algorithm; Communication source; Algebraic number; Theoretical computer science; Mathematics; Computer security; Computer network","score_opus":0.027181157103419767,"score_gpt":0.2861171698116562,"score_spread":0.2589360127082364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951276012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44299692,0.000044692468,0.5557182,0.00026838336,0.00020777657,0.00047582373,0.00000767514,0.000016275999,0.0002642612],"genre_scores_gemma":[0.9122099,0.000058186444,0.08750077,0.00003741825,0.00002315655,0.0001459525,0.00001817324,0.0000062282975,1.8935947e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770296,0.00059092214,0.00069092395,0.00047528767,0.00028916495,0.0002507561],"domain_scores_gemma":[0.99768984,0.0006060085,0.0005496037,0.0010125296,0.00011155915,0.00003048189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061726704,0.00019442424,0.00035940993,0.00046590317,0.00006190309,0.00003595034,0.0013873796,0.00015118522,0.000028207352],"category_scores_gemma":[0.00010600243,0.00016116162,0.00016810188,0.00034648806,0.00027327338,0.0001366744,0.0011385141,0.00058905286,0.0000075205226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011108993,0.00011586202,0.0073612873,0.00010259454,0.000035508816,0.000003944332,0.010575665,0.0007278305,0.00367296,0.96587455,0.000027369346,0.011491326],"study_design_scores_gemma":[0.00019790049,0.00006586679,0.20331982,0.00004365796,0.000011625127,0.000012438169,0.00032621535,0.019694667,0.0023593276,0.77379245,0.000053709016,0.00012233258],"about_ca_topic_score_codex":0.00095262786,"about_ca_topic_score_gemma":0.0011220371,"teacher_disagreement_score":0.469213,"about_ca_system_score_codex":0.000020064694,"about_ca_system_score_gemma":0.00007931937,"threshold_uncertainty_score":0.657198},"labels":[],"label_agreement":null},{"id":"W2951345862","doi":"","title":"On the Structure of Unconditional UC Hybrid Protocols.","year":2017,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Protocol (science); Ideal (ethics); Computation; Power (physics); Nothing; Secure multi-party computation; Theoretical computer science; Discrete mathematics; Algorithm; Mathematics; Physics; Quantum mechanics; Medicine; Political science","score_opus":0.023719821844464514,"score_gpt":0.2926158362625936,"score_spread":0.26889601441812905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951345862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051788677,0.000022255628,0.9312201,0.0027066835,0.00082134904,0.0068987263,0.003085767,0.0001159922,0.0033404422],"genre_scores_gemma":[0.6295519,0.000015007635,0.36668277,0.00061647384,0.00026969184,0.002144431,0.00068998896,0.000029210669,5.5647024e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971487,0.00040512314,0.00049855834,0.0010423121,0.0004780278,0.00042731385],"domain_scores_gemma":[0.9943864,0.0008117653,0.00087782386,0.003660651,0.00014479707,0.00011858998],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033482796,0.00043811943,0.0005938488,0.00024338003,0.0003965577,0.00018429257,0.0051163035,0.00023340555,0.00023737473],"category_scores_gemma":[0.00034968072,0.00031792832,0.0003968092,0.00007728926,0.001020737,0.00014163424,0.00483254,0.0017355066,0.000047804137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005903218,0.000114711234,0.00062945124,0.00008462151,0.00013938098,0.00004040676,0.0005333024,0.0001693619,0.00034530394,0.99176216,0.004797804,0.0013244428],"study_design_scores_gemma":[0.00029368096,0.000104635175,0.008395855,0.00018913845,0.00001533091,0.000050631734,0.000009733482,0.00085125095,0.004822057,0.9825437,0.0024224992,0.00030150803],"about_ca_topic_score_codex":0.000046315847,"about_ca_topic_score_gemma":0.000071816554,"teacher_disagreement_score":0.5777632,"about_ca_system_score_codex":0.000028213832,"about_ca_system_score_gemma":0.00040498257,"threshold_uncertainty_score":0.9999273},"labels":[],"label_agreement":null},{"id":"W2951403199","doi":"","title":"Pleco and Plectron - Two Provably Secure Password Hashing Algorithms.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Password; Hash function; Password cracking; Cryptography; Password strength; Cryptographic hash function; Cryptosystem; Theoretical computer science; One-time password; S/KEY; Computer security; Algorithm","score_opus":0.014582205305183338,"score_gpt":0.2898647781017589,"score_spread":0.2752825727965756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951403199","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12204338,0.00019062133,0.87160045,0.002989639,0.0008842611,0.0008306521,0.00006300217,0.00029886377,0.0010991102],"genre_scores_gemma":[0.32652128,0.0001716165,0.67208135,0.00055753207,0.0002565641,0.0002639045,0.0001099884,0.00003617657,0.0000015801099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99564403,0.0005728043,0.00074691715,0.0016969802,0.0003795324,0.0009597544],"domain_scores_gemma":[0.9970554,0.00061055826,0.0004857953,0.001441825,0.00013109605,0.00027529034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075646304,0.000627152,0.0008039045,0.0005655157,0.0004512242,0.00047486665,0.0016538725,0.000308001,0.00005159465],"category_scores_gemma":[0.000120490644,0.0006375182,0.00026803985,0.0002565288,0.00040525344,0.0002213359,0.0045808367,0.0018235391,0.000034293396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018797366,0.000089271736,0.0023955444,0.00010442614,0.00018186029,0.000049720238,0.005412637,0.0001628457,0.00021431371,0.9399748,0.0008006723,0.050595146],"study_design_scores_gemma":[0.0008940679,0.00015665931,0.0062032943,0.000073941424,0.000051216546,0.00015867312,0.00011243072,0.058396686,0.00020199764,0.92667085,0.006392779,0.0006873931],"about_ca_topic_score_codex":0.00025950148,"about_ca_topic_score_gemma":0.001018776,"teacher_disagreement_score":0.20447792,"about_ca_system_score_codex":0.00007380187,"about_ca_system_score_gemma":0.00029167038,"threshold_uncertainty_score":0.9996076},"labels":[],"label_agreement":null},{"id":"W2951428475","doi":"","title":"Privacy-Preserving Implicit Authentication.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Authentication (law); Computer security; Mobile device; Private information retrieval; Protocol (science); Authentication protocol; Architecture; Authentication server; Computer network; World Wide Web","score_opus":0.019689246076397115,"score_gpt":0.2768368550348353,"score_spread":0.2571476089584382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951428475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05920176,0.0001152887,0.9259624,0.0070560793,0.001718867,0.00079346367,0.000020896614,0.00058902934,0.004542226],"genre_scores_gemma":[0.755414,0.00003452809,0.24326475,0.0005978728,0.0002552348,0.00029358186,0.00007416179,0.000040408522,0.00002543489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956277,0.00074895896,0.00092220027,0.0015469274,0.0004533177,0.0007009064],"domain_scores_gemma":[0.99392,0.00052691094,0.00063983985,0.004398722,0.00021113378,0.00030334204],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0007638381,0.0005064075,0.00075789867,0.00043658217,0.00024225532,0.00038057158,0.0061765,0.0004176348,0.00011182419],"category_scores_gemma":[0.0004249821,0.00051618175,0.00035123495,0.00019316026,0.00022841744,0.00017114202,0.010632299,0.001150901,0.0012666181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005952767,0.0000996426,0.0016416197,0.0001655267,0.00012871942,0.000009415699,0.033906512,0.000047747537,0.00075905706,0.9596492,0.0020795339,0.001507061],"study_design_scores_gemma":[0.00023796782,0.000025012172,0.011666523,0.000103809456,0.000028513612,0.00004279345,0.00004297027,0.17127524,0.0002805085,0.80439204,0.011446418,0.00045822238],"about_ca_topic_score_codex":0.00008551344,"about_ca_topic_score_gemma":0.000037096437,"teacher_disagreement_score":0.69621223,"about_ca_system_score_codex":0.00008890739,"about_ca_system_score_gemma":0.00025464263,"threshold_uncertainty_score":0.999729},"labels":[],"label_agreement":null},{"id":"W2951443613","doi":"","title":"Succinct Randomized Encodings and their Applications.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Functional encryption; Plaintext; Obfuscation; Bounded function; Computer science; Cryptography; Theoretical computer science; Encoding (memory); ENCODE; Encryption; Secure multi-party computation; Simple (philosophy); Complexity class; Function (biology); Computation; Time complexity; Mathematics; Algorithm; Ciphertext","score_opus":0.007846166356152841,"score_gpt":0.23193023580274644,"score_spread":0.2240840694465936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951443613","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070991437,0.0006985256,0.98403984,0.0015917851,0.00044726662,0.0015404196,0.00009149638,0.00036494245,0.0041265963],"genre_scores_gemma":[0.20855081,0.00083356316,0.7882886,0.00067550613,0.00024229728,0.001215897,0.00016544087,0.000027500391,4.0996716e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962731,0.0008444082,0.0006769591,0.0015080578,0.00018001735,0.0005174463],"domain_scores_gemma":[0.995031,0.0021360186,0.00049036916,0.0019998143,0.000099107194,0.00024370886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013776543,0.0005591271,0.0013450575,0.0004142554,0.00025871943,0.00023773623,0.0021254981,0.00037225633,0.000028131195],"category_scores_gemma":[0.00019117144,0.00045769333,0.00047195097,0.00017671587,0.0010405674,0.00014770518,0.0056365603,0.0012111817,0.00006950658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059564604,0.00006210883,0.00028992572,0.00009893748,0.00015498021,0.0000051115653,0.0021191344,0.000017361874,0.00008303718,0.98258185,0.00028842746,0.013703476],"study_design_scores_gemma":[0.0089087635,0.000022769675,0.00045811108,0.000047473117,0.00003715359,0.000058632402,0.000032127005,0.011446799,0.00022492783,0.9699261,0.008382077,0.00045505905],"about_ca_topic_score_codex":0.00007613753,"about_ca_topic_score_gemma":0.000045414978,"teacher_disagreement_score":0.20145167,"about_ca_system_score_codex":0.000022413913,"about_ca_system_score_gemma":0.00012331294,"threshold_uncertainty_score":0.9997875},"labels":[],"label_agreement":null},{"id":"W2951495502","doi":"","title":"Finding shortest lattice vectors faster using quantum search","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Lattice problem; Quantum; Quantum algorithm; Computer science; Heuristic; Lattice (music); Mathematics; Discrete mathematics; Algorithm; Mathematical optimization; Cryptography; Physics; Quantum mechanics","score_opus":0.05176874913598306,"score_gpt":0.31067210604021656,"score_spread":0.2589033569042335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951495502","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33553982,0.000093324954,0.66075104,0.00034165077,0.0015779714,0.00040283907,0.000088733104,0.00025607162,0.00094852806],"genre_scores_gemma":[0.45332095,0.00004426818,0.5458544,0.00026172164,0.00032329772,0.000038979182,0.000113655406,0.00004248814,2.8511272e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99435073,0.0009835954,0.0008113218,0.0020492272,0.00057734264,0.0012277905],"domain_scores_gemma":[0.9951685,0.0011374941,0.0003893745,0.0027576017,0.00015643725,0.00039056691],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0011149257,0.0007337718,0.00097519904,0.0008389436,0.00043201764,0.0004284842,0.0035665592,0.00058000983,0.00008440893],"category_scores_gemma":[0.00019094981,0.000757368,0.00050725735,0.00041724162,0.00062234537,0.00032671817,0.009323128,0.0026665945,0.000229281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031476742,0.00013623333,0.012126086,0.00014193008,0.00017857632,0.00016339439,0.0034064583,0.002568228,0.0006299015,0.9785105,0.00018977735,0.0019174523],"study_design_scores_gemma":[0.00035551764,0.00009576629,0.012694878,0.00023285655,0.00007195598,0.00019480521,0.0001115239,0.21660317,0.0006072485,0.76674074,0.0013457955,0.00094573206],"about_ca_topic_score_codex":0.00026062236,"about_ca_topic_score_gemma":0.0001208473,"teacher_disagreement_score":0.21403494,"about_ca_system_score_codex":0.00010303566,"about_ca_system_score_gemma":0.00036134676,"threshold_uncertainty_score":0.99963427},"labels":[],"label_agreement":null},{"id":"W2951562085","doi":"","title":"Lelantos: A Blockchain-based Anonymous Physical Delivery System.","year":2017,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Waterloo","funders":"","keywords":"Computer security; Blockchain; Internet privacy; Computer science; Cryptocurrency; Anonymity; Payment; Privilege (computing); Disintermediation; Decentralization; Business; Tamper resistance; Electronic cash; World Wide Web; Law","score_opus":0.014072088853959344,"score_gpt":0.25505900940640885,"score_spread":0.24098692055244952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951562085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26545852,0.00021314352,0.7248749,0.002806466,0.0006597342,0.0008676918,0.000097494645,0.0012822065,0.0037398285],"genre_scores_gemma":[0.77481055,0.000014079378,0.22398505,0.00018135727,0.00023003932,0.00070718443,0.00003249917,0.000036090292,0.00000316053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956704,0.00039314455,0.00060615165,0.0020434062,0.00037991596,0.0009069982],"domain_scores_gemma":[0.9928321,0.000521722,0.0008369308,0.005347023,0.0002169981,0.00024521697],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00048320592,0.00073065545,0.0011651203,0.0005084079,0.0007674001,0.0002030625,0.006180711,0.0009089014,0.00000859608],"category_scores_gemma":[0.00011731155,0.00073433586,0.0005209413,0.00015122097,0.0011078889,0.000033878016,0.0059389435,0.0024456156,0.00033457114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026397202,0.00032704583,0.00054863055,0.00019700264,0.00016471902,0.00026158962,0.0009146181,0.001559463,0.00040131187,0.98500806,0.00036131003,0.010229851],"study_design_scores_gemma":[0.00052476354,0.00009343074,0.001234989,0.00018333174,0.00006808511,0.00013710566,0.00005750758,0.39211673,0.0015800288,0.6019769,0.0013137903,0.00071335194],"about_ca_topic_score_codex":0.00022701516,"about_ca_topic_score_gemma":0.00011690008,"teacher_disagreement_score":0.509352,"about_ca_system_score_codex":0.00017552263,"about_ca_system_score_gemma":0.0006664834,"threshold_uncertainty_score":0.99985576},"labels":[],"label_agreement":null},{"id":"W2951710497","doi":"","title":"Short One-Time Signatures.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Signature (topology); Scheme (mathematics); Elliptic Curve Digital Signature Algorithm; Modular design; Digital signature; Mathematical proof; Merkle signature scheme; Digital Signature Algorithm; Distributed computing; Embedded system; Theoretical computer science; Algorithm; Public-key cryptography; Blind signature; Computer network; Computer security; Elliptic curve cryptography; Mathematics; Programming language; Encryption","score_opus":0.015127431682303561,"score_gpt":0.2540988927991087,"score_spread":0.23897146111680512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951710497","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035099413,0.0002787902,0.9487982,0.0014418548,0.0022236914,0.00074256584,0.0003021523,0.0007323667,0.010380986],"genre_scores_gemma":[0.10321625,0.00014145262,0.8949948,0.00057904574,0.00044548247,0.0001676354,0.00040984515,0.000044434317,0.0000010529391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952473,0.0004150479,0.0007069769,0.0021259396,0.00053546816,0.0009692909],"domain_scores_gemma":[0.9947617,0.0005933218,0.00028783336,0.0037873627,0.00015396462,0.00041581356],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0006389043,0.00073278963,0.000990559,0.000606752,0.00027266797,0.00030550006,0.005311203,0.0012466662,0.00024844785],"category_scores_gemma":[0.00017869558,0.0007671962,0.0006217782,0.00029511141,0.0007465832,0.00026801025,0.010635348,0.0054653636,0.00067127537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033615623,0.00027114892,0.00063482556,0.000059342427,0.00020503456,0.00012501754,0.0010527287,0.000095349795,0.004164887,0.97792655,0.0022767999,0.013154675],"study_design_scores_gemma":[0.0002209866,0.00005712224,0.012428382,0.00006818147,0.000050709416,0.000050416853,0.0000075486078,0.0051923757,0.001620014,0.9701157,0.0093633095,0.0008252352],"about_ca_topic_score_codex":0.000056753615,"about_ca_topic_score_gemma":0.00016048034,"teacher_disagreement_score":0.068116836,"about_ca_system_score_codex":0.00003995101,"about_ca_system_score_gemma":0.0003119687,"threshold_uncertainty_score":0.9994779},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01424304818891629,"score_gpt":0.2647413245042318,"score_spread":0.2504982763153155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951754992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13838452,0.00026867786,0.85546243,0.0013697211,0.0020242957,0.00084798184,0.000012484944,0.00039690532,0.001233007],"genre_scores_gemma":[0.51639324,0.00046074786,0.48124135,0.0007170106,0.00080391724,0.00016532962,0.00015276381,0.000062897474,0.000002768763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940113,0.0013145101,0.0011104306,0.0019408327,0.00045983936,0.0011630966],"domain_scores_gemma":[0.9948633,0.0013790284,0.00067095016,0.0026712539,0.0001528846,0.00026263134],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00085417024,0.0007001333,0.0010672437,0.00059034204,0.00016613072,0.00014902916,0.0026540984,0.00089304504,0.00003528199],"category_scores_gemma":[0.00034905816,0.0007687234,0.00032216616,0.0003749934,0.00039482742,0.00012860341,0.004893874,0.0029418815,0.00023293804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005199986,0.00012402258,0.00565967,0.0000646696,0.000063098225,0.0001888263,0.0022562684,0.5922947,0.000027197097,0.38221344,0.0008795488,0.01617658],"study_design_scores_gemma":[0.00040559054,0.00005046245,0.005459165,0.00015499163,0.00001266887,0.00004751989,0.000033297074,0.65863097,0.00013618848,0.33211005,0.0023956061,0.00056345336],"about_ca_topic_score_codex":0.000215101,"about_ca_topic_score_gemma":0.0005873263,"teacher_disagreement_score":0.37800872,"about_ca_system_score_codex":0.00021379055,"about_ca_system_score_gemma":0.0001800219,"threshold_uncertainty_score":0.9994764},"labels":[],"label_agreement":null},{"id":"W2951843693","doi":"","title":"Pairing-Based Onion Routing with Improved Forward Secrecy.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Anonymity; Routing (electronic design automation); Secrecy; Directory; Computer network; Identity (music); Node (physics); Key (lock); Scheme (mathematics); Computer security; Static routing; Multipath routing; Forward secrecy; Routing protocol; Public-key cryptography; Mathematics; Encryption; Engineering","score_opus":0.013220778612189723,"score_gpt":0.23395324253124478,"score_spread":0.22073246391905504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951843693","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039219804,0.00010849934,0.9547978,0.0012598333,0.00082642643,0.0009002201,0.00013327108,0.0007757273,0.0019783846],"genre_scores_gemma":[0.24990864,0.000101752456,0.74868983,0.0006155905,0.00017010867,0.00020340901,0.0002647376,0.000045611803,3.0025757e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951227,0.0005031327,0.00073275313,0.0021023063,0.00045467718,0.0010844464],"domain_scores_gemma":[0.99532264,0.0006165594,0.0006681635,0.0027470172,0.00018305531,0.000462576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053983164,0.0008133545,0.0009515518,0.0005566768,0.00044435626,0.0002116615,0.00280158,0.00051882816,0.00002484152],"category_scores_gemma":[0.00020042567,0.0007428891,0.0005054892,0.00039198113,0.0006396928,0.00026194385,0.0039675464,0.002273578,0.00006333792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024494933,0.00033049745,0.010479154,0.00017330027,0.00027889377,0.00032428172,0.0028192713,0.0029453626,0.00034460585,0.9722705,0.00048776396,0.0093014585],"study_design_scores_gemma":[0.0018530313,0.0005131718,0.010936779,0.00037892567,0.00008015351,0.00026645366,0.00008785818,0.19474103,0.0024297314,0.7838189,0.0032837426,0.0016102244],"about_ca_topic_score_codex":0.00025874897,"about_ca_topic_score_gemma":0.00042350494,"teacher_disagreement_score":0.21068883,"about_ca_system_score_codex":0.00010163157,"about_ca_system_score_gemma":0.0009750649,"threshold_uncertainty_score":0.99950224},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.041025072424588374,"score_gpt":0.30250191091983797,"score_spread":0.2614768384952496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951981597","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02314422,0.0009413283,0.96368384,0.006954648,0.00050409976,0.002954165,0.00013414651,0.0004575617,0.0012259642],"genre_scores_gemma":[0.090799525,0.00012718575,0.906083,0.00010794153,0.00010635336,0.002659598,0.000073906915,0.000036433583,0.0000060444513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965938,0.00022224284,0.00083403697,0.0014216352,0.00027901607,0.0006492774],"domain_scores_gemma":[0.9944634,0.0005483809,0.00079465774,0.003536379,0.00048642958,0.00017079304],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010659938,0.00045329702,0.000885389,0.00054932514,0.00017964694,0.000048369875,0.0053557195,0.0007496589,0.0000158793],"category_scores_gemma":[0.0008457902,0.00044433566,0.00030501033,0.00029357828,0.00052740163,0.0001029282,0.013446236,0.0011622291,0.000024010385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028464663,0.00029699897,0.00053657993,0.00036780935,0.00011283112,0.0000070860315,0.0036084927,0.000114333285,0.0005367079,0.9690231,0.0037008252,0.021666788],"study_design_scores_gemma":[0.0004607633,0.00016688046,0.00042463173,0.00013953948,0.000032076903,0.00002208468,0.00007574737,0.039756656,0.002555627,0.9488916,0.007090345,0.00038406326],"about_ca_topic_score_codex":0.00005849637,"about_ca_topic_score_gemma":0.00011710794,"teacher_disagreement_score":0.0676553,"about_ca_system_score_codex":0.00007893675,"about_ca_system_score_gemma":0.00066870515,"threshold_uncertainty_score":0.99980086},"labels":[],"label_agreement":null},{"id":"W2952137394","doi":"","title":"Hashing Garbled Circuits for Free.","year":2017,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Hash function; Computer science; Universal hashing; State (computer science); Double hashing; Theoretical computer science; Algorithm; Hash table; Computer security","score_opus":0.036089377616799256,"score_gpt":0.3154821980277417,"score_spread":0.27939282041094243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952137394","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010872451,0.00012113057,0.98441327,0.0020410058,0.0025137255,0.0015974734,0.000101772996,0.0016411548,0.006483222],"genre_scores_gemma":[0.037174653,0.000083882056,0.96064466,0.00029118528,0.0003230108,0.001369661,0.00003311169,0.00006232912,0.000017503542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635524,0.00020493931,0.00061854895,0.0017472784,0.0002808542,0.00079314475],"domain_scores_gemma":[0.99312496,0.0007496304,0.0009406808,0.0047270064,0.00025606938,0.00020165445],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.000582716,0.0005727293,0.00085199886,0.00043699585,0.00057774875,0.0003570675,0.006411362,0.0005553994,0.000016144833],"category_scores_gemma":[0.0014693774,0.00062915304,0.00045161185,0.00006697202,0.00037499677,0.0003479995,0.008874549,0.0014877791,0.00005363033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022242595,0.00005504358,0.00013936813,0.00014137369,0.00011283167,0.000056639263,0.0008586268,0.00029010663,0.0018460307,0.92882204,0.0020251554,0.06563055],"study_design_scores_gemma":[0.0004865747,0.00010666358,0.0007398802,0.00014948938,0.000024551404,0.00007117487,0.000011143685,0.0065219435,0.013284769,0.96816504,0.009832886,0.0006059134],"about_ca_topic_score_codex":0.00004070504,"about_ca_topic_score_gemma":0.0000937693,"teacher_disagreement_score":0.06502464,"about_ca_system_score_codex":0.00014923727,"about_ca_system_score_gemma":0.00033918547,"threshold_uncertainty_score":0.99961597},"labels":[],"label_agreement":null},{"id":"W2952605738","doi":"","title":"An Analysis of ZVP-Attack on ECC Cryptosystems.","year":2012,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Side channel attack; Computer science; Power analysis; Cryptosystem; Cryptography; Public-key cryptography; Elliptic curve cryptography; Smart card; Computer security; Encryption","score_opus":0.030547227284234254,"score_gpt":0.30976742196873036,"score_spread":0.2792201946844961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952605738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26023617,0.00026598616,0.7335991,0.0003262955,0.00117978,0.00048763762,0.00011465838,0.00022172077,0.0035686132],"genre_scores_gemma":[0.76735306,0.00009044346,0.2319883,0.0001588843,0.00016169167,0.000099784906,0.000115617106,0.000031105483,0.0000011135756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945594,0.0011596583,0.0011031186,0.0016369038,0.0006207379,0.00092017377],"domain_scores_gemma":[0.9937424,0.00078448793,0.0009294751,0.0039011398,0.0002020054,0.0004404628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008783652,0.0007015998,0.0017227352,0.0025520618,0.00018284417,0.00012058165,0.0035720037,0.0006205652,0.000115248185],"category_scores_gemma":[0.00008152731,0.0006400263,0.0012135832,0.0012366977,0.0005572644,0.00020029781,0.0022728639,0.0013854299,0.00012387762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062213505,0.00075307715,0.028880902,0.00015885917,0.00299614,0.000048745238,0.0044564023,0.019177824,0.0007945111,0.9364418,0.00013544828,0.0060940734],"study_design_scores_gemma":[0.0008935168,0.00059095025,0.37255853,0.00031440047,0.0026705684,0.00004913707,0.000332222,0.13480455,0.003520311,0.48090577,0.0014514859,0.0019085554],"about_ca_topic_score_codex":0.00021134625,"about_ca_topic_score_gemma":0.00024156054,"teacher_disagreement_score":0.5071169,"about_ca_system_score_codex":0.00006818991,"about_ca_system_score_gemma":0.00020885191,"threshold_uncertainty_score":0.9996051},"labels":[],"label_agreement":null},{"id":"W2953055425","doi":"","title":"Location-Proof System based on Secure Multi-Party Computations.","year":2018,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Gas meter prover; Mathematical proof; Computer science; Honesty; Adversary; Computation; Computer security; Protocol (science); Theoretical computer science; Signature (topology); Secure two-party computation; Automated theorem proving; Cryptography; Secure multi-party computation; Algorithm; Mathematics; Law","score_opus":0.022242529229172067,"score_gpt":0.2744471361385328,"score_spread":0.2522046069093607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953055425","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002790567,0.000120753524,0.98930705,0.00094852585,0.0023545546,0.0011151527,0.00030651392,0.0007001032,0.0023567919],"genre_scores_gemma":[0.36275446,0.0000056219947,0.63598406,0.00043395057,0.00019557378,0.00022247343,0.0003769603,0.000026659427,2.2482791e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99523073,0.0008301057,0.00080496335,0.0019455702,0.0005010575,0.00068759674],"domain_scores_gemma":[0.9949415,0.0007369251,0.00061383477,0.0029691064,0.00043442176,0.00030425302],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006510305,0.00067484705,0.0007743247,0.0007133337,0.00043798075,0.00025587005,0.0028688235,0.0005266521,0.000036452584],"category_scores_gemma":[0.00016721926,0.000669731,0.00037967938,0.0005287829,0.00062784867,0.000174655,0.002628359,0.0014659159,0.00049293815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005502667,0.00039741115,0.001318377,0.000535205,0.00011038985,0.000060603226,0.0013462756,0.017474271,0.0000139119375,0.9756595,0.0018068741,0.0012221596],"study_design_scores_gemma":[0.0007680599,0.0001507504,0.0067112306,0.0005301964,0.000040306953,0.000030765874,0.0000748864,0.66669285,0.000301321,0.3227671,0.0012990362,0.0006334712],"about_ca_topic_score_codex":0.000085823696,"about_ca_topic_score_gemma":0.00015472708,"teacher_disagreement_score":0.6528924,"about_ca_system_score_codex":0.0001442872,"about_ca_system_score_gemma":0.0007523138,"threshold_uncertainty_score":0.9995754},"labels":[],"label_agreement":null},{"id":"W2953076142","doi":"","title":"Cryptographic Implications of Hess' Generalized GHS Attack.","year":2004,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Finite field; Generalization; Logarithm; Elliptic curve; Cryptography; Mathematics; Field (mathematics); Discrete mathematics; Pure mathematics; Computer science; Mathematical analysis; Algorithm; Public-key cryptography; Encryption; Computer security","score_opus":0.025450954780576313,"score_gpt":0.28699002304699256,"score_spread":0.26153906826641626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953076142","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11097808,0.0008914062,0.87873125,0.003639852,0.0009577147,0.00084697804,0.00010318098,0.0003500025,0.0035015277],"genre_scores_gemma":[0.34742552,0.0007320562,0.65100276,0.00029724295,0.000115820265,0.00031157624,0.0000723189,0.000041406907,0.0000012614244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954595,0.00049275,0.0011453873,0.0016441679,0.00040428972,0.00085392036],"domain_scores_gemma":[0.9949516,0.00046089475,0.0008386294,0.003156998,0.00028222104,0.00030967235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041781022,0.0006863709,0.0011546162,0.0012459581,0.00027278197,0.00011391583,0.003695595,0.0006056383,0.00006762219],"category_scores_gemma":[0.00009074153,0.0006668446,0.0010303542,0.0008631036,0.0011780773,0.00014209298,0.00406014,0.0014582069,0.00006649369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024729032,0.00033367955,0.005046019,0.0001850254,0.00038601286,0.000024307445,0.0013709763,0.006458595,0.002041892,0.9803441,0.00026286652,0.0035217528],"study_design_scores_gemma":[0.00074652105,0.00009360872,0.08451633,0.00017122434,0.00009008866,0.00008522905,0.000025245772,0.00076068,0.0017354265,0.9102791,0.0008912197,0.000605353],"about_ca_topic_score_codex":0.00021864202,"about_ca_topic_score_gemma":0.00019496189,"teacher_disagreement_score":0.23644744,"about_ca_system_score_codex":0.00006604145,"about_ca_system_score_gemma":0.0006744144,"threshold_uncertainty_score":0.9995783},"labels":[],"label_agreement":null},{"id":"W2953127313","doi":"","title":"A Post-Quantum Digital Signature Scheme Based on Supersingular Isogenies.","year":2017,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Random oracle; Computer science; Scheme (mathematics); Digital signature; Mathematical proof; Key (lock); Schnorr signature; Oracle; Theoretical computer science; Signature (topology); Exploit; Elliptic Curve Digital Signature Algorithm; Algorithm; Mathematics; Public-key cryptography; Blind signature; Computer network; Programming language","score_opus":0.01129449851218596,"score_gpt":0.24469556219919433,"score_spread":0.23340106368700836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953127313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06547694,0.0005087964,0.9160228,0.00719029,0.0022781617,0.0008547273,0.00031390713,0.00049949443,0.0068548787],"genre_scores_gemma":[0.681709,0.000053567896,0.31654686,0.0010413746,0.00027250493,0.00010428871,0.00020170842,0.0000646297,0.000006081958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99555814,0.00027462924,0.00055195397,0.001998974,0.0006163734,0.0009999393],"domain_scores_gemma":[0.9945505,0.00060650957,0.0004657641,0.0037774988,0.00024137883,0.0003582993],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00033246266,0.00083744875,0.0009163659,0.0008582146,0.00063286396,0.0008690905,0.004521324,0.00084816874,0.000047976002],"category_scores_gemma":[0.00046560954,0.0007751566,0.0009670584,0.00017483649,0.0010364017,0.00028412454,0.0038501197,0.0027952716,0.00023906205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021023348,0.0005514768,0.0031883726,0.00018534398,0.00038007682,0.0010462409,0.0018425601,0.0014945321,0.0017249982,0.9795424,0.00076188147,0.00907189],"study_design_scores_gemma":[0.0010592338,0.00048170568,0.010479089,0.0004479475,0.00006135081,0.00011197231,0.00006761255,0.08568588,0.0011955515,0.8955231,0.0035824678,0.0013041133],"about_ca_topic_score_codex":0.000045778164,"about_ca_topic_score_gemma":0.00002085769,"teacher_disagreement_score":0.61623204,"about_ca_system_score_codex":0.00007496942,"about_ca_system_score_gemma":0.00063810387,"threshold_uncertainty_score":0.99950534},"labels":[],"label_agreement":null},{"id":"W2953272544","doi":"","title":"A Bound on the Size of Separating Hash Families.","year":2007,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hash function; Perfect hash function; Upper and lower bounds; Collision resistance; Computer science; Mathematics; Theoretical computer science; Cryptographic hash function; Discrete mathematics; Combinatorics; Algorithm; Computer security","score_opus":0.015310997025844715,"score_gpt":0.24073128244675535,"score_spread":0.22542028542091064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953272544","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82597435,0.0002713381,0.07101024,0.00010483681,0.0015715843,0.0006824971,0.000079497724,0.00025203478,0.1000536],"genre_scores_gemma":[0.9921291,0.00009169268,0.007258983,0.00011136104,0.00018224731,0.00013846309,0.000016922575,0.00006359014,0.000007669469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776375,0.000328808,0.0007116285,0.00045671407,0.00023121608,0.0005078815],"domain_scores_gemma":[0.9962814,0.00233209,0.00023126183,0.001018476,0.000049712355,0.00008706522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008265266,0.00045966587,0.00071023754,0.00020352277,0.00012619628,0.00003240067,0.00073319714,0.00038898643,0.00013939518],"category_scores_gemma":[0.00023971644,0.000367839,0.0003487095,0.0001317594,0.0005278024,0.000021792268,0.00047154527,0.0015743893,0.00013336017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008169219,0.00005112591,0.0011564589,0.00038108503,0.00048670327,0.00003695108,0.0050445558,0.02383112,0.005399918,0.96137786,0.00086393545,0.0012885671],"study_design_scores_gemma":[0.00034674528,0.00008639833,0.005735864,0.0005164563,0.00007243894,0.00004066234,0.001343426,0.004548203,0.010107768,0.97345287,0.0031590378,0.0005901469],"about_ca_topic_score_codex":0.00003843635,"about_ca_topic_score_gemma":0.00008893552,"teacher_disagreement_score":0.1661547,"about_ca_system_score_codex":0.00005040247,"about_ca_system_score_gemma":0.00005642428,"threshold_uncertainty_score":0.99987733},"labels":[],"label_agreement":null},{"id":"W2953273138","doi":"","title":"Construction of a Hybrid (Hierarchical) Identity-Based Encryption Protocol Secure Against Adaptive Attacks.","year":2006,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Encryption; Probabilistic encryption; Multiple encryption; Protocol (science); Attribute-based encryption; Ciphertext; Computer security; Authentication protocol; Public-key cryptography; Bilinear interpolation; Theoretical computer science; Deterministic encryption; Key (lock)","score_opus":0.01562312116514008,"score_gpt":0.2779227232041006,"score_spread":0.2622996020389605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953273138","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029748892,0.000021333415,0.9393056,0.0003146736,0.0007154407,0.026007423,0.0007195608,0.00035440482,0.002812656],"genre_scores_gemma":[0.033689793,0.000012595045,0.94110346,0.00018057562,0.00019923209,0.024200281,0.00057628605,0.000037663933,1.3646371e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99424815,0.0010330848,0.0013223976,0.001863742,0.0007686548,0.00076396525],"domain_scores_gemma":[0.9953545,0.0004762506,0.0013604662,0.002192075,0.00036847376,0.00024827942],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007109877,0.00076656835,0.0011044069,0.0010125078,0.00027095314,0.00018913293,0.002587655,0.000445266,0.00004307436],"category_scores_gemma":[0.00013324502,0.00080734043,0.00075821753,0.0005363164,0.0015461593,0.00056478375,0.003311269,0.002271068,0.000047816484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027884785,0.0004838091,0.0026696278,0.00046744352,0.00015713237,0.00011906085,0.0005644995,0.002308015,0.00055466435,0.9824699,0.00040049115,0.009526472],"study_design_scores_gemma":[0.0012995487,0.00023634193,0.0042051952,0.0003505675,0.000049681934,0.00006433175,0.000037579768,0.03172436,0.0035381361,0.9562491,0.0015327267,0.00071242993],"about_ca_topic_score_codex":0.00017836444,"about_ca_topic_score_gemma":0.000279659,"teacher_disagreement_score":0.029416343,"about_ca_system_score_codex":0.00011801496,"about_ca_system_score_gemma":0.0007397617,"threshold_uncertainty_score":0.99943775},"labels":[],"label_agreement":null},{"id":"W2966457083","doi":"","title":"On MILP-Based Automatic Search for Differential Trails Through Modular Additions with Application to Bel-T.","year":2019,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Block cipher; Modular design; Differential (mechanical device); Computer science; Algorithm; Integer (computer science); Cipher; Lookup table; Mathematics; Arithmetic; Encryption; Cryptography; Programming language","score_opus":0.021723060791361007,"score_gpt":0.30596150979742404,"score_spread":0.28423844900606304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966457083","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1336299,0.0000070654914,0.8581508,0.0027582871,0.00033001226,0.0037796726,0.0008327174,0.00023216255,0.0002794097],"genre_scores_gemma":[0.4847192,0.00000354808,0.5115414,0.00048741215,0.000060900802,0.002387663,0.0007709561,0.000028146964,7.409332e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99664336,0.00026900705,0.00054669206,0.0014088725,0.00045434505,0.0006777469],"domain_scores_gemma":[0.99667233,0.00090940826,0.0002460621,0.0017905756,0.00020123408,0.00018036357],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023788231,0.00047551747,0.0006140529,0.00051639945,0.00035216266,0.00017155727,0.0014700756,0.00022101283,0.00011617822],"category_scores_gemma":[0.00003443105,0.0004387395,0.0003126391,0.00032609544,0.00020370916,0.0001067721,0.00076115225,0.00068536674,0.0001052205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008208407,0.00036731272,0.0001539081,0.00017840753,0.00015888104,0.000004376068,0.0028092472,0.02069579,0.0004886278,0.96829826,0.0006081595,0.00615497],"study_design_scores_gemma":[0.0013102946,0.0006610401,0.00709074,0.0001439926,0.00006791804,0.000008487303,0.00009734278,0.30740407,0.001329552,0.68048126,0.00082789076,0.00057739514],"about_ca_topic_score_codex":0.000103159495,"about_ca_topic_score_gemma":0.00024157487,"teacher_disagreement_score":0.3510893,"about_ca_system_score_codex":0.000098620105,"about_ca_system_score_gemma":0.0003957509,"threshold_uncertainty_score":0.99980646},"labels":[],"label_agreement":null},{"id":"W2978198527","doi":"","title":"There Are 10 Types of Vectors (and Polynomials): Efficient Zero-Knowledge Proofs of \"One-Hotness\" via Polynomials with One Zero.","year":2019,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Gas meter prover; Verifiable secret sharing; Mathematical proof; Zero-knowledge proof; Soundness; Computer science; Theoretical computer science; Protocol (science); Discrete mathematics; Bounded function; Cryptography; Mathematics; Algorithm","score_opus":0.017834018620228882,"score_gpt":0.24612121799265374,"score_spread":0.22828719937242486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978198527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40686867,0.0013867785,0.58830667,0.00015633651,0.00050672324,0.0010090331,0.00030325007,0.00009141584,0.0013711392],"genre_scores_gemma":[0.8745385,0.00014146636,0.12502225,0.000026568032,0.00007879917,0.00008441191,0.000061259256,0.000044144224,0.0000025980441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995583,0.00061587075,0.0010556573,0.0016172626,0.00043662326,0.00069157884],"domain_scores_gemma":[0.9946291,0.0008501865,0.0014919816,0.0024598106,0.00033213105,0.00023677608],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006936823,0.00070942467,0.0018644347,0.00067997613,0.00012996249,0.00007176013,0.0021859652,0.0005254514,0.00007586767],"category_scores_gemma":[0.0001258819,0.0006344993,0.00036180727,0.000397643,0.0012856398,0.00012655456,0.004372007,0.0009995985,0.000055733053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015287765,0.0025940866,0.040423114,0.0027848117,0.0016955903,0.0000352921,0.011281039,0.0038235276,0.012224369,0.91455644,0.00043617905,0.008616782],"study_design_scores_gemma":[0.0045767515,0.0018484929,0.2168787,0.0032360037,0.0006859215,0.00010334817,0.00029568103,0.00928211,0.070488356,0.68855625,0.0012304406,0.0028179386],"about_ca_topic_score_codex":0.0002675771,"about_ca_topic_score_gemma":0.0002352404,"teacher_disagreement_score":0.46766984,"about_ca_system_score_codex":0.000051129377,"about_ca_system_score_gemma":0.0004975502,"threshold_uncertainty_score":0.9996106},"labels":[],"label_agreement":null},{"id":"W2998305229","doi":"","title":"Pixel: Multi-signatures for Consensus","year":2019,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cognitive Computing and Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Pixel; Artificial intelligence","score_opus":0.03905652924994913,"score_gpt":0.3048837393283281,"score_spread":0.26582721007837895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998305229","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0106177805,0.00076367223,0.9781758,0.0015269906,0.004926062,0.0014856335,0.000094572046,0.00051857537,0.0018908659],"genre_scores_gemma":[0.16810372,0.000057191042,0.8302831,0.00081189466,0.00039976,0.00019589391,0.00007912621,0.000047834317,0.000021456692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99614877,0.00044913572,0.00057109,0.0017541936,0.00021561819,0.0008611876],"domain_scores_gemma":[0.9945209,0.0030030075,0.00046637436,0.0015002856,0.00032606628,0.00018333658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055875815,0.0005885002,0.000854871,0.00031123686,0.000211793,0.00015051328,0.002157458,0.0006024289,0.000012132555],"category_scores_gemma":[0.00043461358,0.00058884814,0.00051315455,0.00012088843,0.0003378172,0.000031553667,0.005170594,0.001786172,0.00017963506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014905355,0.0002544312,0.0013894582,0.00024584544,0.00045447063,0.00007511536,0.002048391,0.018815894,0.0006379959,0.9074875,0.009924786,0.058517072],"study_design_scores_gemma":[0.001138978,0.00013160569,0.004587199,0.00024063887,0.000047824713,0.000048528527,0.000028074155,0.43482962,0.00034124416,0.5499342,0.007923533,0.0007485208],"about_ca_topic_score_codex":0.000017166123,"about_ca_topic_score_gemma":0.000043738266,"teacher_disagreement_score":0.41601372,"about_ca_system_score_codex":0.00006051859,"about_ca_system_score_gemma":0.00040113615,"threshold_uncertainty_score":0.9996563},"labels":[],"label_agreement":null},{"id":"W3004260751","doi":"","title":"Quantum Cryptanalysis in the RAM Model: Claw-Finding Attacks on SIKE","year":2019,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Isogeny; Key encapsulation; Cryptanalysis; Computer science; Supersingular elliptic curve; Computation; Quantum computer; Quantum; Post-quantum cryptography; Cryptography; Algorithm; Theoretical computer science; Mathematics; Public-key cryptography; Elliptic curve; Key exchange; Computer security; Physics; Quantum mechanics","score_opus":0.033003109927307636,"score_gpt":0.29711682752191737,"score_spread":0.2641137175946097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004260751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13462551,0.00020671517,0.8520192,0.004006787,0.0009551397,0.0009089998,0.000027711798,0.0001748439,0.007075111],"genre_scores_gemma":[0.8358398,0.00026768705,0.16214627,0.0013269293,0.00011917076,0.00021777624,0.000038303686,0.00004061719,0.0000034519112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99408764,0.0012429203,0.00093160087,0.001932641,0.0007293786,0.0010758349],"domain_scores_gemma":[0.9940408,0.001753433,0.00052971183,0.003438007,0.0000838629,0.00015420269],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0013677739,0.00075196003,0.0011102296,0.0013780145,0.00028938768,0.00032113557,0.00516966,0.0006156719,0.000022677112],"category_scores_gemma":[0.00016788767,0.0005663624,0.00090737664,0.00080626714,0.000459265,0.00014516483,0.0032829195,0.0034024972,0.000280583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042806576,0.00022824838,0.0037891692,0.000062406914,0.00019476243,0.00013806515,0.004898612,0.19111082,0.000060904455,0.7967135,0.00040067476,0.0023600785],"study_design_scores_gemma":[0.00034934448,0.00008533241,0.0074745934,0.00011825514,0.000057498473,0.000029663033,0.00013584874,0.3809341,0.00006593799,0.6100948,0.00020821505,0.0004464303],"about_ca_topic_score_codex":0.00011828109,"about_ca_topic_score_gemma":0.0001884304,"teacher_disagreement_score":0.7012143,"about_ca_system_score_codex":0.00010465766,"about_ca_system_score_gemma":0.00032506703,"threshold_uncertainty_score":0.9996788},"labels":[],"label_agreement":null},{"id":"W3023248040","doi":"","title":"Using z14 Fused-Multiply-Add Instructions to Accelerate Elliptic Curve Cryptography.","year":2019,"lang":"en","type":"article","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Elliptic curve cryptography; Computer science; Elliptic curve; Cryptography; Hessian form of an elliptic curve; Curve25519; Elliptic Curve Digital Signature Algorithm; Elliptic curve point multiplication; Tripling-oriented Doche–Icart–Kohel curve; Mathematics; Public-key cryptography; Algorithm; Encryption; Computer security; Mathematical analysis","score_opus":0.023701994921431446,"score_gpt":0.2732117888300713,"score_spread":0.24950979390863987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023248040","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42052922,0.000059215974,0.5754974,0.0004232726,0.0010096662,0.00047989766,0.000009572603,0.00020638677,0.0017853932],"genre_scores_gemma":[0.3837208,0.000025947877,0.6156343,0.00045430276,0.00009010452,0.000041323423,0.000004638725,0.000025811742,0.0000027509327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99669886,0.00033755312,0.0005556289,0.0011370069,0.0003377921,0.000933135],"domain_scores_gemma":[0.99753237,0.000373094,0.00019544942,0.0013705353,0.00014555376,0.0003829754],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029594888,0.0004240373,0.0005237197,0.0010559731,0.00039119134,0.00019727652,0.0015252586,0.0001754515,0.00018318258],"category_scores_gemma":[0.00006206656,0.00040782287,0.0003706198,0.001497219,0.00030697664,0.00043847144,0.0009744072,0.000617534,0.0009227415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045576926,0.0001454625,0.047330856,0.000028144406,0.00014274157,0.00003801115,0.001951652,0.0028823165,0.022533312,0.91990536,0.00021276416,0.0047837975],"study_design_scores_gemma":[0.002128576,0.00052575296,0.14025277,0.00014611978,0.00007301907,0.0004754657,0.00046413695,0.036779672,0.008356653,0.7975305,0.0117739495,0.0014933894],"about_ca_topic_score_codex":0.0000902855,"about_ca_topic_score_gemma":0.00010565633,"teacher_disagreement_score":0.12237487,"about_ca_system_score_codex":0.00004395138,"about_ca_system_score_gemma":0.00013452173,"threshold_uncertainty_score":0.99985516},"labels":[],"label_agreement":null},{"id":"W3028641299","doi":"","title":"Group Testing and Batch Verification.","year":2009,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"SARS-CoV-2 detection and testing","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Group testing; Computer science; Group (periodic table); Sequential analysis; Algorithm; Mathematics; Statistics","score_opus":0.0507124555326922,"score_gpt":0.3078104836963907,"score_spread":0.2570980281636985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028641299","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8585142,0.00030452086,0.12312028,0.0007886827,0.0004448005,0.0007040298,0.000012285114,0.00043858564,0.015672654],"genre_scores_gemma":[0.4704757,0.000040032395,0.52738076,0.0015626792,0.00036438776,0.000092526636,0.000036246023,0.00004485659,0.0000028126528],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776644,0.00017600511,0.00053263805,0.00091854925,0.0001914508,0.0004149498],"domain_scores_gemma":[0.9979093,0.00081248075,0.0003200614,0.0006826653,0.00013979117,0.00013567288],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003496877,0.0003861069,0.00065937266,0.0003064768,0.00016242369,0.000043198295,0.00018322546,0.00036723207,0.000025604377],"category_scores_gemma":[0.0018679474,0.00038916367,0.00013535541,0.00015768263,0.00031572956,0.000033353677,0.0005133469,0.0015415933,0.000098723445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046169254,0.0005045027,0.11551856,0.0007790423,0.0004626832,0.0006180723,0.002481903,0.00004090444,0.48741075,0.18383631,0.000458457,0.20742711],"study_design_scores_gemma":[0.0015463667,0.00040801405,0.22967783,0.0006979099,0.00027998324,0.0019603854,0.00016440167,0.005432423,0.019900208,0.7371809,0.002105039,0.0006465598],"about_ca_topic_score_codex":0.00014196747,"about_ca_topic_score_gemma":0.000029583649,"teacher_disagreement_score":0.55334455,"about_ca_system_score_codex":0.00007429302,"about_ca_system_score_gemma":0.00015390322,"threshold_uncertainty_score":0.99985605},"labels":[],"label_agreement":null},{"id":"W3028657456","doi":"","title":"Mitigating Multi-Target Attacks in Hash-based Signatures.","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hash function; Stateful firewall; Computer science; Merkle tree; Stateless protocol; Hash chain; Cryptographic hash function; SHA-2; Merkle signature scheme; Signature (topology); Theoretical computer science; SWIFFT; Security of cryptographic hash functions; Hash tree; Double hashing; Algorithm; Digital signature; Mathematics; Computer security; Blind signature","score_opus":0.03576303966685685,"score_gpt":0.2996902907414388,"score_spread":0.263927251074582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028657456","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03420344,0.0007680682,0.95934594,0.0012375843,0.0014260253,0.0008366861,0.00031533587,0.0004067123,0.001460215],"genre_scores_gemma":[0.17327942,0.000023440334,0.82532394,0.0006405632,0.00012072053,0.00019139028,0.00038628755,0.000034006058,2.3736725e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99459743,0.00091136264,0.0009209709,0.0020237393,0.0004947443,0.0010517258],"domain_scores_gemma":[0.9957386,0.00073224417,0.00053655123,0.0023815262,0.00019781628,0.00041321124],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0011936704,0.0007428923,0.0010162636,0.00089211215,0.00016237605,0.00022244947,0.0035961028,0.00081276614,0.000047863206],"category_scores_gemma":[0.00051181467,0.0007812112,0.00042878446,0.00049373123,0.0006171476,0.00024913714,0.005165418,0.0035497698,0.00010958475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097151526,0.00080176006,0.031746134,0.0002562168,0.00013820596,0.00067811995,0.00628124,0.025098879,0.00054861035,0.927677,0.0026743794,0.00400232],"study_design_scores_gemma":[0.0013965693,0.00006874208,0.011960577,0.0002391323,0.000016070151,0.000015536223,0.00007432537,0.18215102,0.00088787044,0.80034447,0.002014648,0.00083103986],"about_ca_topic_score_codex":0.0002532076,"about_ca_topic_score_gemma":0.00087965274,"teacher_disagreement_score":0.15705213,"about_ca_system_score_codex":0.00013880333,"about_ca_system_score_gemma":0.0008824097,"threshold_uncertainty_score":0.99946386},"labels":[],"label_agreement":null},{"id":"W3028700067","doi":"","title":"Arithmetic of Generalized Jacobians.","year":2006,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptosystem; Discrete logarithm; Cryptography; Hyperelliptic curve cryptography; ElGamal encryption; Elliptic curve cryptography; Elliptic curve; Mathematics; Algebra over a field; Abelian group; Arithmetic; Logarithm; Algebraic number; Public-key cryptography; Computer science; Pure mathematics; Algorithm; Encryption; Mathematical analysis","score_opus":0.011387459190588659,"score_gpt":0.24218710650805877,"score_spread":0.2307996473174701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028700067","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073458806,0.0012139607,0.91686857,0.0011374617,0.0013696617,0.0005816258,0.000066427594,0.0002570682,0.005046403],"genre_scores_gemma":[0.1096656,0.00034082698,0.88942486,0.00018212704,0.00015525168,0.00012349179,0.00006632767,0.000036728274,0.0000047986623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958746,0.00058370136,0.0010071723,0.0013508584,0.00044731502,0.0007363588],"domain_scores_gemma":[0.99635553,0.0004445569,0.0006700093,0.0021704123,0.00017659602,0.00018287053],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043505646,0.0005917199,0.0011237296,0.00088027125,0.00013807276,0.00009635733,0.0028782445,0.0005279446,0.000046991707],"category_scores_gemma":[0.00007719626,0.00056867104,0.0007650176,0.00043845733,0.00082377694,0.000094267336,0.003963735,0.0012743339,0.000061177954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026700403,0.00028274397,0.004428885,0.00020055546,0.00024753463,0.00012976071,0.00083013315,0.0026255143,0.0013326032,0.9722069,0.0012235015,0.016465198],"study_design_scores_gemma":[0.0006755835,0.000091840964,0.03303908,0.00013433296,0.000080305654,0.0000791941,0.00001254488,0.009042796,0.003045271,0.95171237,0.0014958268,0.0005908513],"about_ca_topic_score_codex":0.00056706567,"about_ca_topic_score_gemma":0.00018655443,"teacher_disagreement_score":0.036206797,"about_ca_system_score_codex":0.000041195446,"about_ca_system_score_gemma":0.00032521025,"threshold_uncertainty_score":0.99967647},"labels":[],"label_agreement":null},{"id":"W3028706764","doi":"","title":"A New Message Recognition Protocol for Ad Hoc Pervasive Networks.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Protocol (science); Wireless ad hoc network; Hash function; Computer network; Flexibility (engineering); Ad hoc wireless distribution service; Mobile ad hoc network; Optimized Link State Routing Protocol; Vehicular ad hoc network; Distributed computing; Computer security; Routing protocol; Wireless; Network packet","score_opus":0.04686374443717315,"score_gpt":0.3052104172226314,"score_spread":0.25834667278545825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028706764","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043305525,0.00010748515,0.8681486,0.0014517382,0.001433477,0.1259441,0.00005807489,0.0006705308,0.0017529167],"genre_scores_gemma":[0.00027129348,0.00028904024,0.7397109,0.0005658697,0.0009135095,0.25797418,0.0001766596,0.000088454544,0.000010077493],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940772,0.0006709944,0.0010932776,0.002345665,0.00046206574,0.0013507697],"domain_scores_gemma":[0.99434286,0.0015354016,0.0010026868,0.0022770108,0.0003595841,0.00048243266],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00041072286,0.00097025017,0.0012513301,0.00040992605,0.00037880937,0.00024404161,0.003278964,0.001105195,0.000090687754],"category_scores_gemma":[0.00027116353,0.0010369414,0.00076557684,0.00028779788,0.0003968531,0.00025661095,0.0041253,0.0024627068,0.00018327015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013771587,0.00066214154,0.00034920112,0.0007809444,0.0009686917,0.0007227044,0.014622767,0.03886624,0.000087371925,0.32689294,0.07901312,0.5356567],"study_design_scores_gemma":[0.0026463564,0.00036797786,0.0005687685,0.00060288183,0.000056171197,0.00036764203,0.000052042367,0.16467369,0.0003108918,0.79974735,0.029295038,0.0013112236],"about_ca_topic_score_codex":0.00004565775,"about_ca_topic_score_gemma":0.0001461253,"teacher_disagreement_score":0.5343455,"about_ca_system_score_codex":0.00020198998,"about_ca_system_score_gemma":0.00082457566,"threshold_uncertainty_score":0.99983865},"labels":[],"label_agreement":null},{"id":"W3028759481","doi":"","title":"Faster Explicit Formulas for Computing Pairings over Ordinary Curves.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Exponentiation; Parameterized complexity; Pairing; Elliptic curve; Computer science; Computation; Cryptography; Context (archaeology); Quadratic equation; Arithmetic; Mathematics; Theoretical computer science; Algebra over a field; Algorithm; Pure mathematics","score_opus":0.01729256799778458,"score_gpt":0.2769583647404634,"score_spread":0.25966579674267887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028759481","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079814486,0.000557685,0.91066736,0.002769072,0.0027709596,0.001566078,0.000055584354,0.00044688213,0.0013518997],"genre_scores_gemma":[0.10743612,0.00021621384,0.8894999,0.0018654483,0.00045731117,0.00035033014,0.00009299726,0.000073298026,0.000008386706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955917,0.00023476435,0.0008611189,0.0018186118,0.00037207088,0.0011217099],"domain_scores_gemma":[0.99577737,0.0010972688,0.0005952917,0.002046427,0.000189599,0.00029402372],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0007297296,0.00074160885,0.0010155643,0.00057822483,0.0003901031,0.00019767061,0.002991212,0.0006658053,0.000043063752],"category_scores_gemma":[0.00017257387,0.0007055166,0.0008880939,0.0002565184,0.00038082074,0.00022240856,0.0068827774,0.0023948036,0.00006106886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006502072,0.0002464469,0.0044374033,0.0010803028,0.00032775308,0.00008919362,0.0023460498,0.00029535472,0.0010438603,0.9578611,0.005182115,0.027025376],"study_design_scores_gemma":[0.0010150197,0.00020160121,0.02137522,0.00082346535,0.00009346955,0.00015993106,0.000035663907,0.058593016,0.00082221,0.9039828,0.011798877,0.0010986901],"about_ca_topic_score_codex":0.000073086325,"about_ca_topic_score_gemma":0.000074432384,"teacher_disagreement_score":0.05829766,"about_ca_system_score_codex":0.00004422164,"about_ca_system_score_gemma":0.00023551588,"threshold_uncertainty_score":0.9999067},"labels":[],"label_agreement":null},{"id":"W3028816036","doi":"","title":"Interactive two-channel message authentication based on interactive-collision Resistant hash functions.","year":2007,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Hash function; Computer network; Message authentication code; Authentication (law); Channel (broadcasting); Key (lock); Hash chain; Computer security; Protocol (science); Cryptography","score_opus":0.020518862799601734,"score_gpt":0.32332860402302777,"score_spread":0.302809741223426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028816036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063425996,0.000026611953,0.97563607,0.0021242693,0.0020894774,0.006830239,0.00012570187,0.0005887586,0.006236273],"genre_scores_gemma":[0.68955463,0.000008383059,0.3047383,0.0006790781,0.00016079348,0.0045375414,0.0002267729,0.0000708842,0.000023619154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99360853,0.0010856697,0.0012172491,0.0024609263,0.00078106986,0.00084654766],"domain_scores_gemma":[0.9924044,0.002188273,0.0014187965,0.0031133795,0.00055175426,0.00032336643],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0011321517,0.00084488705,0.00085622404,0.0012331007,0.00043790115,0.00026401159,0.0024901542,0.0004383533,0.00012495441],"category_scores_gemma":[0.00086779206,0.00086482166,0.00045946788,0.00048194212,0.0004949061,0.0005207412,0.003249266,0.0027842605,0.0006959859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014915802,0.0014016649,0.00014412064,0.00014983327,0.00020529893,0.000114567076,0.0066977977,0.017162442,0.0028910695,0.9611124,0.00018972043,0.008439542],"study_design_scores_gemma":[0.0011590683,0.00027550658,0.0036260101,0.00055998034,0.000049350525,0.000016186978,0.00018405732,0.20423554,0.008385792,0.78005147,0.0007605115,0.0006965495],"about_ca_topic_score_codex":0.00004044182,"about_ca_topic_score_gemma":0.000084246494,"teacher_disagreement_score":0.68321204,"about_ca_system_score_codex":0.0007102853,"about_ca_system_score_gemma":0.00046456166,"threshold_uncertainty_score":0.99951637},"labels":[],"label_agreement":null},{"id":"W3028849184","doi":"","title":"Slope packings and coverings, and generic algorithms for the discrete logarithm problem.","year":2001,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Logarithm; Affine transformation; Prime (order theory); Mathematics; Discrete logarithm; Order (exchange); Set (abstract data type); Point (geometry); Plane (geometry); Combinatorics; Algorithm; Discrete mathematics; Computer science; Geometry; Mathematical analysis","score_opus":0.02678645473209214,"score_gpt":0.2749037115644977,"score_spread":0.24811725683240557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028849184","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009642498,0.0011820794,0.9823922,0.0045598396,0.00062780315,0.0010111923,0.000047608613,0.00009041617,0.00044637188],"genre_scores_gemma":[0.025196822,0.0013795645,0.9719723,0.000604351,0.00032394755,0.0004022705,0.00007836857,0.000022285565,0.00002011826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979919,0.00013025079,0.00035274462,0.00095960934,0.0001850843,0.00038041253],"domain_scores_gemma":[0.99820477,0.0007953733,0.00025229694,0.0005136145,0.00011486807,0.00011910693],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044227525,0.00033042132,0.00036938212,0.00017235498,0.000368912,0.00028390955,0.00065640354,0.00017432215,0.000006531682],"category_scores_gemma":[0.000084661115,0.0002620218,0.000103007595,0.00014566703,0.00030497566,0.00013473498,0.002616213,0.00048422685,0.0000050165595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003505837,0.00003490206,0.00075952953,0.000115108094,0.00018248882,0.000019667426,0.0018624562,0.011926323,0.00024844732,0.77061206,0.0006011572,0.21360278],"study_design_scores_gemma":[0.00040761734,0.00009660164,0.008009484,0.000037819023,0.000042040174,0.0001985548,0.00002865539,0.274726,0.00015377275,0.6988255,0.017150473,0.0003234769],"about_ca_topic_score_codex":0.00005285208,"about_ca_topic_score_gemma":0.000046345278,"teacher_disagreement_score":0.26279968,"about_ca_system_score_codex":0.000030884592,"about_ca_system_score_gemma":0.00014294962,"threshold_uncertainty_score":0.9999832},"labels":[],"label_agreement":null},{"id":"W3028858620","doi":"","title":"Torus-based compression by factor 4 and 6.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Torus; Exponentiation; Pairing; Compression (physics); Computer science; Factor (programming language); Lossless compression; Algorithm; Mathematics; Data compression; Theoretical computer science; Physics; Mathematical analysis; Geometry","score_opus":0.009356381829438497,"score_gpt":0.24669706662836688,"score_spread":0.2373406847989284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028858620","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22244526,0.00045399216,0.77297586,0.0015961458,0.0011773278,0.00041461753,0.00010344901,0.00024918767,0.0005841179],"genre_scores_gemma":[0.37180406,0.00014806693,0.62729806,0.00045635313,0.000099488025,0.00009811506,0.00006424,0.00002965979,0.0000019639524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970642,0.00032713116,0.00044634106,0.0013017424,0.00029523682,0.00056536694],"domain_scores_gemma":[0.9973028,0.0006272417,0.00030041448,0.0014485858,0.00007128722,0.0002496811],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019723763,0.00049995893,0.00060840097,0.00034079756,0.00025422405,0.00019587306,0.0016419892,0.0006254065,0.00006807351],"category_scores_gemma":[0.00007284744,0.00044266132,0.00024874488,0.00012793069,0.0006708394,0.00009514877,0.0032834641,0.002154192,0.000038879218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000913598,0.00044130633,0.018396115,0.00027986438,0.00021215325,0.00012776731,0.0021312581,0.0002198,0.03603153,0.8764433,0.0034861374,0.062139392],"study_design_scores_gemma":[0.0010248525,0.00016121613,0.04991248,0.00019002477,0.000040374394,0.00005243811,0.00001825218,0.02865193,0.011931782,0.8940004,0.012943348,0.0010729067],"about_ca_topic_score_codex":0.000078807585,"about_ca_topic_score_gemma":0.000059545888,"teacher_disagreement_score":0.1493588,"about_ca_system_score_codex":0.000018281255,"about_ca_system_score_gemma":0.00017264558,"threshold_uncertainty_score":0.99980253},"labels":[],"label_agreement":null},{"id":"W3028868347","doi":"","title":"Construction of Universal Designated-Verifier Signatures and Identity-Based Signatures from Standard Signatures.","year":2007,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Signature (topology); Identity (music); Ring signature; Computer science; Scheme (mathematics); Class (philosophy); Cryptography; Theoretical computer science; Computer security; Digital signature; Mathematics; Physics; Artificial intelligence","score_opus":0.011091837605074205,"score_gpt":0.26113453190413816,"score_spread":0.25004269429906395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028868347","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10325809,0.0024597812,0.8895112,0.00024537556,0.0014596324,0.00066558673,0.0014980064,0.00028239065,0.00061991136],"genre_scores_gemma":[0.3173756,0.00028547246,0.68151265,0.0002460493,0.00012244153,0.000018138388,0.00040917622,0.000030333998,1.1566486e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951339,0.0007210337,0.0008436918,0.001795465,0.0007906936,0.00071522425],"domain_scores_gemma":[0.9955158,0.0013751318,0.00085287465,0.0015778953,0.0003555486,0.00032274824],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0007649247,0.000767279,0.0011327603,0.0011468341,0.00026872993,0.00023167199,0.0022419582,0.0013734889,0.00011267429],"category_scores_gemma":[0.00019811759,0.00079490594,0.0004398517,0.00050345034,0.0018083842,0.000525462,0.0027977421,0.0030467976,0.000006767845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064934744,0.00012861114,0.0019134872,0.00015561217,0.00040739853,0.0002180003,0.0012923504,0.0023678825,0.0065351897,0.98094803,0.0005752816,0.004808791],"study_design_scores_gemma":[0.0012773963,0.0001930164,0.009711461,0.0002471068,0.00014893498,0.000011601777,0.00017217807,0.0049501127,0.014540216,0.96676314,0.0011818814,0.00080293673],"about_ca_topic_score_codex":0.00045842503,"about_ca_topic_score_gemma":0.00051056745,"teacher_disagreement_score":0.21411751,"about_ca_system_score_codex":0.000096934,"about_ca_system_score_gemma":0.0005851213,"threshold_uncertainty_score":0.99992293},"labels":[],"label_agreement":null},{"id":"W3028888920","doi":"","title":"Time-Memory-Data Trade-off Attack on Stream Ciphers based on Maiorana-McFarland Functions.","year":2007,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stream cipher; Computer science; Correlation attack; Filter (signal processing); Generalization; Stream cipher attack; Slide attack; Algorithm; Function (biology); Cryptanalysis; Arithmetic; Cryptography; Mathematics; Computer vision","score_opus":0.054263718897311304,"score_gpt":0.3296247709428766,"score_spread":0.2753610520455653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028888920","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051488623,0.00007277179,0.9197054,0.0047826897,0.0018366037,0.0013165977,0.0012513438,0.0004737398,0.019072255],"genre_scores_gemma":[0.43205765,0.00021130951,0.552318,0.0066305012,0.0009421466,0.00040748314,0.007202842,0.00019147417,0.000038637994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994287,0.000605579,0.00092050235,0.0024319305,0.00074738363,0.0010076124],"domain_scores_gemma":[0.99299127,0.0012529688,0.00050094695,0.004805753,0.00008115819,0.0003679082],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011019731,0.00079629145,0.0008245407,0.0011163445,0.00048747726,0.00024339033,0.0035844403,0.0004845318,0.0006668224],"category_scores_gemma":[0.00012419418,0.000792963,0.00040791492,0.0005184705,0.00059141143,0.0001816823,0.0025780047,0.002039428,0.0005975076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012139028,0.0041701975,0.006951537,0.00031069273,0.0012662156,0.00092995074,0.005279555,0.055350263,0.00018578512,0.5163539,0.12301916,0.28496885],"study_design_scores_gemma":[0.0061431346,0.001924389,0.05264187,0.0004936418,0.00035220137,0.00011568431,0.0008216276,0.6549224,0.00032748503,0.1815294,0.097315714,0.003412454],"about_ca_topic_score_codex":0.00010512411,"about_ca_topic_score_gemma":0.00045947454,"teacher_disagreement_score":0.5995721,"about_ca_system_score_codex":0.00014744354,"about_ca_system_score_gemma":0.00045469502,"threshold_uncertainty_score":0.9994521},"labels":[],"label_agreement":null},{"id":"W3028900811","doi":"","title":"A Critical Analysis and Improvement of AACS Drive-Host Authentication.","year":2007,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scheme (mathematics); Authentication (law); Host (biology); Computer science; Key (lock); Computer security; Security analysis; Mathematics","score_opus":0.01387771342801337,"score_gpt":0.3248150463866049,"score_spread":0.31093733295859155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028900811","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024101906,0.00009171411,0.97103125,0.0011405604,0.00024820436,0.0027276212,0.00006264997,0.00013035431,0.0004657686],"genre_scores_gemma":[0.45143354,0.000033464126,0.54750115,0.00011562637,0.000027789822,0.00085223594,0.000022124592,0.000012704548,0.0000013674198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964708,0.00021575377,0.0010032672,0.0013570958,0.00042624408,0.0005268545],"domain_scores_gemma":[0.9957737,0.00097366143,0.0006158601,0.0019833667,0.00040395194,0.0002495037],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068123365,0.00039396365,0.00082528475,0.0008504082,0.00013048203,0.00008974979,0.001557154,0.00029200854,0.000053456508],"category_scores_gemma":[0.00059707876,0.00040893664,0.00031968034,0.0005332197,0.0010417624,0.00017077746,0.0046674814,0.0008274377,0.000028924227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020510677,0.00025355772,0.004722058,0.00017440386,0.00046181798,0.000012353176,0.0030872128,0.000065346765,0.004093079,0.9810946,0.0000049629457,0.006010119],"study_design_scores_gemma":[0.00025183515,0.00008877551,0.043751545,0.000052017458,0.00029032017,0.000008287151,0.00005755592,0.020514814,0.008751159,0.9257915,0.00010581593,0.00033637867],"about_ca_topic_score_codex":0.00003896824,"about_ca_topic_score_gemma":0.000053929427,"teacher_disagreement_score":0.42733163,"about_ca_system_score_codex":0.00007609981,"about_ca_system_score_gemma":0.00018939753,"threshold_uncertainty_score":0.99983627},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.052561129804363366,"score_gpt":0.30472040432627984,"score_spread":0.25215927452191644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028966272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016124748,0.00062559725,0.97007513,0.001002555,0.0076120477,0.0020761495,0.000044159326,0.0006430576,0.0017965577],"genre_scores_gemma":[0.56895334,0.000012266489,0.42864278,0.00021700382,0.000860978,0.0010833502,0.00019602005,0.00003243733,0.0000018161495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957483,0.0008886601,0.00081175065,0.0013237922,0.0005474728,0.00068002153],"domain_scores_gemma":[0.9957123,0.0008771957,0.0007952811,0.0018194983,0.0005938988,0.0002018583],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023670536,0.0004687889,0.0006230076,0.00032237472,0.00041828668,0.00021258139,0.0018198014,0.00053403765,0.00004093385],"category_scores_gemma":[0.00029985845,0.00050123397,0.00038768063,0.00020951638,0.00013251664,0.00025343808,0.0022163934,0.0009451629,0.00020995761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050957082,0.00008845448,0.0004803452,0.00048867275,0.00019916917,0.0000019901252,0.0038609246,0.0036627317,0.00013279235,0.980966,0.00085162866,0.009216352],"study_design_scores_gemma":[0.00076369185,0.00006641769,0.0041314755,0.00023867695,0.00016942556,0.00005741177,0.0002767448,0.3362223,0.00037484165,0.6536074,0.0035543288,0.00053730316],"about_ca_topic_score_codex":0.000036218953,"about_ca_topic_score_gemma":0.000028254906,"teacher_disagreement_score":0.5528286,"about_ca_system_score_codex":0.0003481032,"about_ca_system_score_gemma":0.0005680732,"threshold_uncertainty_score":0.99974394},"labels":[],"label_agreement":null},{"id":"W3028978996","doi":"","title":"On prime-order elliptic curves with embedding degrees k=3, 4 and 6.","year":2007,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Elliptic curve; Prime (order theory); Embedding; Mathematics; Order (exchange); Diophantine equation; Discriminant; Supersingular elliptic curve; Heuristic; Schoof's algorithm; Pure mathematics; Discrete mathematics; Combinatorics; Computer science; Quarter period; Mathematical optimization","score_opus":0.01160623668200747,"score_gpt":0.26478701677389266,"score_spread":0.25318078009188516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028978996","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05830111,0.0019352215,0.9311846,0.0015710839,0.0004795727,0.00067323283,0.000017886245,0.00027767164,0.0055596605],"genre_scores_gemma":[0.09206482,0.0015938989,0.9052911,0.0007809638,0.00010395965,0.000083893974,0.0000307361,0.00004437386,0.0000063029906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964226,0.00029791423,0.0005418278,0.0015520314,0.00042652912,0.00075912895],"domain_scores_gemma":[0.9964997,0.0012701724,0.00037911563,0.0014602165,0.00012985257,0.0002609487],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005996621,0.0006125548,0.0007190847,0.000699649,0.0002445335,0.00015079905,0.0013351496,0.000329587,0.000018856103],"category_scores_gemma":[0.00016263682,0.0004894242,0.00017348822,0.00036719133,0.0007948141,0.00011249165,0.0023042308,0.0016224453,0.000052988256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001722754,0.00021705034,0.0033174146,0.00036569568,0.0003482267,0.0003500112,0.002019549,0.003597133,0.00008141417,0.97541624,0.00033243783,0.013782527],"study_design_scores_gemma":[0.0013341499,0.00073022925,0.038685407,0.0023673046,0.00014871624,0.00050736894,0.0000960994,0.024916619,0.00091553736,0.9279449,0.0009321377,0.0014215299],"about_ca_topic_score_codex":0.000050919454,"about_ca_topic_score_gemma":0.00010746689,"teacher_disagreement_score":0.047471367,"about_ca_system_score_codex":0.000033324814,"about_ca_system_score_gemma":0.00020851943,"threshold_uncertainty_score":0.99975574},"labels":[],"label_agreement":null},{"id":"W3029154524","doi":"","title":"Watch your Constants: Malicious Streebog.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hash function; SHA-2; Collision attack; Computer science; Checksum; Cryptographic hash function; GOST (hash function); Hash chain; Computer security; Function (biology); Collision; Context (archaeology); MD5; Collision resistance; Theoretical computer science; Double hashing; Operating system","score_opus":0.026266463109717864,"score_gpt":0.30398204534666295,"score_spread":0.2777155822369451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029154524","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11046333,0.000072275536,0.87501824,0.0054849563,0.0015790239,0.0006869397,0.00016174432,0.00039030914,0.006143185],"genre_scores_gemma":[0.49528623,0.00015721587,0.5030515,0.0008893247,0.00020871998,0.00020646819,0.00016098499,0.00003557879,0.000003930045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99564236,0.0005666603,0.00090288,0.001521176,0.00044136384,0.0009255854],"domain_scores_gemma":[0.9962669,0.00047078994,0.0005333343,0.0022542204,0.00019001245,0.0002847516],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057699083,0.0006205645,0.00085297547,0.00039239542,0.0003255236,0.00026680215,0.0026664992,0.0003901132,0.0001530868],"category_scores_gemma":[0.000097648,0.0006216682,0.00042942713,0.00032968083,0.00059334247,0.00012846295,0.0047684056,0.0014599492,0.00021624609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016636743,0.00012708097,0.005182409,0.00006516268,0.00018016067,0.000090022295,0.0039934386,0.00018265234,0.00012710721,0.97521484,0.0026645465,0.012155935],"study_design_scores_gemma":[0.000673661,0.00010468864,0.0065206694,0.00006846996,0.000046964054,0.00011429764,0.00023489202,0.009457427,0.00021361643,0.96820706,0.01367267,0.0006855557],"about_ca_topic_score_codex":0.0005743027,"about_ca_topic_score_gemma":0.0008602223,"teacher_disagreement_score":0.3848229,"about_ca_system_score_codex":0.000070711736,"about_ca_system_score_gemma":0.00033024183,"threshold_uncertainty_score":0.9996235},"labels":[],"label_agreement":null},{"id":"W3029155370","doi":"","title":"How to Efficiently Evaluate RAM Programs with Malicious Security.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Overhead (engineering); Protocol (science); Oblivious transfer; State (computer science); Computer security; Cryptography; Operating system; Algorithm","score_opus":0.014500793030646757,"score_gpt":0.25511020854317995,"score_spread":0.2406094155125332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029155370","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14665897,0.00010932378,0.84206814,0.005522667,0.0010914102,0.0021282814,0.00012679555,0.0007133022,0.0015811209],"genre_scores_gemma":[0.3131548,0.000032017157,0.6846742,0.00080832955,0.00026900342,0.00071943086,0.00028091157,0.000059596296,0.0000017509191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932249,0.0009088372,0.00063140027,0.0028564602,0.00092172634,0.0014566404],"domain_scores_gemma":[0.9939827,0.00037857372,0.0005410832,0.0040350244,0.00034534308,0.0007173065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010974589,0.001010555,0.0012240349,0.0007478039,0.00032395255,0.0010191266,0.0046476354,0.00051271927,0.000018745855],"category_scores_gemma":[0.00018462152,0.0008748693,0.00046165724,0.00066352997,0.0006945601,0.0002271027,0.007928518,0.0020330676,0.00018121333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018054708,0.00046595006,0.0022123975,0.00020802791,0.00027131854,0.00018714016,0.0064648325,0.0015886747,0.00007385565,0.96626914,0.00115916,0.020918945],"study_design_scores_gemma":[0.0011310078,0.0010690762,0.0026510113,0.00032542733,0.00012201483,0.00025247864,0.0001459839,0.01989995,0.00040170952,0.9429048,0.029581448,0.001515095],"about_ca_topic_score_codex":0.00010482708,"about_ca_topic_score_gemma":0.0005966768,"teacher_disagreement_score":0.16649581,"about_ca_system_score_codex":0.000092568764,"about_ca_system_score_gemma":0.0003927076,"threshold_uncertainty_score":0.9993702},"labels":[],"label_agreement":null},{"id":"W3029166298","doi":"","title":"Novel Precomputation Schemes for Elliptic Curve Cryptosystems.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scalar multiplication; Precomputation; Elliptic curve point multiplication; Hessian form of an elliptic curve; Elliptic curve; Elliptic curve cryptography; Scalar (mathematics); Tripling-oriented Doche–Icart–Kohel curve; Computer science; Mathematics; Edwards curve; Elliptic Curve Digital Signature Algorithm; Schoof's algorithm; Supersingular elliptic curve; Arithmetic; Algebra over a field; Algorithm; Pure mathematics; Computation; Quarter period; Public-key cryptography; Geometry; Encryption","score_opus":0.02837152545129713,"score_gpt":0.27378431487922866,"score_spread":0.24541278942793154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029166298","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019228866,0.00065562245,0.9723968,0.0010171724,0.0028284667,0.0020535418,0.000115022485,0.00053750444,0.0011670054],"genre_scores_gemma":[0.0737483,0.00037337723,0.9243019,0.00018257428,0.000398726,0.0007774709,0.00015396682,0.00005977938,0.000003896044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954309,0.00031284383,0.0010144244,0.0018843507,0.00041764023,0.0009398732],"domain_scores_gemma":[0.9957497,0.0012690596,0.0007405,0.0016426957,0.00033067627,0.0002673286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004960738,0.00074084906,0.0010388559,0.0007878896,0.00042759874,0.00021093407,0.002424584,0.00061995815,0.000010300886],"category_scores_gemma":[0.00022041716,0.00073482114,0.0008115786,0.00034933843,0.00047834165,0.00021375401,0.0025211237,0.0011868892,0.0000991245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057586392,0.00035423075,0.0011041191,0.0004883396,0.00043426242,0.000033875465,0.0026895981,0.006286451,0.001037348,0.97272485,0.00083562406,0.013953702],"study_design_scores_gemma":[0.0013687707,0.00022060546,0.005002032,0.0003058853,0.00008646307,0.0003547416,0.000057741094,0.15290895,0.0017444862,0.8247711,0.012070101,0.0011091086],"about_ca_topic_score_codex":0.00006726198,"about_ca_topic_score_gemma":0.000043844888,"teacher_disagreement_score":0.14795375,"about_ca_system_score_codex":0.00008873557,"about_ca_system_score_gemma":0.00048628188,"threshold_uncertainty_score":0.9995103},"labels":[],"label_agreement":null},{"id":"W3029195716","doi":"","title":"Minimal Weight and Colexicographically Minimal Integer Representations.","year":2006,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Dimension (graph theory); Discrete mathematics; Integer (computer science); Set (abstract data type); Representation (politics); Minimal models; Arithmetic; Combinatorics; Algebra over a field; Computer science; Pure mathematics","score_opus":0.010194408987092101,"score_gpt":0.25299158542631034,"score_spread":0.24279717643921825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029195716","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12565157,0.0008273866,0.85749865,0.0044485284,0.001135633,0.00068518263,0.000058713285,0.00033676537,0.00935758],"genre_scores_gemma":[0.21828227,0.00027943685,0.7804021,0.00038107578,0.0002506587,0.00026900868,0.00008543371,0.000040206363,0.000009800965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99540997,0.00055974367,0.0008826674,0.0019358873,0.000424613,0.00078714377],"domain_scores_gemma":[0.9966149,0.00088544696,0.00043961924,0.0015890409,0.00016839402,0.0003026493],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039366214,0.0006421389,0.0008130527,0.0010186844,0.00036936978,0.00030655443,0.0018212111,0.0005884325,0.00003933598],"category_scores_gemma":[0.000120017656,0.00061268127,0.0004995004,0.00048568516,0.0017389326,0.00017575924,0.004805421,0.0017127247,0.000044989607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076368975,0.00028321135,0.041465275,0.00010717174,0.00027812482,0.00032386175,0.0012786376,0.00012440518,0.00040754324,0.9427334,0.002696156,0.01022586],"study_design_scores_gemma":[0.0005998398,0.00013355953,0.24377213,0.00010198492,0.00008012651,0.00020994541,0.000049266033,0.005270423,0.00032649818,0.74721307,0.0016064461,0.0006367277],"about_ca_topic_score_codex":0.00025441888,"about_ca_topic_score_gemma":0.00024585114,"teacher_disagreement_score":0.20230685,"about_ca_system_score_codex":0.000028671686,"about_ca_system_score_gemma":0.0002281371,"threshold_uncertainty_score":0.9996325},"labels":[],"label_agreement":null},{"id":"W3029231014","doi":"","title":"Multicollision Attacks on some Generalized Sequential Hash Functions.","year":2006,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hash function; Collision attack; SHA-2; Iterated function; Computer science; Cryptographic hash function; Double hashing; Hash chain; Collision resistance; Set (abstract data type); MDC-2; Class (philosophy); Function (biology); Theoretical computer science; Mathematics; Computer security; Programming language; Artificial intelligence","score_opus":0.03238088409572054,"score_gpt":0.3096803961251157,"score_spread":0.2772995120293952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029231014","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2472932,0.00007803845,0.7450352,0.0020303258,0.0028784866,0.00081620784,0.00020595266,0.00034029616,0.0013223309],"genre_scores_gemma":[0.20136927,0.00014986667,0.79449886,0.0014428124,0.0006524611,0.00062109943,0.0011767261,0.00006698442,0.00002192639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99548787,0.0006233458,0.00091061275,0.0016440907,0.0005376574,0.0007964396],"domain_scores_gemma":[0.9969089,0.00036902056,0.00048783168,0.0018658977,0.00015811376,0.0002102413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044058592,0.00063151726,0.0007258692,0.0008364646,0.0005351655,0.0003372048,0.0016288393,0.0004355939,0.00015818894],"category_scores_gemma":[0.000060245013,0.00063262845,0.0005805476,0.0002884852,0.0003617117,0.00021363623,0.003112383,0.0013967825,0.00029016228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006278873,0.00038090782,0.0017092373,0.000041493407,0.00016138701,0.00008269729,0.0008218625,0.005525068,0.00057179044,0.9729753,0.010662029,0.0070054177],"study_design_scores_gemma":[0.0017509122,0.00018639112,0.014545758,0.00007526953,0.0000720488,0.00004199267,0.000035356123,0.041199524,0.0006545684,0.9275559,0.013042788,0.00083945884],"about_ca_topic_score_codex":0.00063098833,"about_ca_topic_score_gemma":0.00047524262,"teacher_disagreement_score":0.049463693,"about_ca_system_score_codex":0.00015139862,"about_ca_system_score_gemma":0.00030381614,"threshold_uncertainty_score":0.9996125},"labels":[],"label_agreement":null},{"id":"W3029282397","doi":"","title":"Efficient compression of SIDH public keys.","year":2016,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Isogeny; Computer science; Key exchange; Public-key cryptography; Code (set theory); Key (lock); Relation (database); Theoretical computer science; Computer security; Mathematics; Encryption; Data mining; Elliptic curve; Programming language","score_opus":0.015825634968233023,"score_gpt":0.2524301338346112,"score_spread":0.2366044988663782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029282397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1476442,0.00023156544,0.841932,0.0045802416,0.0018640753,0.00040729187,0.000052389456,0.0003117346,0.002976482],"genre_scores_gemma":[0.5355124,0.000020705424,0.46402255,0.00015016398,0.00021056044,0.00003737073,0.000014240909,0.000029368097,0.0000026654589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99573416,0.00064519705,0.0008329506,0.0014406233,0.0005182766,0.00082878006],"domain_scores_gemma":[0.99569637,0.0008691078,0.0007954395,0.0021570064,0.00020356331,0.00027852578],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00053338567,0.0005636635,0.00093956036,0.00055690005,0.00020035674,0.0000974882,0.0033761053,0.0003838181,0.000040549727],"category_scores_gemma":[0.00019246919,0.00042323896,0.00043713354,0.00021322083,0.000606428,0.00003660017,0.010277218,0.0013000421,0.00009966827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000230233,0.00026720075,0.0008633838,0.00015046244,0.00013970377,0.00006906097,0.0017817592,0.024176579,0.0027319647,0.9111807,0.0005419965,0.058074214],"study_design_scores_gemma":[0.0004379053,0.0000911233,0.0041791936,0.00039193552,0.000013019447,0.00006140805,0.000010164558,0.3848108,0.0015135587,0.6067566,0.0012872254,0.00044705757],"about_ca_topic_score_codex":0.000021063173,"about_ca_topic_score_gemma":0.000005415728,"teacher_disagreement_score":0.3878682,"about_ca_system_score_codex":0.00005622653,"about_ca_system_score_gemma":0.0003894766,"threshold_uncertainty_score":0.99982196},"labels":[],"label_agreement":null},{"id":"W3029397037","doi":"","title":"Password Mistyping in Two-Factor-Authenticated Key Exchange.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Bell (Canada)","funders":"","keywords":"Authenticated Key Exchange; Computer science; Password; Credential; Computer security; Key exchange; Authentication (law); Biometrics; Cryptography; Provable security; Theoretical computer science; Computer network; Public-key cryptography; Encryption","score_opus":0.0327911101868972,"score_gpt":0.2961967332374158,"score_spread":0.2634056230505186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029397037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23224013,0.00037849776,0.7567925,0.0027148854,0.0020756873,0.0009929866,0.00003929167,0.00047196195,0.0042940667],"genre_scores_gemma":[0.92603385,0.00039444453,0.07261921,0.0003743279,0.0001714165,0.00026052387,0.00007761379,0.000046499303,0.000022133425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952068,0.00090544345,0.0010227967,0.0015812012,0.00042642787,0.0008573506],"domain_scores_gemma":[0.99652356,0.00042151927,0.00051908416,0.0021331273,0.00013276246,0.00026997188],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000419428,0.0005808894,0.0009226836,0.00079745235,0.00015794302,0.0001705312,0.002845328,0.00034485594,0.00008607927],"category_scores_gemma":[0.00016665227,0.0006166409,0.00030965533,0.00036982677,0.00032828056,0.00015394331,0.0034747806,0.0015731589,0.0006353202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005219376,0.00057771744,0.017301688,0.0003971043,0.0002834545,0.0005262126,0.2913292,0.000108028835,0.0007411929,0.67369866,0.0008754664,0.014109087],"study_design_scores_gemma":[0.0016298912,0.000053471704,0.052377295,0.00048604817,0.000029723738,0.00024729388,0.00020431877,0.18095103,0.00063782244,0.7512574,0.010720184,0.0014055287],"about_ca_topic_score_codex":0.00033852895,"about_ca_topic_score_gemma":0.00059540063,"teacher_disagreement_score":0.6937937,"about_ca_system_score_codex":0.00016952476,"about_ca_system_score_gemma":0.00032559424,"threshold_uncertainty_score":0.9996285},"labels":[],"label_agreement":null},{"id":"W3029415188","doi":"","title":"Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication.","year":2009,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scalar multiplication; Scalar (mathematics); Computer science; Window (computing); Elliptic curve; Elliptic curve point multiplication; Point (geometry); Multiplication (music); Algorithm; Speedup; Applied mathematics; Mathematics; Arithmetic; Parallel computing; Mathematical analysis; Geometry; Combinatorics","score_opus":0.023077648998691875,"score_gpt":0.3368074585660063,"score_spread":0.31372980956731444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029415188","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002092689,0.0005807586,0.992291,0.0020183453,0.00047775396,0.0015495308,0.00012509461,0.0002761452,0.0005886927],"genre_scores_gemma":[0.0052381763,0.00019118423,0.99322987,0.00064794463,0.00012513323,0.0004667464,0.000058749294,0.00003742476,0.0000047620492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99641764,0.0007372974,0.00061692524,0.001456817,0.00017116558,0.0006001699],"domain_scores_gemma":[0.99649155,0.0012908417,0.000370329,0.0014126599,0.00017672364,0.00025788063],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071399525,0.000512234,0.0006594324,0.0005212879,0.00037235222,0.00019516851,0.001297345,0.00041096777,0.000015540574],"category_scores_gemma":[0.00025345103,0.0004932155,0.00037075105,0.00025638926,0.0005008424,0.00012916504,0.0015042792,0.00079845946,0.000018230998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045006047,0.00029519855,0.0015293118,0.00012881345,0.00023933734,0.0000101927035,0.00293869,0.0433067,0.0005408489,0.9063174,0.0002876142,0.044360895],"study_design_scores_gemma":[0.00067519187,0.00007540968,0.006778711,0.000068619345,0.00006942469,0.00004820466,0.00003485756,0.4230219,0.00054300175,0.56613815,0.0020644588,0.00048205268],"about_ca_topic_score_codex":0.00005114436,"about_ca_topic_score_gemma":0.000038838098,"teacher_disagreement_score":0.3797152,"about_ca_system_score_codex":0.00003747844,"about_ca_system_score_gemma":0.0001563342,"threshold_uncertainty_score":0.9997519},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Provable security; Computer security; Cryptography","score_opus":0.016453373554554906,"score_gpt":0.2709123745534825,"score_spread":0.2544590009989276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029452169","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12139003,0.00028472854,0.86079746,0.003055354,0.001333904,0.00094907416,0.00012614718,0.0004299237,0.011633358],"genre_scores_gemma":[0.38162267,0.00028950223,0.61528313,0.0016762923,0.0002758039,0.00048864476,0.0002553685,0.000077251774,0.000031328545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958611,0.00028932438,0.0007671853,0.001670497,0.00044237438,0.00096950086],"domain_scores_gemma":[0.99681216,0.00019501893,0.00045753538,0.002187628,0.00013832182,0.00020930832],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00043979162,0.0006284308,0.0007409751,0.00056097726,0.00066818757,0.00017614398,0.0023642462,0.0004217955,0.00064289535],"category_scores_gemma":[0.000048696013,0.00064696255,0.00048269596,0.0003256179,0.0005108889,0.00018607965,0.010684588,0.0012804093,0.00032675252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025579562,0.00026004328,0.0018871572,0.00008785896,0.00018271795,0.00009876598,0.009834456,0.00041485677,0.00030775164,0.98333746,0.0019480203,0.0016153181],"study_design_scores_gemma":[0.0008211385,0.00012865089,0.001989872,0.00007380832,0.000035841294,0.00010938519,0.00009093161,0.0024157756,0.0011082367,0.9670392,0.025513697,0.0006734053],"about_ca_topic_score_codex":0.0004192064,"about_ca_topic_score_gemma":0.0013114393,"teacher_disagreement_score":0.26023266,"about_ca_system_score_codex":0.0002835033,"about_ca_system_score_gemma":0.0005332884,"threshold_uncertainty_score":0.99959815},"labels":[],"label_agreement":null},{"id":"W3029579384","doi":"","title":"Boneh-Boyen signatures and the Strong Diffie-Hellman problem.","year":2009,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Converse; Pairing; Signature (topology); Discrete logarithm; Computer science; Logarithm; Scheme (mathematics); Theoretical computer science; Discrete mathematics; Mathematics; Encryption; Public-key cryptography; Physics; Computer security","score_opus":0.00838453022260436,"score_gpt":0.23657231488722116,"score_spread":0.2281877846646168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029579384","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012392946,0.0025091118,0.96857893,0.0065961885,0.0005514291,0.0012538248,0.00010324459,0.00032699818,0.00768734],"genre_scores_gemma":[0.20922084,0.00127856,0.7875781,0.0012152905,0.00030750508,0.00023400916,0.00013268628,0.000031698288,0.0000012827544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99573857,0.00091576047,0.000630284,0.0015581216,0.00038552497,0.00077174156],"domain_scores_gemma":[0.9961494,0.0009212852,0.0004498713,0.002173683,0.00007915924,0.00022655926],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0008892289,0.0006378414,0.00087910355,0.00032465905,0.00041337713,0.00039611265,0.0030865758,0.00047335372,0.000022150296],"category_scores_gemma":[0.00010983461,0.00046204875,0.0003966593,0.00020994476,0.0013762013,0.000203112,0.006531292,0.0025648603,0.000028865887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121120924,0.00010776119,0.00052360754,0.00006834777,0.00015642813,0.00005135172,0.0034041558,0.00023361755,0.000057637742,0.9824568,0.001408476,0.0114106955],"study_design_scores_gemma":[0.0011195127,0.0000764989,0.011181031,0.000089304085,0.000059374353,0.0000559891,0.00006947449,0.004496004,0.000080836944,0.97890216,0.003368947,0.0005008656],"about_ca_topic_score_codex":0.0001234619,"about_ca_topic_score_gemma":0.00025534857,"teacher_disagreement_score":0.19682789,"about_ca_system_score_codex":0.00002740102,"about_ca_system_score_gemma":0.000159848,"threshold_uncertainty_score":0.9997831},"labels":[],"label_agreement":null},{"id":"W3029599730","doi":"","title":"Zero-Knowledge Interactive Proof Systems for New Lattice Problems.","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Zero-knowledge proof; Graph isomorphism; Lattice (music); Lattice problem; Equivalence (formal languages); Mathematics; Rational number; Discrete mathematics; Computer science; Gas meter prover; Time complexity; Theoretical computer science; Graph; Cryptography; Algorithm","score_opus":0.04712534424237986,"score_gpt":0.3094885024980233,"score_spread":0.26236315825564344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029599730","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019490964,0.002501975,0.97961795,0.0008678979,0.0047886367,0.0034943498,0.00045950423,0.00044912662,0.005871458],"genre_scores_gemma":[0.02821959,0.0001540453,0.96819055,0.00017143949,0.00091835076,0.0016900464,0.0005538904,0.000086946915,0.000015124017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99501324,0.00062369986,0.0009548481,0.0020941175,0.00034062215,0.0009735002],"domain_scores_gemma":[0.9943985,0.001195442,0.0007922182,0.0024224534,0.0005902387,0.00060118776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001052541,0.00078975066,0.0011946553,0.00059506134,0.00020927248,0.00043226997,0.003653654,0.00060089584,0.000011732034],"category_scores_gemma":[0.00046655274,0.000770392,0.0005092987,0.00032528784,0.00034116858,0.00047601154,0.0067032874,0.001757091,0.00017045626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012948115,0.00034638325,0.00027880742,0.00061118294,0.00037722787,0.000020797574,0.011954372,0.000928424,0.000036768837,0.9527219,0.026749698,0.005844978],"study_design_scores_gemma":[0.0009679133,0.00024338027,0.00016766605,0.0003925726,0.00008782246,0.00010448507,0.00011998287,0.032926813,0.00015148442,0.91075,0.05334241,0.00074549863],"about_ca_topic_score_codex":0.0003094512,"about_ca_topic_score_gemma":0.00028087737,"teacher_disagreement_score":0.041971903,"about_ca_system_score_codex":0.00017990299,"about_ca_system_score_gemma":0.0014787026,"threshold_uncertainty_score":0.9994747},"labels":[],"label_agreement":null},{"id":"W3029610118","doi":"","title":"Computational Soundness of Coinductive Symbolic Security under Active Attacks.","year":2012,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Soundness; Computer science; Encryption; TRACE (psycholinguistics); Theoretical computer science; Symmetric-key algorithm; Ciphertext; Mathematics; Computer security; Public-key cryptography; Programming language","score_opus":0.023887036101168498,"score_gpt":0.288980556139148,"score_spread":0.26509352003797954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029610118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19978541,0.00019213294,0.7937192,0.0005256964,0.0015871209,0.0006226663,0.00080832985,0.00017827428,0.0025811847],"genre_scores_gemma":[0.6995782,0.000050460934,0.2994311,0.00017828571,0.00020126037,0.000102292564,0.00043097182,0.000027237964,1.5286905e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954434,0.00081425946,0.00084291276,0.0014449218,0.00060819695,0.0008462906],"domain_scores_gemma":[0.99550873,0.0010941133,0.0009189846,0.0017473376,0.00040097814,0.00032986843],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052859215,0.00068455515,0.0011499438,0.00058718456,0.00023473648,0.00009320209,0.0025548693,0.0005989488,0.00010884907],"category_scores_gemma":[0.00010150011,0.0007157554,0.0005611166,0.0004218484,0.0013098215,0.0004879988,0.0063562063,0.0020271654,0.00010212311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009190416,0.00060198375,0.0032144943,0.0001491264,0.00051846454,0.000017401067,0.014423568,0.0022497103,0.000080584,0.97698635,0.00030305708,0.0013633574],"study_design_scores_gemma":[0.00051826955,0.000056668156,0.054485567,0.000085350104,0.00007794003,0.00008828093,0.0003646806,0.0035373326,0.00060206425,0.9393116,0.00025285504,0.0006193848],"about_ca_topic_score_codex":0.00022344258,"about_ca_topic_score_gemma":0.0001301831,"teacher_disagreement_score":0.49979284,"about_ca_system_score_codex":0.00012224383,"about_ca_system_score_gemma":0.0005893328,"threshold_uncertainty_score":0.99952936},"labels":[],"label_agreement":null},{"id":"W3029643700","doi":"","title":"Selections: Internet Voting with Over-the-Shoulder Coercion-Resistance.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ballot; Bullet voting; Computer security; Cardinal voting systems; Electronic voting; Computer science; Voting; Disapproval voting; Internet privacy; Cryptography; Coercion (linguistics); The Internet; Secrecy; Anonymity; Political science; Law; World Wide Web","score_opus":0.019895200078567054,"score_gpt":0.2540230511830111,"score_spread":0.23412785110444406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029643700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033508744,0.00028541344,0.95792556,0.00077220495,0.0009863989,0.00048971263,0.000009355801,0.00036053555,0.0056621046],"genre_scores_gemma":[0.8178946,0.000026724876,0.18111949,0.00043642626,0.00023513607,0.00014256786,0.000027177819,0.000043279426,0.00007459892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957364,0.0005599719,0.0008219661,0.0016040038,0.00044233428,0.0008353077],"domain_scores_gemma":[0.9973438,0.00050202786,0.00075546565,0.0009778282,0.0002543311,0.00016656509],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0006572988,0.0006703243,0.0008389851,0.0003586203,0.00032134826,0.00031772812,0.0029970943,0.00035716884,0.00019370021],"category_scores_gemma":[0.00011087402,0.00048784947,0.0004327434,0.00032947861,0.0005295488,0.00017257432,0.002945288,0.0024031978,0.00012572222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051218387,0.0001013735,0.0012966839,0.00005027417,0.0005868581,0.0000812786,0.007555847,0.0037253946,0.000010211173,0.98270184,0.0026372254,0.0012017962],"study_design_scores_gemma":[0.0010489199,0.00029179524,0.009933937,0.0010561687,0.00048177745,0.00033642602,0.00054401276,0.80402327,0.00046893535,0.16952574,0.010099858,0.0021891901],"about_ca_topic_score_codex":0.00016452272,"about_ca_topic_score_gemma":0.0042020003,"teacher_disagreement_score":0.8131761,"about_ca_system_score_codex":0.0001283106,"about_ca_system_score_gemma":0.00027844962,"threshold_uncertainty_score":0.9998983},"labels":[],"label_agreement":null},{"id":"W3029665865","doi":"","title":"Impossible Differential Cryptanalysis of Reduced-Round SKINNY.","year":2016,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Block cipher; Differential cryptanalysis; Differential (mechanical device); Computer science; Linear cryptanalysis; Boomerang attack; Arithmetic; Cipher; Parallel computing; Algorithm; Mathematics; Cryptography; Operating system; Physics; Encryption","score_opus":0.01865682316254539,"score_gpt":0.294327845526117,"score_spread":0.2756710223635716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029665865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29611108,0.00008024259,0.6995604,0.0010185444,0.0009718049,0.00037591782,0.00017128063,0.000116260555,0.0015944723],"genre_scores_gemma":[0.7331649,0.00015279495,0.26620033,0.000060438775,0.000176338,0.0001320419,0.00008334764,0.000026669475,0.0000031113193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99561936,0.0004986467,0.0012089865,0.0013870738,0.0005252639,0.0007606965],"domain_scores_gemma":[0.9958068,0.00048221345,0.0009265076,0.0022980927,0.00025897624,0.00022740054],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004003607,0.00056593353,0.0010885976,0.0010170252,0.00023236283,0.00015807014,0.0026082457,0.00036068476,0.00043703188],"category_scores_gemma":[0.00009391755,0.00048260958,0.0008365202,0.000444564,0.0006231644,0.00018740157,0.0046541006,0.00082129275,0.00004797643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035050005,0.00021806863,0.003566048,0.00008683937,0.0006278287,0.000026603277,0.0022873608,0.000020801526,0.008284407,0.9760072,0.00047040242,0.00836934],"study_design_scores_gemma":[0.00064132625,0.00009483756,0.019713003,0.00009675896,0.00014231376,0.000028325847,0.00006657215,0.002076548,0.004605381,0.9714083,0.00060722604,0.00051942864],"about_ca_topic_score_codex":0.0001981574,"about_ca_topic_score_gemma":0.00020700395,"teacher_disagreement_score":0.43705383,"about_ca_system_score_codex":0.000083683,"about_ca_system_score_gemma":0.00041029757,"threshold_uncertainty_score":0.99976254},"labels":[],"label_agreement":null},{"id":"W3029717490","doi":"","title":"Using Sphinx to Improve Onion Routing Circuit Construction.","year":2009,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Routing (electronic design automation); Sphinx; Pairing; Computer network","score_opus":0.027846477318382943,"score_gpt":0.276292401316318,"score_spread":0.24844592399793505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029717490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07630346,0.000052672753,0.91704875,0.0008252789,0.002331129,0.0004981303,0.000013738431,0.00031773734,0.00260909],"genre_scores_gemma":[0.5060161,0.000007048975,0.49310172,0.0004772928,0.00034670456,0.000015880585,0.000013208862,0.0000199244,0.0000021302012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99542993,0.00040673968,0.0010075568,0.0018351555,0.0004152235,0.00090540503],"domain_scores_gemma":[0.9975135,0.00022573638,0.0006740394,0.001002046,0.0002171902,0.00036751316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073114043,0.0006113335,0.00096653186,0.0005461287,0.00031132693,0.00035585577,0.002078546,0.0004331173,0.000045993158],"category_scores_gemma":[0.00030367874,0.0006375752,0.0005308958,0.0002924364,0.00020432392,0.00016032578,0.0032051322,0.0016999342,0.00015744868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010630538,0.00005057913,0.00027462136,0.000026349864,0.0001720393,0.00007172597,0.0028903573,0.04989786,0.0007919455,0.92002213,0.00008251101,0.025709262],"study_design_scores_gemma":[0.0002572022,0.000088927474,0.0004210796,0.00024198066,0.00008382101,0.00020951433,0.00017819605,0.7962267,0.00055970566,0.20066659,0.0003090384,0.00075729174],"about_ca_topic_score_codex":0.00009420578,"about_ca_topic_score_gemma":0.00007384402,"teacher_disagreement_score":0.7463288,"about_ca_system_score_codex":0.00026105804,"about_ca_system_score_gemma":0.00045204433,"threshold_uncertainty_score":0.99960756},"labels":[],"label_agreement":null},{"id":"W3029797213","doi":"","title":"How to Hide Circuits in MPC: An Efficient Framework for Private Function Evaluation.","year":2013,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Permutation (music); Computer science; Protocol (science); Generalization; Function (biology); Task (project management); Constant (computer programming); Theoretical computer science; Topology (electrical circuits); Electronic circuit; Mathematics; Combinatorics","score_opus":0.04051566078317991,"score_gpt":0.30665683227799584,"score_spread":0.2661411714948159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029797213","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18902342,0.000119137236,0.8026514,0.0023629372,0.00210549,0.003259716,0.00012353635,0.00020175295,0.00015263176],"genre_scores_gemma":[0.27922517,0.00001604908,0.71763366,0.00049183064,0.00023813448,0.0021162336,0.0002500379,0.000028608738,2.43638e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99501306,0.0007424475,0.00064468366,0.002135115,0.00058715936,0.00087750866],"domain_scores_gemma":[0.9954223,0.0008481768,0.0004149418,0.0026075132,0.00033030214,0.00037678878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014905592,0.00056001986,0.0007051551,0.0009340375,0.00020886757,0.0005219015,0.0024024774,0.0005803674,0.000042383446],"category_scores_gemma":[0.0010119647,0.00058488076,0.00029849037,0.00050803507,0.00018389359,0.0003254852,0.002858058,0.0013442576,0.000086634005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005095528,0.00028103677,0.0012153636,0.00007971335,0.00006536895,0.0000059913327,0.003438924,0.010027559,0.0002348238,0.9461951,0.00025910485,0.038146056],"study_design_scores_gemma":[0.0004777506,0.0002169601,0.032134566,0.00014010003,0.000039794737,0.000007838824,0.00009625682,0.0893257,0.00018081522,0.8751409,0.001694788,0.0005445178],"about_ca_topic_score_codex":0.00006444352,"about_ca_topic_score_gemma":0.00018373954,"teacher_disagreement_score":0.09020176,"about_ca_system_score_codex":0.00016352705,"about_ca_system_score_gemma":0.00030869583,"threshold_uncertainty_score":0.99966025},"labels":[],"label_agreement":null},{"id":"W3029799159","doi":"","title":"Double-Base Number System for Multi-Scalar Multiplications.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"","keywords":"Scalar multiplication; Scalar (mathematics); Mathematics; Redundancy (engineering); Base (topology); Algorithm; Discrete mathematics; Computer science; Mathematical analysis; Geometry","score_opus":0.04834976828090153,"score_gpt":0.3035813148722578,"score_spread":0.2552315465913563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029799159","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015651913,0.00024160562,0.9762882,0.0011256468,0.00178427,0.0023794703,0.00014959078,0.0008051575,0.0015741469],"genre_scores_gemma":[0.09188486,0.00019958687,0.9053359,0.0001384886,0.00021227564,0.0020404446,0.00012636045,0.000055360968,0.000006722834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995701,0.0003143238,0.00088569196,0.0019071534,0.00031887504,0.0008729193],"domain_scores_gemma":[0.9955178,0.0006877261,0.0005483605,0.0026037265,0.0003081656,0.00033421878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004001287,0.0006689266,0.00090517406,0.00044726479,0.00054919394,0.00014683075,0.0027503825,0.0006156257,0.000010682827],"category_scores_gemma":[0.00007394415,0.0006464441,0.00085413805,0.000313939,0.0006009396,0.00013171634,0.0028369804,0.0011725249,0.00035164357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011904929,0.00041842237,0.0041518467,0.00046854938,0.00032616968,0.00010913082,0.00233492,0.0019609705,0.00034326292,0.9851559,0.00080769346,0.0038041086],"study_design_scores_gemma":[0.014181131,0.00023228797,0.030098405,0.0009831582,0.00037932282,0.0019447258,0.00044373304,0.3982225,0.013387265,0.5199575,0.01625978,0.003910176],"about_ca_topic_score_codex":0.00015764317,"about_ca_topic_score_gemma":0.00008174872,"teacher_disagreement_score":0.46519837,"about_ca_system_score_codex":0.000119248856,"about_ca_system_score_gemma":0.00037652478,"threshold_uncertainty_score":0.9995987},"labels":[],"label_agreement":null},{"id":"W3029919513","doi":"","title":"Eperio: Mitigating Technical Complexity in Cryptographic Election Verification.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Waterloo","funders":"","keywords":"Computer science; Cryptography; Python (programming language); Encryption; Electronic voting; Software verification; Software; Cryptographic primitive; Voting; Computer security; Cryptographic protocol; Operating system; Software system; Software construction","score_opus":0.024933547090509354,"score_gpt":0.2787181638292308,"score_spread":0.25378461673872144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029919513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27396223,0.000053003158,0.72243994,0.00080615765,0.0007446192,0.0003617079,0.0000069943453,0.00029455643,0.00133078],"genre_scores_gemma":[0.60793895,0.000021428272,0.39161792,0.00012391678,0.00011973483,0.00011324384,0.000045292993,0.000018719047,7.659166e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956029,0.00056092214,0.0010927971,0.0016269685,0.00037882672,0.000737603],"domain_scores_gemma":[0.9976251,0.00037007034,0.000603859,0.0010622471,0.00017212582,0.00016656776],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00094315264,0.00051946717,0.0008555059,0.000777248,0.00022946298,0.00022724517,0.0022831135,0.00075013924,0.00007551825],"category_scores_gemma":[0.00030205733,0.0005414214,0.0004829654,0.00053590874,0.00067923043,0.00014785033,0.0021855512,0.0043383664,0.00008431933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000137494935,0.00015288548,0.0019379149,0.000040186947,0.00006643482,0.000039300503,0.0014503505,0.002422056,0.0027296084,0.9878288,0.000066053566,0.0032526748],"study_design_scores_gemma":[0.00034525868,0.000067836176,0.041155633,0.00017141475,0.000035288504,0.0001263199,0.00007853359,0.5881628,0.0004922644,0.36828214,0.0003499704,0.0007325666],"about_ca_topic_score_codex":0.00022656815,"about_ca_topic_score_gemma":0.0049558706,"teacher_disagreement_score":0.61954665,"about_ca_system_score_codex":0.00011746961,"about_ca_system_score_gemma":0.00024240957,"threshold_uncertainty_score":0.9997037},"labels":[],"label_agreement":null},{"id":"W3029996188","doi":"","title":"The Weakness of Integrity Protection for LTE.","year":2012,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer security; Message authentication code; TRACE (psycholinguistics); Authentication (law); Harm; Extension (predicate logic); Computer network; Cryptography; Law","score_opus":0.056082150452270725,"score_gpt":0.3245970857923416,"score_spread":0.26851493534007087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029996188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030977836,0.00018379155,0.9622776,0.002297236,0.0019120937,0.0017691978,0.00008688691,0.0001040078,0.00039136928],"genre_scores_gemma":[0.5086025,0.00012270133,0.48948494,0.000052312374,0.00019249956,0.001480853,0.000044810786,0.000017889406,0.0000014853435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977012,0.0003656651,0.00063038996,0.0005721709,0.00022127364,0.0005092601],"domain_scores_gemma":[0.9971477,0.00074918004,0.00056271174,0.0011883642,0.0002602575,0.00009178968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011577733,0.0002786055,0.0004131652,0.00020487128,0.0004177139,0.000094766925,0.001564337,0.00023478954,0.000012894475],"category_scores_gemma":[0.00020058313,0.00021218917,0.0003620265,0.00018122174,0.00043403113,0.000113884475,0.0020242084,0.001021401,0.000008286387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044469532,0.00010398229,0.00093434635,0.00010414915,0.00011269973,5.7147946e-7,0.002598712,0.00002251033,0.00037631055,0.9600865,0.00021210764,0.035403624],"study_design_scores_gemma":[0.00031990433,0.000075941745,0.008875539,0.00003742216,0.000034709465,0.000015606656,0.00021021241,0.0058267764,0.0014197944,0.9753138,0.007638367,0.00023196475],"about_ca_topic_score_codex":0.00022430482,"about_ca_topic_score_gemma":0.00047757398,"teacher_disagreement_score":0.47762468,"about_ca_system_score_codex":0.000044156466,"about_ca_system_score_gemma":0.00022405399,"threshold_uncertainty_score":0.86528236},"labels":[],"label_agreement":null},{"id":"W3030046342","doi":"","title":"Efficient Password-based Authenticated Key Exchange without Public Information.","year":2007,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Authenticated Key Exchange; Computer science; Password; Random oracle; Computer security; Forward secrecy; Key exchange; Key (lock); Public-key cryptography; Secrecy; Authentication (law); Information exchange; Encryption","score_opus":0.02616664333924683,"score_gpt":0.2944306989091703,"score_spread":0.26826405556992344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030046342","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005501657,0.00005121003,0.97722316,0.003778155,0.0010770131,0.00738007,0.00008092052,0.0010351908,0.0038726367],"genre_scores_gemma":[0.30743378,0.0000064414517,0.6867239,0.0010490832,0.000085392014,0.0044477643,0.00021186472,0.00003821516,0.000003603903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947914,0.0005643238,0.0013216424,0.0012959014,0.00083005894,0.0011966729],"domain_scores_gemma":[0.9941872,0.0005368946,0.0012418252,0.0029522572,0.00060285593,0.00047896875],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012375347,0.00072933396,0.000791748,0.0011960114,0.00033396334,0.00042359706,0.0036086459,0.0005562692,0.00017242605],"category_scores_gemma":[0.00062751217,0.0007413423,0.00034230828,0.0006070053,0.0006843888,0.0003474648,0.0048825433,0.0018160486,0.0011662747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043485958,0.00033250346,0.0012507534,0.00024229415,0.000084905645,0.000019154455,0.004731946,0.004082182,0.000049293507,0.9756517,0.00009595374,0.013415837],"study_design_scores_gemma":[0.0008504571,0.000055888406,0.0036189607,0.000109826586,0.000023856332,0.00001999331,0.000039514052,0.34482235,0.00060880976,0.6410928,0.008094703,0.00066284265],"about_ca_topic_score_codex":0.00002072861,"about_ca_topic_score_gemma":0.000029764213,"teacher_disagreement_score":0.34074017,"about_ca_system_score_codex":0.00030117936,"about_ca_system_score_gemma":0.000793149,"threshold_uncertainty_score":0.99961144},"labels":[],"label_agreement":null},{"id":"W3030048089","doi":"","title":"Provably Secure and Practical Onion Routing.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Universal composability; Protocol (science); Key exchange; Routing protocol; Anonymity; Forward secrecy; Computer network; Cryptography; Cryptographic protocol; Key (lock); Computer security; Distributed computing; Routing (electronic design automation); Encryption; Public-key cryptography","score_opus":0.03031414333458102,"score_gpt":0.28352900400269937,"score_spread":0.2532148606681183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030048089","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02118683,0.00021250472,0.96641445,0.0029728482,0.0010784934,0.00069022935,0.000083189494,0.00037675552,0.006984723],"genre_scores_gemma":[0.096777596,0.0002840463,0.9019844,0.00054036285,0.00017839675,0.000116042356,0.00009212876,0.000026648513,4.09226e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961238,0.00055154884,0.00056016515,0.0017507228,0.0002974373,0.0007163496],"domain_scores_gemma":[0.99669254,0.00048875326,0.00045201328,0.0018408075,0.000111273985,0.00041463287],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0006644577,0.0005451334,0.00067334523,0.00032735203,0.00024083427,0.00023734312,0.0011856351,0.0005829861,0.000051115596],"category_scores_gemma":[0.0004670964,0.0005267624,0.00024228153,0.00018230091,0.0006276892,0.00035375654,0.008451744,0.0023760549,0.000098178316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005945979,0.00020118176,0.0022376822,0.00009620148,0.00012170355,0.0002083154,0.0050948877,0.0000034143604,0.00008529968,0.98613954,0.0014223743,0.0043299217],"study_design_scores_gemma":[0.0003385627,0.00013319179,0.007712229,0.00009376209,0.00004765579,0.0004524958,0.000077241064,0.0028713336,0.00029321358,0.98289824,0.0045248605,0.0005572141],"about_ca_topic_score_codex":0.00013704652,"about_ca_topic_score_gemma":0.00012952385,"teacher_disagreement_score":0.07559076,"about_ca_system_score_codex":0.00003205649,"about_ca_system_score_gemma":0.00046940218,"threshold_uncertainty_score":0.9999255},"labels":[],"label_agreement":null},{"id":"W3030138413","doi":"","title":"CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Random oracle; Computer science; Encryption; Standard Model (mathematical formulation); Authenticated encryption; 56-bit encryption; Ciphertext; Theoretical computer science; Probabilistic encryption; Computer security; Public-key cryptography; Geography","score_opus":0.02424680553053885,"score_gpt":0.2708609997526018,"score_spread":0.24661419422206296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030138413","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040570997,0.0008732125,0.9450613,0.0010908719,0.0015099822,0.0010852198,0.0008709697,0.0009452558,0.007992187],"genre_scores_gemma":[0.17846681,0.0023453156,0.81792396,0.00041427888,0.0001676278,0.00021150993,0.000408953,0.000059998278,0.0000015099345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99284786,0.0006219902,0.001245715,0.0028175723,0.0010407036,0.001426134],"domain_scores_gemma":[0.99414235,0.0005987023,0.00076990906,0.0037000282,0.0003787945,0.00041021899],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0006384176,0.0010646112,0.0013550698,0.0011632016,0.00066257565,0.00029112468,0.0049838717,0.0009145793,0.00007034875],"category_scores_gemma":[0.00034644984,0.0010607779,0.00084296335,0.0014889789,0.0011858114,0.0005353744,0.0076946532,0.0030044054,0.00028530858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089801026,0.00042607676,0.00036895613,0.00012915145,0.00020614653,0.00017338702,0.008928109,0.0070654266,0.00010944741,0.97743374,0.002701246,0.0023685046],"study_design_scores_gemma":[0.00070041354,0.00013537999,0.00061659905,0.00009540725,0.00006825112,0.00015072688,0.000056828092,0.18326458,0.00043451256,0.8112494,0.0023280531,0.00089988636],"about_ca_topic_score_codex":0.000091290436,"about_ca_topic_score_gemma":0.000030321813,"teacher_disagreement_score":0.17619915,"about_ca_system_score_codex":0.00018597544,"about_ca_system_score_gemma":0.0009792756,"threshold_uncertainty_score":0.9992957},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014932985931944464,"score_gpt":0.2538706889830655,"score_spread":0.238937703051121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030140832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10592851,0.0024958984,0.88196236,0.005340644,0.0014646896,0.0010560431,0.00008227281,0.00025127354,0.0014182908],"genre_scores_gemma":[0.7027375,0.0030494863,0.29324052,0.0003557184,0.00022677796,0.00027403276,0.000057039222,0.000057755573,0.0000011459045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99481696,0.0009617868,0.0011304481,0.001515463,0.00058162864,0.0009936923],"domain_scores_gemma":[0.9940013,0.0012746647,0.00093965704,0.0034060257,0.000116246396,0.00026209914],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006848015,0.0008097207,0.0012153661,0.0006319031,0.00040403527,0.00011334536,0.0047501707,0.0004790562,0.000046140212],"category_scores_gemma":[0.00007277698,0.0005925145,0.0012430373,0.000802482,0.0023379156,0.00014338932,0.004333816,0.0021953091,0.000079401034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054652264,0.00046277803,0.013622726,0.00014414133,0.0007093525,0.00014548204,0.0061585666,0.0014801172,0.00008802426,0.97369576,0.00054118136,0.0028972058],"study_design_scores_gemma":[0.00050158025,0.00013183082,0.10417926,0.00016035297,0.00011454261,0.00019372668,0.00006370575,0.0046261195,0.00062341394,0.8867542,0.0020650388,0.00058620377],"about_ca_topic_score_codex":0.00018861967,"about_ca_topic_score_gemma":0.00014150208,"teacher_disagreement_score":0.596809,"about_ca_system_score_codex":0.000025782869,"about_ca_system_score_gemma":0.00050458295,"threshold_uncertainty_score":0.9996526},"labels":[],"label_agreement":null},{"id":"W3030198531","doi":"","title":"Integral Distinguishers for Reduced-round Stribog.","year":2013,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"GOST (hash function); Hash function; Permutation (music); Cryptographic hash function; Computer science; Function (biology); Compression (physics); Order (exchange); Mathematics; Computer security; Physics","score_opus":0.03555914038972926,"score_gpt":0.3165588676342527,"score_spread":0.2809997272445235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030198531","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14097084,0.000067806934,0.8508882,0.0020990362,0.00234424,0.0015014197,0.00021898016,0.00027448442,0.0016349887],"genre_scores_gemma":[0.22755595,0.000035367786,0.7703148,0.0002828622,0.00030515483,0.0010686186,0.0003976899,0.00003517123,0.0000044080466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996334,0.0002658821,0.0008109478,0.0014231895,0.00028191681,0.00088406424],"domain_scores_gemma":[0.9966042,0.0007874237,0.00050841464,0.0015509082,0.00029954655,0.00024951244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004802682,0.0005566949,0.0007047248,0.00044399506,0.00036149766,0.00045516776,0.002361378,0.00033322006,0.0001172427],"category_scores_gemma":[0.000355071,0.0005465251,0.0005414909,0.0002311972,0.00043217317,0.0001905729,0.0031417385,0.001143613,0.000060750906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018810104,0.000113080794,0.0010469097,0.00008420301,0.00017562677,0.000011327872,0.0033228751,0.000043216165,0.00017894464,0.9728358,0.006279038,0.015890202],"study_design_scores_gemma":[0.0005579753,0.00012917728,0.004592305,0.000059624912,0.000043852666,0.000028934452,0.00026367797,0.011118727,0.00019958333,0.9706373,0.011798167,0.00057066453],"about_ca_topic_score_codex":0.0005806179,"about_ca_topic_score_gemma":0.00034300413,"teacher_disagreement_score":0.086585104,"about_ca_system_score_codex":0.00011442746,"about_ca_system_score_gemma":0.00037430183,"threshold_uncertainty_score":0.99969864},"labels":[],"label_agreement":null},{"id":"W3030279060","doi":"","title":"Computing Discrete Logarithms in the Jacobian of High-Genus Hyperelliptic Curves over Even Characteristic Finite Fields.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Hyperelliptic curve cryptography; Discrete logarithm; Jacobian matrix and determinant; Mathematics; Hyperelliptic curve; Logarithm; Genus; Base (topology); Finite field; Algorithm; Applied mathematics; Pure mathematics; Discrete mathematics; Computer science; Mathematical analysis; Elliptic curve cryptography","score_opus":0.01895489144504733,"score_gpt":0.2503952366414513,"score_spread":0.23144034519640397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030279060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26357716,0.00073521293,0.73146135,0.0012098607,0.0010579256,0.0007142796,0.000048820224,0.000075180316,0.0011202128],"genre_scores_gemma":[0.9026937,0.00068584207,0.09575472,0.00061437726,0.00011246992,0.000060436018,0.000053841435,0.000023234354,0.0000013765264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959955,0.0009668702,0.0009271065,0.001063654,0.00036908628,0.00067775714],"domain_scores_gemma":[0.99565804,0.0016885636,0.00065628963,0.0018091213,0.00007841925,0.000109559456],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079480535,0.000511544,0.0009505691,0.0004908196,0.00014536154,0.00007470994,0.003273398,0.0003784692,0.000051587776],"category_scores_gemma":[0.00022213494,0.00039649443,0.00041384329,0.00037144523,0.00063333404,0.000102415135,0.0029802043,0.001903048,0.000037364327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008719981,0.0005249974,0.021343125,0.0012219202,0.00040130227,0.00053286337,0.023314701,0.0019667696,0.00015058836,0.9363966,0.00027944788,0.0137805035],"study_design_scores_gemma":[0.00045806853,0.00015761702,0.36583623,0.000997029,0.00008456614,0.00008117574,0.00008544158,0.009364716,0.00013833886,0.62213326,0.0001326816,0.00053086865],"about_ca_topic_score_codex":0.0011002723,"about_ca_topic_score_gemma":0.00039456814,"teacher_disagreement_score":0.6391165,"about_ca_system_score_codex":0.000024527826,"about_ca_system_score_gemma":0.00017345996,"threshold_uncertainty_score":0.9998487},"labels":[],"label_agreement":null},{"id":"W3030283145","doi":"","title":"Enhanced Chosen-Ciphertext Security and Applications.","year":2012,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Encryption; Ciphertext; Computer science; Randomness; Oracle; Random oracle; Theoretical computer science; Scheme (mathematics); Algorithm; Computer security; Mathematics; Public-key cryptography; Programming language","score_opus":0.011227091624300968,"score_gpt":0.2551027824598083,"score_spread":0.2438756908355073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030283145","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019597583,0.0015419568,0.9674532,0.0005786732,0.0007334645,0.0010416207,0.00017345088,0.00038557537,0.008494513],"genre_scores_gemma":[0.45824715,0.0010036649,0.5387382,0.0004381759,0.00046747606,0.00087539013,0.0001980783,0.00003146814,4.071326e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964856,0.00036113363,0.0005640115,0.001532181,0.00027923263,0.0007778607],"domain_scores_gemma":[0.9963495,0.00044148666,0.00039953308,0.0022990245,0.00010288779,0.000407564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004710177,0.00055743044,0.0006979006,0.00029277767,0.0002796796,0.0001917011,0.0020529476,0.0005024331,0.00008166997],"category_scores_gemma":[0.00005461503,0.00057767227,0.00025050621,0.00025546327,0.0006387467,0.00031507653,0.0067723393,0.0016012205,0.00022172095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018752167,0.00020262238,0.0008059306,0.00013509268,0.00010409019,0.0000068100276,0.004226096,0.000007815541,0.00039766572,0.96231693,0.00027791155,0.031500276],"study_design_scores_gemma":[0.00032258264,0.000028256805,0.0068742293,0.00004200619,0.000040804603,0.00004588594,0.00007233256,0.00087965577,0.0009845308,0.97566634,0.014446407,0.0005969411],"about_ca_topic_score_codex":0.000069719244,"about_ca_topic_score_gemma":0.00011699876,"teacher_disagreement_score":0.43864956,"about_ca_system_score_codex":0.00004176647,"about_ca_system_score_gemma":0.00015013796,"threshold_uncertainty_score":0.99966747},"labels":[],"label_agreement":null},{"id":"W3030299978","doi":"","title":"Implementing Pairings at the 192-bit Security Level.","year":2012,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Pairing; Embedding; Implementation; Speedup; Elliptic curve; Parallel computing; Computation; Bit (key); Curve25519; Theoretical computer science; Cryptography; Arithmetic; Public-key cryptography; Algorithm; Programming language; Mathematics; Operating system; Elliptic curve cryptography; Computer security; Encryption; Artificial intelligence; Physics","score_opus":0.028783759697085284,"score_gpt":0.2717220059528824,"score_spread":0.24293824625579707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030299978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12548023,0.001089815,0.85730815,0.005964299,0.0019511207,0.0008563703,0.00010060522,0.00034340745,0.0069059995],"genre_scores_gemma":[0.77357125,0.00024264648,0.2242168,0.0008542079,0.0006010379,0.00035771474,0.00007876903,0.00005907828,0.00001851149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949039,0.0007625913,0.000765442,0.0013771781,0.00049820676,0.0016926583],"domain_scores_gemma":[0.99575675,0.000784958,0.0006040639,0.002465173,0.000110636465,0.00027842238],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015857883,0.00064521853,0.0006775114,0.00031709528,0.00097490096,0.00021695849,0.0034454342,0.00037971392,0.00026530368],"category_scores_gemma":[0.00011555862,0.00048936135,0.0006879004,0.00029751906,0.00078119134,0.0001696248,0.021632554,0.0020478626,0.00044258585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022661714,0.00014219832,0.014782417,0.00013552753,0.00037035852,0.000062517676,0.012575157,0.000089105466,0.00044376956,0.9461819,0.0021536362,0.023040742],"study_design_scores_gemma":[0.00038424056,0.00003635257,0.046814997,0.00008373142,0.00009371725,0.00019870515,0.00017184996,0.0017759101,0.0020341629,0.9110129,0.036659837,0.0007336386],"about_ca_topic_score_codex":0.0003861215,"about_ca_topic_score_gemma":0.0011639025,"teacher_disagreement_score":0.648091,"about_ca_system_score_codex":0.00010447507,"about_ca_system_score_gemma":0.00017945001,"threshold_uncertainty_score":0.9997558},"labels":[],"label_agreement":null},{"id":"W3030340285","doi":"","title":"A heuristic for finding compatible differential paths with application to HAS-160.","year":2013,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hash function; Computer science; Heuristic; Differential (mechanical device); Collision; Algorithm; Theoretical computer science; Function (biology); Perfect hash function; Context (archaeology); Hash table; Artificial intelligence; Physics; Programming language","score_opus":0.030582535978948312,"score_gpt":0.29791249010898707,"score_spread":0.26732995413003874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030340285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16700989,0.000013761621,0.82798475,0.0014805363,0.0004220731,0.0025810557,0.00014658345,0.00017360658,0.00018774961],"genre_scores_gemma":[0.50699323,0.0000058456094,0.4903217,0.00015087036,0.00008507447,0.0022032908,0.00021851053,0.00002065471,8.280074e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971144,0.00015742847,0.0005676952,0.0012397185,0.00027683357,0.0006439136],"domain_scores_gemma":[0.9974496,0.0004832815,0.00037635525,0.0012492657,0.0002034456,0.00023809412],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002003642,0.0004393816,0.0006002395,0.000496308,0.0004300608,0.0003744547,0.0014385331,0.00017111629,0.00006226365],"category_scores_gemma":[0.000049347924,0.00040295353,0.00020233117,0.0002542575,0.00020643682,0.000103950784,0.0018569472,0.0005533526,0.00007811139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055928234,0.00017861385,0.0023574145,0.00013024986,0.00012253615,0.000005117887,0.005442671,0.00072757225,0.0006069636,0.9760925,0.0010365411,0.013243865],"study_design_scores_gemma":[0.0009353771,0.00034031988,0.02295527,0.000092912174,0.00006671765,0.000020051104,0.00016997058,0.09201224,0.00032373,0.8792791,0.0031255214,0.000678819],"about_ca_topic_score_codex":0.00029093458,"about_ca_topic_score_gemma":0.00059140206,"teacher_disagreement_score":0.33998334,"about_ca_system_score_codex":0.00006833336,"about_ca_system_score_gemma":0.0002087812,"threshold_uncertainty_score":0.9998422},"labels":[],"label_agreement":null},{"id":"W3030409914","doi":"","title":"Provably Sublinear Point Multiplication on Koblitz Curves and its Hardware Implementation.","year":2006,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Sublinear function; Multiplication (music); Point (geometry); Conjecture; Mathematics; Multiplication algorithm; Base (topology); Arithmetic; Type (biology); Computer science; Discrete mathematics; Algorithm; Combinatorics; Binary number; Mathematical analysis","score_opus":0.01728105635806619,"score_gpt":0.2875493098742194,"score_spread":0.2702682535161532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030409914","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073485196,0.0020551335,0.9042991,0.015102501,0.0006699806,0.0023111536,0.000301123,0.00044281597,0.0013330127],"genre_scores_gemma":[0.24201575,0.0024633678,0.7497103,0.0026189147,0.00035777784,0.0014554161,0.0012930233,0.00007403409,0.00001138766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99660087,0.0003630208,0.00066471146,0.0014591551,0.0003597046,0.00055254705],"domain_scores_gemma":[0.99765307,0.00038403,0.00045003646,0.001135737,0.00020415365,0.0001729728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042330407,0.0004891654,0.0005374732,0.0005954789,0.00025860156,0.00018060852,0.0011568192,0.0002496097,0.00003486947],"category_scores_gemma":[0.00009072973,0.00046250588,0.00023775076,0.0002830004,0.00021633923,0.00019929995,0.002071554,0.0009409653,0.00008839256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004524268,0.0003091566,0.006092123,0.0006654464,0.00019712598,0.000054602628,0.0020555744,0.0004707314,0.0006941624,0.95989764,0.0050865645,0.02443161],"study_design_scores_gemma":[0.0018490689,0.00041505467,0.20329288,0.00072151236,0.00012123613,0.00013425153,0.00012327619,0.017737594,0.007004409,0.7607189,0.0064386623,0.0014431964],"about_ca_topic_score_codex":0.00017440441,"about_ca_topic_score_gemma":0.00014879064,"teacher_disagreement_score":0.1991788,"about_ca_system_score_codex":0.00005020644,"about_ca_system_score_gemma":0.00019319626,"threshold_uncertainty_score":0.9997827},"labels":[],"label_agreement":null},{"id":"W3030425602","doi":"","title":"A Framework for Non-Interactive Instance-Dependent Commitment Schemes (NIC).","year":2009,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Variety (cybernetics); Theoretical computer science; Abstraction; Closure (psychology); Artificial intelligence","score_opus":0.023888310154628032,"score_gpt":0.3142618442050231,"score_spread":0.29037353405039507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030425602","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006002364,0.00034797055,0.98257554,0.0029348838,0.002408454,0.0022208088,0.00055030105,0.00039879142,0.002560869],"genre_scores_gemma":[0.060574286,0.00036347212,0.9365086,0.0011144447,0.00033150747,0.00084647676,0.00022214981,0.000038382863,6.783396e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949885,0.00038715283,0.00090222404,0.0021909254,0.0004710452,0.0010601629],"domain_scores_gemma":[0.9941249,0.0014980203,0.00077577354,0.0030310617,0.000231579,0.00033866015],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00062968326,0.0008570174,0.0011831222,0.00052148825,0.00035902314,0.0003343046,0.0038833953,0.0007139173,0.000044452172],"category_scores_gemma":[0.00030525023,0.0008714305,0.0008004267,0.0002500181,0.00038083646,0.00036484253,0.0051043457,0.0026685994,0.000103826074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026198773,0.00055278454,0.0005124748,0.00012526954,0.00038660096,0.00007106285,0.0035611484,0.000114459406,0.000087569344,0.9741309,0.0015612947,0.01863444],"study_design_scores_gemma":[0.0008430699,0.00030267896,0.0021907971,0.00041136716,0.000064591215,0.000036432633,0.00014618531,0.0052601527,0.0015068935,0.9777856,0.0106205605,0.0008316619],"about_ca_topic_score_codex":0.00003924752,"about_ca_topic_score_gemma":0.00012592736,"teacher_disagreement_score":0.05457192,"about_ca_system_score_codex":0.00018383475,"about_ca_system_score_gemma":0.0003924192,"threshold_uncertainty_score":0.9996323},"labels":[],"label_agreement":null},{"id":"W3030584426","doi":"","title":"IO-DSSE: Scaling Dynamic Searchable Encryption to Millions of Indexes By Improving Locality.","year":2016,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Locality; Computer science; Encryption; Scaling; Locality of reference; Theoretical computer science; Parallel computing; Computer security; Cache; Mathematics","score_opus":0.008312299165336077,"score_gpt":0.2656345531389091,"score_spread":0.257322253973573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030584426","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12968618,0.00031949012,0.86530197,0.0016337687,0.0007449686,0.00077777554,0.0009178228,0.00022775035,0.00039025655],"genre_scores_gemma":[0.4811022,0.00020772572,0.5179818,0.00020946031,0.00008210537,0.00017982903,0.00019876183,0.00003678267,0.0000012958075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99504954,0.00059140386,0.0009775154,0.00180566,0.00057146937,0.001004416],"domain_scores_gemma":[0.99568194,0.00071792986,0.000542222,0.0023775673,0.00024329308,0.00043705586],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010366902,0.0005861948,0.00090449094,0.00088318554,0.0002742247,0.00013828254,0.0030430108,0.0005188762,0.000053528736],"category_scores_gemma":[0.0002971033,0.0005464685,0.0004194894,0.00050704955,0.00066342036,0.00031202505,0.008040562,0.001299348,0.00010330335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008997797,0.00026005274,0.0024400158,0.0003527789,0.00017185423,0.000025307607,0.002800021,0.00044861942,0.04044114,0.9120154,0.00083161687,0.040123258],"study_design_scores_gemma":[0.00044638646,0.00014616759,0.003310288,0.00040432427,0.00003662907,0.000026771717,0.00010647924,0.013244583,0.0068729855,0.97341466,0.0012651747,0.0007255207],"about_ca_topic_score_codex":0.0004699397,"about_ca_topic_score_gemma":0.00023371655,"teacher_disagreement_score":0.351416,"about_ca_system_score_codex":0.000136465,"about_ca_system_score_gemma":0.00038741317,"threshold_uncertainty_score":0.99998224},"labels":[],"label_agreement":null},{"id":"W3030674378","doi":"","title":"Secret Keys from Channel Noise.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Randomness; Initialization; Channel (broadcasting); Upper and lower bounds; Binary symmetric channel; Alice and Bob; Key (lock); Computer network; Protocol (science); Binary number; Computer security; Verifiable secret sharing; Adversary; Theoretical computer science; Channel capacity; Alice (programming language); Mathematics; Arithmetic; Statistics; Set (abstract data type)","score_opus":0.026329738865295677,"score_gpt":0.24071884263436844,"score_spread":0.21438910376907275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030674378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1100482,0.0010822602,0.823046,0.00031470932,0.0011880522,0.00079482596,0.00051570626,0.0032904772,0.05971977],"genre_scores_gemma":[0.6759288,0.0021181833,0.3198122,0.00015243657,0.00026165333,0.0006519562,0.0008881352,0.00018409832,0.0000025811946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748284,0.00030555404,0.0006950917,0.0007454828,0.00020016852,0.00057085545],"domain_scores_gemma":[0.9964891,0.00035356177,0.00020940165,0.0026580605,0.000084975654,0.00020486477],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00020756332,0.0006534419,0.00089770753,0.00035875003,0.00008944544,0.000048594346,0.0020518717,0.0008337448,0.00054946257],"category_scores_gemma":[0.00006930388,0.0007658435,0.00030737492,0.0000880698,0.00037437538,0.00007569839,0.003194968,0.002677967,0.0006270786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113523,0.00030072866,0.0027635964,0.0005192168,0.00158192,0.00013434993,0.028773194,0.0069513223,0.009289734,0.92731863,0.013332233,0.008921521],"study_design_scores_gemma":[0.00021414491,0.000021642296,0.0053443024,0.00019924478,0.000060940576,0.000010793729,0.0000929841,0.011569731,0.01271915,0.9644015,0.004588436,0.0007771513],"about_ca_topic_score_codex":0.00054189056,"about_ca_topic_score_gemma":0.00034298236,"teacher_disagreement_score":0.56588054,"about_ca_system_score_codex":0.00012836336,"about_ca_system_score_gemma":0.00007613547,"threshold_uncertainty_score":0.9996229},"labels":[],"label_agreement":null},{"id":"W3030829573","doi":"","title":"On the Multi-output Filtering Model and Its Applications.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Randomness; Computer science; Cryptography; Algorithm; Component (thermodynamics); Correlation attack; Function (biology); Linear feedback shift register; S-box; Theoretical computer science; Stream cipher; Block cipher; Mathematics; Shift register; Statistics; Chip","score_opus":0.04674944590206244,"score_gpt":0.3005163541680336,"score_spread":0.25376690826597115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030829573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05195276,0.00008714209,0.94300663,0.0028501002,0.00017548693,0.00097382924,0.000057912188,0.00014099079,0.00075515197],"genre_scores_gemma":[0.5393164,0.0001338098,0.45865652,0.0008822514,0.000052332503,0.0009094403,0.00002921527,0.000017538343,0.000002475109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978243,0.00024767398,0.00040249262,0.0009315584,0.00020093677,0.00039303766],"domain_scores_gemma":[0.9975002,0.00081039674,0.00024715735,0.001247558,0.00007680399,0.00011791534],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000454123,0.00033348394,0.00033877615,0.00023854512,0.00039541916,0.00017149598,0.0014544677,0.00015830033,0.000017905404],"category_scores_gemma":[0.00008800084,0.00026590377,0.00014751374,0.00011510371,0.0001994396,0.00006313078,0.0032036235,0.0008769365,0.00005693054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053814056,0.00005861415,0.00007623358,0.00003888473,0.000047831712,0.0000022582965,0.0017517,0.00526904,0.00014808314,0.9870371,0.00020895772,0.0053559006],"study_design_scores_gemma":[0.0001550911,0.000017507104,0.0006205882,0.000020706502,0.000009772939,0.000009371996,0.000022964587,0.44413516,0.000079882426,0.5539419,0.0008085914,0.00017845823],"about_ca_topic_score_codex":0.000017325765,"about_ca_topic_score_gemma":0.000056063163,"teacher_disagreement_score":0.48736364,"about_ca_system_score_codex":0.000025324345,"about_ca_system_score_gemma":0.00008787553,"threshold_uncertainty_score":0.9999793},"labels":[],"label_agreement":null},{"id":"W3030847392","doi":"","title":"On the Efficiency and Security of Pairing-Based Protocols in the Type 1 and Type 4 Settings.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Type (biology); Computer science; Protocol (science); Genus; Security analysis; Signature (topology); Elliptic curve; Hash function; Focus (optics); Pairing; Theoretical computer science; Mathematics; Computer security; Pure mathematics; Physics; Geometry","score_opus":0.015704501188230142,"score_gpt":0.2756636668611543,"score_spread":0.25995916567292415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030847392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8905871,0.00012687097,0.09454247,0.0056484574,0.00028660486,0.007665361,0.000011047429,0.000055857818,0.0010762542],"genre_scores_gemma":[0.96688396,0.000022071707,0.031532172,0.0005883684,0.00002927946,0.00093006773,0.0000033833164,0.000010492503,1.8751626e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787015,0.0006305958,0.00033128893,0.0006329384,0.00023079266,0.0003042544],"domain_scores_gemma":[0.9967814,0.0017590885,0.00024873394,0.0010632304,0.00009435744,0.00005316896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012000605,0.00025822374,0.0003464257,0.00021795755,0.00015500074,0.00008531756,0.0013211195,0.00023192812,0.000008947546],"category_scores_gemma":[0.0004992156,0.00015015114,0.000075966374,0.00036820967,0.0008850785,0.00002820451,0.0011952018,0.0016743399,0.0000045791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007846355,0.00021076539,0.010470422,0.0001662233,0.00002692945,0.000030570256,0.0064444817,0.00021953246,0.00030564744,0.9804884,0.00012444457,0.0014340795],"study_design_scores_gemma":[0.0003755621,0.00037644108,0.053896986,0.00026130278,0.000014690746,0.00003466619,0.000089958914,0.016921325,0.00078433665,0.92654985,0.00045231683,0.00024255029],"about_ca_topic_score_codex":0.00004762119,"about_ca_topic_score_gemma":0.000115897936,"teacher_disagreement_score":0.0762969,"about_ca_system_score_codex":0.000006800164,"about_ca_system_score_gemma":0.00018147612,"threshold_uncertainty_score":0.72742665},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02407413391174426,"score_gpt":0.30700086941132587,"score_spread":0.2829267354995816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030978102","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38201442,0.00009145075,0.6142321,0.00093948125,0.00060466706,0.0015579739,0.00027839062,0.00019500115,0.00008648018],"genre_scores_gemma":[0.30233422,0.0001903768,0.69618136,0.00006249088,0.00021061287,0.000688665,0.00030515052,0.000026269629,8.9239705e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99595463,0.00036842248,0.00087511755,0.0016923731,0.00036056753,0.00074889715],"domain_scores_gemma":[0.99717546,0.00052432984,0.00048743153,0.0013074185,0.0002722592,0.0002331221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004474562,0.0005866424,0.0008243393,0.0003917745,0.00040609945,0.00022094669,0.0010190732,0.00034529052,0.00009747245],"category_scores_gemma":[0.00016517035,0.0005882362,0.00034624472,0.00017961042,0.0004592845,0.00027403413,0.0022945544,0.0008707732,0.000007176533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048953574,0.00033660303,0.0034396916,0.0002894695,0.00023734277,0.000010797004,0.005840237,0.00030675603,0.0015506608,0.91577923,0.00015610126,0.071563564],"study_design_scores_gemma":[0.0019338557,0.0003540634,0.01800606,0.0000623031,0.00006463477,0.00002728957,0.00016468974,0.012929332,0.0006175747,0.9624443,0.0027481692,0.00064773706],"about_ca_topic_score_codex":0.000047177145,"about_ca_topic_score_gemma":0.00045917236,"teacher_disagreement_score":0.08194922,"about_ca_system_score_codex":0.00014612032,"about_ca_system_score_gemma":0.00028104213,"threshold_uncertainty_score":0.9996569},"labels":[],"label_agreement":null},{"id":"W3031028809","doi":"","title":"Three Improved Algorithms for Multi-path Key Establishment in Sensor Networks Using Protocols for Secure Message Transmission.","year":2009,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Key (lock); Path (computing); Protocol (science); Adversary; Computer network; Simple (philosophy); Transmission (telecommunications); Scheme (mathematics); Distributed computing; Adversary model; Algorithm; Computer security; Telecommunications; Mathematics","score_opus":0.05999894787886826,"score_gpt":0.3368731218499851,"score_spread":0.2768741739711168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3031028809","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017806978,0.00025479728,0.9425417,0.00089247676,0.0010442772,0.052885767,0.00016994034,0.00039033534,0.00003997465],"genre_scores_gemma":[0.0016301279,0.000071312345,0.97194016,0.00036032547,0.0005759623,0.025126878,0.0001702381,0.00012350694,0.0000014640306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925866,0.0004990302,0.0016425032,0.0028629047,0.00041514388,0.001993814],"domain_scores_gemma":[0.9949152,0.0011492085,0.0009880277,0.0021739353,0.0003492674,0.0004243707],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0013647416,0.0012231958,0.0018469135,0.00056098896,0.00036170843,0.00040295624,0.0032436573,0.001470387,0.000009405417],"category_scores_gemma":[0.00018149652,0.0012480879,0.00082022324,0.00035890733,0.00031110196,0.00027103734,0.0017295459,0.002547929,0.0000027206738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013268478,0.0020209276,0.0008995311,0.0014462475,0.00054380595,0.0002789473,0.0104008075,0.56321806,0.001831515,0.24533997,0.0008024178,0.17189094],"study_design_scores_gemma":[0.0031991638,0.00028839326,0.0006951212,0.00080479815,0.00005463248,0.000047686997,0.000050128976,0.7857608,0.0004114429,0.20668055,0.0009996333,0.0010076313],"about_ca_topic_score_codex":0.0001323133,"about_ca_topic_score_gemma":0.00028726037,"teacher_disagreement_score":0.22254278,"about_ca_system_score_codex":0.00038343106,"about_ca_system_score_gemma":0.0005629277,"threshold_uncertainty_score":0.9998259},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Computer science; Arithmetic","score_opus":0.02348332380350394,"score_gpt":0.3467552850420604,"score_spread":0.32327196123855645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3031052868","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75566494,0.00028816715,0.14813069,0.0018094067,0.0030963183,0.0009056564,0.000013275726,0.00034884457,0.08974268],"genre_scores_gemma":[0.44892985,0.00013864187,0.54951185,0.00021043794,0.0008107649,0.00024653162,0.000041104013,0.000066894965,0.000043907185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938969,0.002843539,0.0006345251,0.0011288584,0.0004129724,0.0010832057],"domain_scores_gemma":[0.996628,0.0016638577,0.00041057402,0.0009672095,0.00007016368,0.0002602009],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0031018131,0.00043202005,0.00080581126,0.0006251873,0.00030684515,0.00011476104,0.0015043756,0.0011958681,0.0008541842],"category_scores_gemma":[0.0030341218,0.00049044396,0.00027411958,0.00023883447,0.0014572296,0.00008052055,0.0017590714,0.0057923864,0.000301596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004129068,0.00010782163,0.10752286,0.000069390204,0.00005569277,0.000305011,0.051299345,0.0008939306,0.0023267486,0.8060063,0.00011419489,0.031257425],"study_design_scores_gemma":[0.0004105015,0.000025342664,0.09778838,0.0001521502,0.000031196272,0.000012643091,0.0014845923,0.0005877371,0.00028965826,0.8779216,0.020612232,0.0006840042],"about_ca_topic_score_codex":0.01877588,"about_ca_topic_score_gemma":0.094018124,"teacher_disagreement_score":0.40138116,"about_ca_system_score_codex":0.0002804226,"about_ca_system_score_gemma":0.0007541051,"threshold_uncertainty_score":0.9997547},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.059008740401374424,"score_gpt":0.2818161552245252,"score_spread":0.22280741482315075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3031215330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15352824,0.00021460428,0.8352496,0.0063922866,0.001317528,0.00087963406,0.00015419816,0.00019488072,0.0020690432],"genre_scores_gemma":[0.68329686,0.0012591069,0.31020987,0.0031129962,0.0005242414,0.0012214422,0.00028679526,0.00007342521,0.00001528037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99600035,0.0010145534,0.00090173964,0.0010196706,0.00047396324,0.0005897379],"domain_scores_gemma":[0.99422747,0.0022158327,0.00065562135,0.0025319993,0.00023680954,0.00013224795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011359731,0.0004928978,0.0006023349,0.0008194829,0.0005638844,0.00013911162,0.0025310316,0.0002809116,0.00021513592],"category_scores_gemma":[0.00024201759,0.00038797993,0.00062257046,0.0007819496,0.0009159052,0.00017887366,0.002351629,0.0014875077,0.00006716399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032374075,0.00028216676,0.005236854,0.000033311404,0.0002866166,0.0000109814,0.0019540743,0.0004055425,0.00021086643,0.9867876,0.001641682,0.0031179364],"study_design_scores_gemma":[0.00030423867,0.00011954853,0.052771736,0.0000725396,0.0000592468,0.000017369188,0.0004248528,0.0015136931,0.00012788018,0.9413515,0.0029010493,0.00033635597],"about_ca_topic_score_codex":0.00009508249,"about_ca_topic_score_gemma":0.00016043738,"teacher_disagreement_score":0.5297686,"about_ca_system_score_codex":0.00004120132,"about_ca_system_score_gemma":0.00029485588,"threshold_uncertainty_score":0.9998572},"labels":[],"label_agreement":null},{"id":"W3031249145","doi":"","title":"Combinatorial batch codes.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Waterloo","funders":"","keywords":"Server; Computer science; Code (set theory); Probabilistic logic; Theoretical computer science; Discrete mathematics; Operating system; Mathematics; Programming language; Artificial intelligence; Set (abstract data type)","score_opus":0.022903451522838063,"score_gpt":0.2719641128123258,"score_spread":0.24906066128948773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3031249145","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002232349,0.00008559817,0.9539565,0.002820324,0.0043161986,0.00073066755,0.0000344955,0.0005300229,0.03529386],"genre_scores_gemma":[0.04629815,0.0013602853,0.9507482,0.0007129359,0.0003923178,0.0002630579,0.00015541655,0.00005228699,0.000017354785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99588794,0.00086943246,0.0006383523,0.0013237911,0.00051053247,0.000769973],"domain_scores_gemma":[0.9967744,0.0005816852,0.00032876738,0.0017430044,0.00023828237,0.00033388377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057587493,0.00048067133,0.00074236246,0.00037004592,0.0002799266,0.00017984303,0.002956933,0.00049242727,0.000112078706],"category_scores_gemma":[0.00025885765,0.0004941724,0.00029313407,0.00023156266,0.00051785016,0.00015882756,0.0062875156,0.0018571661,0.00061026704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030058496,0.00016462599,0.0005013666,0.00004403541,0.00009544906,0.00014377038,0.0025486322,0.0066169584,0.000051103125,0.9826229,0.0048628165,0.002318273],"study_design_scores_gemma":[0.0007457938,0.00008801479,0.0010386081,0.00004906814,0.000009920587,0.000094229894,0.000016367596,0.07844778,0.00021565972,0.90818554,0.010591942,0.0005170995],"about_ca_topic_score_codex":0.000079745834,"about_ca_topic_score_gemma":0.00001733329,"teacher_disagreement_score":0.074437395,"about_ca_system_score_codex":0.000105208615,"about_ca_system_score_gemma":0.0007604607,"threshold_uncertainty_score":0.999751},"labels":[],"label_agreement":null},{"id":"W3031524031","doi":"","title":"Distance Lower Bounding.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"RFID technology advancements","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Bounding overwatch; Gas meter prover; Collusion; Computer science; Impossibility; Protocol (science); Upper and lower bounds; Computer security; Theoretical computer science; Authentication (law); Cryptographic protocol; Cryptography; Mathematics; Law; Mathematical proof","score_opus":0.007003950682542401,"score_gpt":0.23190118233762486,"score_spread":0.22489723165508246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3031524031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123149484,0.0004514456,0.8506219,0.0002831989,0.0045325174,0.0004902824,0.00006288239,0.0016444694,0.01876387],"genre_scores_gemma":[0.7547245,0.0003704927,0.24380624,0.00013347858,0.00026175255,0.00040928822,0.000121981095,0.00015913855,0.000013141284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973447,0.00010261657,0.0006009762,0.0008933743,0.0002098088,0.00084855274],"domain_scores_gemma":[0.9978275,0.00021237001,0.00017958741,0.001590189,0.000046116544,0.00014423949],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020201356,0.0006568422,0.000826798,0.00033872007,0.00011249697,0.000040758652,0.0011300261,0.0007241247,0.00020556845],"category_scores_gemma":[0.00013989468,0.0007463234,0.00022546371,0.00010635292,0.0006328278,0.000060947434,0.0013502766,0.0023227085,0.00089766074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072436436,0.00010480005,0.0072437422,0.0004878923,0.0006298774,0.00021357571,0.00046762323,0.07036444,0.0021349806,0.90449727,0.005213163,0.008570227],"study_design_scores_gemma":[0.0004283218,0.00004503699,0.002701591,0.00019511615,0.00005656414,0.000036577578,0.000018405626,0.016542898,0.0015470491,0.90690476,0.0706996,0.000824066],"about_ca_topic_score_codex":0.0000065013946,"about_ca_topic_score_gemma":0.000075298645,"teacher_disagreement_score":0.631575,"about_ca_system_score_codex":0.00021488273,"about_ca_system_score_gemma":0.00004627677,"threshold_uncertainty_score":0.99997896},"labels":[],"label_agreement":null},{"id":"W3031625817","doi":"","title":"Exclusion-Intersection Encryption.","year":2005,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Encryption; Computer science; Ciphertext; Computer security; Cryptography; Attribute-based encryption; Intersection (aeronautics); Public-key cryptography; Theoretical computer science; Engineering","score_opus":0.013748257548284914,"score_gpt":0.25828966322121755,"score_spread":0.24454140567293264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3031625817","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031518925,0.00030448605,0.95243543,0.0020316208,0.0033305124,0.00057621615,0.000119599026,0.0007285424,0.008954653],"genre_scores_gemma":[0.12472906,0.00042516968,0.8729626,0.000651744,0.0007680267,0.00018462421,0.0002442064,0.000033206918,0.0000013528793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99580467,0.0004729808,0.0007492803,0.0017836391,0.0004390634,0.00075034716],"domain_scores_gemma":[0.99628717,0.0003475796,0.0004716274,0.0024574657,0.00014387952,0.00029225534],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005261557,0.00062167255,0.0006795082,0.0007373928,0.0003538064,0.00024768073,0.00293429,0.000582933,0.00029521808],"category_scores_gemma":[0.000123609,0.0006428377,0.0005797851,0.0003202922,0.00040363264,0.00041257715,0.008753246,0.0020449136,0.0006247833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004092629,0.0002095247,0.0007787294,0.00005251108,0.00011506896,0.00006170567,0.0030073745,0.0005788977,0.0004888176,0.9702716,0.0029171242,0.021477716],"study_design_scores_gemma":[0.00037926214,0.00007960547,0.007630041,0.00010089515,0.00003248672,0.00014472255,0.00007342752,0.013135832,0.00044387742,0.9610807,0.016246492,0.00065268076],"about_ca_topic_score_codex":0.00013293285,"about_ca_topic_score_gemma":0.0003502309,"teacher_disagreement_score":0.09321014,"about_ca_system_score_codex":0.00014720034,"about_ca_system_score_gemma":0.00027032327,"threshold_uncertainty_score":0.9996023},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005727296969806965,"score_gpt":0.21571699691288027,"score_spread":0.2099896999430733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037557713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3479948,0.00005006329,0.6481479,0.0010170736,0.000744172,0.00018511967,0.0000022064817,0.0002706713,0.0015880292],"genre_scores_gemma":[0.5185095,0.000011708048,0.4809702,0.0003558636,0.000108144486,0.000012993019,0.0000071108934,0.00001715688,0.0000072875596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997785,0.0002351112,0.00033460264,0.0007792224,0.00025390598,0.0006121981],"domain_scores_gemma":[0.9983562,0.0003629136,0.0001632976,0.00091195595,0.000059802216,0.00014578947],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033033936,0.00026375955,0.0003504739,0.00021344524,0.00018971071,0.00008655668,0.0011221695,0.000110760426,0.00009583382],"category_scores_gemma":[0.000040442897,0.0002349433,0.00014653864,0.0002899403,0.00013857268,0.00019928574,0.0008240806,0.00048662233,0.001877021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017440923,0.00007658951,0.0033685581,0.000019318855,0.000033210155,0.0000393328,0.0011398353,0.0047662654,0.0098858895,0.9464896,0.00019767214,0.033966288],"study_design_scores_gemma":[0.00029815643,0.00014523466,0.00858627,0.000021566284,0.0000039935376,0.00013361724,0.00002317959,0.44127095,0.0010020509,0.5453279,0.0029497398,0.00023733472],"about_ca_topic_score_codex":0.00005344695,"about_ca_topic_score_gemma":0.000012181148,"teacher_disagreement_score":0.4365047,"about_ca_system_score_codex":0.000031035004,"about_ca_system_score_gemma":0.00008033739,"threshold_uncertainty_score":0.9989001},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01194958658092149,"score_gpt":0.24372692565375378,"score_spread":0.2317773390728323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081740921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0569565,0.00072028226,0.9360887,0.00037882724,0.0004792087,0.0020594285,0.000045479577,0.0001148011,0.0031567917],"genre_scores_gemma":[0.5389143,0.000041360494,0.4606745,0.00004564246,0.000022019134,0.00025391692,0.000025311077,0.000021185124,0.0000017670977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969027,0.00055312546,0.000750695,0.0010358281,0.00033145296,0.00042622202],"domain_scores_gemma":[0.9972131,0.00058566005,0.00043645178,0.0014060435,0.00017589508,0.00018282839],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044502952,0.00041202395,0.00090483914,0.0007545829,0.00015164548,0.0002447606,0.001217638,0.00025209747,0.0000065725135],"category_scores_gemma":[0.00012290753,0.00036501721,0.00023525994,0.0004050062,0.00037256192,0.00008049384,0.001985181,0.0005716567,0.000028934997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000941872,0.00020773042,0.00042162108,0.0041146493,0.00020542799,0.0000057127622,0.01278305,0.26628897,0.00011164543,0.71576756,0.00002960952,0.00005460573],"study_design_scores_gemma":[0.0007820671,0.00023296206,0.01890233,0.0027016613,0.0003099587,0.00019651676,0.003720591,0.44735458,0.00015207265,0.52453476,0.000026482128,0.0010859811],"about_ca_topic_score_codex":0.000072376206,"about_ca_topic_score_gemma":0.000026405893,"teacher_disagreement_score":0.48195782,"about_ca_system_score_codex":0.000040020393,"about_ca_system_score_gemma":0.0004568158,"threshold_uncertainty_score":0.9998802},"labels":[],"label_agreement":null},{"id":"W310630150","doi":"","title":"Completion of Computation of Improved Upper Bound on the Maximum Average Linear Hull Probabilty for Rijndael.","year":2004,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Mount Allison University","funders":"","keywords":"Advanced Encryption Standard; Computation; Benchmark (surveying); Cryptanalysis; Computer science; Cryptography; S-box; Algorithm; Hull; Linear cryptanalysis; Block cipher; Engineering","score_opus":0.03571488709859343,"score_gpt":0.30547575470197885,"score_spread":0.2697608676033854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W310630150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22061197,0.000022360093,0.7748854,0.0016099144,0.00047829378,0.00189651,0.00020512872,0.000051170406,0.00023923011],"genre_scores_gemma":[0.63740855,0.000021185439,0.361948,0.00015070678,0.00005229954,0.00023713308,0.00016500727,0.000016814249,2.8529746e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997262,0.0003299607,0.00094066927,0.0007633844,0.00031041415,0.00039355762],"domain_scores_gemma":[0.9968884,0.00077527645,0.0009311173,0.00096480345,0.00037136313,0.00006902533],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000722512,0.00035411734,0.0006455087,0.00034186873,0.0002280971,0.000053153013,0.0011355769,0.00020500738,0.000022051057],"category_scores_gemma":[0.00013607244,0.00029002127,0.0004518631,0.00021753776,0.00054842647,0.000073153285,0.001094376,0.00061492494,0.0000050831727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116077914,0.0003387494,0.00065197854,0.0002833405,0.00016448765,0.0000015207436,0.0037365393,0.008641242,0.0016630944,0.98130196,0.000075097305,0.0030259085],"study_design_scores_gemma":[0.00092635606,0.00040191266,0.009607092,0.00013123438,0.000035813613,0.000007680555,0.00009965395,0.07075656,0.0024437096,0.9150807,0.00025941365,0.00024983773],"about_ca_topic_score_codex":0.00022780911,"about_ca_topic_score_gemma":0.00014352077,"teacher_disagreement_score":0.41679657,"about_ca_system_score_codex":0.00007835962,"about_ca_system_score_gemma":0.00034935403,"threshold_uncertainty_score":0.9999552},"labels":[],"label_agreement":null},{"id":"W3110590623","doi":"","title":"Removable Weak Keys for Discrete Logarithm Based Cryptography.","year":2020,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Discrete logarithm; Cryptosystem; Public-key cryptography; Cryptography; Logarithm; Mathematics; Theoretical computer science; Discrete mathematics; Computer science; Key (lock); Security parameter; Encryption; Computer security","score_opus":0.0279654450418157,"score_gpt":0.27929919213903637,"score_spread":0.25133374709722067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110590623","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074839016,0.0003201331,0.97844785,0.008497151,0.0020569232,0.0019457804,0.0013498471,0.0009234989,0.005710425],"genre_scores_gemma":[0.009447147,0.00011818403,0.9867551,0.0015019315,0.0003963754,0.00072469213,0.0009815525,0.0000745991,4.2398855e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935016,0.00056429685,0.0010605992,0.0029914933,0.0005440807,0.0013379494],"domain_scores_gemma":[0.99389696,0.0012866043,0.00070707244,0.003247944,0.0002453634,0.00061602663],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007073667,0.0010305298,0.0013931647,0.0007968191,0.00048043483,0.00043821722,0.004757605,0.0007412066,0.00009400403],"category_scores_gemma":[0.00038240585,0.0010618555,0.0014629348,0.0006811318,0.0007844579,0.00032245927,0.005684289,0.0021415474,0.00012587567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020166146,0.00019009605,0.00083894026,0.0002955799,0.00029737243,0.00007799313,0.00071069173,0.00039623817,0.00041845412,0.98486596,0.007350472,0.004356515],"study_design_scores_gemma":[0.001163174,0.00025273568,0.0019817378,0.00013650123,0.00009707226,0.00002366335,0.00005301435,0.059638023,0.0008225271,0.89532477,0.03947538,0.0010313835],"about_ca_topic_score_codex":0.00010991017,"about_ca_topic_score_gemma":0.0001593384,"teacher_disagreement_score":0.0895412,"about_ca_system_score_codex":0.00006220138,"about_ca_system_score_gemma":0.00061809045,"threshold_uncertainty_score":0.9991832},"labels":[],"label_agreement":null},{"id":"W3117337916","doi":"10.48550/arxiv.1910.03551","title":"Quantum encryption with certified deletion","year":2019,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Plaintext; Ciphertext; Computer science; Encryption; Theoretical computer science; Qubit; Key (lock); Ciphertext indistinguishability; String (physics); Quantum; Algorithm; Computer security; Physics; Quantum mechanics; Malleability","score_opus":0.013383264591479996,"score_gpt":0.23587631870421338,"score_spread":0.2224930541127334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117337916","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20042765,0.000097414035,0.79355395,0.002001211,0.0016109098,0.0006330651,0.000013486804,0.00051511044,0.0011471972],"genre_scores_gemma":[0.43504807,0.000042277617,0.56413513,0.0003042311,0.00026288425,0.00007861982,0.00007900943,0.000045157918,0.0000046215528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99582434,0.0005028839,0.0005870657,0.001784359,0.00048544843,0.00081591343],"domain_scores_gemma":[0.99664783,0.00041485004,0.0005555184,0.0020217902,0.00016180456,0.00019820817],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042170868,0.0006670438,0.0007908172,0.00044611655,0.00023087864,0.0002261072,0.0021261405,0.00044448333,0.000026517115],"category_scores_gemma":[0.00006085239,0.0005572928,0.0002736496,0.00024395701,0.00028081055,0.00012495047,0.003270471,0.0020923817,0.00038461087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009813563,0.00014017701,0.0013020205,0.00014034186,0.00018177279,0.00013229136,0.0028657771,0.109906286,0.00078750384,0.8606899,0.0004099335,0.023345904],"study_design_scores_gemma":[0.00041186908,0.00021990812,0.006572138,0.00020091498,0.000025226433,0.00016682367,0.000025880774,0.51865625,0.00031255092,0.47197282,0.000873182,0.0005624277],"about_ca_topic_score_codex":0.00007672027,"about_ca_topic_score_gemma":0.000038895454,"teacher_disagreement_score":0.40874997,"about_ca_system_score_codex":0.00009110928,"about_ca_system_score_gemma":0.00040316876,"threshold_uncertainty_score":0.99968785},"labels":[],"label_agreement":null},{"id":"W3122568127","doi":"","title":"Multidimensional Meet-in-the-Middle Attack and Its Applications to KATAN32/48/64","year":2011,"lang":"en","type":"article","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Block cipher; Computer science; Key (lock); Key schedule; Block size; Cipher; Computer security; Block (permutation group theory); Boomerang attack; Theoretical computer science; Cryptography; Linear cryptanalysis; Differential cryptanalysis; Mathematics; Encryption","score_opus":0.0884500202643863,"score_gpt":0.31166254347288747,"score_spread":0.22321252320850116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122568127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26901728,0.00006437562,0.7265643,0.0013509872,0.00008674285,0.0006032449,0.00001616981,0.000044643115,0.0022522903],"genre_scores_gemma":[0.59047115,0.000019930376,0.4083838,0.0007913255,0.000022530125,0.00029717767,0.0000074318277,0.0000056266554,0.000001030107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986002,0.00015831941,0.0002795517,0.00046897505,0.00015481883,0.00033814824],"domain_scores_gemma":[0.9989788,0.00030252847,0.00006492197,0.00048526312,0.000051652893,0.00011683644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003243801,0.00014254032,0.00015962012,0.00022108735,0.00021928559,0.00002750517,0.0006429406,0.00004291674,0.00006363214],"category_scores_gemma":[0.00003405233,0.00011989488,0.000051869767,0.0003648252,0.000112361115,0.00013176091,0.0004626977,0.00016743876,0.0001601156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000094953275,0.00011850183,0.002933017,0.000005615451,0.000012416924,0.000013284633,0.013521268,0.0000057230604,0.00036382713,0.9802913,0.00035739652,0.0023681244],"study_design_scores_gemma":[0.001011705,0.00017983267,0.13507389,0.000020768946,0.000019326708,0.00017399577,0.0018563429,0.0055126646,0.00097400503,0.82565784,0.029029235,0.0004904032],"about_ca_topic_score_codex":0.000050810308,"about_ca_topic_score_gemma":0.00059454143,"teacher_disagreement_score":0.3214539,"about_ca_system_score_codex":0.000011610185,"about_ca_system_score_gemma":0.000038514143,"threshold_uncertainty_score":0.48891714},"labels":[],"label_agreement":null},{"id":"W3124691586","doi":"","title":"Functional Re-encryption and Collusion-Resistant Obfuscation","year":2011,"lang":"en","type":"article","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Functional encryption; Obfuscation; Collusion; Encryption; Computer science; Computer security; Public-key cryptography; Theoretical computer science; Key (lock); Cryptography; 40-bit encryption; Function (biology); Ciphertext; Business","score_opus":0.03610540747462432,"score_gpt":0.22590137904639535,"score_spread":0.18979597157177103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124691586","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11223183,0.00007887783,0.88118887,0.00042090664,0.00033906027,0.00016812669,0.000017065968,0.00013076085,0.0054244944],"genre_scores_gemma":[0.47628075,0.00007241219,0.523316,0.00021374776,0.000045873672,0.000035538364,0.00002935815,0.000005772909,5.0372887e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986302,0.00015533065,0.00025207043,0.0005291325,0.00016839588,0.0002648305],"domain_scores_gemma":[0.9989968,0.00016912876,0.0001166035,0.00052365253,0.00006448443,0.0001293269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000283044,0.00015264846,0.00016398344,0.000207702,0.0002728637,0.000042167958,0.00038605125,0.00008571344,0.00018858313],"category_scores_gemma":[0.000063535386,0.00014619286,0.00006896436,0.00023669803,0.00027011608,0.0003753572,0.00051526295,0.00020154627,0.00009733579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009129299,0.000091701084,0.005540758,0.000008469823,0.000020702213,0.000012616025,0.0026019318,0.0000014008964,0.0033950263,0.98302746,0.0006618635,0.0045468076],"study_design_scores_gemma":[0.00026020617,0.00008807445,0.29903328,0.0000084363155,0.0000075865564,0.000029664978,0.00010310328,0.0007682487,0.00062647276,0.69771326,0.0012282804,0.0001333477],"about_ca_topic_score_codex":0.00007334626,"about_ca_topic_score_gemma":0.00018218864,"teacher_disagreement_score":0.36404893,"about_ca_system_score_codex":0.000018144223,"about_ca_system_score_gemma":0.000054999146,"threshold_uncertainty_score":0.5961572},"labels":[],"label_agreement":null},{"id":"W3160438197","doi":"","title":"Improved Fault Analysis on SIMECK Ciphers.","year":2020,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bank of Canada","funders":"","keywords":"Computer science; Correctness; Block cipher; Block (permutation group theory); Computer security; Internet of Things; Key (lock); Cryptography; Embedded system; Algorithm","score_opus":0.02710703697913363,"score_gpt":0.30444328724430497,"score_spread":0.27733625026517134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160438197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03622897,0.00004212318,0.9519949,0.0061925557,0.000740966,0.0006819821,0.00017406314,0.00038298182,0.0035614523],"genre_scores_gemma":[0.5383807,0.00006698218,0.45936167,0.0015488206,0.00013941815,0.00019365706,0.00028134472,0.000026052707,0.0000014005072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99572587,0.00046905837,0.00079469755,0.001902533,0.0004025602,0.00070527015],"domain_scores_gemma":[0.9964919,0.00048078803,0.0005144074,0.0020486312,0.00013287108,0.0003313827],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034101805,0.00059435953,0.0010197198,0.00092880655,0.00026149568,0.0002591985,0.0024842895,0.00032606907,0.00023607409],"category_scores_gemma":[0.00013216991,0.00059683167,0.0009933815,0.0011448852,0.00026482303,0.000105587285,0.003948324,0.0016280359,0.00014245829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004605979,0.00016652321,0.0019878757,0.00003961569,0.0019086865,0.00007655154,0.0047097146,0.001615457,0.00041138858,0.9823181,0.00082306954,0.005896936],"study_design_scores_gemma":[0.00058962416,0.0002276539,0.014925113,0.00001977348,0.00045646014,0.0000072854095,0.00023778214,0.16207266,0.00040657524,0.8178205,0.0024970935,0.0007394653],"about_ca_topic_score_codex":0.0002586859,"about_ca_topic_score_gemma":0.0005680605,"teacher_disagreement_score":0.50215167,"about_ca_system_score_codex":0.00007799136,"about_ca_system_score_gemma":0.00024718035,"threshold_uncertainty_score":0.99964833},"labels":[],"label_agreement":null},{"id":"W3164183106","doi":"","title":"SoK: Game-based Security Models for Group Key Exchange.","year":2021,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Key (lock); Computer science; Compromise; Task (project management); Computer security; Group (periodic table); Computer security model; State (computer science); Algorithm; Law; Economics; Management; Political science","score_opus":0.02590049783558569,"score_gpt":0.26289431689257436,"score_spread":0.23699381905698869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164183106","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034154866,0.0012898438,0.95459574,0.0022859517,0.003676424,0.0017823869,0.0002165378,0.0007290094,0.0012692586],"genre_scores_gemma":[0.38305378,0.00029258154,0.61337876,0.0012060303,0.0005524807,0.0009080667,0.00051950646,0.00008703218,0.0000017639397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932402,0.0009247646,0.0009841103,0.0027802696,0.0005851016,0.001485553],"domain_scores_gemma":[0.9932788,0.0018791093,0.0006853951,0.003436408,0.00030117526,0.0004191108],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0007455129,0.0009814544,0.0014715721,0.0004866577,0.0002561894,0.00044565435,0.0039564325,0.0011225648,0.00007168784],"category_scores_gemma":[0.00018682102,0.001124601,0.0009612573,0.00026455056,0.00053256535,0.0002879949,0.0057402807,0.0024757993,0.00004406442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108447435,0.00047149666,0.00017933364,0.00055006717,0.00029508737,0.0002487635,0.012119216,0.07137795,0.00015624071,0.90547466,0.0012800394,0.0077387076],"study_design_scores_gemma":[0.00059906044,0.00006962013,0.000117194184,0.000155996,0.000039666807,0.0000326921,0.00007254231,0.48814026,0.0003323258,0.5087514,0.0010784382,0.00061079],"about_ca_topic_score_codex":0.00009439046,"about_ca_topic_score_gemma":0.0004338541,"teacher_disagreement_score":0.41676232,"about_ca_system_score_codex":0.00021511607,"about_ca_system_score_gemma":0.00056054647,"threshold_uncertainty_score":0.99982554},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07637538680421993,"score_gpt":0.34903331682097105,"score_spread":0.2726579300167511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185400193","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012503711,0.00024148512,0.8863254,0.09227453,0.0028876483,0.0016976739,0.0006384972,0.0026156267,0.00081540534],"genre_scores_gemma":[0.07561184,0.0003065445,0.9188904,0.0017694385,0.00046067074,0.00043001556,0.0024009454,0.00012672943,0.000003403226],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98894656,0.001512538,0.0013991324,0.0052971537,0.0012119242,0.0016326903],"domain_scores_gemma":[0.9552268,0.0039318246,0.0012052158,0.03882801,0.00022397217,0.000584188],"candidate_categories":["metaresearch","metaepi_narrow","open_science","research_integrity"],"consensus_categories":["open_science","research_integrity"],"category_scores_codex":[0.0011765467,0.0012569276,0.0015368536,0.00051708927,0.00070874137,0.00069069635,0.07830168,0.0014878998,0.00027640862],"category_scores_gemma":[0.051822744,0.0011859513,0.00027460206,0.0006640683,0.00089093053,0.0009086984,0.69896966,0.007884679,0.00039672453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030458625,0.00064335146,0.00086238293,0.00013802135,0.00064555,0.0016561362,0.00015902329,0.007881016,0.00055241695,0.25684083,0.72174025,0.008576472],"study_design_scores_gemma":[0.00044262086,0.00014204654,0.0015070182,0.00035770057,0.000044735258,0.000088459856,0.000011568761,0.49430433,0.0002644015,0.4989259,0.003238351,0.0006728738],"about_ca_topic_score_codex":0.00016199047,"about_ca_topic_score_gemma":0.00006018176,"teacher_disagreement_score":0.71850187,"about_ca_system_score_codex":0.00026532196,"about_ca_system_score_gemma":0.0011206606,"threshold_uncertainty_score":0.9998084},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028033694392838458,"score_gpt":0.275520161173267,"score_spread":0.24748646678042854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193291579","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0527257,0.0002565395,0.94021267,0.00092125457,0.001985459,0.0020934476,0.0002943821,0.0005082793,0.0010022954],"genre_scores_gemma":[0.1678097,0.00018765514,0.83002436,0.00038964083,0.0002580219,0.00091918017,0.00036208547,0.00004879176,5.4524884e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954207,0.0002595729,0.00081820117,0.0022039874,0.00028100514,0.0010165167],"domain_scores_gemma":[0.9959659,0.0006221299,0.00020305291,0.0026303355,0.0002238597,0.00035472424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059256476,0.000719111,0.00096802815,0.00046671747,0.00031500446,0.00026941532,0.0028922874,0.0006302259,0.000055497123],"category_scores_gemma":[0.00013718968,0.000711037,0.000769912,0.00018394517,0.00038019975,0.00033833474,0.0036195726,0.0015362122,0.000045995977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007532206,0.00014605235,0.00030703418,0.00021499803,0.00017485974,0.00002366341,0.0020779592,0.00010357709,0.006399266,0.9640544,0.00068717636,0.025735712],"study_design_scores_gemma":[0.0004907352,0.00016624911,0.0033684848,0.00011144078,0.00006038861,0.000053015843,0.000054459368,0.08637804,0.0024919615,0.9027414,0.0033055225,0.0007783062],"about_ca_topic_score_codex":0.00016183613,"about_ca_topic_score_gemma":0.00020291591,"teacher_disagreement_score":0.115084,"about_ca_system_score_codex":0.000054475735,"about_ca_system_score_gemma":0.00024223226,"threshold_uncertainty_score":0.9995341},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02247108557450471,"score_gpt":0.2501553859783875,"score_spread":0.22768430040388277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193336782","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019543756,0.0034883143,0.9666639,0.0025256353,0.0026403766,0.00038097764,0.000078120465,0.00031332535,0.0043655927],"genre_scores_gemma":[0.13978024,0.0010978233,0.8571307,0.00037388442,0.0013474632,0.00008848419,0.00014546438,0.000031585812,0.000004353342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967764,0.0002744805,0.00043675918,0.0014664001,0.00035916743,0.00068680925],"domain_scores_gemma":[0.9972972,0.0003582813,0.00028273804,0.0014724307,0.000112493944,0.00047680328],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037701396,0.0005363331,0.00056747854,0.00039487585,0.00030418643,0.00028843392,0.0011798341,0.00042349927,0.00041380082],"category_scores_gemma":[0.00010005649,0.00054116035,0.00032137276,0.00020365576,0.0007119143,0.00048387525,0.004882745,0.001508909,0.00023407492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063753934,0.00018647013,0.0029746017,0.00003793136,0.00016738017,0.000026339683,0.006329912,0.000020560086,0.00012577177,0.97787887,0.006466373,0.0057220086],"study_design_scores_gemma":[0.00042015352,0.000061821745,0.06714453,0.000042443728,0.00004528684,0.00017108284,0.00024212063,0.00038840485,0.000048761223,0.9185501,0.012337325,0.0005480122],"about_ca_topic_score_codex":0.00012208705,"about_ca_topic_score_gemma":0.000085536645,"teacher_disagreement_score":0.12023648,"about_ca_system_score_codex":0.00006512993,"about_ca_system_score_gemma":0.00039117615,"threshold_uncertainty_score":0.999704},"labels":[],"label_agreement":null},{"id":"W3193480646","doi":"","title":"Amortizing Garbled Circuits","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Overhead (engineering); Computation; Security parameter; Secure multi-party computation; Oblivious transfer; Cryptography; Electronic circuit; Arithmetic; Computer security; Computer engineering; Theoretical computer science; Algorithm; Programming language; Mathematics","score_opus":0.017623788529937717,"score_gpt":0.25708928340711223,"score_spread":0.23946549487717453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193480646","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035308834,0.0002292805,0.9474789,0.00087832945,0.002323551,0.0005554984,0.00007956691,0.00069351995,0.012452507],"genre_scores_gemma":[0.3513053,0.00014696753,0.64697176,0.0007932228,0.00039452876,0.00017288189,0.0001734202,0.00004140176,4.8606734e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99510986,0.00064931845,0.00081444945,0.0020012474,0.00043809903,0.0009870484],"domain_scores_gemma":[0.99493706,0.00063715054,0.0005816668,0.0033440068,0.00013280564,0.00036729246],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007693252,0.00067845057,0.0009843147,0.000586358,0.00028481212,0.00030833893,0.004059406,0.0005522103,0.0000840835],"category_scores_gemma":[0.00024340859,0.000708864,0.0005670637,0.00029118377,0.00046370353,0.00022233784,0.008223607,0.002157214,0.00043498725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010946893,0.000110805304,0.0026637993,0.00011841584,0.0001464742,0.000116619514,0.001662321,0.00022878619,0.00042178886,0.9810186,0.0013513296,0.01215013],"study_design_scores_gemma":[0.00040127116,0.000061784536,0.012585264,0.00012139852,0.000041132782,0.0001023443,0.000023179648,0.010013034,0.0004471483,0.9677627,0.0076981215,0.00074260007],"about_ca_topic_score_codex":0.00007733094,"about_ca_topic_score_gemma":0.000114387105,"teacher_disagreement_score":0.31599647,"about_ca_system_score_codex":0.000056127363,"about_ca_system_score_gemma":0.00027428116,"threshold_uncertainty_score":0.9997977},"labels":[],"label_agreement":null},{"id":"W3193505954","doi":"","title":"On Protecting Cryptographic Keys Against Continual Leakage.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Adversary; Cryptography; Information leakage; Homomorphic encryption; Computer security; Computation; Side channel attack; Encryption; Security token; Theoretical computer science; Algorithm","score_opus":0.011982207259601349,"score_gpt":0.2512281170499217,"score_spread":0.23924590979032034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193505954","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21021095,0.00009442943,0.7749172,0.0012559983,0.0028369676,0.001387064,0.00017327329,0.00087533623,0.008248783],"genre_scores_gemma":[0.32320988,0.00012308205,0.6738767,0.0014658227,0.00047786674,0.0005722128,0.00019555287,0.00007825891,6.345147e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929365,0.0011148698,0.0010656979,0.002816633,0.0006891767,0.0013771114],"domain_scores_gemma":[0.9928966,0.0015243874,0.000898959,0.0039109923,0.0002979203,0.00047111805],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0014320094,0.0010956003,0.0012219971,0.0012828563,0.0007470133,0.0005002889,0.004746682,0.0012212939,0.00008722343],"category_scores_gemma":[0.0011390896,0.001098907,0.0009176122,0.0006072957,0.000998181,0.00030374882,0.0071571097,0.009417426,0.00032954692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008846561,0.00034849092,0.00092950277,0.00011849964,0.00020746439,0.00021081085,0.002562443,0.00021237522,0.002175336,0.97526526,0.0007845877,0.01709678],"study_design_scores_gemma":[0.0007782051,0.0002193324,0.005148725,0.0002452242,0.000035983063,0.000060345392,0.00010095078,0.0040958556,0.0016082828,0.9825978,0.003956637,0.0011526031],"about_ca_topic_score_codex":0.000108909146,"about_ca_topic_score_gemma":0.00046674913,"teacher_disagreement_score":0.11299893,"about_ca_system_score_codex":0.000049416944,"about_ca_system_score_gemma":0.00035439277,"threshold_uncertainty_score":0.9991461},"labels":[],"label_agreement":null},{"id":"W3193950766","doi":"","title":"FleXOR: Flexible garbling for XOR gates that beats free-XOR.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Bell (Canada)","funders":"","keywords":"XOR gate; Computer science; Bitwise operation; Cryptography; Exclusive or; Key (lock); Hash function; Government (linguistics); Theoretical computer science; Algorithm; Logic gate; Computer security; Programming language","score_opus":0.03717708644604003,"score_gpt":0.2869611467285073,"score_spread":0.24978406028246727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193950766","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009266253,0.0005751886,0.9771486,0.0032544802,0.002992434,0.0014988744,0.0006987979,0.0009234773,0.003641931],"genre_scores_gemma":[0.061779045,0.00027378564,0.9350318,0.0009522144,0.00060958596,0.00069677294,0.0005809827,0.00007300184,0.0000028441573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99427575,0.00046839556,0.000873079,0.002516759,0.00048949587,0.0013765502],"domain_scores_gemma":[0.99235076,0.0018953157,0.00069951423,0.004417984,0.0002071943,0.00042921386],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0011257477,0.0009269078,0.0013018552,0.0007655314,0.00051164976,0.00045843088,0.0060790344,0.00072483195,0.00007294596],"category_scores_gemma":[0.000486428,0.00093182,0.00093553035,0.000281734,0.0006596479,0.00034643,0.009713812,0.0016965589,0.00014965063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001098872,0.00018695125,0.0022236684,0.00032017232,0.00025832988,0.00002726509,0.0015786804,0.00052333646,0.00033363383,0.9797043,0.008162038,0.006571718],"study_design_scores_gemma":[0.00095811445,0.00017270751,0.0024324637,0.00019921685,0.00007902519,0.000054210854,0.000053905907,0.019058503,0.0040791165,0.94057685,0.031387188,0.000948676],"about_ca_topic_score_codex":0.00012115101,"about_ca_topic_score_gemma":0.0002536771,"teacher_disagreement_score":0.05251279,"about_ca_system_score_codex":0.00007190558,"about_ca_system_score_gemma":0.00032723573,"threshold_uncertainty_score":0.99931324},"labels":[],"label_agreement":null},{"id":"W3194688402","doi":"","title":"Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima.","year":2009,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Subtraction; Computation; Maxima and minima; Multiplication (music); Integer (computer science); Adder; Function (biology); Selection (genetic algorithm); Common value auction; Secure multi-party computation; Theoretical computer science; Algorithm; Arithmetic; Mathematics; Artificial intelligence; Programming language; Latency (audio)","score_opus":0.016989484626085495,"score_gpt":0.2754775934787398,"score_spread":0.2584881088526543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194688402","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039621178,0.0003498001,0.9557599,0.0014353637,0.0002818252,0.0011555179,0.000093975585,0.00031981812,0.000982637],"genre_scores_gemma":[0.15735607,0.00014190057,0.84161824,0.00043554994,0.00021620863,0.00017373252,0.00004097453,0.000017024706,2.9792463e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99683183,0.0001856026,0.0005494976,0.001672186,0.00016234937,0.0005985328],"domain_scores_gemma":[0.9974169,0.00047079113,0.00027802202,0.0013336596,0.00009895035,0.0004016345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004204013,0.00045095244,0.00060721894,0.0005576486,0.0005127994,0.00031138607,0.001178987,0.00029117067,0.000006671142],"category_scores_gemma":[0.0000820543,0.00050595053,0.00014366281,0.00033652948,0.00033758074,0.00012763565,0.004611874,0.001086841,0.0000074375184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011566365,0.000090324305,0.00075209216,0.00005939782,0.00008099222,0.000009756728,0.0019980182,0.00012310357,0.002335009,0.93684006,0.00014378203,0.057555903],"study_design_scores_gemma":[0.00035374478,0.00008730462,0.012012025,0.00008721147,0.000052948348,0.00016169848,0.00007688045,0.015509155,0.00029584492,0.96674675,0.0040496015,0.000566843],"about_ca_topic_score_codex":0.0000783136,"about_ca_topic_score_gemma":0.00008559649,"teacher_disagreement_score":0.117734894,"about_ca_system_score_codex":0.000036152167,"about_ca_system_score_gemma":0.0001222121,"threshold_uncertainty_score":0.9997392},"labels":[],"label_agreement":null},{"id":"W3195052898","doi":"","title":"Reproducible Circularly-Secure Bit Encryption: Applications and Realizations.","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Encryption; Probabilistic encryption; 40-bit encryption; 56-bit encryption; Computer science; Deterministic encryption; Multiple encryption; Theoretical computer science; Plaintext-aware encryption; Semantic security; Cryptographic primitive; Attribute-based encryption; Mathematics; Cryptography; Public-key cryptography; Algorithm; Computer security; Cryptographic protocol","score_opus":0.025590842349408234,"score_gpt":0.2749388412211416,"score_spread":0.24934799887173337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195052898","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026962827,0.0020081496,0.9859866,0.0025447637,0.0005945469,0.0012181309,0.0002925889,0.0005272654,0.004131666],"genre_scores_gemma":[0.032167308,0.0014720095,0.963248,0.0004305857,0.000468666,0.0011471345,0.0010207102,0.00004380536,0.000001741141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99551696,0.00043789667,0.00067438005,0.0024320846,0.00038825104,0.0005504594],"domain_scores_gemma":[0.9945708,0.00023019721,0.00044419043,0.003979121,0.00036835132,0.00040733296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009902926,0.00050480047,0.00063347525,0.00057169463,0.0003597911,0.00033152755,0.0019994196,0.00051270414,0.000029774865],"category_scores_gemma":[0.00023584126,0.0005419371,0.00021011455,0.0006010956,0.00060660875,0.00035156598,0.0053149583,0.0013039204,0.0001172187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011317578,0.00013879056,0.0027637514,0.00012362478,0.00010076455,0.000024675002,0.0023454102,0.0001554585,0.00017340589,0.98692626,0.0028609862,0.004375564],"study_design_scores_gemma":[0.00028710492,0.000043578293,0.002709132,0.00005595557,0.00004991784,0.00014807686,0.00007843426,0.0031585838,0.000076164106,0.94936585,0.043507002,0.00052018627],"about_ca_topic_score_codex":0.00012222973,"about_ca_topic_score_gemma":0.00012250006,"teacher_disagreement_score":0.040646017,"about_ca_system_score_codex":0.00006662136,"about_ca_system_score_gemma":0.00047853173,"threshold_uncertainty_score":0.9997032},"labels":[],"label_agreement":null},{"id":"W3195953963","doi":"","title":"Finding discrete logarithms with a set orbit distinguisher.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Discrete logarithm; Logarithm; Binary logarithm; Mathematics; Time complexity; Discrete mathematics; Set (abstract data type); Prime (order theory); Combinatorics; Polynomial; Algorithm; Computer science; Public-key cryptography","score_opus":0.019487887778501516,"score_gpt":0.2691911555552283,"score_spread":0.2497032677767268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195953963","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092281066,0.000056318862,0.8897069,0.0012369383,0.0016610124,0.0005562834,0.00007608869,0.0006385047,0.013786864],"genre_scores_gemma":[0.37454456,0.000018865356,0.6245363,0.00026017075,0.00030324937,0.0001941404,0.00007994324,0.0000544475,0.000008350223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955677,0.00049761217,0.00058333675,0.001921069,0.00042065675,0.0010096577],"domain_scores_gemma":[0.9955897,0.0008179992,0.00056625303,0.0025536222,0.0001373761,0.0003350736],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00074354326,0.0007836557,0.00088769465,0.00050689606,0.00046288825,0.0004125513,0.003626805,0.0005718602,0.00011719995],"category_scores_gemma":[0.00024574125,0.0006721238,0.00041115156,0.00037011507,0.0009867323,0.00017375025,0.00607527,0.0037161957,0.00012596248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010214832,0.00007599237,0.008162643,0.000092860406,0.00023412732,0.00038329276,0.0036667774,0.00027585146,0.00026857306,0.98079896,0.0002541097,0.0056846477],"study_design_scores_gemma":[0.0005012786,0.00020516406,0.0072485083,0.00025752262,0.00007286341,0.0002969065,0.00008142834,0.0055861296,0.0004056453,0.98000914,0.00437458,0.00096081966],"about_ca_topic_score_codex":0.00007412135,"about_ca_topic_score_gemma":0.00032772476,"teacher_disagreement_score":0.2822635,"about_ca_system_score_codex":0.00004837582,"about_ca_system_score_gemma":0.00030937456,"threshold_uncertainty_score":0.999573},"labels":[],"label_agreement":null},{"id":"W3196154141","doi":"","title":"Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation.","year":2013,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Correctness; Random oracle; Oracle; Secure multi-party computation; Protocol (science); Covert; Computer security; Gas meter prover; Oblivious transfer; Theoretical computer science; Security parameter; Key (lock); Standard Model (mathematical formulation); Cryptography; Mathematical proof; Public-key cryptography; Algorithm; Encryption; Mathematics; Programming language","score_opus":0.01821909496241206,"score_gpt":0.2712479273512521,"score_spread":0.25302883238884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196154141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24446966,0.00063193694,0.7481534,0.0009087145,0.0013100727,0.0012782156,0.00016658993,0.0005123365,0.0025690757],"genre_scores_gemma":[0.7532124,0.00018069756,0.24486698,0.0006478974,0.00028460496,0.00035423483,0.00038599572,0.00006644842,7.678019e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934453,0.00071671174,0.0011449995,0.0027373142,0.0006857874,0.0012699101],"domain_scores_gemma":[0.99523306,0.00086235517,0.00084747083,0.002132532,0.0003446115,0.00057994254],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00079494866,0.001031996,0.0013427029,0.0007839342,0.0005478192,0.0006328526,0.0024876662,0.0006056665,0.0000883204],"category_scores_gemma":[0.00019969535,0.0010516112,0.00045107934,0.0005312419,0.00090724207,0.00030108608,0.0063759973,0.0024266047,0.00015475093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016546353,0.00032760226,0.002890299,0.00033083395,0.000332494,0.00014829024,0.011620669,0.008354206,0.0008683727,0.9603899,0.0008242984,0.013896463],"study_design_scores_gemma":[0.0016727974,0.000086391534,0.02513047,0.0003296252,0.000106781445,0.00024701573,0.00026576253,0.17659542,0.00036743272,0.7930159,0.00089094235,0.0012914381],"about_ca_topic_score_codex":0.00017123009,"about_ca_topic_score_gemma":0.00007256646,"teacher_disagreement_score":0.50874275,"about_ca_system_score_codex":0.00010900392,"about_ca_system_score_gemma":0.00039565618,"threshold_uncertainty_score":0.99987483},"labels":[],"label_agreement":null},{"id":"W3197558738","doi":"","title":"Compact Ring Signatures from Learning With Errors.","year":2021,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ring signature; Ring (chemistry); Computer science; Anonymity; Signature (topology); Sign (mathematics); Identity (music); Cryptography; Function (biology); Computer security; Digital signature; Theoretical computer science; Mathematics; Physics; Geometry","score_opus":0.013334096394039428,"score_gpt":0.2460657678444619,"score_spread":0.23273167145042248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197558738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.266073,0.0007267695,0.728707,0.00054512685,0.00063688593,0.0002650442,0.000079629375,0.00040710968,0.0025594337],"genre_scores_gemma":[0.55580974,0.00010714336,0.443273,0.00017245511,0.00013638982,0.00002633976,0.00044740402,0.000027263559,2.5307983e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99553776,0.0007827528,0.00051264756,0.00193814,0.00046571274,0.0007630172],"domain_scores_gemma":[0.99627167,0.0008552288,0.0004713172,0.001975753,0.00013332635,0.00029268753],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00030455185,0.00067251467,0.0009667656,0.00037095934,0.00034055597,0.0004836792,0.002516068,0.000467127,0.00014586636],"category_scores_gemma":[0.00013816843,0.0006220239,0.00038076015,0.00032302865,0.0004496547,0.0003114693,0.00459586,0.004066842,0.000047759877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094959854,0.00019351766,0.020176826,0.000075588374,0.0005681751,0.00076450716,0.008692925,0.013003102,0.0010609095,0.95232034,0.00024836167,0.0028008088],"study_design_scores_gemma":[0.00091118604,0.00017867687,0.081246525,0.0005601769,0.00011277874,0.00009143815,0.000757643,0.04216952,0.0021263745,0.86720634,0.0032280963,0.0014112374],"about_ca_topic_score_codex":0.00081258186,"about_ca_topic_score_gemma":0.0009726599,"teacher_disagreement_score":0.28973675,"about_ca_system_score_codex":0.00005319045,"about_ca_system_score_gemma":0.00034523752,"threshold_uncertainty_score":0.9996231},"labels":[],"label_agreement":null},{"id":"W3203234318","doi":"","title":"BOREALIS: Building Block for Sealed Bid Auctions on Blockchains","year":2019,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Homomorphic encryption; Computer science; Secure multi-party computation; Encryption; Theoretical computer science; Cryptography; Integer (computer science); Ciphertext; ElGamal encryption; Computation; Symmetric-key algorithm; Computer security; Public-key cryptography; Algorithm","score_opus":0.023148517385478,"score_gpt":0.2904831080331036,"score_spread":0.2673345906476256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203234318","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020089293,0.000116195595,0.96527404,0.0035644143,0.0028854317,0.0018126996,0.0020664781,0.0005694722,0.0036219745],"genre_scores_gemma":[0.056546826,0.0001609699,0.94021714,0.0009784675,0.0006141759,0.0007562631,0.00065939437,0.00006375196,0.0000030094177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99556905,0.00034259944,0.0007044867,0.0020504948,0.0003688508,0.0009645399],"domain_scores_gemma":[0.99474317,0.001227456,0.00049810775,0.0030562507,0.00018381121,0.00029118275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005720084,0.0006860661,0.00090069504,0.00085892173,0.00041184726,0.00021868458,0.0029656538,0.00056617125,0.000017313661],"category_scores_gemma":[0.00024722327,0.00070256955,0.00076387543,0.00034076322,0.00033869094,0.00013325165,0.0037750043,0.0016310366,0.000078572244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009415294,0.00026364627,0.00050457945,0.00014922844,0.00026819963,0.000023829865,0.0010826157,0.0054631457,0.00030043884,0.9831698,0.006099482,0.0025809081],"study_design_scores_gemma":[0.00085353985,0.00027573906,0.0026899467,0.00018434571,0.00007723794,0.000065552405,0.000057443227,0.028394492,0.0009179641,0.9344265,0.031267878,0.00078938965],"about_ca_topic_score_codex":0.00014706135,"about_ca_topic_score_gemma":0.000278809,"teacher_disagreement_score":0.048743304,"about_ca_system_score_codex":0.00009739467,"about_ca_system_score_gemma":0.00036873855,"threshold_uncertainty_score":0.99954253},"labels":[],"label_agreement":null},{"id":"W3203863013","doi":"","title":"Physical Security of Deep Learning on Edge Devices: Comprehensive Evaluation of Fault Injection Attack Vectors","year":2019,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Softmax function; Computer science; Deep learning; Fault (geology); Enhanced Data Rates for GSM Evolution; Computer security; Artificial intelligence; Countermeasure; Artificial neural network; Fault injection; Attack surface; Deep neural networks; Edge device; Reliability (semiconductor); Machine learning; Software; Power (physics); Cloud computing","score_opus":0.03799752205158395,"score_gpt":0.3391170141051966,"score_spread":0.30111949205361266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203863013","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51251835,0.000049378064,0.48430952,0.00006075499,0.0009792997,0.0005752852,0.000006052419,0.00008104817,0.0014203148],"genre_scores_gemma":[0.9541678,0.000013512534,0.045430005,0.000035059515,0.00019650257,0.00005584235,0.00006574998,0.00003482573,7.1350144e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99370533,0.002817182,0.0007574943,0.0012403809,0.0010400848,0.00043950038],"domain_scores_gemma":[0.99445415,0.0017739994,0.0015993598,0.0012444807,0.00083516206,0.00009286747],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0009838839,0.00051565235,0.0011402807,0.00050555315,0.00013440727,0.000034999677,0.001467565,0.00039976017,0.000030161154],"category_scores_gemma":[0.00090457493,0.0005340152,0.0004002256,0.00030737923,0.00039176494,0.00017234887,0.0030049803,0.0026815059,0.00007235396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010037673,0.00020005151,0.009543729,0.00030997026,0.00023284642,0.000003895032,0.016502647,0.8733334,0.00058418507,0.08621135,0.000011949983,0.01296558],"study_design_scores_gemma":[0.00072277914,0.0003824968,0.02921263,0.0002500708,0.00013710208,0.000010552441,0.00036458802,0.8393377,0.0011495594,0.12799165,0.000063684194,0.00037717086],"about_ca_topic_score_codex":0.00012474056,"about_ca_topic_score_gemma":0.000060738737,"teacher_disagreement_score":0.44164944,"about_ca_system_score_codex":0.00022146733,"about_ca_system_score_gemma":0.0003346466,"threshold_uncertainty_score":0.99971116},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012880954588559567,"score_gpt":0.24794286298663512,"score_spread":0.23506190839807556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204067048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045936454,0.0007217564,0.9146875,0.019173611,0.003570368,0.00165478,0.00033988143,0.0008678457,0.013047785],"genre_scores_gemma":[0.7656479,0.0021399169,0.21033412,0.019575974,0.00079166744,0.0010431965,0.00021490376,0.00024051931,0.000011786114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926665,0.001198936,0.0009564958,0.0027812412,0.0010184963,0.0013783767],"domain_scores_gemma":[0.99180096,0.0029391258,0.0006604456,0.003899297,0.00024027693,0.00045989716],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0006516502,0.0012889119,0.001277695,0.0022920207,0.00046121117,0.00020563537,0.0037865224,0.0006724244,0.00012349828],"category_scores_gemma":[0.00034238448,0.0009959942,0.0014287955,0.00055832666,0.0011146938,0.00012467595,0.0018496016,0.0024007559,0.0010266257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044366668,0.0008946386,0.0011036751,0.00035203356,0.00033702716,0.0002765731,0.0005008822,0.0016176773,0.0006183439,0.9844504,0.0020435252,0.007361544],"study_design_scores_gemma":[0.0011974797,0.0022641784,0.022108058,0.0031485234,0.000098293116,0.00003438783,0.00002747398,0.0067229485,0.003743196,0.9568991,0.0022473726,0.0015090079],"about_ca_topic_score_codex":0.000029300389,"about_ca_topic_score_gemma":0.000017758824,"teacher_disagreement_score":0.7197115,"about_ca_system_score_codex":0.00008602918,"about_ca_system_score_gemma":0.00037685942,"threshold_uncertainty_score":0.9999863},"labels":[],"label_agreement":null},{"id":"W3204620253","doi":"","title":"x-only point addition formula and faster compressed SIKE","year":2020,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Waterloo","funders":"","keywords":"Computer science; Binary number; Torsion (gastropod); Algorithm; Parallel computing; Arithmetic; Mathematics","score_opus":0.016129434009253287,"score_gpt":0.24064784039057227,"score_spread":0.22451840638131898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204620253","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026600786,0.00027935603,0.96038496,0.006808087,0.00080441893,0.0007236032,0.00013215047,0.00036520587,0.00390141],"genre_scores_gemma":[0.4036736,0.00022770044,0.5942891,0.0012617636,0.00021890542,0.00013344189,0.00015554049,0.000037878253,0.0000020450038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99664295,0.00038658222,0.00058624696,0.0014749623,0.00030981313,0.00059946114],"domain_scores_gemma":[0.9975266,0.00052742916,0.00034968386,0.0011702491,0.000091080394,0.0003349672],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021015135,0.0005476441,0.00075035857,0.00038793715,0.00022529013,0.0002477507,0.0014673806,0.00037761265,0.00007079527],"category_scores_gemma":[0.00008069482,0.0005191311,0.00034185982,0.00020127463,0.00051752076,0.00020624227,0.005299302,0.0014619927,0.000116791685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061029732,0.000116030096,0.0013568924,0.00021240696,0.0002300541,0.00020974818,0.0037325013,0.0002017029,0.0011063033,0.97120017,0.0015697896,0.020003388],"study_design_scores_gemma":[0.000683287,0.0001544412,0.029292341,0.00014975092,0.00005563688,0.00022151065,0.00007674084,0.022996431,0.0006406278,0.9420268,0.0031050907,0.00059736246],"about_ca_topic_score_codex":0.000044552275,"about_ca_topic_score_gemma":0.0000715587,"teacher_disagreement_score":0.3770728,"about_ca_system_score_codex":0.000027634134,"about_ca_system_score_gemma":0.00018196496,"threshold_uncertainty_score":0.999726},"labels":[],"label_agreement":null},{"id":"W3205729875","doi":"","title":"Type 2 Structure-Preserving Signature Schemes Revisited.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bilinear interpolation; Medicine; Statistics; Mathematics","score_opus":0.012547767710343284,"score_gpt":0.2628137755039502,"score_spread":0.2502660077936069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205729875","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030635819,0.0015077491,0.96027553,0.0010570177,0.0020393494,0.00057117635,0.0002534701,0.0005593657,0.0031005132],"genre_scores_gemma":[0.1794998,0.00027413428,0.8182502,0.00085690216,0.00051879307,0.000031106894,0.000525242,0.0000431118,7.515288e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99540263,0.0006613457,0.00066581543,0.0019597937,0.00046594808,0.0008444363],"domain_scores_gemma":[0.9944928,0.0005798164,0.0005244132,0.0038404148,0.00025712085,0.0003053909],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0004671384,0.00072944455,0.0009715693,0.00052848563,0.00027403765,0.0003418368,0.005460032,0.0008744996,0.00028277922],"category_scores_gemma":[0.00050378183,0.00069931115,0.00033995858,0.00046794827,0.00037004324,0.0002739171,0.012649283,0.0032375357,0.00013393906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040106723,0.000053255884,0.0017010927,0.00023971665,0.00018427156,0.000058500973,0.00081392284,0.00025323543,0.0017435969,0.9837021,0.0076520983,0.003558083],"study_design_scores_gemma":[0.000254079,0.000082949315,0.003426712,0.00019626731,0.00004363653,0.000052010375,0.000013780071,0.008091892,0.00092656707,0.94535285,0.040847257,0.0007120066],"about_ca_topic_score_codex":0.000038025042,"about_ca_topic_score_gemma":0.00006443784,"teacher_disagreement_score":0.14886399,"about_ca_system_score_codex":0.000044931345,"about_ca_system_score_gemma":0.00023620832,"threshold_uncertainty_score":0.9999209},"labels":[],"label_agreement":null},{"id":"W3206426892","doi":"","title":"A Game Theoretic Analysis of Resource Mining in Blockchain","year":2018,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University; University of Waterloo","funders":"","keywords":"Cryptocurrency; Nash equilibrium; Blockchain; Computer science; Game theory; Resource (disambiguation); Work (physics); Mathematical economics; Computer security; Economics","score_opus":0.011842020167570248,"score_gpt":0.2595485486365651,"score_spread":0.24770652846899488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206426892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4581654,0.0001059746,0.53857255,0.00083939225,0.00007008466,0.00028604222,0.000025153387,0.00013216483,0.0018032395],"genre_scores_gemma":[0.7139366,0.000027579852,0.28566915,0.00011517758,0.000025809979,0.00018312108,0.000027824639,0.000013557747,0.0000011639734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99642646,0.00055162155,0.00088666397,0.0013515427,0.00023334949,0.00055033737],"domain_scores_gemma":[0.9956424,0.0007741689,0.0006395505,0.0027382548,0.00011024439,0.00009538243],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010855763,0.00038134016,0.0011350608,0.0022343209,0.00007344986,0.000028867054,0.0031522366,0.0006626032,0.000044364588],"category_scores_gemma":[0.00019104252,0.0003938351,0.0003887387,0.0015751466,0.0013756887,0.000018101495,0.005031056,0.0011523461,0.00001914863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020188902,0.00016896159,0.013989434,0.000045003602,0.0005833451,0.000027613842,0.007180582,0.002792304,0.00008829378,0.9717027,0.00005330547,0.003348283],"study_design_scores_gemma":[0.0001970046,0.000052205938,0.015203154,0.000068121604,0.00018705978,0.000010815937,0.00014171429,0.22519849,0.0004616818,0.757933,0.00026175662,0.00028494388],"about_ca_topic_score_codex":0.00008460031,"about_ca_topic_score_gemma":0.00039903677,"teacher_disagreement_score":0.25577122,"about_ca_system_score_codex":0.00006432596,"about_ca_system_score_gemma":0.00016085595,"threshold_uncertainty_score":0.99985135},"labels":[],"label_agreement":null},{"id":"W3206679013","doi":"","title":"Riding on Asymmetry: Efficient ABE for Branching Programs.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Functional encryption; Ciphertext; Encryption; Theoretical computer science; Learning with errors; Security token; Secret sharing; Attribute-based encryption; Homomorphic encryption; Homomorphic secret sharing; 40-bit encryption; Public-key cryptography; Algorithm; Computer security; Cryptography","score_opus":0.02244870409367549,"score_gpt":0.27697311127158747,"score_spread":0.25452440717791197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206679013","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050901793,0.00010482839,0.9401781,0.0010654333,0.0022987814,0.001762757,0.00015205775,0.0006086405,0.0029276418],"genre_scores_gemma":[0.30443394,0.00002186738,0.6938238,0.0005020957,0.00038291025,0.0005299972,0.0002613559,0.000043793927,2.5205705e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99495834,0.000472858,0.00074535486,0.0022331495,0.00045855338,0.00113176],"domain_scores_gemma":[0.99505776,0.0013644478,0.0005857517,0.0025399493,0.00013266002,0.0003194001],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012630809,0.0007421301,0.000975589,0.00068531715,0.00046681298,0.00040295708,0.0032146613,0.0004927702,0.000011625865],"category_scores_gemma":[0.00033659174,0.00072660594,0.0007665568,0.00026826284,0.00036030245,0.000097741075,0.0042046346,0.0017518247,0.00012325814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000914372,0.00035895503,0.0004602475,0.0002455823,0.00015041148,0.000017510625,0.0016385174,0.0031120374,0.000117311065,0.95457095,0.0006371422,0.03859988],"study_design_scores_gemma":[0.0007848516,0.00033196056,0.0013177443,0.00035483344,0.00004233705,0.000026708865,0.000033250602,0.09915838,0.0007530622,0.8860326,0.010365017,0.00079928193],"about_ca_topic_score_codex":0.000044785258,"about_ca_topic_score_gemma":0.000043599262,"teacher_disagreement_score":0.25353214,"about_ca_system_score_codex":0.00008554305,"about_ca_system_score_gemma":0.00018463834,"threshold_uncertainty_score":0.9995185},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01777655156329359,"score_gpt":0.23603149127741185,"score_spread":0.21825493971411827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210270412","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025590494,0.002802506,0.96036386,0.0011453389,0.00095387344,0.0009654189,0.000050094768,0.00026725203,0.007861153],"genre_scores_gemma":[0.11509411,0.00063409685,0.88339674,0.00021422264,0.00014250347,0.00042390762,0.000054454136,0.00003433713,0.0000056315384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962028,0.00046042973,0.00093480584,0.0012989754,0.00039173866,0.00071124884],"domain_scores_gemma":[0.9962746,0.000605889,0.0007196971,0.0020673475,0.00015876463,0.00017372693],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046511219,0.0005625153,0.0010065591,0.0006571921,0.00012880645,0.00006527438,0.00276717,0.00035634206,0.00003407035],"category_scores_gemma":[0.00009813795,0.0005419149,0.00067649636,0.00038259735,0.00084925734,0.00011952289,0.004119733,0.0012711475,0.000071427625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022281649,0.00035894217,0.014999302,0.001048241,0.00028793217,0.00013447725,0.0004676939,0.0014668513,0.0002228489,0.96688837,0.0043187654,0.009784292],"study_design_scores_gemma":[0.0005809871,0.00022703843,0.051113576,0.0011669558,0.00012926914,0.00011437735,0.000029841076,0.006745407,0.0015095632,0.92825556,0.009179887,0.0009475191],"about_ca_topic_score_codex":0.0002653087,"about_ca_topic_score_gemma":0.000089424575,"teacher_disagreement_score":0.089503616,"about_ca_system_score_codex":0.000036793692,"about_ca_system_score_gemma":0.00034487498,"threshold_uncertainty_score":0.9997032},"labels":[],"label_agreement":null},{"id":"W3210576683","doi":"","title":"Tight Bounds for Simon's Algorithm.","year":2020,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptanalysis; Computer science; Algorithm; Quantum algorithm; Quantum; Cryptography","score_opus":0.026137396383050564,"score_gpt":0.2791080035786509,"score_spread":0.2529706071956003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210576683","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068749604,0.00031951437,0.9848393,0.0065024043,0.0024802266,0.0011718883,0.0010813666,0.0006227594,0.0022950424],"genre_scores_gemma":[0.0046226033,0.00014928805,0.9922732,0.0011863421,0.0005791887,0.0004888226,0.0006566789,0.000043209075,6.452403e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99567974,0.0002909466,0.00068501476,0.0021156587,0.00035133434,0.0008772844],"domain_scores_gemma":[0.9960434,0.00078864576,0.00043198653,0.0021579277,0.00015497123,0.00042308407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040235248,0.0006710086,0.00095575675,0.00036216906,0.0003239505,0.0003436537,0.0039383364,0.00052485697,0.000048605194],"category_scores_gemma":[0.00020429505,0.0006929625,0.00075808354,0.0002988379,0.0004915186,0.00023754472,0.0070718187,0.0015766659,0.00016068658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044287077,0.00012883115,0.00026077227,0.00013866815,0.00022275015,0.000080977734,0.0015945309,0.00003924183,0.00010846379,0.9557328,0.010215506,0.03143312],"study_design_scores_gemma":[0.0005254118,0.00015073668,0.0009755972,0.00004558435,0.000049988055,0.000019040666,0.00003516448,0.038435414,0.00044147993,0.87685305,0.08182677,0.00064175884],"about_ca_topic_score_codex":0.000047298738,"about_ca_topic_score_gemma":0.00008345577,"teacher_disagreement_score":0.078879796,"about_ca_system_score_codex":0.00005457637,"about_ca_system_score_gemma":0.00042323154,"threshold_uncertainty_score":0.99955213},"labels":[],"label_agreement":null},{"id":"W3210870794","doi":"","title":"Implementation of a Leakage-Resilient ElGamal Key Encapsulation Mechanism","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Leakage (economics); Computer science; Exponentiation; Cryptography; Bounded function; Theoretical computer science; Key encapsulation; Distributed computing; Mathematics; Computer security; Public-key cryptography; Encryption","score_opus":0.014960937843101872,"score_gpt":0.3025323465778388,"score_spread":0.2875714087347369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210870794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32575083,0.00002716697,0.671725,0.00056638656,0.00067870534,0.00067907106,0.00006674492,0.000105738254,0.0004003966],"genre_scores_gemma":[0.6536078,0.00004175833,0.34584603,0.00010847049,0.00007203692,0.00014757445,0.00015945379,0.000016447097,4.101089e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99619275,0.0005730347,0.001104225,0.001064027,0.0005057291,0.0005602139],"domain_scores_gemma":[0.9970732,0.00028059428,0.0009344249,0.0013363963,0.00022717779,0.00014821572],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007739745,0.00043384416,0.0006562147,0.00069361797,0.00019204504,0.00010194033,0.0013676962,0.00025626665,0.00019927364],"category_scores_gemma":[0.000048606995,0.00046123733,0.000371322,0.00026458286,0.00020913874,0.00016857171,0.0025225496,0.00065971585,0.0000370601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014663463,0.000091628244,0.003258402,0.00009458468,0.00012061426,0.0000071304326,0.0059598773,0.0004998981,0.0027335219,0.9763847,0.00016150117,0.010673472],"study_design_scores_gemma":[0.00075737707,0.00018659263,0.039622437,0.0000445309,0.000055685803,0.00001933632,0.00047959667,0.017598646,0.007231789,0.93314576,0.0004473913,0.000410875],"about_ca_topic_score_codex":0.00062491157,"about_ca_topic_score_gemma":0.00087250734,"teacher_disagreement_score":0.327857,"about_ca_system_score_codex":0.00007495498,"about_ca_system_score_gemma":0.00029103263,"threshold_uncertainty_score":0.99978393},"labels":[],"label_agreement":null},{"id":"W3211268411","doi":"","title":"Post-Quantum Key-Blinding for Authentication in Anonymity Networks.","year":2021,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Anonymity; Computer science; Blinding; Computer security; Authentication (law); Public-key cryptography; Key (lock); Rendezvous; Computer network; Engineering","score_opus":0.0184934084659512,"score_gpt":0.2762658638232204,"score_spread":0.25777245535726917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211268411","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17259388,0.00030425104,0.8227283,0.0011878285,0.0017286652,0.0009502742,0.00014854704,0.00016743441,0.0001908339],"genre_scores_gemma":[0.43187883,0.00016417222,0.566427,0.0002536729,0.00015127542,0.0003354301,0.0007675862,0.000021840659,1.7567149e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99598616,0.000505498,0.00077911664,0.0016788751,0.00024147354,0.00080887345],"domain_scores_gemma":[0.9963206,0.0009753562,0.00044021732,0.0018667658,0.00021597237,0.00018109842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009492095,0.00046791282,0.0007415085,0.0006266401,0.00020661588,0.0003265351,0.0021361136,0.0005166957,0.00002922251],"category_scores_gemma":[0.00041306406,0.0005213629,0.0004593497,0.00042323244,0.00026275142,0.00032062805,0.004229123,0.0013114073,0.000015009996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007814928,0.0002598303,0.0069645126,0.00013186854,0.00008646003,0.000062363724,0.0042226654,0.0009956649,0.00041693044,0.9828729,0.0001012835,0.0038073945],"study_design_scores_gemma":[0.0006216573,0.00006642951,0.038903777,0.00015958892,0.000032091815,0.000030431991,0.0001943654,0.13493578,0.00025969328,0.82385427,0.000416968,0.0005249522],"about_ca_topic_score_codex":0.000121729994,"about_ca_topic_score_gemma":0.00066054694,"teacher_disagreement_score":0.25928494,"about_ca_system_score_codex":0.00008433972,"about_ca_system_score_gemma":0.0003550922,"threshold_uncertainty_score":0.9997238},"labels":[],"label_agreement":null},{"id":"W3211971641","doi":"","title":"Verifiable Obtained Random Subsets for Improving SPHINCS","year":2021,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"NIST; Verifiable secret sharing; Computer science; Hash function; Digital signature; Cryptography; Standardization; Theoretical computer science; Computation; Algorithm; Set (abstract data type); Computer security","score_opus":0.01530762856471051,"score_gpt":0.2551167513221477,"score_spread":0.23980912275743715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211971641","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03559498,0.0006721964,0.95704275,0.00080743164,0.0026232558,0.0013838721,0.0003401324,0.00041579362,0.0011196109],"genre_scores_gemma":[0.08586972,0.0001371387,0.9118758,0.00036732169,0.000281785,0.00061774335,0.00080662395,0.000042969463,9.2096656e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99537486,0.0004195003,0.0008007208,0.002074543,0.0002947872,0.0010356172],"domain_scores_gemma":[0.995028,0.0011661533,0.0005114463,0.0027289062,0.00026364822,0.00030180148],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000903939,0.0006642775,0.001128562,0.00038315,0.000392514,0.0005224798,0.002916218,0.00054368225,0.00006857435],"category_scores_gemma":[0.0005727446,0.00070004945,0.0008158262,0.00030631444,0.00033986167,0.00036927158,0.006196108,0.0013748481,0.00003356042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025873323,0.00022217756,0.0005605733,0.00046170002,0.00023810077,0.00010919524,0.0026379663,0.00036314936,0.0019153141,0.98224914,0.0008211154,0.01016281],"study_design_scores_gemma":[0.0027044937,0.00009936118,0.0010427881,0.000106481406,0.00009277122,0.00007679767,0.00017756238,0.041548155,0.0032127376,0.94595593,0.0040768683,0.0009060627],"about_ca_topic_score_codex":0.00020739486,"about_ca_topic_score_gemma":0.00030600102,"teacher_disagreement_score":0.050274737,"about_ca_system_score_codex":0.000073326184,"about_ca_system_score_gemma":0.00071817153,"threshold_uncertainty_score":0.99954504},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05872375147886557,"score_gpt":0.2922273820116055,"score_spread":0.2335036305327399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212030079","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03699733,0.00011752238,0.9525559,0.0016206646,0.004719831,0.00034195132,0.00001962554,0.00038824315,0.0032389492],"genre_scores_gemma":[0.32049435,0.000045944445,0.67794085,0.0004302252,0.0009512287,0.000066047585,0.00003884578,0.000027884404,0.000004634087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965539,0.00046038083,0.000669151,0.0013802891,0.00037503758,0.00056123786],"domain_scores_gemma":[0.9968308,0.0008157306,0.0005493065,0.0014392056,0.00019538093,0.0001695815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005481455,0.00042872323,0.00046987552,0.00039346688,0.00033589272,0.00016960228,0.0017165187,0.0004313045,0.0001759181],"category_scores_gemma":[0.00024775765,0.00040898353,0.00028455284,0.00015713875,0.00037333713,0.00023134689,0.004146776,0.0011556316,0.00043090887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024248997,0.00006825323,0.0013609289,0.000053384032,0.00006200206,0.000018062161,0.0012824232,0.002569875,0.002252909,0.9811967,0.00037482046,0.010736379],"study_design_scores_gemma":[0.00028420083,0.00002947863,0.0054183956,0.00017050919,0.000018767167,0.00011028877,0.000037289057,0.112315275,0.00077441905,0.8783542,0.0020245535,0.00046260675],"about_ca_topic_score_codex":0.000025531368,"about_ca_topic_score_gemma":0.000007374972,"teacher_disagreement_score":0.28349704,"about_ca_system_score_codex":0.00022870624,"about_ca_system_score_gemma":0.00043318068,"threshold_uncertainty_score":0.9998362},"labels":[],"label_agreement":null},{"id":"W3216039302","doi":"","title":"Interactive Oracle Proofs with Constant Rate and Query Complexity","year":2016,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical proof; Proof complexity; Sublinear function; Oracle; Constant (computer programming); Gas meter prover; Mathematics; Communication complexity; Satisfiability; Computer science; Computational complexity theory; Discrete mathematics; Theoretical computer science; Algorithm","score_opus":0.03195958224149732,"score_gpt":0.2735871208355943,"score_spread":0.24162753859409697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216039302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014098475,0.00017475554,0.965219,0.0016102036,0.00091464556,0.0011219237,0.000025539355,0.0003272968,0.016508158],"genre_scores_gemma":[0.82816106,0.000040047762,0.17117786,0.00018489773,0.00013999424,0.00023419526,0.000018144721,0.00002914759,0.000014661557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99641204,0.0008010792,0.0005004198,0.0014200064,0.00022154888,0.00064492074],"domain_scores_gemma":[0.99714696,0.0006239966,0.00060751307,0.0011852252,0.00019957132,0.00023675755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056932005,0.00052548834,0.0008356412,0.0002169253,0.00020450387,0.00023923091,0.0011451358,0.0002526651,0.000026568649],"category_scores_gemma":[0.00010276826,0.00035604855,0.0001264686,0.0001006957,0.0013891475,0.00021928425,0.0035182443,0.0009583081,0.00012784405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013710596,0.00009225781,0.005922427,0.00014590223,0.00023579756,0.00023317388,0.002679096,0.000004463977,0.00014853547,0.9817586,0.00013549732,0.008507173],"study_design_scores_gemma":[0.00066222803,0.00024491936,0.006065623,0.00011343307,0.000026915555,0.00030628455,0.00011484175,0.0011642701,0.0004685661,0.98695004,0.0033562433,0.00052662933],"about_ca_topic_score_codex":0.00017709,"about_ca_topic_score_gemma":0.0003645936,"teacher_disagreement_score":0.8140626,"about_ca_system_score_codex":0.00009174712,"about_ca_system_score_gemma":0.00039166186,"threshold_uncertainty_score":0.99988914},"labels":[],"label_agreement":null},{"id":"W3217193836","doi":"","title":"Towards Isogeny-Based Password-Authenticated Key Establishment","year":2018,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Password; Computer science; Key (lock); Computer security; Zero-knowledge password proof; Password strength; One-time password","score_opus":0.02422681641598527,"score_gpt":0.27398883780443395,"score_spread":0.2497620213884487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217193836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049019396,0.000118807955,0.93418527,0.006668343,0.0033822977,0.0011257842,0.000095593496,0.0007648304,0.0046397075],"genre_scores_gemma":[0.67254347,0.0000304301,0.3251819,0.0011481931,0.0003253385,0.00045123656,0.0002390217,0.0000623579,0.00001808204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943428,0.00088082603,0.0011066544,0.001976183,0.00072490954,0.0009686217],"domain_scores_gemma":[0.9947137,0.00029594539,0.00069955806,0.0034457003,0.0004032032,0.00044185529],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008898962,0.00073085097,0.0009513645,0.00064209674,0.0002549258,0.00051325967,0.0043625287,0.0005694712,0.00027660362],"category_scores_gemma":[0.0002350031,0.0007191483,0.00049190444,0.00037287964,0.0006137892,0.00016066816,0.004333673,0.0011592886,0.0015703333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067031055,0.00072425546,0.002749342,0.00033125436,0.0004621722,0.00010683905,0.05271143,0.00005881913,0.0005849922,0.92911947,0.0061632684,0.006921123],"study_design_scores_gemma":[0.0008097809,0.00014471958,0.0060231085,0.00021900641,0.00008743921,0.000036744757,0.00008605054,0.19245134,0.003125722,0.7748746,0.02116043,0.0009810347],"about_ca_topic_score_codex":0.00015005107,"about_ca_topic_score_gemma":0.00009019968,"teacher_disagreement_score":0.62352407,"about_ca_system_score_codex":0.00018164796,"about_ca_system_score_gemma":0.0009042654,"threshold_uncertainty_score":0.99952596},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04780136964815156,"score_gpt":0.2858845172483337,"score_spread":0.23808314760018212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34785529","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008473305,0.00026506174,0.98293984,0.00043755164,0.0020419988,0.000603504,0.00013981233,0.00066705927,0.004431842],"genre_scores_gemma":[0.098694965,0.00007557149,0.90042615,0.0003427468,0.00013458892,0.000107154054,0.00018820814,0.000030116209,4.955048e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99588394,0.00053934805,0.00075448793,0.0017366161,0.00030586793,0.00077976345],"domain_scores_gemma":[0.99663544,0.00040129657,0.0005445946,0.001952292,0.00015063322,0.00031575368],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051964686,0.00061755674,0.00079953123,0.0005439128,0.0002989748,0.0002061571,0.0028989222,0.0004645553,0.00007262882],"category_scores_gemma":[0.00012553984,0.0006312649,0.0004898026,0.0002565713,0.00049882464,0.0002690744,0.0077527254,0.0018519387,0.00042227047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023624874,0.000273721,0.0037571432,0.000085289976,0.00016475254,0.00010199176,0.007679288,0.00097117515,0.00009291212,0.9777247,0.0009525205,0.008172911],"study_design_scores_gemma":[0.0005347633,0.000051704465,0.020594323,0.00008519238,0.000038226663,0.000062761035,0.00006420327,0.038039874,0.00031737037,0.93833154,0.0012012612,0.00067878095],"about_ca_topic_score_codex":0.00021938629,"about_ca_topic_score_gemma":0.00022098506,"teacher_disagreement_score":0.090221666,"about_ca_system_score_codex":0.000048722148,"about_ca_system_score_gemma":0.0002435636,"threshold_uncertainty_score":0.9996139},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"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","score_opus":0.02518052485577259,"score_gpt":0.23503246103927405,"score_spread":0.20985193618350145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36205663","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04448408,0.00013864132,0.9497981,0.0016788811,0.00079055474,0.0012108895,0.0001440957,0.0007607032,0.0009940679],"genre_scores_gemma":[0.14353609,0.00015570656,0.8548452,0.0003016072,0.00020914657,0.00059717597,0.00031609272,0.000038589995,3.7511253e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995527,0.00058211724,0.00063192204,0.0018695107,0.00054879277,0.00084063975],"domain_scores_gemma":[0.99629194,0.0003091324,0.00059749524,0.0022810237,0.00023935265,0.00028105584],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0004382277,0.00069599535,0.0007692473,0.0006974703,0.0005341246,0.00020944752,0.002113209,0.0005276541,0.000035014607],"category_scores_gemma":[0.0001193266,0.0006464222,0.0003763188,0.00053685514,0.0006826257,0.00031850522,0.002346815,0.0023568487,0.0001356059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002135115,0.0003359381,0.005045721,0.0001672845,0.00020271186,0.00032829522,0.0023097184,0.0055924254,0.00046323027,0.9807421,0.0006081138,0.0039909533],"study_design_scores_gemma":[0.0018290051,0.00053335965,0.02811146,0.00044811238,0.000080567195,0.00055717956,0.0000671062,0.044902366,0.003572704,0.9071845,0.011008107,0.001705525],"about_ca_topic_score_codex":0.00021405781,"about_ca_topic_score_gemma":0.00022519719,"teacher_disagreement_score":0.09905201,"about_ca_system_score_codex":0.00011698083,"about_ca_system_score_gemma":0.00068943785,"threshold_uncertainty_score":0.99994475},"labels":[],"label_agreement":null},{"id":"W841036945","doi":"","title":"Rethinking Definitions of Security for Session Key Agreement.","year":2013,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Session (web analytics); Computer science; Session key; Mathematical proof; Computer security; Adversary; Key (lock); Syntax; Protocol (science); Encryption; World Wide Web; Mathematics","score_opus":0.057427993807007666,"score_gpt":0.31655732998658165,"score_spread":0.259129336179574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W841036945","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0121635515,0.000059747315,0.9748663,0.0013547568,0.00063942745,0.008203059,0.0001504984,0.00019975912,0.0023629041],"genre_scores_gemma":[0.18952213,0.000061961655,0.80218107,0.00016295674,0.00006307845,0.00787456,0.000110524335,0.000022488408,0.0000012461969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966865,0.00039796345,0.000907811,0.0011446304,0.0003412197,0.0005218825],"domain_scores_gemma":[0.995523,0.00096757605,0.0010805096,0.0018476985,0.00042883123,0.00015240758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005375254,0.00040310842,0.000672312,0.00029119288,0.00023321876,0.00007762787,0.00212931,0.00038097968,0.0000921594],"category_scores_gemma":[0.00046622584,0.00041308222,0.0003431046,0.0001497567,0.0004066396,0.00024924352,0.0044268537,0.0010374372,0.000095643576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018044455,0.00019750539,0.00028123517,0.00034869206,0.00007115359,0.000002868342,0.011925086,0.00021442221,0.0007444228,0.9845391,0.00020218913,0.0014552622],"study_design_scores_gemma":[0.0004720405,0.00007965612,0.0006558707,0.00029868013,0.00002800694,0.000010478454,0.000060593335,0.021205977,0.0045247916,0.97189045,0.00041996245,0.00035350962],"about_ca_topic_score_codex":0.000029246512,"about_ca_topic_score_gemma":0.000025855466,"teacher_disagreement_score":0.17735858,"about_ca_system_score_codex":0.0000864034,"about_ca_system_score_gemma":0.00030504816,"threshold_uncertainty_score":0.9998321},"labels":[],"label_agreement":null}]}