{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6801284,0.000075048534,0.29569435,0.004972204,0.0038838203,0.0010515922,0.0000067703572,0.00037441868,0.013813382],"genre_scores_gemma":[0.9921226,0.000052254243,0.0048523974,0.002528616,0.00036681478,0.000033444536,0.000020495952,0.000009132849,0.000014246076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967369,0.0005282873,0.0009008323,0.0002327838,0.0012066578,0.00039455175],"domain_scores_gemma":[0.9977582,0.0001329502,0.00055137987,0.000508498,0.00076977833,0.0002791924],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016313294,0.00024035785,0.00021951007,0.00024481054,0.0006151563,0.0015769762,0.00075629243,0.00017120836,0.0008583894],"category_scores_gemma":[0.00028965969,0.00020707854,0.00013358922,0.0005367881,0.00005519572,0.012036902,0.000097964374,0.0007570443,0.0015955556],"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.000148647,0.0006113792,0.0004294919,0.000060809998,0.0000786304,0.000016354217,0.040935002,0.003978952,0.000060371633,0.01629049,0.043303933,0.89408594],"study_design_scores_gemma":[0.0007995371,0.00051757536,0.009406988,0.000048090795,0.00001836344,0.00037979847,0.00018939718,0.9079989,0.0002643296,0.04759423,0.032481328,0.000301449],"about_ca_topic_score_codex":0.000008633355,"about_ca_topic_score_gemma":0.0000022257066,"teacher_disagreement_score":0.90401995,"about_ca_system_score_codex":0.0001847645,"about_ca_system_score_gemma":0.00013661328,"threshold_uncertainty_score":0.9994595},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13963878,0.00001581775,0.85833025,0.0005506499,0.00026409057,0.00012439021,0.0000034436594,0.00035892497,0.0007136565],"genre_scores_gemma":[0.8588922,0.0000051570873,0.1386865,0.0023144581,0.00008988312,0.000001174549,0.000005320536,0.0000045062507,8.166638e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982133,0.00015493699,0.00064565864,0.00015972705,0.00047095632,0.00035540736],"domain_scores_gemma":[0.99844974,0.000059200516,0.00062431686,0.00038858913,0.0002954699,0.00018265603],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008447086,0.00020374257,0.0002021808,0.00037753675,0.000616298,0.0011953124,0.00078723376,0.00008037271,0.0000081288945],"category_scores_gemma":[0.00010444767,0.00018223407,0.00014282503,0.0003444025,0.000048423746,0.009488564,0.000039730654,0.00059774454,0.000007458429],"study_design_candidate":"design_other","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.0004305675,0.0009274602,0.0018992873,0.00009172522,0.000083218736,0.00027938702,0.03431277,0.009120561,0.042212065,0.2570377,0.0009839542,0.6526213],"study_design_scores_gemma":[0.0034594631,0.0019698925,0.020232718,0.00070607645,0.000028741033,0.00082570023,0.0009739911,0.63723534,0.25807607,0.06870964,0.006138161,0.0016441748],"about_ca_topic_score_codex":0.0000034457419,"about_ca_topic_score_gemma":1.8190832e-7,"teacher_disagreement_score":0.7196438,"about_ca_system_score_codex":0.00008877289,"about_ca_system_score_gemma":0.000056732722,"threshold_uncertainty_score":0.9998416},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38844636,0.00028810572,0.5024968,0.021899799,0.012153463,0.001629467,0.00044390818,0.002752867,0.06988922],"genre_scores_gemma":[0.99223834,0.000027793038,0.0040613404,0.0027721769,0.00039552274,0.000011907624,0.00013719482,0.000021184407,0.00033450886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965195,0.00058986957,0.00078164047,0.000243521,0.0014004883,0.00046495948],"domain_scores_gemma":[0.9976333,0.0005951557,0.0009780312,0.00038072496,0.00018021825,0.00023260966],"candidate_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019714208,0.0002868412,0.00029559594,0.00043557605,0.0027651566,0.00050062774,0.0013564075,0.00007715675,0.0010056439],"category_scores_gemma":[0.0012759372,0.00028327934,0.0001649778,0.0006265885,0.000044628974,0.0031914362,0.0012658117,0.0024570145,0.00058431237],"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.0005111406,0.0002424697,0.0071335034,0.000046105673,0.00012084231,0.00018623355,0.023047742,0.89333653,0.00047937565,0.024917426,0.023948548,0.026030064],"study_design_scores_gemma":[0.0017862814,0.0005358698,0.0014911587,0.000020645999,0.000011729851,0.00059255026,0.00025986927,0.51813847,0.00014550473,0.0006535743,0.4759055,0.00045882264],"about_ca_topic_score_codex":0.000010575678,"about_ca_topic_score_gemma":0.0000014599036,"teacher_disagreement_score":0.603792,"about_ca_system_score_codex":0.00067091704,"about_ca_system_score_gemma":0.0001569258,"threshold_uncertainty_score":0.9999619},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022971598,0.00045167503,0.973402,0.0010371483,0.0012409289,0.0002669952,0.000008553127,0.00021720096,0.00040385357],"genre_scores_gemma":[0.98147386,0.00062968227,0.016774522,0.00085246406,0.000108992375,0.000043356093,0.000037294183,0.000019764835,0.000060035076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973903,0.00020831024,0.0010773976,0.00026409462,0.00055493624,0.0005049806],"domain_scores_gemma":[0.99818844,0.00036705736,0.00033550168,0.0005956632,0.00030881783,0.00020451377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014080156,0.00028410443,0.00026469905,0.0006076679,0.00032213554,0.0010067141,0.0010000379,0.00017364846,0.0000060337056],"category_scores_gemma":[0.000060003087,0.00025642026,0.00020557296,0.0007414335,0.00004991488,0.0013364222,0.00019608511,0.00078571175,0.000031860305],"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.000025022766,0.00011183796,0.000011058218,0.000023323359,0.00001575247,0.0000062448917,0.0029834127,0.86335945,0.000005758775,0.11485933,0.000923845,0.01767497],"study_design_scores_gemma":[0.0004752696,0.0000596089,0.000049893548,0.0002895188,0.000006574543,0.00006244543,0.00012247243,0.9928413,0.00023154265,0.0004678284,0.0051167873,0.00027674474],"about_ca_topic_score_codex":0.000010449324,"about_ca_topic_score_gemma":0.00001943835,"teacher_disagreement_score":0.9585023,"about_ca_system_score_codex":0.00044243684,"about_ca_system_score_gemma":0.000119196855,"threshold_uncertainty_score":0.9999888},"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":"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.36180443,0.00012155481,0.63046956,0.0018242532,0.0031770875,0.00017600451,0.000016532065,0.00018996887,0.0022206388],"genre_scores_gemma":[0.99434066,0.000030486886,0.005122428,0.00016248786,0.00029868848,0.00000373189,0.000022168148,0.0000064431783,0.00001291649],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769855,0.00012547847,0.0010475968,0.0001626938,0.0006775552,0.00028812437],"domain_scores_gemma":[0.9986483,0.00016268442,0.0005099986,0.0002246326,0.00028551082,0.00016889235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008849615,0.00019373206,0.00025332655,0.0005849693,0.00028296348,0.00082574785,0.00056037435,0.000093355586,0.000043752534],"category_scores_gemma":[0.00010022043,0.00016612589,0.00013877329,0.0006692838,0.000043210774,0.0067261476,0.00011193329,0.00054053316,0.00025536798],"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.000037781945,0.00011490941,0.00037783905,0.00008821706,0.000052167146,0.0000043129166,0.012110611,0.002674351,0.00014688379,0.05976819,0.0037256498,0.9208991],"study_design_scores_gemma":[0.00046052094,0.0002473547,0.007377775,0.000105558276,0.000006603885,0.00007739335,0.000082870065,0.9675517,0.0011964135,0.0015571755,0.021150809,0.00018584503],"about_ca_topic_score_codex":0.0000130431645,"about_ca_topic_score_gemma":5.404983e-7,"teacher_disagreement_score":0.9648773,"about_ca_system_score_codex":0.00014507996,"about_ca_system_score_gemma":0.00024274077,"threshold_uncertainty_score":0.79627055},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039095007,0.000025936135,0.9444097,0.002736211,0.0008353263,0.00013468973,0.0000015544176,0.00023732122,0.012524239],"genre_scores_gemma":[0.9886448,0.000009359195,0.006098383,0.005048647,0.0000755575,0.000007292521,0.0000026361029,0.0000048232846,0.00010851675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850243,0.00012536804,0.00047496607,0.00014738512,0.00047699313,0.00027285417],"domain_scores_gemma":[0.9988579,0.00016364848,0.00025454414,0.00027243473,0.0002883804,0.00016307188],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001069893,0.0001615859,0.00015867504,0.00064158323,0.0005961855,0.0012032697,0.0006226062,0.00009007137,0.000020581001],"category_scores_gemma":[0.0005361219,0.00015281457,0.000111793095,0.00077045243,0.000011962085,0.0030383982,0.000092412025,0.00075943535,0.00029897524],"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.00018581962,0.00005801375,0.00055830216,0.00007159855,0.000042393072,0.000009434801,0.006028165,0.86520994,0.0008258427,0.022779098,0.031868804,0.07236257],"study_design_scores_gemma":[0.00067039777,0.0002613956,0.001428588,0.00013044795,0.00000848296,0.0000397184,0.000058783422,0.9257903,0.009350574,0.012292181,0.049715985,0.0002531558],"about_ca_topic_score_codex":0.0000071325244,"about_ca_topic_score_gemma":0.000006643417,"teacher_disagreement_score":0.9495498,"about_ca_system_score_codex":0.00017942076,"about_ca_system_score_gemma":0.0001835414,"threshold_uncertainty_score":0.9998336},"labels":[],"label_agreement":null}]}