{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13649192,0.00229249,0.7936743,0.062556885,0.00023788546,0.00050452707,0.000004294168,0.000065006214,0.0041726977],"genre_scores_gemma":[0.88859093,0.00009372371,0.11083503,0.00040485826,0.0000053106387,0.00005443509,0.0000025505742,0.0000035222226,0.000009658316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980791,0.0008636402,0.00044200665,0.00021435703,0.0001338423,0.00026704563],"domain_scores_gemma":[0.9951572,0.0015794348,0.00013440037,0.0030434157,0.000071164635,0.0000144068845],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0012561516,0.00011273876,0.00020763512,0.00016875457,0.0004886156,0.00009046864,0.0056816246,0.000073927346,4.820324e-7],"category_scores_gemma":[0.00016156123,0.0000741385,0.000055566685,0.0009611882,0.0009237565,0.00007835399,0.0012510562,0.0006056374,0.0000017879026],"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.000004465521,0.00014861043,0.00042687223,0.0000066153484,0.0000072473204,9.843463e-7,0.0021844187,0.0072938823,0.000021137457,0.98188066,0.00013484617,0.007890274],"study_design_scores_gemma":[0.00013888004,0.0000138804,0.0031342113,0.000016576381,0.0000014381005,0.000004545557,0.000103356295,0.5573428,0.0000065422223,0.43784773,0.0013492355,0.00004076207],"about_ca_topic_score_codex":0.00018252184,"about_ca_topic_score_gemma":0.0020937633,"teacher_disagreement_score":0.752099,"about_ca_system_score_codex":0.00005205239,"about_ca_system_score_gemma":0.0002032004,"threshold_uncertainty_score":0.9996981},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004632426,0.002228592,0.9834257,0.0061184345,0.0001098971,0.0001618785,0.000007734476,0.00040944325,0.0029059353],"genre_scores_gemma":[0.850037,0.00028749355,0.14914669,0.00027992798,0.000008070225,0.00012876625,0.00008155416,0.000011316853,0.000019206984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813336,0.00039466115,0.00048263537,0.00044734092,0.00017515037,0.000366871],"domain_scores_gemma":[0.9968797,0.0007212684,0.00007817313,0.0021517924,0.00009968974,0.000069376765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065212016,0.000167953,0.00028573358,0.001514809,0.00035316477,0.00021767302,0.0020922716,0.00011964459,0.00005252085],"category_scores_gemma":[0.000066995504,0.00017971397,0.00021762827,0.0042070895,0.0002219722,0.0003308558,0.00063025334,0.0005693747,0.000050702012],"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.000003017451,0.00014918284,0.0018047454,0.000014914593,0.00014352136,0.000008706243,0.002348259,0.14651428,0.00003845559,0.84049106,0.000116718365,0.008367136],"study_design_scores_gemma":[0.0001783232,0.000032884385,0.0010222595,0.000009508626,0.000064802414,0.0000046841224,0.000166172,0.9078223,0.000032886506,0.0850982,0.0053989342,0.00016900865],"about_ca_topic_score_codex":0.00021282068,"about_ca_topic_score_gemma":0.0032621978,"teacher_disagreement_score":0.84540457,"about_ca_system_score_codex":0.00008446085,"about_ca_system_score_gemma":0.00013620374,"threshold_uncertainty_score":0.7328523},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076868623,0.0011026758,0.97134846,0.016016107,0.0011417519,0.0010715122,0.00009956045,0.00024979797,0.0012832935],"genre_scores_gemma":[0.28995913,0.00024139803,0.70765185,0.0015502332,0.000051075964,0.00043887759,0.00008522491,0.000016575223,0.000005627992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983013,0.00026215927,0.0004513205,0.00048575364,0.00011569032,0.00038373107],"domain_scores_gemma":[0.9946089,0.0027653868,0.000048897535,0.0023792924,0.000098147604,0.000099387566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006186418,0.00016515024,0.00027447141,0.0006024701,0.00019205053,0.00012364762,0.002611068,0.00012947626,0.00002871426],"category_scores_gemma":[0.00039619856,0.00016199892,0.000080711914,0.0013652605,0.0001883872,0.00036969516,0.0016789844,0.00042181928,0.000112759786],"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.00006281969,0.0003760655,0.0010135998,0.000079303856,0.00003523661,0.00004203712,0.0059476322,0.00031669205,0.00018576064,0.9127308,0.0078037214,0.07140634],"study_design_scores_gemma":[0.0014009477,0.00025536603,0.008238647,0.00053492043,0.000029790066,0.00009087546,0.0005623422,0.47650617,0.000106465806,0.048644926,0.46289116,0.0007383809],"about_ca_topic_score_codex":0.00040047744,"about_ca_topic_score_gemma":0.005192378,"teacher_disagreement_score":0.86408585,"about_ca_system_score_codex":0.000095982454,"about_ca_system_score_gemma":0.00016323595,"threshold_uncertainty_score":0.6606124},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019130802,0.01632692,0.89565676,0.049597237,0.001581131,0.00024824103,0.0000057544453,0.0017630943,0.015690057],"genre_scores_gemma":[0.61124057,0.0002926096,0.387916,0.00040648325,0.000044263412,0.000035360536,0.000006707238,0.000013261659,0.000044787666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865156,0.00025828966,0.00030141938,0.0003575735,0.000111192625,0.0003199875],"domain_scores_gemma":[0.99683625,0.00077480095,0.000037796148,0.0022573988,0.0000425358,0.000051209736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004310504,0.00013075859,0.00017696364,0.00030571525,0.00018807004,0.00015483484,0.002906187,0.00009676795,0.000014028873],"category_scores_gemma":[0.0000620996,0.00012369982,0.00006108374,0.0010625228,0.0001609273,0.00019594908,0.0012585714,0.0005682644,0.00021508201],"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":[8.866485e-7,0.000059623344,0.00013857738,0.0000148767285,0.000010926979,0.000024429113,0.0009783074,0.0009167414,0.000077322526,0.9471139,0.0012909522,0.049373455],"study_design_scores_gemma":[0.00008111057,0.000027336195,0.00036608687,0.000048982587,0.0000023158454,0.00009215554,0.00002479785,0.7466332,0.000019122783,0.13513632,0.11745226,0.000116351715],"about_ca_topic_score_codex":0.00011739421,"about_ca_topic_score_gemma":0.000113721464,"teacher_disagreement_score":0.81197757,"about_ca_system_score_codex":0.000050741917,"about_ca_system_score_gemma":0.00012647815,"threshold_uncertainty_score":0.5400467},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022686145,0.0010425594,0.9779776,0.0044612135,0.00013148242,0.0003261316,0.0000036843182,0.0003685527,0.013420197],"genre_scores_gemma":[0.5322467,0.00012764748,0.46694905,0.00032819386,0.000004316785,0.0002983966,0.000008429976,0.000004588704,0.00003264458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891,0.00015659143,0.00029509483,0.0002732228,0.000052229476,0.0003128751],"domain_scores_gemma":[0.99711585,0.0004358315,0.00006963676,0.0022774395,0.00007789321,0.000023363036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004169911,0.00011349077,0.0001906997,0.00047540388,0.00025590247,0.00008167041,0.0029709602,0.00011302929,0.0000013017457],"category_scores_gemma":[0.000057328314,0.00011408309,0.000069706926,0.00066555775,0.0001332028,0.0005432576,0.0010306295,0.00021882974,0.0000013573147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066536018,0.000059178958,0.00071543653,0.000015169601,0.000011689017,0.0000010431403,0.0007406894,0.00008788688,0.00056379393,0.9600588,0.0002871604,0.03745247],"study_design_scores_gemma":[0.00037730817,0.000025460853,0.00017103803,0.000051280687,0.000004660838,0.000006354173,0.00009446205,0.103479244,0.004368468,0.8641597,0.027102673,0.00015933329],"about_ca_topic_score_codex":0.00005454247,"about_ca_topic_score_gemma":0.00018072841,"teacher_disagreement_score":0.5299781,"about_ca_system_score_codex":0.00004948429,"about_ca_system_score_gemma":0.000046110083,"threshold_uncertainty_score":0.55208325},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042522885,0.0028507484,0.9804209,0.009973556,0.00036935427,0.0004169962,0.000001844963,0.00016619136,0.0015481595],"genre_scores_gemma":[0.3859789,0.0001359068,0.61336464,0.00039368414,0.0000037561917,0.00010490903,0.0000026393539,0.0000048269426,0.000010750777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984763,0.00054620695,0.00033339614,0.00030979622,0.000057705878,0.00027659195],"domain_scores_gemma":[0.9931148,0.004387096,0.00007825386,0.002251612,0.00012943851,0.000038765775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070649316,0.00011937961,0.00022671369,0.000570126,0.0003337994,0.00004277441,0.0026237413,0.00014284732,0.0000034935551],"category_scores_gemma":[0.0005291698,0.00011896294,0.00010360473,0.0013374957,0.0003190412,0.000040842708,0.0009844842,0.00026170976,0.000011771087],"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.000007820987,0.00025852452,0.0004671378,0.000018481704,0.000020985713,0.0000020011078,0.00042914695,0.003936903,0.0005012376,0.87720966,0.0001543078,0.11699381],"study_design_scores_gemma":[0.0006393802,0.000049491206,0.0003773504,0.000035678768,0.000013883931,0.000009158412,0.00010260946,0.81169134,0.00042273555,0.14623375,0.040286493,0.00013813813],"about_ca_topic_score_codex":0.00004569955,"about_ca_topic_score_gemma":0.00010469777,"teacher_disagreement_score":0.80775446,"about_ca_system_score_codex":0.000058254693,"about_ca_system_score_gemma":0.00010476273,"threshold_uncertainty_score":0.48756075},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031185454,0.004829442,0.9305035,0.008334835,0.0002523881,0.00041597232,0.000018853283,0.00024408998,0.024215458],"genre_scores_gemma":[0.802218,0.00014841817,0.19701588,0.00051019137,0.0000074365307,0.00007128722,0.000019230782,0.0000054425773,0.0000040898462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985139,0.00024023745,0.0003157714,0.0004302936,0.00015289451,0.00034692962],"domain_scores_gemma":[0.99615914,0.00054179144,0.0001067169,0.0030335358,0.00011111037,0.00004770842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004164268,0.000175151,0.00024652493,0.00054301484,0.00039082198,0.00011840029,0.003658998,0.00016960196,0.000008588773],"category_scores_gemma":[0.000061740255,0.0001598491,0.000060059432,0.0018883826,0.00040048538,0.0002602828,0.0014410974,0.0006883499,0.000009317162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018236726,0.0002462115,0.004249255,0.000008235683,0.000028188431,0.0000069141624,0.0010563346,0.0006699678,0.00007604406,0.99135417,0.000590594,0.0016958276],"study_design_scores_gemma":[0.002967973,0.00033694436,0.05239749,0.00049179327,0.000061985,0.000078206926,0.0019078648,0.15667067,0.0006254815,0.66555417,0.11776096,0.0011464345],"about_ca_topic_score_codex":0.00007174109,"about_ca_topic_score_gemma":0.0010202156,"teacher_disagreement_score":0.7710326,"about_ca_system_score_codex":0.00007887878,"about_ca_system_score_gemma":0.00016137715,"threshold_uncertainty_score":0.679939},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20979697,0.032331564,0.7184338,0.027615976,0.0018194444,0.001146765,0.0004207413,0.00033302713,0.008101742],"genre_scores_gemma":[0.8559186,0.0044567683,0.13690792,0.0020581202,0.000082268736,0.00021321262,0.00033727038,0.000021371377,0.0000044505505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9951227,0.0013107824,0.0012099243,0.0012130038,0.00034319639,0.00080042385],"domain_scores_gemma":[0.9892914,0.0015107493,0.00017309785,0.008525234,0.0002670641,0.00023239625],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008242449,0.00050329446,0.00078422576,0.0012252458,0.0007784205,0.00038190236,0.008444846,0.00063903484,0.00013765151],"category_scores_gemma":[0.00036413153,0.0006096763,0.0002794117,0.0034817522,0.00091784453,0.00067488104,0.0054330323,0.0013091265,0.00024873624],"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.000037902693,0.0008575096,0.09021061,0.00004861321,0.00016980787,0.00003794608,0.0051298225,0.00011127029,0.0003069886,0.85247594,0.0023605896,0.048252974],"study_design_scores_gemma":[0.00097812,0.000114901966,0.45540565,0.0007687179,0.00014031297,0.000028784882,0.001513873,0.009339884,0.0003038484,0.44041106,0.08995614,0.0010387112],"about_ca_topic_score_codex":0.00172496,"about_ca_topic_score_gemma":0.014614767,"teacher_disagreement_score":0.6461216,"about_ca_system_score_codex":0.00022009664,"about_ca_system_score_gemma":0.0003981434,"threshold_uncertainty_score":0.99963546},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060460594,0.0038003563,0.73049724,0.111661926,0.0023293959,0.0010108412,0.000034086752,0.00044149772,0.089764066],"genre_scores_gemma":[0.95447475,0.00048525652,0.03871194,0.005948762,0.000030013223,0.0002724286,0.000030347868,0.000009083191,0.00003741018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820864,0.00059281115,0.0003691913,0.00038424338,0.00014441148,0.00030072188],"domain_scores_gemma":[0.9938305,0.0012906832,0.00009679786,0.0046564215,0.00008586742,0.000039754774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066457735,0.00016695571,0.00020925827,0.0003742356,0.00054833107,0.00014136435,0.0038036045,0.00015258645,0.00008149432],"category_scores_gemma":[0.00017028638,0.00013382887,0.0001149603,0.0014393515,0.0004694215,0.00027990632,0.00089314365,0.0006290711,0.00011127109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027517292,0.00030541752,0.0004364468,0.0000044168546,0.000029584242,0.0000018533585,0.00036933902,0.000010450864,0.0001022688,0.9794129,0.009821077,0.009478743],"study_design_scores_gemma":[0.00064347003,0.00013703505,0.014416335,0.000053049353,0.000020965213,0.000009110339,0.00020628017,0.0052730124,0.00018051242,0.61395806,0.3648707,0.00023144594],"about_ca_topic_score_codex":0.00005589815,"about_ca_topic_score_gemma":0.0005681381,"teacher_disagreement_score":0.8940142,"about_ca_system_score_codex":0.000058462203,"about_ca_system_score_gemma":0.0001166163,"threshold_uncertainty_score":0.70681065},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024550417,0.00080719887,0.95860624,0.0066859834,0.00016194322,0.0002586242,0.0000048044753,0.00023470691,0.008690059],"genre_scores_gemma":[0.67265934,0.00021466958,0.32674107,0.00025815595,0.0000057810366,0.00006879778,0.000040611667,0.0000053269655,0.0000062493023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983279,0.00050447445,0.00034294697,0.0003975042,0.00013471821,0.0002924313],"domain_scores_gemma":[0.99678075,0.00044467024,0.0001348451,0.0024778657,0.00011661698,0.000045239925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000473735,0.00016119915,0.00023706141,0.0005330574,0.00039428563,0.000083580584,0.0025460818,0.00016809195,0.000017856097],"category_scores_gemma":[0.00013880925,0.00015940871,0.000055127115,0.001615336,0.00022952324,0.00044339098,0.0010521692,0.0006705879,0.000022079781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010687116,0.00012490217,0.006510018,0.000008741261,0.00002063973,0.000003217378,0.0016793724,0.00014300097,0.00013893546,0.9869921,0.00012417343,0.004244165],"study_design_scores_gemma":[0.0011963531,0.00013702191,0.01468445,0.00011721771,0.00002466312,0.000029708981,0.000720873,0.07126635,0.00029649684,0.86683357,0.044321883,0.0003714387],"about_ca_topic_score_codex":0.00016782369,"about_ca_topic_score_gemma":0.0015275768,"teacher_disagreement_score":0.6481089,"about_ca_system_score_codex":0.000057159323,"about_ca_system_score_gemma":0.00013274775,"threshold_uncertainty_score":0.65004987},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31791437,0.006924157,0.6416097,0.022302113,0.00043897316,0.0007730344,0.000029465893,0.00017101523,0.009837129],"genre_scores_gemma":[0.7799219,0.0007949479,0.2189889,0.00022635615,0.0000021882613,0.000045458346,0.00000644935,0.0000026273472,0.0000112029875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998837,0.0002514196,0.0004210821,0.00023487599,0.00007053359,0.00018506807],"domain_scores_gemma":[0.9976271,0.00044901096,0.00010139469,0.001682777,0.000107768545,0.000031989937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003523803,0.000100501995,0.00022253483,0.00046037423,0.00015880466,0.00003269631,0.0014740502,0.00009057704,0.000009729091],"category_scores_gemma":[0.0000776617,0.00010450471,0.000044355613,0.0009625878,0.0003159383,0.00018240302,0.0011980296,0.00022216847,0.0000028516363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028738957,0.00019770888,0.028850576,0.000015044358,0.000017809041,8.6591655e-7,0.0017368605,0.0000015248578,0.00033156932,0.9650643,0.00027024443,0.003510654],"study_design_scores_gemma":[0.0037296403,0.00012541008,0.19210374,0.00012966184,0.00004273059,0.00003410592,0.0011554924,0.04967907,0.002211229,0.55468875,0.19556749,0.00053264975],"about_ca_topic_score_codex":0.00021167695,"about_ca_topic_score_gemma":0.0023305183,"teacher_disagreement_score":0.46200752,"about_ca_system_score_codex":0.000025352801,"about_ca_system_score_gemma":0.00008116749,"threshold_uncertainty_score":0.42615783},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014522792,0.0039640474,0.94732004,0.016759003,0.0009619339,0.00073823007,0.0000069484913,0.00029929142,0.015427688],"genre_scores_gemma":[0.88203746,0.0005157834,0.11582632,0.0011518436,0.000032941294,0.00036832315,0.000049164613,0.000006142096,0.000012049595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998003,0.0005172787,0.00058446365,0.00046568914,0.00012242305,0.00030713557],"domain_scores_gemma":[0.9952241,0.00070396677,0.00016234799,0.0036920197,0.00017780537,0.000039762348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008643739,0.00016651905,0.0003606381,0.00076977187,0.0003721682,0.00019637782,0.004042904,0.00012466597,0.000026524522],"category_scores_gemma":[0.00039832856,0.00016547595,0.00010935726,0.0021051497,0.00023428506,0.00092334946,0.0017706844,0.00047507047,0.000031063693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050456973,0.000232478,0.0101148905,0.000011835325,0.0000390074,9.386699e-7,0.00019762624,0.000052519314,0.00026227505,0.9710679,0.001265689,0.01670436],"study_design_scores_gemma":[0.004019616,0.00005462549,0.050737366,0.00008117045,0.00004667767,0.000011104207,0.00009287842,0.017200675,0.0002435787,0.8479449,0.07918624,0.00038116646],"about_ca_topic_score_codex":0.00016872711,"about_ca_topic_score_gemma":0.00088600355,"teacher_disagreement_score":0.86751467,"about_ca_system_score_codex":0.0000626312,"about_ca_system_score_gemma":0.00015975724,"threshold_uncertainty_score":0.7512789},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077797887,0.0019312911,0.9576731,0.008338929,0.00043209156,0.00066576153,0.000020150412,0.00022580252,0.022933125],"genre_scores_gemma":[0.8009666,0.00029180336,0.1980818,0.00025606636,0.000011564681,0.00030344556,0.000060463037,0.000006918536,0.000021335585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981519,0.0004228776,0.00051077356,0.0004976487,0.00008803787,0.00032876784],"domain_scores_gemma":[0.9939203,0.0014110643,0.00015885208,0.004237487,0.00021629734,0.000055958804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004804404,0.00019058493,0.00029275476,0.00066826894,0.00032019307,0.00009770658,0.004155698,0.00018271357,0.0000110332985],"category_scores_gemma":[0.00026641478,0.00020471188,0.000102855265,0.0017204833,0.0002736531,0.0005821752,0.0021070754,0.000558825,0.00012099397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018670564,0.00064993976,0.011731949,0.000022061398,0.000032302392,0.0000015876211,0.0018440558,0.000017281889,0.00033206568,0.95793283,0.00283868,0.02457855],"study_design_scores_gemma":[0.002330313,0.000115396535,0.08696219,0.00019985178,0.000035606987,0.00003374152,0.00032727342,0.10227772,0.0015854501,0.5982274,0.20725209,0.0006529721],"about_ca_topic_score_codex":0.00017650181,"about_ca_topic_score_gemma":0.0013638943,"teacher_disagreement_score":0.7931868,"about_ca_system_score_codex":0.00013035469,"about_ca_system_score_gemma":0.00018001795,"threshold_uncertainty_score":0.8347908},"labels":[],"label_agreement":null}]}