{"meta":{"query_hash":"12c70efb7072","filters":{"venue":"EURASIP Journal on Information Security"},"cohort_total":6,"direct_labels_cover":0,"predictions_cover":6,"exported":6,"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/12c70efb7072","api":"https://metacan.xera.ac/api/v1/cohort?venue=EURASIP+Journal+on+Information+Security"},"results":[{"id":"W2090583939","doi":"10.1186/1687-417x-2013-5","title":"IP traceback through (authenticated) deterministic flow marking: an empirical evaluation","year":2013,"lang":"en","type":"article","venue":"EURASIP Journal on Information Security","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Institute for Materials Science; Natural Sciences and Engineering Research Council of Canada; Dalhousie University","keywords":"IP traceback; Computer science; Network packet; Computer network; Router; Denial-of-service attack; TRACE (psycholinguistics); The Internet; Operating system","score_opus":0.03855687304768586,"score_gpt":0.3114928410861651,"score_spread":0.27293596803847925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090583939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.955836,0.0003536333,0.039324567,0.00016483435,0.0000518125,0.00042598165,0.00035640466,0.00082343485,0.0026633455],"genre_scores_gemma":[0.99098665,0.000096911004,0.007992182,0.000033988897,0.000025854928,0.00009742149,0.0001906022,0.000049047045,0.00052729686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9871372,0.0075537874,0.0006801904,0.0014687309,0.002616349,0.0005437347],"domain_scores_gemma":[0.72343576,0.2251989,0.014133634,0.02325926,0.012075627,0.0018968461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020733371,0.0010055533,0.0006482528,0.0014547269,0.0006604956,0.0019062897,0.0026254372,0.0018421946,0.0029874386],"category_scores_gemma":[0.14118862,0.00047130333,0.0005190126,0.0009225171,0.0021422103,0.0056854896,0.0016881501,0.0020568077,0.0007873261],"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.032590415,0.020997217,0.2788294,0.0028609324,0.0012699706,0.0010410114,0.0059287758,0.18246369,0.01651151,0.017848102,0.004806989,0.434852],"study_design_scores_gemma":[0.0017455865,0.026426705,0.101941384,0.00040880573,0.0016482335,0.0013560393,0.0025879785,0.81190294,0.029069133,0.017196573,0.0054713176,0.0002452377],"about_ca_topic_score_codex":0.003045076,"about_ca_topic_score_gemma":0.0015372048,"teacher_disagreement_score":0.020733371,"about_ca_system_score_codex":0.0011467957,"about_ca_system_score_gemma":0.0018175574,"threshold_uncertainty_score":0.10964984},"labels":[],"label_agreement":null},{"id":"W2147121845","doi":"10.1155/2009/859859","title":"An Extended Image Hashing Concept: Content-Based Fingerprinting Using FJLT","year":2009,"lang":"en","type":"article","venue":"EURASIP Journal on Information Security","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Hash function; Dynamic perfect hashing; Content (measure theory); Universal hashing; Image (mathematics); Consistent hashing; Feature hashing; Information retrieval; Pattern recognition (psychology); Artificial intelligence; Computer security; Hash table; Double hashing","score_opus":0.026477150873159615,"score_gpt":0.2946932129672627,"score_spread":0.2682160620941031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147121845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011643332,0.00061313785,0.98546535,0.000068150075,0.000102912476,0.000052917643,0.00006218221,0.000519401,0.0014727206],"genre_scores_gemma":[0.37694222,0.00088648306,0.6136085,0.00017050839,0.00031079006,0.00009641417,0.0003111433,0.000109519664,0.0075644096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991736,0.00016462622,0.000060902817,0.00015532144,0.0003744443,0.00007113637],"domain_scores_gemma":[0.9987294,0.00023614762,0.000111657435,0.00056771014,0.00030577206,0.00004926578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084771315,0.00043249357,0.00082025287,0.0010827736,0.000377729,0.000956293,0.0012324742,0.00095644285,0.0027505087],"category_scores_gemma":[0.0022138509,0.00024313568,0.0004544268,0.0012118921,0.0007686012,0.0025089025,0.0013185008,0.00064283103,0.0014187417],"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.0004754977,0.00014883542,0.0011384394,0.0003382586,0.00006300501,0.00022651078,0.00013922557,0.020251265,0.17531309,0.0417433,0.002668144,0.7574944],"study_design_scores_gemma":[0.0000894711,0.0008358802,0.002326757,0.00008187052,0.00012146017,0.0025719018,0.000107985026,0.7289082,0.2097795,0.0292738,0.025752852,0.00015023239],"about_ca_topic_score_codex":0.0005196282,"about_ca_topic_score_gemma":0.00037887786,"teacher_disagreement_score":0.0027505087,"about_ca_system_score_codex":0.00032455465,"about_ca_system_score_gemma":0.00038203452,"threshold_uncertainty_score":0.009201407},"labels":[],"label_agreement":null},{"id":"W4206243656","doi":"10.1186/s13635-021-00125-2","title":"Secure machine learning against adversarial samples at test time","year":2022,"lang":"en","type":"article","venue":"EURASIP Journal on Information Security","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"U.S. Air Force; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Computer science; Adversarial system; Artificial intelligence; Machine learning; Deep neural networks; Test set; Robustness (evolution); Scalability; Classifier (UML); Gradient descent; Deep learning; Adversarial machine learning; Attack model; Artificial neural network; Computer security","score_opus":0.008340035973071574,"score_gpt":0.2230166545099525,"score_spread":0.21467661853688094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206243656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4855162,0.0006742545,0.49912527,0.0010949622,0.00025702454,0.00017320806,0.0003314413,0.0077557466,0.005071935],"genre_scores_gemma":[0.9744975,0.000044060973,0.024159787,0.0001384525,0.000016084276,0.0000649422,0.00018695946,0.000085329266,0.00080695184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760383,0.000673074,0.00014748324,0.00052601384,0.000749286,0.0003002713],"domain_scores_gemma":[0.99257964,0.0031099268,0.0006038973,0.002629838,0.0008089999,0.0002677553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022656918,0.001065529,0.0007426176,0.00045098853,0.0005112655,0.000709576,0.0012627232,0.0009451835,0.0017061861],"category_scores_gemma":[0.011159852,0.000255781,0.00061848346,0.0002929466,0.0011307697,0.001654959,0.0016941895,0.0017527547,0.0007688679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001564783,0.00029851194,0.0077043977,0.00009977855,0.00014187628,0.0005995109,0.00014138396,0.81710505,0.033908036,0.013351833,0.004938589,0.12014617],"study_design_scores_gemma":[0.000010920689,0.00008424779,0.00027917972,0.0000064700785,0.000006473115,0.0000510711,0.000010693044,0.982852,0.013548992,0.00278843,0.0003551913,0.00000637003],"about_ca_topic_score_codex":0.0013330303,"about_ca_topic_score_gemma":0.000977335,"teacher_disagreement_score":0.0022656918,"about_ca_system_score_codex":0.0010647983,"about_ca_system_score_gemma":0.00090754277,"threshold_uncertainty_score":0.011982262},"labels":[],"label_agreement":null},{"id":"W4394579404","doi":"10.1186/s13635-024-00155-6","title":"Intelligent multi-agent model for energy-efficient communication in wireless sensor networks","year":2024,"lang":"en","type":"article","venue":"EURASIP Journal on Information Security","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":17,"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 Moncton","funders":"","keywords":"Computer science; Wireless sensor network; Computer network; Key distribution in wireless sensor networks; Wireless; Distributed computing; Wireless network; Telecommunications","score_opus":0.023903993418161684,"score_gpt":0.2707459496592523,"score_spread":0.24684195624109062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394579404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018833429,0.0006065457,0.9672615,0.00083295436,0.00013724697,0.000109900124,0.00020168148,0.00029496074,0.0117218755],"genre_scores_gemma":[0.84906787,0.0008881689,0.13533951,0.00024139961,0.000110314824,0.00061390287,0.00025286525,0.00007507853,0.013410797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937975,0.00023363771,0.000036403526,0.000114453615,0.00017482444,0.000060850234],"domain_scores_gemma":[0.99939775,0.00030255356,0.00009206653,0.00004864978,0.00012295425,0.000035967023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009191516,0.0008421114,0.00081357354,0.0006801355,0.00068779866,0.001621214,0.0017393518,0.0012720604,0.0026885017],"category_scores_gemma":[0.00180335,0.0004142237,0.0008648427,0.0007758955,0.00071710284,0.0016764986,0.0011427472,0.0013618915,0.0003969012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017471068,0.000019522084,0.00024346527,0.000032914424,0.000022761724,0.000068929476,0.000034677705,0.96544117,0.0004026701,0.029059626,0.0004942466,0.0041625295],"study_design_scores_gemma":[0.0000028955085,0.000007579793,0.000024094714,0.0000022151041,0.0000027958524,0.0000063463767,0.0000054643333,0.99580234,0.000044217708,0.0037087013,0.00039127786,0.0000020104612],"about_ca_topic_score_codex":0.006545246,"about_ca_topic_score_gemma":0.0067093205,"teacher_disagreement_score":0.006545246,"about_ca_system_score_codex":0.0012759829,"about_ca_system_score_gemma":0.0010245723,"threshold_uncertainty_score":0.013014317},"labels":[],"label_agreement":null},{"id":"W4400459020","doi":"10.1186/s13635-024-00170-7","title":"Performance comparison of quantum-safe multivariate polynomial public key encapsulation algorithm","year":2024,"lang":"en","type":"article","venue":"EURASIP Journal on Information Security","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Quantropi (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Encapsulation (networking); Multivariate statistics; Algorithm; Public-key cryptography; Key encapsulation; Quantum; Key (lock); Theoretical computer science; Computer security; Symmetric-key algorithm; Machine learning; Encryption","score_opus":0.02251915169230447,"score_gpt":0.281203308325278,"score_spread":0.25868415663297356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400459020","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9085355,0.0016575617,0.074762225,0.00052026444,0.00017502559,0.0001573842,0.00031049704,0.0028263165,0.011055213],"genre_scores_gemma":[0.98931074,0.00010909215,0.009505876,0.00003293699,0.000012355848,0.000023971657,0.00023303062,0.00003864163,0.0007332956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996042,0.0010253033,0.00025841224,0.0005954019,0.0011378935,0.00094109686],"domain_scores_gemma":[0.9949486,0.001979736,0.0004488377,0.0014636131,0.0008618666,0.0002972932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002464004,0.00059361395,0.000897533,0.00085037935,0.0007929822,0.0018350764,0.001266822,0.0010421989,0.0040013096],"category_scores_gemma":[0.0067308433,0.00015746283,0.0004171503,0.0009856448,0.00061269297,0.00270733,0.0017170388,0.0008017894,0.0007109826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.014756397,0.0012547706,0.014452995,0.00054382393,0.0005454671,0.00038894895,0.0003314032,0.5841938,0.07729875,0.052196346,0.008610635,0.24542663],"study_design_scores_gemma":[0.0001743454,0.0007091471,0.0014756925,0.000014809638,0.00004735795,0.00014036434,0.000061566454,0.961171,0.031168312,0.0038410202,0.0011553771,0.000041042033],"about_ca_topic_score_codex":0.0017967083,"about_ca_topic_score_gemma":0.0009086901,"teacher_disagreement_score":0.0040013096,"about_ca_system_score_codex":0.0016691025,"about_ca_system_score_gemma":0.0020470757,"threshold_uncertainty_score":0.013385773},"labels":[],"label_agreement":null},{"id":"W4417017239","doi":"10.1186/s13635-025-00219-1","title":"EnLeM: ensemble learning-based model to detect phishing websites","year":2025,"lang":"en","type":"article","venue":"EURASIP Journal on Information Security","topic":"Spam and Phishing Detection","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 Manitoba","funders":"Khalifa University of Science, Technology and Research","keywords":"Phishing; Random forest; Context (archaeology); Deep learning; Ensemble learning; Scalability; Feature (linguistics)","score_opus":0.012929241084738459,"score_gpt":0.2572700006117668,"score_spread":0.24434075952702836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417017239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19103111,0.0048251543,0.78749716,0.0013912655,0.00050228485,0.00024757124,0.0016251168,0.0060471524,0.006833184],"genre_scores_gemma":[0.88695043,0.0011959369,0.09696832,0.0008648533,0.00025049679,0.00021330589,0.0032753584,0.00013758084,0.010143723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962246,0.00007769653,0.000023091403,0.00011712163,0.00008665443,0.00007295601],"domain_scores_gemma":[0.9994349,0.00021370537,0.000049228416,0.00004568795,0.00022241326,0.0000340912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011010189,0.00118861,0.0014247863,0.00095980725,0.00034100364,0.0007294512,0.0016379514,0.001061538,0.001480965],"category_scores_gemma":[0.0020507963,0.00041928864,0.001079117,0.000614231,0.00024098062,0.0013161979,0.00090519636,0.0018782092,0.0007738103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039450874,0.00051019253,0.014048208,0.000116771924,0.00041338016,0.0002082624,0.00012799301,0.6249303,0.003516049,0.002168735,0.01141131,0.34215426],"study_design_scores_gemma":[0.0000057731163,0.00004410581,0.0004519604,0.000007594953,0.000021451713,0.000016852131,0.0000068325085,0.9980919,0.00037177335,0.0005776941,0.0003988388,0.000005144126],"about_ca_topic_score_codex":0.009852456,"about_ca_topic_score_gemma":0.011541246,"teacher_disagreement_score":0.009852456,"about_ca_system_score_codex":0.00055862026,"about_ca_system_score_gemma":0.0007391607,"threshold_uncertainty_score":0.019590259},"labels":[],"label_agreement":null}]}