{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004169911,0.0001134908,0.0001906997,0.0004754039,0.0002559025,0.00008167041,0.00297096,0.0001130293,0.000001301746],"category_scores_gemma":[0.00005732831,0.0001140831,0.00006970693,0.0006655577,0.0001332028,0.0005432576,0.00103063,0.0002188297,0.000001357315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004948429,"about_ca_system_score_gemma":0.00004611008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005454247,"about_ca_topic_score_gemma":0.0001807284,"domain_scores_codex":[0.99891,0.0001565914,0.0002950948,0.0002732228,0.00005222948,0.0003128751],"domain_scores_gemma":[0.9971159,0.0004358315,0.00006963676,0.002277439,0.00007789321,0.00002336304],"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.000006653602,0.00005917896,0.0007154365,0.0000151696,0.00001168902,0.00000104314,0.0007406894,0.00008788688,0.0005637939,0.9600588,0.0002871604,0.03745247],"study_design_scores_gemma":[0.0003773082,0.00002546085,0.000171038,0.00005128069,0.000004660838,0.000006354173,0.00009446205,0.1034792,0.004368468,0.8641597,0.02710267,0.0001593333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002268614,0.001042559,0.9779776,0.004461213,0.0001314824,0.0003261316,0.000003684318,0.0003685527,0.0134202],"genre_scores_gemma":[0.5322467,0.0001276475,0.466949,0.0003281939,0.000004316785,0.0002983966,0.000008429976,0.000004588704,0.00003264458],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5299781,"threshold_uncertainty_score":0.5520833,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006521202,0.000167953,0.0002857336,0.001514809,0.0003531648,0.000217673,0.002092272,0.0001196446,0.00005252085],"category_scores_gemma":[0.0000669955,0.000179714,0.0002176283,0.00420709,0.0002219722,0.0003308558,0.0006302533,0.0005693747,0.00005070201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008446085,"about_ca_system_score_gemma":0.0001362037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002128207,"about_ca_topic_score_gemma":0.003262198,"domain_scores_codex":[0.9981334,0.0003946612,0.0004826354,0.0004473409,0.0001751504,0.000366871],"domain_scores_gemma":[0.9968797,0.0007212684,0.00007817313,0.002151792,0.00009968974,0.00006937677],"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.000003017451,0.0001491828,0.001804745,0.00001491459,0.0001435214,0.000008706243,0.002348259,0.1465143,0.00003845559,0.8404911,0.0001167184,0.008367136],"study_design_scores_gemma":[0.0001783232,0.00003288439,0.001022259,0.000009508626,0.00006480241,0.000004684122,0.000166172,0.9078223,0.00003288651,0.0850982,0.005398934,0.0001690087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004632426,0.002228592,0.9834257,0.006118434,0.0001098971,0.0001618785,0.000007734476,0.0004094433,0.002905935],"genre_scores_gemma":[0.850037,0.0002874935,0.1491467,0.000279928,0.000008070225,0.0001287662,0.00008155416,0.00001131685,0.00001920698],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8454046,"threshold_uncertainty_score":0.7328523,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004164268,0.000175151,0.0002465249,0.0005430148,0.000390822,0.0001184003,0.003658998,0.000169602,0.000008588773],"category_scores_gemma":[0.00006174025,0.0001598491,0.00006005943,0.001888383,0.0004004854,0.0002602828,0.001441097,0.0006883499,0.000009317162],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007887878,"about_ca_system_score_gemma":0.0001613771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007174109,"about_ca_topic_score_gemma":0.001020216,"domain_scores_codex":[0.9985139,0.0002402375,0.0003157714,0.0004302936,0.0001528945,0.0003469296],"domain_scores_gemma":[0.9961591,0.0005417914,0.0001067169,0.003033536,0.0001111104,0.00004770842],"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.00001823673,0.0002462115,0.004249255,0.000008235683,0.00002818843,0.000006914162,0.001056335,0.0006699678,0.00007604406,0.9913542,0.000590594,0.001695828],"study_design_scores_gemma":[0.002967973,0.0003369444,0.05239749,0.0004917933,0.000061985,0.00007820693,0.001907865,0.1566707,0.0006254815,0.6655542,0.117761,0.001146434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03118545,0.004829442,0.9305035,0.008334835,0.0002523881,0.0004159723,0.00001885328,0.00024409,0.02421546],"genre_scores_gemma":[0.802218,0.0001484182,0.1970159,0.0005101914,0.000007436531,0.00007128722,0.00001923078,0.000005442577,0.000004089846],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7710326,"threshold_uncertainty_score":0.679939,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006186418,0.0001651502,0.0002744714,0.0006024701,0.0001920505,0.0001236476,0.002611068,0.0001294763,0.00002871426],"category_scores_gemma":[0.0003961986,0.0001619989,0.00008071191,0.00136526,0.0001883872,0.0003696952,0.001678984,0.0004218193,0.0001127598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009598245,"about_ca_system_score_gemma":0.0001632359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004004774,"about_ca_topic_score_gemma":0.005192378,"domain_scores_codex":[0.9983013,0.0002621593,0.0004513205,0.0004857536,0.0001156903,0.0003837311],"domain_scores_gemma":[0.9946089,0.002765387,0.00004889753,0.002379292,0.0000981476,0.00009938757],"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.00006281969,0.0003760655,0.0010136,0.00007930386,0.00003523661,0.00004203712,0.005947632,0.0003166921,0.0001857606,0.9127308,0.007803721,0.07140634],"study_design_scores_gemma":[0.001400948,0.000255366,0.008238647,0.0005349204,0.00002979007,0.00009087546,0.0005623422,0.4765062,0.0001064658,0.04864493,0.4628912,0.0007383809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007686862,0.001102676,0.9713485,0.01601611,0.001141752,0.001071512,0.00009956045,0.000249798,0.001283293],"genre_scores_gemma":[0.2899591,0.000241398,0.7076519,0.001550233,0.00005107596,0.0004388776,0.00008522491,0.00001657522,0.000005627992],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8640859,"threshold_uncertainty_score":0.6606124,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004310504,0.0001307586,0.0001769636,0.0003057152,0.00018807,0.0001548348,0.002906187,0.00009676795,0.00001402887],"category_scores_gemma":[0.0000620996,0.0001236998,0.00006108374,0.001062523,0.0001609273,0.0001959491,0.001258571,0.0005682644,0.000215082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005074192,"about_ca_system_score_gemma":0.0001264781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001173942,"about_ca_topic_score_gemma":0.0001137215,"domain_scores_codex":[0.9986516,0.0002582897,0.0003014194,0.0003575735,0.0001111926,0.0003199875],"domain_scores_gemma":[0.9968362,0.000774801,0.00003779615,0.002257399,0.0000425358,0.00005120974],"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":[8.866485e-7,0.00005962334,0.0001385774,0.00001487673,0.00001092698,0.00002442911,0.0009783074,0.0009167414,0.00007732253,0.9471139,0.001290952,0.04937346],"study_design_scores_gemma":[0.00008111057,0.00002733619,0.0003660869,0.00004898259,0.000002315845,0.00009215554,0.00002479785,0.7466332,0.00001912278,0.1351363,0.1174523,0.0001163517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0191308,0.01632692,0.8956568,0.04959724,0.001581131,0.000248241,0.000005754445,0.001763094,0.01569006],"genre_scores_gemma":[0.6112406,0.0002926096,0.387916,0.0004064832,0.00004426341,0.00003536054,0.000006707238,0.00001326166,0.00004478767],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8119776,"threshold_uncertainty_score":0.5400467,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000473735,0.0001611991,0.0002370614,0.0005330574,0.0003942856,0.00008358058,0.002546082,0.000168092,0.0000178561],"category_scores_gemma":[0.0001388092,0.0001594087,0.00005512712,0.001615336,0.0002295232,0.000443391,0.001052169,0.0006705879,0.00002207978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005715932,"about_ca_system_score_gemma":0.0001327478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001678237,"about_ca_topic_score_gemma":0.001527577,"domain_scores_codex":[0.9983279,0.0005044744,0.000342947,0.0003975042,0.0001347182,0.0002924313],"domain_scores_gemma":[0.9967808,0.0004446702,0.0001348451,0.002477866,0.000116617,0.00004523993],"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.00001068712,0.0001249022,0.006510018,0.000008741261,0.00002063973,0.000003217378,0.001679372,0.000143001,0.0001389355,0.9869921,0.0001241734,0.004244165],"study_design_scores_gemma":[0.001196353,0.0001370219,0.01468445,0.0001172177,0.00002466312,0.00002970898,0.000720873,0.07126635,0.0002964968,0.8668336,0.04432188,0.0003714387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02455042,0.0008071989,0.9586062,0.006685983,0.0001619432,0.0002586242,0.000004804475,0.0002347069,0.008690059],"genre_scores_gemma":[0.6726593,0.0002146696,0.3267411,0.000258156,0.000005781037,0.00006879778,0.00004061167,0.000005326965,0.000006249302],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6481089,"threshold_uncertainty_score":0.6500499,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006645774,0.0001669557,0.0002092583,0.0003742356,0.0005483311,0.0001413643,0.003803605,0.0001525864,0.00008149432],"category_scores_gemma":[0.0001702864,0.0001338289,0.0001149603,0.001439351,0.0004694215,0.0002799063,0.0008931436,0.0006290711,0.0001112711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000584622,"about_ca_system_score_gemma":0.0001166163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005589815,"about_ca_topic_score_gemma":0.0005681381,"domain_scores_codex":[0.9982086,0.0005928111,0.0003691913,0.0003842434,0.0001444115,0.0003007219],"domain_scores_gemma":[0.9938305,0.001290683,0.00009679786,0.004656421,0.00008586742,0.00003975477],"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.00002751729,0.0003054175,0.0004364468,0.000004416855,0.00002958424,0.000001853359,0.000369339,0.00001045086,0.0001022688,0.9794129,0.009821077,0.009478743],"study_design_scores_gemma":[0.00064347,0.0001370351,0.01441634,0.00005304935,0.00002096521,0.000009110339,0.0002062802,0.005273012,0.0001805124,0.6139581,0.3648707,0.0002314459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06046059,0.003800356,0.7304972,0.1116619,0.002329396,0.001010841,0.00003408675,0.0004414977,0.08976407],"genre_scores_gemma":[0.9544747,0.0004852565,0.03871194,0.005948762,0.00003001322,0.0002724286,0.00003034787,0.000009083191,0.00003741018],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8940142,"threshold_uncertainty_score":0.7068107,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004804404,0.0001905849,0.0002927548,0.0006682689,0.0003201931,0.00009770658,0.004155698,0.0001827136,0.0000110333],"category_scores_gemma":[0.0002664148,0.0002047119,0.0001028553,0.001720483,0.0002736531,0.0005821752,0.002107075,0.000558825,0.000120994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001303547,"about_ca_system_score_gemma":0.0001800179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001765018,"about_ca_topic_score_gemma":0.001363894,"domain_scores_codex":[0.9981519,0.0004228776,0.0005107736,0.0004976487,0.00008803787,0.0003287678],"domain_scores_gemma":[0.9939203,0.001411064,0.0001588521,0.004237487,0.0002162973,0.0000559588],"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.00001867056,0.0006499398,0.01173195,0.0000220614,0.00003230239,0.000001587621,0.001844056,0.00001728189,0.0003320657,0.9579328,0.00283868,0.02457855],"study_design_scores_gemma":[0.002330313,0.0001153965,0.08696219,0.0001998518,0.00003560699,0.00003374152,0.0003272734,0.1022777,0.00158545,0.5982274,0.2072521,0.0006529721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007779789,0.001931291,0.9576731,0.008338929,0.0004320916,0.0006657615,0.00002015041,0.0002258025,0.02293313],"genre_scores_gemma":[0.8009666,0.0002918034,0.1980818,0.0002560664,0.00001156468,0.0003034456,0.00006046304,0.000006918536,0.00002133559],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7931868,"threshold_uncertainty_score":0.8347908,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007064932,0.0001193796,0.0002267137,0.000570126,0.0003337994,0.00004277441,0.002623741,0.0001428473,0.000003493555],"category_scores_gemma":[0.0005291698,0.0001189629,0.0001036047,0.001337496,0.0003190412,0.00004084271,0.0009844842,0.0002617098,0.00001177109],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005825469,"about_ca_system_score_gemma":0.0001047627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004569955,"about_ca_topic_score_gemma":0.0001046978,"domain_scores_codex":[0.9984763,0.000546207,0.0003333961,0.0003097962,0.00005770588,0.0002765919],"domain_scores_gemma":[0.9931148,0.004387096,0.00007825386,0.002251612,0.0001294385,0.00003876577],"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.000007820987,0.0002585245,0.0004671378,0.0000184817,0.00002098571,0.000002001108,0.000429147,0.003936903,0.0005012376,0.8772097,0.0001543078,0.1169938],"study_design_scores_gemma":[0.0006393802,0.00004949121,0.0003773504,0.00003567877,0.00001388393,0.000009158412,0.0001026095,0.8116913,0.0004227356,0.1462338,0.04028649,0.0001381381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004252288,0.002850748,0.9804209,0.009973556,0.0003693543,0.0004169962,0.000001844963,0.0001661914,0.00154816],"genre_scores_gemma":[0.3859789,0.0001359068,0.6133646,0.0003936841,0.000003756192,0.000104909,0.000002639354,0.000004826943,0.00001075078],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8077545,"threshold_uncertainty_score":0.4875607,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008242449,0.0005032945,0.0007842258,0.001225246,0.0007784205,0.0003819024,0.008444846,0.0006390348,0.0001376515],"category_scores_gemma":[0.0003641315,0.0006096763,0.0002794117,0.003481752,0.0009178445,0.000674881,0.005433032,0.001309126,0.0002487362],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002200966,"about_ca_system_score_gemma":0.0003981434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00172496,"about_ca_topic_score_gemma":0.01461477,"domain_scores_codex":[0.9951227,0.001310782,0.001209924,0.001213004,0.0003431964,0.0008004238],"domain_scores_gemma":[0.9892914,0.001510749,0.0001730979,0.008525234,0.0002670641,0.0002323963],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00003790269,0.0008575096,0.09021061,0.00004861321,0.0001698079,0.00003794608,0.005129823,0.0001112703,0.0003069886,0.8524759,0.00236059,0.04825297],"study_design_scores_gemma":[0.00097812,0.000114902,0.4554057,0.0007687179,0.000140313,0.00002878488,0.001513873,0.009339884,0.0003038484,0.4404111,0.08995614,0.001038711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.209797,0.03233156,0.7184338,0.02761598,0.001819444,0.001146765,0.0004207413,0.0003330271,0.008101742],"genre_scores_gemma":[0.8559186,0.004456768,0.1369079,0.00205812,0.00008226874,0.0002132126,0.0003372704,0.00002137138,0.00000445055],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6461216,"threshold_uncertainty_score":0.9996355,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003523803,0.000100502,0.0002225348,0.0004603742,0.0001588047,0.00003269631,0.00147405,0.00009057704,0.000009729091],"category_scores_gemma":[0.0000776617,0.0001045047,0.00004435561,0.0009625878,0.0003159383,0.000182403,0.00119803,0.0002221685,0.000002851636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000253528,"about_ca_system_score_gemma":0.00008116749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002116769,"about_ca_topic_score_gemma":0.002330518,"domain_scores_codex":[0.998837,0.0002514196,0.0004210821,0.000234876,0.00007053359,0.0001850681],"domain_scores_gemma":[0.9976271,0.000449011,0.0001013947,0.001682777,0.0001077685,0.00003198994],"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.000002873896,0.0001977089,0.02885058,0.00001504436,0.00001780904,8.659165e-7,0.00173686,0.000001524858,0.0003315693,0.9650643,0.0002702444,0.003510654],"study_design_scores_gemma":[0.00372964,0.0001254101,0.1921037,0.0001296618,0.00004273059,0.00003410592,0.001155492,0.04967907,0.002211229,0.5546888,0.1955675,0.0005326497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3179144,0.006924157,0.6416097,0.02230211,0.0004389732,0.0007730344,0.00002946589,0.0001710152,0.009837129],"genre_scores_gemma":[0.7799219,0.0007949479,0.2189889,0.0002263561,0.000002188261,0.00004545835,0.00000644935,0.000002627347,0.00001120299],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4620075,"threshold_uncertainty_score":0.4261578,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008643739,0.0001665191,0.0003606381,0.0007697719,0.0003721682,0.0001963778,0.004042904,0.000124666,0.00002652452],"category_scores_gemma":[0.0003983286,0.000165476,0.0001093573,0.00210515,0.0002342851,0.0009233495,0.001770684,0.0004750705,0.00003106369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000626312,"about_ca_system_score_gemma":0.0001597572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001687271,"about_ca_topic_score_gemma":0.0008860035,"domain_scores_codex":[0.998003,0.0005172787,0.0005844636,0.0004656891,0.0001224231,0.0003071356],"domain_scores_gemma":[0.9952241,0.0007039668,0.000162348,0.00369202,0.0001778054,0.00003976235],"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.00005045697,0.000232478,0.01011489,0.00001183532,0.0000390074,9.386699e-7,0.0001976262,0.00005251931,0.000262275,0.9710679,0.001265689,0.01670436],"study_design_scores_gemma":[0.004019616,0.00005462549,0.05073737,0.00008117045,0.00004667767,0.00001110421,0.00009287842,0.01720067,0.0002435787,0.8479449,0.07918624,0.0003811665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01452279,0.003964047,0.94732,0.016759,0.0009619339,0.0007382301,0.000006948491,0.0002992914,0.01542769],"genre_scores_gemma":[0.8820375,0.0005157834,0.1158263,0.001151844,0.00003294129,0.0003683231,0.00004916461,0.000006142096,0.0000120496],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8675147,"threshold_uncertainty_score":0.7512789,"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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001256152,0.0001127388,0.0002076351,0.0001687546,0.0004886156,0.00009046864,0.005681625,0.00007392735,4.820324e-7],"category_scores_gemma":[0.0001615612,0.0000741385,0.00005556668,0.0009611882,0.0009237565,0.00007835399,0.001251056,0.0006056374,0.000001787903],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005205239,"about_ca_system_score_gemma":0.0002032004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001825218,"about_ca_topic_score_gemma":0.002093763,"domain_scores_codex":[0.9980791,0.0008636402,0.0004420067,0.000214357,0.0001338423,0.0002670456],"domain_scores_gemma":[0.9951572,0.001579435,0.0001344004,0.003043416,0.00007116464,0.00001440688],"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.000004465521,0.0001486104,0.0004268722,0.000006615348,0.00000724732,9.843463e-7,0.002184419,0.007293882,0.00002113746,0.9818807,0.0001348462,0.007890274],"study_design_scores_gemma":[0.00013888,0.0000138804,0.003134211,0.00001657638,0.000001438101,0.000004545557,0.0001033563,0.5573428,0.000006542222,0.4378477,0.001349236,0.00004076207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1364919,0.00229249,0.7936743,0.06255689,0.0002378855,0.0005045271,0.000004294168,0.00006500621,0.004172698],"genre_scores_gemma":[0.8885909,0.00009372371,0.110835,0.0004048583,0.000005310639,0.00005443509,0.000002550574,0.000003522223,0.000009658316],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.752099,"threshold_uncertainty_score":0.9996981,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}