{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":13,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":13,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"fe9dd6894be3","filters":{"venue":"IACR Communications in Cryptology"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jaiden Fairoze","is_ca":false},{"name":"Sanjam Garg","is_ca":false},{"name":"Somesh Jha","is_ca":false},{"name":"Saeed Mahloujifar","is_ca":true},{"name":"Mohammad Mahmoody","is_ca":false},{"name":"M. Wang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03659632076982125,"gpt":0.3409854020883518,"spread":0.3043890813185306,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003415935,0.0007185633,0.0006417558,0.001021008,0.001249568,0.004445342,0.001509733,0.002415664,0.005537525],"category_scores_gemma":[0.02336537,0.0006174555,0.001510849,0.0007471741,0.004379543,0.01113711,0.004516277,0.0037153,0.001567005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002626303,"about_ca_system_score_gemma":0.002028486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007070064,"about_ca_topic_score_gemma":0.0007093837,"domain_scores_codex":[0.9947885,0.001475055,0.0003371088,0.0007127778,0.002122331,0.0005641796],"domain_scores_gemma":[0.97939,0.01007746,0.00236616,0.006579208,0.001191748,0.0003954592],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009913353,0.00005550793,0.0002963735,0.0001003683,0.00002012783,0.0002841623,0.0003834009,0.02040892,0.006885094,0.9500797,0.001556157,0.01983107],"study_design_scores_gemma":[0.00003602435,0.00006096856,0.00008866499,0.00006648825,0.00002358575,0.0002604253,0.00005910993,0.2067746,0.01558325,0.7699472,0.007044728,0.00005511334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02569828,0.0002927476,0.9600486,0.001993128,0.00009634438,0.00006908891,0.0001987164,0.001577833,0.01002522],"genre_scores_gemma":[0.8567418,0.0004386331,0.133518,0.0005942034,0.0003312886,0.0001668831,0.0003395434,0.000386277,0.007483282],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005537525,"threshold_uncertainty_score":0.01905525,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Lichao Wu","is_ca":false},{"name":"Azade Rezaeezade","is_ca":false},{"name":"Amir Ali-Pour","is_ca":true},{"name":"Guilherme Perin","is_ca":false},{"name":"Stjepan Picek","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05008528879993302,"gpt":0.3582059230162055,"spread":0.3081206342162725,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001165639,0.001160422,0.001011965,0.0007537722,0.0003422616,0.001055325,0.001477788,0.0009116721,0.001685141],"category_scores_gemma":[0.003498453,0.0003718017,0.0008200923,0.0006651389,0.001045937,0.002903372,0.002011268,0.002452894,0.0006267659],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001005358,"about_ca_system_score_gemma":0.00107033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00106271,"about_ca_topic_score_gemma":0.001320058,"domain_scores_codex":[0.998944,0.0002540775,0.00005556583,0.0001901587,0.0003533429,0.0002028685],"domain_scores_gemma":[0.9984945,0.0005387015,0.000235042,0.0003731074,0.0002865049,0.00007211719],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004827901,0.000239756,0.004042094,0.0001807765,0.000138337,0.0002473289,0.0001221298,0.6987334,0.02063155,0.02710908,0.005436996,0.2426358],"study_design_scores_gemma":[0.000004455419,0.00002792815,0.0001511173,0.000007467717,0.000007811202,0.00003382273,0.000006539587,0.9878097,0.005160111,0.006359766,0.0004247148,0.000006678287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03979485,0.0004666756,0.9556528,0.0003917993,0.00005437029,0.00004538148,0.000164865,0.001827787,0.001601413],"genre_scores_gemma":[0.8784069,0.0004245618,0.1153344,0.0004631453,0.0000686416,0.0001113844,0.0006320422,0.000200444,0.004358398],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001685141,"threshold_uncertainty_score":0.007294357,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer security","authors":[{"name":"Yanbo Chen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02439816065931809,"gpt":0.3039376615718625,"spread":0.2795395009125444,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002324578,0.0008817422,0.001087358,0.000862385,0.00103575,0.002680149,0.002569212,0.001750248,0.005137807],"category_scores_gemma":[0.007556626,0.0009207486,0.001490208,0.0013497,0.002369217,0.007157132,0.00541756,0.00314002,0.002892238],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001726687,"about_ca_system_score_gemma":0.002765742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001396077,"about_ca_topic_score_gemma":0.0009374035,"domain_scores_codex":[0.9940218,0.0008197247,0.0005606858,0.001314953,0.002311263,0.0009714931],"domain_scores_gemma":[0.9910083,0.001634183,0.0008955561,0.005412757,0.0006935068,0.0003556228],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002333492,0.0002580748,0.001585799,0.0003892212,0.0001729183,0.000772301,0.001064383,0.1008468,0.1026321,0.5922226,0.006135544,0.1915867],"study_design_scores_gemma":[0.0003238176,0.0006366118,0.0005967522,0.0001084014,0.0001547564,0.001047595,0.0002417765,0.3386001,0.1975175,0.4316313,0.02886766,0.0002737647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08868816,0.0005527996,0.8869892,0.0008149508,0.0002205993,0.0003179582,0.0003584801,0.006555021,0.0155028],"genre_scores_gemma":[0.7940432,0.0003302567,0.1896077,0.0003439187,0.0001026031,0.0001801159,0.0004755704,0.0004783391,0.01443823],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005137807,"threshold_uncertainty_score":0.01718765,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Computer science; Artificial intelligence; Machine learning","authors":[{"name":"Samuel Jaques","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05625906922993049,"gpt":0.3674961435503306,"spread":0.3112370743204002,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008216791,0.0008028514,0.0008248617,0.0006934538,0.001282394,0.002359639,0.001913683,0.001357412,0.02188141],"category_scores_gemma":[0.007517885,0.0005949201,0.001152955,0.001445447,0.002112257,0.009478897,0.002854073,0.002193966,0.005670666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001448303,"about_ca_system_score_gemma":0.00167033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001666486,"about_ca_topic_score_gemma":0.003303232,"domain_scores_codex":[0.998708,0.0002018742,0.00007068215,0.000231747,0.0004722824,0.0003153272],"domain_scores_gemma":[0.9952059,0.001367252,0.0003516647,0.002569559,0.0002738624,0.0002317655],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002186499,0.0003275108,0.0048153,0.0008687593,0.000160523,0.0003131603,0.0003105322,0.1284907,0.02790406,0.3646649,0.0467489,0.4232092],"study_design_scores_gemma":[0.0002588519,0.0006824146,0.001830184,0.0001960566,0.00009886854,0.0007193674,0.0003416162,0.3896526,0.04673261,0.4990691,0.06027579,0.000142625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4052229,0.002568736,0.4522746,0.008507518,0.0008974858,0.0001516187,0.001246182,0.01288202,0.116249],"genre_scores_gemma":[0.7729049,0.0009384236,0.1995023,0.00113794,0.0001991445,0.0001891436,0.001070416,0.001457002,0.02260068],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02188141,"threshold_uncertainty_score":0.07320058,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Anne Broadbent","is_ca":true},{"name":"Martti Karvonen","is_ca":false},{"name":"Sébastien Lord","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02480372568086048,"gpt":0.3137102533319672,"spread":0.2889065276511067,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001739844,0.0004288091,0.0006214515,0.0006242694,0.001400665,0.003180064,0.001200208,0.001753363,0.007077558],"category_scores_gemma":[0.0147681,0.0005704918,0.00131631,0.0006913837,0.00537984,0.007649989,0.003271147,0.005217996,0.0009332831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002923168,"about_ca_system_score_gemma":0.00195898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001224103,"about_ca_topic_score_gemma":0.0009343098,"domain_scores_codex":[0.9966984,0.0006461713,0.0001853534,0.0007741852,0.001249136,0.0004467643],"domain_scores_gemma":[0.9876075,0.007760115,0.0008364638,0.002452346,0.0009946468,0.0003489255],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005672144,0.00001983151,0.0002816542,0.00007064546,0.000007832237,0.00004741768,0.0003045286,0.005513887,0.003134851,0.9832832,0.001106715,0.006172759],"study_design_scores_gemma":[0.00003098667,0.00006590799,0.0002595331,0.00004072764,0.00002629439,0.0001408762,0.0001015387,0.06283505,0.01449836,0.9120581,0.009902542,0.00004001828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2181628,0.0005301713,0.7149749,0.005509478,0.0002165429,0.0002030358,0.0004605536,0.001346231,0.0585962],"genre_scores_gemma":[0.9238586,0.0003741434,0.05752921,0.0009036772,0.0001350479,0.0002136839,0.0002863469,0.0002800791,0.01641908],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007077558,"threshold_uncertainty_score":0.02367675,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; UK Research and Innovation","keywords":"Cryptography; Exploit; NIST; Key encapsulation; Encapsulation (networking); Cryptographic protocol; Cryptographic primitive; Implementation; Encryption","authors":[{"name":"Lewis Glabush","is_ca":false},{"name":"Patrick Longa","is_ca":false},{"name":"Michael Naehrig","is_ca":false},{"name":"Chris Peikert","is_ca":false},{"name":"Douglas Stebila","is_ca":true},{"name":"Fernando Virdia","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01827873505376112,"gpt":0.2922145365439903,"spread":0.2739358014902292,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002578513,0.0004728986,0.0006153284,0.0006816107,0.001077389,0.001305162,0.002756608,0.001559998,0.002267753],"category_scores_gemma":[0.005016129,0.0003208007,0.0006573097,0.0005680185,0.002813925,0.00390635,0.004958898,0.002532089,0.001042964],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009058719,"about_ca_system_score_gemma":0.002255676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006158184,"about_ca_topic_score_gemma":0.0004976566,"domain_scores_codex":[0.9977481,0.0005517415,0.00009419912,0.0003778371,0.0009090357,0.0003190236],"domain_scores_gemma":[0.9979168,0.0005456533,0.0002890162,0.0009135552,0.0001947484,0.0001402189],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006252084,0.0002421306,0.001207186,0.0001801032,0.0000665121,0.0003268817,0.0004725881,0.05758707,0.03143954,0.7535904,0.006581192,0.1476813],"study_design_scores_gemma":[0.0003043553,0.0003952225,0.0004619003,0.00006149151,0.00004922761,0.0005308263,0.00009821818,0.5033152,0.07049524,0.3867428,0.03733895,0.0002066061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03376537,0.0002169163,0.9549988,0.000852608,0.0001063173,0.0002209113,0.0001200117,0.002278891,0.007440154],"genre_scores_gemma":[0.7590514,0.0002379241,0.2296067,0.0004811193,0.00008418238,0.0003867408,0.0001877821,0.0001744692,0.009789617],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002756608,"threshold_uncertainty_score":0.01363665,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jeremiah Blocki","is_ca":false},{"name":"Seunghoon Lee","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03638623541572816,"gpt":0.3015311055873364,"spread":0.2651448701716082,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004590231,0.003679884,0.003917303,0.00311468,0.003145825,0.008896929,0.005902677,0.004179474,0.02414969],"category_scores_gemma":[0.03722934,0.00150123,0.004467453,0.003628473,0.005517476,0.02462359,0.01113175,0.01865327,0.009682823],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006314837,"about_ca_system_score_gemma":0.004335901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002596733,"about_ca_topic_score_gemma":0.002413706,"domain_scores_codex":[0.9915493,0.001170128,0.0003607948,0.001673277,0.002828173,0.002418315],"domain_scores_gemma":[0.9662774,0.02329535,0.00110935,0.005862126,0.002026586,0.001429109],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00432937,0.001009614,0.007734854,0.002558314,0.0004494182,0.001313563,0.00129774,0.1203355,0.02865545,0.5896496,0.07702372,0.1656429],"study_design_scores_gemma":[0.0003471299,0.0004380816,0.001739114,0.0007176166,0.0003677979,0.001326969,0.0003247946,0.3194976,0.0173988,0.6239654,0.03366307,0.0002135263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1535823,0.02601918,0.6049064,0.02881328,0.001569686,0.0007564498,0.004658484,0.009922941,0.1697713],"genre_scores_gemma":[0.8284376,0.008929799,0.1161282,0.008120035,0.00297447,0.001211457,0.003418586,0.002943475,0.02783623],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02414969,"threshold_uncertainty_score":0.08078873,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Matrix multiplication; Reduction (mathematics); Multiplication (music); Scalability; Matrix (chemical analysis); Speedup; Pairing","authors":[{"name":"Biniyam Deressa","is_ca":true},{"name":"M.A. Hasan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02046300906745037,"gpt":0.3656531668869679,"spread":0.3451901578195176,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003607611,0.0008991868,0.0007445939,0.000868876,0.001040913,0.003322451,0.00389167,0.00118447,0.0166066],"category_scores_gemma":[0.01214657,0.00105967,0.0009919462,0.0008237895,0.002043688,0.007921811,0.007614361,0.003444732,0.004898983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009081941,"about_ca_system_score_gemma":0.003240425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006192913,"about_ca_topic_score_gemma":0.0008611513,"domain_scores_codex":[0.9953582,0.001269216,0.0003026832,0.0005629904,0.002026165,0.0004807963],"domain_scores_gemma":[0.9914393,0.003527274,0.0006797598,0.003196703,0.0008732331,0.0002837452],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001192349,0.0003311069,0.001260583,0.001435874,0.0001667879,0.0008760588,0.0009310295,0.04531139,0.05281619,0.6037438,0.02675971,0.2651752],"study_design_scores_gemma":[0.0003764701,0.000459766,0.0005402872,0.0002024544,0.00009193487,0.0009104636,0.0001850742,0.4198863,0.1781585,0.3306802,0.06832583,0.0001827304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00670358,0.0001486359,0.9808772,0.0003414912,0.00009819927,0.0002552718,0.0004416174,0.006512655,0.004621343],"genre_scores_gemma":[0.5026084,0.0005738078,0.4810437,0.0004866144,0.0001643635,0.0006591094,0.001710438,0.001412278,0.01134135],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0166066,"threshold_uncertainty_score":0.05555463,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","authors":[{"name":"Jean Belo Klamti","is_ca":true},{"name":"M.A. Hasan","is_ca":true},{"name":"Koray Karabina","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0316288580653663,"gpt":0.3874194951174436,"spread":0.3557906370520773,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001128136,0.0007736429,0.0008769137,0.001326267,0.0006244087,0.001478412,0.001440321,0.0009075566,0.006855527],"category_scores_gemma":[0.003357769,0.0005343171,0.001084591,0.000912645,0.001464539,0.00326247,0.00300405,0.001865189,0.002276668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007195759,"about_ca_system_score_gemma":0.001249021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003971489,"about_ca_topic_score_gemma":0.0006130846,"domain_scores_codex":[0.9983963,0.0002712261,0.000113343,0.0002462918,0.0007422645,0.0002304616],"domain_scores_gemma":[0.9978465,0.0007874647,0.0001655528,0.0009329796,0.0002101606,0.00005728433],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004422124,0.0002616642,0.0008117601,0.0004457549,0.00009578022,0.000248109,0.0003723264,0.04016412,0.06202606,0.2286503,0.004244761,0.6622372],"study_design_scores_gemma":[0.0003423311,0.0004290229,0.0006147691,0.00009104098,0.000068067,0.001468786,0.0001856645,0.624119,0.1217311,0.2298707,0.02097361,0.0001058264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01086123,0.0002134591,0.9840479,0.0001102733,0.00003531376,0.0001281861,0.00003685832,0.001129542,0.003437246],"genre_scores_gemma":[0.2986701,0.0004223309,0.6940219,0.0001130376,0.00007217393,0.0002500544,0.0001712859,0.0002484098,0.00603074],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006855527,"threshold_uncertainty_score":0.02293402,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Encryption; Computer security; Computer science","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.0448877442252007,"gpt":0.3453695030706029,"spread":0.3004817588454022,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002709469,0.0007533722,0.0007743295,0.001349081,0.001901423,0.004266725,0.001430198,0.00198992,0.007284531],"category_scores_gemma":[0.01414426,0.0008063198,0.001098494,0.001223497,0.004728706,0.01151302,0.006739711,0.004890211,0.001764909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002764427,"about_ca_system_score_gemma":0.001803985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001340886,"about_ca_topic_score_gemma":0.0008694764,"domain_scores_codex":[0.9958292,0.001029815,0.0003388016,0.000902244,0.001160469,0.0007396076],"domain_scores_gemma":[0.9875695,0.005254424,0.00104493,0.004458006,0.001102133,0.0005709644],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006446004,0.00005432269,0.001003273,0.0001126463,0.000026215,0.0003141833,0.0005217035,0.0188087,0.002711153,0.9410123,0.003707734,0.03108316],"study_design_scores_gemma":[0.00006676864,0.0001093011,0.000323143,0.00007871058,0.00003210457,0.0003336837,0.0001112809,0.06404438,0.004335152,0.9218284,0.008676026,0.00006099069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2200174,0.002351581,0.7160167,0.004753092,0.0004238907,0.0003252017,0.0008609517,0.00152356,0.05372771],"genre_scores_gemma":[0.9320763,0.0009854609,0.0496418,0.00071901,0.0002902017,0.0002166586,0.0004547685,0.0003179201,0.01529795],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007284531,"threshold_uncertainty_score":0.02436918,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Nilanjan Datta","is_ca":false},{"name":"Avijit Dutta","is_ca":false},{"name":"Devdutta Kanungo","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0299752039838677,"gpt":0.3573693460442463,"spread":0.3273941420603786,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004423865,0.0008821461,0.001216787,0.001386286,0.002142722,0.002716059,0.001827355,0.001718702,0.00355414],"category_scores_gemma":[0.009654657,0.0006260391,0.001413064,0.001294038,0.003578573,0.007172418,0.008154324,0.004811976,0.0009349933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002619583,"about_ca_system_score_gemma":0.003261651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001482474,"about_ca_topic_score_gemma":0.001224584,"domain_scores_codex":[0.9913902,0.001865972,0.0003251824,0.001193207,0.003433767,0.001791553],"domain_scores_gemma":[0.9856408,0.00447665,0.001448773,0.006481582,0.001461082,0.0004911954],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001705069,0.0002424732,0.002336495,0.0004204478,0.0001039483,0.0005167623,0.000793019,0.03474275,0.03435086,0.8151889,0.007336612,0.1022626],"study_design_scores_gemma":[0.0002668023,0.0008892216,0.00283693,0.0001818544,0.0001410657,0.002374546,0.0003368046,0.5064524,0.0770523,0.3695171,0.03955908,0.0003919168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2072455,0.00360756,0.7352976,0.002739109,0.0003421014,0.0006380846,0.0006768527,0.002956531,0.04649666],"genre_scores_gemma":[0.9355698,0.0004284755,0.0572395,0.0004976445,0.0001106786,0.0002862745,0.000249709,0.0001044688,0.005513485],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004423865,"threshold_uncertainty_score":0.02339596,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Functional encryption; Encryption; Access control; Construct (python library); Scheme (mathematics); Bilinear interpolation; Protocol (science)","authors":[{"name":"Ojaswi Acharya","is_ca":false},{"name":"Roman Langrehr","is_ca":true},{"name":"Adam O’Neill","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03872075544904145,"gpt":0.3561417527818141,"spread":0.3174209973327727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002073265,0.000714936,0.0009025162,0.0005103819,0.0006514175,0.002065399,0.001739471,0.001030666,0.004160821],"category_scores_gemma":[0.005254238,0.0003329517,0.001014983,0.0008761553,0.002456746,0.006159112,0.00411567,0.003304366,0.00164598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001041831,"about_ca_system_score_gemma":0.00135807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004411186,"about_ca_topic_score_gemma":0.00031555,"domain_scores_codex":[0.9971221,0.0006918244,0.0002241997,0.0005246084,0.0009729541,0.0004643652],"domain_scores_gemma":[0.9954456,0.0009812006,0.0003612859,0.002552435,0.0005099211,0.0001495127],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001796234,0.00009956967,0.000426215,0.0001732146,0.00002415753,0.0002532622,0.0005069977,0.01875244,0.008807103,0.9318466,0.003369965,0.03556087],"study_design_scores_gemma":[0.00009022636,0.0003319673,0.0004374826,0.00009117176,0.00006044734,0.001226468,0.0001246697,0.2305519,0.02906075,0.7001378,0.03777985,0.0001073611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02739643,0.0003951774,0.9528956,0.0008363114,0.000136344,0.0001555253,0.0003604547,0.0006933993,0.01713078],"genre_scores_gemma":[0.8390823,0.0006225787,0.1457431,0.0007213305,0.0002166407,0.0002787155,0.000405128,0.0001870569,0.0127432],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004160821,"threshold_uncertainty_score":0.01391935,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Alex B. Grilo","is_ca":false},{"name":"Philippe Lamontagne","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06019643846856042,"gpt":0.3417737951162954,"spread":0.2815773566477349,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008591052,0.00101077,0.002139297,0.00177944,0.002200236,0.008220837,0.005627498,0.003165696,0.01254022],"category_scores_gemma":[0.05288807,0.001391426,0.002618972,0.001989783,0.00701703,0.03210042,0.006751836,0.006885382,0.001365799],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006841286,"about_ca_system_score_gemma":0.004892063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002867925,"about_ca_topic_score_gemma":0.001447043,"domain_scores_codex":[0.9871745,0.004008429,0.0006894259,0.001757343,0.004400482,0.001969878],"domain_scores_gemma":[0.8875791,0.09097601,0.004175934,0.01400873,0.001949245,0.001310899],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006890201,0.0001217466,0.0007496123,0.000329009,0.0001009924,0.0002456714,0.0006859952,0.1019193,0.003102454,0.8755808,0.002049993,0.01442545],"study_design_scores_gemma":[0.0000790541,0.00006351116,0.0002940437,0.0000289178,0.00004135423,0.000106347,0.0000776313,0.2384864,0.003260245,0.7558498,0.001676124,0.00003662157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2135255,0.001422895,0.7437198,0.0100932,0.0001121281,0.0006429612,0.001409556,0.001345241,0.02772871],"genre_scores_gemma":[0.8855607,0.001283861,0.09991119,0.0007213965,0.0002935471,0.0006124527,0.0008829105,0.0005442152,0.01018977],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01254022,"threshold_uncertainty_score":0.04963726,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}