{"meta":{"query_hash":"fe9dd6894be3","filters":{"venue":"IACR Communications in Cryptology"},"cohort_total":13,"direct_labels_cover":0,"predictions_cover":13,"exported":13,"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/fe9dd6894be3","api":"https://metacan.xera.ac/api/v1/cohort?venue=IACR+Communications+in+Cryptology"},"results":[{"id":"W4399151419","doi":"10.62056/a6n56c0kr","title":"The Round Complexity of Proofs in the Bounded Quantum Storage Model","year":2025,"lang":"en","type":"article","venue":"IACR Communications in Cryptology","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":"Université de Montréal; National Research Council Canada","funders":"HORIZON EUROPE Framework Programme; Simons Institute for the Theory of Computing, University of California Berkeley; Agence Nationale de la Recherche; European Commission","keywords":"Mathematical proof; Bounded function; Quantum; Computer science; Storage model; Mathematics; Theoretical computer science; Physics; Quantum mechanics","score_opus":0.06019643846856042,"score_gpt":0.34177379511629535,"score_spread":0.2815773566477349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399151419","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.21352549,0.0014228951,0.7437198,0.010093201,0.00011212806,0.0006429612,0.0014095564,0.001345241,0.027728712],"genre_scores_gemma":[0.8855607,0.0012838612,0.09991119,0.00072139653,0.0002935471,0.0006124527,0.0008829105,0.0005442152,0.010189766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9871745,0.004008429,0.0006894259,0.001757343,0.0044004824,0.001969878],"domain_scores_gemma":[0.88757914,0.090976015,0.004175934,0.014008729,0.0019492446,0.0013108994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008591052,0.0010107702,0.002139297,0.0017794399,0.0022002356,0.0082208365,0.0056274976,0.003165696,0.012540219],"category_scores_gemma":[0.052888066,0.0013914257,0.0026189724,0.0019897835,0.00701703,0.032100417,0.006751836,0.006885382,0.0013657992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006890201,0.00012174658,0.0007496123,0.000329009,0.00010099241,0.00024567137,0.0006859952,0.101919256,0.0031024541,0.87558085,0.0020499935,0.014425447],"study_design_scores_gemma":[0.0000790541,0.00006351116,0.00029404365,0.000028917795,0.00004135423,0.00010634698,0.0000776313,0.23848644,0.003260245,0.7558498,0.0016761238,0.00003662157],"about_ca_topic_score_codex":0.0028679247,"about_ca_topic_score_gemma":0.0014470435,"teacher_disagreement_score":0.012540219,"about_ca_system_score_codex":0.0068412856,"about_ca_system_score_gemma":0.0048920633,"threshold_uncertainty_score":0.049637258},"labels":[],"label_agreement":null},{"id":"W4403175065","doi":"10.62056/ay4c3txol7","title":"Leakage Model-flexible Deep Learning-based Side-channel Analysis","year":2024,"lang":"en","type":"article","venue":"IACR Communications in Cryptology","topic":"Cryptographic Implementations and 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":"École de Technologie Supérieure","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Computer science; Byte; Leakage (economics); Deep learning; Flexibility (engineering); Artificial intelligence; Profiling (computer programming); Computer engineering; Adversary; Computer hardware; Computer security; Mathematics","score_opus":0.05008528879993302,"score_gpt":0.3582059230162055,"score_spread":0.3081206342162725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403175065","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.03979485,0.00046667558,0.95565283,0.00039179926,0.000054370288,0.000045381483,0.000164865,0.0018277868,0.0016014132],"genre_scores_gemma":[0.87840694,0.0004245618,0.115334414,0.00046314526,0.000068641595,0.000111384434,0.00063204224,0.000200444,0.004358398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998944,0.0002540775,0.00005556583,0.00019015868,0.00035334294,0.00020286851],"domain_scores_gemma":[0.9984945,0.0005387015,0.00023504204,0.0003731074,0.00028650492,0.00007211719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011656393,0.0011604219,0.0010119654,0.0007537722,0.00034226163,0.0010553253,0.0014777875,0.0009116721,0.0016851408],"category_scores_gemma":[0.003498453,0.00037180167,0.0008200923,0.0006651389,0.0010459367,0.0029033718,0.0020112684,0.0024528939,0.0006267659],"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.00048279008,0.000239756,0.0040420936,0.00018077654,0.00013833704,0.00024732895,0.00012212977,0.6987334,0.020631554,0.027109075,0.0054369965,0.24263576],"study_design_scores_gemma":[0.0000044554195,0.000027928154,0.00015111733,0.000007467717,0.000007811202,0.000033822733,0.000006539587,0.98780966,0.005160111,0.006359766,0.00042471485,0.0000066782873],"about_ca_topic_score_codex":0.0010627097,"about_ca_topic_score_gemma":0.0013200577,"teacher_disagreement_score":0.0016851408,"about_ca_system_score_codex":0.001005358,"about_ca_system_score_gemma":0.0010703299,"threshold_uncertainty_score":0.007294357},"labels":[],"label_agreement":null},{"id":"W4403175140","doi":"10.62056/ay4fbn2hd","title":"Memory adds no cost to lattice sieving for computers in 3 or more spatial dimensions","year":2024,"lang":"en","type":"article","venue":"IACR Communications in Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Computer science; Artificial intelligence; Machine learning","score_opus":0.056259069229930486,"score_gpt":0.3674961435503306,"score_spread":0.31123707432040015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403175140","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.40522292,0.0025687357,0.4522746,0.008507518,0.00089748576,0.00015161866,0.0012461824,0.01288202,0.11624905],"genre_scores_gemma":[0.77290493,0.0009384236,0.19950229,0.0011379399,0.00019914446,0.00018914355,0.0010704156,0.0014570019,0.022600684],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998708,0.00020187424,0.00007068215,0.00023174702,0.0004722824,0.00031532717],"domain_scores_gemma":[0.99520594,0.0013672522,0.00035166473,0.0025695593,0.0002738624,0.0002317655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008216791,0.0008028514,0.0008248617,0.0006934538,0.0012823939,0.0023596394,0.0019136829,0.0013574117,0.02188141],"category_scores_gemma":[0.0075178854,0.0005949201,0.0011529553,0.0014454473,0.0021122573,0.009478897,0.0028540727,0.0021939657,0.005670666],"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.002186499,0.00032751085,0.0048153005,0.0008687593,0.00016052302,0.0003131603,0.00031053217,0.1284907,0.027904062,0.36466494,0.046748895,0.4232092],"study_design_scores_gemma":[0.00025885188,0.00068241457,0.0018301843,0.0001960566,0.00009886854,0.0007193674,0.00034161622,0.38965258,0.04673261,0.4990691,0.060275793,0.00014262497],"about_ca_topic_score_codex":0.0016664856,"about_ca_topic_score_gemma":0.0033032321,"teacher_disagreement_score":0.02188141,"about_ca_system_score_codex":0.001448303,"about_ca_system_score_gemma":0.0016703304,"threshold_uncertainty_score":0.07320058},"labels":[],"label_agreement":null},{"id":"W4403176415","doi":"10.62056/abe0fhbmo","title":"Uncloneable Quantum Advice","year":2024,"lang":"en","type":"article","venue":"IACR Communications in Cryptology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; University of Ottawa","keywords":"Advice (programming); Computer science","score_opus":0.024803725680860478,"score_gpt":0.31371025333196717,"score_spread":0.2889065276511067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403176415","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.21816285,0.0005301713,0.7149749,0.0055094776,0.00021654292,0.00020303582,0.00046055362,0.0013462314,0.058596205],"genre_scores_gemma":[0.92385864,0.00037414342,0.057529215,0.0009036772,0.00013504791,0.00021368386,0.00028634694,0.00028007914,0.016419085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99669844,0.0006461713,0.00018535339,0.00077418523,0.0012491356,0.00044676434],"domain_scores_gemma":[0.98760754,0.007760115,0.0008364638,0.0024523456,0.0009946468,0.0003489255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017398436,0.00042880911,0.0006214515,0.0006242694,0.001400665,0.003180064,0.0012002079,0.001753363,0.007077558],"category_scores_gemma":[0.014768102,0.00057049183,0.0013163101,0.00069138367,0.0053798403,0.007649989,0.0032711474,0.0052179964,0.0009332831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056721445,0.000019831507,0.00028165415,0.00007064546,0.000007832237,0.000047417678,0.00030452857,0.0055138874,0.0031348513,0.98328316,0.0011067147,0.006172759],"study_design_scores_gemma":[0.00003098667,0.00006590799,0.00025953312,0.00004072764,0.000026294387,0.00014087617,0.00010153872,0.062835045,0.014498356,0.9120581,0.009902542,0.00004001828],"about_ca_topic_score_codex":0.0012241033,"about_ca_topic_score_gemma":0.00093430985,"teacher_disagreement_score":0.007077558,"about_ca_system_score_codex":0.0029231678,"about_ca_system_score_gemma":0.0019589802,"threshold_uncertainty_score":0.023676753},"labels":[],"label_agreement":null},{"id":"W4406309654","doi":"10.62056/ahmpdkp10","title":"Publicly-Detectable Watermarking for Language Models","year":2025,"lang":"en","type":"article","venue":"IACR Communications in Cryptology","topic":"Advanced Steganography and Watermarking Techniques","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":"Artificial Intelligence in Medicine (Canada)","funders":"Army Research Office; Air Force Office of Scientific Research; National Science Foundation","keywords":"Digital watermarking; Computer science; Computer security; Artificial intelligence","score_opus":0.03659632076982125,"score_gpt":0.3409854020883518,"score_spread":0.3043890813185306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406309654","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.025698282,0.00029274757,0.9600486,0.0019931279,0.00009634438,0.000069088914,0.00019871636,0.0015778329,0.010025218],"genre_scores_gemma":[0.85674185,0.0004386331,0.13351797,0.0005942034,0.00033128855,0.00016688311,0.0003395434,0.000386277,0.007483282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947885,0.0014750548,0.0003371088,0.00071277784,0.0021223314,0.0005641796],"domain_scores_gemma":[0.97939,0.01007746,0.00236616,0.0065792077,0.001191748,0.00039545915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034159347,0.00071856333,0.0006417558,0.0010210085,0.0012495683,0.004445342,0.0015097333,0.0024156638,0.0055375253],"category_scores_gemma":[0.023365367,0.00061745546,0.0015108485,0.00074717414,0.0043795435,0.011137111,0.0045162775,0.0037152998,0.0015670052],"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.00009913353,0.00005550793,0.00029637353,0.0001003683,0.000020127833,0.0002841623,0.0003834009,0.020408917,0.006885094,0.9500797,0.0015561567,0.01983107],"study_design_scores_gemma":[0.000036024347,0.000060968556,0.000088664994,0.00006648825,0.000023585748,0.00026042527,0.000059109934,0.20677459,0.015583246,0.7699472,0.0070447284,0.000055113338],"about_ca_topic_score_codex":0.0007070064,"about_ca_topic_score_gemma":0.0007093837,"teacher_disagreement_score":0.0055375253,"about_ca_system_score_codex":0.0026263027,"about_ca_system_score_gemma":0.0020284855,"threshold_uncertainty_score":0.019055247},"labels":[],"label_agreement":null},{"id":"W4409253648","doi":"10.62056/abe0iv7sf","title":"Efficient Methods for Simultaneous Homomorphic Inversion","year":2025,"lang":"en","type":"article","venue":"IACR Communications in Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; National Research Council Canada","funders":"University of Waterloo","keywords":"Homomorphic encryption; Inversion (geology); Computer science; Homomorphic filtering; Geology; Artificial intelligence; Seismology; Computer security; Image enhancement; Image (mathematics)","score_opus":0.0316288580653663,"score_gpt":0.38741949511744356,"score_spread":0.35579063705207725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409253648","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.010861234,0.00021345906,0.9840479,0.00011027329,0.00003531376,0.00012818609,0.000036858317,0.001129542,0.0034372462],"genre_scores_gemma":[0.29867005,0.00042233092,0.6940219,0.000113037626,0.000072173934,0.00025005438,0.00017128586,0.00024840984,0.00603074],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839634,0.00027122608,0.000113343034,0.00024629183,0.0007422645,0.00023046159],"domain_scores_gemma":[0.9978465,0.0007874647,0.00016555282,0.0009329796,0.00021016058,0.000057284335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001128136,0.00077364285,0.0008769137,0.0013262673,0.0006244087,0.0014784124,0.0014403207,0.0009075566,0.006855527],"category_scores_gemma":[0.0033577685,0.0005343171,0.0010845906,0.000912645,0.0014645389,0.0032624695,0.0030040503,0.0018651888,0.0022766676],"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.0004422124,0.0002616642,0.00081176014,0.00044575488,0.00009578022,0.00024810896,0.00037232638,0.040164117,0.06202606,0.22865027,0.004244761,0.6622372],"study_design_scores_gemma":[0.0003423311,0.00042902288,0.00061476906,0.00009104098,0.000068067,0.0014687862,0.00018566445,0.62411904,0.12173107,0.22987074,0.020973612,0.00010582636],"about_ca_topic_score_codex":0.0003971489,"about_ca_topic_score_gemma":0.00061308465,"teacher_disagreement_score":0.006855527,"about_ca_system_score_codex":0.00071957585,"about_ca_system_score_gemma":0.0012490209,"threshold_uncertainty_score":0.02293402},"labels":[],"label_agreement":null},{"id":"W4412075142","doi":"10.62056/ah893z10k","title":"Round-Efficient Adaptively Secure Threshold Signatures with Rewinding","year":2025,"lang":"en","type":"article","venue":"IACR Communications in Cryptology","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 Ottawa","funders":"","keywords":"Computer science; Computer security","score_opus":0.024398160659318092,"score_gpt":0.3039376615718625,"score_spread":0.2795395009125444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412075142","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.088688165,0.0005527996,0.8869892,0.0008149508,0.0002205993,0.00031795815,0.00035848006,0.006555021,0.0155028],"genre_scores_gemma":[0.79404324,0.00033025673,0.1896077,0.0003439187,0.00010260307,0.00018011591,0.0004755704,0.00047833912,0.014438228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99402183,0.0008197247,0.00056068576,0.0013149527,0.0023112632,0.0009714931],"domain_scores_gemma":[0.99100834,0.001634183,0.0008955561,0.005412757,0.0006935068,0.00035562276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023245777,0.0008817422,0.0010873579,0.00086238503,0.0010357497,0.0026801494,0.0025692119,0.0017502477,0.005137807],"category_scores_gemma":[0.0075566256,0.00092074863,0.0014902083,0.0013497003,0.0023692169,0.0071571316,0.0054175598,0.0031400197,0.002892238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023334918,0.00025807484,0.0015857986,0.00038922118,0.00017291825,0.000772301,0.0010643827,0.10084683,0.10263212,0.5922226,0.0061355443,0.1915867],"study_design_scores_gemma":[0.0003238176,0.00063661183,0.0005967522,0.0001084014,0.00015475642,0.0010475954,0.00024177649,0.33860007,0.19751745,0.43163133,0.028867662,0.0002737647],"about_ca_topic_score_codex":0.0013960773,"about_ca_topic_score_gemma":0.00093740347,"teacher_disagreement_score":0.005137807,"about_ca_system_score_codex":0.0017266867,"about_ca_system_score_gemma":0.0027657424,"threshold_uncertainty_score":0.017187655},"labels":[],"label_agreement":null},{"id":"W4412075148","doi":"10.62056/ae0zo-3y","title":"Circular Insecure Encryption: from Long Cycles to Short Cycles","year":2025,"lang":"lv","type":"article","venue":"IACR Communications in Cryptology","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; Computer security; Computer science","score_opus":0.0448877442252007,"score_gpt":0.34536950307060293,"score_spread":0.30048175884540224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412075148","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.2200174,0.002351581,0.71601665,0.0047530923,0.0004238907,0.00032520175,0.0008609517,0.0015235598,0.053727712],"genre_scores_gemma":[0.9320763,0.0009854609,0.0496418,0.00071901,0.00029020171,0.00021665859,0.00045476845,0.0003179201,0.0152979465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99582916,0.0010298154,0.00033880162,0.000902244,0.0011604693,0.0007396076],"domain_scores_gemma":[0.9875695,0.0052544237,0.00104493,0.0044580065,0.0011021331,0.0005709644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002709469,0.0007533722,0.0007743295,0.0013490809,0.0019014231,0.004266725,0.0014301975,0.00198992,0.0072845314],"category_scores_gemma":[0.0141442595,0.0008063198,0.001098494,0.0012234965,0.004728706,0.011513022,0.006739711,0.0048902114,0.0017649092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064460037,0.00005432269,0.0010032731,0.00011264632,0.000026215004,0.00031418327,0.0005217035,0.018808696,0.002711153,0.9410123,0.0037077337,0.031083165],"study_design_scores_gemma":[0.00006676864,0.00010930112,0.000323143,0.00007871058,0.000032104574,0.00033368374,0.000111280904,0.06404438,0.004335152,0.9218284,0.008676026,0.000060990693],"about_ca_topic_score_codex":0.0013408861,"about_ca_topic_score_gemma":0.00086947635,"teacher_disagreement_score":0.0072845314,"about_ca_system_score_codex":0.0027644273,"about_ca_system_score_gemma":0.0018039854,"threshold_uncertainty_score":0.02436918},"labels":[],"label_agreement":null},{"id":"W4414869299","doi":"10.62056/a0l2i888","title":"A Tight Lower Bound on the TdScrypt Trapdoor Memory-Hard Function","year":2025,"lang":"en","type":"article","venue":"IACR Communications in Cryptology","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":"Upper and lower bounds; Hash function; Function (biology); Multiplicative function; Modulo; Boolean function; Perfect hash function; Discrete logarithm","score_opus":0.03638623541572816,"score_gpt":0.30153110558733637,"score_spread":0.2651448701716082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414869299","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.15358232,0.026019176,0.6049064,0.028813282,0.0015696855,0.0007564498,0.0046584844,0.009922941,0.16977131],"genre_scores_gemma":[0.8284376,0.008929799,0.11612824,0.008120035,0.00297447,0.0012114571,0.003418586,0.0029434746,0.027836232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99154925,0.0011701284,0.00036079477,0.0016732774,0.0028281729,0.0024183146],"domain_scores_gemma":[0.9662774,0.02329535,0.0011093499,0.005862126,0.0020265856,0.0014291095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045902305,0.0036798841,0.003917303,0.0031146796,0.0031458251,0.008896929,0.0059026773,0.0041794744,0.024149692],"category_scores_gemma":[0.037229337,0.0015012302,0.004467453,0.003628473,0.005517476,0.024623586,0.011131746,0.018653268,0.009682823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00432937,0.001009614,0.0077348542,0.0025583145,0.0004494182,0.0013135633,0.00129774,0.12033553,0.02865545,0.5896496,0.07702372,0.16564286],"study_design_scores_gemma":[0.00034712988,0.0004380816,0.0017391142,0.0007176166,0.0003677979,0.0013269692,0.00032479462,0.31949756,0.017398797,0.62396544,0.03366307,0.0002135263],"about_ca_topic_score_codex":0.0025967332,"about_ca_topic_score_gemma":0.0024137064,"teacher_disagreement_score":0.024149692,"about_ca_system_score_codex":0.0063148374,"about_ca_system_score_gemma":0.0043359012,"threshold_uncertainty_score":0.08078873},"labels":[],"label_agreement":null},{"id":"W4414869309","doi":"10.62056/ayivom2hd","title":"FrodoKEM: A CCA-Secure Learning With Errors Key Encapsulation Mechanism","year":2025,"lang":"en","type":"article","venue":"IACR Communications in Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; UK Research and Innovation","keywords":"Cryptography; Exploit; NIST; Key encapsulation; Encapsulation (networking); Cryptographic protocol; Cryptographic primitive; Implementation; Encryption","score_opus":0.018278735053761125,"score_gpt":0.2922145365439903,"score_spread":0.2739358014902292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414869309","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.033765372,0.00021691632,0.9549988,0.000852608,0.00010631734,0.00022091127,0.00012001166,0.0022788912,0.0074401544],"genre_scores_gemma":[0.75905144,0.00023792412,0.22960669,0.00048111932,0.00008418238,0.00038674084,0.00018778208,0.0001744692,0.009789617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977481,0.00055174145,0.00009419912,0.00037783713,0.0009090357,0.00031902365],"domain_scores_gemma":[0.99791676,0.0005456533,0.00028901623,0.00091355515,0.0001947484,0.00014021891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002578513,0.00047289862,0.00061532843,0.0006816107,0.0010773891,0.0013051622,0.0027566077,0.0015599977,0.0022677525],"category_scores_gemma":[0.0050161285,0.00032080067,0.00065730966,0.0005680185,0.002813925,0.00390635,0.0049588983,0.0025320891,0.0010429636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006252084,0.00024213057,0.001207186,0.0001801032,0.0000665121,0.00032688174,0.0004725881,0.05758707,0.031439543,0.7535904,0.006581192,0.14768125],"study_design_scores_gemma":[0.00030435526,0.00039522254,0.0004619003,0.00006149151,0.00004922761,0.0005308263,0.00009821818,0.5033152,0.07049524,0.38674283,0.03733895,0.00020660611],"about_ca_topic_score_codex":0.00061581837,"about_ca_topic_score_gemma":0.0004976566,"teacher_disagreement_score":0.0027566077,"about_ca_system_score_codex":0.0009058719,"about_ca_system_score_gemma":0.0022556763,"threshold_uncertainty_score":0.013636649},"labels":[],"label_agreement":null},{"id":"W4414869494","doi":"10.62056/a0c3tx4e-","title":"Multi User Security of LightMAC and LightMAC_Plus","year":2025,"lang":"en","type":"article","venue":"IACR Communications in Cryptology","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":"PricewaterhouseCoopers (Canada)","funders":"","keywords":"Block (permutation group theory); Context (archaeology); Upper and lower bounds; Adversary; Computer security model; Block size; Concrete security","score_opus":0.029975203983867705,"score_gpt":0.3573693460442463,"score_spread":0.3273941420603786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414869494","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.20724547,0.00360756,0.73529756,0.0027391093,0.00034210144,0.0006380846,0.0006768527,0.0029565305,0.046496656],"genre_scores_gemma":[0.9355698,0.00042847553,0.057239503,0.00049764453,0.00011067863,0.00028627447,0.00024970897,0.00010446881,0.0055134846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9913902,0.0018659724,0.00032518242,0.0011932068,0.0034337675,0.0017915531],"domain_scores_gemma":[0.98564076,0.00447665,0.0014487728,0.006481582,0.0014610823,0.0004911954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044238647,0.00088214607,0.0012167866,0.0013862863,0.002142722,0.0027160586,0.0018273549,0.001718702,0.0035541402],"category_scores_gemma":[0.009654657,0.00062603905,0.0014130642,0.0012940383,0.0035785728,0.0071724183,0.008154324,0.004811976,0.0009349933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017050692,0.00024247315,0.0023364953,0.00042044782,0.00010394832,0.00051676226,0.00079301896,0.03474275,0.034350857,0.81518894,0.0073366123,0.102262564],"study_design_scores_gemma":[0.00026680232,0.00088922156,0.0028369303,0.0001818544,0.00014106568,0.0023745457,0.00033680463,0.5064524,0.0770523,0.36951712,0.03955908,0.0003919168],"about_ca_topic_score_codex":0.001482474,"about_ca_topic_score_gemma":0.0012245843,"teacher_disagreement_score":0.0044238647,"about_ca_system_score_codex":0.0026195827,"about_ca_system_score_gemma":0.003261651,"threshold_uncertainty_score":0.023395956},"labels":[],"label_agreement":null},{"id":"W4414869544","doi":"10.62056/abe0zo-3y","title":"Access-Controlled Inner Product Function-Revealing Encryption","year":2025,"lang":"en","type":"article","venue":"IACR Communications in Cryptology","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":"Functional encryption; Encryption; Access control; Construct (python library); Scheme (mathematics); Bilinear interpolation; Protocol (science)","score_opus":0.038720755449041445,"score_gpt":0.35614175278181415,"score_spread":0.3174209973327727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414869544","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.027396426,0.00039517743,0.95289564,0.00083631143,0.00013634401,0.00015552528,0.00036045472,0.0006933993,0.017130785],"genre_scores_gemma":[0.8390823,0.0006225787,0.1457431,0.00072133046,0.00021664074,0.00027871548,0.000405128,0.00018705685,0.012743196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971221,0.00069182436,0.00022419973,0.0005246084,0.00097295415,0.00046436524],"domain_scores_gemma":[0.9954456,0.0009812006,0.0003612859,0.0025524346,0.00050992105,0.00014951274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020732651,0.000714936,0.00090251624,0.00051038194,0.00065141753,0.0020653992,0.0017394711,0.0010306662,0.004160821],"category_scores_gemma":[0.0052542384,0.00033295166,0.0010149828,0.00087615533,0.0024567458,0.0061591123,0.0041156695,0.003304366,0.0016459799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017962341,0.00009956967,0.00042621497,0.0001732146,0.000024157525,0.00025326223,0.0005069977,0.018752435,0.008807103,0.9318466,0.003369965,0.035560872],"study_design_scores_gemma":[0.000090226364,0.00033196725,0.0004374826,0.00009117176,0.000060447343,0.0012264677,0.00012466968,0.23055185,0.029060751,0.7001378,0.037779845,0.00010736114],"about_ca_topic_score_codex":0.00044111855,"about_ca_topic_score_gemma":0.00031555002,"teacher_disagreement_score":0.004160821,"about_ca_system_score_codex":0.0010418305,"about_ca_system_score_gemma":0.00135807,"threshold_uncertainty_score":0.0139193535},"labels":[],"label_agreement":null},{"id":"W4414869624","doi":"10.62056/angy11fgx","title":"zkMaP: Zero-Knowledge Succinct Non-Interactive Matrix Multiplication Proofs","year":2025,"lang":"en","type":"article","venue":"IACR Communications in Cryptology","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":"Mathematical proof; Matrix multiplication; Reduction (mathematics); Multiplication (music); Scalability; Matrix (chemical analysis); Speedup; Pairing","score_opus":0.020463009067450372,"score_gpt":0.3656531668869679,"score_spread":0.34519015781951756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414869624","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.00670358,0.00014863594,0.9808772,0.0003414912,0.00009819927,0.00025527176,0.00044161742,0.006512655,0.004621343],"genre_scores_gemma":[0.50260836,0.0005738078,0.48104373,0.0004866144,0.0001643635,0.00065910944,0.001710438,0.0014122783,0.011341352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99535817,0.0012692158,0.00030268315,0.0005629904,0.0020261651,0.0004807963],"domain_scores_gemma":[0.99143934,0.0035272741,0.00067975983,0.0031967033,0.00087323313,0.0002837452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036076114,0.0008991868,0.0007445939,0.000868876,0.0010409128,0.0033224514,0.00389167,0.00118447,0.016606597],"category_scores_gemma":[0.012146574,0.0010596698,0.0009919462,0.0008237895,0.0020436875,0.007921811,0.007614361,0.0034447317,0.004898983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011923487,0.0003311069,0.0012605829,0.001435874,0.00016678787,0.0008760588,0.0009310295,0.045311388,0.05281619,0.6037438,0.02675971,0.2651752],"study_design_scores_gemma":[0.00037647007,0.00045976602,0.00054028723,0.00020245444,0.000091934875,0.00091046357,0.00018507423,0.41988626,0.17815849,0.33068022,0.06832583,0.00018273044],"about_ca_topic_score_codex":0.00061929127,"about_ca_topic_score_gemma":0.0008611513,"teacher_disagreement_score":0.016606597,"about_ca_system_score_codex":0.0009081941,"about_ca_system_score_gemma":0.003240425,"threshold_uncertainty_score":0.05555463},"labels":[],"label_agreement":null}]}