{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04001069,0.00049264584,0.93712133,0.0018048907,0.00037081077,0.00027273668,0.00007901774,0.00047868505,0.01936921],"genre_scores_gemma":[0.7445012,0.0008205949,0.24341203,0.0009919395,0.00016706188,0.00035058305,0.00024043332,0.00012458418,0.009391677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958032,0.0020471432,0.00023089102,0.0004247487,0.0010709072,0.0004231523],"domain_scores_gemma":[0.99619436,0.001609583,0.00039414864,0.0012054209,0.00048821667,0.00010826205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033236896,0.0008223668,0.00057802425,0.00076172093,0.0009115739,0.0019215452,0.0007953422,0.0014950252,0.0033029718],"category_scores_gemma":[0.00889357,0.0004827347,0.0007766944,0.0004657162,0.0026271797,0.0050836992,0.0027591952,0.0030025512,0.0014419085],"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.0002530334,0.00006463021,0.0012305741,0.00018665397,0.00011773365,0.00023283735,0.00084521656,0.0067104595,0.025526818,0.9039307,0.004360867,0.056540497],"study_design_scores_gemma":[0.00028781305,0.0005705017,0.00070555805,0.00018376364,0.0001559317,0.0013942361,0.0003460671,0.15275878,0.09368734,0.66110396,0.08866595,0.00014012316],"about_ca_topic_score_codex":0.0002511583,"about_ca_topic_score_gemma":0.00026127376,"teacher_disagreement_score":0.0033236896,"about_ca_system_score_codex":0.000631235,"about_ca_system_score_gemma":0.0010792362,"threshold_uncertainty_score":0.017577529},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02211182,0.000981852,0.9345795,0.0029071805,0.00022753928,0.00019619902,0.00039868747,0.0006201869,0.03797699],"genre_scores_gemma":[0.8059054,0.0019183531,0.17274094,0.0010705476,0.00048383238,0.0005048633,0.00053176814,0.00031531183,0.016529044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99126595,0.0040170816,0.00033550497,0.0010622115,0.0028161362,0.0005031217],"domain_scores_gemma":[0.95851624,0.022239976,0.0037623907,0.012698415,0.0023485853,0.0004344833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008712056,0.000779088,0.0009573591,0.0032307212,0.001767141,0.0035558005,0.002360935,0.002383848,0.00842586],"category_scores_gemma":[0.053979672,0.00066123536,0.00078903657,0.003327907,0.00816518,0.012450866,0.0046696085,0.003570231,0.0024498645],"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.00011671487,0.00002284954,0.0011167829,0.0000739728,0.000028227578,0.00012786193,0.00025965075,0.014890624,0.0017825592,0.928335,0.0024177325,0.050828073],"study_design_scores_gemma":[0.00004129314,0.00010376561,0.0010283848,0.00017272551,0.00004091104,0.0005762665,0.000191449,0.12666242,0.0071944064,0.83071506,0.03318499,0.000088374174],"about_ca_topic_score_codex":0.0013988554,"about_ca_topic_score_gemma":0.0011414145,"teacher_disagreement_score":0.008712056,"about_ca_system_score_codex":0.0021128182,"about_ca_system_score_gemma":0.0013540341,"threshold_uncertainty_score":0.04607427},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012430343,0.025428418,0.87680626,0.0021623564,0.0014861141,0.0001896473,0.00009811843,0.00052615965,0.080872536],"genre_scores_gemma":[0.41778314,0.042491928,0.49151185,0.0018389869,0.0029190483,0.00042129387,0.00021260977,0.0004599524,0.042361226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875844,0.00046498535,0.00008851875,0.00016197134,0.0004600136,0.00006606043],"domain_scores_gemma":[0.997818,0.0014610563,0.00012834712,0.00040728846,0.00015045133,0.00003480284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017255166,0.0010458172,0.0006086729,0.0015858352,0.0008608908,0.0017643472,0.0005042994,0.00093619357,0.0049182475],"category_scores_gemma":[0.0050825635,0.00032040547,0.0008618852,0.00088551285,0.004055097,0.006368674,0.00193001,0.0023107072,0.0018624044],"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.000041734304,0.00001185065,0.000100510195,0.00012829424,0.00001655409,0.000108980596,0.00015675063,0.002009304,0.002498605,0.9486785,0.0013664643,0.044882383],"study_design_scores_gemma":[0.000043120668,0.00015748656,0.00012293734,0.00017255853,0.000032458614,0.0007746417,0.000048348436,0.014173271,0.008349508,0.87214726,0.10392264,0.000055751658],"about_ca_topic_score_codex":0.00028198486,"about_ca_topic_score_gemma":0.0002984079,"teacher_disagreement_score":0.0049182475,"about_ca_system_score_codex":0.00071962044,"about_ca_system_score_gemma":0.0004949612,"threshold_uncertainty_score":0.016453207},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07802496,0.0007951713,0.90372413,0.00068811484,0.000584094,0.0006485708,0.0006682005,0.0045482633,0.01031847],"genre_scores_gemma":[0.5846743,0.00028204688,0.39341488,0.0004565183,0.0001452184,0.00057889795,0.0012104331,0.00043371177,0.01880398],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992067,0.00021742264,0.00006247129,0.00012720561,0.00029953464,0.00008673875],"domain_scores_gemma":[0.99873334,0.00037466356,0.00013154969,0.00038551717,0.00030690062,0.00006803848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007387383,0.00056042493,0.0003727187,0.0005184883,0.00029344502,0.00045741926,0.0010221817,0.00085507776,0.007956197],"category_scores_gemma":[0.0024532904,0.0002740298,0.00043418678,0.00039440565,0.00048187454,0.0011489366,0.00074480753,0.00084250106,0.0033845198],"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.00240424,0.00021806997,0.002751789,0.00088950194,0.00019064557,0.0012971127,0.00034927568,0.028842153,0.46147177,0.10837596,0.015823385,0.37738606],"study_design_scores_gemma":[0.00058756967,0.0016851438,0.0022925527,0.00012234133,0.00018561126,0.005010365,0.00007684123,0.27417746,0.5602985,0.042849865,0.112466365,0.00024727394],"about_ca_topic_score_codex":0.0001348443,"about_ca_topic_score_gemma":0.00013594945,"teacher_disagreement_score":0.007956197,"about_ca_system_score_codex":0.00040819347,"about_ca_system_score_gemma":0.00041369215,"threshold_uncertainty_score":0.026616156},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03708023,0.00084593636,0.9451862,0.0002481301,0.0003545247,0.00026110216,0.00021521536,0.0017695496,0.014039099],"genre_scores_gemma":[0.26593634,0.00062102126,0.7168218,0.00017234763,0.0002575325,0.00024369493,0.000623462,0.00032153272,0.0150021985],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941874,0.00006766623,0.0000557538,0.000097433425,0.0002942226,0.000066093075],"domain_scores_gemma":[0.99928206,0.00014709786,0.00006276443,0.00033210433,0.00012847416,0.000047603262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065233203,0.00060277624,0.0005831187,0.0008576236,0.00071624055,0.001254919,0.0007232674,0.00046552136,0.0077559445],"category_scores_gemma":[0.0017210181,0.00031890368,0.0005425776,0.0007727859,0.0007960466,0.0027152735,0.0016222139,0.0018146624,0.0028335762],"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.0006140777,0.00021241892,0.0006828921,0.0004526206,0.00004139097,0.00035300525,0.00040484197,0.008643381,0.14803115,0.3799677,0.008740647,0.45185584],"study_design_scores_gemma":[0.00026826333,0.0013545863,0.0016432588,0.00012341439,0.00013025822,0.003592524,0.00015127967,0.15764289,0.39905673,0.25957918,0.17625211,0.00020558579],"about_ca_topic_score_codex":0.0001508718,"about_ca_topic_score_gemma":0.0003105208,"teacher_disagreement_score":0.0077559445,"about_ca_system_score_codex":0.00046272553,"about_ca_system_score_gemma":0.0008746681,"threshold_uncertainty_score":0.0259462},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016547568,0.00062040985,0.9582938,0.0018967357,0.00040073998,0.00039659507,0.00023210543,0.00043627186,0.021175742],"genre_scores_gemma":[0.6709892,0.0011364798,0.30403498,0.0012416561,0.00044433938,0.0008786974,0.0006154674,0.00013516053,0.02052401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922776,0.0026418963,0.0005382906,0.0016003187,0.0023754165,0.00056628836],"domain_scores_gemma":[0.982976,0.007243915,0.0015687025,0.006681125,0.0010585774,0.00047172536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006233471,0.00081719935,0.0010911329,0.00097279635,0.0018357771,0.0028812003,0.0029795521,0.003812572,0.0053819916],"category_scores_gemma":[0.016777975,0.00067727076,0.0012502207,0.0011786534,0.0049466006,0.014701705,0.008308511,0.0058638537,0.0025473952],"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.00020577537,0.0001091848,0.0004021773,0.00027287286,0.00007646835,0.00038053966,0.00042259952,0.0043135784,0.007544015,0.95617193,0.0026790912,0.027421638],"study_design_scores_gemma":[0.00016923582,0.00032091892,0.000499479,0.00018294548,0.00013817011,0.001689176,0.00021417502,0.07210215,0.025662389,0.85160047,0.047265224,0.00015573156],"about_ca_topic_score_codex":0.00020052712,"about_ca_topic_score_gemma":0.00010703362,"teacher_disagreement_score":0.006233471,"about_ca_system_score_codex":0.0009848188,"about_ca_system_score_gemma":0.0019173649,"threshold_uncertainty_score":0.032966137},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019375506,0.0015698868,0.9794041,0.0011060939,0.00036628117,0.00021842943,0.00007268989,0.000435202,0.014889743],"genre_scores_gemma":[0.1822784,0.00401658,0.7927732,0.0008602655,0.001266562,0.0011638993,0.0004905347,0.0002599006,0.016890688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962198,0.0017327775,0.00022482722,0.0004522244,0.0011802156,0.00019019487],"domain_scores_gemma":[0.99694544,0.0012454361,0.00019350577,0.0011367489,0.00035439385,0.00012451137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035517614,0.0010797832,0.0009486841,0.00093721197,0.001505461,0.0026866014,0.001879757,0.0019592992,0.007724358],"category_scores_gemma":[0.0062079695,0.00062325347,0.0009445943,0.0018269331,0.0027237777,0.00682086,0.0029077083,0.005977536,0.003595213],"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.000048775015,0.000040888994,0.00008170257,0.00011058964,0.0000068325908,0.00007112754,0.00009047721,0.0028201018,0.0017184138,0.9641011,0.004556375,0.02635349],"study_design_scores_gemma":[0.00007772778,0.00008988763,0.00008489039,0.00010242294,0.000018408573,0.00023899708,0.00003554672,0.058190685,0.0036932721,0.84706426,0.09036479,0.000039138213],"about_ca_topic_score_codex":0.00027256127,"about_ca_topic_score_gemma":0.0002922149,"teacher_disagreement_score":0.007724358,"about_ca_system_score_codex":0.0020119988,"about_ca_system_score_gemma":0.0016875,"threshold_uncertainty_score":0.02584052},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28361806,0.0013017869,0.6874757,0.0004221862,0.0002735669,0.0001885091,0.000337293,0.0025790958,0.023803828],"genre_scores_gemma":[0.71772957,0.00061115634,0.27108824,0.00007771474,0.0001386175,0.00010099729,0.00085270166,0.0002438355,0.009157117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993774,0.00011917257,0.00004296227,0.00011471518,0.00022238394,0.00012332368],"domain_scores_gemma":[0.9994072,0.0001535469,0.000066106055,0.00021476796,0.00009488916,0.000063571744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007316261,0.0008195927,0.0009323442,0.0016517075,0.00101167,0.0012771495,0.00062197674,0.0005738553,0.007862797],"category_scores_gemma":[0.0025301485,0.00033842164,0.0009899772,0.00109343,0.0007494746,0.0038602343,0.0025310162,0.0011471632,0.001904594],"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.0009511564,0.00017708336,0.0070391223,0.0005137844,0.00013906247,0.00071286986,0.0017917426,0.03411703,0.038473044,0.46242964,0.0118054515,0.4418499],"study_design_scores_gemma":[0.00018804238,0.0005797432,0.00352085,0.000112248286,0.00008695683,0.001962272,0.0005911452,0.32013533,0.07431462,0.5528716,0.045488067,0.0001491855],"about_ca_topic_score_codex":0.00032628083,"about_ca_topic_score_gemma":0.0005701774,"teacher_disagreement_score":0.007862797,"about_ca_system_score_codex":0.0006142653,"about_ca_system_score_gemma":0.0008429941,"threshold_uncertainty_score":0.026303709},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099472426,0.0012608643,0.87436503,0.0037391146,0.0006295091,0.0009408035,0.0007791234,0.0021484403,0.01666462],"genre_scores_gemma":[0.89684737,0.00055920804,0.095321536,0.00028469606,0.00018414872,0.0001984444,0.00045455704,0.000075446806,0.0060747066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950105,0.0011588088,0.00039315457,0.000533711,0.0022816164,0.00062213],"domain_scores_gemma":[0.99518186,0.0011060485,0.00053869246,0.0020132845,0.00075049256,0.00040956476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037130394,0.0005331115,0.0011122794,0.00077184435,0.0022531333,0.0036537119,0.0018939576,0.0014442214,0.0022001297],"category_scores_gemma":[0.006930396,0.0003782203,0.00092934776,0.0016438008,0.0011047045,0.005481034,0.00345706,0.002276855,0.0008827401],"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.002014891,0.0007439085,0.0068932697,0.0005748389,0.0002587625,0.003169584,0.00081120414,0.08413465,0.057908397,0.6269652,0.026696756,0.18982856],"study_design_scores_gemma":[0.00014470376,0.00024803597,0.0009992574,0.00005651494,0.00007526717,0.0011295213,0.00034058501,0.79283875,0.040537413,0.11686936,0.0466827,0.00007802528],"about_ca_topic_score_codex":0.0017995755,"about_ca_topic_score_gemma":0.0013033102,"teacher_disagreement_score":0.0037130394,"about_ca_system_score_codex":0.0020171604,"about_ca_system_score_gemma":0.0031024946,"threshold_uncertainty_score":0.01963669},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034535907,0.0008199465,0.93211,0.0033703612,0.00024507308,0.0006891334,0.0008118528,0.004466984,0.022950716],"genre_scores_gemma":[0.6212865,0.00087869266,0.35184684,0.00084268977,0.00037239626,0.001829149,0.0013916527,0.0015588076,0.01999334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.989073,0.002405279,0.00080822135,0.0020610872,0.0040892237,0.0015631096],"domain_scores_gemma":[0.97648597,0.006474583,0.0011358713,0.014457933,0.00078626693,0.00065934577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055515068,0.0021764806,0.0019826633,0.0016639798,0.0025367818,0.006274738,0.0043527684,0.0030155557,0.014673007],"category_scores_gemma":[0.013641904,0.0011772055,0.0036260912,0.00275034,0.0057344995,0.020284534,0.00989207,0.0050749183,0.0054001985],"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.002268064,0.00032731853,0.00090129283,0.00062168186,0.00024352425,0.00024984285,0.00042599527,0.046074163,0.017263252,0.8614157,0.009028596,0.06118067],"study_design_scores_gemma":[0.00030106408,0.00017673023,0.00020182878,0.00006448018,0.00014069994,0.0003080123,0.0000770448,0.18559287,0.019829195,0.78131545,0.011931464,0.00006118045],"about_ca_topic_score_codex":0.0006642403,"about_ca_topic_score_gemma":0.0008657521,"teacher_disagreement_score":0.014673007,"about_ca_system_score_codex":0.0044823866,"about_ca_system_score_gemma":0.0039887056,"threshold_uncertainty_score":0.049086034},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01254645,0.024200337,0.91912866,0.008606027,0.0023086579,0.00018978119,0.00013486961,0.0005077079,0.032377508],"genre_scores_gemma":[0.64855987,0.030135969,0.27628422,0.0024817241,0.003424185,0.0005461673,0.00056022574,0.00013376302,0.03787392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99775535,0.0008543686,0.00015609713,0.00044157365,0.0006424086,0.00015030766],"domain_scores_gemma":[0.99668056,0.0019066548,0.0003504489,0.0005624554,0.00031450938,0.0001853446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015877488,0.000767039,0.0008612486,0.0010829985,0.0012813538,0.0030606044,0.0014994701,0.0027940418,0.0031534769],"category_scores_gemma":[0.006247301,0.0004697926,0.0005259732,0.0021108717,0.0031091708,0.008228218,0.0028557342,0.0031426193,0.0013014451],"study_design_candidate":"not_applicable","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.00007046483,0.000040431834,0.00093930523,0.0005713884,0.000032782817,0.0006565874,0.00040494793,0.018228438,0.001896783,0.8145894,0.013402566,0.14916694],"study_design_scores_gemma":[0.000034053155,0.00010326274,0.00058180955,0.00019324245,0.000044533037,0.002437181,0.00046270082,0.15292318,0.0028076002,0.7273041,0.113060385,0.000047914138],"about_ca_topic_score_codex":0.0006839767,"about_ca_topic_score_gemma":0.0004932459,"teacher_disagreement_score":0.0031534769,"about_ca_system_score_codex":0.001036377,"about_ca_system_score_gemma":0.0006173895,"threshold_uncertainty_score":0.010549426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030647082,0.0021959236,0.9580167,0.0012860976,0.00027554441,0.000241805,0.000103921215,0.0011093041,0.0061235745],"genre_scores_gemma":[0.84036785,0.0012381377,0.15248595,0.00030521746,0.0001371455,0.00013811415,0.00013670778,0.00010144119,0.0050893943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901855,0.00025321837,0.00007487913,0.00012406144,0.00032659105,0.0002026713],"domain_scores_gemma":[0.9987691,0.00025954217,0.00015366868,0.00041362146,0.0003185732,0.000085405445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012249873,0.0004999533,0.00063697295,0.00043615763,0.0009471537,0.0022626908,0.0015672037,0.0008930775,0.0021104428],"category_scores_gemma":[0.002218336,0.00027464263,0.00048373928,0.00083623215,0.0010209754,0.0037080492,0.0019246038,0.0014966477,0.0010130791],"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.00082997204,0.00030208877,0.0018018067,0.00048807173,0.00013380017,0.0011117979,0.0004956753,0.29893687,0.074263334,0.41277888,0.022083282,0.18677431],"study_design_scores_gemma":[0.00006329779,0.00008215376,0.00022290899,0.00004138849,0.000026408448,0.00033919778,0.00011242279,0.9046177,0.02301928,0.051656753,0.01979483,0.000023597053],"about_ca_topic_score_codex":0.0019344987,"about_ca_topic_score_gemma":0.0017683291,"teacher_disagreement_score":0.0022626908,"about_ca_system_score_codex":0.0014611698,"about_ca_system_score_gemma":0.0013126932,"threshold_uncertainty_score":0.010601521},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06576034,0.0010656287,0.9197942,0.00018555559,0.00024666757,0.00012590259,0.0000712945,0.0017418215,0.011008519],"genre_scores_gemma":[0.36279696,0.00055695296,0.6271174,0.000090024056,0.000118205346,0.00012554486,0.00018086357,0.00027401338,0.00874008],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994411,0.00012314455,0.000036299534,0.00007721548,0.00026881392,0.00005336587],"domain_scores_gemma":[0.999173,0.00022641037,0.00007209761,0.00033394815,0.00015671895,0.000037864687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065122446,0.0004781591,0.00036207316,0.0007848955,0.00048156022,0.00080527406,0.00060913834,0.00045633697,0.0067182463],"category_scores_gemma":[0.0032309499,0.00015426126,0.00034125033,0.00066056394,0.00045429706,0.0021029005,0.0011245282,0.0008276658,0.0024627703],"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.00066811655,0.0001366905,0.001515905,0.000289704,0.00004342737,0.00024578045,0.0003995575,0.020539425,0.06796241,0.13007465,0.008341339,0.769783],"study_design_scores_gemma":[0.00018863607,0.0010520899,0.0020353997,0.0001862184,0.00007327141,0.001967315,0.00027564925,0.6436734,0.16101022,0.08776278,0.10164801,0.00012702032],"about_ca_topic_score_codex":0.00033941763,"about_ca_topic_score_gemma":0.00041788965,"teacher_disagreement_score":0.0067182463,"about_ca_system_score_codex":0.0002866217,"about_ca_system_score_gemma":0.0005859634,"threshold_uncertainty_score":0.022474766},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024088588,0.00030093107,0.9619621,0.00076997,0.00008254645,0.00025475226,0.00016150594,0.0007772503,0.011602348],"genre_scores_gemma":[0.7810126,0.00042298227,0.20381859,0.00028562266,0.00012680057,0.00033169295,0.00027749833,0.00017027833,0.013553996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921332,0.0024221158,0.0004082955,0.001001598,0.0029744129,0.0010604816],"domain_scores_gemma":[0.9908145,0.0018610433,0.00063241407,0.005923641,0.0004119662,0.0003564721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043470953,0.0006286926,0.001020493,0.0004895117,0.0018382295,0.002614568,0.0019939952,0.0012715141,0.0064193583],"category_scores_gemma":[0.010222072,0.00068249897,0.0014963306,0.0007934795,0.0037519773,0.007330544,0.008556291,0.003077512,0.0023638885],"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.00036758545,0.00026692037,0.0010136041,0.00028428677,0.00006793075,0.00036946326,0.0008227943,0.027662987,0.010941779,0.8986954,0.0045592594,0.05494805],"study_design_scores_gemma":[0.00012741855,0.00013957283,0.00048874546,0.00004746612,0.000052373514,0.00080121245,0.0001794107,0.1918251,0.033620555,0.75227803,0.02037512,0.00006502207],"about_ca_topic_score_codex":0.00080602797,"about_ca_topic_score_gemma":0.000862706,"teacher_disagreement_score":0.0064193583,"about_ca_system_score_codex":0.0020945936,"about_ca_system_score_gemma":0.0024817656,"threshold_uncertainty_score":0.022989929},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12847905,0.008024223,0.62273073,0.034155756,0.0008646694,0.00017274615,0.00061531854,0.00020270959,0.20475478],"genre_scores_gemma":[0.9478829,0.0026544835,0.031613123,0.0019735273,0.00067968905,0.00013779923,0.00017258218,0.000058984726,0.014826984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980064,0.0008083785,0.00007597342,0.00030023837,0.0004747175,0.0003343251],"domain_scores_gemma":[0.99200046,0.0056250594,0.00077130104,0.0009860096,0.00035087366,0.0002663177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023838764,0.00074726203,0.0006830612,0.0011603036,0.0011137271,0.0028601575,0.0010653686,0.002315374,0.0060385405],"category_scores_gemma":[0.009575118,0.00031056965,0.0011774444,0.0012031278,0.0070732436,0.0096610375,0.002778913,0.0047487793,0.00072506105],"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.000014501193,0.000010803259,0.00014643381,0.00002006653,0.000004641623,0.000029972758,0.000042143023,0.0016501857,0.00014130765,0.9950158,0.0005823516,0.0023418008],"study_design_scores_gemma":[0.000006433922,0.00002140748,0.00014068688,0.000021100346,0.0000049245323,0.000073804724,0.000032413573,0.009111703,0.0002141335,0.98764104,0.002724298,0.000007977854],"about_ca_topic_score_codex":0.00074140803,"about_ca_topic_score_gemma":0.0005622641,"teacher_disagreement_score":0.0060385405,"about_ca_system_score_codex":0.0027549618,"about_ca_system_score_gemma":0.0009755758,"threshold_uncertainty_score":0.020200968},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012340196,0.0004298735,0.97532237,0.0005282288,0.0001819662,0.00026871657,0.00015912126,0.00061239075,0.010157034],"genre_scores_gemma":[0.67095596,0.000743595,0.30641785,0.00036902854,0.00028209153,0.0006202307,0.0005018228,0.00016743905,0.019942015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748355,0.0007394849,0.00018009801,0.00025060138,0.0010689072,0.00027735444],"domain_scores_gemma":[0.99709105,0.00061194575,0.00032402505,0.0015656184,0.00025353392,0.00015386383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024554012,0.0004890915,0.000740338,0.0004041562,0.0009045718,0.0016884329,0.001534294,0.0010911765,0.003864608],"category_scores_gemma":[0.004403793,0.0003680773,0.0007827276,0.0010596268,0.0012393225,0.007855402,0.0044365465,0.002283783,0.0019128232],"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.00063812325,0.00016430457,0.00058782933,0.0003704787,0.0000740047,0.0006380307,0.0005392048,0.024563983,0.027291609,0.86043775,0.008424496,0.07627024],"study_design_scores_gemma":[0.00027451973,0.00051545055,0.00045552626,0.000095716925,0.00010581559,0.0019369478,0.00023054078,0.25578377,0.054057278,0.6056595,0.08077744,0.00010753598],"about_ca_topic_score_codex":0.0001505143,"about_ca_topic_score_gemma":0.00017882632,"teacher_disagreement_score":0.003864608,"about_ca_system_score_codex":0.0007457884,"about_ca_system_score_gemma":0.0012556661,"threshold_uncertainty_score":0.0129855275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3171384,0.00086866,0.6655972,0.00093159085,0.00030196228,0.00020605917,0.00025634977,0.0008384151,0.013861363],"genre_scores_gemma":[0.9377824,0.00019336908,0.056123283,0.00020884268,0.000056809164,0.000050232356,0.00013130972,0.000036499016,0.0054172263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990043,0.0002725475,0.000035637742,0.00014867497,0.00043120835,0.0001077094],"domain_scores_gemma":[0.9988979,0.00042747572,0.00016698042,0.00030450322,0.00014564845,0.000057535763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007641292,0.0005018751,0.0004059428,0.0007433252,0.00041742917,0.00064009975,0.0004899076,0.00062787376,0.0023483771],"category_scores_gemma":[0.003371443,0.00020187539,0.00055405754,0.00039410178,0.0010437965,0.001185194,0.0010280331,0.00071234856,0.0005244376],"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.0017596451,0.00021685706,0.006792096,0.00049845665,0.00038104272,0.001852835,0.0006042951,0.0878246,0.23529395,0.43716633,0.008667577,0.21894242],"study_design_scores_gemma":[0.00012247422,0.0007819941,0.0031795944,0.000086188804,0.00010018768,0.003102227,0.00009867431,0.6014608,0.2350714,0.13953537,0.016368803,0.00009224477],"about_ca_topic_score_codex":0.0001947743,"about_ca_topic_score_gemma":0.00019366227,"teacher_disagreement_score":0.0023483771,"about_ca_system_score_codex":0.00068881316,"about_ca_system_score_gemma":0.0005569864,"threshold_uncertainty_score":0.007856071},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005601242,0.056400638,0.040674705,0.23632391,0.010000784,0.00007750732,0.00029113697,0.0003045926,0.65032554],"genre_scores_gemma":[0.5620117,0.04761314,0.018884292,0.08330382,0.027004806,0.0005899059,0.00049571414,0.0008361089,0.25926054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99348384,0.0035656057,0.00029192842,0.00054146134,0.001544746,0.0005723999],"domain_scores_gemma":[0.9898045,0.0075894403,0.0005322565,0.00088009203,0.00073726143,0.00045649344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00774229,0.00094871933,0.00052132586,0.0016289705,0.0064592133,0.011983802,0.0012734381,0.0071605677,0.0061565065],"category_scores_gemma":[0.012881258,0.00040033046,0.0005554781,0.0027783094,0.027901145,0.02511382,0.006010101,0.011329526,0.0024531635],"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.000005719034,0.0000025883903,0.000030069716,0.000015352425,0.0000010361262,0.00001791402,0.00067901454,0.00003224468,0.000025305182,0.98422235,0.012828184,0.002140284],"study_design_scores_gemma":[0.000012695774,0.0000101747,0.00013390543,0.00017706257,0.0000080101945,0.00009469562,0.00071888545,0.000274235,0.00019531064,0.69385874,0.30450022,0.000016010317],"about_ca_topic_score_codex":0.0047885743,"about_ca_topic_score_gemma":0.0033898235,"teacher_disagreement_score":0.011983802,"about_ca_system_score_codex":0.0053109913,"about_ca_system_score_gemma":0.004222245,"threshold_uncertainty_score":0.04094559},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007227332,0.00046647363,0.9698607,0.0010918082,0.00049118575,0.00036896789,0.000219393,0.00072172924,0.019552436],"genre_scores_gemma":[0.485782,0.0012223526,0.4665461,0.0014777652,0.00048624937,0.0011154385,0.000783436,0.0001570777,0.04242961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955047,0.0015222607,0.00027978892,0.00085978454,0.0014969797,0.000336561],"domain_scores_gemma":[0.996375,0.0010495095,0.0003923953,0.0013832153,0.000532976,0.00026685002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036139693,0.00045086173,0.00063645106,0.00085564214,0.0015746151,0.0025332926,0.0027731895,0.00237952,0.006126627],"category_scores_gemma":[0.0054283924,0.00036370187,0.0007967288,0.00091322564,0.0029109989,0.0064033843,0.0041891583,0.0027394667,0.0039638267],"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.00017665874,0.00011177348,0.00029882512,0.0003171181,0.000075905606,0.00029211363,0.00038825194,0.0041739047,0.011459217,0.92860943,0.005441016,0.048655756],"study_design_scores_gemma":[0.00015650535,0.0003141326,0.00029968284,0.00013513703,0.00015490729,0.0010686258,0.00019342317,0.076322235,0.034135263,0.7220546,0.16502804,0.00013755841],"about_ca_topic_score_codex":0.00025636354,"about_ca_topic_score_gemma":0.00018752419,"teacher_disagreement_score":0.006126627,"about_ca_system_score_codex":0.0007614027,"about_ca_system_score_gemma":0.0023301325,"threshold_uncertainty_score":0.020495534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018652491,0.0007939497,0.9743103,0.00017433992,0.00023423851,0.0001607883,0.00015522196,0.0012725954,0.004246091],"genre_scores_gemma":[0.3136982,0.0010424773,0.6730012,0.00034425614,0.00017717085,0.0002038839,0.0007005533,0.0002539044,0.010578352],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950063,0.00006848527,0.00005650954,0.00008330735,0.00023539265,0.000055594086],"domain_scores_gemma":[0.9996074,0.000074448886,0.00006304064,0.00009266331,0.00013113937,0.000031250685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043154802,0.0004921197,0.0004726235,0.00086608133,0.00042471796,0.00076755637,0.0006932839,0.0005842263,0.0027578585],"category_scores_gemma":[0.0010065746,0.00021357862,0.0004593856,0.00066617643,0.00057752116,0.0033026577,0.0007553757,0.0011954056,0.001363639],"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.0017366679,0.00021026262,0.0016677157,0.00096564536,0.00016930286,0.0006196652,0.00031136,0.02507405,0.21380754,0.21135627,0.012470929,0.53161055],"study_design_scores_gemma":[0.0003588715,0.001511567,0.0018648716,0.00014894393,0.00016757495,0.0053416835,0.00013923914,0.45818046,0.28588703,0.09011735,0.15608291,0.00019946056],"about_ca_topic_score_codex":0.00029028757,"about_ca_topic_score_gemma":0.00034355864,"teacher_disagreement_score":0.0027578585,"about_ca_system_score_codex":0.00046186574,"about_ca_system_score_gemma":0.00053614244,"threshold_uncertainty_score":0.009225905},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03815746,0.0008426247,0.9474008,0.0036629047,0.00025689218,0.000530961,0.0003857964,0.001092165,0.0076704114],"genre_scores_gemma":[0.7608911,0.0010199718,0.22924575,0.0012285522,0.0005563005,0.0005799801,0.0006494781,0.00022678493,0.0056020957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9629764,0.012629072,0.002564053,0.00410958,0.015317582,0.0024033447],"domain_scores_gemma":[0.83304083,0.09971404,0.009999273,0.048982028,0.006633344,0.0016304632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0176906,0.0016291483,0.002349536,0.0022350089,0.0037733281,0.004417942,0.0056274333,0.0048279027,0.0041991663],"category_scores_gemma":[0.1003157,0.0014780014,0.0019322959,0.003387994,0.012099086,0.02236681,0.01256095,0.007448563,0.0019678308],"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.0027189404,0.00063901657,0.006495855,0.0013768608,0.000543342,0.0016601776,0.0023745368,0.111956246,0.025231313,0.6547847,0.012980853,0.1792382],"study_design_scores_gemma":[0.0006483488,0.00077031925,0.0011950586,0.00025432088,0.00021317485,0.002426195,0.0005645273,0.37357426,0.05277369,0.55539185,0.011974173,0.00021409655],"about_ca_topic_score_codex":0.0012398461,"about_ca_topic_score_gemma":0.0009371579,"teacher_disagreement_score":0.0176906,"about_ca_system_score_codex":0.0047679944,"about_ca_system_score_gemma":0.0050132493,"threshold_uncertainty_score":0.093557954},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41639537,0.0025590889,0.33703676,0.012165698,0.00067415455,0.0002780608,0.0005627569,0.0010893905,0.22923875],"genre_scores_gemma":[0.9728822,0.0005104133,0.016954051,0.00038962608,0.00009259494,0.00004799929,0.00008230625,0.000035535384,0.009005216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733436,0.0008994911,0.00011168547,0.00022146397,0.00095500273,0.0004780101],"domain_scores_gemma":[0.9957111,0.002285262,0.00043458815,0.0012593311,0.0001742021,0.00013549664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017684165,0.0004901717,0.00076344324,0.0005702866,0.0011714771,0.0014033888,0.00053248426,0.002393264,0.0023602354],"category_scores_gemma":[0.0071856086,0.00034691693,0.0008930639,0.00055908493,0.0022815296,0.004693928,0.0025697434,0.0025172613,0.00077115797],"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.001057339,0.00011660787,0.0014198881,0.00013019645,0.00009744106,0.003078949,0.00082201743,0.02447617,0.015767977,0.91673356,0.007847259,0.028452625],"study_design_scores_gemma":[0.00024048788,0.0003332564,0.0023729426,0.00018288933,0.00010242307,0.006930613,0.0003218694,0.311094,0.049999043,0.5967533,0.031556234,0.00011299088],"about_ca_topic_score_codex":0.0007453006,"about_ca_topic_score_gemma":0.00055072474,"teacher_disagreement_score":0.002393264,"about_ca_system_score_codex":0.0011542889,"about_ca_system_score_gemma":0.0005246151,"threshold_uncertainty_score":0.009352386},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006816634,0.0046199416,0.9168954,0.0035982132,0.0020863602,0.001445935,0.0016797568,0.0074961097,0.0553617],"genre_scores_gemma":[0.3552674,0.0061366516,0.5398882,0.005053558,0.0012643768,0.0042854543,0.006419357,0.0011120511,0.08057295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99463344,0.001660594,0.00050386554,0.0005720761,0.0020314227,0.0005985229],"domain_scores_gemma":[0.9976947,0.00047204623,0.00037028515,0.0007059162,0.00041818825,0.0003389414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038578606,0.001042175,0.0012410424,0.0020258885,0.0019700974,0.003004413,0.003184814,0.0033326864,0.01035321],"category_scores_gemma":[0.0062654326,0.00047726618,0.0006648429,0.0023553912,0.0027699724,0.006596202,0.0074422727,0.0048225005,0.008920532],"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.0012876207,0.00024647103,0.00065469614,0.0011335893,0.00011117915,0.0009895436,0.0009307585,0.004755133,0.01823453,0.7048368,0.07302182,0.19379781],"study_design_scores_gemma":[0.00023294504,0.00031665585,0.0004546108,0.0002715022,0.00010563881,0.001962682,0.00018653195,0.028171653,0.019021802,0.30900258,0.64007473,0.00019867324],"about_ca_topic_score_codex":0.00057821407,"about_ca_topic_score_gemma":0.00044933407,"teacher_disagreement_score":0.01035321,"about_ca_system_score_codex":0.0012030161,"about_ca_system_score_gemma":0.0022172336,"threshold_uncertainty_score":0.034634948},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008605445,0.0014342106,0.96288687,0.0004899871,0.0004010031,0.00013906487,0.00008687963,0.0012273714,0.024729079],"genre_scores_gemma":[0.58759326,0.0035766943,0.3775132,0.0011523628,0.00070338935,0.0003342487,0.00042992778,0.0004980059,0.028198965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977779,0.0005860284,0.000081245256,0.00028774238,0.0010817809,0.00018531877],"domain_scores_gemma":[0.9973501,0.00094811234,0.00021669334,0.0011717237,0.0002648223,0.00004848635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010659324,0.0010491722,0.00084387936,0.0009672227,0.00087293005,0.0013513995,0.00081912696,0.0017824041,0.010899885],"category_scores_gemma":[0.0047526998,0.0003652533,0.0006406252,0.0007075331,0.0015976104,0.002632425,0.0016511707,0.0024820797,0.004579647],"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.00048418262,0.00018347669,0.0012934468,0.0008457174,0.000258214,0.0007196983,0.00022230363,0.044096828,0.099447325,0.4366522,0.016600622,0.399196],"study_design_scores_gemma":[0.00009824211,0.0007607496,0.0018941992,0.0004998495,0.00019357895,0.007030284,0.00018310214,0.39446124,0.21309094,0.23299167,0.14863881,0.00015731013],"about_ca_topic_score_codex":0.00014209273,"about_ca_topic_score_gemma":0.00019511297,"teacher_disagreement_score":0.010899885,"about_ca_system_score_codex":0.0005159414,"about_ca_system_score_gemma":0.00071019033,"threshold_uncertainty_score":0.036463678},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041661665,0.0004883778,0.9376341,0.0009797808,0.000116358155,0.0002747394,0.0002297005,0.00043528658,0.018180057],"genre_scores_gemma":[0.73167694,0.0006148661,0.2526374,0.0003756307,0.00015568102,0.00031341842,0.00024485873,0.000068722744,0.013912556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752873,0.0005897979,0.00018719792,0.0003834003,0.0010519952,0.00025888756],"domain_scores_gemma":[0.9966234,0.0008173549,0.00048016076,0.0015127977,0.00030691922,0.0002594152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017405852,0.00031650328,0.0004011503,0.0009183078,0.0012796774,0.0024164026,0.0014240912,0.0009988914,0.0041308026],"category_scores_gemma":[0.0036580558,0.00043007446,0.00078073045,0.0013757718,0.0030436579,0.005853306,0.003771649,0.002093414,0.0008115971],"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.00005257746,0.000027738362,0.00024644684,0.00005991972,0.0000130953285,0.000107596185,0.00035400846,0.0041058455,0.009388315,0.9691896,0.0008183477,0.01563665],"study_design_scores_gemma":[0.00006147821,0.0002457075,0.0006064815,0.00006497129,0.00005094784,0.0010328662,0.00022429088,0.11460595,0.016589964,0.8206862,0.045773532,0.00005767786],"about_ca_topic_score_codex":0.00069746556,"about_ca_topic_score_gemma":0.00082845835,"teacher_disagreement_score":0.0041308026,"about_ca_system_score_codex":0.0017025401,"about_ca_system_score_gemma":0.0015638593,"threshold_uncertainty_score":0.01381892},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058467355,0.0021579273,0.91639084,0.0037049514,0.0004325634,0.0004594371,0.00077899673,0.0033140162,0.014293829],"genre_scores_gemma":[0.65934765,0.0025997546,0.31671646,0.0016556499,0.00040367406,0.0009572024,0.0014174387,0.0012464144,0.015655678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960376,0.00091186527,0.0003546854,0.00086676405,0.0013541866,0.0004749142],"domain_scores_gemma":[0.9799682,0.00882384,0.0012847937,0.008347494,0.0011772391,0.0003984649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037774995,0.0014022994,0.0016641541,0.0011742354,0.0010992618,0.0037054268,0.0022438264,0.0024173418,0.012316496],"category_scores_gemma":[0.035781574,0.0008042714,0.0016066541,0.0015663226,0.0029951392,0.019575054,0.00444811,0.0040079933,0.0034134635],"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.000870903,0.000149159,0.0012957052,0.0011240052,0.00013812749,0.0003461713,0.00077191985,0.06314105,0.024110025,0.7167602,0.0072322367,0.1840605],"study_design_scores_gemma":[0.00010740793,0.0003059913,0.00025946888,0.00031539667,0.000106435145,0.0006161918,0.00022077655,0.08280316,0.034583397,0.8558099,0.024795562,0.00007625695],"about_ca_topic_score_codex":0.00045087014,"about_ca_topic_score_gemma":0.00041578303,"teacher_disagreement_score":0.012316496,"about_ca_system_score_codex":0.0018222235,"about_ca_system_score_gemma":0.0015853875,"threshold_uncertainty_score":0.041202784},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013975884,0.0005651592,0.95760936,0.0024462633,0.00038432342,0.00025422694,0.00023221919,0.0006108407,0.02392174],"genre_scores_gemma":[0.7369516,0.0008216502,0.22546561,0.0011120543,0.00038926105,0.0006616876,0.0004304111,0.00015426445,0.034013484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.989398,0.0053093494,0.0010161303,0.0014368928,0.0020834475,0.0007561999],"domain_scores_gemma":[0.98706806,0.0030794085,0.0012596463,0.0069791568,0.0008751069,0.00073862396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056024925,0.00089743047,0.001057894,0.00084761746,0.0020710474,0.0052973125,0.0026522346,0.0039160084,0.009037183],"category_scores_gemma":[0.0127262175,0.00089173275,0.000859925,0.0013636495,0.0054073287,0.02270191,0.007483796,0.0055297944,0.0040634726],"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.00016170202,0.000043138698,0.00030400316,0.00007927016,0.000018879702,0.00017955269,0.000383007,0.0020973186,0.0018808456,0.98178136,0.0025650673,0.010505877],"study_design_scores_gemma":[0.000150647,0.00016621279,0.00019909425,0.000103142476,0.00004069958,0.0010642596,0.00029096182,0.06902721,0.008003049,0.85807604,0.062792994,0.000085698164],"about_ca_topic_score_codex":0.00039195883,"about_ca_topic_score_gemma":0.00030059257,"teacher_disagreement_score":0.009037183,"about_ca_system_score_codex":0.0018145295,"about_ca_system_score_gemma":0.0014110309,"threshold_uncertainty_score":0.03023243},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009625827,0.00020144864,0.97842777,0.00026785952,0.00016671825,0.00012807455,0.00011720557,0.0011058119,0.0099593345],"genre_scores_gemma":[0.58984625,0.0008396254,0.39327964,0.00037283936,0.00034861715,0.0005533894,0.0005912719,0.00035389687,0.013814514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950287,0.0013709299,0.0003755234,0.0009706369,0.0018220509,0.00043212424],"domain_scores_gemma":[0.99216956,0.0018664298,0.0010068999,0.0034279663,0.0012747588,0.00025439996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034962443,0.0006461183,0.0006183968,0.0009091435,0.001354779,0.0027411296,0.0023622382,0.0014794794,0.0045474563],"category_scores_gemma":[0.010076084,0.0004614578,0.00086325937,0.0010681455,0.0027677643,0.0053296518,0.0037133836,0.002548223,0.0013664719],"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.0002709497,0.00005105229,0.00057568157,0.00018322255,0.000042538668,0.0002823558,0.000477529,0.040107664,0.015156143,0.89344966,0.0038244026,0.045578767],"study_design_scores_gemma":[0.00018255199,0.00032576665,0.00036737404,0.00014250283,0.00011648715,0.0007789248,0.00017852719,0.43508402,0.048908312,0.3900769,0.12372794,0.00011059926],"about_ca_topic_score_codex":0.0007295955,"about_ca_topic_score_gemma":0.00058585167,"teacher_disagreement_score":0.0045474563,"about_ca_system_score_codex":0.0019204691,"about_ca_system_score_gemma":0.0022221296,"threshold_uncertainty_score":0.018490136},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04924808,0.0007158615,0.9311356,0.0019563166,0.00030501332,0.00057648716,0.0007176096,0.0015889724,0.013756094],"genre_scores_gemma":[0.7481149,0.00047791592,0.24028713,0.00052275584,0.00034417445,0.00040960067,0.0007634177,0.00007799211,0.009002115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99558604,0.001168514,0.00035765392,0.00060673006,0.0018225431,0.0004584816],"domain_scores_gemma":[0.9942848,0.0017868311,0.00076365605,0.0018145784,0.00064813363,0.00070198823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004567249,0.0006176923,0.00094334007,0.001148743,0.0021993585,0.002747958,0.0017714316,0.0014332209,0.003127379],"category_scores_gemma":[0.0075861677,0.0003895136,0.00111602,0.0016812219,0.0035994109,0.009117905,0.00548125,0.0028863829,0.00069144036],"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.00026729357,0.0001373733,0.0005267111,0.00019488722,0.000057450485,0.00020698189,0.0007853918,0.0068202186,0.008705305,0.9374821,0.005895221,0.038921062],"study_design_scores_gemma":[0.0003174006,0.0004821189,0.0006165848,0.0000735726,0.00013446114,0.000721662,0.00024232821,0.10409278,0.009534364,0.85113424,0.032533776,0.00011666945],"about_ca_topic_score_codex":0.0010869255,"about_ca_topic_score_gemma":0.0010839676,"teacher_disagreement_score":0.004567249,"about_ca_system_score_codex":0.0019258005,"about_ca_system_score_gemma":0.0027840938,"threshold_uncertainty_score":0.024154246},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021932552,0.00060745236,0.9503958,0.0012682846,0.00027615143,0.0001615543,0.00008434457,0.00059382454,0.024680153],"genre_scores_gemma":[0.8057753,0.0005941014,0.17794307,0.0005197048,0.0004043132,0.00045487,0.0002041727,0.00031077414,0.013793781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930099,0.0024091003,0.0005605667,0.001271353,0.0020736246,0.0006755606],"domain_scores_gemma":[0.9900865,0.004880024,0.0010018533,0.0028804995,0.00067005854,0.00048105026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007584075,0.0010121197,0.0008192401,0.0012649574,0.0028085636,0.0030663759,0.0019834049,0.0016626953,0.005142455],"category_scores_gemma":[0.015037615,0.00073552626,0.0017942156,0.0011400556,0.007982665,0.008658696,0.0042990246,0.0043307003,0.0008369715],"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.00004837476,0.000019428222,0.00015071403,0.00003837053,0.000012355124,0.000078816636,0.00020190568,0.0072647175,0.0010126382,0.9851245,0.00032324094,0.00572506],"study_design_scores_gemma":[0.0000332175,0.00004471758,0.00011592278,0.000036478392,0.000036921345,0.00014001159,0.000054910066,0.052207105,0.0043799006,0.9308497,0.012082577,0.000018512566],"about_ca_topic_score_codex":0.001743885,"about_ca_topic_score_gemma":0.0009570982,"teacher_disagreement_score":0.007584075,"about_ca_system_score_codex":0.002710157,"about_ca_system_score_gemma":0.0021607166,"threshold_uncertainty_score":0.04010892},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055422988,0.000743953,0.92293775,0.0006957705,0.00017857809,0.00013211786,0.00027578406,0.0055737123,0.014039263],"genre_scores_gemma":[0.32799017,0.0005167574,0.65150696,0.0003314878,0.00037299938,0.00019768102,0.0013163242,0.0008601658,0.01690746],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978915,0.00036929696,0.00016554007,0.00038699643,0.0009349274,0.0002517134],"domain_scores_gemma":[0.9970885,0.0010481183,0.0001605974,0.0012907577,0.00030896266,0.000103119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015740816,0.0009827605,0.0011140667,0.0017707743,0.00061943295,0.0023257358,0.0012605829,0.00067530107,0.009104431],"category_scores_gemma":[0.0064820326,0.0004038498,0.0016810418,0.0015335038,0.001222918,0.007176664,0.0026578421,0.002294103,0.0046711667],"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.00085886935,0.0003211416,0.0029827598,0.00036416465,0.00008640335,0.00019324264,0.00048723826,0.041270435,0.012896218,0.2380392,0.013411104,0.6890891],"study_design_scores_gemma":[0.00026925656,0.00032022063,0.0011751086,0.00012892277,0.00007789284,0.0005271612,0.0001646375,0.44157943,0.028092,0.49709192,0.030489499,0.000083929495],"about_ca_topic_score_codex":0.0018758766,"about_ca_topic_score_gemma":0.002358149,"teacher_disagreement_score":0.009104431,"about_ca_system_score_codex":0.001388727,"about_ca_system_score_gemma":0.0017641373,"threshold_uncertainty_score":0.030457377},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020187771,0.0010282252,0.95367575,0.0013676506,0.00016649821,0.00033483212,0.000667859,0.0038158009,0.018755503],"genre_scores_gemma":[0.47599918,0.0009012978,0.50592405,0.0010560558,0.00050242,0.00051416294,0.0012056844,0.0015634293,0.012333745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9823194,0.00479679,0.0010192721,0.0031505208,0.0070965826,0.0016173827],"domain_scores_gemma":[0.9362177,0.04124262,0.004141264,0.01414473,0.002714289,0.0015393994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073244837,0.0013261682,0.0012631026,0.0016590891,0.001697817,0.0053141634,0.003702719,0.0016291707,0.015137509],"category_scores_gemma":[0.050283704,0.0016316964,0.0024713122,0.0022532982,0.0046483786,0.018337147,0.009310593,0.0060298713,0.003967475],"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.0006373317,0.00023505092,0.0018705692,0.0008863313,0.00020686098,0.0004348743,0.0009959234,0.021740006,0.013564122,0.84510684,0.0075489185,0.106773145],"study_design_scores_gemma":[0.00011030372,0.00014656568,0.00037727974,0.00009065233,0.00014315807,0.0004053846,0.000087975015,0.0817107,0.016599186,0.8851769,0.015083638,0.00006823872],"about_ca_topic_score_codex":0.00090238004,"about_ca_topic_score_gemma":0.0010487505,"teacher_disagreement_score":0.015137509,"about_ca_system_score_codex":0.002815238,"about_ca_system_score_gemma":0.0035703056,"threshold_uncertainty_score":0.050640047},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11931063,0.0059546456,0.5949907,0.017473267,0.0015384491,0.0003777533,0.0012957301,0.0015218856,0.25753698],"genre_scores_gemma":[0.9424101,0.0027813548,0.031371027,0.0011932787,0.00091280154,0.00013567752,0.00044819617,0.00021886542,0.020528719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99519795,0.0014588622,0.00022537676,0.00055523973,0.001691382,0.0008711106],"domain_scores_gemma":[0.98852867,0.0061258255,0.0005741529,0.0036530066,0.0009440313,0.00017436744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038842533,0.0011620816,0.0015253796,0.0031802622,0.002232541,0.0034507858,0.001913131,0.0030036743,0.010781293],"category_scores_gemma":[0.022810852,0.00053086714,0.0015005443,0.0031940555,0.004293941,0.012862548,0.0032779628,0.0047936905,0.0036076424],"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.00028445545,0.000059054615,0.00076706137,0.00011791852,0.000038182963,0.000332257,0.00027746116,0.011050451,0.0008201498,0.933244,0.022896128,0.030112943],"study_design_scores_gemma":[0.000041050756,0.000040000737,0.00041582822,0.00005932052,0.000055811564,0.00047276897,0.00010619847,0.058010045,0.0016155958,0.9302883,0.008862555,0.000032469485],"about_ca_topic_score_codex":0.0011623595,"about_ca_topic_score_gemma":0.0010621459,"teacher_disagreement_score":0.010781293,"about_ca_system_score_codex":0.0024940998,"about_ca_system_score_gemma":0.0020049652,"threshold_uncertainty_score":0.03606701},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05983827,0.0012908842,0.90163857,0.002000997,0.00035592064,0.00047494457,0.0006666248,0.001679142,0.0320547],"genre_scores_gemma":[0.8224517,0.00069128687,0.15505213,0.00046842083,0.00025967066,0.0004885048,0.00079625275,0.00021223594,0.019579677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99679726,0.0009985168,0.00017150382,0.0004372601,0.0012903936,0.00030512054],"domain_scores_gemma":[0.9962942,0.0016434588,0.00036954874,0.0012818369,0.00025290984,0.00015804793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020746645,0.00055172824,0.0006263022,0.00083334383,0.00086157775,0.0013771462,0.001008406,0.0007201888,0.0072933915],"category_scores_gemma":[0.0068654455,0.00040728977,0.00079461525,0.00079687225,0.0017768643,0.0035592031,0.0036120934,0.0021755872,0.0019052406],"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.0004587815,0.00008742698,0.000583635,0.0003256616,0.000041714786,0.00032890294,0.0005518999,0.011016013,0.014062988,0.8817675,0.005269556,0.085505955],"study_design_scores_gemma":[0.00033929083,0.00043251595,0.0007510623,0.00014291414,0.000070045935,0.001527121,0.00014524697,0.060197126,0.060336623,0.80514365,0.070830725,0.0000836441],"about_ca_topic_score_codex":0.0000976542,"about_ca_topic_score_gemma":0.000075345575,"teacher_disagreement_score":0.0072933915,"about_ca_system_score_codex":0.0007778839,"about_ca_system_score_gemma":0.0008162133,"threshold_uncertainty_score":0.024398863},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008828955,0.08435815,0.018695582,0.12484671,0.00866866,0.000030959076,0.00013593482,0.00010595362,0.75432914],"genre_scores_gemma":[0.55934167,0.06727735,0.008703233,0.048630934,0.018564593,0.0001399774,0.00017115704,0.00026002608,0.29691097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834573,0.0006076523,0.000052927462,0.00022143054,0.0005775025,0.00019473273],"domain_scores_gemma":[0.9980927,0.0008971857,0.0001559472,0.00044998538,0.0003252926,0.00007888261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002224863,0.00045131063,0.00027094944,0.0011197804,0.0019263201,0.0033158893,0.0006039718,0.0029308468,0.010042836],"category_scores_gemma":[0.00529295,0.00018320266,0.00028743225,0.000815879,0.011049988,0.009075474,0.0021111409,0.005365436,0.0036542986],"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.0000048876063,0.000002635213,0.000031458458,0.000017475768,0.0000012419478,0.000009859414,0.00011442025,0.000038157963,0.000032497286,0.9874599,0.007854791,0.0044326787],"study_design_scores_gemma":[0.0000055703986,0.0000116613855,0.00018049791,0.00012189908,0.0000018856705,0.00009575737,0.0001204278,0.00019396574,0.00019296684,0.6854759,0.31359315,0.0000063651883],"about_ca_topic_score_codex":0.00074850605,"about_ca_topic_score_gemma":0.0008049372,"teacher_disagreement_score":0.010042836,"about_ca_system_score_codex":0.0032042845,"about_ca_system_score_gemma":0.001126538,"threshold_uncertainty_score":0.033596694},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007999955,0.06761948,0.0087632155,0.88514465,0.006280758,0.000026022082,0.00013486535,0.00018664135,0.023844445],"genre_scores_gemma":[0.45773345,0.29106343,0.018972449,0.1899346,0.013978598,0.00019061624,0.00035226377,0.00025129042,0.027523287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980489,0.0006264572,0.00007384473,0.00016596836,0.0006338336,0.0004509995],"domain_scores_gemma":[0.9897316,0.004493323,0.00082523527,0.00072144193,0.0022069642,0.002021471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005715451,0.00058655685,0.0008740907,0.00093250314,0.0034880554,0.009226342,0.0011970378,0.009564154,0.016610203],"category_scores_gemma":[0.015704261,0.00037931078,0.0006169251,0.0010822435,0.010008981,0.037925784,0.003599291,0.011880479,0.0039747213],"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.00021179926,0.00025178088,0.0023791858,0.0010740771,0.00006632843,0.00035545568,0.0020220235,0.001778556,0.0013589517,0.5378541,0.25229105,0.20035668],"study_design_scores_gemma":[0.00002693111,0.00017199286,0.0013997029,0.0018700073,0.000030982028,0.00017872201,0.006998438,0.000998254,0.0006099985,0.66059405,0.3270116,0.00010921297],"about_ca_topic_score_codex":0.0035544746,"about_ca_topic_score_gemma":0.0045623486,"teacher_disagreement_score":0.016610203,"about_ca_system_score_codex":0.0026148974,"about_ca_system_score_gemma":0.0095604155,"threshold_uncertainty_score":0.05556667},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012372231,0.00018412036,0.97433734,0.00036420734,0.000054148375,0.00023162067,0.00020274072,0.0065700687,0.0056834696],"genre_scores_gemma":[0.56283474,0.00042886878,0.4265169,0.00035425028,0.00008081355,0.0007151021,0.00077809935,0.0011188303,0.0071724295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981926,0.00051691546,0.000105191306,0.0002643997,0.00067787746,0.00024294657],"domain_scores_gemma":[0.9980021,0.0006590944,0.000116298754,0.0010211959,0.00013037892,0.00007081126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019924499,0.0007026979,0.0005314357,0.00053981296,0.00079805776,0.0017570416,0.0015079475,0.000886507,0.00619343],"category_scores_gemma":[0.0045466013,0.00047331688,0.00071773527,0.00059979677,0.0017247859,0.0035802808,0.0035147485,0.0027859863,0.001701508],"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.0005179086,0.00020164948,0.00084053806,0.00040917893,0.00008121186,0.00024821344,0.0003018642,0.10820714,0.024299627,0.71433955,0.013618831,0.13693425],"study_design_scores_gemma":[0.00012664107,0.00014001977,0.00019348985,0.00006241888,0.000037840884,0.00016992135,0.000046706667,0.61744493,0.04635648,0.31192294,0.023453925,0.000044679484],"about_ca_topic_score_codex":0.0006802684,"about_ca_topic_score_gemma":0.00085778127,"teacher_disagreement_score":0.00619343,"about_ca_system_score_codex":0.000812177,"about_ca_system_score_gemma":0.002100007,"threshold_uncertainty_score":0.020719111},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03241012,0.00039067265,0.95693237,0.00024410708,0.00009119936,0.00025254782,0.00019647635,0.00406343,0.00541909],"genre_scores_gemma":[0.7568123,0.00040730461,0.23576294,0.00023896448,0.00012522117,0.00021602542,0.00046973946,0.00026390952,0.005703545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973585,0.00044351537,0.00030733517,0.00047534404,0.0010371207,0.0003781969],"domain_scores_gemma":[0.99627614,0.00063517585,0.00033376558,0.0019910075,0.000535821,0.0002280842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013099356,0.0005003542,0.0011698278,0.000715664,0.0010567794,0.0023517725,0.0017665614,0.0008818591,0.0027445378],"category_scores_gemma":[0.0038372688,0.00038763738,0.000854287,0.0014119907,0.0010290081,0.006928001,0.0032186022,0.002028662,0.0013292828],"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.0022193359,0.0006576123,0.0021710056,0.00055333483,0.00016344881,0.0017449213,0.0010748467,0.07001184,0.15924473,0.4343393,0.012420538,0.31539905],"study_design_scores_gemma":[0.00022601022,0.00028303568,0.00070027023,0.000057251742,0.000086967666,0.0010988687,0.00010195457,0.7450782,0.1354699,0.082184285,0.034549057,0.00016425166],"about_ca_topic_score_codex":0.0012749357,"about_ca_topic_score_gemma":0.0007704183,"teacher_disagreement_score":0.0027445378,"about_ca_system_score_codex":0.0010382961,"about_ca_system_score_gemma":0.0015841653,"threshold_uncertainty_score":0.00918138},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047221605,0.0005342638,0.9410697,0.00045280156,0.00024830815,0.000120735494,0.00006872862,0.001286002,0.008997854],"genre_scores_gemma":[0.36185703,0.00037194754,0.63030875,0.00020675422,0.00028326354,0.00008761223,0.00015694299,0.00041681406,0.0063108453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857867,0.00038428954,0.00005908161,0.00023797994,0.0006387048,0.00010140031],"domain_scores_gemma":[0.9979699,0.00075260305,0.00014877947,0.00074759347,0.00023518642,0.00014583879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015037325,0.00058001874,0.00079170463,0.0011480155,0.0006628156,0.0018117152,0.0011083183,0.00047255366,0.0045242226],"category_scores_gemma":[0.007431854,0.00026293882,0.0005752945,0.0011127976,0.0017370344,0.0023642855,0.003206611,0.0022025313,0.0014657646],"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.00043981764,0.00009916611,0.002409988,0.00025955465,0.000051841893,0.00041666065,0.0003511843,0.016500497,0.024695553,0.54993343,0.008311328,0.39653087],"study_design_scores_gemma":[0.00012011675,0.00037023556,0.0016222019,0.00007314814,0.00005472924,0.0011946592,0.00012472621,0.26661518,0.033944502,0.6550796,0.04070376,0.0000971869],"about_ca_topic_score_codex":0.00021709148,"about_ca_topic_score_gemma":0.0003736567,"teacher_disagreement_score":0.0045242226,"about_ca_system_score_codex":0.00069345045,"about_ca_system_score_gemma":0.00069524074,"threshold_uncertainty_score":0.01513505},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026207779,0.00028813723,0.96221936,0.0011004288,0.00014404424,0.00012875289,0.0002422537,0.00040961214,0.009259677],"genre_scores_gemma":[0.76169205,0.0004909692,0.22479667,0.0005956297,0.00026393577,0.0003622915,0.00049652305,0.00017634196,0.011125562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933407,0.0021060125,0.00052909914,0.0006747446,0.0026454593,0.00070414646],"domain_scores_gemma":[0.9907244,0.0033389893,0.00085198286,0.0038863753,0.00081082596,0.00038749265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053634285,0.000587885,0.00084333913,0.00074442895,0.0012898443,0.0034701347,0.0016611962,0.0014508525,0.003715365],"category_scores_gemma":[0.011307537,0.00039293696,0.0013579929,0.0010880004,0.0038356562,0.01217895,0.005635756,0.004629441,0.0013847406],"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.00015954109,0.00005439492,0.0002877996,0.00009566675,0.00001837327,0.0001029186,0.0003332595,0.0064484808,0.003113787,0.9633667,0.0015091116,0.024509953],"study_design_scores_gemma":[0.00006556025,0.00015357875,0.00018290548,0.00005146673,0.000033758177,0.00039784424,0.00014109034,0.075911894,0.01476038,0.89319396,0.015053834,0.000053779702],"about_ca_topic_score_codex":0.00039121206,"about_ca_topic_score_gemma":0.00023596971,"teacher_disagreement_score":0.0053634285,"about_ca_system_score_codex":0.0016209116,"about_ca_system_score_gemma":0.0017916366,"threshold_uncertainty_score":0.028364897},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.913076,0.0006756949,0.03404987,0.0017363667,0.00015562249,0.00009212689,0.0004777532,0.00015013329,0.049586415],"genre_scores_gemma":[0.9847904,0.00061624387,0.0048755095,0.00021624606,0.00013447014,0.000049051072,0.0005426933,0.00009740432,0.008678063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956876,0.00010769216,0.000012363327,0.000098958844,0.000102637474,0.00010963758],"domain_scores_gemma":[0.9984401,0.00064778514,0.00034553386,0.00012506342,0.00014184075,0.00029971788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046176318,0.0007451199,0.0006704045,0.0030506265,0.0019472453,0.0024983326,0.00070616364,0.0009874781,0.0062786997],"category_scores_gemma":[0.002439256,0.00038804114,0.0006167502,0.0017003355,0.0023006792,0.0033763172,0.0014936791,0.0015205815,0.00058933685],"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.000098291624,0.000040087878,0.0015307568,0.00007122378,0.000010434764,0.00040310496,0.0006691018,0.0042255498,0.0020178135,0.9816181,0.0018183051,0.0074970657],"study_design_scores_gemma":[0.000020787473,0.000022143013,0.0011559672,0.00003234763,0.000012772809,0.00022086334,0.00040112704,0.006620184,0.0011149534,0.9869467,0.0034389999,0.000013214305],"about_ca_topic_score_codex":0.0013627309,"about_ca_topic_score_gemma":0.0009887132,"teacher_disagreement_score":0.0062786997,"about_ca_system_score_codex":0.0012639994,"about_ca_system_score_gemma":0.00048890524,"threshold_uncertainty_score":0.02100432},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15613602,0.0111495,0.73490036,0.0010908233,0.0007000002,0.0011013296,0.0016151794,0.0067140507,0.08659283],"genre_scores_gemma":[0.80916643,0.004451283,0.14710198,0.0005644462,0.0001965422,0.0005762781,0.0018905344,0.00031695704,0.035735544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937373,0.00009035495,0.000058655805,0.00008103878,0.00027963804,0.0001167112],"domain_scores_gemma":[0.99948263,0.000091513815,0.00013489481,0.00013573775,0.0001057296,0.0000495078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063741265,0.00062466285,0.00041441649,0.0010313356,0.00044816156,0.0008499576,0.00042923447,0.00032841827,0.0032873268],"category_scores_gemma":[0.0011412998,0.00025465025,0.0005019689,0.0006342874,0.0007192978,0.0016017023,0.0009339027,0.0010281942,0.0012684561],"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.0016359729,0.00019469825,0.0026755712,0.0008502043,0.00019394717,0.000767407,0.00025212075,0.043143995,0.12523155,0.44456834,0.022794137,0.3576921],"study_design_scores_gemma":[0.0003888086,0.0014438762,0.0023850717,0.00020666787,0.00020068778,0.0042177397,0.00013695993,0.16955908,0.24358131,0.11198723,0.46574688,0.00014574901],"about_ca_topic_score_codex":0.00028952086,"about_ca_topic_score_gemma":0.00045407173,"teacher_disagreement_score":0.0032873268,"about_ca_system_score_codex":0.0005573395,"about_ca_system_score_gemma":0.0008739812,"threshold_uncertainty_score":0.010997176},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011081118,0.00026485123,0.9846348,0.0001800074,0.00008279286,0.00012723467,0.000032895623,0.00035728485,0.0032389842],"genre_scores_gemma":[0.7554147,0.00047687197,0.23329557,0.00022902508,0.00012335714,0.00033293094,0.00015353569,0.00009117202,0.009882794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997322,0.00094623707,0.00010617286,0.00034994117,0.0009759546,0.00029970647],"domain_scores_gemma":[0.9952068,0.0022013236,0.00045825145,0.0015527001,0.0003873251,0.00019354852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028022951,0.0006449896,0.00081433676,0.00066132547,0.00091877725,0.0020367894,0.002658215,0.0014891792,0.003351191],"category_scores_gemma":[0.0057657682,0.00047918258,0.000866719,0.0007344472,0.0035803297,0.005841398,0.0034758383,0.0019536307,0.0012536801],"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.0003274828,0.00010798011,0.00043430124,0.00015851656,0.000069514834,0.0002757479,0.000390051,0.03624335,0.010669448,0.92452306,0.0018299167,0.024970656],"study_design_scores_gemma":[0.00011984063,0.0003247192,0.0002063965,0.000035955105,0.00006668959,0.00047317139,0.00009722786,0.6599391,0.022065675,0.3038275,0.012775345,0.000068461726],"about_ca_topic_score_codex":0.00040166345,"about_ca_topic_score_gemma":0.00032986456,"teacher_disagreement_score":0.003351191,"about_ca_system_score_codex":0.0010300963,"about_ca_system_score_gemma":0.0009773192,"threshold_uncertainty_score":0.0148201585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15031749,0.0023852626,0.8051054,0.0012834504,0.0006173954,0.00036490549,0.00035074214,0.0009423057,0.038633123],"genre_scores_gemma":[0.7018152,0.0014392937,0.27914754,0.00015984642,0.00031118852,0.00018776047,0.0006245893,0.00014485639,0.016169667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990711,0.00023724143,0.000063159816,0.00019128644,0.00032828422,0.00010895775],"domain_scores_gemma":[0.9991441,0.00031162874,0.00007050118,0.00030156143,0.0001031401,0.00006903517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009867967,0.00085080724,0.0009583831,0.0015339828,0.0015140856,0.0027986679,0.0007736823,0.001036847,0.010240987],"category_scores_gemma":[0.0034918748,0.00036668812,0.000934166,0.0015652574,0.0019898573,0.0058605275,0.0024973052,0.0023765867,0.002224645],"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.00037993447,0.000109065026,0.0016312294,0.00035638345,0.00005164539,0.00031185805,0.00051270984,0.014678104,0.013171573,0.85176325,0.005064185,0.11197014],"study_design_scores_gemma":[0.000063963496,0.00023613573,0.00076527207,0.00010145587,0.00003461894,0.00072282547,0.00020977984,0.093004085,0.028511263,0.8431951,0.033087052,0.00006851387],"about_ca_topic_score_codex":0.00026112358,"about_ca_topic_score_gemma":0.00032081295,"teacher_disagreement_score":0.010240987,"about_ca_system_score_codex":0.0013802744,"about_ca_system_score_gemma":0.0009591692,"threshold_uncertainty_score":0.034259558},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12849796,0.001637431,0.66646355,0.006639044,0.0003426481,0.00038345502,0.0026235061,0.00050205644,0.19291037],"genre_scores_gemma":[0.83806956,0.0021105653,0.11020339,0.001226439,0.00079042563,0.00084328186,0.0028851088,0.00039096267,0.043480173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99660635,0.00092916144,0.0001869394,0.0006674687,0.0011183436,0.0004917716],"domain_scores_gemma":[0.9810145,0.012508845,0.0021898146,0.0020118505,0.0012285387,0.0010464222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025457756,0.0009370231,0.00093163556,0.0022877392,0.0028735115,0.0066838604,0.0016244884,0.0021281252,0.015437678],"category_scores_gemma":[0.017237267,0.00090492726,0.0014950259,0.003590232,0.006300912,0.00954234,0.0029115858,0.0043692444,0.002187983],"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.00003237974,0.000020246285,0.00019785667,0.000040874213,0.0000056431936,0.00005759907,0.00012431685,0.0020213393,0.00036386342,0.9909922,0.001484671,0.004658967],"study_design_scores_gemma":[0.000019660816,0.000023674704,0.00016345255,0.000023917524,0.000013157255,0.00020328267,0.00007458551,0.0070518027,0.00090052886,0.98551536,0.005993909,0.000016726943],"about_ca_topic_score_codex":0.0017509934,"about_ca_topic_score_gemma":0.0012080715,"teacher_disagreement_score":0.015437678,"about_ca_system_score_codex":0.0036779323,"about_ca_system_score_gemma":0.0019561055,"threshold_uncertainty_score":0.051644206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31176186,0.0021647057,0.65814525,0.0006285832,0.0003733948,0.00042804537,0.0004308134,0.009462091,0.016605299],"genre_scores_gemma":[0.92205364,0.00025017155,0.07511506,0.000082159895,0.00001983743,0.000105352636,0.00020291204,0.0002104712,0.0019604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980111,0.0005952696,0.0001481181,0.0001980822,0.00082202797,0.00022544939],"domain_scores_gemma":[0.9964478,0.0015909852,0.00038937826,0.0009449371,0.0005130357,0.00011380255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014166469,0.0009325698,0.0004779912,0.00082987896,0.00034543034,0.0012557984,0.0015313675,0.00081736053,0.005397869],"category_scores_gemma":[0.0058707963,0.00029065978,0.00049108925,0.00059732085,0.0009412437,0.002433421,0.00079047814,0.00097650243,0.00061397115],"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.0028081432,0.0007764294,0.0053541507,0.002617416,0.00035149526,0.0011106412,0.000588467,0.2425767,0.28754577,0.14051569,0.00640491,0.30935025],"study_design_scores_gemma":[0.00022569374,0.0016301624,0.0010139355,0.00018299875,0.00013277457,0.0006498086,0.00008559394,0.5682332,0.3916524,0.025303623,0.010831367,0.000058430483],"about_ca_topic_score_codex":0.0003568422,"about_ca_topic_score_gemma":0.0004132527,"teacher_disagreement_score":0.005397869,"about_ca_system_score_codex":0.0010067554,"about_ca_system_score_gemma":0.0008566493,"threshold_uncertainty_score":0.018057644},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00988158,0.0005988753,0.9786476,0.0022149147,0.00024242718,0.00021147716,0.00019499662,0.000695383,0.0073128026],"genre_scores_gemma":[0.58939314,0.0013310232,0.39560905,0.0012143851,0.00037589125,0.0006239029,0.0007190042,0.00037698657,0.0103566665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99274325,0.0026479787,0.0005282006,0.0009238838,0.002464556,0.00069224247],"domain_scores_gemma":[0.98416877,0.007820825,0.00083377596,0.0059799566,0.00077963993,0.00041700483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071332552,0.00071134156,0.0011555342,0.00082167087,0.0020040332,0.0059357863,0.0025969972,0.0027004187,0.005261002],"category_scores_gemma":[0.020131232,0.0008342659,0.002328376,0.0015638191,0.006424212,0.017860854,0.007978799,0.007976535,0.0015056704],"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.00015292998,0.00006354263,0.0003789946,0.00015811529,0.000036950092,0.00016798779,0.00039902807,0.012056956,0.0022800665,0.9481904,0.00346537,0.032649714],"study_design_scores_gemma":[0.000057562276,0.00004694549,0.00015643393,0.000075997064,0.000043043794,0.00021651799,0.00006151185,0.09986367,0.009490773,0.8749872,0.014953691,0.000046641813],"about_ca_topic_score_codex":0.001421221,"about_ca_topic_score_gemma":0.0009857283,"teacher_disagreement_score":0.0071332552,"about_ca_system_score_codex":0.0031670476,"about_ca_system_score_gemma":0.002986071,"threshold_uncertainty_score":0.037724733},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13031061,0.0006581168,0.8354807,0.00153505,0.00018412388,0.0005012056,0.0005446573,0.0026242733,0.028161155],"genre_scores_gemma":[0.80568725,0.000493091,0.18022896,0.00062166736,0.00014552425,0.00039859102,0.00094855455,0.0003218129,0.011154507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981116,0.00061306386,0.00005712136,0.00027062662,0.00073437847,0.0002132324],"domain_scores_gemma":[0.995152,0.0025400943,0.0003056331,0.001558175,0.00031520924,0.00012890116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016862738,0.000572087,0.00045336134,0.0010004954,0.0007630883,0.0012829724,0.0011900839,0.000983395,0.008074233],"category_scores_gemma":[0.0059816027,0.00048372964,0.00080652966,0.00088391,0.0015475515,0.0054017254,0.0022712843,0.0021593526,0.0015232561],"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.0007208238,0.00021872902,0.0013058553,0.00035393087,0.000069362715,0.00034895612,0.000473363,0.052614495,0.0375431,0.77478516,0.006598714,0.12496755],"study_design_scores_gemma":[0.00013474919,0.0003725974,0.0007172259,0.00005821909,0.000053308802,0.00063571637,0.00015698661,0.21005283,0.068361014,0.69342124,0.02597029,0.000065851316],"about_ca_topic_score_codex":0.00025709934,"about_ca_topic_score_gemma":0.00039121782,"teacher_disagreement_score":0.008074233,"about_ca_system_score_codex":0.0011001319,"about_ca_system_score_gemma":0.00065731845,"threshold_uncertainty_score":0.027010977},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028165467,0.034598347,0.6878684,0.038558453,0.0033091018,0.00033412487,0.00057609857,0.0006082908,0.20598169],"genre_scores_gemma":[0.8265107,0.013379343,0.10714302,0.0046313284,0.0020286024,0.0002589338,0.00038150567,0.00014842668,0.04551817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996256,0.0012704261,0.00028131777,0.00043993938,0.001366705,0.0003856044],"domain_scores_gemma":[0.9964474,0.0014022839,0.0003618758,0.0013137892,0.0003861947,0.0000886037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023720239,0.00047568037,0.0008394855,0.0007018366,0.0010503823,0.0027775683,0.0014908357,0.0024142344,0.004463182],"category_scores_gemma":[0.00878737,0.00040740066,0.0005360924,0.0020449639,0.0029829694,0.0151095735,0.0031646113,0.004430247,0.0024550464],"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.00008839933,0.000015669288,0.00009993712,0.0001698231,0.000010354753,0.00019792609,0.00014432218,0.0014691108,0.0015813148,0.9611328,0.005227791,0.029862428],"study_design_scores_gemma":[0.00006681777,0.00008189854,0.00016087387,0.00010785276,0.000026029722,0.0024433525,0.00017927327,0.019517556,0.006621053,0.88061297,0.09014352,0.000038824655],"about_ca_topic_score_codex":0.0004388395,"about_ca_topic_score_gemma":0.00034554116,"teacher_disagreement_score":0.004463182,"about_ca_system_score_codex":0.0016952213,"about_ca_system_score_gemma":0.0016559141,"threshold_uncertainty_score":0.014930904},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009355613,0.0014156635,0.9293987,0.0041497545,0.0009177577,0.00039703737,0.0003717087,0.0055651655,0.048428547],"genre_scores_gemma":[0.5720713,0.0021789235,0.35205734,0.0021719297,0.0007879599,0.0010512888,0.0014164752,0.0025614197,0.06570338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945787,0.0024840492,0.00021953518,0.0005199801,0.0017683074,0.00042939064],"domain_scores_gemma":[0.9943151,0.0020972742,0.00042265598,0.0020756244,0.0006069173,0.00048246526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054980647,0.0010201314,0.00088902266,0.0011202152,0.002665367,0.0053880494,0.0024162808,0.0029033152,0.019586047],"category_scores_gemma":[0.018300163,0.0007360454,0.0006464759,0.0021422307,0.0039592097,0.012557378,0.0074878065,0.004543394,0.004991218],"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.00045554867,0.000080674654,0.00041453025,0.00019415862,0.000031990727,0.00034555045,0.00042311408,0.012521826,0.0015630445,0.8948217,0.022408264,0.06673968],"study_design_scores_gemma":[0.0000902438,0.00004451872,0.00014233851,0.00011540849,0.000018187418,0.0002892338,0.00011553733,0.10800588,0.0044442303,0.80663615,0.080047876,0.000050295967],"about_ca_topic_score_codex":0.0014134094,"about_ca_topic_score_gemma":0.0015480409,"teacher_disagreement_score":0.019586047,"about_ca_system_score_codex":0.0019997882,"about_ca_system_score_gemma":0.0018890629,"threshold_uncertainty_score":0.065521896},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01908807,0.0016341752,0.9423979,0.0014593003,0.00066229526,0.00013534364,0.00013038331,0.0005918444,0.033900663],"genre_scores_gemma":[0.62852824,0.0022608398,0.3492925,0.0006294849,0.00048323788,0.00047290768,0.00029859808,0.00042325206,0.017611003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99059147,0.0030621837,0.0006911377,0.0011180484,0.0038617079,0.0006754344],"domain_scores_gemma":[0.99290895,0.0017882588,0.0005186845,0.0037192593,0.00085183786,0.0002130529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054861177,0.0011558495,0.00087089086,0.0012425411,0.001195232,0.0047585815,0.0025692692,0.0018916155,0.012432634],"category_scores_gemma":[0.01766009,0.0006201217,0.0010808851,0.0014164298,0.0035391608,0.009764202,0.004723276,0.004196563,0.0050319172],"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.0001702162,0.000026346372,0.00015271358,0.000107881955,0.00001529241,0.000051801588,0.00013368108,0.002942116,0.0021804895,0.9676558,0.0010608919,0.025502907],"study_design_scores_gemma":[0.00013268967,0.00030081786,0.0001371271,0.0002137303,0.000048544218,0.0005723189,0.0001523962,0.04942261,0.012955222,0.8744655,0.06152581,0.000073184405],"about_ca_topic_score_codex":0.00015512385,"about_ca_topic_score_gemma":0.00019390728,"teacher_disagreement_score":0.012432634,"about_ca_system_score_codex":0.001271149,"about_ca_system_score_gemma":0.0010537299,"threshold_uncertainty_score":0.041591287},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07876325,0.0007290985,0.8906873,0.0019927246,0.0003273608,0.00015457648,0.0002570965,0.00097031,0.026118267],"genre_scores_gemma":[0.63948715,0.00067046913,0.34399238,0.0005401966,0.00035958368,0.00023654671,0.00050260517,0.0003617596,0.013849207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988438,0.00036511832,0.000054644854,0.00016521079,0.0004637315,0.00010742734],"domain_scores_gemma":[0.9974637,0.0012430261,0.000111253874,0.00069030665,0.00035259564,0.00013907078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010207342,0.00048565574,0.00089134707,0.00071656005,0.0010668504,0.0018319591,0.0014358158,0.0008829357,0.008329199],"category_scores_gemma":[0.0060027107,0.00029270037,0.0006543613,0.0011640193,0.0011798465,0.0034325682,0.0021904598,0.0018853849,0.001429516],"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.00023013496,0.000108986555,0.0003356067,0.0001352446,0.00004871253,0.000043150652,0.00013294443,0.048867896,0.003253536,0.8337378,0.008980089,0.10412584],"study_design_scores_gemma":[0.00005785423,0.000042115826,0.00010488613,0.000016776805,0.000014274454,0.00004478305,0.000032005766,0.29708433,0.0026217084,0.6959061,0.004061445,0.000013659621],"about_ca_topic_score_codex":0.0005379794,"about_ca_topic_score_gemma":0.00071593793,"teacher_disagreement_score":0.008329199,"about_ca_system_score_codex":0.0011325587,"about_ca_system_score_gemma":0.0009716029,"threshold_uncertainty_score":0.02786398},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071361284,0.0015149881,0.9324227,0.00084418705,0.0007481426,0.0007477207,0.0008257856,0.004669118,0.051091265],"genre_scores_gemma":[0.5169722,0.0016807669,0.36802498,0.00082317815,0.00065166154,0.001472161,0.0032049487,0.00076437375,0.106405824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99307764,0.0028845351,0.00049900246,0.0007292065,0.0020091177,0.00080053153],"domain_scores_gemma":[0.9941806,0.0011200799,0.00035017435,0.0034047028,0.00072742073,0.00021686069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034483988,0.0009304198,0.0014307125,0.0011345682,0.0015902263,0.0029064808,0.0023732686,0.0027138882,0.029259402],"category_scores_gemma":[0.011300566,0.0007875474,0.0006683427,0.0017145992,0.0015411547,0.008819183,0.00689858,0.0024448866,0.022251245],"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.002181451,0.00039658888,0.0008023728,0.0008199496,0.00013969249,0.0006184537,0.00042666687,0.0064649824,0.018910613,0.5153273,0.089304276,0.3646076],"study_design_scores_gemma":[0.00046403636,0.0005466957,0.00063998677,0.00026325075,0.0001402029,0.0021753241,0.00019984896,0.1144501,0.058083873,0.6139405,0.20897417,0.0001220561],"about_ca_topic_score_codex":0.00024520623,"about_ca_topic_score_gemma":0.00035357708,"teacher_disagreement_score":0.029259402,"about_ca_system_score_codex":0.0005767761,"about_ca_system_score_gemma":0.0013556385,"threshold_uncertainty_score":0.09788251},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04768146,0.00024354013,0.93743414,0.0003816128,0.00007319845,0.0006085314,0.00011452474,0.0005281013,0.012934892],"genre_scores_gemma":[0.69713324,0.00020779092,0.29415876,0.00018795545,0.00004169208,0.0007139228,0.00015856427,0.00008286133,0.0073151654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977418,0.0014255568,0.00006182594,0.00018947644,0.00046746642,0.00011387994],"domain_scores_gemma":[0.9939592,0.0041411878,0.0004549541,0.00081675383,0.0004153512,0.00021260243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022519608,0.0010254092,0.00041676694,0.0007167701,0.00041477787,0.0009395427,0.0011579891,0.0008340346,0.0035148084],"category_scores_gemma":[0.010209772,0.0002633804,0.0004885731,0.00034360547,0.0016618425,0.0015176941,0.001850041,0.000941594,0.00053827564],"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.0015495511,0.0010763975,0.008667111,0.00097074703,0.0003409634,0.0009787774,0.00207478,0.17132209,0.087923974,0.34342647,0.0066149123,0.37505424],"study_design_scores_gemma":[0.00022415176,0.0013627496,0.002830963,0.00014073878,0.00006713909,0.00072136184,0.00027490797,0.7544824,0.050847262,0.16401923,0.024907408,0.000121751174],"about_ca_topic_score_codex":0.000588489,"about_ca_topic_score_gemma":0.0009778799,"teacher_disagreement_score":0.0035148084,"about_ca_system_score_codex":0.00057693606,"about_ca_system_score_gemma":0.00046682515,"threshold_uncertainty_score":0.011909664},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3879308,0.0065619554,0.25373393,0.016401079,0.0013082485,0.00055678614,0.0010461906,0.0016976661,0.33076337],"genre_scores_gemma":[0.92489886,0.0010875041,0.051587805,0.00058819604,0.00031351612,0.0001402092,0.00046308397,0.00012417465,0.020796588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955427,0.0010228155,0.00024608866,0.0005107447,0.0022613131,0.00041637453],"domain_scores_gemma":[0.9922072,0.0026458541,0.00067460135,0.0030648129,0.0010639048,0.00034365713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006013486,0.00080154574,0.000749334,0.001500995,0.0018384587,0.0023278885,0.0009688017,0.0013294865,0.0120702],"category_scores_gemma":[0.014796165,0.00030238702,0.0006680536,0.0010859739,0.0024802585,0.005109723,0.0031118384,0.0029014482,0.004250369],"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.0010285621,0.00015177284,0.0063314177,0.0003060628,0.000070855334,0.0002984137,0.0005360286,0.007691037,0.0083619235,0.8095988,0.014438115,0.15118702],"study_design_scores_gemma":[0.00015969145,0.0007692806,0.0036559633,0.00025277148,0.00007513072,0.002103334,0.00042378015,0.049346562,0.033155996,0.736183,0.17376257,0.00011186782],"about_ca_topic_score_codex":0.00086040405,"about_ca_topic_score_gemma":0.0006349022,"teacher_disagreement_score":0.0120702,"about_ca_system_score_codex":0.0018458264,"about_ca_system_score_gemma":0.002472134,"threshold_uncertainty_score":0.04037887},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0553057,0.0010796519,0.85971004,0.0032779574,0.0003332726,0.00016240071,0.00022932024,0.00016862925,0.07973304],"genre_scores_gemma":[0.88745236,0.0013477635,0.09169093,0.0009851641,0.00042284306,0.00029554218,0.0002518884,0.00012628788,0.017427178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958966,0.0017638701,0.00017528268,0.0005157552,0.0011182337,0.00053041003],"domain_scores_gemma":[0.9949883,0.002512134,0.00058613595,0.0010537585,0.0005677287,0.0002919244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043067634,0.0010008791,0.0010101714,0.0015897539,0.0015849544,0.002595934,0.0017393917,0.0024008523,0.003951667],"category_scores_gemma":[0.007813748,0.00052068726,0.0024421401,0.0008385453,0.008281657,0.009771996,0.003907046,0.004879234,0.0008130497],"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.000007947962,0.0000074837712,0.000056641977,0.000009792696,0.0000043613254,0.000031018448,0.00004828774,0.0042257654,0.00015610756,0.9947864,0.00022841874,0.00043775124],"study_design_scores_gemma":[0.000016247886,0.00002490156,0.00005979735,0.00001599957,0.000009488947,0.00006056694,0.000034625085,0.07164229,0.00033004658,0.92492926,0.0028624863,0.0000143647],"about_ca_topic_score_codex":0.0017865705,"about_ca_topic_score_gemma":0.0011364482,"teacher_disagreement_score":0.0043067634,"about_ca_system_score_codex":0.003102626,"about_ca_system_score_gemma":0.0014520849,"threshold_uncertainty_score":0.022776604},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08532867,0.0017485202,0.82656944,0.001750478,0.0009027432,0.00020460595,0.00018109873,0.00044289857,0.08287149],"genre_scores_gemma":[0.8168426,0.0009203125,0.16753496,0.00081670884,0.00044256527,0.00021223396,0.0001669562,0.0001229739,0.012940599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971474,0.0008555369,0.00014920678,0.0002355225,0.001303798,0.00030863105],"domain_scores_gemma":[0.9981268,0.00064321834,0.00026584437,0.00048884284,0.00037622015,0.00009912596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026927935,0.0006224224,0.0006629719,0.0011862258,0.0009684851,0.0017347364,0.00095636176,0.0010465587,0.002506089],"category_scores_gemma":[0.0057881987,0.00035062188,0.00075354025,0.00094311364,0.0032356924,0.0031029005,0.0027529723,0.003019937,0.00090085046],"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.00006483151,0.00002550835,0.000120107725,0.000048892005,0.000010776345,0.00010320444,0.00012234705,0.0023497895,0.0020189371,0.9748138,0.0021916039,0.018130215],"study_design_scores_gemma":[0.00005077628,0.0001902224,0.0002317939,0.00007384947,0.000034089,0.00046369946,0.00008364516,0.04630309,0.0068477388,0.9259321,0.019741835,0.00004723419],"about_ca_topic_score_codex":0.0002473609,"about_ca_topic_score_gemma":0.00028463706,"teacher_disagreement_score":0.0026927935,"about_ca_system_score_codex":0.00066466327,"about_ca_system_score_gemma":0.00090095686,"threshold_uncertainty_score":0.01424098},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6877514,0.0008305399,0.2901565,0.0008701514,0.00015535769,0.00027784854,0.00024824042,0.0017175688,0.01799231],"genre_scores_gemma":[0.97435886,0.00008859841,0.022600643,0.0001082648,0.000022586446,0.0000656606,0.0001203348,0.00004539536,0.0025897957],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983864,0.00037067776,0.000060598337,0.00017724087,0.0006285508,0.00037662569],"domain_scores_gemma":[0.9973417,0.0009266557,0.00030582192,0.0011361428,0.0001901414,0.00009962217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086379226,0.00055234175,0.00068913127,0.0006203132,0.0007111856,0.000826866,0.0008822083,0.0007497247,0.0030771187],"category_scores_gemma":[0.0032813372,0.0003781821,0.00070736115,0.00038405386,0.0014598714,0.0020603186,0.002529299,0.0013121188,0.0010173551],"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.012566965,0.000513588,0.009987427,0.0007846121,0.00061336416,0.0023832503,0.0019553285,0.10340819,0.32905126,0.29022866,0.010676985,0.23783031],"study_design_scores_gemma":[0.00036103284,0.0024506277,0.00579951,0.00012191129,0.0001742323,0.002631931,0.00037954457,0.41940224,0.42014626,0.13052979,0.01785337,0.00014968956],"about_ca_topic_score_codex":0.00026838787,"about_ca_topic_score_gemma":0.0004097348,"teacher_disagreement_score":0.0030771187,"about_ca_system_score_codex":0.0007218775,"about_ca_system_score_gemma":0.00071795797,"threshold_uncertainty_score":0.01029402},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010801263,0.011638162,0.8675684,0.0021791202,0.0027061575,0.00012337723,0.00046380292,0.0007029692,0.10381665],"genre_scores_gemma":[0.22381279,0.024789372,0.67966914,0.0036732557,0.005016347,0.00034378972,0.0015696527,0.0011892855,0.05993631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750924,0.0003972868,0.00018426203,0.0005011729,0.0011219601,0.00028597747],"domain_scores_gemma":[0.997846,0.0010708515,0.00016244265,0.00043513675,0.00036145904,0.00012405039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016334599,0.001457628,0.00079964264,0.00272445,0.0011635056,0.0023292566,0.0012661435,0.0010093868,0.015256642],"category_scores_gemma":[0.0055720033,0.000679195,0.0015896033,0.0031787283,0.0025065027,0.008671573,0.0026659616,0.004764233,0.006944901],"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.00017524324,0.00009918179,0.00033027946,0.0006903545,0.000047051115,0.0002913236,0.00041149792,0.006023424,0.0087473,0.7996646,0.014351374,0.16916846],"study_design_scores_gemma":[0.000046834153,0.00016889739,0.0005369521,0.00018097558,0.00006432656,0.0016979785,0.00011707629,0.02369966,0.014974015,0.7652153,0.19319102,0.000106952124],"about_ca_topic_score_codex":0.00085277786,"about_ca_topic_score_gemma":0.0008756395,"teacher_disagreement_score":0.015256642,"about_ca_system_score_codex":0.0016616216,"about_ca_system_score_gemma":0.0011175419,"threshold_uncertainty_score":0.051038563},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035870742,0.0013828705,0.92654926,0.00241757,0.0004468216,0.0002788033,0.0003109065,0.00031994353,0.03242317],"genre_scores_gemma":[0.8568667,0.0010729731,0.13094327,0.0008479033,0.00092754525,0.00075209595,0.00030721384,0.0001099994,0.008172233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97771263,0.010380178,0.0014690113,0.002340375,0.006123704,0.0019741983],"domain_scores_gemma":[0.9726318,0.014669258,0.0030939337,0.0073899664,0.0015579576,0.0006570403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008446134,0.0009953271,0.0015646428,0.001719983,0.003214887,0.0067321695,0.0023784563,0.0033441337,0.004400886],"category_scores_gemma":[0.023763275,0.00066431717,0.0018460266,0.003376375,0.00965545,0.022231413,0.0076957494,0.006867481,0.0011381768],"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.00006564108,0.000027786735,0.00017710555,0.00009977305,0.0000189663,0.000078348174,0.00021589593,0.0027627589,0.0010112519,0.9895265,0.0007104177,0.0053055263],"study_design_scores_gemma":[0.00002465264,0.00008699795,0.00014784264,0.000039401642,0.000022235237,0.00027051743,0.00007522693,0.01556301,0.0023787424,0.9746201,0.006743772,0.000027444288],"about_ca_topic_score_codex":0.00023236692,"about_ca_topic_score_gemma":0.00014669892,"teacher_disagreement_score":0.008446134,"about_ca_system_score_codex":0.002397772,"about_ca_system_score_gemma":0.0016721038,"threshold_uncertainty_score":0.0446679},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023661455,0.0014770423,0.9425738,0.0020767276,0.0004120148,0.0004278809,0.0006083377,0.0019085169,0.026854165],"genre_scores_gemma":[0.44891438,0.0011592864,0.5261126,0.0009032644,0.0004835997,0.00071080617,0.0008803281,0.00041675585,0.020419028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99094886,0.002760934,0.00075566734,0.001446014,0.0034162079,0.0006722532],"domain_scores_gemma":[0.9874752,0.004983168,0.0014175838,0.00456166,0.0009175161,0.0006448911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048040934,0.0009978671,0.0012265174,0.0016216224,0.0028620292,0.0076410086,0.0025251098,0.0021319177,0.010790307],"category_scores_gemma":[0.017494002,0.0008768155,0.0016756521,0.0023438726,0.0062253177,0.022815444,0.0111361975,0.005804285,0.004123861],"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.0001997076,0.00005191195,0.00017688744,0.0001705094,0.000026975777,0.00007778317,0.0003030963,0.004285196,0.0033784166,0.96406674,0.002492181,0.024770508],"study_design_scores_gemma":[0.000080728685,0.00015661864,0.0000721911,0.00010106496,0.000031716638,0.0003318685,0.00010004272,0.028294645,0.015253021,0.91765696,0.037848484,0.00007255989],"about_ca_topic_score_codex":0.0004881353,"about_ca_topic_score_gemma":0.00051556533,"teacher_disagreement_score":0.010790307,"about_ca_system_score_codex":0.0026052215,"about_ca_system_score_gemma":0.0028034572,"threshold_uncertainty_score":0.03609723},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003687838,0.0005314864,0.9760977,0.0022427763,0.0005398216,0.00037004275,0.00019484332,0.00066450983,0.0156711],"genre_scores_gemma":[0.29647043,0.001015057,0.6839588,0.0021701644,0.0008989923,0.0010369555,0.00038748494,0.00036971213,0.013692334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98772556,0.005799112,0.0007562212,0.0016889975,0.003221449,0.000808748],"domain_scores_gemma":[0.98194516,0.009920202,0.0012684421,0.004125382,0.0022293583,0.00051148527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009053582,0.0013130091,0.0008095587,0.0014855809,0.00297255,0.0030719668,0.0025013124,0.0027066104,0.0074656587],"category_scores_gemma":[0.021258958,0.0011558342,0.0026093705,0.001514366,0.0065709474,0.012632137,0.009399265,0.0101005705,0.0038965882],"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.00010318337,0.00010138854,0.00033623542,0.00036019084,0.00004882155,0.00029872448,0.00047844232,0.002740402,0.00421671,0.9547582,0.007881801,0.028675772],"study_design_scores_gemma":[0.00012639002,0.00017484557,0.0003497897,0.00023968103,0.00013707658,0.0011157775,0.00013449979,0.05070501,0.0136494525,0.8465543,0.08670839,0.00010489559],"about_ca_topic_score_codex":0.0006232389,"about_ca_topic_score_gemma":0.00050616334,"teacher_disagreement_score":0.009053582,"about_ca_system_score_codex":0.002265113,"about_ca_system_score_gemma":0.0030251415,"threshold_uncertainty_score":0.04788053},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08336014,0.0011680644,0.87383443,0.00039639894,0.0001554771,0.00019873482,0.0002580219,0.00047750722,0.040151216],"genre_scores_gemma":[0.6471014,0.0010699653,0.3294975,0.00039035865,0.0001323437,0.0006139359,0.00030338892,0.0002669942,0.020624086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982065,0.00071331207,0.00010685491,0.00031643556,0.00039927813,0.00025767842],"domain_scores_gemma":[0.9981592,0.0007771517,0.0003049218,0.00050231384,0.00016557706,0.00009075748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013095058,0.00088883383,0.00054915063,0.00092938764,0.00070985575,0.0016896421,0.0007610702,0.0009748149,0.0056480994],"category_scores_gemma":[0.0044438816,0.0005267813,0.0007254011,0.0012387689,0.0017918411,0.0035507525,0.0022318051,0.0013624609,0.0014757111],"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.0002089822,0.00003504257,0.0004052122,0.00012347776,0.000026123758,0.00019741592,0.00019581761,0.011962263,0.012720326,0.91540825,0.0016300987,0.057087056],"study_design_scores_gemma":[0.000113349815,0.00046543364,0.0009310414,0.00011746187,0.00008584601,0.0016980573,0.00035129592,0.12965763,0.06486273,0.7244565,0.07713053,0.00013015204],"about_ca_topic_score_codex":0.00028065642,"about_ca_topic_score_gemma":0.0002859053,"teacher_disagreement_score":0.0056480994,"about_ca_system_score_codex":0.00080840825,"about_ca_system_score_gemma":0.00041060895,"threshold_uncertainty_score":0.018894792},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078172274,0.0010659383,0.9009209,0.0026420834,0.00014254493,0.0002612899,0.00034764045,0.0012424012,0.015204931],"genre_scores_gemma":[0.94283545,0.0005301635,0.050964624,0.0006036284,0.00017434338,0.00026672566,0.00018236857,0.00012632625,0.004316328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98996747,0.003729501,0.0004962986,0.0018460344,0.0021813547,0.0017793761],"domain_scores_gemma":[0.96589833,0.020496352,0.0027805427,0.008765313,0.0010194293,0.0010399672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006181435,0.0016308205,0.0014845175,0.0014916891,0.0016605201,0.003303578,0.0024937321,0.0024470831,0.003781173],"category_scores_gemma":[0.03175193,0.0010035794,0.0018463922,0.0016038113,0.00966576,0.014475159,0.008498625,0.0060310094,0.00087200355],"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.0006475651,0.0001808087,0.0018749777,0.00020685504,0.0000941902,0.00042719676,0.0007055923,0.10169249,0.0058443216,0.855722,0.0028713131,0.02973267],"study_design_scores_gemma":[0.000092091264,0.0002115873,0.00050358026,0.00008984796,0.000051327876,0.000562564,0.000109141954,0.31291535,0.0055443756,0.6756311,0.0042022998,0.00008661905],"about_ca_topic_score_codex":0.00075672014,"about_ca_topic_score_gemma":0.00040240175,"teacher_disagreement_score":0.006181435,"about_ca_system_score_codex":0.003287733,"about_ca_system_score_gemma":0.0015525253,"threshold_uncertainty_score":0.032690942},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050492287,0.0078085023,0.54622984,0.022356221,0.0043837316,0.00041646117,0.0015049079,0.0028535211,0.3639546],"genre_scores_gemma":[0.67669594,0.007116681,0.19213165,0.00575729,0.0030241034,0.0006133868,0.0021248977,0.00065932755,0.111876704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980742,0.00050915004,0.00015020062,0.00030017516,0.00074412196,0.0002221704],"domain_scores_gemma":[0.99510515,0.0017545761,0.00034555336,0.0019800295,0.0006077953,0.00020682468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002691859,0.0011704214,0.0006057621,0.0014714082,0.001978385,0.0034167822,0.0011207039,0.001674475,0.029952766],"category_scores_gemma":[0.011487619,0.0003722095,0.0006254075,0.0011278201,0.002380026,0.010293818,0.0042072413,0.004640154,0.011310667],"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.00008802938,0.00004166268,0.00049191044,0.00020324868,0.000012899777,0.0000921572,0.00009614504,0.0016227441,0.0019988287,0.9259364,0.020711053,0.048704974],"study_design_scores_gemma":[0.000017510953,0.00006285798,0.00021789252,0.00013484531,0.00001609627,0.00036260518,0.000066807785,0.005673111,0.0037197878,0.8930038,0.09670207,0.000022672226],"about_ca_topic_score_codex":0.00027488178,"about_ca_topic_score_gemma":0.0002987236,"teacher_disagreement_score":0.029952766,"about_ca_system_score_codex":0.0010554101,"about_ca_system_score_gemma":0.0011549208,"threshold_uncertainty_score":0.100201964},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04163303,0.74571323,0.08764863,0.015848968,0.0038666725,0.0002753759,0.0014727577,0.0030782267,0.10046306],"genre_scores_gemma":[0.52625644,0.40587774,0.040817004,0.0028538837,0.0045985417,0.00024358157,0.003343719,0.0011365858,0.014872597],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99325055,0.001475838,0.00037834074,0.0008327006,0.0030515692,0.001011033],"domain_scores_gemma":[0.98602897,0.00787127,0.00079509016,0.002212137,0.0025817403,0.0005107843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006823086,0.0015297097,0.0018832952,0.0035817928,0.0014932639,0.0029266234,0.0024728654,0.0017373436,0.011690305],"category_scores_gemma":[0.020834707,0.000652346,0.0010085102,0.00580347,0.0014365155,0.008954315,0.0027014152,0.0030402392,0.004460062],"study_design_candidate":"not_applicable","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.00070891605,0.00027289896,0.0035658183,0.0038188503,0.00015524715,0.0001275676,0.00015777377,0.018872077,0.002811647,0.05365336,0.09332489,0.8225309],"study_design_scores_gemma":[0.00017927654,0.0020284872,0.009341801,0.0031346981,0.00059549435,0.00417072,0.0013569031,0.14849533,0.017063184,0.0992194,0.71412563,0.00028912377],"about_ca_topic_score_codex":0.0013285885,"about_ca_topic_score_gemma":0.001453831,"teacher_disagreement_score":0.011690305,"about_ca_system_score_codex":0.0027450623,"about_ca_system_score_gemma":0.0018999795,"threshold_uncertainty_score":0.039108038},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10097781,0.0012040731,0.8253466,0.004222752,0.00031528823,0.000216492,0.0005182023,0.0009728951,0.06622595],"genre_scores_gemma":[0.8820689,0.0011139493,0.098486565,0.0007466637,0.00036257657,0.00031904518,0.00035051556,0.00027722787,0.016274719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986337,0.00031784544,0.000079125755,0.00021555307,0.0005637484,0.0001899405],"domain_scores_gemma":[0.99606365,0.0020091706,0.00031643364,0.0012762652,0.0002051098,0.00012942246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013769167,0.0006972183,0.00081493874,0.0006453819,0.0011530789,0.0036661096,0.0016164206,0.001865173,0.008723582],"category_scores_gemma":[0.0068153446,0.00069884415,0.001158035,0.00058099837,0.0056127505,0.009901008,0.0049814377,0.0053139944,0.0012813495],"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.00004144758,0.000016464255,0.000049471186,0.00005301373,0.0000043494865,0.00004163362,0.00007689904,0.0033783736,0.0013084974,0.99175596,0.000542632,0.0027312692],"study_design_scores_gemma":[0.000026715146,0.00003258476,0.000048104554,0.000033762284,0.000008272494,0.00006819648,0.000023312034,0.022424491,0.004660918,0.9691882,0.0034718802,0.000013531659],"about_ca_topic_score_codex":0.000362228,"about_ca_topic_score_gemma":0.0003920786,"teacher_disagreement_score":0.008723582,"about_ca_system_score_codex":0.0015041507,"about_ca_system_score_gemma":0.0012100305,"threshold_uncertainty_score":0.029183328},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03897945,0.0005622341,0.9330584,0.002015651,0.00031033557,0.00046583972,0.000557964,0.00091159914,0.023138667],"genre_scores_gemma":[0.82749635,0.00042632205,0.14795879,0.00049456017,0.00023149767,0.00047827198,0.00044538462,0.00006966628,0.022399042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951239,0.0017371908,0.0003077481,0.0006076871,0.0015254737,0.0006980492],"domain_scores_gemma":[0.9933124,0.0015972751,0.00095529365,0.0029689192,0.0006861166,0.00047992944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031592606,0.0006685656,0.0010144346,0.00092422706,0.0018634835,0.002353113,0.0019555916,0.0018275647,0.005580534],"category_scores_gemma":[0.0069006025,0.00043823582,0.00096268946,0.0013544391,0.002951535,0.0048049777,0.0063717044,0.0023741766,0.0024950136],"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.0002747996,0.00009373859,0.00046613123,0.00016235765,0.00006843284,0.00022798093,0.0005745203,0.011214427,0.0071759764,0.9289071,0.004584376,0.046250008],"study_design_scores_gemma":[0.0002394347,0.00033588964,0.000544523,0.000111302674,0.00011564379,0.001075101,0.00016299741,0.15271692,0.013064365,0.7589171,0.0725646,0.00015201],"about_ca_topic_score_codex":0.0004850781,"about_ca_topic_score_gemma":0.00045469677,"teacher_disagreement_score":0.005580534,"about_ca_system_score_codex":0.0019105369,"about_ca_system_score_gemma":0.0025975695,"threshold_uncertainty_score":0.01866877},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01876592,0.004182436,0.7876111,0.015193223,0.002316902,0.0003401709,0.00026655997,0.0025664214,0.16875719],"genre_scores_gemma":[0.59950864,0.0035155106,0.28429317,0.0050490834,0.0015611732,0.00062786235,0.0004434333,0.00046004177,0.10454108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757296,0.0010463216,0.00013418791,0.0003967637,0.00066350814,0.00018639014],"domain_scores_gemma":[0.9954791,0.001515179,0.0004726978,0.0016664386,0.0004921966,0.000374307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023644487,0.0007700242,0.00041333263,0.00092310715,0.0021744808,0.0044092885,0.0013238171,0.0027579672,0.016144773],"category_scores_gemma":[0.012652607,0.0004099868,0.0008600315,0.0006217157,0.00860719,0.011513341,0.005252681,0.0032658207,0.0071848645],"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.00018842671,0.000030613428,0.00047622767,0.00017040719,0.000021683116,0.00020428572,0.0024708428,0.0008556955,0.0030306533,0.8894964,0.013280088,0.08977459],"study_design_scores_gemma":[0.00004295624,0.00014732906,0.00047869145,0.00014034232,0.000039752016,0.0010535727,0.0008385939,0.008245569,0.007743898,0.781643,0.19956805,0.000058280082],"about_ca_topic_score_codex":0.00042322115,"about_ca_topic_score_gemma":0.00041460298,"teacher_disagreement_score":0.016144773,"about_ca_system_score_codex":0.00088014785,"about_ca_system_score_gemma":0.00081411755,"threshold_uncertainty_score":0.054009676},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029312382,0.00051011815,0.9546506,0.0008038234,0.00023160414,0.00052871025,0.00013791981,0.00047128796,0.013353535],"genre_scores_gemma":[0.45631534,0.00048524598,0.52523005,0.00047461205,0.00016263891,0.0009909691,0.00043935818,0.0001347496,0.015767056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99669003,0.0012528294,0.00017429673,0.00041581393,0.0012038903,0.0002630605],"domain_scores_gemma":[0.99793434,0.0006764874,0.00024095221,0.00069406576,0.00033869286,0.000115510724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037316955,0.00045965763,0.0005576619,0.0006879344,0.0008786957,0.0014266492,0.0012253141,0.0014431711,0.0029828672],"category_scores_gemma":[0.0059869667,0.00056385266,0.0009985775,0.00065733975,0.002180689,0.0039227153,0.00767906,0.0024371417,0.0012890379],"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.0003743892,0.000096938034,0.0008893181,0.00040710435,0.00012992257,0.0004537304,0.0015016642,0.0059569213,0.044493806,0.84500736,0.005161922,0.09552697],"study_design_scores_gemma":[0.00043997442,0.0005310593,0.0012872433,0.00016380436,0.00015432216,0.001407047,0.00073969597,0.1360203,0.09066136,0.62584203,0.14256565,0.00018738919],"about_ca_topic_score_codex":0.0006083347,"about_ca_topic_score_gemma":0.00043699457,"teacher_disagreement_score":0.0037316955,"about_ca_system_score_codex":0.00092611875,"about_ca_system_score_gemma":0.0016054155,"threshold_uncertainty_score":0.019735336},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03701162,0.00011615674,0.95448774,0.00027674352,0.00009516898,0.00021028897,0.0000591495,0.0006501561,0.007092997],"genre_scores_gemma":[0.84990215,0.000070292765,0.13951771,0.00011994664,0.00005800489,0.00014231836,0.00008314493,0.00006043433,0.010045978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99511766,0.0014409578,0.00022182705,0.00057881285,0.0021056742,0.0005351638],"domain_scores_gemma":[0.9936899,0.0014532112,0.00072995253,0.002958951,0.00097298285,0.00019503503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031467644,0.0005334571,0.00071656966,0.00065323565,0.0008793816,0.0024655985,0.002188747,0.0017594377,0.004635292],"category_scores_gemma":[0.00843628,0.00039842137,0.0006114035,0.00077774614,0.0018848268,0.0043235794,0.0035934506,0.0014114981,0.0015498135],"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.0027145133,0.00037699382,0.0034958106,0.00038499213,0.00027155748,0.00065896026,0.00078644976,0.10442944,0.08148181,0.45496416,0.0057362868,0.34469914],"study_design_scores_gemma":[0.00021930633,0.00053649844,0.0005656982,0.00003969301,0.00008001953,0.00041913803,0.0001542605,0.802753,0.06940312,0.10999713,0.01575079,0.00008134324],"about_ca_topic_score_codex":0.0007284558,"about_ca_topic_score_gemma":0.001047654,"teacher_disagreement_score":0.004635292,"about_ca_system_score_codex":0.0011826116,"about_ca_system_score_gemma":0.0014312494,"threshold_uncertainty_score":0.016641915},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21788158,0.002410102,0.70373183,0.0029910526,0.00021826314,0.00024768757,0.0011758816,0.00035867118,0.07098487],"genre_scores_gemma":[0.976508,0.0007523854,0.018027265,0.00017204469,0.00010711981,0.00036223547,0.00021549605,0.00006907276,0.0037864605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994885,0.0017628197,0.00016687853,0.000505644,0.0015021489,0.001177458],"domain_scores_gemma":[0.95979136,0.032233514,0.0021508473,0.0030528759,0.0017227804,0.0010486742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004398784,0.0011282713,0.0009733031,0.0021355331,0.0016280937,0.00423079,0.002172608,0.0017430444,0.0064520505],"category_scores_gemma":[0.02415022,0.000779917,0.0010304089,0.0019681342,0.0055288374,0.0073172273,0.0046222047,0.0034127773,0.0007152147],"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.00014825005,0.000042858504,0.00022430779,0.000095346535,0.000023634922,0.00012011885,0.00020622642,0.06523127,0.002020892,0.9257765,0.0015084423,0.0046022907],"study_design_scores_gemma":[0.0000479474,0.000052710464,0.00022834694,0.00007613071,0.000027330552,0.00023083268,0.00009414794,0.32415423,0.0031648385,0.66928047,0.0025912102,0.000051728824],"about_ca_topic_score_codex":0.0014020129,"about_ca_topic_score_gemma":0.00079111935,"teacher_disagreement_score":0.0064520505,"about_ca_system_score_codex":0.0035742158,"about_ca_system_score_gemma":0.0018112133,"threshold_uncertainty_score":0.025932908},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44825572,0.0009651659,0.5283237,0.00063311885,0.00009716802,0.00016245476,0.00007550239,0.0008936266,0.020593544],"genre_scores_gemma":[0.86251384,0.00038918437,0.13101842,0.00008643515,0.000045048695,0.00007603821,0.00016375455,0.00011926788,0.005587999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988918,0.0003040055,0.000041147967,0.000115126524,0.0004836978,0.00016417047],"domain_scores_gemma":[0.99758554,0.0012631972,0.00018494215,0.00055951806,0.00030516012,0.00010169118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017069132,0.00058998005,0.00044834337,0.001002886,0.0005627222,0.0013068079,0.00073448534,0.0006375679,0.0033208476],"category_scores_gemma":[0.006450446,0.00026464098,0.0006536483,0.0011166864,0.0010635062,0.0031105087,0.0015250643,0.0010573796,0.0009723934],"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.0017950466,0.00027133035,0.013517985,0.00037591433,0.00011114603,0.0005853268,0.00086109544,0.10455732,0.0680136,0.46826622,0.005846019,0.33579898],"study_design_scores_gemma":[0.0001770194,0.00043577407,0.003120106,0.00006702509,0.00005564848,0.000610721,0.00021511652,0.69768363,0.051141262,0.23414944,0.012278977,0.00006519693],"about_ca_topic_score_codex":0.00081191695,"about_ca_topic_score_gemma":0.000796075,"teacher_disagreement_score":0.0033208476,"about_ca_system_score_codex":0.0011272641,"about_ca_system_score_gemma":0.0009432188,"threshold_uncertainty_score":0.011109352},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053303976,0.0002893021,0.90260816,0.002353314,0.00031692756,0.00035820823,0.00037611034,0.0007865674,0.039607584],"genre_scores_gemma":[0.7703746,0.00026566224,0.20429535,0.00061911833,0.0002476955,0.0004658588,0.00044546093,0.00014406085,0.02314224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9912531,0.0027791746,0.0005979896,0.0010339766,0.0034492437,0.000886396],"domain_scores_gemma":[0.98920536,0.0041437834,0.00088207435,0.004126441,0.0012266096,0.00041573163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004571032,0.0007334268,0.0012453337,0.0008089835,0.0018371721,0.0030794323,0.0024272732,0.0018774254,0.006172644],"category_scores_gemma":[0.011753908,0.00053829286,0.001100112,0.001106028,0.003494718,0.0048640645,0.0041404534,0.002797843,0.0023173003],"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.000661368,0.00012644357,0.0005292054,0.00017751165,0.0000960142,0.00019436027,0.00042998153,0.02987407,0.005333321,0.91769826,0.004774197,0.040105257],"study_design_scores_gemma":[0.00035016387,0.00015315408,0.00018725108,0.00005288872,0.00007525797,0.00015887049,0.00006814642,0.17906433,0.012906293,0.79248863,0.014441423,0.00005353201],"about_ca_topic_score_codex":0.00054615387,"about_ca_topic_score_gemma":0.00052908773,"teacher_disagreement_score":0.006172644,"about_ca_system_score_codex":0.0014236701,"about_ca_system_score_gemma":0.002409056,"threshold_uncertainty_score":0.024174213},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007925552,0.0005439207,0.97734046,0.0010795168,0.0002036045,0.00016918649,0.0001939396,0.00044485694,0.01209885],"genre_scores_gemma":[0.64300126,0.0013211853,0.3368638,0.00076315616,0.0003443607,0.00041810708,0.00047816744,0.00009920367,0.016710732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99507254,0.0016072623,0.0003457522,0.0004084355,0.0021176548,0.00044828397],"domain_scores_gemma":[0.99516946,0.0011837041,0.0004809624,0.0024923165,0.00045660016,0.00021696337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003145861,0.00048232762,0.0007506283,0.00057723175,0.001166813,0.002590467,0.0017150881,0.0013893282,0.0024442016],"category_scores_gemma":[0.0063090203,0.00038281397,0.00100836,0.0014623809,0.001958613,0.006867338,0.0046992735,0.003932287,0.0013896981],"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.00018247268,0.00008250927,0.00045172326,0.00016096662,0.000033721168,0.00026883665,0.00025227715,0.0070996718,0.006763815,0.93965095,0.00471258,0.040340398],"study_design_scores_gemma":[0.00008759733,0.0001475645,0.00047246992,0.0000868419,0.00007609143,0.0016057192,0.00011698165,0.15061092,0.029264875,0.71873057,0.098729014,0.000071364135],"about_ca_topic_score_codex":0.00027239474,"about_ca_topic_score_gemma":0.0002796449,"teacher_disagreement_score":0.003145861,"about_ca_system_score_codex":0.0009149458,"about_ca_system_score_gemma":0.0017838972,"threshold_uncertainty_score":0.016637087},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029504199,0.0005262304,0.9392933,0.0016681347,0.00018302565,0.0002562064,0.00020363419,0.0005656382,0.027799541],"genre_scores_gemma":[0.85040635,0.00056034763,0.13435128,0.00055044267,0.00020083832,0.0004655151,0.0003372748,0.00011803241,0.013009899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98973864,0.004804994,0.0006637993,0.0014667455,0.0022476783,0.0010782221],"domain_scores_gemma":[0.98845565,0.005810578,0.0010875504,0.0033746501,0.0007717634,0.000499686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061192885,0.0007320393,0.00091869547,0.00090972794,0.0018237515,0.0034625235,0.0016477564,0.0028107828,0.0041102027],"category_scores_gemma":[0.017308107,0.0006520653,0.0012807498,0.0012288708,0.0045910887,0.011298089,0.005515817,0.0049024504,0.0012889705],"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.000080893005,0.000024573335,0.00011424008,0.00005671584,0.00001166425,0.00008906619,0.00022040731,0.0030891483,0.0011134373,0.9882415,0.0005329833,0.0064252513],"study_design_scores_gemma":[0.00008610724,0.00008677448,0.00014450564,0.000078097815,0.000037132224,0.0004730838,0.0000957172,0.058122046,0.00441492,0.91793144,0.018492365,0.00003783669],"about_ca_topic_score_codex":0.0010562319,"about_ca_topic_score_gemma":0.0006205462,"teacher_disagreement_score":0.0061192885,"about_ca_system_score_codex":0.0016986771,"about_ca_system_score_gemma":0.0021114482,"threshold_uncertainty_score":0.032362342},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22512066,0.003723507,0.6988455,0.00068551116,0.0005488764,0.00049548893,0.00097069354,0.019605543,0.050004233],"genre_scores_gemma":[0.84561765,0.0006271556,0.12556782,0.00042020937,0.000050721977,0.00013503498,0.000999625,0.0007353017,0.02584657],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996693,0.000053353477,0.00002493012,0.000039470975,0.00017042058,0.000042495984],"domain_scores_gemma":[0.9996426,0.00007333794,0.00007710234,0.00011115673,0.00006855337,0.00002723631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035202943,0.0004796821,0.00021651063,0.00044249892,0.00017560253,0.00048008142,0.0007941267,0.00036707267,0.0073857987],"category_scores_gemma":[0.00095024233,0.00024826583,0.00022640133,0.000209387,0.00041327043,0.0007584644,0.00040882768,0.00055409316,0.0019397859],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0019096616,0.0002099141,0.0033600815,0.001236494,0.00018138558,0.0010263768,0.00030806946,0.025210552,0.52522844,0.053028584,0.035270523,0.35303],"study_design_scores_gemma":[0.00040741795,0.0019617628,0.0034565886,0.00015783537,0.0001153047,0.003131091,0.000082111,0.11509398,0.69256866,0.011003627,0.17191134,0.00011015102],"about_ca_topic_score_codex":0.00016717114,"about_ca_topic_score_gemma":0.00033079923,"teacher_disagreement_score":0.0073857987,"about_ca_system_score_codex":0.0003659907,"about_ca_system_score_gemma":0.00039209818,"threshold_uncertainty_score":0.024707913},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3226894,0.0062946077,0.58688706,0.014883741,0.0005758636,0.0011605007,0.0022637343,0.0011959102,0.06404923],"genre_scores_gemma":[0.898034,0.0029365234,0.088161804,0.0010911471,0.00079726474,0.00070848037,0.0013041672,0.00038333156,0.0065834248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99058026,0.0027678804,0.00035295993,0.001264607,0.0030421868,0.0019922],"domain_scores_gemma":[0.9342614,0.052153688,0.003998761,0.0063955807,0.0020310706,0.0011595536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050690495,0.0017974875,0.0022150318,0.0028536292,0.0030975123,0.004562052,0.0032433665,0.0035971848,0.0066402797],"category_scores_gemma":[0.03395493,0.0009461116,0.0028421693,0.0026164725,0.004628402,0.016801724,0.004837045,0.007493674,0.0011034034],"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.0020043831,0.000623396,0.008884486,0.000993193,0.00048619078,0.000695497,0.00085476396,0.3612036,0.012085303,0.51990396,0.020356687,0.07190853],"study_design_scores_gemma":[0.00009721404,0.00018344927,0.0017968648,0.000061900995,0.00011694065,0.00044093945,0.00016302863,0.6814854,0.0030883288,0.30931985,0.003167749,0.00007829102],"about_ca_topic_score_codex":0.0027438577,"about_ca_topic_score_gemma":0.0021062202,"teacher_disagreement_score":0.008198247,"about_ca_system_score_codex":0.008198247,"about_ca_system_score_gemma":0.0038599279,"threshold_uncertainty_score":0.059482694},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06120198,0.002056691,0.83295566,0.005539322,0.00059222954,0.000164076,0.00036334392,0.001690467,0.095436186],"genre_scores_gemma":[0.86226374,0.0024295044,0.09008752,0.00088601053,0.00035834708,0.00023335042,0.00065149856,0.0001905808,0.04289949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796045,0.0006496205,0.000118578544,0.00035622943,0.00070261664,0.00021244245],"domain_scores_gemma":[0.9974184,0.0007897601,0.0003327087,0.00092881644,0.00037438996,0.00015586473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017351403,0.0006074347,0.0005814817,0.00087252806,0.0013970562,0.0028043133,0.00087580184,0.0012589277,0.0067795566],"category_scores_gemma":[0.0039710496,0.00043407176,0.0006143223,0.0010050591,0.0027674367,0.0075008236,0.003792767,0.0029551196,0.0016789336],"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.00009792413,0.000015964617,0.00021497898,0.000050303817,0.000006474275,0.00014116938,0.00016978478,0.0052735773,0.0012455076,0.9768769,0.0021967532,0.013710716],"study_design_scores_gemma":[0.000034031043,0.00003498156,0.0001849286,0.000051054507,0.000016770287,0.00036361557,0.00009544716,0.06787415,0.003674048,0.88946027,0.038189437,0.00002132106],"about_ca_topic_score_codex":0.0009439115,"about_ca_topic_score_gemma":0.00061043986,"teacher_disagreement_score":0.0067795566,"about_ca_system_score_codex":0.0013719217,"about_ca_system_score_gemma":0.00078427047,"threshold_uncertainty_score":0.022679865},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57316357,0.0021010756,0.38990992,0.0016605601,0.00027481976,0.0002695333,0.00054360944,0.0012813105,0.030795585],"genre_scores_gemma":[0.9867034,0.0005532455,0.01022182,0.00010018019,0.0000978387,0.000056601108,0.00017873652,0.000038669124,0.0020495087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774384,0.00047398562,0.00014541193,0.0004091104,0.0007420419,0.0004855554],"domain_scores_gemma":[0.9908676,0.0037337234,0.0017900426,0.0028571715,0.0004552972,0.00029611302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017031408,0.00064058095,0.00077682396,0.0010896334,0.0007262612,0.0011807267,0.00078451046,0.0010721459,0.0015853053],"category_scores_gemma":[0.009337916,0.0002834128,0.00091429387,0.0007611615,0.0019176414,0.0034129508,0.0027575293,0.0025856148,0.000561944],"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.0014337458,0.00015165232,0.0043153404,0.00039045216,0.00018712068,0.0014032164,0.00089155545,0.1320953,0.06755764,0.7220836,0.0050908183,0.06439957],"study_design_scores_gemma":[0.00012767299,0.0007869287,0.0030177669,0.00013075015,0.0001684549,0.0030951423,0.00024213058,0.43085656,0.061103404,0.48554087,0.014800915,0.00012941605],"about_ca_topic_score_codex":0.00019337554,"about_ca_topic_score_gemma":0.00012063987,"teacher_disagreement_score":0.0017031408,"about_ca_system_score_codex":0.00073848444,"about_ca_system_score_gemma":0.0006261581,"threshold_uncertainty_score":0.0090072155},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21682693,0.008959358,0.67166334,0.0032583352,0.0011646589,0.00038230146,0.0010260006,0.0018556282,0.09486348],"genre_scores_gemma":[0.56389844,0.004416008,0.41016003,0.00090476667,0.00063158345,0.0005068966,0.00214953,0.0006074406,0.016725373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967024,0.00048245722,0.00022808039,0.0004791451,0.0015446886,0.0005631515],"domain_scores_gemma":[0.9947766,0.0030761007,0.00037198587,0.0008540134,0.0007704214,0.00015086067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014422862,0.0016013623,0.00082221796,0.0015623479,0.0014186605,0.0024532543,0.0022457072,0.0009368075,0.0077008195],"category_scores_gemma":[0.010691534,0.0005970627,0.0013958465,0.0022864214,0.0022825652,0.00858827,0.0025158764,0.0031589034,0.0030892175],"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.0013963042,0.00032556462,0.0043329555,0.00097453943,0.00022456898,0.0004731774,0.0007043632,0.14408961,0.04231817,0.43168107,0.03450825,0.33897135],"study_design_scores_gemma":[0.00015797063,0.00050225493,0.0020203989,0.00018716928,0.00013713355,0.00082615763,0.00025788724,0.5014089,0.029544493,0.43007326,0.034721117,0.00016318035],"about_ca_topic_score_codex":0.003130611,"about_ca_topic_score_gemma":0.0060098735,"teacher_disagreement_score":0.0077008195,"about_ca_system_score_codex":0.0023963547,"about_ca_system_score_gemma":0.0028467975,"threshold_uncertainty_score":0.025761843},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034156036,0.0038948145,0.84919167,0.016789764,0.001030286,0.00019683642,0.00018909383,0.0006941579,0.09385733],"genre_scores_gemma":[0.8515789,0.0021933035,0.123619914,0.0051769614,0.00093911635,0.00031817518,0.00021360394,0.0005110223,0.015449067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9794733,0.007995945,0.0007742852,0.0028999012,0.007253333,0.0016033314],"domain_scores_gemma":[0.9538001,0.028769761,0.0021020654,0.010692463,0.0036749616,0.0009606075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012428069,0.0011723149,0.00137994,0.0019913455,0.0033187822,0.0051749656,0.0025658158,0.0024190028,0.011070814],"category_scores_gemma":[0.03159103,0.0013453997,0.0026448232,0.0013843398,0.013477016,0.018599663,0.008280823,0.017526997,0.0014320028],"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.000022874634,0.000025931877,0.000110804816,0.000098485885,0.000018610393,0.000055847344,0.00025437286,0.0011915424,0.0007330386,0.9929716,0.0011069635,0.003409868],"study_design_scores_gemma":[0.000017307744,0.000051707906,0.00012170569,0.000059947623,0.000021528787,0.0001403026,0.000085953674,0.0049434416,0.0015744684,0.9797673,0.01319833,0.000017970347],"about_ca_topic_score_codex":0.0009350615,"about_ca_topic_score_gemma":0.00054084964,"teacher_disagreement_score":0.012428069,"about_ca_system_score_codex":0.0037794202,"about_ca_system_score_gemma":0.0017290127,"threshold_uncertainty_score":0.06572676},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22501577,0.0011356139,0.75168926,0.00034498368,0.00018556816,0.0003927671,0.0002788418,0.008283281,0.012673818],"genre_scores_gemma":[0.7590038,0.00017212937,0.23370841,0.00013185765,0.00002555229,0.00019408544,0.00033713283,0.00016831525,0.006258727],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996178,0.00011497039,0.00002674716,0.00004524783,0.00013661968,0.000058737143],"domain_scores_gemma":[0.99951446,0.00012900478,0.000111109206,0.0001177564,0.00010784624,0.000019796129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003201484,0.0005765741,0.00022494122,0.0005903465,0.00017264315,0.00042370922,0.0010899096,0.00030936336,0.005286344],"category_scores_gemma":[0.0007845916,0.00018208739,0.0001900752,0.00029843123,0.0002183145,0.0007452587,0.000324854,0.00032693625,0.0013520946],"study_design_candidate":"bench_or_experimental","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.0016027094,0.00038224424,0.0036401183,0.0010376379,0.00014695498,0.0006842933,0.0003328837,0.050018508,0.4136409,0.046866395,0.009456566,0.47219083],"study_design_scores_gemma":[0.0004782438,0.0019394985,0.0020771725,0.00008984932,0.00010902304,0.0012368134,0.00009141651,0.38384482,0.55637884,0.0065335,0.047157455,0.000063347856],"about_ca_topic_score_codex":0.00025642465,"about_ca_topic_score_gemma":0.0008170397,"teacher_disagreement_score":0.005286344,"about_ca_system_score_codex":0.00038110948,"about_ca_system_score_gemma":0.00045484977,"threshold_uncertainty_score":0.017684579},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015195905,0.0046301316,0.96257496,0.0005461669,0.00033795723,0.00014386859,0.00010020368,0.001315754,0.015155136],"genre_scores_gemma":[0.19661252,0.0041590277,0.7751525,0.000200546,0.00028840918,0.0001962929,0.0004974776,0.00039366062,0.022499556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991885,0.00016100472,0.00004355591,0.000060095517,0.00048130803,0.00006545772],"domain_scores_gemma":[0.9995409,0.00011125232,0.000051912542,0.00018144312,0.000098989316,0.00001547166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006940015,0.0009850613,0.00048899616,0.0014159045,0.0005861067,0.000984067,0.00078954693,0.0005614416,0.010058994],"category_scores_gemma":[0.0016155051,0.0004008485,0.0005997567,0.0014355575,0.0006378967,0.0024044618,0.001321235,0.0013257242,0.0061280704],"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.00028326685,0.00013439791,0.0005028925,0.00067565177,0.00009688455,0.00020836135,0.0001781266,0.01872398,0.07916157,0.20646842,0.013500908,0.6800656],"study_design_scores_gemma":[0.00034343282,0.0005885428,0.0012753222,0.0003317497,0.00014340582,0.0024802787,0.00019751803,0.23841256,0.17290145,0.37429923,0.20892058,0.000105895415],"about_ca_topic_score_codex":0.0001329628,"about_ca_topic_score_gemma":0.00032269757,"teacher_disagreement_score":0.010058994,"about_ca_system_score_codex":0.0004492257,"about_ca_system_score_gemma":0.00059464114,"threshold_uncertainty_score":0.033650696},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04866969,0.00028375947,0.92275876,0.0006067915,0.00018425583,0.00050009676,0.0005008077,0.0013600622,0.025135772],"genre_scores_gemma":[0.49845216,0.00029333535,0.48270878,0.00046458226,0.00009342358,0.0010517428,0.0007564403,0.00026566457,0.015913757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977101,0.0006228259,0.00019122874,0.00045475658,0.00067303976,0.00034796924],"domain_scores_gemma":[0.99579406,0.0012483939,0.0006122543,0.0015014609,0.00050727226,0.00033650186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021114985,0.0008750265,0.00059257186,0.00095820957,0.0015366422,0.0014376568,0.0017234981,0.0017233891,0.004889288],"category_scores_gemma":[0.0056126015,0.00081805873,0.0013395407,0.001286357,0.002395305,0.0030652857,0.005048043,0.002362073,0.0017293898],"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.00026901887,0.000073777555,0.0009858519,0.0002762473,0.00004458635,0.00062072504,0.0005796436,0.0283505,0.019052304,0.9025772,0.004958633,0.04221137],"study_design_scores_gemma":[0.0001524039,0.0006078479,0.0010937277,0.00016605295,0.00016076455,0.0024086474,0.00025764815,0.1967459,0.048635904,0.682888,0.06665656,0.0002265203],"about_ca_topic_score_codex":0.0005491224,"about_ca_topic_score_gemma":0.0006245789,"teacher_disagreement_score":0.004889288,"about_ca_system_score_codex":0.0014253597,"about_ca_system_score_gemma":0.0016555571,"threshold_uncertainty_score":0.01635629},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1100429,0.003139426,0.7258017,0.004015837,0.00117687,0.00072446174,0.0022054403,0.009991243,0.14290214],"genre_scores_gemma":[0.858786,0.0011459228,0.098511264,0.0004678001,0.00023909756,0.00019932474,0.0010587336,0.0002738923,0.03931797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861157,0.0002790975,0.00008177336,0.0001819223,0.0005478134,0.0002978069],"domain_scores_gemma":[0.9984932,0.00039503275,0.00008341448,0.0006854347,0.000207821,0.00013506696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012631912,0.000510051,0.00062233343,0.00073144236,0.0012473618,0.003582077,0.0009885116,0.0011284202,0.013823938],"category_scores_gemma":[0.0044192006,0.0004309299,0.00038932372,0.00089417124,0.0013479044,0.0050640544,0.0038944802,0.0019842875,0.0053409655],"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.0010491726,0.00024390327,0.00082151726,0.0002995903,0.000049881906,0.00054772594,0.00045176904,0.006596436,0.015131454,0.80031604,0.026393158,0.14809932],"study_design_scores_gemma":[0.00040448352,0.00038924484,0.00043596156,0.00017159167,0.00009102707,0.0016196695,0.00020369691,0.066504076,0.028213354,0.7840914,0.11777488,0.000100641206],"about_ca_topic_score_codex":0.00030319332,"about_ca_topic_score_gemma":0.00032309964,"teacher_disagreement_score":0.013823938,"about_ca_system_score_codex":0.0007521761,"about_ca_system_score_gemma":0.001597469,"threshold_uncertainty_score":0.046245635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025842262,0.0025430347,0.9190337,0.009028894,0.0016689029,0.00030192977,0.0011628841,0.0017713154,0.038647093],"genre_scores_gemma":[0.5517485,0.0019576016,0.410787,0.0015744674,0.0012062285,0.00029554224,0.0017595452,0.00038017085,0.030290976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9904276,0.0033007055,0.001000813,0.0015292342,0.0033691074,0.00037246448],"domain_scores_gemma":[0.9305626,0.039482392,0.0070884596,0.014819266,0.0068757976,0.0011715069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060834587,0.0006603461,0.0009312123,0.0019059813,0.0018085488,0.004203533,0.0014654603,0.0024807318,0.013089079],"category_scores_gemma":[0.045097485,0.00040861825,0.0008618449,0.0016928964,0.0045096064,0.011777144,0.003817182,0.0031208433,0.0038684409],"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.00036505313,0.00010568493,0.00094107154,0.0009878404,0.00007080298,0.0007050384,0.0007993922,0.003728995,0.0093434,0.8125084,0.014108167,0.15633614],"study_design_scores_gemma":[0.000116201496,0.00012810307,0.00041762483,0.00042924663,0.000059202044,0.0014893742,0.00025962217,0.040926207,0.029131526,0.8405886,0.086376674,0.00007761061],"about_ca_topic_score_codex":0.00033929016,"about_ca_topic_score_gemma":0.00024141734,"teacher_disagreement_score":0.013089079,"about_ca_system_score_codex":0.0014037003,"about_ca_system_score_gemma":0.0015786497,"threshold_uncertainty_score":0.04378736},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010929997,0.0003784351,0.9715665,0.00056066544,0.0002194534,0.00054271123,0.00059970195,0.0031928837,0.012009698],"genre_scores_gemma":[0.51328224,0.0009849727,0.44848648,0.00045719554,0.00027546412,0.0011625566,0.0019720516,0.0009671595,0.032411855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968196,0.0009131427,0.00021714724,0.0003373242,0.0013624277,0.00035042164],"domain_scores_gemma":[0.9964645,0.0008490715,0.0003195825,0.0016105033,0.00037169637,0.0003846762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028837959,0.0007355967,0.0007145828,0.00078018935,0.000842662,0.0027822223,0.0026972163,0.001288223,0.009918567],"category_scores_gemma":[0.0076381243,0.0007269962,0.00075058144,0.0010122716,0.001548281,0.0052530724,0.0050005927,0.0028640002,0.003834013],"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.00075413,0.00029444988,0.0009117392,0.00055910833,0.0001544427,0.0005800197,0.00033660297,0.118242346,0.014239401,0.70631874,0.021947723,0.13566126],"study_design_scores_gemma":[0.00028197904,0.0002794796,0.00028070057,0.00007559674,0.00005322792,0.0005462669,0.000065655535,0.49530306,0.011424826,0.41726065,0.07434668,0.00008193062],"about_ca_topic_score_codex":0.0009655346,"about_ca_topic_score_gemma":0.0010748652,"teacher_disagreement_score":0.009918567,"about_ca_system_score_codex":0.0011072197,"about_ca_system_score_gemma":0.0025449246,"threshold_uncertainty_score":0.033180952},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027105398,0.0011280274,0.95853823,0.0012438657,0.00017256878,0.00033720594,0.0007178437,0.0025833985,0.008173469],"genre_scores_gemma":[0.78372777,0.0006301625,0.2047733,0.0006467872,0.00018000216,0.00032637242,0.0008337476,0.000213074,0.008668822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936016,0.0023731198,0.0005109082,0.0006882026,0.0021369932,0.00068920397],"domain_scores_gemma":[0.993159,0.0018535531,0.0006775768,0.0036433265,0.00044635133,0.0002202774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004272837,0.0006193887,0.0013331503,0.0010977434,0.0012542509,0.0027754412,0.0022955725,0.0020874904,0.002952505],"category_scores_gemma":[0.012599872,0.0006523361,0.00091226905,0.0021297955,0.002652536,0.012455335,0.006798852,0.0027487539,0.001630447],"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.0027353403,0.0003227138,0.0021399825,0.0006348588,0.00021853889,0.0007599794,0.00096293475,0.044184018,0.031349886,0.6988562,0.02046252,0.19737305],"study_design_scores_gemma":[0.00050706463,0.00050352036,0.0010954031,0.00012174177,0.00015073469,0.0018177282,0.00026967042,0.38481402,0.06947258,0.48915544,0.051884394,0.00020761967],"about_ca_topic_score_codex":0.00057747716,"about_ca_topic_score_gemma":0.0005285033,"teacher_disagreement_score":0.004272837,"about_ca_system_score_codex":0.0017636879,"about_ca_system_score_gemma":0.002554777,"threshold_uncertainty_score":0.022597194},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08545298,0.0004959186,0.8801325,0.0012626933,0.00024757453,0.00038812376,0.00024316371,0.00076805137,0.031008927],"genre_scores_gemma":[0.90454924,0.00027534188,0.08423834,0.0003776215,0.00015697307,0.00030842796,0.00023036257,0.00011083167,0.0097527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996546,0.0012158807,0.00022695243,0.0004908863,0.0011799951,0.00034033306],"domain_scores_gemma":[0.9963012,0.0012734045,0.00035300115,0.0016041925,0.00031232025,0.00015589339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023705368,0.000548776,0.0007772971,0.00074188295,0.0009175347,0.0019955605,0.0014394397,0.0011221295,0.0036624018],"category_scores_gemma":[0.0070851385,0.0002984082,0.00097547454,0.00055814016,0.0036329788,0.0059248568,0.0037440704,0.0025801125,0.0010920194],"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.000099834266,0.000047040638,0.00016768386,0.00007112604,0.000019174997,0.00006459926,0.00014152173,0.0069779153,0.0036014756,0.980143,0.00058166403,0.008084841],"study_design_scores_gemma":[0.000056001427,0.00010931993,0.000109460554,0.000028534727,0.000022400453,0.00018988343,0.000036165588,0.06946017,0.015638657,0.90823233,0.0060931677,0.00002393091],"about_ca_topic_score_codex":0.000117262454,"about_ca_topic_score_gemma":0.0000787333,"teacher_disagreement_score":0.0036624018,"about_ca_system_score_codex":0.0011579065,"about_ca_system_score_gemma":0.000962477,"threshold_uncertainty_score":0.012536764},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013334211,0.0010071208,0.7270688,0.0038106884,0.0012726781,0.0009384489,0.019406682,0.055143837,0.17801751],"genre_scores_gemma":[0.3751855,0.0018695914,0.21841843,0.0023735515,0.0014972971,0.002742576,0.037471462,0.012478589,0.34796306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975986,0.0005836116,0.0002388529,0.00028345906,0.000996219,0.00029931762],"domain_scores_gemma":[0.99745196,0.0007482273,0.00023205917,0.0010748692,0.00028936745,0.00020345765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020810042,0.0011616356,0.0009238093,0.0011207274,0.0010422296,0.004097438,0.0016815283,0.0011872844,0.10502538],"category_scores_gemma":[0.0054265778,0.000901838,0.0004847273,0.0013625199,0.0012449909,0.00952253,0.005370767,0.0026415398,0.058200207],"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.003058532,0.00023921255,0.0005967703,0.00060499564,0.000052768282,0.00041650215,0.0004043923,0.003936624,0.018150149,0.4555171,0.29366237,0.22336069],"study_design_scores_gemma":[0.00040815937,0.0002931555,0.00050929387,0.00018608649,0.000033425986,0.0005332294,0.00022651508,0.023165332,0.040352616,0.43959337,0.49460945,0.000089294044],"about_ca_topic_score_codex":0.00028417664,"about_ca_topic_score_gemma":0.00040971002,"teacher_disagreement_score":0.10502538,"about_ca_system_score_codex":0.00097646425,"about_ca_system_score_gemma":0.0013727797,"threshold_uncertainty_score":0.35134488},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8590604,0.0004921317,0.10450502,0.0007405855,0.0002686196,0.00017422276,0.0006136825,0.004398602,0.029746754],"genre_scores_gemma":[0.9906584,0.00005001716,0.0041981773,0.00005789197,0.00001360538,0.000014345841,0.00010268396,0.00011917253,0.004785871],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993424,0.00008910416,0.000023507891,0.00008320643,0.00036690698,0.0000949586],"domain_scores_gemma":[0.99910456,0.0003752139,0.00010872929,0.00021259919,0.00015439952,0.0000444459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025911452,0.0004412401,0.00024619294,0.00066664,0.00025605597,0.00036636248,0.00032886257,0.00038812382,0.006838623],"category_scores_gemma":[0.0016609716,0.00012347626,0.0001581045,0.0003001284,0.00040360176,0.00067584735,0.00033426966,0.00049704174,0.001427693],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0035281216,0.0004526136,0.018276747,0.00047257854,0.0001678897,0.0076897694,0.0013220592,0.05273603,0.6357152,0.035042454,0.022051118,0.22254553],"study_design_scores_gemma":[0.000088549685,0.0012952802,0.011759907,0.000051017727,0.000057152403,0.0032788957,0.00025564147,0.32276607,0.62953633,0.01031027,0.020540547,0.000060302766],"about_ca_topic_score_codex":0.00023444544,"about_ca_topic_score_gemma":0.00019663229,"teacher_disagreement_score":0.006838623,"about_ca_system_score_codex":0.0003194642,"about_ca_system_score_gemma":0.00019079952,"threshold_uncertainty_score":0.022877455},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38090074,0.010240529,0.5140349,0.0032604178,0.0014532852,0.0009298249,0.0012351485,0.0010397827,0.086905256],"genre_scores_gemma":[0.9303164,0.0015991892,0.06057275,0.00026127094,0.00015597824,0.0001774056,0.00062697637,0.000056260815,0.0062338626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98684955,0.005128085,0.00058069924,0.0006495868,0.005962999,0.0008291245],"domain_scores_gemma":[0.98546696,0.0058659418,0.0014289608,0.004794238,0.0017397732,0.00070411654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008823102,0.0006504745,0.0010415338,0.0022051078,0.001323548,0.00442242,0.0012536359,0.0020582224,0.005936399],"category_scores_gemma":[0.01950784,0.0003322905,0.00078064785,0.0038219753,0.0029365444,0.00944197,0.0064461445,0.0019211674,0.0017643959],"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.004590899,0.00031251757,0.0050169183,0.00071786763,0.00021930986,0.0001944305,0.0009933199,0.033558857,0.014662653,0.77330714,0.005235809,0.16119027],"study_design_scores_gemma":[0.0006760901,0.002226777,0.0035968788,0.0003163355,0.00026455714,0.001192648,0.00095914985,0.18497546,0.046682157,0.6963024,0.062628664,0.0001788553],"about_ca_topic_score_codex":0.00028700673,"about_ca_topic_score_gemma":0.00022180982,"teacher_disagreement_score":0.008823102,"about_ca_system_score_codex":0.0019927202,"about_ca_system_score_gemma":0.001609351,"threshold_uncertainty_score":0.046661556},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091515295,0.0020010911,0.85577136,0.0016286375,0.0004659197,0.0005056122,0.0013640551,0.012497139,0.034250956],"genre_scores_gemma":[0.702566,0.00051033485,0.27792686,0.0004578097,0.00006961213,0.00025482054,0.0014764353,0.0003171229,0.016421018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995059,0.00012185991,0.000029795237,0.000041355626,0.00022214859,0.00007901464],"domain_scores_gemma":[0.99959797,0.00006973926,0.000032989086,0.00020565452,0.000059593323,0.00003407297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005415923,0.00039523272,0.00039543607,0.00042764898,0.00038089807,0.0008216759,0.00083584577,0.0006825588,0.0065263663],"category_scores_gemma":[0.0012838128,0.00018381244,0.00039622185,0.0004204866,0.00057037576,0.0013117833,0.0014753157,0.00075662317,0.0020389317],"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.0039855093,0.00051558047,0.004814317,0.00067661796,0.00027732566,0.0015825058,0.0005775384,0.10146229,0.12726112,0.23030406,0.08769564,0.44084743],"study_design_scores_gemma":[0.0004926939,0.0004072551,0.0014628293,0.000059584927,0.000037013957,0.001144883,0.00007077026,0.7938013,0.08631935,0.053615525,0.06253073,0.000058014062],"about_ca_topic_score_codex":0.00075036474,"about_ca_topic_score_gemma":0.001344448,"teacher_disagreement_score":0.0065263663,"about_ca_system_score_codex":0.0006294937,"about_ca_system_score_gemma":0.0008901771,"threshold_uncertainty_score":0.021832943},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070718145,0.000235866,0.986896,0.00090533466,0.0001083645,0.00026471697,0.00044581387,0.0012905811,0.0027815553],"genre_scores_gemma":[0.3289344,0.00070771656,0.6547616,0.001696027,0.0007106321,0.0011556069,0.0021229947,0.0010530038,0.008858061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9746875,0.0071750632,0.00213658,0.0036381416,0.010587096,0.0017757284],"domain_scores_gemma":[0.88626266,0.06257777,0.005489977,0.03524285,0.008952817,0.0014739796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017445853,0.0011212511,0.0016422574,0.0012752479,0.002444275,0.0060952273,0.0057044085,0.0023593789,0.007497994],"category_scores_gemma":[0.07984451,0.0017125027,0.0028691662,0.0025585152,0.004258542,0.019640766,0.012528988,0.0076510026,0.002627938],"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.00061145716,0.000226651,0.0013410193,0.00078011624,0.0002678524,0.0005076345,0.0013125445,0.02657963,0.012042552,0.86305445,0.013286181,0.0799899],"study_design_scores_gemma":[0.00036062856,0.00022035849,0.00039016493,0.00012151491,0.00018556151,0.000540454,0.0002916838,0.1347436,0.019348765,0.8232391,0.020457663,0.000100581005],"about_ca_topic_score_codex":0.0012897323,"about_ca_topic_score_gemma":0.001140714,"teacher_disagreement_score":0.017445853,"about_ca_system_score_codex":0.0024890134,"about_ca_system_score_gemma":0.0052604657,"threshold_uncertainty_score":0.09226358},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02918936,0.00053009455,0.9471134,0.0009497793,0.00015292289,0.00042742226,0.00033600596,0.00039602528,0.020904912],"genre_scores_gemma":[0.7577693,0.0008234701,0.22469257,0.00022351014,0.00010503721,0.0005771408,0.00049246405,0.000091799964,0.015224707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945963,0.0023347526,0.000249679,0.0004848423,0.0018823597,0.00045213656],"domain_scores_gemma":[0.99486166,0.0021219633,0.00048809222,0.0018105872,0.0004883537,0.00022925487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004781928,0.0005663265,0.00079785555,0.00075689936,0.0010485412,0.002457723,0.002177508,0.0023252987,0.0059913322],"category_scores_gemma":[0.010851493,0.00045774202,0.00072135235,0.0011371478,0.0026196125,0.005777597,0.0033452099,0.0018757596,0.0014688008],"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.00020865277,0.000055781504,0.00026007602,0.00011583223,0.000035652938,0.00030394143,0.0001458715,0.051260766,0.004036622,0.92041177,0.0015146965,0.021650437],"study_design_scores_gemma":[0.00014473194,0.00011179805,0.00014093566,0.000058208527,0.000021861217,0.00019599362,0.00003281272,0.34402582,0.006073783,0.63331246,0.015841486,0.000040064133],"about_ca_topic_score_codex":0.0010303108,"about_ca_topic_score_gemma":0.0010221754,"teacher_disagreement_score":0.0059913322,"about_ca_system_score_codex":0.0019171851,"about_ca_system_score_gemma":0.002346367,"threshold_uncertainty_score":0.025289595},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2025678,0.0005581408,0.79038066,0.001168437,0.00006133252,0.00010812797,0.00021410869,0.00039162568,0.0045497743],"genre_scores_gemma":[0.95561117,0.00016288777,0.042860653,0.0001279754,0.000045028166,0.000055948105,0.000082010636,0.000022668417,0.0010317758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99354976,0.0023765368,0.0002808151,0.0010131911,0.0021420522,0.0006377316],"domain_scores_gemma":[0.9546885,0.0295771,0.0072222245,0.0057043643,0.0021685492,0.0006392888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033055346,0.0007460542,0.0011424512,0.0007748939,0.000735834,0.0015394461,0.0013887283,0.0015877564,0.0009182435],"category_scores_gemma":[0.03672546,0.0005333547,0.00059941644,0.00092792814,0.0031004986,0.003991046,0.0032731972,0.0020170067,0.00027007845],"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.0014203871,0.00019665968,0.0072463094,0.0005756538,0.00024498193,0.0009533882,0.00058611226,0.4923545,0.06260471,0.3572093,0.0022204432,0.07438749],"study_design_scores_gemma":[0.00003485745,0.00022438465,0.00050602964,0.00004341014,0.000037495684,0.00052285107,0.000059302092,0.8949869,0.030820603,0.07145487,0.0012673847,0.00004178875],"about_ca_topic_score_codex":0.00040461935,"about_ca_topic_score_gemma":0.00025791125,"teacher_disagreement_score":0.0033055346,"about_ca_system_score_codex":0.0017297874,"about_ca_system_score_gemma":0.0014013248,"threshold_uncertainty_score":0.017481565},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14584604,0.0015373533,0.75348437,0.0059756828,0.0002672717,0.00026158334,0.00071108836,0.0010819267,0.0908346],"genre_scores_gemma":[0.9131729,0.00076457334,0.0661007,0.00076181086,0.00026401866,0.00038648673,0.0006089435,0.0002321384,0.017708508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969253,0.0009901471,0.00016747834,0.0006107614,0.00080153137,0.0005048137],"domain_scores_gemma":[0.99078923,0.0049332133,0.00094789435,0.0020254944,0.000759778,0.00054445537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032325368,0.00058618793,0.00086968846,0.0017033508,0.0030678557,0.0043363147,0.00196715,0.002099605,0.0098482985],"category_scores_gemma":[0.010514064,0.00069728773,0.0010860953,0.0020607891,0.0060536587,0.014203351,0.007165346,0.004768888,0.0013420417],"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.000019513427,0.0000068780705,0.000063549094,0.00001905953,0.000004129636,0.000029185769,0.00014003039,0.0010346874,0.00021501722,0.99686015,0.00028184158,0.0013258657],"study_design_scores_gemma":[0.000011411232,0.000016135336,0.00006040221,0.000019113553,0.000008713688,0.000041122512,0.00005341916,0.011754027,0.00043723264,0.98493445,0.002655806,0.000008285207],"about_ca_topic_score_codex":0.0007055743,"about_ca_topic_score_gemma":0.0005115726,"teacher_disagreement_score":0.0098482985,"about_ca_system_score_codex":0.0024938602,"about_ca_system_score_gemma":0.001261712,"threshold_uncertainty_score":0.03294581},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031341296,0.0030686005,0.91843843,0.0022519806,0.0010187153,0.00093858567,0.0005805979,0.0028739132,0.03948795],"genre_scores_gemma":[0.59718454,0.0013689896,0.36676687,0.0022385365,0.0005765932,0.001295411,0.001407983,0.00042830178,0.028732795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966001,0.0009837815,0.00021133461,0.0006405808,0.0011810918,0.00038302623],"domain_scores_gemma":[0.99473625,0.001512238,0.00069329096,0.002112076,0.00062045973,0.00032568583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021992822,0.0009188719,0.00084020616,0.0013392587,0.0012421611,0.0025176806,0.0016828128,0.0026078038,0.006575821],"category_scores_gemma":[0.01173925,0.00056693837,0.0010256515,0.001025352,0.0027854815,0.005523552,0.0050516776,0.0033288195,0.0028391217],"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.0013302003,0.00038848168,0.0015453898,0.00054595113,0.00013140944,0.00027874857,0.00035698278,0.014777661,0.014207507,0.72957444,0.026213951,0.21064927],"study_design_scores_gemma":[0.0006932306,0.0009191813,0.0017076987,0.00028972863,0.00012561886,0.0042350055,0.00038488887,0.2600416,0.04558191,0.5748608,0.1108294,0.00033095968],"about_ca_topic_score_codex":0.0003777549,"about_ca_topic_score_gemma":0.00050001475,"teacher_disagreement_score":0.006575821,"about_ca_system_score_codex":0.0013907254,"about_ca_system_score_gemma":0.0022931516,"threshold_uncertainty_score":0.021998346},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024095291,0.00025093398,0.96058595,0.0011959239,0.00012552331,0.0001595423,0.00023204258,0.001485477,0.011869273],"genre_scores_gemma":[0.83946687,0.00031453758,0.14137585,0.00044296923,0.00019266522,0.0003078347,0.00044176454,0.0001797215,0.017277732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99367756,0.0018367979,0.0004286617,0.00092236727,0.0024465206,0.00068817683],"domain_scores_gemma":[0.9847803,0.00387201,0.0013188237,0.0077774436,0.001819797,0.00043170658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004127164,0.0008184111,0.0007862374,0.0007980958,0.0020356101,0.0036913375,0.0022588153,0.0018708362,0.0041406536],"category_scores_gemma":[0.010458047,0.0008327402,0.0012003913,0.001231248,0.0042507164,0.009945504,0.0070703067,0.005603199,0.0019842384],"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.00044045178,0.0001364184,0.0011681706,0.00031393877,0.000053133514,0.00025704558,0.0007224614,0.016086983,0.011151994,0.9204864,0.0037649774,0.045418],"study_design_scores_gemma":[0.0001449006,0.0002139987,0.00057952,0.00008343206,0.00011318994,0.0006850036,0.0001234738,0.18423717,0.022030402,0.7667322,0.024980083,0.00007664308],"about_ca_topic_score_codex":0.0006578621,"about_ca_topic_score_gemma":0.0005461622,"teacher_disagreement_score":0.0041406536,"about_ca_system_score_codex":0.0017565064,"about_ca_system_score_gemma":0.0019684676,"threshold_uncertainty_score":0.021826744},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0081190895,0.0021873969,0.9704129,0.0024042455,0.00036310553,0.0003187969,0.00082015543,0.0016606128,0.013713651],"genre_scores_gemma":[0.34755757,0.004669272,0.6225622,0.0023758244,0.0009561423,0.0021605026,0.002845934,0.0010734323,0.015799114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9895857,0.003792044,0.0008945951,0.0017846794,0.0031650825,0.00077794923],"domain_scores_gemma":[0.97163785,0.018027347,0.0017862436,0.0070587974,0.001069478,0.00042037302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059903073,0.0016680674,0.0013568037,0.0017213975,0.0014383388,0.004554838,0.0028296732,0.0028940206,0.008147755],"category_scores_gemma":[0.03166199,0.0013347262,0.0024625864,0.002891358,0.00516272,0.013791692,0.005570263,0.009010149,0.0022382236],"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.0001572502,0.000070098096,0.0002222923,0.00021628046,0.00002700997,0.000108992914,0.0001773508,0.0203146,0.0015964406,0.94948083,0.0025411614,0.025087744],"study_design_scores_gemma":[0.00006379966,0.000057704736,0.000065691245,0.00013765675,0.00003062055,0.00018277507,0.00004147447,0.07443985,0.0039622183,0.9088619,0.012114667,0.000041585292],"about_ca_topic_score_codex":0.0010621474,"about_ca_topic_score_gemma":0.00087436684,"teacher_disagreement_score":0.008147755,"about_ca_system_score_codex":0.0042922897,"about_ca_system_score_gemma":0.0028297822,"threshold_uncertainty_score":0.031680167},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1645717,0.0010046836,0.7988437,0.0025290982,0.00030132805,0.00021790246,0.00023028743,0.0017143607,0.030586934],"genre_scores_gemma":[0.65223426,0.00040859837,0.34003383,0.00047139238,0.00012268769,0.000173649,0.00030488762,0.00039071773,0.005859995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997962,0.00070295745,0.000108540866,0.00031470633,0.00071409857,0.00019768221],"domain_scores_gemma":[0.9960705,0.002546654,0.00023059535,0.0007326405,0.00027046498,0.00014910691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015554196,0.00044954036,0.0010813047,0.001129081,0.000826779,0.0020259751,0.0013106201,0.0011034113,0.01120787],"category_scores_gemma":[0.008073104,0.00041582246,0.000872617,0.0013752445,0.0019605078,0.0043801693,0.0019453983,0.0025139218,0.001489767],"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.0006263298,0.00035350295,0.0011972465,0.000429672,0.000101985715,0.000097209704,0.00024031334,0.17620668,0.014457286,0.66378444,0.009221592,0.13328378],"study_design_scores_gemma":[0.00014758973,0.00010398494,0.00014890623,0.000037777358,0.000012677131,0.000061753155,0.00007212621,0.54946095,0.0052236775,0.44010794,0.0045972834,0.00002538902],"about_ca_topic_score_codex":0.0011424691,"about_ca_topic_score_gemma":0.0017078919,"teacher_disagreement_score":0.01120787,"about_ca_system_score_codex":0.0014417699,"about_ca_system_score_gemma":0.0018003869,"threshold_uncertainty_score":0.037494063},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114932746,0.001445297,0.7371156,0.0023174977,0.00063547236,0.0024684132,0.0030680257,0.03703224,0.10098471],"genre_scores_gemma":[0.81353086,0.0010533333,0.11992662,0.0004896776,0.00017085845,0.0011548129,0.004231581,0.00069363374,0.05874848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910384,0.00024410704,0.000059035276,0.00012435683,0.0003371078,0.00013149463],"domain_scores_gemma":[0.99832004,0.00033279517,0.00023031172,0.0005944785,0.0002500129,0.00027231462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009271415,0.0004906064,0.00040367467,0.00082798017,0.0010386498,0.0013833038,0.0014464518,0.0011263727,0.013604197],"category_scores_gemma":[0.0036032144,0.000321957,0.00023305674,0.0007952501,0.00085860316,0.0038066162,0.0041555925,0.0009454078,0.0048422907],"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.004074943,0.0013236835,0.0071013626,0.0015230377,0.00016972907,0.0029762324,0.0019185084,0.09965177,0.065834776,0.2194265,0.10036281,0.49563667],"study_design_scores_gemma":[0.00074417767,0.00095316983,0.001842973,0.0001833343,0.00008003533,0.0014024432,0.00028286097,0.5320121,0.03701016,0.080542065,0.34475154,0.00019518254],"about_ca_topic_score_codex":0.0020894213,"about_ca_topic_score_gemma":0.0019518667,"teacher_disagreement_score":0.013604197,"about_ca_system_score_codex":0.0007350781,"about_ca_system_score_gemma":0.0018027492,"threshold_uncertainty_score":0.04551059},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032998554,0.0013099741,0.9471263,0.0007723973,0.0010307232,0.0002754031,0.00048365496,0.0018038179,0.014199063],"genre_scores_gemma":[0.48504186,0.001134612,0.47946146,0.0006376401,0.0009874984,0.00039433298,0.001206767,0.0002842169,0.03085173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965366,0.0006927124,0.0003575583,0.0005534572,0.0015071026,0.0003525674],"domain_scores_gemma":[0.990167,0.0016170298,0.0012974836,0.0047366563,0.0013790687,0.0008028038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022457405,0.00069097563,0.0007996399,0.0009797352,0.000936157,0.0025375867,0.0017700832,0.00155527,0.00743266],"category_scores_gemma":[0.00556734,0.00040424537,0.00086667394,0.0017218704,0.0017751246,0.008785226,0.003180327,0.002484177,0.0032817943],"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.0013314182,0.00018978705,0.00088186824,0.0005351671,0.000080556485,0.00035460776,0.00038110025,0.00814469,0.07636625,0.6860719,0.008684007,0.2169786],"study_design_scores_gemma":[0.00028726013,0.0014448799,0.0007930675,0.00014810891,0.00015919589,0.0030881641,0.00016743358,0.09624333,0.16678463,0.40613523,0.32450214,0.00024660738],"about_ca_topic_score_codex":0.00021102607,"about_ca_topic_score_gemma":0.00021806297,"teacher_disagreement_score":0.00743266,"about_ca_system_score_codex":0.0009920615,"about_ca_system_score_gemma":0.0013728341,"threshold_uncertainty_score":0.024864733},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042590592,0.0024954416,0.9390704,0.0015324682,0.00031205858,0.00027677405,0.00017975816,0.001301502,0.0122410245],"genre_scores_gemma":[0.84851927,0.0021111001,0.14087026,0.00067636615,0.00029770416,0.00037955813,0.00019977822,0.00011183108,0.0068341508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982033,0.00064381043,0.00011002687,0.00029622216,0.0005970949,0.00014954536],"domain_scores_gemma":[0.9948826,0.0030964292,0.0007179937,0.0008941876,0.00028750784,0.000121389516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002227585,0.00078639475,0.00080039474,0.00096361665,0.00093060324,0.0012269265,0.0012033231,0.0010722388,0.0020624716],"category_scores_gemma":[0.009046176,0.00047815638,0.0008245725,0.0010466415,0.0026467494,0.0036426866,0.0031862843,0.0015428711,0.0006627476],"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.000410773,0.000083895924,0.0009912954,0.0008057139,0.00014182336,0.0006800721,0.0005893267,0.39291844,0.015380199,0.52098036,0.0066114957,0.06040667],"study_design_scores_gemma":[0.00006106309,0.0001845029,0.00024432433,0.0000687525,0.000043652515,0.00041364483,0.00007468425,0.59385717,0.0058125886,0.39084008,0.008357573,0.000041929157],"about_ca_topic_score_codex":0.00049160677,"about_ca_topic_score_gemma":0.00036401357,"teacher_disagreement_score":0.002227585,"about_ca_system_score_codex":0.0011554791,"about_ca_system_score_gemma":0.00057064195,"threshold_uncertainty_score":0.011780739},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023004316,0.00079879386,0.92391443,0.0011013797,0.0007826217,0.00026308975,0.00023368378,0.00076640595,0.04913521],"genre_scores_gemma":[0.717905,0.0013881391,0.23897272,0.00089364295,0.00055391964,0.0004610526,0.0006490562,0.00027781428,0.03889864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970999,0.0010431149,0.00017129678,0.00038158652,0.0009494283,0.0003546846],"domain_scores_gemma":[0.9975521,0.00064131164,0.0002561958,0.0011885858,0.0002370242,0.00012481332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019067725,0.0006704358,0.0006580744,0.00077860814,0.0015255518,0.0019726802,0.0013878247,0.0011702552,0.0056837616],"category_scores_gemma":[0.0033264188,0.00031244778,0.0009163612,0.0009622992,0.0019408698,0.0065172077,0.0059918524,0.0027592832,0.0018903707],"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.00031789782,0.000085345644,0.00040408788,0.00021706239,0.00006214821,0.00029960295,0.00047051837,0.015000055,0.010708535,0.90827805,0.005407328,0.058749497],"study_design_scores_gemma":[0.00014628231,0.00042438277,0.00040888248,0.00013431675,0.0001347995,0.0012768361,0.00024391888,0.10424889,0.046205405,0.6741529,0.17249896,0.00012433018],"about_ca_topic_score_codex":0.000272809,"about_ca_topic_score_gemma":0.00028193594,"teacher_disagreement_score":0.0056837616,"about_ca_system_score_codex":0.001005731,"about_ca_system_score_gemma":0.00092888036,"threshold_uncertainty_score":0.01901406},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014496988,0.000324993,0.96174186,0.0021810925,0.0003472385,0.00066571444,0.000572484,0.0039490736,0.015720671],"genre_scores_gemma":[0.5880776,0.000718067,0.38709903,0.0012011767,0.0005596228,0.00082699786,0.00094593456,0.001187524,0.01938397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.989576,0.0038111238,0.0006053435,0.0010512453,0.0041462574,0.00081000355],"domain_scores_gemma":[0.9621595,0.021631256,0.002763379,0.0106928265,0.0017918141,0.0009611033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008271293,0.0009175757,0.0007691288,0.0010667254,0.0019503355,0.004804214,0.0024955217,0.0023010133,0.011163809],"category_scores_gemma":[0.052061867,0.0012624231,0.0013666352,0.0010542078,0.0056973677,0.012085734,0.008581906,0.007543059,0.0036522958],"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.0005973623,0.00017327278,0.0007736703,0.00043784053,0.00007424831,0.00045011757,0.00095460494,0.011973582,0.009666274,0.8852695,0.015748654,0.073880754],"study_design_scores_gemma":[0.00036972854,0.00027115006,0.00047532437,0.00023655429,0.00009383913,0.00057677086,0.00020707736,0.06492775,0.02998356,0.8286616,0.07408999,0.00010652661],"about_ca_topic_score_codex":0.00073839095,"about_ca_topic_score_gemma":0.000640001,"teacher_disagreement_score":0.011163809,"about_ca_system_score_codex":0.001641107,"about_ca_system_score_gemma":0.00306814,"threshold_uncertainty_score":0.043743312},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012448457,0.0023612243,0.9600846,0.0007792969,0.0006879974,0.00016786733,0.00031511253,0.0027353442,0.020420127],"genre_scores_gemma":[0.6876716,0.0026246489,0.269346,0.0021720459,0.00070640084,0.00054708513,0.0009709174,0.0014353814,0.034525968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786264,0.0005291517,0.00016025742,0.00033161772,0.0008441148,0.00027232643],"domain_scores_gemma":[0.9970565,0.0011891583,0.00017608819,0.0012452588,0.00024534494,0.000087700544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013488939,0.0008147206,0.0007655509,0.0010099997,0.0008006964,0.0029766187,0.0015063286,0.0013114449,0.013104203],"category_scores_gemma":[0.0063670054,0.0004963687,0.0008726868,0.0008988407,0.0025047709,0.0066664587,0.0033487903,0.0026641302,0.004005476],"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.0002685694,0.000051277264,0.00027415258,0.000381646,0.000041783012,0.00015997174,0.00022965035,0.009998468,0.011650374,0.8681943,0.0061066067,0.102643214],"study_design_scores_gemma":[0.000052221378,0.00018205613,0.00009889455,0.00016418018,0.000049041257,0.000443971,0.00005112232,0.033327214,0.027028875,0.88752145,0.05102311,0.000057812777],"about_ca_topic_score_codex":0.00018476165,"about_ca_topic_score_gemma":0.0002964544,"teacher_disagreement_score":0.013104203,"about_ca_system_score_codex":0.0008871623,"about_ca_system_score_gemma":0.0009246115,"threshold_uncertainty_score":0.043837905},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6667554,0.0018189906,0.27361783,0.0011592864,0.00013838685,0.00025927016,0.00022262233,0.0005554326,0.055472825],"genre_scores_gemma":[0.9916243,0.0003562135,0.0054121995,0.00004663601,0.000037425805,0.000021130016,0.00007731412,0.000020185684,0.002404586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984604,0.0003210127,0.000057693273,0.00012638196,0.00075324654,0.00028122324],"domain_scores_gemma":[0.9959072,0.002575908,0.00046590742,0.0005145563,0.00041436788,0.00012214704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009307279,0.00053531677,0.00049870723,0.002199507,0.000650002,0.0012110464,0.0005268606,0.0010405113,0.0026723577],"category_scores_gemma":[0.0045463704,0.00018811446,0.00076031697,0.0008686859,0.0011978528,0.001960452,0.0010869633,0.0011123361,0.0003863931],"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.0008761568,0.00026545458,0.009351097,0.0004089372,0.00020400758,0.0024636881,0.0004691411,0.14742005,0.04311544,0.69976705,0.006120554,0.089538455],"study_design_scores_gemma":[0.00003727226,0.00032660738,0.003916081,0.000048005266,0.00009078576,0.002338741,0.00012094561,0.76248914,0.03174312,0.19381861,0.0050355913,0.00003502821],"about_ca_topic_score_codex":0.00022377454,"about_ca_topic_score_gemma":0.00011515322,"teacher_disagreement_score":0.0026723577,"about_ca_system_score_codex":0.0009143937,"about_ca_system_score_gemma":0.00034516057,"threshold_uncertainty_score":0.008939862},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005755754,0.0004447704,0.97998,0.0004503202,0.00026268273,0.0005075327,0.0003284552,0.004231599,0.008038869],"genre_scores_gemma":[0.37068236,0.00073925697,0.5999426,0.0005192226,0.0003782233,0.0011913867,0.0013030132,0.00048759283,0.024756413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940158,0.0013190885,0.0005572225,0.0012564715,0.002229781,0.0006217123],"domain_scores_gemma":[0.9936511,0.0017135477,0.00045862028,0.0031170063,0.0006722756,0.00038755272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027514386,0.000939545,0.0019739133,0.0015440639,0.0032264367,0.004338687,0.004065631,0.0024708984,0.016133068],"category_scores_gemma":[0.0075196614,0.0008448279,0.0017361391,0.0017635982,0.0020855663,0.008119969,0.010869601,0.0030123347,0.008819821],"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.0012412703,0.00041856355,0.0010438499,0.00090030336,0.00032504584,0.0011405832,0.00067810045,0.021935053,0.031458966,0.7448135,0.021272082,0.17477266],"study_design_scores_gemma":[0.0007429572,0.00059392094,0.0006612629,0.00018645097,0.00031789995,0.0017680547,0.00015058405,0.40068135,0.065745324,0.36538482,0.16352439,0.00024298574],"about_ca_topic_score_codex":0.0008022858,"about_ca_topic_score_gemma":0.00081603485,"teacher_disagreement_score":0.016133068,"about_ca_system_score_codex":0.0019795273,"about_ca_system_score_gemma":0.0044161426,"threshold_uncertainty_score":0.053970516},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2855555,0.00786833,0.100768946,0.045869637,0.0023931232,0.00016213974,0.0006586146,0.00067250157,0.5560511],"genre_scores_gemma":[0.971456,0.0010492153,0.004742421,0.0013416224,0.00039774168,0.000025802781,0.000081661194,0.000042112864,0.020863403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837375,0.00057625334,0.000040303596,0.00014072517,0.0005251307,0.00034383746],"domain_scores_gemma":[0.99786097,0.00096222357,0.00015091624,0.0006781287,0.0002355668,0.00011225222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014740756,0.00052533014,0.0005564099,0.0009656772,0.0011989275,0.0017912699,0.00077826326,0.0023808188,0.010415861],"category_scores_gemma":[0.0060167047,0.00026069075,0.00046033462,0.0009638279,0.0042169155,0.0048697274,0.0029573925,0.002493476,0.0019014803],"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.00026200002,0.00001912335,0.00035865093,0.0000527919,0.00002197309,0.00041145104,0.00013544815,0.0032339746,0.001422455,0.9677248,0.009819311,0.016537977],"study_design_scores_gemma":[0.000047955527,0.000048636677,0.0003641231,0.000031252104,0.000013135279,0.00050891703,0.00011922847,0.009392242,0.0018646062,0.97369766,0.013889872,0.000022368531],"about_ca_topic_score_codex":0.0005902186,"about_ca_topic_score_gemma":0.00045365293,"teacher_disagreement_score":0.010415861,"about_ca_system_score_codex":0.0011029845,"about_ca_system_score_gemma":0.000657611,"threshold_uncertainty_score":0.034844518},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19321327,0.0009431724,0.6663259,0.001604394,0.0006000594,0.0006398634,0.0012998976,0.0037915679,0.13158183],"genre_scores_gemma":[0.903565,0.00026839587,0.069183245,0.00025988033,0.00011528204,0.00011974399,0.0005133463,0.00012378507,0.025851399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879277,0.00019537384,0.000059142592,0.00025859484,0.00046567767,0.00022838355],"domain_scores_gemma":[0.9988587,0.00012870123,0.00011439961,0.00064642663,0.00016572754,0.00008603228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006820747,0.00037241235,0.00056813494,0.0004811028,0.000767961,0.0014934315,0.0010881511,0.00080024486,0.008246496],"category_scores_gemma":[0.0014618628,0.00020467292,0.00046215314,0.0005892953,0.0016295445,0.0027874305,0.002442319,0.0016020829,0.0024309522],"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.00032040468,0.00010619101,0.00042594303,0.0001424003,0.000027571723,0.0002483986,0.00031765443,0.005867272,0.026107514,0.9216592,0.0043821614,0.040395264],"study_design_scores_gemma":[0.00025870328,0.00062409753,0.0012664488,0.00006779597,0.00009599117,0.0011162214,0.00016155923,0.14577964,0.15497977,0.52443314,0.1710603,0.00015630406],"about_ca_topic_score_codex":0.0005184176,"about_ca_topic_score_gemma":0.0005000624,"teacher_disagreement_score":0.008246496,"about_ca_system_score_codex":0.0010675489,"about_ca_system_score_gemma":0.0013663443,"threshold_uncertainty_score":0.027587354},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16701593,0.004254272,0.7600969,0.0041685733,0.000629515,0.00041218547,0.0033375074,0.0014962576,0.058588777],"genre_scores_gemma":[0.8407214,0.0024497705,0.13922036,0.0009822398,0.000729118,0.0005975914,0.001975535,0.0007420786,0.012581942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99395895,0.0012979445,0.0003331087,0.001358922,0.0021319564,0.00091909897],"domain_scores_gemma":[0.9294212,0.05059061,0.0031339766,0.011998377,0.0024687897,0.0023871122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004383829,0.0012556226,0.0017784392,0.0021439488,0.0025191202,0.0040778555,0.002981937,0.0030078844,0.012575591],"category_scores_gemma":[0.043985724,0.001301116,0.0020500498,0.0023872468,0.0049760565,0.01564434,0.006662153,0.0064271735,0.0025737602],"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.0016354172,0.00019764651,0.004833219,0.000936562,0.00021380304,0.00065748673,0.0012444179,0.037034187,0.03225902,0.8308809,0.013258722,0.07684871],"study_design_scores_gemma":[0.00008510936,0.00032378125,0.0016260664,0.00017973271,0.00019658075,0.0014365206,0.0002011652,0.06500982,0.021283638,0.88545674,0.024073942,0.00012698467],"about_ca_topic_score_codex":0.0006400091,"about_ca_topic_score_gemma":0.00043686337,"teacher_disagreement_score":0.012575591,"about_ca_system_score_codex":0.002445132,"about_ca_system_score_gemma":0.001424403,"threshold_uncertainty_score":0.042069554},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06111512,0.00019597863,0.9260309,0.00040829525,0.000092572605,0.00039501447,0.0002583491,0.0009200295,0.010583825],"genre_scores_gemma":[0.5818618,0.00013937944,0.40667513,0.00020267,0.0000261357,0.00038361072,0.0005590487,0.00007611288,0.010076106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892443,0.00022120295,0.00009754157,0.00020110469,0.00041635818,0.00013937106],"domain_scores_gemma":[0.99878925,0.00021900315,0.00015755517,0.0005704951,0.00016002197,0.000103754275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009789645,0.0003088718,0.00046046567,0.00046106384,0.0006684793,0.00088128116,0.0011207744,0.0007397312,0.0032746585],"category_scores_gemma":[0.0013476895,0.00033242264,0.0005745058,0.0005082408,0.0011361283,0.002299957,0.003492087,0.0012838017,0.0011159222],"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.00033474131,0.00022918543,0.001457013,0.0004366339,0.00012421158,0.00087305007,0.00069367915,0.024403984,0.12636362,0.76737803,0.005419263,0.07228656],"study_design_scores_gemma":[0.0002609165,0.0005326493,0.0021266534,0.00009772759,0.00018762346,0.001823941,0.00033781727,0.5078951,0.13759454,0.28578717,0.06321181,0.00014401747],"about_ca_topic_score_codex":0.000315479,"about_ca_topic_score_gemma":0.0003703864,"teacher_disagreement_score":0.0032746585,"about_ca_system_score_codex":0.0006665835,"about_ca_system_score_gemma":0.00089849514,"threshold_uncertainty_score":0.010954797},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010846899,0.00013120618,0.98507243,0.00014291414,0.000032466578,0.00006460286,0.000028446968,0.0003853644,0.00329575],"genre_scores_gemma":[0.53275377,0.0003359212,0.46011662,0.0003048671,0.00006234756,0.00019272283,0.00016439368,0.00020919745,0.0058602067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992355,0.00024301006,0.000033696077,0.00010092684,0.0002677042,0.00011915223],"domain_scores_gemma":[0.99866176,0.0008520521,0.0001422459,0.00013684873,0.0001494435,0.000057691042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011514495,0.0008905631,0.00086011144,0.00068281876,0.0005153708,0.0010451837,0.0008530274,0.0007120235,0.0031851167],"category_scores_gemma":[0.003000552,0.0004413377,0.0011741258,0.0005554042,0.0012417176,0.0017390564,0.0015972872,0.0017813906,0.0007226163],"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.00015143176,0.00007890316,0.00050461455,0.00010029647,0.000038082224,0.0001907481,0.00010559296,0.8764642,0.005974119,0.06673027,0.0013987381,0.048263084],"study_design_scores_gemma":[0.000006150296,0.000027325459,0.000016002938,0.000005098517,0.0000032172197,0.000018701747,0.000005600063,0.9903412,0.00092747883,0.008212024,0.00043312518,0.0000040840014],"about_ca_topic_score_codex":0.0016751313,"about_ca_topic_score_gemma":0.0018188814,"teacher_disagreement_score":0.0031851167,"about_ca_system_score_codex":0.00087472185,"about_ca_system_score_gemma":0.0011875689,"threshold_uncertainty_score":0.010655284},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030935215,0.0009633052,0.95083123,0.001473606,0.00027844,0.0002342271,0.00017547666,0.0018715423,0.013236948],"genre_scores_gemma":[0.6754873,0.0011764925,0.30915782,0.0008332761,0.00027056306,0.00045264102,0.00052193494,0.00042805314,0.0116719175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992831,0.0025560672,0.00049055414,0.0012117709,0.0019328584,0.0009777101],"domain_scores_gemma":[0.989122,0.0040251273,0.0012268758,0.0044037844,0.0008378831,0.00038433424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062916456,0.0009017873,0.0008283794,0.0009616704,0.0015487404,0.0039984207,0.0030762267,0.0023028639,0.00896846],"category_scores_gemma":[0.016232595,0.000981682,0.0011177821,0.0012080169,0.0053002103,0.014076196,0.0064084223,0.005498088,0.0027436295],"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.00050328264,0.0001237282,0.00089201797,0.0005193886,0.00009099407,0.00018272769,0.0007082504,0.0049321945,0.011213375,0.87451595,0.0045410492,0.101777],"study_design_scores_gemma":[0.00019020094,0.0006643453,0.0006548095,0.00026069835,0.00017909282,0.0007927632,0.000463763,0.06514625,0.0938619,0.78016126,0.057379015,0.00024598834],"about_ca_topic_score_codex":0.00050499785,"about_ca_topic_score_gemma":0.0005376063,"teacher_disagreement_score":0.00896846,"about_ca_system_score_codex":0.0013596326,"about_ca_system_score_gemma":0.002360434,"threshold_uncertainty_score":0.033273757},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008428439,0.00035937558,0.9654416,0.0012331232,0.0005373058,0.00013363315,0.00057543546,0.009691083,0.013599937],"genre_scores_gemma":[0.46385747,0.0004329053,0.48339564,0.0012036012,0.0006158716,0.0006263462,0.0018729334,0.0027902103,0.04520503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99675745,0.000937182,0.0002175217,0.00069121266,0.0010316329,0.00036498343],"domain_scores_gemma":[0.99635494,0.001079838,0.00021163413,0.0015300565,0.00054878223,0.00027476964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002313861,0.00092885736,0.0014840432,0.0011679294,0.0018164442,0.0037851392,0.0021166317,0.0023274978,0.020731006],"category_scores_gemma":[0.007767182,0.0007207587,0.0007596203,0.0015628999,0.0016930125,0.00653324,0.006166966,0.003776947,0.009104125],"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.0015446141,0.00019886934,0.00044231914,0.00047379077,0.00008855532,0.0001928165,0.00040630848,0.02988709,0.012831402,0.52759075,0.071918614,0.35442483],"study_design_scores_gemma":[0.00023970575,0.00021913929,0.00012700602,0.00006853839,0.0000383501,0.00021378261,0.00009815368,0.20400941,0.022911066,0.7233136,0.048703946,0.000057348498],"about_ca_topic_score_codex":0.00044646428,"about_ca_topic_score_gemma":0.00050690136,"teacher_disagreement_score":0.020731006,"about_ca_system_score_codex":0.001279583,"about_ca_system_score_gemma":0.0017575109,"threshold_uncertainty_score":0.06935209},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33759877,0.0011394479,0.5704945,0.005525075,0.00029356717,0.00013545217,0.00021926087,0.0006585251,0.083935395],"genre_scores_gemma":[0.963841,0.00046349724,0.027518423,0.00033880316,0.00012533624,0.00007900879,0.000056651443,0.0000953839,0.0074819284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986312,0.00036699572,0.000042920776,0.00015822555,0.0005615658,0.00023901099],"domain_scores_gemma":[0.99679726,0.0014051469,0.0002698852,0.0012258317,0.00017657608,0.00012530711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018552567,0.00064812985,0.0011422618,0.0011643105,0.0011060328,0.0025142878,0.001553906,0.002052293,0.005680275],"category_scores_gemma":[0.005867405,0.00040168373,0.001042173,0.0007863198,0.00486092,0.009022471,0.002932076,0.00375245,0.00085420755],"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.000029307157,0.000018654042,0.00006553248,0.00001331537,0.000003740545,0.000045787765,0.000056428402,0.009689439,0.0007444644,0.98720944,0.00047699822,0.0016468762],"study_design_scores_gemma":[0.00001536348,0.000033130473,0.00004972164,0.000016436083,0.0000050739336,0.000066166576,0.000042834825,0.14702164,0.0012820397,0.850151,0.0013023325,0.000014283308],"about_ca_topic_score_codex":0.0007025339,"about_ca_topic_score_gemma":0.0007144589,"teacher_disagreement_score":0.005680275,"about_ca_system_score_codex":0.0016238511,"about_ca_system_score_gemma":0.0009519749,"threshold_uncertainty_score":0.019002378},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22012298,0.0041803676,0.64877164,0.001192439,0.0015183913,0.00044332206,0.0012332796,0.04436891,0.078168735],"genre_scores_gemma":[0.6143078,0.0011462499,0.33201626,0.00043798127,0.00022384053,0.00020164247,0.0028975946,0.0014853975,0.047283173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994425,0.00007124106,0.000033924374,0.00006270637,0.00029404223,0.00009550761],"domain_scores_gemma":[0.99946517,0.00010931979,0.0000459304,0.00012686315,0.00022051428,0.000032270582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045857488,0.0009879777,0.00041116378,0.0010769715,0.00055623945,0.0009833744,0.0008187984,0.00048821885,0.01462368],"category_scores_gemma":[0.0017951193,0.00039093057,0.00040314588,0.0009248265,0.00037456685,0.0017249133,0.0012086298,0.001013786,0.0076044365],"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.001808717,0.00039902568,0.0030757852,0.00038557916,0.00012517098,0.000459329,0.00026530697,0.017193766,0.14145255,0.0413096,0.05064017,0.742885],"study_design_scores_gemma":[0.00057921576,0.0012422048,0.0032971909,0.0002573303,0.00020836998,0.000879757,0.00017863566,0.22754106,0.53326726,0.03948514,0.19291554,0.00014827917],"about_ca_topic_score_codex":0.0016417791,"about_ca_topic_score_gemma":0.0034678616,"teacher_disagreement_score":0.01462368,"about_ca_system_score_codex":0.0005479008,"about_ca_system_score_gemma":0.0013970436,"threshold_uncertainty_score":0.04892105},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015428865,0.00084499957,0.969842,0.0011136659,0.00034414322,0.0002574315,0.0003372258,0.0021263536,0.009705289],"genre_scores_gemma":[0.47353828,0.0006397565,0.5124854,0.0007539942,0.00064510194,0.00036406433,0.00095625635,0.00039085865,0.0102263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9882509,0.004067362,0.0004972954,0.0026919204,0.0035807777,0.0009116987],"domain_scores_gemma":[0.96422577,0.01544789,0.0030338622,0.013678282,0.002868535,0.0007456663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007307245,0.0014292642,0.001701844,0.0017024623,0.0011521544,0.0026740374,0.003628654,0.0022404897,0.0069364863],"category_scores_gemma":[0.031072984,0.0006674283,0.0014001349,0.002499904,0.0044822716,0.006535075,0.0029847925,0.0025789237,0.0027474756],"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.002293779,0.00037054723,0.0073892153,0.0007400919,0.0002812188,0.00073336245,0.00044425484,0.08615007,0.015363612,0.4340596,0.028836403,0.42333785],"study_design_scores_gemma":[0.00018748455,0.00055517687,0.0016287768,0.000078570556,0.000115622584,0.0016110679,0.00012273359,0.38048968,0.030168474,0.5658146,0.019144863,0.000082933235],"about_ca_topic_score_codex":0.0021914511,"about_ca_topic_score_gemma":0.0012177982,"teacher_disagreement_score":0.007307245,"about_ca_system_score_codex":0.0021899992,"about_ca_system_score_gemma":0.003245536,"threshold_uncertainty_score":0.03864485},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10677027,0.0020728589,0.862488,0.0023114015,0.0004760109,0.00031011886,0.00020863538,0.001762329,0.023600494],"genre_scores_gemma":[0.92058045,0.0005665011,0.06834772,0.00040197943,0.00019697021,0.00009703996,0.00018105954,0.00014451718,0.009483757],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939215,0.0016368398,0.00026284065,0.00054972,0.0029010207,0.0007281643],"domain_scores_gemma":[0.9868036,0.005718835,0.0010796357,0.004659096,0.0012951057,0.00044375737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032918372,0.0009982887,0.0014760366,0.0012045675,0.001473877,0.002323399,0.0014850639,0.002951608,0.0047239396],"category_scores_gemma":[0.017294932,0.0006803417,0.0007129333,0.0011508595,0.0017110695,0.0069863508,0.008794454,0.0034153615,0.0027098402],"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.004139434,0.00056077616,0.006708966,0.00080718304,0.0005116044,0.0013960307,0.0012724577,0.12231873,0.10003878,0.3636067,0.020586682,0.37805265],"study_design_scores_gemma":[0.00018001265,0.0010871781,0.0012992766,0.00012277764,0.00017680501,0.002976629,0.0005212571,0.6041608,0.1143322,0.25851107,0.01653069,0.00010128001],"about_ca_topic_score_codex":0.00022824842,"about_ca_topic_score_gemma":0.000284307,"teacher_disagreement_score":0.0047239396,"about_ca_system_score_codex":0.00078763854,"about_ca_system_score_gemma":0.0012419831,"threshold_uncertainty_score":0.017409086},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39502954,0.0042900783,0.27504677,0.004106478,0.0018207496,0.00024269302,0.00066018006,0.00063929625,0.31816423],"genre_scores_gemma":[0.94190145,0.0009985217,0.023966994,0.0003109767,0.00063797634,0.000064021464,0.00022505317,0.00010655423,0.0317884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993368,0.00013544383,0.00004064815,0.00010899524,0.00026811,0.000109931425],"domain_scores_gemma":[0.99937916,0.00017488036,0.00010251872,0.00011561763,0.0001321138,0.000095563155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069325714,0.00057662826,0.00043100287,0.0013512933,0.00091859966,0.0019409234,0.00047879588,0.00044888543,0.009244793],"category_scores_gemma":[0.0019861753,0.00020529111,0.0007131515,0.0007617108,0.0032727772,0.0032072407,0.0020272774,0.0014963363,0.0016422708],"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.00002854627,0.00001408716,0.0001989206,0.000046526322,0.000004910287,0.00012309574,0.00023463133,0.0009061156,0.0011797189,0.9841372,0.0013707954,0.011755518],"study_design_scores_gemma":[0.000023980967,0.00005717512,0.00036545758,0.00002276352,0.000007219163,0.0003162924,0.0001258002,0.0047015906,0.0012770427,0.9743809,0.018706605,0.000015220452],"about_ca_topic_score_codex":0.0005233445,"about_ca_topic_score_gemma":0.0003743316,"teacher_disagreement_score":0.009244793,"about_ca_system_score_codex":0.0008954365,"about_ca_system_score_gemma":0.00055576535,"threshold_uncertainty_score":0.030926943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007203642,0.0013058897,0.978635,0.0010168678,0.0012794607,0.0006512504,0.0001294042,0.0018951918,0.007883216],"genre_scores_gemma":[0.22446598,0.0019379999,0.73716515,0.001487768,0.00065909274,0.00211988,0.0008204943,0.000367679,0.030975921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746037,0.0006126995,0.000268677,0.00037161182,0.0010915938,0.0001950386],"domain_scores_gemma":[0.99813086,0.00052305096,0.00023746885,0.00054882164,0.00033296607,0.00022681186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019570533,0.0007174309,0.000831531,0.0008773629,0.0008931243,0.0016020545,0.0018714045,0.0016015559,0.0035198862],"category_scores_gemma":[0.0030419247,0.00046773694,0.0006528585,0.00070116203,0.0014086659,0.0048934678,0.0039423364,0.003806056,0.0016879106],"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.00061882456,0.00033238492,0.00074920885,0.0014168832,0.00014212015,0.0026109167,0.000914683,0.013539982,0.10213129,0.4889712,0.026656665,0.36191586],"study_design_scores_gemma":[0.000492135,0.00089970214,0.0009763092,0.00026694982,0.00027606482,0.0073152003,0.00035468425,0.2862901,0.08310122,0.2212369,0.398421,0.00036973454],"about_ca_topic_score_codex":0.00039194894,"about_ca_topic_score_gemma":0.0004694029,"teacher_disagreement_score":0.0035198862,"about_ca_system_score_codex":0.0007201061,"about_ca_system_score_gemma":0.0011740363,"threshold_uncertainty_score":0.011775196},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054884512,0.0025494911,0.89524424,0.0010231368,0.00064406416,0.00014238882,0.00068919355,0.00430359,0.040519323],"genre_scores_gemma":[0.5332921,0.0016007705,0.43534842,0.00055102893,0.0005851531,0.00030667096,0.0019245277,0.0016018593,0.024789458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820566,0.00038345056,0.00015394346,0.00022294321,0.00076757825,0.0002664131],"domain_scores_gemma":[0.9960437,0.0018690649,0.00017893732,0.0012387305,0.0005320986,0.00013748535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020038215,0.0012718859,0.0011568344,0.0016890664,0.0010520277,0.003606275,0.0020204461,0.0010632758,0.021741616],"category_scores_gemma":[0.013354822,0.000639408,0.0009345676,0.0024877812,0.0011099068,0.0106460005,0.0037762886,0.0029656347,0.0052663726],"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.0004522854,0.00020588083,0.0012908371,0.0004591709,0.00006046844,0.00023387684,0.00044465126,0.012052051,0.004811877,0.66720384,0.018845119,0.29394],"study_design_scores_gemma":[0.00011415974,0.000092453345,0.0002858743,0.00012456569,0.000052170126,0.00026498825,0.00013161541,0.045216177,0.0061180387,0.92708087,0.020479266,0.000039704915],"about_ca_topic_score_codex":0.000831934,"about_ca_topic_score_gemma":0.0023478891,"teacher_disagreement_score":0.021741616,"about_ca_system_score_codex":0.0012237092,"about_ca_system_score_gemma":0.0012503351,"threshold_uncertainty_score":0.072732985},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012451407,0.0002242025,0.98120636,0.00022601588,0.00014498466,0.00027482334,0.000059415564,0.0012191817,0.0041935504],"genre_scores_gemma":[0.75105095,0.000250099,0.24073409,0.00024455233,0.00016820326,0.0005242075,0.00023846206,0.00011533593,0.0066740843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959837,0.0011854608,0.0002379213,0.00052550423,0.0015147188,0.00055259117],"domain_scores_gemma":[0.9935455,0.0021222078,0.0006113089,0.00220225,0.0011054057,0.00041340082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031377906,0.00080895994,0.00086160353,0.0010516479,0.0013005382,0.0017268206,0.0029937127,0.0016433296,0.0044584135],"category_scores_gemma":[0.006017116,0.0004811523,0.0009812284,0.00091093185,0.0029045963,0.0052358336,0.004200145,0.0023231315,0.0016619256],"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.0023344543,0.0004722737,0.002570068,0.0005821644,0.00032214375,0.0011710845,0.0010506207,0.07917277,0.068528466,0.7151031,0.00817122,0.1205216],"study_design_scores_gemma":[0.00031063144,0.00076587324,0.0006047349,0.00006816766,0.00019929273,0.0009292564,0.00014198381,0.7927818,0.0663348,0.114039965,0.023636358,0.00018718712],"about_ca_topic_score_codex":0.0005558486,"about_ca_topic_score_gemma":0.0004481859,"teacher_disagreement_score":0.0044584135,"about_ca_system_score_codex":0.0011743915,"about_ca_system_score_gemma":0.0014860939,"threshold_uncertainty_score":0.01659447},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32513526,0.0018355523,0.6276356,0.0022551178,0.000109515335,0.0003378471,0.0009278147,0.0011255638,0.04063769],"genre_scores_gemma":[0.73018956,0.0013699902,0.2561591,0.00030620926,0.00015257022,0.0003150307,0.0020853926,0.0002101581,0.009212018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866843,0.00040328014,0.00010741872,0.00033895852,0.00029696478,0.00018501654],"domain_scores_gemma":[0.9969337,0.0015448807,0.0004534525,0.00079356856,0.000111850975,0.00016255607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010377439,0.0006692516,0.00077902863,0.0010367276,0.0015869741,0.0031800068,0.0015289722,0.0014274367,0.0055186874],"category_scores_gemma":[0.008767871,0.0004418658,0.0010675474,0.0030081188,0.0017652359,0.0074032103,0.0025709635,0.0016666029,0.0008687724],"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.00038561746,0.00017973165,0.005090166,0.0003596898,0.0000686387,0.00025112455,0.00094039325,0.04459502,0.0043124408,0.77815545,0.00882343,0.15683834],"study_design_scores_gemma":[0.000069871436,0.0001027951,0.0009811141,0.00004866647,0.00004012831,0.00075246434,0.00031598445,0.1147669,0.0038992984,0.8682923,0.010707656,0.000022888004],"about_ca_topic_score_codex":0.0005287044,"about_ca_topic_score_gemma":0.00057170383,"teacher_disagreement_score":0.0055186874,"about_ca_system_score_codex":0.0018242786,"about_ca_system_score_gemma":0.0007125611,"threshold_uncertainty_score":0.018461823},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32308468,0.0015518701,0.60137326,0.0016816731,0.00086785696,0.00038773674,0.00077186624,0.005057957,0.06522309],"genre_scores_gemma":[0.8541589,0.00065133226,0.12640767,0.00028421308,0.00029108592,0.00021332037,0.0011033294,0.00030042167,0.016589718],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992637,0.00011027545,0.000052385156,0.0000985329,0.00032182323,0.00015319927],"domain_scores_gemma":[0.9988293,0.00031653573,0.00011159886,0.0005189659,0.00016907605,0.000054554348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050876936,0.0006039514,0.00046772958,0.0007217935,0.00051711715,0.0009435536,0.00053238176,0.00057784107,0.007986102],"category_scores_gemma":[0.0025951946,0.00018297431,0.00052981847,0.0010104413,0.00092610065,0.0027229942,0.0019198302,0.0009645651,0.0023207664],"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.002470532,0.00030835916,0.0027871602,0.00046375298,0.00012849321,0.0012368833,0.001146303,0.03681298,0.13734409,0.3763215,0.024820033,0.41615993],"study_design_scores_gemma":[0.00030943492,0.0013347716,0.0018921477,0.00015723366,0.00015316963,0.0037235313,0.00072525925,0.20973961,0.38251647,0.3111763,0.08811833,0.00015378305],"about_ca_topic_score_codex":0.0003616566,"about_ca_topic_score_gemma":0.00038728095,"teacher_disagreement_score":0.007986102,"about_ca_system_score_codex":0.00046350906,"about_ca_system_score_gemma":0.0005965982,"threshold_uncertainty_score":0.026716173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026173562,0.00038833136,0.9597203,0.0003155564,0.00012892664,0.00022432324,0.00018326618,0.0008816572,0.011984113],"genre_scores_gemma":[0.49732485,0.00047362712,0.4909623,0.00036424914,0.00008184093,0.0003194539,0.0005679654,0.00014467779,0.009760957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970354,0.00084360124,0.00024118785,0.00049941085,0.00091021525,0.0004702805],"domain_scores_gemma":[0.9967996,0.0006598764,0.0003797868,0.001553782,0.00032534337,0.00028160578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028030148,0.0004950372,0.00075697765,0.00094671163,0.0012097049,0.0019267576,0.0015819714,0.0014224288,0.0022470935],"category_scores_gemma":[0.0055430075,0.00053824286,0.0011286745,0.0013788267,0.0022876814,0.004570405,0.0061290287,0.0024858804,0.0010134121],"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.00007828374,0.00005325033,0.0004297168,0.00013070586,0.000025276458,0.00016974514,0.0003429427,0.0051409206,0.0055031236,0.9404323,0.0021756135,0.045518145],"study_design_scores_gemma":[0.00009829167,0.00026652662,0.00074460875,0.00014670048,0.00009844403,0.0013407329,0.00021543574,0.09660482,0.05237865,0.7426979,0.10526857,0.00013932955],"about_ca_topic_score_codex":0.00028611333,"about_ca_topic_score_gemma":0.00018244697,"teacher_disagreement_score":0.0028030148,"about_ca_system_score_codex":0.001184716,"about_ca_system_score_gemma":0.0018283353,"threshold_uncertainty_score":0.014823914},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29175386,0.001984538,0.68085986,0.00084138283,0.00024058939,0.00017862265,0.00016248491,0.00089858315,0.023080101],"genre_scores_gemma":[0.96163857,0.0004107857,0.03412375,0.00017654811,0.00006502838,0.00007397288,0.00006312716,0.00005542527,0.0033928757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869245,0.00036131367,0.00009296486,0.000167591,0.00042816313,0.00025761462],"domain_scores_gemma":[0.99715424,0.0015383976,0.00036188113,0.0006906133,0.0001764494,0.00007848794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014663264,0.0008043967,0.0006209624,0.0009536144,0.0006381685,0.0011954056,0.00050505466,0.0012116774,0.002466935],"category_scores_gemma":[0.0053356183,0.0002438647,0.00078557903,0.00063001824,0.0012945142,0.0036504897,0.0014418865,0.0013858678,0.00069318345],"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.0032194897,0.00022622978,0.004674133,0.00043192873,0.00030130806,0.0015911243,0.00060955965,0.06328142,0.13156997,0.5959745,0.005072645,0.19304772],"study_design_scores_gemma":[0.00015737077,0.0017448983,0.0020696593,0.00014073058,0.000175677,0.0037547897,0.00015231369,0.38065052,0.36634314,0.21745346,0.027249638,0.00010774686],"about_ca_topic_score_codex":0.00017182759,"about_ca_topic_score_gemma":0.00017157578,"teacher_disagreement_score":0.002466935,"about_ca_system_score_codex":0.0010118445,"about_ca_system_score_gemma":0.0004439997,"threshold_uncertainty_score":0.00825274},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13940005,0.0036274844,0.7756515,0.005932016,0.0011889181,0.0010894063,0.00026050076,0.0014519662,0.07139821],"genre_scores_gemma":[0.89354277,0.00062211376,0.09480156,0.00040906886,0.0002529943,0.00011777116,0.00011105755,0.00006228481,0.010080353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99495584,0.0014226153,0.00022670788,0.00045186392,0.002543187,0.00039982254],"domain_scores_gemma":[0.99281174,0.0021161386,0.0006756129,0.0019148509,0.0022603073,0.0002214642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034318522,0.0006409969,0.0004088643,0.0016469214,0.0012820703,0.0017261633,0.0011800848,0.0011807982,0.0040624174],"category_scores_gemma":[0.013504945,0.00036775146,0.00053935725,0.0008425311,0.0028972947,0.0041964273,0.0023549688,0.0022084897,0.0008572968],"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.0008986957,0.00009965235,0.002960882,0.0005164542,0.00006873524,0.00083873497,0.0011281666,0.011771253,0.049860198,0.77237946,0.009086717,0.15039109],"study_design_scores_gemma":[0.00014917963,0.0011306817,0.0034279458,0.000337693,0.00019911634,0.00449238,0.000600571,0.3210639,0.13884293,0.34556887,0.1840138,0.00017292386],"about_ca_topic_score_codex":0.00077568734,"about_ca_topic_score_gemma":0.00040033678,"teacher_disagreement_score":0.0040624174,"about_ca_system_score_codex":0.0025357567,"about_ca_system_score_gemma":0.0016493803,"threshold_uncertainty_score":0.018398345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006538489,0.00065870717,0.86651653,0.0006557594,0.00034394627,0.00075433985,0.00093531894,0.11067651,0.01292043],"genre_scores_gemma":[0.38443208,0.0011176373,0.5446509,0.0027728227,0.00047510274,0.0028408314,0.006230209,0.015387737,0.042092726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933821,0.002036054,0.0006494234,0.000956602,0.0022044596,0.0007713746],"domain_scores_gemma":[0.99115,0.002830081,0.0006268078,0.003916866,0.00090743747,0.0005688374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066453577,0.0017138385,0.0018427435,0.0022991758,0.0017629192,0.005008447,0.0064039337,0.0028242639,0.030410029],"category_scores_gemma":[0.016453445,0.0017739588,0.0020476435,0.0012716196,0.0036783603,0.011563544,0.01260618,0.0058152876,0.016871555],"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.004985975,0.0007560411,0.0036092927,0.0017805989,0.00041501163,0.0013064763,0.0013646083,0.03462189,0.03824813,0.5432471,0.12602596,0.24363898],"study_design_scores_gemma":[0.00055229524,0.00055805984,0.00058200775,0.0003517965,0.00016643463,0.0008802309,0.00018348676,0.44117874,0.05651168,0.3342197,0.1644962,0.00031926768],"about_ca_topic_score_codex":0.0011926277,"about_ca_topic_score_gemma":0.0013249662,"teacher_disagreement_score":0.030410029,"about_ca_system_score_codex":0.0023977912,"about_ca_system_score_gemma":0.0040162266,"threshold_uncertainty_score":0.10173166},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8500824,0.0013867441,0.089026645,0.0011240231,0.00011224124,0.00022906058,0.00055632007,0.00036200852,0.057120487],"genre_scores_gemma":[0.9670659,0.00083039555,0.021819733,0.0000964244,0.000056232588,0.000063802145,0.00054443296,0.000065600514,0.009457535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988569,0.00020938381,0.00006715261,0.0001793688,0.00039475798,0.00029242958],"domain_scores_gemma":[0.99709165,0.0012256982,0.00073725515,0.00055824756,0.00018033088,0.00020675844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010526894,0.0011097593,0.00078738836,0.0020684868,0.001315679,0.0020741404,0.00062820537,0.0011781731,0.009704187],"category_scores_gemma":[0.0059282132,0.00034011743,0.00082626357,0.0014661715,0.0020265942,0.004350915,0.0021244697,0.0018970718,0.0020690802],"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.0012423428,0.00024281882,0.006612234,0.0006807827,0.000065554734,0.0009528116,0.0010881326,0.055390432,0.049809515,0.815807,0.004070243,0.064038135],"study_design_scores_gemma":[0.00019201494,0.00028088118,0.0030983037,0.00021046701,0.00004999774,0.0016226382,0.00040056024,0.1058016,0.08327258,0.790827,0.014152252,0.000091704795],"about_ca_topic_score_codex":0.0002783466,"about_ca_topic_score_gemma":0.00041001104,"teacher_disagreement_score":0.009704187,"about_ca_system_score_codex":0.0013714972,"about_ca_system_score_gemma":0.0005649651,"threshold_uncertainty_score":0.03246367},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26495025,0.005210377,0.484719,0.013435584,0.0031777883,0.00066388136,0.0013896121,0.0169293,0.20952421],"genre_scores_gemma":[0.8836326,0.00064113736,0.039981134,0.0014194982,0.000174264,0.00009674078,0.00052470976,0.0008427206,0.07268725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984561,0.00034476127,0.000048433158,0.00019603444,0.000708096,0.0002465035],"domain_scores_gemma":[0.99798965,0.0006166507,0.00017926707,0.00077458774,0.00027766355,0.00016209259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001285297,0.00067087426,0.0004677222,0.0005776326,0.0015280902,0.0016359315,0.0008854509,0.0015214897,0.019433491],"category_scores_gemma":[0.00645339,0.00039621885,0.00036790856,0.0005222632,0.0017235202,0.003544251,0.0029880207,0.0017145707,0.0059291073],"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.003732055,0.00022845117,0.008705652,0.0004847743,0.00016279289,0.0031968737,0.0034059442,0.010437471,0.035647195,0.54001456,0.104133174,0.28985107],"study_design_scores_gemma":[0.00023310549,0.0010221547,0.003325707,0.00033190928,0.00015539462,0.005791818,0.0011607455,0.12151259,0.11737025,0.20748453,0.5413778,0.00023394085],"about_ca_topic_score_codex":0.00092434237,"about_ca_topic_score_gemma":0.000914985,"teacher_disagreement_score":0.019433491,"about_ca_system_score_codex":0.00082660647,"about_ca_system_score_gemma":0.0006890177,"threshold_uncertainty_score":0.0650115},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07706588,0.0004012883,0.9032946,0.002095467,0.00014441682,0.00050710666,0.00028242747,0.0057867467,0.010421976],"genre_scores_gemma":[0.6884526,0.00027204244,0.3034952,0.0005354471,0.00009985526,0.0004808761,0.00056922267,0.0012856302,0.004809169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9900181,0.004278705,0.00047469267,0.0012129658,0.0030683281,0.0009471024],"domain_scores_gemma":[0.9741262,0.013030736,0.0014723678,0.009586295,0.0013080596,0.0004763936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006534276,0.0010516408,0.0011228246,0.0007846757,0.0009811644,0.0033307518,0.0024297312,0.0019095442,0.008682854],"category_scores_gemma":[0.032703537,0.00085294695,0.0014571582,0.0007196863,0.0027593237,0.010341335,0.0044898316,0.003245723,0.00247673],"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.0022250551,0.0006090714,0.009036974,0.0012946662,0.0005633554,0.00065233896,0.00081527524,0.116352625,0.09990819,0.4598833,0.014846061,0.29381314],"study_design_scores_gemma":[0.00017759828,0.00036988547,0.001043395,0.000120687786,0.00011585099,0.0005489817,0.00020539161,0.53456205,0.07997659,0.37414393,0.008651984,0.000083691004],"about_ca_topic_score_codex":0.00056641473,"about_ca_topic_score_gemma":0.00083068915,"teacher_disagreement_score":0.008682854,"about_ca_system_score_codex":0.0017487154,"about_ca_system_score_gemma":0.0025628947,"threshold_uncertainty_score":0.034556985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11698669,0.005716104,0.802182,0.0025795554,0.0016173758,0.0006375951,0.0005351596,0.0027696833,0.06697596],"genre_scores_gemma":[0.5961442,0.0025197533,0.36074302,0.000760571,0.0009525615,0.00036714887,0.00093303685,0.00025479312,0.03732492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986513,0.0002892006,0.0001214366,0.00020426682,0.00054645794,0.00018731799],"domain_scores_gemma":[0.9982595,0.00040178432,0.00012494103,0.0008288984,0.0002725298,0.00011233411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001291591,0.0007451177,0.00066828215,0.00079664344,0.0011411182,0.002275458,0.0012727155,0.0010960073,0.0101102535],"category_scores_gemma":[0.003863723,0.00042279172,0.00047988468,0.0010359397,0.0010641904,0.0043500704,0.002725768,0.0026837054,0.0034778505],"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.001034504,0.00041847455,0.00042331193,0.00038336235,0.00005321056,0.00039821048,0.00047118813,0.0050493153,0.05540851,0.619326,0.015170784,0.30186304],"study_design_scores_gemma":[0.00069527794,0.0011330748,0.00078626187,0.00021545865,0.00014237723,0.004463743,0.00025742318,0.08158539,0.1138476,0.64224416,0.1544628,0.00016643551],"about_ca_topic_score_codex":0.0001267067,"about_ca_topic_score_gemma":0.00032234646,"teacher_disagreement_score":0.0101102535,"about_ca_system_score_codex":0.00079482584,"about_ca_system_score_gemma":0.0009882239,"threshold_uncertainty_score":0.03382218},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16135228,0.00022445574,0.80950624,0.0004805956,0.00007921532,0.00012458055,0.00032351675,0.0006871044,0.027222075],"genre_scores_gemma":[0.6608696,0.00026986175,0.32848495,0.00019795015,0.000052912128,0.00017023637,0.00066718535,0.00025169502,0.009035578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924076,0.00017751218,0.00007739979,0.0001382854,0.00026321056,0.000102754006],"domain_scores_gemma":[0.9985001,0.00048688342,0.00026888837,0.0004374786,0.00024034479,0.00006629146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075535197,0.00034644658,0.00024293156,0.0008275581,0.00067923125,0.00153792,0.0006665727,0.0005699247,0.0027079582],"category_scores_gemma":[0.004897452,0.00022507508,0.00051822985,0.0010608364,0.0013680552,0.0030152118,0.0014158572,0.0011365121,0.00076273136],"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.00009841111,0.000028343804,0.00061292807,0.000059824757,0.000006698481,0.00008611578,0.0002440316,0.0028233198,0.008092801,0.9294358,0.0013773823,0.057134334],"study_design_scores_gemma":[0.00003909938,0.00014442325,0.000534905,0.000069481706,0.000029111165,0.0008038943,0.0001899161,0.03541421,0.03473819,0.9008941,0.027084848,0.00005777489],"about_ca_topic_score_codex":0.00021655667,"about_ca_topic_score_gemma":0.00028486483,"teacher_disagreement_score":0.0027079582,"about_ca_system_score_codex":0.0006842933,"about_ca_system_score_gemma":0.00072187366,"threshold_uncertainty_score":0.009059012},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.275311,0.0009251219,0.70984757,0.0007628799,0.00013617125,0.00032479464,0.00025896318,0.00048981665,0.011943657],"genre_scores_gemma":[0.93388957,0.00047528194,0.06109139,0.00028791203,0.00012597225,0.00017494951,0.00015354737,0.00005907918,0.0037423521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954587,0.001256451,0.0002458798,0.00077182584,0.0015658514,0.00070127513],"domain_scores_gemma":[0.9925922,0.0027947593,0.0011986912,0.0026576065,0.00053307536,0.00022378903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025113237,0.0009825652,0.0009567965,0.0009991651,0.0012069264,0.0018479228,0.0012132532,0.0014411549,0.0019337474],"category_scores_gemma":[0.008438331,0.0005325487,0.0014266913,0.0014270418,0.0032815414,0.006101077,0.0033078745,0.0022358703,0.0004635469],"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.001103077,0.00010986648,0.0036545128,0.00028127548,0.00030881702,0.0011868852,0.0009260084,0.053551238,0.044741914,0.8288336,0.0026939171,0.062609024],"study_design_scores_gemma":[0.00014105829,0.00049328327,0.0015102105,0.00005884044,0.00011338223,0.0027036485,0.0001785094,0.28484565,0.048600312,0.6454119,0.015847616,0.000095617106],"about_ca_topic_score_codex":0.00038490692,"about_ca_topic_score_gemma":0.00028190663,"teacher_disagreement_score":0.0025113237,"about_ca_system_score_codex":0.0012783026,"about_ca_system_score_gemma":0.00070740934,"threshold_uncertainty_score":0.013281286},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11375897,0.0019027968,0.82018024,0.0027299812,0.00095946714,0.00046687998,0.0016254488,0.0040386985,0.054337513],"genre_scores_gemma":[0.6995713,0.0007439851,0.27670413,0.00057271053,0.00030793287,0.00031358944,0.0027015768,0.00047984486,0.018604903],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841857,0.0002579407,0.00007926338,0.00015772622,0.00089847075,0.0001880638],"domain_scores_gemma":[0.99729604,0.0007689459,0.00012299455,0.0013531679,0.00037822896,0.00008056823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009122012,0.00044947307,0.00052197353,0.00088698056,0.0006003707,0.0012358816,0.0009234617,0.0008002509,0.010643158],"category_scores_gemma":[0.006022643,0.00028544472,0.00039584356,0.0010872502,0.00078972743,0.0032017939,0.0027901665,0.001658827,0.0036396992],"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.0010183309,0.0002102886,0.0011722683,0.00040577547,0.00007243819,0.0004991692,0.0006218097,0.022932542,0.07193774,0.41946262,0.02323779,0.4584293],"study_design_scores_gemma":[0.00021350503,0.00033722285,0.0011035994,0.00013032941,0.00004260846,0.0014404135,0.00045744627,0.31684932,0.17524679,0.42270476,0.08139352,0.00008048751],"about_ca_topic_score_codex":0.00027973638,"about_ca_topic_score_gemma":0.000428569,"teacher_disagreement_score":0.010643158,"about_ca_system_score_codex":0.0006688579,"about_ca_system_score_gemma":0.0010059836,"threshold_uncertainty_score":0.035604894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056162786,0.00063991296,0.93651044,0.0013512402,0.00013109509,0.0001609564,0.00009943672,0.00036549324,0.00457856],"genre_scores_gemma":[0.8894175,0.00032820075,0.10670292,0.00029613107,0.00012363042,0.0001223174,0.00008441257,0.00006744824,0.0028574208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9824786,0.006744521,0.0016528538,0.0029297199,0.004645718,0.0015486442],"domain_scores_gemma":[0.93967843,0.032113604,0.0059519624,0.018315474,0.0029636552,0.0009768411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010028046,0.000829556,0.001626035,0.0009378559,0.0019732877,0.003480476,0.0026162597,0.0034058688,0.0025657755],"category_scores_gemma":[0.041833606,0.0008959127,0.0010834773,0.0018181873,0.007820379,0.016072193,0.00778107,0.004880382,0.0007627495],"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.0007828972,0.000103604965,0.0019903472,0.0003626045,0.00007829834,0.0006719992,0.0011771523,0.028203953,0.005767986,0.91101205,0.0025857582,0.047263328],"study_design_scores_gemma":[0.00010203731,0.00020004321,0.0005128706,0.00008609858,0.000068835056,0.0010967372,0.00019689395,0.21414553,0.011879123,0.76420313,0.007414595,0.00009410424],"about_ca_topic_score_codex":0.00060517754,"about_ca_topic_score_gemma":0.0003564043,"teacher_disagreement_score":0.010028046,"about_ca_system_score_codex":0.0029376405,"about_ca_system_score_gemma":0.0015504807,"threshold_uncertainty_score":0.053034008},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025642607,0.0011028275,0.9629814,0.0001623396,0.00016624929,0.00016023543,0.00015559103,0.003720632,0.005908138],"genre_scores_gemma":[0.13861358,0.0005912549,0.84998626,0.00007857174,0.00008802748,0.00018032102,0.00037382162,0.0006529132,0.00943523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992663,0.00011050451,0.000066833396,0.000113701964,0.0003697202,0.00007286321],"domain_scores_gemma":[0.9987883,0.00025724628,0.00010189002,0.0005467265,0.00026563572,0.00004018256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007683533,0.0008553361,0.00080487586,0.0011416924,0.00055258686,0.0009797502,0.0011311038,0.0006848146,0.0072544897],"category_scores_gemma":[0.0033264917,0.00035103425,0.00090980594,0.0010643211,0.0004551267,0.0027023263,0.0011207077,0.001216993,0.003030136],"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.0005280156,0.00011560191,0.0012623095,0.00039112655,0.000076661105,0.00019331614,0.00033121055,0.01899056,0.07037989,0.06313282,0.0055458364,0.8390528],"study_design_scores_gemma":[0.00030415147,0.0009389651,0.0039788918,0.00027323983,0.00018115959,0.0020644816,0.0002595256,0.45439467,0.26417568,0.10474818,0.16839784,0.00028318958],"about_ca_topic_score_codex":0.0010056457,"about_ca_topic_score_gemma":0.001997167,"teacher_disagreement_score":0.0072544897,"about_ca_system_score_codex":0.0006233425,"about_ca_system_score_gemma":0.0010411935,"threshold_uncertainty_score":0.024268687},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008035493,0.01973195,0.35559276,0.15085384,0.005191448,0.00008284161,0.00035355208,0.0006987305,0.45945942],"genre_scores_gemma":[0.7799264,0.014007326,0.08974586,0.03594471,0.0069823423,0.0004189487,0.00056500634,0.0011533694,0.07125605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953359,0.0026310515,0.00012207,0.0004281802,0.001112478,0.0003703803],"domain_scores_gemma":[0.99549234,0.002862163,0.00021871638,0.0008133067,0.0004440614,0.00016943422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046580825,0.0009906561,0.00095179625,0.0019119057,0.0026127882,0.006181344,0.0021777237,0.004797489,0.016922638],"category_scores_gemma":[0.00936196,0.00052330334,0.0017176365,0.0014619408,0.019030793,0.019983083,0.0037521734,0.015184648,0.0030580405],"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.000004817306,0.0000037482027,0.000012537252,0.00002554881,0.0000020895798,0.0000075340213,0.00005038549,0.00012030007,0.00005541199,0.9961622,0.0023032308,0.001252271],"study_design_scores_gemma":[0.0000036540698,0.000005674834,0.00002042503,0.000029375939,0.0000024227454,0.000016681397,0.0000386509,0.0003590074,0.00009858422,0.98955274,0.009869984,0.0000027516182],"about_ca_topic_score_codex":0.001073249,"about_ca_topic_score_gemma":0.00067906326,"teacher_disagreement_score":0.016922638,"about_ca_system_score_codex":0.004527772,"about_ca_system_score_gemma":0.0013091548,"threshold_uncertainty_score":0.056611836},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17740452,0.005533079,0.7129168,0.02358104,0.0011848711,0.0005279374,0.00053799583,0.00079850684,0.07751529],"genre_scores_gemma":[0.7920761,0.0016484249,0.18524654,0.0013978826,0.00052442844,0.00025322146,0.00039407806,0.00008992129,0.018369414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99166685,0.0032185155,0.00043507392,0.0009897888,0.0030855038,0.0006042762],"domain_scores_gemma":[0.98548234,0.006915058,0.0018531793,0.0041434634,0.000945541,0.0006602798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061563635,0.0006457123,0.0009408,0.0010800358,0.0034684946,0.0036863552,0.0017775199,0.0026105684,0.0076593584],"category_scores_gemma":[0.020422485,0.0007751701,0.00084392517,0.0027584212,0.0066801673,0.017164277,0.00856675,0.0057967473,0.0017758582],"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.00046228833,0.00007075183,0.0007449331,0.00017361756,0.000039185124,0.00022995326,0.00040541615,0.007998627,0.0016856833,0.9324987,0.0052262056,0.050464656],"study_design_scores_gemma":[0.00007410755,0.000106886386,0.00032985708,0.0000506288,0.000019682027,0.00050580135,0.00023381962,0.04039392,0.0063745542,0.931567,0.02030698,0.000036855832],"about_ca_topic_score_codex":0.0008561552,"about_ca_topic_score_gemma":0.0006931141,"teacher_disagreement_score":0.0076593584,"about_ca_system_score_codex":0.0021917848,"about_ca_system_score_gemma":0.0031596348,"threshold_uncertainty_score":0.03255838},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013482023,0.0007351594,0.9576919,0.0043791896,0.00029599978,0.00026316452,0.0003128985,0.0006325056,0.022207145],"genre_scores_gemma":[0.453556,0.0012429071,0.52097607,0.001751191,0.0010784247,0.00059585646,0.0013467493,0.0005675355,0.018885287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9892151,0.003681225,0.0005278226,0.0020582483,0.0035518245,0.0009658267],"domain_scores_gemma":[0.9664972,0.02470038,0.0013726642,0.0054799537,0.0010881962,0.00086155836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065182424,0.00087051134,0.0012201796,0.0012417176,0.0028571752,0.006123971,0.003680799,0.0024914441,0.018501822],"category_scores_gemma":[0.03250105,0.00084025745,0.0023377824,0.001603283,0.007568898,0.020180874,0.01121019,0.011109853,0.002282129],"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.000045078417,0.000054711756,0.00013021054,0.00016190534,0.000025660229,0.000049740473,0.00019991421,0.0060798037,0.00043673356,0.9774779,0.0026806593,0.012657574],"study_design_scores_gemma":[0.000038628088,0.000018214574,0.000041380717,0.00003457033,0.000013937445,0.00007041568,0.00006325808,0.03205818,0.0010383886,0.9599182,0.0066887303,0.000016211103],"about_ca_topic_score_codex":0.00096512586,"about_ca_topic_score_gemma":0.0012986152,"teacher_disagreement_score":0.018501822,"about_ca_system_score_codex":0.0044016987,"about_ca_system_score_gemma":0.0032624153,"threshold_uncertainty_score":0.061894774},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087906696,0.00036534853,0.8885933,0.0030699633,0.00017123327,0.00027942442,0.00036950113,0.0011072023,0.018137252],"genre_scores_gemma":[0.95517415,0.00023995328,0.038744822,0.0006840504,0.00016371338,0.00024660034,0.00032137084,0.00016738393,0.004257864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.986233,0.003559339,0.0008471576,0.0030815753,0.004559707,0.0017191145],"domain_scores_gemma":[0.95871055,0.025177283,0.0023056562,0.009464762,0.003244055,0.0010977233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007652664,0.0010309416,0.001370937,0.0015685068,0.0020318707,0.0047882884,0.0033568686,0.0026457414,0.0049393135],"category_scores_gemma":[0.032060772,0.00092338247,0.003328916,0.001187884,0.01387422,0.014030779,0.0072098738,0.007862031,0.000761176],"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.00014758806,0.000066848384,0.00063373917,0.00011571334,0.000057191428,0.00016714512,0.00043784518,0.01914107,0.0021109825,0.97085166,0.0007117646,0.0055584214],"study_design_scores_gemma":[0.00005342983,0.00005884444,0.000151659,0.00002958424,0.000047831203,0.00013662223,0.00006343316,0.09176675,0.004128226,0.9019198,0.0016176892,0.00002612703],"about_ca_topic_score_codex":0.001927107,"about_ca_topic_score_gemma":0.0014091791,"teacher_disagreement_score":0.007652664,"about_ca_system_score_codex":0.003989996,"about_ca_system_score_gemma":0.003244256,"threshold_uncertainty_score":0.040471673},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11753978,0.0004908007,0.8210494,0.0017142167,0.0005579669,0.0010261496,0.0005490844,0.00487198,0.05220064],"genre_scores_gemma":[0.9217991,0.00017915695,0.058381002,0.00040624267,0.00021002757,0.00034715483,0.00038233894,0.00022904211,0.018065978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959253,0.0016876134,0.00025255114,0.00048821673,0.0011865966,0.00045974844],"domain_scores_gemma":[0.99454874,0.001878512,0.00069686567,0.0021082088,0.0004992484,0.00026836246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002377557,0.000495918,0.000547025,0.0007043375,0.001047907,0.0021720892,0.0011738585,0.0009214648,0.0090190945],"category_scores_gemma":[0.006237241,0.00031434145,0.00052744243,0.0005884497,0.0024620874,0.003128769,0.0027089757,0.0019194065,0.0021131088],"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.003011399,0.00035623435,0.0057429206,0.00041081817,0.00018257402,0.0013389783,0.0009829063,0.049721755,0.06347233,0.63321054,0.028392423,0.21317722],"study_design_scores_gemma":[0.0005529818,0.0011430256,0.0024321107,0.00013972419,0.00018027656,0.0019516612,0.00038025438,0.45777312,0.1316047,0.29344434,0.11024543,0.00015233946],"about_ca_topic_score_codex":0.00033480485,"about_ca_topic_score_gemma":0.00033328417,"teacher_disagreement_score":0.0090190945,"about_ca_system_score_codex":0.0006654936,"about_ca_system_score_gemma":0.00071129174,"threshold_uncertainty_score":0.03017193},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51760197,0.0014147292,0.4329706,0.0011622986,0.00034825754,0.00028684855,0.00040317504,0.0010725087,0.044739656],"genre_scores_gemma":[0.9793388,0.00019037444,0.015291299,0.00012400241,0.000040411436,0.000044177796,0.00011369881,0.000044888988,0.004812309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767166,0.0005445276,0.00010236094,0.0003669465,0.00089393475,0.0004206154],"domain_scores_gemma":[0.9982095,0.0006401416,0.00028546707,0.0006421753,0.00012545426,0.0000972658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094940973,0.00058325817,0.00065364264,0.0006223574,0.000549961,0.0010353744,0.0007671396,0.00077994226,0.0032702878],"category_scores_gemma":[0.0035738323,0.00033041945,0.00084419624,0.00042894302,0.0017145796,0.0033356007,0.002861538,0.0014184985,0.00085575227],"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.0024576653,0.00024379,0.0051648356,0.00056001556,0.00032196,0.0027951982,0.0011472498,0.06906458,0.11307344,0.70116514,0.0073036496,0.09670249],"study_design_scores_gemma":[0.00024579882,0.0013466929,0.003245165,0.0001501286,0.00017367887,0.0058282926,0.00029865012,0.36753994,0.23635031,0.33561122,0.049014736,0.00019544548],"about_ca_topic_score_codex":0.00022869716,"about_ca_topic_score_gemma":0.0002478543,"teacher_disagreement_score":0.0032702878,"about_ca_system_score_codex":0.00095329917,"about_ca_system_score_gemma":0.0006690316,"threshold_uncertainty_score":0.010940254},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049980983,0.0002682678,0.92032576,0.0005576364,0.00035551842,0.0003254192,0.00015582828,0.0015146619,0.02651597],"genre_scores_gemma":[0.6928563,0.00039068816,0.28098068,0.000402075,0.00019420071,0.000409699,0.0005401461,0.00063064974,0.02359563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765414,0.0006526189,0.00015122781,0.00029686835,0.0010150021,0.00023021034],"domain_scores_gemma":[0.9969735,0.00096043217,0.00028907013,0.0014250461,0.0002594937,0.00009245872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014870832,0.0006625213,0.00048950914,0.0009447267,0.0008312818,0.0018764953,0.00096235424,0.00069838174,0.0077629862],"category_scores_gemma":[0.005227091,0.0003039316,0.0005333656,0.0007536393,0.0015588698,0.0058311,0.0033405614,0.0019553069,0.0015850359],"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.000461511,0.0001179242,0.0010337618,0.00027720438,0.000057815087,0.00029249635,0.000597169,0.026225844,0.056667574,0.7356799,0.004020799,0.17456792],"study_design_scores_gemma":[0.00015311794,0.00079952483,0.000820142,0.0001646337,0.00010439914,0.0008531746,0.00044957193,0.15240657,0.28035802,0.40596995,0.1577938,0.00012717152],"about_ca_topic_score_codex":0.00028379975,"about_ca_topic_score_gemma":0.00030910893,"teacher_disagreement_score":0.0077629862,"about_ca_system_score_codex":0.0010744695,"about_ca_system_score_gemma":0.0006367229,"threshold_uncertainty_score":0.025969803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051943464,0.00039226245,0.9864305,0.00074014877,0.00006187292,0.00018807358,0.00009521248,0.0005872484,0.0063103703],"genre_scores_gemma":[0.36373827,0.0010351918,0.6224583,0.0006797025,0.00023594876,0.0007884278,0.000340347,0.00046788124,0.010255956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99445385,0.0020766922,0.0002866599,0.000829821,0.0016472841,0.0007057246],"domain_scores_gemma":[0.9921159,0.0032889738,0.00033418112,0.003822194,0.0002977615,0.00014086935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00567321,0.0009588197,0.0011703226,0.00091332826,0.0015750277,0.003770671,0.003189366,0.00265767,0.0055318004],"category_scores_gemma":[0.012210307,0.0010075258,0.00238971,0.0013498688,0.005354832,0.013113605,0.006847989,0.008036323,0.0016059399],"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.00009545482,0.00005661528,0.0001692869,0.00016754585,0.000035437384,0.00011505938,0.00022897658,0.023289869,0.0036694033,0.9398867,0.0019995382,0.03028612],"study_design_scores_gemma":[0.0000595672,0.00008211215,0.000120553595,0.00006698361,0.000054585245,0.00020327934,0.000042669482,0.15304233,0.009065061,0.8209784,0.016247796,0.000036710848],"about_ca_topic_score_codex":0.0007661526,"about_ca_topic_score_gemma":0.0007490434,"teacher_disagreement_score":0.00567321,"about_ca_system_score_codex":0.0027427503,"about_ca_system_score_gemma":0.0020878161,"threshold_uncertainty_score":0.03000319},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03971419,0.00072589325,0.93621653,0.00031847507,0.0004388939,0.00012261675,0.0002634671,0.001750031,0.020449763],"genre_scores_gemma":[0.28113374,0.00041622907,0.7015134,0.00021287089,0.00023214883,0.00017563031,0.0006836397,0.00071581616,0.014916525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886084,0.00020077074,0.00008284384,0.00018556911,0.00057862705,0.0000913759],"domain_scores_gemma":[0.9988147,0.0002970635,0.00012494091,0.00042982062,0.00025532782,0.00007830728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089706114,0.00070170214,0.0004914796,0.00097604486,0.00065742084,0.0019123717,0.00077794143,0.00054267765,0.012224042],"category_scores_gemma":[0.004203012,0.00031202595,0.00053044327,0.000904998,0.0012415602,0.0035931126,0.001881328,0.0014559736,0.005240482],"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.00036648783,0.00006327111,0.0010643766,0.000521503,0.000028506232,0.00023167017,0.00035877075,0.013339792,0.039522927,0.7127073,0.012463556,0.21933183],"study_design_scores_gemma":[0.00007545139,0.0003323384,0.00091079605,0.0002290122,0.000043708285,0.000885825,0.00021162802,0.18521646,0.091352634,0.5635904,0.1570596,0.00009206587],"about_ca_topic_score_codex":0.00026594943,"about_ca_topic_score_gemma":0.0005871217,"teacher_disagreement_score":0.012224042,"about_ca_system_score_codex":0.0007146162,"about_ca_system_score_gemma":0.0007719028,"threshold_uncertainty_score":0.040893495},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004530626,0.000066923385,0.97167957,0.00034630424,0.0000984503,0.00029702976,0.00016707845,0.018060086,0.0047539407],"genre_scores_gemma":[0.22309637,0.00030994648,0.74999124,0.00082899554,0.00019130207,0.0008864779,0.0013129787,0.0069377883,0.016444879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99005336,0.0032628006,0.0006781405,0.0009676302,0.0041464395,0.0008916361],"domain_scores_gemma":[0.976782,0.010138855,0.0016246755,0.009210059,0.0018203086,0.00042400186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009384496,0.0010262629,0.00082325,0.0013981216,0.001552538,0.0040314323,0.003639113,0.0014168635,0.015746145],"category_scores_gemma":[0.036445625,0.0014281486,0.0016067007,0.00084309845,0.0037150136,0.010419576,0.010116273,0.004892409,0.005812446],"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.001178119,0.00036166524,0.003584169,0.0010779962,0.00016516558,0.0008408287,0.0008123015,0.022673344,0.034844734,0.4723174,0.047682278,0.41446203],"study_design_scores_gemma":[0.0003343175,0.00048395776,0.0015226011,0.00031500743,0.00014437365,0.0019067168,0.00018242223,0.36343738,0.16312546,0.33890936,0.12942886,0.00020954762],"about_ca_topic_score_codex":0.00064927235,"about_ca_topic_score_gemma":0.0008858188,"teacher_disagreement_score":0.015746145,"about_ca_system_score_codex":0.0011785299,"about_ca_system_score_gemma":0.0036606863,"threshold_uncertainty_score":0.05267608},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10398521,0.019556105,0.756785,0.008221656,0.0017224918,0.00025895535,0.00065322017,0.0030282005,0.1057892],"genre_scores_gemma":[0.9517289,0.0027701838,0.028902464,0.0015164415,0.00049754145,0.00009093297,0.00032020663,0.00010673076,0.014066611],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99634475,0.00072547956,0.00023418889,0.00041833016,0.0017323304,0.0005448769],"domain_scores_gemma":[0.9898873,0.00282896,0.0008943034,0.0047406517,0.001482822,0.00016586266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025515277,0.0006903043,0.0005658204,0.0008456358,0.0015603051,0.0023602704,0.0018026455,0.0024958053,0.006644593],"category_scores_gemma":[0.009739415,0.00038011186,0.0007572063,0.00093444285,0.0018054707,0.0053415555,0.0023657975,0.0021984933,0.003064461],"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.0013506284,0.000099020624,0.012581074,0.0016478054,0.0005475627,0.0016534663,0.0016294437,0.023741053,0.114537895,0.25212273,0.020366183,0.5697231],"study_design_scores_gemma":[0.00009006309,0.0017471886,0.008387983,0.00067120296,0.00078542624,0.013711501,0.0009354203,0.14111796,0.37927043,0.14516906,0.30782375,0.00029009907],"about_ca_topic_score_codex":0.0012674237,"about_ca_topic_score_gemma":0.0007078835,"teacher_disagreement_score":0.006644593,"about_ca_system_score_codex":0.0012979024,"about_ca_system_score_gemma":0.0011349369,"threshold_uncertainty_score":0.02222842},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056833522,0.00043829883,0.98498213,0.0003352976,0.00012249837,0.00021417074,0.000109860666,0.00056286925,0.00755146],"genre_scores_gemma":[0.49065948,0.0012397214,0.48212704,0.00032572987,0.00024883114,0.00062660786,0.0007615352,0.00015959174,0.023851465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99494606,0.0014761877,0.00035539008,0.000685064,0.0020699613,0.00046747568],"domain_scores_gemma":[0.99589705,0.0010152047,0.0005127893,0.0018720558,0.0005575851,0.00014531259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022095954,0.00072047644,0.0010154471,0.0010769402,0.0011315471,0.002073625,0.0023523185,0.0020375524,0.0059102704],"category_scores_gemma":[0.006132164,0.00067205174,0.00092606357,0.0015690902,0.0017994479,0.008246133,0.004886623,0.0023356115,0.004151502],"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.00041008194,0.00023846081,0.0005651604,0.00049541926,0.000100217396,0.0008230096,0.0005318038,0.00854194,0.037410006,0.8171025,0.009055356,0.124726065],"study_design_scores_gemma":[0.00033797525,0.00046523393,0.0005475637,0.00017935612,0.0001469848,0.0050847023,0.0002291505,0.33524585,0.071711004,0.4863135,0.09954049,0.00019822341],"about_ca_topic_score_codex":0.00019586024,"about_ca_topic_score_gemma":0.00018796761,"teacher_disagreement_score":0.0059102704,"about_ca_system_score_codex":0.0007132812,"about_ca_system_score_gemma":0.0011686599,"threshold_uncertainty_score":0.019771874},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04698002,0.00026890886,0.8966199,0.0021243582,0.00037158825,0.00044262194,0.00030198126,0.0017991046,0.05109162],"genre_scores_gemma":[0.8313611,0.00035564767,0.14706105,0.00079883105,0.0002006648,0.00041088177,0.00048263624,0.00036712337,0.018962016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99435896,0.0019043064,0.00036144085,0.0007883099,0.0018943286,0.0006927336],"domain_scores_gemma":[0.99386483,0.0020139604,0.0007361525,0.002451456,0.00072935247,0.0002043218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003713985,0.00061053474,0.00049282337,0.00055536797,0.001599899,0.0030920825,0.0016407501,0.0013897357,0.00613824],"category_scores_gemma":[0.007976131,0.0003463043,0.00094877003,0.0005084128,0.0033649157,0.008562333,0.0058935406,0.002958367,0.0011962815],"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.00031104044,0.00010163335,0.0005582189,0.00023566885,0.00004828364,0.00021926878,0.0005159679,0.021105662,0.009183906,0.92527115,0.0054211766,0.037028033],"study_design_scores_gemma":[0.000075702395,0.00024484424,0.0004640415,0.0001527777,0.000093180206,0.000557155,0.0004823256,0.19071405,0.06391705,0.68050385,0.062716454,0.000078540244],"about_ca_topic_score_codex":0.00059897784,"about_ca_topic_score_gemma":0.0004662968,"teacher_disagreement_score":0.00613824,"about_ca_system_score_codex":0.0017311663,"about_ca_system_score_gemma":0.0015443005,"threshold_uncertainty_score":0.020534456},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018798439,0.00079257094,0.93329513,0.0013809835,0.00024929314,0.00045580504,0.00043810392,0.0017742194,0.042815387],"genre_scores_gemma":[0.72697425,0.0007859557,0.2439999,0.0007582544,0.00026501354,0.00089480716,0.0008804432,0.0004928661,0.024948513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99189126,0.0026276933,0.00033030607,0.0007740463,0.0032711686,0.0011055435],"domain_scores_gemma":[0.9918555,0.0018785695,0.0003710188,0.004861884,0.0007812916,0.00025164936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005160365,0.0010522873,0.0014579472,0.0013228328,0.0013107206,0.004527563,0.0032745216,0.0020068886,0.0073825098],"category_scores_gemma":[0.011123088,0.0006134406,0.0012255494,0.0020911123,0.0032259522,0.008842631,0.007656489,0.0039677164,0.0035642446],"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.0005366439,0.00018472645,0.00036538515,0.00018147772,0.00008208123,0.0001945732,0.00023678821,0.014625028,0.00685077,0.92600805,0.011041035,0.039693423],"study_design_scores_gemma":[0.0002951354,0.000131797,0.0002772358,0.00008226631,0.00010198643,0.00050082663,0.000096492906,0.23485719,0.032423716,0.6891029,0.04203912,0.000091351554],"about_ca_topic_score_codex":0.00095379795,"about_ca_topic_score_gemma":0.0009028362,"teacher_disagreement_score":0.0073825098,"about_ca_system_score_codex":0.0021359134,"about_ca_system_score_gemma":0.003287769,"threshold_uncertainty_score":0.02729094},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018736934,0.09597323,0.097210586,0.39579487,0.012579988,0.00010782607,0.00035050712,0.000546615,0.37869948],"genre_scores_gemma":[0.6564228,0.111824706,0.08952103,0.03472706,0.015756812,0.00025300216,0.0003118082,0.00044690835,0.09073582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962411,0.0015904292,0.00017755695,0.00041732,0.001362168,0.00021146772],"domain_scores_gemma":[0.99569356,0.0021146291,0.00032574066,0.0008188144,0.00070093904,0.00034639024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006097721,0.00073700206,0.0004798156,0.0014797272,0.002619305,0.006595177,0.00067248195,0.0038243204,0.005003115],"category_scores_gemma":[0.012444617,0.00048655257,0.0003562134,0.0017637132,0.014322787,0.018628722,0.0035880152,0.009461317,0.00293736],"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.000026113532,0.000009901441,0.00007901126,0.000037358743,0.0000024102162,0.000045841472,0.0002351034,0.00025461987,0.00010934711,0.9709141,0.0120312,0.016254788],"study_design_scores_gemma":[0.000014334869,0.00002127745,0.00010197779,0.00012385659,0.0000018875537,0.00017062732,0.00013700839,0.0008154058,0.00018735812,0.866078,0.13233653,0.000011686778],"about_ca_topic_score_codex":0.0006325467,"about_ca_topic_score_gemma":0.0005763582,"teacher_disagreement_score":0.006595177,"about_ca_system_score_codex":0.004713092,"about_ca_system_score_gemma":0.0019269264,"threshold_uncertainty_score":0.03419602},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50720197,0.0007261245,0.4456545,0.0011526705,0.00023988666,0.00033690385,0.00034489937,0.0016108315,0.042732283],"genre_scores_gemma":[0.9595272,0.00008955639,0.034979526,0.00019408726,0.00007175246,0.000100595644,0.00018465953,0.00009214332,0.0047604977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962662,0.0006001418,0.00014974191,0.0006497248,0.0016669906,0.000667239],"domain_scores_gemma":[0.99288297,0.003431213,0.00075656414,0.0020897943,0.00049294153,0.0003465518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030269383,0.0004376088,0.00081500446,0.0011492874,0.0011153128,0.002555916,0.0014707429,0.0014198762,0.0061190366],"category_scores_gemma":[0.009607211,0.0004209352,0.0007595935,0.0006038777,0.0033563375,0.0045241453,0.003949398,0.0032430335,0.0013391179],"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.0010482187,0.00013434894,0.0018741469,0.00010315833,0.000038694558,0.00026391487,0.00047020032,0.009235147,0.02019949,0.9220707,0.0017702235,0.042791817],"study_design_scores_gemma":[0.00016950234,0.0005874356,0.001663022,0.0000756523,0.00008330345,0.0010322966,0.00018987272,0.15218611,0.10064205,0.72714865,0.016107444,0.00011465362],"about_ca_topic_score_codex":0.00020993753,"about_ca_topic_score_gemma":0.00021192597,"teacher_disagreement_score":0.0061190366,"about_ca_system_score_codex":0.0014694583,"about_ca_system_score_gemma":0.0012184109,"threshold_uncertainty_score":0.020470262},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45458466,0.0007161326,0.5256814,0.0015146119,0.00017512035,0.00018010447,0.00039015926,0.0021440482,0.014613745],"genre_scores_gemma":[0.8676566,0.00021925231,0.126396,0.0001047605,0.000114308474,0.000037108442,0.00047598497,0.00012475702,0.0048711263],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989222,0.00017518993,0.00006819987,0.00020022129,0.00044226926,0.00019184288],"domain_scores_gemma":[0.99742895,0.0012595911,0.00025118006,0.0005750452,0.0002612335,0.00022410238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015105696,0.0007762822,0.0010279949,0.0013145681,0.00077394117,0.0026656548,0.0012353543,0.00087561127,0.004715808],"category_scores_gemma":[0.009376273,0.00027667312,0.0007683951,0.0014086135,0.0015523658,0.0048628626,0.002205217,0.0020433879,0.000910047],"study_design_candidate":"not_applicable","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.0011926986,0.00048418442,0.02391113,0.00075618445,0.0001704543,0.0013800671,0.001232887,0.33272573,0.024722932,0.2653007,0.012961576,0.33516148],"study_design_scores_gemma":[0.00012523135,0.00013489259,0.0015076015,0.0000280361,0.000025325971,0.00021727987,0.00021095992,0.7053831,0.012662165,0.27663428,0.0030452267,0.000025850712],"about_ca_topic_score_codex":0.0015229152,"about_ca_topic_score_gemma":0.003031437,"teacher_disagreement_score":0.004715808,"about_ca_system_score_codex":0.0017055236,"about_ca_system_score_gemma":0.0013979605,"threshold_uncertainty_score":0.015775919},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026124239,0.0083324,0.88060206,0.00593983,0.0007241969,0.00030688092,0.00044482204,0.00045285086,0.07707284],"genre_scores_gemma":[0.76817244,0.006660383,0.1986754,0.0016955648,0.0011892767,0.00039519335,0.0005101161,0.00017865107,0.02252307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99187016,0.0025141211,0.00058752036,0.0013647723,0.0030602415,0.0006030819],"domain_scores_gemma":[0.9889148,0.0049201394,0.0008153891,0.003960917,0.00097143085,0.00041733705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044436837,0.0010979056,0.0010707128,0.0016762703,0.0014312956,0.004739283,0.0018720913,0.0025301496,0.005367823],"category_scores_gemma":[0.012921026,0.0006788724,0.001863266,0.0026261916,0.006167735,0.014405885,0.0063841,0.007854826,0.0019179855],"study_design_candidate":"not_applicable","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.00005033699,0.000027890976,0.00021449898,0.00012157938,0.000020086854,0.00014711879,0.00014145765,0.0035692772,0.0012224972,0.9828005,0.0010490713,0.01063568],"study_design_scores_gemma":[0.00003192034,0.00008483418,0.00029416702,0.00014439068,0.00003277709,0.0010542913,0.00007343957,0.035020553,0.0051405975,0.92217773,0.03590351,0.000041864285],"about_ca_topic_score_codex":0.0004964664,"about_ca_topic_score_gemma":0.00027503778,"teacher_disagreement_score":0.005367823,"about_ca_system_score_codex":0.0031841025,"about_ca_system_score_gemma":0.0014171773,"threshold_uncertainty_score":0.02350074},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5392758,0.00047965068,0.4106659,0.0005040593,0.00045984105,0.0003335189,0.00033205934,0.006050339,0.041898802],"genre_scores_gemma":[0.88321674,0.00012341297,0.10828974,0.00013726832,0.00005685099,0.00014684025,0.0003838461,0.00030532625,0.0073400736],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922884,0.00017265418,0.00005928737,0.000116726784,0.0002553,0.00016720418],"domain_scores_gemma":[0.9988902,0.0002472199,0.00011831156,0.00049179094,0.00018796252,0.000064572574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010347861,0.0006485444,0.00052231096,0.0005382944,0.00066113827,0.000999414,0.0007973828,0.0006279441,0.011549361],"category_scores_gemma":[0.0025748217,0.000327818,0.00037253805,0.00066212605,0.0008352148,0.0026315814,0.0017130474,0.0012049485,0.0027248866],"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.0034842258,0.0015007695,0.012520564,0.0008440452,0.00019046436,0.00090339995,0.0011786934,0.060784124,0.24102561,0.2524247,0.016475828,0.4086676],"study_design_scores_gemma":[0.00066221313,0.0021877661,0.0026266978,0.000115325325,0.00010185513,0.00093820767,0.00030743008,0.28098977,0.4837148,0.16118294,0.06706296,0.00011005763],"about_ca_topic_score_codex":0.00018167672,"about_ca_topic_score_gemma":0.00026004284,"teacher_disagreement_score":0.011549361,"about_ca_system_score_codex":0.00047152885,"about_ca_system_score_gemma":0.0006456871,"threshold_uncertainty_score":0.038636446},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2590344,0.00045174442,0.71656615,0.0009232541,0.00012213517,0.00081402453,0.00024171824,0.0012523606,0.020594178],"genre_scores_gemma":[0.5680384,0.00008266832,0.42689377,0.0001934507,0.00001850888,0.00017862063,0.00033014518,0.00017072959,0.0040937136],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983908,0.00049848645,0.00009066952,0.00026752686,0.0005046642,0.00024788672],"domain_scores_gemma":[0.99600875,0.002010091,0.00033915532,0.0008885543,0.00046368354,0.00028987782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018478428,0.00058272225,0.0007667358,0.001119599,0.001274773,0.0010669393,0.0012909847,0.0011416733,0.006947963],"category_scores_gemma":[0.009055349,0.00047251378,0.0006893231,0.0010639481,0.0017501228,0.0017278551,0.0033287166,0.0011848249,0.0010088917],"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.00243129,0.00121875,0.013138056,0.00081992755,0.00017999295,0.0020406158,0.0020676216,0.16210617,0.042416748,0.29855114,0.01256663,0.46246305],"study_design_scores_gemma":[0.00043143058,0.0013833251,0.0015470264,0.0001546524,0.00013349084,0.001512516,0.001322614,0.6391617,0.025511682,0.30662495,0.022108529,0.000108145214],"about_ca_topic_score_codex":0.0008160725,"about_ca_topic_score_gemma":0.0014989246,"teacher_disagreement_score":0.006947963,"about_ca_system_score_codex":0.0008620187,"about_ca_system_score_gemma":0.0023801075,"threshold_uncertainty_score":0.023243248},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12431191,0.001046629,0.83799726,0.0007541481,0.000206146,0.00022020916,0.0001587118,0.005403797,0.029901244],"genre_scores_gemma":[0.5560959,0.0004159053,0.43451166,0.00022146801,0.00012977372,0.00018556991,0.0003016964,0.00026406313,0.0078740055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987587,0.00020823837,0.00009808934,0.00017536715,0.000564008,0.00019562872],"domain_scores_gemma":[0.9988716,0.0003116989,0.00013287032,0.0004458519,0.0001718514,0.00006610245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007028453,0.0009130486,0.00057700125,0.0008785433,0.00066069333,0.0015956768,0.0013575429,0.00061033457,0.0071973647],"category_scores_gemma":[0.002499733,0.00033242296,0.0005677084,0.00084246736,0.00097604905,0.0028444768,0.001798619,0.0015594043,0.0032122203],"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.0016335426,0.00035460867,0.0029958768,0.00054926367,0.00008618214,0.00058702193,0.00065515947,0.024422128,0.13211824,0.33227432,0.008735851,0.49558783],"study_design_scores_gemma":[0.00066903955,0.0014052032,0.0018354759,0.00023783775,0.00010627535,0.00246159,0.00024840064,0.32555497,0.2806324,0.32454515,0.062136777,0.00016682126],"about_ca_topic_score_codex":0.00038330109,"about_ca_topic_score_gemma":0.00063520216,"teacher_disagreement_score":0.0071973647,"about_ca_system_score_codex":0.0010293042,"about_ca_system_score_gemma":0.0008862148,"threshold_uncertainty_score":0.024077535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002050722,0.0006489294,0.96949446,0.0029332016,0.00023332535,0.00024823478,0.00021244171,0.00026287968,0.02391582],"genre_scores_gemma":[0.27122754,0.0018942396,0.70338184,0.0026549944,0.0008813818,0.0019574189,0.00058450835,0.00032222745,0.017095828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99064785,0.0040662577,0.000588408,0.0017878929,0.0021785793,0.00073089637],"domain_scores_gemma":[0.98960054,0.00483755,0.00086123514,0.0033200516,0.00072624726,0.0006544762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009035475,0.0014033788,0.001146314,0.0018255936,0.0036342612,0.006770501,0.0055961628,0.004246177,0.008007205],"category_scores_gemma":[0.014076235,0.001238615,0.0028342353,0.002044203,0.012391724,0.016166162,0.008878591,0.013901634,0.0019930066],"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.000003171989,0.000007723906,0.00001724731,0.000019374314,0.0000032454584,0.000018839917,0.00007146208,0.00063665706,0.00010486029,0.99775594,0.00037179765,0.0009897355],"study_design_scores_gemma":[0.000012116587,0.000016474612,0.000037518206,0.00004175782,0.000010520118,0.00008343058,0.000051236137,0.0077913664,0.00032319454,0.9756723,0.015942523,0.000017479546],"about_ca_topic_score_codex":0.0013261548,"about_ca_topic_score_gemma":0.0012305107,"teacher_disagreement_score":0.009035475,"about_ca_system_score_codex":0.004641324,"about_ca_system_score_gemma":0.0039890697,"threshold_uncertainty_score":0.047784686},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31284356,0.011505547,0.56250566,0.0042862436,0.0014123215,0.0005602401,0.004559105,0.05725571,0.04507156],"genre_scores_gemma":[0.77558,0.0011482218,0.2009583,0.0007926471,0.00034304278,0.00026131223,0.0039147544,0.0017365365,0.0152652],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99761117,0.00044210898,0.0002129595,0.0003667635,0.00097102945,0.00039591672],"domain_scores_gemma":[0.99155676,0.0015315705,0.00033251094,0.0052970997,0.00088939327,0.0003926403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016912259,0.00081233337,0.0014878637,0.0016995489,0.0010878682,0.0022314803,0.0036144827,0.00121374,0.008978892],"category_scores_gemma":[0.011019556,0.0004809187,0.00064101187,0.0029373555,0.001263655,0.008985972,0.0049472256,0.0019143022,0.0042858673],"study_design_candidate":"bench_or_experimental","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.0036705274,0.0015249129,0.006831208,0.0008699446,0.00035605874,0.00035951912,0.0005555711,0.09006902,0.07084277,0.09103597,0.13678002,0.59710455],"study_design_scores_gemma":[0.00076383096,0.0011778952,0.0015112184,0.00010239954,0.00018841507,0.0007507678,0.00041099373,0.7414713,0.0677498,0.13088536,0.054855835,0.00013216879],"about_ca_topic_score_codex":0.0018337483,"about_ca_topic_score_gemma":0.0036082768,"teacher_disagreement_score":0.008978892,"about_ca_system_score_codex":0.0012937826,"about_ca_system_score_gemma":0.0022379253,"threshold_uncertainty_score":0.030037403},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03992916,0.002403751,0.8916509,0.0033422448,0.0005055994,0.00014678392,0.0006250504,0.0004261573,0.060970385],"genre_scores_gemma":[0.92568004,0.0021564646,0.0477124,0.00071002665,0.0004473756,0.00043358983,0.0004906749,0.00013431147,0.022235138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956754,0.0014789394,0.00016492358,0.00067057816,0.0014605144,0.0005497217],"domain_scores_gemma":[0.98081857,0.014395162,0.0013073775,0.0022881057,0.0008842068,0.00030658775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003101458,0.0011605275,0.0013477004,0.0008965356,0.001315203,0.003638119,0.0016333394,0.0028846764,0.008844462],"category_scores_gemma":[0.018782387,0.000657403,0.00071581133,0.0013598301,0.003565796,0.0069053657,0.0035282266,0.003553924,0.002065081],"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.00028920476,0.00003911673,0.00043642716,0.00036691283,0.00006713482,0.0002515167,0.00013527105,0.08144043,0.0049718427,0.8902339,0.004462515,0.01730574],"study_design_scores_gemma":[0.000074092415,0.000079360485,0.00033531588,0.00014463712,0.00005598115,0.00052573526,0.00008076721,0.30906457,0.008610894,0.6691868,0.011789311,0.00005261435],"about_ca_topic_score_codex":0.0004117307,"about_ca_topic_score_gemma":0.00035345124,"teacher_disagreement_score":0.008844462,"about_ca_system_score_codex":0.0018535067,"about_ca_system_score_gemma":0.0015607377,"threshold_uncertainty_score":0.029587686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03974199,0.0005621183,0.952461,0.00058623333,0.0000688319,0.00004130853,0.000078679135,0.00015722876,0.0063026687],"genre_scores_gemma":[0.922265,0.00071896403,0.06894396,0.00035332856,0.0002355025,0.00013924082,0.00011263459,0.00006661316,0.007164692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754226,0.0007706111,0.00007981698,0.00050414866,0.0008690587,0.00023416779],"domain_scores_gemma":[0.9935343,0.003740068,0.0007501052,0.001333697,0.00047077434,0.00017108285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023821013,0.00087404327,0.0009568877,0.0013684807,0.0007837614,0.0014406163,0.0013964775,0.0019022984,0.0029698801],"category_scores_gemma":[0.0067538954,0.00037236654,0.0012745393,0.0012836929,0.0020613433,0.0041296477,0.0016507768,0.0026606433,0.0005527905],"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.00020534683,0.00007563487,0.001970202,0.000107622735,0.00006754857,0.00025353543,0.00017659226,0.08055553,0.009355751,0.8833165,0.0010475401,0.022868179],"study_design_scores_gemma":[0.00002527732,0.00012946426,0.0005116613,0.000023354905,0.000029483635,0.0003067391,0.000027043478,0.7457665,0.005107823,0.2456171,0.0024242718,0.00003114449],"about_ca_topic_score_codex":0.0007276422,"about_ca_topic_score_gemma":0.00042118746,"teacher_disagreement_score":0.0029698801,"about_ca_system_score_codex":0.0017199004,"about_ca_system_score_gemma":0.0007663271,"threshold_uncertainty_score":0.0125979185},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38422525,0.005033484,0.503761,0.004163214,0.00058403943,0.000873423,0.0007584827,0.0013459304,0.099255174],"genre_scores_gemma":[0.90314656,0.0013343063,0.08614582,0.00035375208,0.00029249387,0.0005262869,0.00030207404,0.000318538,0.0075800098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97673833,0.011185657,0.0016715726,0.002008344,0.005174307,0.003221764],"domain_scores_gemma":[0.91824836,0.0498228,0.005717999,0.022662655,0.0025475887,0.0010006926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022028422,0.0015585137,0.0017720043,0.0029917108,0.0024201504,0.006610691,0.0030112439,0.0028782221,0.008122595],"category_scores_gemma":[0.049936622,0.00121973,0.0016172003,0.002623902,0.005814965,0.02314096,0.008907801,0.006171334,0.001916522],"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.0024095385,0.00023607389,0.005079459,0.00034108103,0.00016290566,0.00044676353,0.00075978634,0.028147522,0.012435702,0.8907379,0.003021348,0.056221955],"study_design_scores_gemma":[0.0003229213,0.0007917849,0.0019778395,0.0002507803,0.00028736368,0.0012317122,0.00042700925,0.14054917,0.03984739,0.79686004,0.017230429,0.00022357801],"about_ca_topic_score_codex":0.00041866416,"about_ca_topic_score_gemma":0.0003273945,"teacher_disagreement_score":0.022028422,"about_ca_system_score_codex":0.0043273643,"about_ca_system_score_gemma":0.00391329,"threshold_uncertainty_score":0.11649877},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038312607,0.006218432,0.9177925,0.003543886,0.00042093656,0.00016033869,0.0009029943,0.000990082,0.03165828],"genre_scores_gemma":[0.8880284,0.0043553845,0.094603896,0.0013075927,0.0011798186,0.0004845102,0.00089657825,0.00039805,0.008745863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99251384,0.0023238792,0.0003178213,0.0013899901,0.0021117835,0.0013425893],"domain_scores_gemma":[0.9534851,0.0364909,0.0026321504,0.0044748816,0.0016756003,0.0012414381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00873248,0.0021823477,0.0024046437,0.0029915771,0.0013477934,0.004911072,0.004088631,0.003255563,0.009946045],"category_scores_gemma":[0.055127513,0.0015359992,0.002633036,0.00251574,0.0055241776,0.012817509,0.0060992646,0.0067389035,0.0024321054],"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.0010120706,0.00016859206,0.0018782074,0.00095431606,0.0002218137,0.0004998787,0.0003916098,0.14828116,0.0039664716,0.7928701,0.011119577,0.038636073],"study_design_scores_gemma":[0.00006223775,0.00009050058,0.0007326657,0.0001233968,0.000055535183,0.00038324358,0.000043051015,0.29004437,0.0027651307,0.70342463,0.0022177275,0.000057553374],"about_ca_topic_score_codex":0.0007256475,"about_ca_topic_score_gemma":0.00090865156,"teacher_disagreement_score":0.009946045,"about_ca_system_score_codex":0.0049955607,"about_ca_system_score_gemma":0.0025667287,"threshold_uncertainty_score":0.046182334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030491606,0.00032259655,0.9942614,0.00020397335,0.00011011462,0.00016583549,0.000033655808,0.0004863492,0.0013669566],"genre_scores_gemma":[0.1000797,0.0005887772,0.8930273,0.00023748487,0.0001387232,0.00043284122,0.00024255857,0.00016223306,0.0050904946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969631,0.000671652,0.00024155616,0.00042636358,0.0014505482,0.00024680505],"domain_scores_gemma":[0.9962955,0.00091906835,0.0003845611,0.0017776855,0.0005071798,0.000116018855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026359917,0.0010128828,0.0010177579,0.0011473901,0.00086494273,0.0014899295,0.0042526806,0.0022276063,0.0038233537],"category_scores_gemma":[0.00737962,0.0006142363,0.0016677657,0.0009796984,0.0014131503,0.006580735,0.0032789258,0.0041696327,0.0015541406],"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.0007690345,0.00035810712,0.00088379945,0.0010372772,0.00024904625,0.00030220705,0.000660959,0.08127775,0.03698813,0.46585426,0.009934375,0.401685],"study_design_scores_gemma":[0.00029493708,0.000714097,0.00086380664,0.00014872433,0.00022090398,0.0014204569,0.00013808982,0.72418207,0.04904081,0.14326757,0.07946794,0.00024051363],"about_ca_topic_score_codex":0.0005625868,"about_ca_topic_score_gemma":0.0007329118,"teacher_disagreement_score":0.0042526806,"about_ca_system_score_codex":0.0015444314,"about_ca_system_score_gemma":0.0014492873,"threshold_uncertainty_score":0.013940573},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33413482,0.001187787,0.6271971,0.0012828155,0.00053163385,0.0003116204,0.00046001442,0.0015897545,0.03330449],"genre_scores_gemma":[0.8543722,0.00034512262,0.1358158,0.0003683016,0.00027315665,0.0001019349,0.0003698706,0.00018446097,0.008169139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936014,0.00012292442,0.00005558744,0.00013105856,0.00024525676,0.00008497779],"domain_scores_gemma":[0.9986816,0.0005416282,0.00015957787,0.00036833613,0.00017586358,0.000073101335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006640004,0.00043187002,0.00042378757,0.000857133,0.00058064045,0.0011103806,0.0005214785,0.00055571506,0.007931452],"category_scores_gemma":[0.0047828336,0.00016803235,0.0005627262,0.00074996334,0.0013532909,0.0026206581,0.0013917291,0.0011675245,0.001212831],"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.00060635555,0.00012753747,0.0016548753,0.00032527067,0.00004005184,0.00046464385,0.0005995714,0.014160779,0.031775538,0.6993752,0.0076815905,0.24318855],"study_design_scores_gemma":[0.0001222528,0.00047017698,0.00083646184,0.0000982044,0.00005557758,0.001125649,0.00023654771,0.08654,0.046137433,0.8380569,0.026259,0.00006182809],"about_ca_topic_score_codex":0.00020428785,"about_ca_topic_score_gemma":0.0003040513,"teacher_disagreement_score":0.007931452,"about_ca_system_score_codex":0.0005689144,"about_ca_system_score_gemma":0.00037077785,"threshold_uncertainty_score":0.026533306},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023679253,0.040335562,0.66547877,0.039361585,0.0038148842,0.00017656322,0.0007356685,0.00048218513,0.22593556],"genre_scores_gemma":[0.6245473,0.07542627,0.20650041,0.021704154,0.021058561,0.0006084167,0.0014568624,0.0005243597,0.04817372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99565554,0.0013288964,0.00023439633,0.0007562871,0.0016704211,0.00035435174],"domain_scores_gemma":[0.9852356,0.011023791,0.000584018,0.0019331104,0.0009522179,0.00027133705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059659784,0.0011747087,0.0012100247,0.0021050412,0.0030305162,0.0046435804,0.0023278932,0.0039077476,0.014960893],"category_scores_gemma":[0.018268365,0.0011419011,0.0019400351,0.0030345025,0.011922232,0.020061681,0.0055082478,0.0106636025,0.0032436287],"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.00001753112,0.00002255052,0.0001160203,0.00014584078,0.0000130295875,0.00006708019,0.00016411055,0.0013986543,0.00022072687,0.9885471,0.0029861655,0.0063013225],"study_design_scores_gemma":[0.000012824296,0.00002544066,0.000113741604,0.00006325441,0.000008172753,0.00015245717,0.000049694147,0.002506385,0.00033063703,0.97788906,0.018833121,0.000015281386],"about_ca_topic_score_codex":0.0009860359,"about_ca_topic_score_gemma":0.00059547205,"teacher_disagreement_score":0.014960893,"about_ca_system_score_codex":0.0026788216,"about_ca_system_score_gemma":0.0013878404,"threshold_uncertainty_score":0.050049126},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047787905,0.0037136488,0.8757813,0.0015118936,0.000743942,0.00026699287,0.0012345554,0.00050425704,0.06845549],"genre_scores_gemma":[0.64100134,0.0042482237,0.29225785,0.0014980009,0.0012099766,0.0007849544,0.0022217776,0.00046924318,0.056308623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984434,0.00051323575,0.00006290344,0.0002720983,0.00044965438,0.00025878093],"domain_scores_gemma":[0.99515593,0.0026661393,0.0005756793,0.0008013573,0.0005536856,0.00024726082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013842876,0.001038453,0.000946948,0.0011463446,0.0009838683,0.0019264807,0.0016228341,0.0015930549,0.010161434],"category_scores_gemma":[0.0071120188,0.0005591801,0.00089599413,0.0018331716,0.0019875017,0.0031470084,0.0015901006,0.0022892177,0.0019545048],"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.00015725181,0.00006665647,0.00059042673,0.00019692312,0.000035827296,0.000105787636,0.00006652742,0.059471916,0.0015960339,0.89933014,0.010416752,0.027965732],"study_design_scores_gemma":[0.000083860534,0.00016457801,0.0003708821,0.0000712314,0.00003761834,0.00048249846,0.00006338443,0.335972,0.002884642,0.63096404,0.028846508,0.00005875725],"about_ca_topic_score_codex":0.0016169493,"about_ca_topic_score_gemma":0.0016121654,"teacher_disagreement_score":0.010161434,"about_ca_system_score_codex":0.0018746129,"about_ca_system_score_gemma":0.0015373973,"threshold_uncertainty_score":0.033993363},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011262259,0.0056254854,0.72157216,0.009520965,0.0016955117,0.00025918923,0.0017510172,0.0019084523,0.24640505],"genre_scores_gemma":[0.56372756,0.0063770288,0.2840775,0.0049683964,0.0021578034,0.000794406,0.0033824148,0.0012879863,0.13322699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9903064,0.0021989213,0.00062986935,0.0024478813,0.0035289314,0.0008880456],"domain_scores_gemma":[0.98507106,0.0068375613,0.001298038,0.004461557,0.0016879212,0.00064382795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037226866,0.0015687309,0.0014681722,0.0024855186,0.0030881092,0.00655996,0.003398739,0.0037279408,0.036420234],"category_scores_gemma":[0.020461164,0.0010229738,0.0015407234,0.0037630694,0.005209447,0.015145003,0.008046125,0.007851954,0.014418353],"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.00011967511,0.000039676295,0.0003294861,0.00019930194,0.000020962125,0.0001126708,0.00020842292,0.0033656333,0.00084967964,0.9382415,0.018180566,0.03833239],"study_design_scores_gemma":[0.00003721466,0.0000484583,0.00018305439,0.00013579935,0.000041100462,0.00052960153,0.00009055163,0.020026475,0.0032298667,0.8508333,0.12480336,0.000041211224],"about_ca_topic_score_codex":0.0012453527,"about_ca_topic_score_gemma":0.00082201656,"teacher_disagreement_score":0.036420234,"about_ca_system_score_codex":0.003985962,"about_ca_system_score_gemma":0.001899239,"threshold_uncertainty_score":0.121837795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047869172,0.003539077,0.7329692,0.003808807,0.00097269693,0.00051599497,0.002569131,0.0016964521,0.20605943],"genre_scores_gemma":[0.8014333,0.0017865413,0.11790324,0.0011494346,0.00044360105,0.00054305646,0.003879723,0.0002528498,0.0726082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982874,0.00039326673,0.00015249931,0.00023869412,0.0006425,0.00028574158],"domain_scores_gemma":[0.99880564,0.00029603226,0.00014723427,0.00043000776,0.00024238553,0.000078621975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008792212,0.00041353385,0.0006723993,0.0006809378,0.0011914014,0.0021968987,0.00082639384,0.000755044,0.012892747],"category_scores_gemma":[0.0020385212,0.00018306958,0.0005071031,0.0014494584,0.0011440514,0.0043520206,0.00287474,0.0021316956,0.005365489],"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.0005500384,0.00012787714,0.0006036921,0.0001923895,0.000023662791,0.00029761504,0.00025809192,0.003984296,0.005191719,0.8838756,0.022008253,0.08288669],"study_design_scores_gemma":[0.00013762988,0.00013078215,0.0006619275,0.000092564725,0.00003176055,0.0018500185,0.00014622719,0.057398994,0.019380402,0.6763984,0.24371812,0.000053194803],"about_ca_topic_score_codex":0.00050450326,"about_ca_topic_score_gemma":0.00040102913,"teacher_disagreement_score":0.012892747,"about_ca_system_score_codex":0.0011855972,"about_ca_system_score_gemma":0.000895105,"threshold_uncertainty_score":0.043130577},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088986084,0.0006968774,0.8650012,0.0020216478,0.00018119004,0.00015523107,0.00024561977,0.00060013233,0.042112056],"genre_scores_gemma":[0.87227964,0.0006317066,0.11243095,0.00047807072,0.00010591577,0.00021728755,0.00020233156,0.00023357615,0.013420425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99689937,0.00090571376,0.00022816854,0.0005154997,0.0009324479,0.0005188145],"domain_scores_gemma":[0.9953479,0.0023212377,0.00036619572,0.0013226185,0.0004094609,0.00023263723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002624406,0.0006715254,0.00077629037,0.0007657763,0.00077970076,0.0028002625,0.0017527913,0.0016140853,0.00607451],"category_scores_gemma":[0.0074651856,0.0005102166,0.0010716787,0.00062835595,0.0050651236,0.008932161,0.0046661743,0.003885126,0.0014031911],"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.000042561835,0.000015875781,0.0000784067,0.000034221644,0.0000037871434,0.000054190492,0.000096452546,0.002489807,0.0013489545,0.99253947,0.00028223248,0.0030140148],"study_design_scores_gemma":[0.00004261815,0.000063529325,0.00010271488,0.000053650027,0.000016210464,0.00021427535,0.000049715785,0.07930622,0.014293337,0.89802533,0.007793837,0.000038640344],"about_ca_topic_score_codex":0.00048720927,"about_ca_topic_score_gemma":0.0004263505,"teacher_disagreement_score":0.00607451,"about_ca_system_score_codex":0.0014207495,"about_ca_system_score_gemma":0.001098404,"threshold_uncertainty_score":0.02032131},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005717557,0.0002998192,0.9797006,0.00043579878,0.00009013407,0.00017336523,0.00013367592,0.0011196915,0.012329394],"genre_scores_gemma":[0.13530926,0.00040553862,0.855023,0.0002972657,0.000077952944,0.00027399376,0.00039776802,0.00069004943,0.007525253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966785,0.0010942857,0.00019502104,0.00037106124,0.0012266785,0.0004346214],"domain_scores_gemma":[0.9976012,0.00066999684,0.00013042115,0.0011983733,0.00032214966,0.000077760706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002010652,0.0013298063,0.0009476191,0.0011490318,0.00084510894,0.0020880846,0.002318949,0.00086186215,0.0070297066],"category_scores_gemma":[0.0060566287,0.0007351405,0.0013600452,0.0016742925,0.0015944297,0.003984883,0.0028003436,0.0049786256,0.0027936886],"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.0003195636,0.00029607926,0.0008072725,0.00036967348,0.000109726294,0.0001340697,0.0003880442,0.11563133,0.020071136,0.53165436,0.0137083605,0.31651038],"study_design_scores_gemma":[0.00012340654,0.00019736716,0.0003326646,0.00010459184,0.00006350044,0.00018866773,0.00017604024,0.6028454,0.028799346,0.308485,0.05859881,0.00008520636],"about_ca_topic_score_codex":0.0028384756,"about_ca_topic_score_gemma":0.003919354,"teacher_disagreement_score":0.0070297066,"about_ca_system_score_codex":0.0018629548,"about_ca_system_score_gemma":0.003468966,"threshold_uncertainty_score":0.023516715},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0905912,0.00068880565,0.8891314,0.0006535555,0.00021474347,0.00024862145,0.0010842811,0.0022891886,0.015098217],"genre_scores_gemma":[0.5456777,0.0003413889,0.44186902,0.00018367244,0.00031164166,0.00046276732,0.0023694623,0.0007482313,0.008036079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99576616,0.0010261338,0.00018505275,0.0008980254,0.0015890987,0.00053554197],"domain_scores_gemma":[0.9853322,0.007928291,0.00081813155,0.003644606,0.0016713026,0.0006054431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039685434,0.0011670036,0.001526093,0.0013945651,0.000686332,0.0023394902,0.0025394945,0.0010968497,0.011965517],"category_scores_gemma":[0.022997648,0.00054388866,0.0017621701,0.0012323052,0.0014853397,0.0047678626,0.0023577274,0.003057407,0.0026942792],"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.0035425744,0.0004572893,0.0067441044,0.0010202673,0.0003720057,0.00039565732,0.00061323866,0.5301062,0.024861092,0.20753534,0.021986216,0.202366],"study_design_scores_gemma":[0.0000989087,0.00020105533,0.0011336434,0.000028990438,0.00004151976,0.0001026337,0.00003881207,0.9115018,0.012160306,0.070622295,0.004033022,0.000036987865],"about_ca_topic_score_codex":0.0022656475,"about_ca_topic_score_gemma":0.0030794484,"teacher_disagreement_score":0.011965517,"about_ca_system_score_codex":0.0025343734,"about_ca_system_score_gemma":0.0035076297,"threshold_uncertainty_score":0.04002863},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04752962,0.001914492,0.9167501,0.0032035806,0.0003924261,0.00049095246,0.00040903225,0.00047404654,0.028835788],"genre_scores_gemma":[0.62234205,0.002323959,0.35318264,0.0008896008,0.0006530287,0.0010412803,0.00066999847,0.00028816823,0.018609233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955195,0.0010884863,0.00040301832,0.00059988076,0.0019672364,0.00042174515],"domain_scores_gemma":[0.98769134,0.005851821,0.0012335335,0.004023677,0.00076263375,0.00043694125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044693644,0.0012923472,0.0011634944,0.002256068,0.0025932365,0.0042221085,0.0022132043,0.0018773038,0.006949519],"category_scores_gemma":[0.02253116,0.00073075364,0.0014566899,0.002382523,0.0058662365,0.017880095,0.0074392306,0.0072906236,0.0030898668],"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.00011790592,0.00004198131,0.0006925751,0.00024069693,0.00002062932,0.00010360543,0.00021233836,0.0046667466,0.0030561318,0.95884556,0.0024372577,0.02956456],"study_design_scores_gemma":[0.000021785665,0.00007005469,0.0001372473,0.00006642494,0.000020820047,0.00036773956,0.00012019954,0.01976511,0.005609696,0.9578667,0.015923897,0.000030197201],"about_ca_topic_score_codex":0.00016370617,"about_ca_topic_score_gemma":0.00017159608,"teacher_disagreement_score":0.006949519,"about_ca_system_score_codex":0.0018914768,"about_ca_system_score_gemma":0.0015500688,"threshold_uncertainty_score":0.02363652},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11616393,0.00085000216,0.82386184,0.004993582,0.0004709394,0.0003281965,0.0006246861,0.00078934437,0.051917415],"genre_scores_gemma":[0.8865906,0.00048266732,0.095833376,0.0006441271,0.00019952432,0.0002311496,0.00033138721,0.00015450898,0.015532741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953336,0.001311703,0.00029650965,0.00071182847,0.0016809169,0.0006654231],"domain_scores_gemma":[0.9919701,0.0031900038,0.0004982003,0.0035105909,0.0006093927,0.00022174459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026724965,0.00045599893,0.00091845216,0.00052024197,0.0011851545,0.0030982709,0.001600443,0.002487031,0.0043561384],"category_scores_gemma":[0.011090591,0.00045666707,0.00094767136,0.00095398026,0.0038221644,0.007444126,0.005450686,0.0032448005,0.0015002614],"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.00019379027,0.00004603397,0.0003399627,0.00008683615,0.000013567198,0.00032476243,0.00024297567,0.008704029,0.005021921,0.97029006,0.001973404,0.012762647],"study_design_scores_gemma":[0.00012271083,0.00009052401,0.0002557813,0.00006802539,0.000030479201,0.0009057349,0.000113849936,0.110737614,0.028291393,0.84175456,0.017556703,0.000072647614],"about_ca_topic_score_codex":0.00039200197,"about_ca_topic_score_gemma":0.00027332868,"teacher_disagreement_score":0.0043561384,"about_ca_system_score_codex":0.001643591,"about_ca_system_score_gemma":0.001959135,"threshold_uncertainty_score":0.01457274},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10036083,0.0007908046,0.88131684,0.00082320947,0.00010255735,0.00012914944,0.00010746176,0.00026540313,0.016103739],"genre_scores_gemma":[0.7825844,0.00096161844,0.21051845,0.000155314,0.00011897906,0.00020872217,0.00012011195,0.00008833741,0.0052440385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982975,0.0005586022,0.0000944585,0.00023544632,0.0006371627,0.00017685449],"domain_scores_gemma":[0.99725926,0.001493684,0.00038235262,0.0006029038,0.0001874326,0.00007434658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013858131,0.0006338306,0.0007101565,0.0020626904,0.0010279993,0.0012948791,0.00060228206,0.0009218187,0.0019495283],"category_scores_gemma":[0.004957863,0.00031374564,0.0012423948,0.0011878619,0.0022605322,0.0035708735,0.0019602093,0.0016372863,0.0005269375],"study_design_candidate":"bench_or_experimental","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.00047221407,0.00009463349,0.0018374932,0.00012599853,0.00009762202,0.0004162972,0.0004770787,0.11033378,0.010182038,0.8046299,0.001976779,0.0693561],"study_design_scores_gemma":[0.000025790709,0.00016378093,0.00056137145,0.00003773149,0.00002818301,0.0006448969,0.00011223955,0.70260775,0.012644086,0.27554044,0.007571854,0.00006186787],"about_ca_topic_score_codex":0.00027731303,"about_ca_topic_score_gemma":0.00029121703,"teacher_disagreement_score":0.0020626904,"about_ca_system_score_codex":0.0010218921,"about_ca_system_score_gemma":0.000633356,"threshold_uncertainty_score":0.0074144006},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09273814,0.0016044079,0.86894226,0.0016422964,0.0003611581,0.000198808,0.00028827335,0.0027753876,0.031449288],"genre_scores_gemma":[0.91425264,0.0006450553,0.06702222,0.00027840093,0.00018209602,0.00011294464,0.00027260432,0.00029887806,0.016935105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967188,0.0007784567,0.00021394936,0.0005031931,0.0011552153,0.0006302992],"domain_scores_gemma":[0.99233866,0.001731577,0.00054497796,0.004631281,0.00062159594,0.0001318424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00203259,0.0013069211,0.0011761446,0.0014148646,0.001189647,0.0021851822,0.0013518739,0.0018323488,0.0058082594],"category_scores_gemma":[0.007246215,0.0006403148,0.0012212755,0.0013875325,0.0026868787,0.0054657925,0.004213585,0.0022906885,0.0028043317],"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.0008131796,0.00010544412,0.0010895953,0.00040320278,0.00009243823,0.000845729,0.0007127038,0.021998605,0.033723958,0.80283487,0.0062435213,0.13113669],"study_design_scores_gemma":[0.0000975852,0.00029662362,0.0007862566,0.00021779427,0.00014721738,0.0029293562,0.00017779578,0.17776094,0.1712379,0.6219824,0.024218554,0.00014759666],"about_ca_topic_score_codex":0.00026910688,"about_ca_topic_score_gemma":0.00018432317,"teacher_disagreement_score":0.0058082594,"about_ca_system_score_codex":0.00085702154,"about_ca_system_score_gemma":0.00076687825,"threshold_uncertainty_score":0.019430578},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09885829,0.00084563775,0.8913298,0.00043602282,0.00015111676,0.00016854274,0.00024350673,0.0011394274,0.00682759],"genre_scores_gemma":[0.9155398,0.0004493668,0.07985445,0.00011771895,0.000070854505,0.00006573846,0.00022224721,0.000085833766,0.0035939422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981293,0.00048200157,0.00012570573,0.00021151321,0.0007846956,0.00026676903],"domain_scores_gemma":[0.99588925,0.0019353688,0.0005208793,0.0009725786,0.00060158334,0.000080435246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015166532,0.00075432553,0.00062119507,0.0014562537,0.0004935001,0.0010509138,0.0006113796,0.0006663561,0.0027844156],"category_scores_gemma":[0.0072957394,0.0002726478,0.00082318444,0.0006988325,0.0013519452,0.003215657,0.001224526,0.0011747165,0.0006679173],"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.0015045666,0.00014686499,0.0075028855,0.00043934016,0.00019444965,0.00082908984,0.00040128126,0.34565502,0.066054516,0.38141614,0.005956016,0.18989988],"study_design_scores_gemma":[0.000049197213,0.00024229901,0.0005568354,0.000041373485,0.000054147862,0.0004455647,0.000051440464,0.8659021,0.045667082,0.08282362,0.0041358103,0.000030497644],"about_ca_topic_score_codex":0.00064323517,"about_ca_topic_score_gemma":0.00050776,"teacher_disagreement_score":0.0027844156,"about_ca_system_score_codex":0.0010307501,"about_ca_system_score_gemma":0.0011033998,"threshold_uncertainty_score":0.0093147755},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059140236,0.0009633611,0.95285225,0.0025926325,0.0003476677,0.00022361519,0.0007498737,0.0005707094,0.03578583],"genre_scores_gemma":[0.60117805,0.0043025673,0.33994922,0.0025590993,0.0007105736,0.001968548,0.0021954866,0.0006262557,0.046510268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996933,0.0014711071,0.00018807001,0.00035350485,0.0007122275,0.00034219795],"domain_scores_gemma":[0.9971403,0.0016292494,0.00033851474,0.00040801958,0.00023963416,0.00024431368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029076445,0.0017566844,0.0011991428,0.0013678409,0.0015282248,0.0044422364,0.002932062,0.0024369182,0.011490734],"category_scores_gemma":[0.005610042,0.00069204916,0.0020518515,0.001644473,0.0038731236,0.007852448,0.0037004594,0.004991621,0.0030182393],"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.000024689249,0.000013868261,0.00006192338,0.000061892206,0.000012261923,0.00004025494,0.000082099796,0.0091452,0.00021619465,0.98588294,0.0018959128,0.0025627564],"study_design_scores_gemma":[0.000024220799,0.000018471006,0.000033880453,0.000026159947,0.000009997771,0.000038145277,0.0000355056,0.060071073,0.00013454196,0.9292401,0.01035647,0.000011414644],"about_ca_topic_score_codex":0.0022613832,"about_ca_topic_score_gemma":0.0024490594,"teacher_disagreement_score":0.011490734,"about_ca_system_score_codex":0.0031029654,"about_ca_system_score_gemma":0.0023598527,"threshold_uncertainty_score":0.038440347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025960127,0.00011929376,0.96882915,0.0004589768,0.000024527415,0.0000604323,0.00015665861,0.0038190372,0.0005719538],"genre_scores_gemma":[0.8515768,0.00015218857,0.14456151,0.0003909005,0.000047710386,0.00018066689,0.0004626353,0.00023379608,0.0023937295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954248,0.0019823788,0.00026929367,0.0008758877,0.0010233247,0.00042428315],"domain_scores_gemma":[0.99144274,0.0034909428,0.0007110987,0.0037049886,0.00046241572,0.00018775307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005190976,0.00087786803,0.001199421,0.0004956597,0.0010034799,0.0018069037,0.0024543563,0.0019335626,0.0016821473],"category_scores_gemma":[0.016620511,0.00061022665,0.0009920445,0.00081370265,0.0016926948,0.0056850147,0.005242871,0.0028610686,0.0008633783],"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.0012592308,0.0003301312,0.0038997303,0.0002242101,0.00016745192,0.0006948819,0.000585456,0.67787814,0.015697328,0.08626457,0.008222296,0.20477659],"study_design_scores_gemma":[0.00003473894,0.000051647654,0.0001955931,0.000008275676,0.0000070190417,0.00008567481,0.000030154815,0.9660868,0.005405868,0.027204989,0.00087497715,0.000014280714],"about_ca_topic_score_codex":0.0013311077,"about_ca_topic_score_gemma":0.0011758971,"teacher_disagreement_score":0.005190976,"about_ca_system_score_codex":0.0010607919,"about_ca_system_score_gemma":0.0015262892,"threshold_uncertainty_score":0.027452886},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035205107,0.00057056267,0.9329419,0.00061249465,0.00048923434,0.000695576,0.00041104518,0.0027845895,0.026289377],"genre_scores_gemma":[0.67838657,0.0007571362,0.293013,0.00070665224,0.00039042873,0.0010134235,0.0010068847,0.00062811346,0.024097817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958254,0.0006286413,0.0003430082,0.00059409393,0.0018489467,0.0007600034],"domain_scores_gemma":[0.9938811,0.0012149032,0.00041760388,0.0035350206,0.00065194693,0.0002993825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021590148,0.0010266267,0.0013217058,0.0010535497,0.0016810354,0.0018695624,0.0026490754,0.0015192623,0.009228552],"category_scores_gemma":[0.007516391,0.0006285393,0.0017481544,0.0014863642,0.002490156,0.008997011,0.011113593,0.004526173,0.0035157392],"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.0015388874,0.00046206376,0.0019821366,0.0009276648,0.000118608674,0.0011177231,0.0015879914,0.03080478,0.064363234,0.6311648,0.012821363,0.25311077],"study_design_scores_gemma":[0.00038507525,0.0013799402,0.0017018412,0.00033550893,0.00035631712,0.003365018,0.0005715729,0.26084873,0.09884682,0.5025024,0.1293575,0.00034940703],"about_ca_topic_score_codex":0.0008445804,"about_ca_topic_score_gemma":0.00062453037,"teacher_disagreement_score":0.009228552,"about_ca_system_score_codex":0.0015121066,"about_ca_system_score_gemma":0.0022655257,"threshold_uncertainty_score":0.030872583},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013060539,0.014175331,0.9056695,0.011337224,0.0007337003,0.00007019914,0.00018012484,0.00022853758,0.054544847],"genre_scores_gemma":[0.7068206,0.01806703,0.24721679,0.005522154,0.003472294,0.0007503424,0.00059770956,0.0006952629,0.01685784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98571026,0.004701349,0.00079669215,0.0022250286,0.005311311,0.0012554165],"domain_scores_gemma":[0.954504,0.034787927,0.0016775884,0.0058395774,0.0021583403,0.0010326009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012127474,0.0024962386,0.0018528961,0.0031539793,0.002611794,0.00801531,0.0035986926,0.0047248206,0.007197801],"category_scores_gemma":[0.03778247,0.001111253,0.0030542284,0.0026837396,0.012184562,0.033777457,0.009087459,0.021608094,0.0020984893],"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.000022840597,0.000017941336,0.0000934287,0.000082042665,0.000009436441,0.000023900746,0.00008042575,0.0020071685,0.00033107624,0.9928283,0.0006742233,0.0038291248],"study_design_scores_gemma":[0.000007981304,0.00003448711,0.00006068814,0.00007998987,0.000014280482,0.00007230088,0.0000361557,0.01619561,0.00096860976,0.97590804,0.0066052694,0.000016629518],"about_ca_topic_score_codex":0.00066955975,"about_ca_topic_score_gemma":0.00041226778,"teacher_disagreement_score":0.012127474,"about_ca_system_score_codex":0.005487445,"about_ca_system_score_gemma":0.001803879,"threshold_uncertainty_score":0.06413698},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060229108,0.00056958577,0.92596424,0.0012716657,0.00018767455,0.00020595001,0.00018676076,0.0012362847,0.010148808],"genre_scores_gemma":[0.799851,0.00041579118,0.19114089,0.00042412785,0.00015379055,0.00033175762,0.00022714252,0.00028883314,0.0071666962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99362904,0.0022783587,0.00038317541,0.0011047429,0.0017523762,0.0008522508],"domain_scores_gemma":[0.98584855,0.008028891,0.000859716,0.0042201905,0.0006255886,0.00041711354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039692526,0.001544841,0.0015582577,0.001218242,0.0010130826,0.0036388899,0.00247034,0.0016057113,0.0071260086],"category_scores_gemma":[0.012692652,0.00062122283,0.0019112462,0.0014090657,0.0040485235,0.009206399,0.004765463,0.0040043993,0.0012015884],"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.0013223345,0.00018859428,0.0010985599,0.00041845496,0.00016502058,0.0003606881,0.000247203,0.21010591,0.01773089,0.7192091,0.0024749183,0.04667835],"study_design_scores_gemma":[0.00009326411,0.00017620462,0.00013713619,0.00006441466,0.00007444626,0.00020718879,0.000038088794,0.39741096,0.01642972,0.5817427,0.0035872608,0.000038540413],"about_ca_topic_score_codex":0.00030671293,"about_ca_topic_score_gemma":0.00039279799,"teacher_disagreement_score":0.0071260086,"about_ca_system_score_codex":0.002224612,"about_ca_system_score_gemma":0.0013307458,"threshold_uncertainty_score":0.023838878},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021220062,0.00529092,0.9433323,0.0028275254,0.00045042287,0.0002895996,0.00019914332,0.0010927957,0.025297303],"genre_scores_gemma":[0.59775096,0.013447241,0.3570695,0.0026257932,0.0014302423,0.00085119193,0.00070714235,0.0006369979,0.025480984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952484,0.0010618997,0.0002994803,0.00076134707,0.0019892934,0.0006396634],"domain_scores_gemma":[0.98970836,0.002857455,0.00074176316,0.0059631397,0.0005517057,0.00017756331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033181736,0.0023283416,0.0016156058,0.001868455,0.0021412412,0.0028586169,0.0024550043,0.0030481827,0.006232567],"category_scores_gemma":[0.008929131,0.0010399366,0.0016600279,0.0026399926,0.009925744,0.017749986,0.010817658,0.0074660764,0.0035769036],"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.00018605223,0.00008330036,0.00054885854,0.0007489593,0.00011919011,0.00027380293,0.00039136127,0.016845334,0.013197006,0.88143814,0.00432413,0.081843846],"study_design_scores_gemma":[0.000081755046,0.00048672015,0.0006557226,0.00035400406,0.00017479341,0.0018364334,0.00019862413,0.059300207,0.035420462,0.85399497,0.047374584,0.00012170447],"about_ca_topic_score_codex":0.00034684894,"about_ca_topic_score_gemma":0.00027335368,"teacher_disagreement_score":0.006232567,"about_ca_system_score_codex":0.0019656154,"about_ca_system_score_gemma":0.0015824904,"threshold_uncertainty_score":0.020850003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02168133,0.0011354975,0.94827443,0.000537238,0.00036970622,0.00029600033,0.00033572497,0.007460601,0.019909445],"genre_scores_gemma":[0.5985901,0.0009930981,0.36851925,0.0008859872,0.00022404808,0.00052150403,0.00083610235,0.0016573743,0.027772592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978623,0.0005445999,0.00016747866,0.0004159954,0.0006874868,0.00032218877],"domain_scores_gemma":[0.99789715,0.0006603031,0.00019688856,0.0009898985,0.00016489925,0.00009093558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002113878,0.0012864892,0.001039467,0.0009934055,0.0009617561,0.0024669524,0.0022827184,0.0013010585,0.015754344],"category_scores_gemma":[0.0053569023,0.0007215511,0.0013755228,0.00085549336,0.0020266185,0.0074353726,0.0036324193,0.0027278077,0.003751197],"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.0024601682,0.00020437462,0.00077397714,0.00069084036,0.00016671901,0.00047142836,0.00031007917,0.03091548,0.051750835,0.6274058,0.013750549,0.27109972],"study_design_scores_gemma":[0.00032996142,0.0008884988,0.00034657473,0.00028065528,0.00021203274,0.0011214718,0.00010774624,0.21462415,0.16876002,0.5374266,0.0757332,0.00016909011],"about_ca_topic_score_codex":0.00030661555,"about_ca_topic_score_gemma":0.00059242925,"teacher_disagreement_score":0.015754344,"about_ca_system_score_codex":0.0008999479,"about_ca_system_score_gemma":0.0011026091,"threshold_uncertainty_score":0.0527035},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021223946,0.000605151,0.96709096,0.00054523535,0.0001007247,0.0001736184,0.000090177935,0.00047244588,0.009697645],"genre_scores_gemma":[0.5414239,0.00076670805,0.4481484,0.00040840506,0.0001213452,0.00037487832,0.00020363032,0.00020594322,0.008346666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776244,0.0009255154,0.00014090711,0.00024294379,0.0007256885,0.00020241938],"domain_scores_gemma":[0.9973826,0.0012982814,0.0001835629,0.0008536561,0.00019323647,0.00008863748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028987236,0.0008546969,0.001100235,0.0011366421,0.0007663074,0.0023173552,0.0020456675,0.0014358794,0.0067241425],"category_scores_gemma":[0.0066229617,0.0005999057,0.001338419,0.0013346837,0.0021470534,0.006172451,0.0027859015,0.0032667476,0.0010499031],"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.0002088042,0.000073044626,0.00018725194,0.00016601947,0.00004138104,0.00012033677,0.00013205461,0.046902508,0.00907477,0.91029936,0.0011278965,0.03166652],"study_design_scores_gemma":[0.00011238331,0.00022638535,0.00013172967,0.00010001433,0.000056111894,0.00027690057,0.000045252767,0.27361405,0.027599048,0.68579555,0.011993266,0.000049269995],"about_ca_topic_score_codex":0.00019237676,"about_ca_topic_score_gemma":0.0003083213,"teacher_disagreement_score":0.0067241425,"about_ca_system_score_codex":0.0013388398,"about_ca_system_score_gemma":0.0007427563,"threshold_uncertainty_score":0.022494495},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07262171,0.0005448446,0.90198964,0.0009472383,0.00015468283,0.00018880932,0.00029129852,0.0004902514,0.02277161],"genre_scores_gemma":[0.8680899,0.0005534423,0.1237622,0.00027869994,0.0001172162,0.00030759172,0.00034438257,0.00013502366,0.006411587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725634,0.000702699,0.00022098946,0.00035825343,0.0011160556,0.000345714],"domain_scores_gemma":[0.9961265,0.0012383031,0.00047506392,0.001562461,0.00038477647,0.00021294593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002394806,0.0006124236,0.0007593177,0.00084411376,0.0015222069,0.0024419355,0.0012134885,0.0016573786,0.0037823946],"category_scores_gemma":[0.0052393065,0.0005690237,0.001652982,0.0011168438,0.0035923868,0.0037042322,0.0040914104,0.0035988993,0.0009114953],"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.000050987957,0.000021251739,0.0001287695,0.000039609873,0.000008789239,0.0000931288,0.0001318755,0.0031595894,0.002392899,0.9905517,0.00031162178,0.003109789],"study_design_scores_gemma":[0.000084177205,0.00009909687,0.00018616831,0.000038481216,0.000032314903,0.00037329033,0.000059939575,0.059228648,0.016442187,0.9154587,0.007951355,0.000045505574],"about_ca_topic_score_codex":0.0002812398,"about_ca_topic_score_gemma":0.00021640184,"teacher_disagreement_score":0.0037823946,"about_ca_system_score_codex":0.0021525484,"about_ca_system_score_gemma":0.0010662179,"threshold_uncertainty_score":0.015617907},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17294239,0.00082530675,0.8038935,0.0027702653,0.00017663042,0.00023540472,0.0005289489,0.0021406165,0.016486954],"genre_scores_gemma":[0.65939957,0.00039842876,0.33105165,0.00036317122,0.00016362107,0.00019077955,0.0006665531,0.00021360995,0.0075525763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99658394,0.00052264036,0.00025319072,0.0008397124,0.0012576613,0.00054292666],"domain_scores_gemma":[0.98146194,0.012997234,0.0012909706,0.0031003968,0.0005654978,0.00058397965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030362543,0.000753672,0.0012578688,0.0015129108,0.0017686043,0.003836319,0.0019006722,0.0019960876,0.0045938333],"category_scores_gemma":[0.015654895,0.00055865885,0.0015067495,0.0019346836,0.0035586841,0.009834898,0.0055055213,0.004367312,0.001308544],"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.0023153403,0.0005432886,0.0066045965,0.0006619203,0.00018634993,0.00048744242,0.0013016664,0.07083261,0.029955711,0.6729501,0.008950314,0.20521067],"study_design_scores_gemma":[0.00019289849,0.0003664807,0.0006885778,0.00006324623,0.00008992497,0.00053855666,0.00020740725,0.23646599,0.0384314,0.71477085,0.008117493,0.0000670901],"about_ca_topic_score_codex":0.00070032355,"about_ca_topic_score_gemma":0.0006245985,"teacher_disagreement_score":0.0045938333,"about_ca_system_score_codex":0.002671462,"about_ca_system_score_gemma":0.0021407125,"threshold_uncertainty_score":0.019382954},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070048203,0.0005009302,0.9845525,0.0008602512,0.0002028574,0.00021626145,0.00008940383,0.0006730388,0.005899868],"genre_scores_gemma":[0.39142877,0.0009082787,0.59589875,0.0012129794,0.00038512817,0.0008257114,0.00039395905,0.00047114855,0.008475229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9914294,0.0033942384,0.0004933278,0.0012148478,0.0028487775,0.000619435],"domain_scores_gemma":[0.98937476,0.004980941,0.0006311562,0.0042318595,0.0005578285,0.00022340126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075970064,0.0015721815,0.0014810235,0.001759988,0.0010784643,0.004801602,0.003096211,0.003012833,0.0058421623],"category_scores_gemma":[0.017267326,0.0010371251,0.0023536885,0.0020526717,0.0060835825,0.014942854,0.007536666,0.00801191,0.001410288],"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.00015286723,0.000058001995,0.0001536568,0.0001711857,0.000044663746,0.00009247979,0.00018704355,0.012246126,0.004914873,0.9615902,0.0012157167,0.019173091],"study_design_scores_gemma":[0.0001719439,0.0001531338,0.00008778795,0.000115798786,0.00006177102,0.00023863104,0.00004678489,0.107498065,0.016200617,0.86035335,0.01501101,0.00006106184],"about_ca_topic_score_codex":0.00034807823,"about_ca_topic_score_gemma":0.00037112247,"teacher_disagreement_score":0.0075970064,"about_ca_system_score_codex":0.0020051608,"about_ca_system_score_gemma":0.0022749905,"threshold_uncertainty_score":0.040177226},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03844825,0.0016857645,0.9357169,0.001843803,0.00042052998,0.0001378461,0.0007956839,0.0013522601,0.019598905],"genre_scores_gemma":[0.7869935,0.002200454,0.17556831,0.00070412346,0.0009058704,0.00024283421,0.001901583,0.0004758092,0.031007465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938974,0.0015451032,0.00042272545,0.001023545,0.0025581003,0.0005531528],"domain_scores_gemma":[0.9707238,0.013213385,0.003958102,0.009119487,0.0020407736,0.0009444567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003597106,0.0010700964,0.0015297077,0.0016317539,0.0011418,0.0036969148,0.001986821,0.0025533948,0.008184921],"category_scores_gemma":[0.04005442,0.000670394,0.0009330142,0.001964638,0.004049431,0.011595067,0.007759725,0.004132023,0.002890977],"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.00041603774,0.000050914077,0.0006581892,0.0002157612,0.0000500306,0.00018647217,0.00028029355,0.0405459,0.0022373202,0.8671589,0.00511028,0.08308986],"study_design_scores_gemma":[0.00004158631,0.000089091875,0.00016766685,0.000062853665,0.000019358215,0.00026443435,0.000053042902,0.077392645,0.0040055173,0.9088833,0.008991381,0.000029163122],"about_ca_topic_score_codex":0.00039765125,"about_ca_topic_score_gemma":0.00037667286,"teacher_disagreement_score":0.008184921,"about_ca_system_score_codex":0.0013599045,"about_ca_system_score_gemma":0.0016213112,"threshold_uncertainty_score":0.027381241},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014779241,0.00015805083,0.96132404,0.000318657,0.000099155295,0.00044935718,0.0003154796,0.0076494534,0.014906553],"genre_scores_gemma":[0.609357,0.00039710055,0.36801496,0.00030824548,0.00011345202,0.0011998457,0.0010653152,0.001282727,0.018261308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973367,0.00078292924,0.00015952674,0.00031576777,0.0010404425,0.00036460947],"domain_scores_gemma":[0.997867,0.0006404614,0.00019226353,0.0008713964,0.00021219134,0.0002166465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002455358,0.0007194693,0.0008960637,0.00056197774,0.0009517483,0.0025219256,0.0023719762,0.001136103,0.01625059],"category_scores_gemma":[0.0052955337,0.00083747815,0.0011363638,0.0006681892,0.0014662783,0.004325553,0.0046324152,0.0022381223,0.0068455734],"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.0012081782,0.00036144332,0.0010778804,0.00052105595,0.00013410645,0.000714406,0.00055790413,0.16356207,0.026861532,0.70076746,0.013444256,0.09078973],"study_design_scores_gemma":[0.0003467279,0.0002818245,0.00022747561,0.00007883479,0.000046742694,0.0002692578,0.00006638365,0.6387843,0.01957623,0.2921473,0.04810411,0.00007076983],"about_ca_topic_score_codex":0.0011096178,"about_ca_topic_score_gemma":0.0011455581,"teacher_disagreement_score":0.01625059,"about_ca_system_score_codex":0.0011451964,"about_ca_system_score_gemma":0.0019774025,"threshold_uncertainty_score":0.05436361},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9430218,0.00071000797,0.052503828,0.00034410396,0.00008798617,0.000057286787,0.00015864523,0.00060238596,0.0025138264],"genre_scores_gemma":[0.9963965,0.0000756895,0.0031249134,0.000035913494,0.0000032334788,0.000008017756,0.00005614118,0.000012073993,0.00028757044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992906,0.00024136115,0.000051342315,0.00008164313,0.00022190914,0.00011311722],"domain_scores_gemma":[0.99618703,0.0025039143,0.00040730054,0.0004099249,0.00036628428,0.00012558176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013114961,0.0007048166,0.00040475107,0.0005713876,0.00017208386,0.00039794552,0.00051110587,0.000667869,0.0010415491],"category_scores_gemma":[0.0047568134,0.00013102492,0.00031080956,0.00030371087,0.0007131939,0.0008596654,0.0006371648,0.00067045377,0.00012563715],"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.0008253159,0.00026158753,0.004243277,0.00017164148,0.000101431055,0.00020165433,0.000035026464,0.94473135,0.010267251,0.002076758,0.0009628045,0.03612185],"study_design_scores_gemma":[0.000015148623,0.000599126,0.0010962471,0.000019515452,0.000025603254,0.00006489907,0.000021160722,0.97948533,0.017540606,0.0009005026,0.00022391768,0.000007933001],"about_ca_topic_score_codex":0.0011002593,"about_ca_topic_score_gemma":0.00075040443,"teacher_disagreement_score":0.0013114961,"about_ca_system_score_codex":0.00071999425,"about_ca_system_score_gemma":0.00025228364,"threshold_uncertainty_score":0.006935954},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6430274,0.0015854219,0.2729525,0.00045085754,0.00034584652,0.00023923202,0.00035194907,0.007585534,0.07346128],"genre_scores_gemma":[0.94004834,0.00029557158,0.05186577,0.000076210956,0.000037848422,0.000048042733,0.00022391677,0.00010775259,0.007296536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956554,0.00007438191,0.00002400284,0.00005804349,0.00017608624,0.00010200501],"domain_scores_gemma":[0.9996363,0.000077287965,0.0000388827,0.00016005062,0.000069643094,0.000017902774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031339438,0.0004955414,0.0003579277,0.00059081346,0.00036918873,0.0008666154,0.0006781003,0.00026125656,0.006988365],"category_scores_gemma":[0.00076659734,0.00017075731,0.00028113206,0.0005906133,0.00042093702,0.0011083516,0.00041791232,0.0004157771,0.0015053529],"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.0023515506,0.00038367696,0.005870615,0.0007383752,0.00012406262,0.0011107213,0.00044688425,0.084522456,0.22730705,0.16141596,0.012595746,0.50313294],"study_design_scores_gemma":[0.0004988418,0.0019047791,0.0074168923,0.00020188763,0.00013333297,0.0013981581,0.00015228381,0.32863632,0.52203053,0.043661892,0.09384177,0.00012322256],"about_ca_topic_score_codex":0.00082270184,"about_ca_topic_score_gemma":0.0009580846,"teacher_disagreement_score":0.006988365,"about_ca_system_score_codex":0.00072547747,"about_ca_system_score_gemma":0.0006171713,"threshold_uncertainty_score":0.023378432},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3803625,0.0028249444,0.52794486,0.0020387014,0.0006134715,0.00041646516,0.0011579781,0.015936343,0.0687047],"genre_scores_gemma":[0.82946986,0.00056109426,0.14941227,0.00047331653,0.00022277734,0.0001602354,0.0016532395,0.0005672726,0.017479934],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888164,0.0001143909,0.000068516856,0.00016670402,0.00056007114,0.00020875357],"domain_scores_gemma":[0.9988129,0.00027247946,0.000112381065,0.0005842891,0.00016549126,0.000052448635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005739937,0.000665793,0.00087959116,0.000857897,0.0004779944,0.0013899913,0.00081245217,0.00049581256,0.011760207],"category_scores_gemma":[0.0022223715,0.00023132552,0.00047991966,0.0009793194,0.0007407791,0.0036388345,0.0022330966,0.0014569598,0.003990066],"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.0025717514,0.0005266898,0.0015659989,0.0005389758,0.000085867,0.0008577832,0.0004229691,0.024340514,0.15728699,0.3393157,0.025438134,0.4470486],"study_design_scores_gemma":[0.00071216794,0.0013895264,0.001993836,0.00020653487,0.0001648209,0.0024916213,0.00035343572,0.3055969,0.41290754,0.21103121,0.0629584,0.0001941239],"about_ca_topic_score_codex":0.0004452284,"about_ca_topic_score_gemma":0.00057334604,"teacher_disagreement_score":0.011760207,"about_ca_system_score_codex":0.00061248394,"about_ca_system_score_gemma":0.0008598312,"threshold_uncertainty_score":0.039341807},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2541441,0.009236523,0.6175455,0.011110073,0.0031265279,0.00052517117,0.0008372323,0.0011871579,0.10228779],"genre_scores_gemma":[0.88207304,0.00250303,0.09573464,0.0013543367,0.0006078217,0.00014204397,0.00027639046,0.000067564346,0.017241262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978161,0.0007135746,0.000113692324,0.00027283622,0.0007938181,0.00028991184],"domain_scores_gemma":[0.99635905,0.0010821724,0.0004162945,0.0015031841,0.00042368617,0.000215618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024333317,0.00049759087,0.00059188914,0.00090123806,0.0014085424,0.003888953,0.0014603169,0.0020270515,0.004507122],"category_scores_gemma":[0.004453269,0.00035218216,0.00083682284,0.0019282529,0.0020690823,0.007570027,0.0024689469,0.0035236443,0.0013104834],"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.00029979227,0.00007396944,0.00092950225,0.00018370766,0.000034401506,0.00029062186,0.00038205055,0.0035251623,0.006949448,0.94465107,0.003935646,0.038744584],"study_design_scores_gemma":[0.00012569131,0.0003240136,0.0007068394,0.00010166433,0.00006149193,0.0017394664,0.00022897215,0.03239044,0.023939952,0.8637329,0.07656969,0.000078956975],"about_ca_topic_score_codex":0.00018079953,"about_ca_topic_score_gemma":0.00015795654,"teacher_disagreement_score":0.004507122,"about_ca_system_score_codex":0.0015517628,"about_ca_system_score_gemma":0.001080537,"threshold_uncertainty_score":0.015077829},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1914821,0.0012392296,0.7299782,0.0048336294,0.00011823384,0.0002399313,0.00035328697,0.00011592422,0.07163945],"genre_scores_gemma":[0.96442777,0.00066917477,0.019847265,0.00018016247,0.00008157645,0.00014905812,0.00011139157,0.000042657754,0.014490889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989924,0.0004982543,0.000028261404,0.00010581792,0.00019236916,0.0001829903],"domain_scores_gemma":[0.9971987,0.001899985,0.0002903097,0.00010936322,0.00021048635,0.00029114675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015022885,0.00080304645,0.0009702704,0.0008716505,0.0010403967,0.0024359724,0.0014548926,0.0019505724,0.0067883213],"category_scores_gemma":[0.005251294,0.0005671589,0.0008781922,0.0010330924,0.0025360216,0.004670659,0.0015978037,0.0019476792,0.0003873511],"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.00003848196,0.000065571425,0.00039982807,0.000060362596,0.000027619173,0.0001565933,0.0001355268,0.23777212,0.00076046237,0.75600415,0.0013789684,0.0032002341],"study_design_scores_gemma":[0.00001676469,0.000024550922,0.00013109624,0.000012658068,0.000007375335,0.000031296113,0.000067782166,0.72614115,0.00009225945,0.27237263,0.0010915216,0.000010889191],"about_ca_topic_score_codex":0.007253786,"about_ca_topic_score_gemma":0.005293974,"teacher_disagreement_score":0.007253786,"about_ca_system_score_codex":0.0031116651,"about_ca_system_score_gemma":0.0025859012,"threshold_uncertainty_score":0.02270919},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07082988,0.00054269854,0.915212,0.000969553,0.00010154053,0.0002367198,0.0002595224,0.0014383132,0.01040968],"genre_scores_gemma":[0.77500176,0.00040981633,0.21592924,0.00030081242,0.00010097252,0.00026392998,0.0003722705,0.00023777121,0.0073835254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967997,0.0009575286,0.00015006919,0.00043970539,0.0011034581,0.0005495605],"domain_scores_gemma":[0.99454546,0.0025271527,0.0004327241,0.001888048,0.00034297368,0.00026362113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027729534,0.0006500333,0.0011166693,0.0005781342,0.0010831712,0.0021561915,0.0015963309,0.0013427001,0.003591464],"category_scores_gemma":[0.009540068,0.00045177207,0.0011925942,0.0008536011,0.0019271501,0.006655993,0.0042454517,0.0033330794,0.0012116728],"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.0010611893,0.00021754652,0.0011707132,0.00023158103,0.00006381958,0.00031651577,0.0005745323,0.043290954,0.02795418,0.80579865,0.004498725,0.11482155],"study_design_scores_gemma":[0.00014594983,0.00020461608,0.00030799198,0.00006391662,0.00005719676,0.00043960364,0.00009701978,0.3349477,0.02439109,0.6261429,0.013154726,0.000047253685],"about_ca_topic_score_codex":0.0005550732,"about_ca_topic_score_gemma":0.00055662525,"teacher_disagreement_score":0.003591464,"about_ca_system_score_codex":0.0015075218,"about_ca_system_score_gemma":0.0015565465,"threshold_uncertainty_score":0.014664948},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10875963,0.014965087,0.6969701,0.0037597814,0.0008579334,0.0011384224,0.0013776093,0.0018622548,0.17030913],"genre_scores_gemma":[0.4575315,0.02582885,0.48111424,0.0011062971,0.0009377572,0.000939131,0.0024130591,0.00042007986,0.029709091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99611366,0.0008180599,0.0005700936,0.0005424143,0.0014750547,0.00048066248],"domain_scores_gemma":[0.9967243,0.00061768375,0.00046369463,0.0011080371,0.00066123635,0.0004250737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025681122,0.0015257398,0.0009454452,0.0052823233,0.0030046944,0.004886284,0.0013065906,0.002203977,0.0038537907],"category_scores_gemma":[0.0056638974,0.00068662514,0.0010262824,0.005675292,0.0032054682,0.009549969,0.0040766783,0.0039307876,0.002061346],"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.00003127964,0.00004086589,0.001047017,0.00017052643,0.000008179798,0.00025012606,0.00062440615,0.0012660001,0.0016500829,0.95250136,0.0024166887,0.03999345],"study_design_scores_gemma":[0.000023821785,0.00022591502,0.0011521737,0.00040287923,0.000022676086,0.0037522335,0.0006283919,0.0065307408,0.003278557,0.7166012,0.26729658,0.00008473123],"about_ca_topic_score_codex":0.00031775894,"about_ca_topic_score_gemma":0.00018439314,"teacher_disagreement_score":0.0052823233,"about_ca_system_score_codex":0.0010409683,"about_ca_system_score_gemma":0.0014338244,"threshold_uncertainty_score":0.013581634},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13595402,0.014107208,0.67273337,0.012500134,0.0014216122,0.00047073426,0.0018737512,0.0038799816,0.15705912],"genre_scores_gemma":[0.8331819,0.004667061,0.13794188,0.0019931162,0.0013979228,0.00065403763,0.0016210312,0.0018210158,0.01672191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97800386,0.0036531563,0.00071120856,0.0025563482,0.010604498,0.0044709384],"domain_scores_gemma":[0.9237129,0.05189452,0.0042669256,0.01227339,0.005352523,0.002499736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011177071,0.0030156174,0.002648714,0.006194458,0.0036747064,0.009015442,0.00433069,0.0039729527,0.02021222],"category_scores_gemma":[0.07005477,0.0013459534,0.002574435,0.006259874,0.0078046373,0.021711057,0.0073775183,0.009747231,0.004469084],"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.00061628415,0.00015342455,0.0010383785,0.00027410578,0.0000823193,0.00007112221,0.00019067536,0.035095934,0.002336764,0.9266148,0.010700453,0.022825735],"study_design_scores_gemma":[0.000060556933,0.000101492435,0.0006343308,0.00010419565,0.000057301455,0.0001583267,0.0000680386,0.09632322,0.0031031934,0.8909541,0.008373941,0.00006129805],"about_ca_topic_score_codex":0.0023654825,"about_ca_topic_score_gemma":0.003041848,"teacher_disagreement_score":0.02021222,"about_ca_system_score_codex":0.009606389,"about_ca_system_score_gemma":0.0048928177,"threshold_uncertainty_score":0.069699585},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03617443,0.00016667356,0.95074505,0.00031776962,0.00014032243,0.00029956497,0.00009515504,0.00540137,0.0066596163],"genre_scores_gemma":[0.69965404,0.00020308448,0.2935146,0.00030791672,0.000048008336,0.00031467708,0.00022294407,0.0003039223,0.005430709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980933,0.00035427767,0.00019241408,0.00030331756,0.0007210259,0.0003357032],"domain_scores_gemma":[0.99777573,0.00035525928,0.00016519743,0.0013462079,0.0002726582,0.00008495545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015308785,0.0005697004,0.0006541013,0.00059654197,0.0005355076,0.0016353584,0.0027802135,0.0014309393,0.0043684565],"category_scores_gemma":[0.0036040086,0.00050590746,0.0009469223,0.00045458254,0.0013771685,0.0029213477,0.003279652,0.002458524,0.0016069853],"study_design_candidate":"not_applicable","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.001325988,0.0007431199,0.0032084156,0.0011482637,0.00028536635,0.0013258628,0.0012770522,0.041182227,0.18326399,0.56747955,0.005571006,0.1931891],"study_design_scores_gemma":[0.00043091818,0.00095098745,0.0012646513,0.00017419338,0.00024518816,0.002121161,0.00020441896,0.34779572,0.4525692,0.12590896,0.06810234,0.00023227368],"about_ca_topic_score_codex":0.00016514212,"about_ca_topic_score_gemma":0.00012283833,"teacher_disagreement_score":0.0043684565,"about_ca_system_score_codex":0.00049627834,"about_ca_system_score_gemma":0.0010033962,"threshold_uncertainty_score":0.014613926},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052636717,0.0033924447,0.9336474,0.0038010539,0.0013587739,0.00025420726,0.00018724988,0.0010766375,0.051018596],"genre_scores_gemma":[0.50521404,0.00493852,0.4190278,0.00347302,0.0015748702,0.00063697057,0.00042126645,0.000680634,0.064032845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99494463,0.0020419422,0.00021649172,0.00070341135,0.0016226122,0.0004709543],"domain_scores_gemma":[0.99534225,0.0013688898,0.0003496039,0.0023557118,0.0004487952,0.00013488944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004080583,0.0009706075,0.0010395295,0.0010142061,0.0030122346,0.0029124513,0.0021805812,0.0031759525,0.018311158],"category_scores_gemma":[0.010391834,0.00050853373,0.0013937107,0.0016759416,0.0065958835,0.011481199,0.0046505146,0.0049014874,0.0053721913],"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.000085227635,0.00003600192,0.00009378178,0.00017878445,0.00001959314,0.000091528644,0.00012129612,0.0019568854,0.0017279858,0.95932466,0.008711576,0.027652718],"study_design_scores_gemma":[0.00002365193,0.000052130083,0.000088254754,0.000058277845,0.000016855915,0.00030412414,0.000039358973,0.020347418,0.004360428,0.9374526,0.037211478,0.000045572808],"about_ca_topic_score_codex":0.0007207202,"about_ca_topic_score_gemma":0.0008268889,"teacher_disagreement_score":0.018311158,"about_ca_system_score_codex":0.0026155096,"about_ca_system_score_gemma":0.001782097,"threshold_uncertainty_score":0.061257005},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11714077,0.00074599934,0.84925646,0.0011510963,0.00031878272,0.0009048372,0.0006449181,0.010140594,0.01969661],"genre_scores_gemma":[0.806904,0.00020813826,0.18392004,0.00034518226,0.00015829553,0.00034222697,0.0012763647,0.0006442368,0.0062014083],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906267,0.00341839,0.00056470017,0.0010176698,0.0035210655,0.00085149915],"domain_scores_gemma":[0.98523754,0.0031607372,0.0012375624,0.008630405,0.0014149995,0.0003187618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005648876,0.0008441476,0.0010935934,0.0008814932,0.00076130836,0.0022660065,0.0024454214,0.0009982511,0.009656498],"category_scores_gemma":[0.015162424,0.00045875763,0.0009044394,0.0007116172,0.0016221775,0.004930477,0.0048880884,0.0021722731,0.003361337],"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.004704123,0.0005212919,0.0044697495,0.00053416315,0.00016482463,0.0004677151,0.00042519835,0.074902676,0.10635218,0.38794538,0.014001145,0.40551153],"study_design_scores_gemma":[0.00065871124,0.0022761673,0.0017143489,0.00019172032,0.00016497765,0.001355572,0.0002242438,0.5080951,0.24114779,0.177655,0.06632306,0.0001933709],"about_ca_topic_score_codex":0.00038993437,"about_ca_topic_score_gemma":0.00033830435,"teacher_disagreement_score":0.009656498,"about_ca_system_score_codex":0.0013045974,"about_ca_system_score_gemma":0.0018034144,"threshold_uncertainty_score":0.032304168},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05975805,0.0006817808,0.83363557,0.0009364483,0.00023956675,0.00032627938,0.0008073024,0.035886116,0.0677289],"genre_scores_gemma":[0.78333145,0.0003505206,0.18403699,0.0005658993,0.00007798117,0.00021836805,0.00142061,0.0012156129,0.02878263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992649,0.000143565,0.00005323986,0.00010648363,0.0002955163,0.00013627416],"domain_scores_gemma":[0.9993818,0.00012546965,0.000058538648,0.00029840347,0.0001038901,0.00003189908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009877115,0.0006080023,0.00036504082,0.00045758518,0.00045712394,0.0010626566,0.0009839615,0.0006928213,0.007541839],"category_scores_gemma":[0.001858993,0.00035352656,0.0004981613,0.00024001891,0.0012958267,0.0028014332,0.0015471744,0.0012560077,0.0022861538],"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.0011777182,0.00019792265,0.0021807412,0.00040526091,0.000045491695,0.00044093077,0.00058624597,0.01662734,0.03642327,0.70449126,0.054051142,0.18337262],"study_design_scores_gemma":[0.00032794368,0.00096903316,0.0018417162,0.00026882175,0.00010363448,0.0013693926,0.0001360546,0.24378064,0.1481633,0.2630764,0.33984283,0.000120241944],"about_ca_topic_score_codex":0.00088240084,"about_ca_topic_score_gemma":0.00099712,"teacher_disagreement_score":0.007541839,"about_ca_system_score_codex":0.0008933861,"about_ca_system_score_gemma":0.0007952209,"threshold_uncertainty_score":0.02522993},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05178609,0.0023131685,0.9069266,0.0041254875,0.0001571416,0.0005291195,0.0012735713,0.0035474587,0.029341362],"genre_scores_gemma":[0.6553877,0.002260418,0.32144904,0.0014653633,0.0009895373,0.0011051616,0.001450801,0.0017890715,0.014102876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9569607,0.010920076,0.002521879,0.006166217,0.017889805,0.0055413605],"domain_scores_gemma":[0.74471235,0.19982296,0.010279857,0.036654055,0.006301227,0.0022295774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015546646,0.0024212338,0.0030693014,0.0025284907,0.0020621282,0.011183673,0.008242886,0.0035286257,0.017008103],"category_scores_gemma":[0.09860866,0.002392854,0.004662661,0.004220567,0.0065285154,0.036625948,0.010537928,0.012065226,0.0040495563],"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.0010299762,0.00035726195,0.0019508399,0.0012297505,0.00028256545,0.0004946923,0.00096437405,0.07379125,0.009611821,0.85767335,0.0051172264,0.047496982],"study_design_scores_gemma":[0.00027465072,0.00016063997,0.00031489116,0.00010817821,0.00020996368,0.0005398392,0.00010273127,0.26249006,0.011271229,0.71845466,0.005972807,0.0001003673],"about_ca_topic_score_codex":0.0016923202,"about_ca_topic_score_gemma":0.0009862869,"teacher_disagreement_score":0.017008103,"about_ca_system_score_codex":0.0071125533,"about_ca_system_score_gemma":0.0047123,"threshold_uncertainty_score":0.08221954},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010445863,0.0003578387,0.9784032,0.0005611136,0.0002039947,0.00015865488,0.000083652456,0.001130224,0.008655553],"genre_scores_gemma":[0.54670215,0.00069581374,0.4328505,0.00088917924,0.0004214596,0.00043266977,0.00079458475,0.00049992633,0.016713703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9900457,0.0031728125,0.0006687296,0.0016058114,0.0031869947,0.0013199386],"domain_scores_gemma":[0.9891234,0.0022498227,0.000465644,0.0060013677,0.001697568,0.00046222398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005547799,0.00090574333,0.0018436173,0.0018870726,0.0018084111,0.0049380437,0.0035924553,0.0029033124,0.0076064924],"category_scores_gemma":[0.012007033,0.0010321012,0.0011015087,0.0019475521,0.0033506148,0.009686715,0.015119038,0.006003855,0.0065583037],"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.0018700403,0.00040058506,0.0011342951,0.00040171386,0.000107336644,0.000418129,0.00088028423,0.013632707,0.041446205,0.7331867,0.013151375,0.19337064],"study_design_scores_gemma":[0.00028250183,0.00041499562,0.00055102573,0.0001539037,0.00010264161,0.0009019598,0.00033208643,0.27448368,0.059589047,0.6315064,0.03153966,0.0001421282],"about_ca_topic_score_codex":0.0004401441,"about_ca_topic_score_gemma":0.00042562056,"teacher_disagreement_score":0.0076064924,"about_ca_system_score_codex":0.0012224766,"about_ca_system_score_gemma":0.0024659107,"threshold_uncertainty_score":0.02933997},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009805077,0.0021238206,0.9358369,0.0029410506,0.0003652565,0.00040018177,0.000357171,0.0005515987,0.04761893],"genre_scores_gemma":[0.64275956,0.00448968,0.31248242,0.0011436892,0.000582651,0.0007098781,0.0007326126,0.00023320934,0.036866296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99283534,0.0025525624,0.0004396529,0.0011421912,0.0023490523,0.0006811735],"domain_scores_gemma":[0.9908194,0.0026615108,0.000498901,0.00522388,0.0004355694,0.0003606597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004303315,0.0010136724,0.0013953621,0.00072270865,0.0015435698,0.003634978,0.0026874114,0.001928841,0.011468014],"category_scores_gemma":[0.008896807,0.00074535666,0.0018448716,0.0019234648,0.003733004,0.007441579,0.0075073433,0.004452041,0.0028136682],"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.000061309824,0.000047910795,0.0003085562,0.0002922555,0.000041398856,0.0001716529,0.00021313912,0.01314001,0.0016311908,0.95848346,0.0029253354,0.022683876],"study_design_scores_gemma":[0.000031724187,0.00006118766,0.00018361927,0.0001016134,0.00003584709,0.00039215095,0.00009538716,0.12226203,0.0043382864,0.8295241,0.042948905,0.000025123438],"about_ca_topic_score_codex":0.0007997425,"about_ca_topic_score_gemma":0.0008491183,"teacher_disagreement_score":0.011468014,"about_ca_system_score_codex":0.0024802622,"about_ca_system_score_gemma":0.0025559245,"threshold_uncertainty_score":0.03836435},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024267795,0.0016784283,0.95883524,0.0016746215,0.00037690287,0.00023292062,0.00021844296,0.000429378,0.012286328],"genre_scores_gemma":[0.7902995,0.001333208,0.19566283,0.0006599223,0.000281811,0.0002965408,0.00029567807,0.00006192072,0.011108578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99408865,0.0020437744,0.0005220467,0.0005740868,0.002402662,0.00036875738],"domain_scores_gemma":[0.9896498,0.0028892714,0.0011915051,0.0051439144,0.00077714643,0.00034842626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041317367,0.00037907326,0.00091757445,0.00056007784,0.001106233,0.0030558896,0.0021017801,0.0016882047,0.0029336265],"category_scores_gemma":[0.0105990935,0.00036775743,0.0009820758,0.0017277638,0.002328573,0.0069113225,0.0033379523,0.0034485545,0.0014536628],"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.0003184881,0.00007976145,0.00094058935,0.00028070514,0.000069897826,0.00041872376,0.00041080473,0.008419075,0.009112581,0.9345555,0.0031072607,0.042286765],"study_design_scores_gemma":[0.0001968385,0.0002558675,0.00076595874,0.0002049029,0.00017444948,0.0031327012,0.00020850373,0.16930023,0.04767739,0.69034123,0.087654896,0.00008694215],"about_ca_topic_score_codex":0.000252824,"about_ca_topic_score_gemma":0.00014125004,"teacher_disagreement_score":0.0041317367,"about_ca_system_score_codex":0.0013855294,"about_ca_system_score_gemma":0.0013616729,"threshold_uncertainty_score":0.021850944},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007502939,0.004740172,0.9408117,0.01353984,0.0014256935,0.0002156953,0.00025287032,0.00032195597,0.03118908],"genre_scores_gemma":[0.45684105,0.006853653,0.50651765,0.008388407,0.0026586375,0.0015722489,0.0005962672,0.00096087006,0.015611275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9681293,0.014815038,0.0028484382,0.0050548455,0.0068601226,0.0022922829],"domain_scores_gemma":[0.9563516,0.028160369,0.0021080726,0.008319157,0.003888633,0.0011721638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.027457451,0.0028753537,0.0017680369,0.003301131,0.0051011173,0.010832741,0.006613773,0.006561243,0.0063394927],"category_scores_gemma":[0.04060195,0.0018942758,0.0043948228,0.0035645629,0.027461259,0.050510377,0.0150569,0.027276287,0.0023171084],"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.000014214179,0.000011699894,0.00005880196,0.000056792334,0.000009204817,0.000028194472,0.0002979329,0.0005392972,0.00018392804,0.99578947,0.0007360118,0.0022743563],"study_design_scores_gemma":[0.000022240905,0.000031289357,0.000059287762,0.00011339212,0.000020801901,0.00010361291,0.000119056596,0.004913765,0.00068751007,0.9761776,0.01772702,0.000024581512],"about_ca_topic_score_codex":0.0019108051,"about_ca_topic_score_gemma":0.0011867218,"teacher_disagreement_score":0.027457451,"about_ca_system_score_codex":0.006527325,"about_ca_system_score_gemma":0.0038114528,"threshold_uncertainty_score":0.14521056},"labels":[],"label_agreement":null}]}