{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":6,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":6,"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"},"query_hash":"4f8fb9e0cf2e","filters":{"venue":"International Journal of Applied Cryptography"}},"results":[{"id":"W1964276265","doi":"10.1504/ijact.2012.045587","title":"Attribute-based encryption without key cloning","year":2012,"lang":"en","type":"article","venue":"International Journal of Applied Cryptography","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"Encryption; Computer science; Attribute-based encryption; Security token; Probabilistic encryption; Computer security; Scheme (mathematics); 40-bit encryption; On-the-fly encryption; Functional encryption; Construct (python library); Theoretical computer science; Ciphertext; Public-key cryptography; Computer network; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01302126793289369,"gpt":0.2579494220471807,"spread":0.2449281541142871,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000928417,0.0002105104,0.0002552679,0.0009514714,0.0001063388,0.0002624649,0.001699291,0.0001008317,0.00005454175],"category_scores_gemma":[0.00003242501,0.0001900566,0.0003785185,0.0006840051,0.00009453802,0.001281215,0.0001586669,0.0003745978,0.00002467098],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005204976,"about_ca_system_score_gemma":0.00007893205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005703361,"about_ca_topic_score_gemma":0.000001415059,"domain_scores_codex":[0.9976742,0.00004679207,0.0006071892,0.0002118993,0.001077704,0.0003822334],"domain_scores_gemma":[0.9981635,0.0001319864,0.0006237193,0.0003324755,0.0004774817,0.000270846],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002512024,0.0005891706,0.06736135,0.0000109454,0.0003332917,0.00001760619,0.001126994,0.0001880119,0.007287007,0.905968,0.001910044,0.0149564],"study_design_scores_gemma":[0.01445152,0.0009261479,0.2664574,0.0004988181,0.000314318,0.0007437977,0.0009141929,0.004764247,0.1018065,0.2547823,0.3514759,0.002864918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1085094,0.0003091107,0.8860016,0.0004583211,0.001986308,0.00009588204,0.00001517071,0.00007638791,0.002547777],"genre_scores_gemma":[0.8318058,0.00004259128,0.1668512,0.0005896561,0.0006782797,0.000006369864,0.00001536414,0.00001044478,2.777298e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7232964,"threshold_uncertainty_score":0.7750283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012885700","doi":"10.1504/ijact.2009.023472","title":"Comparing the pre- and post-specified peer models for key agreement","year":2009,"lang":"en","type":"article","venue":"International Journal of Applied Cryptography","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":14,"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":"Computer science; Identifier; Executable; Key (lock); Protocol (science); Computer security; Computer security model; Class (philosophy); Agreement; Theoretical computer science; Computer network; Programming language; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02350659957795969,"gpt":0.2917772969177468,"spread":0.2682706973397871,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004549079,0.00011195,0.0001437722,0.0001993912,0.00009354587,0.0002357879,0.001201087,0.0000296234,0.000004031679],"category_scores_gemma":[0.00001848412,0.00008125439,0.0001241914,0.00013531,0.00005440208,0.0004491657,0.00009759546,0.0001550904,0.000001179546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002784624,"about_ca_system_score_gemma":0.00002894888,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.033634e-7,"about_ca_topic_score_gemma":7.970914e-7,"domain_scores_codex":[0.9985699,0.00001434044,0.0004107611,0.0001714697,0.0006912814,0.0001422212],"domain_scores_gemma":[0.9983425,0.0001039323,0.0003942232,0.0002004102,0.0008882514,0.00007067643],"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.0001911817,0.00009586467,0.00004997352,0.000002320012,0.00007134091,0.000001211147,0.00213197,0.00170888,0.001910511,0.9768001,0.0001117371,0.01692492],"study_design_scores_gemma":[0.001184084,0.0001449201,0.008800318,0.00002347833,0.00001164647,0.00002744369,0.00009241071,0.02151311,0.002123599,0.9612542,0.004704137,0.0001206047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01381245,0.00006085441,0.9773554,0.005061704,0.0002057964,0.001055797,0.000003253884,0.00001911418,0.002425692],"genre_scores_gemma":[0.8972777,0.000014209,0.1015917,0.0008788037,0.0001339496,0.00008997909,0.000001647319,0.000004139493,0.00000792433],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8834652,"threshold_uncertainty_score":0.3313458,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038094103","doi":"10.1504/ijact.2010.038305","title":"On message recognition protocols: recoverability and explicit confirmation","year":2010,"lang":"en","type":"article","venue":"International Journal of Applied Cryptography","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":5,"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; Mitacs","keywords":"Computer science; Stateless protocol; Communication source; Protocol (science); Computer network; Computer security; Cryptographic protocol; Digital signature; Theoretical computer science; Cryptography; Network packet; Hash function","retraction":null,"screen_n_in":null,"score":{"opus":0.01573727562187839,"gpt":0.2730303475444942,"spread":0.2572930719226159,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006440365,0.0001012238,0.0001395976,0.0003703223,0.00005113948,0.0002872357,0.0006180491,0.00006752367,0.00005361486],"category_scores_gemma":[0.00005594414,0.00008865862,0.00009287917,0.0001649284,0.00003938444,0.0004231444,0.00004642422,0.000290316,0.00001829082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001547536,"about_ca_system_score_gemma":0.00003304039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002794373,"about_ca_topic_score_gemma":0.000003705686,"domain_scores_codex":[0.9986944,0.00003501655,0.0004627804,0.0001724204,0.0005421002,0.00009332273],"domain_scores_gemma":[0.9986948,0.0001324426,0.0004369176,0.000202591,0.0004419076,0.00009129538],"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.000369614,0.0006228682,0.001103233,0.00003478999,0.0002128964,0.00001075285,0.01168473,0.000003891679,0.03913333,0.8061138,0.001123207,0.1395869],"study_design_scores_gemma":[0.003292575,0.0003805044,0.01315061,0.0001673996,0.00001892778,0.0001792327,0.0002374246,0.004419287,0.02711253,0.9233041,0.0273052,0.0004322106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8713862,0.000007172403,0.1150955,0.001889914,0.001426821,0.002076662,0.0000114713,0.00006953205,0.008036814],"genre_scores_gemma":[0.9924794,0.000006545311,0.006752838,0.0004136976,0.0001416055,0.0001948344,0.000003700536,0.000005300023,0.000002032773],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1391546,"threshold_uncertainty_score":0.3615394,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4396648129","doi":"10.1504/ijact.2024.138459","title":"WeightedSim: privacy-preserving weighted similarity query over encrypted healthcare data","year":2024,"lang":"en","type":"article","venue":"International Journal of Applied Cryptography","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Kungliga Tekniska Högskolan; University of Windsor","keywords":"Computer science; Encryption; Query optimization; Similarity (geometry); Information privacy; Information retrieval; Data mining; Theoretical computer science; Computer security; Artificial intelligence; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.03226083083062638,"gpt":0.3125665444978971,"spread":0.2803057136672708,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001345089,0.000376892,0.0004388574,0.001781742,0.0001332462,0.001084974,0.07270743,0.0002762869,0.0001188334],"category_scores_gemma":[0.001795456,0.0003332964,0.0002578638,0.001758485,0.0001857944,0.002780012,0.07015866,0.001316932,0.00002902352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001869024,"about_ca_system_score_gemma":0.0003887383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005436189,"about_ca_topic_score_gemma":0.00001417513,"domain_scores_codex":[0.9954602,0.00009099853,0.001124263,0.0009103566,0.001894258,0.0005198914],"domain_scores_gemma":[0.9907798,0.0005137982,0.0005460312,0.007335236,0.0006020251,0.0002231497],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002100445,0.0003202494,0.002019706,0.0001523138,0.001731289,0.00102071,0.0003854314,0.00001438452,0.005339232,0.2489032,0.6346293,0.1052741],"study_design_scores_gemma":[0.0006478387,0.00007925602,0.001282546,0.0003937478,0.00004188212,0.0001840651,0.00004997227,0.07790712,0.002942005,0.8126948,0.1033517,0.000425007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03548092,0.004810537,0.8455943,0.09984489,0.007671233,0.0004523613,0.0004611277,0.001599966,0.004084658],"genre_scores_gemma":[0.5252791,0.001161093,0.4717268,0.0009413539,0.0007111458,0.00001076782,0.0001220203,0.00004405174,0.000003658594],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5637916,"threshold_uncertainty_score":0.999952,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4394879410","doi":"10.1504/ijact.2023.10063607","title":"WeightedSim: privacy-preserving weighted similarity query over encrypted healthcare data","year":2023,"lang":"en","type":"article","venue":"International Journal of Applied Cryptography","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Kungliga Tekniska Högskolan; University of Windsor","keywords":"Computer science; Encryption; Similarity (geometry); Query optimization; Information privacy; Homomorphic encryption; Information retrieval; Data mining; Theoretical computer science; Computer security; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04188996122838396,"gpt":0.3157970143525775,"spread":0.2739070531241936,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001620006,0.000362287,0.0004787312,0.002115326,0.00018698,0.0005121314,0.08390184,0.0002753512,0.00007607101],"category_scores_gemma":[0.003150292,0.000336156,0.0002272618,0.002808993,0.0001857515,0.002094627,0.09573816,0.001045558,0.00005192039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001367023,"about_ca_system_score_gemma":0.0002728739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005618788,"about_ca_topic_score_gemma":0.00001664792,"domain_scores_codex":[0.9951889,0.0001043584,0.001149078,0.0008269183,0.002099967,0.0006307889],"domain_scores_gemma":[0.9890058,0.000511976,0.0009814205,0.008490343,0.000770079,0.0002403946],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002745884,0.0003220559,0.008643324,0.00006769681,0.001169632,0.0006486776,0.000355512,0.00003644442,0.005664842,0.08776688,0.8410148,0.05403556],"study_design_scores_gemma":[0.001391524,0.00008885717,0.009713204,0.0001803425,0.00003021125,0.00008853615,0.000104147,0.06169312,0.003204822,0.8717638,0.05124286,0.000498559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2200914,0.001102344,0.5778944,0.181228,0.009061387,0.0009231219,0.0008205576,0.003567009,0.005311744],"genre_scores_gemma":[0.5513852,0.001324932,0.444923,0.001338758,0.0006597282,0.00001728866,0.0002922548,0.00005349921,0.000005309578],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7897719,"threshold_uncertainty_score":0.999909,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046088721","doi":"10.1504/ijact.2009.023464","title":"A critical analysis and improvement of advanced access content system drive-host authentication","year":2009,"lang":"en","type":"article","venue":"International Journal of Applied Cryptography","topic":"Advanced Authentication Protocols 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":"Computer science; Scheme (mathematics); Host (biology); Authentication (law); Protocol (science); Security analysis; Key (lock); Computer security; Computer network; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01363789908620845,"gpt":0.3084347899375314,"spread":0.2947968908513229,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003502374,0.0001418731,0.0003204168,0.000887077,0.00004998816,0.0001937251,0.001292337,0.0000464883,0.000007756357],"category_scores_gemma":[0.00005652547,0.0001266246,0.0002311134,0.0007503759,0.0001084919,0.0007800938,0.0001446193,0.0001421955,0.000001004401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006357281,"about_ca_system_score_gemma":0.00004010173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002336566,"about_ca_topic_score_gemma":8.693991e-7,"domain_scores_codex":[0.997952,0.00002317453,0.0008302479,0.0002606343,0.0007778807,0.000156106],"domain_scores_gemma":[0.9974428,0.0001213589,0.0008223758,0.0002927179,0.001192582,0.0001281084],"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.0001312686,0.0002675462,0.0008337739,0.00002137137,0.0004611365,0.000006140886,0.0005254206,0.0001071342,0.07755251,0.8869385,0.00000321918,0.03315201],"study_design_scores_gemma":[0.004748635,0.001104933,0.2312254,0.0003694614,0.0007411978,0.0000722128,0.001160461,0.01431621,0.2738441,0.4714007,0.0003122685,0.0007043714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09409234,0.00004633001,0.9038008,0.000864749,0.0002023744,0.0006073719,0.000007170147,0.00002947014,0.0003493754],"genre_scores_gemma":[0.9363483,0.00001804027,0.06335501,0.0001666764,0.00004453621,0.00006030579,0.000001979719,0.000004354511,7.778152e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8422559,"threshold_uncertainty_score":0.5163603,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}