{"meta":{"query_hash":"0b216754281e","filters":{"venue":"International journal of network security"},"cohort_total":3,"direct_labels_cover":0,"predictions_cover":3,"exported":3,"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/0b216754281e","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+journal+of+network+security"},"results":[{"id":"W1574247285","doi":"10.6633/ijns.200703.4(2).05","title":"A Web-Based Multilayer Access Control Model for Multimedia Applications in MPEG-7","year":2007,"lang":"en","type":"article","venue":"International journal of network security","topic":"Access Control and Trust","field":"Social Sciences","cited_by":6,"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 Regina","funders":"","keywords":"Computer science; Credential; Role-based access control; Access control; Computer network; Computer security","score_opus":0.026382917136671992,"score_gpt":0.3749528165747092,"score_spread":0.3485698994380372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574247285","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.016350565,0.00018582687,0.9758605,0.00029448763,0.000043953598,0.00017468444,0.00008359818,0.00071031344,0.00629609],"genre_scores_gemma":[0.6705647,0.00053874106,0.31557044,0.00019740385,0.000100818346,0.0005971817,0.0002654918,0.00011135568,0.012053932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754816,0.000525175,0.0002625701,0.00032537102,0.0011485014,0.00019026021],"domain_scores_gemma":[0.99867284,0.00029856342,0.00018258493,0.00031879082,0.0004106238,0.00011661889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021515142,0.00054404704,0.00050363404,0.0010941791,0.0008181846,0.0029133512,0.0015557832,0.001033814,0.0021614907],"category_scores_gemma":[0.0024865025,0.00028695885,0.0008593697,0.0006937572,0.0012844653,0.0032570378,0.0012090879,0.0013782615,0.0008715974],"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.00030079094,0.00025961918,0.0017441424,0.00018113159,0.00008149337,0.0008442225,0.0011026935,0.16724513,0.028733315,0.7101204,0.0030708455,0.08631618],"study_design_scores_gemma":[0.000032541553,0.000105473955,0.0004906442,0.000040270384,0.00006389093,0.00026445434,0.00007785272,0.91183627,0.008275893,0.061548945,0.017204786,0.000059036054],"about_ca_topic_score_codex":0.008234579,"about_ca_topic_score_gemma":0.0053809453,"teacher_disagreement_score":0.008234579,"about_ca_system_score_codex":0.001435146,"about_ca_system_score_gemma":0.0016034165,"threshold_uncertainty_score":0.016373336},"labels":[],"label_agreement":null},{"id":"W2124950370","doi":"","title":"Traffic Filtering and Routing in Partially-Hidden Networks","year":2006,"lang":"en","type":"article","venue":"International journal of network security","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 Ottawa","funders":"","keywords":"Computer science; Scalability; Computer network; Routing (electronic design automation); Filter (signal processing); Routing protocol; Routing algorithm; Scheme (mathematics); Signature (topology); Distributed computing; Computer security; Database","score_opus":0.007041206065206528,"score_gpt":0.2318100980516862,"score_spread":0.22476889198647967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124950370","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.17661676,0.0002250478,0.8177071,0.0007057039,0.00004564656,0.000056158868,0.00009564614,0.0004779357,0.004070083],"genre_scores_gemma":[0.94786143,0.00015662637,0.049859013,0.00007669706,0.000043408956,0.00003546563,0.00008632581,0.000018234776,0.0018627819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978364,0.0005796259,0.00012469706,0.00027018873,0.0008422291,0.00034698777],"domain_scores_gemma":[0.995719,0.0015182681,0.00070769736,0.0014356843,0.0004225399,0.00019680068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018883636,0.00035402927,0.00064446207,0.00056642527,0.0010876372,0.0020362863,0.0010966716,0.0010478052,0.00086054887],"category_scores_gemma":[0.00446813,0.0003512857,0.00044374267,0.0008044775,0.002228675,0.0048978883,0.002054509,0.0010698589,0.0002203539],"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.0006590364,0.00009360423,0.0017680478,0.00012558559,0.000055876,0.00035974954,0.0008919439,0.30994728,0.031038271,0.5979313,0.0011960336,0.055933315],"study_design_scores_gemma":[0.000040897132,0.00006578527,0.00033920165,0.000013833692,0.00001734841,0.00009341558,0.000101626945,0.79211724,0.011388958,0.19382088,0.0019768793,0.00002397912],"about_ca_topic_score_codex":0.0018975718,"about_ca_topic_score_gemma":0.0013268301,"teacher_disagreement_score":0.0020362863,"about_ca_system_score_codex":0.0016422339,"about_ca_system_score_gemma":0.001579,"threshold_uncertainty_score":0.0119152665},"labels":[],"label_agreement":null},{"id":"W2141775271","doi":"","title":"Countermeasures for Hardware Fault Attack in Multi-Prime RSA Cryptosystems","year":2008,"lang":"en","type":"article","venue":"International journal of network security","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Cryptosystem; Prime (order theory); Field-programmable gate array; Countermeasure; Embedded system; Cryptography; Reconfigurable computing; Simple (philosophy); Prime number; Computer hardware; Computer security; Computer engineering; Mathematics","score_opus":0.06838314339513929,"score_gpt":0.3435589919501349,"score_spread":0.2751758485549956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141775271","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.17930308,0.004702366,0.80776244,0.0006033669,0.00046058896,0.00019616917,0.00003081576,0.001535618,0.0054055504],"genre_scores_gemma":[0.8946499,0.0007818347,0.10277872,0.00012808778,0.00009199152,0.00008408417,0.000028595623,0.000031858403,0.0014248748],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987897,0.00026654132,0.00008031916,0.00013390415,0.00062665204,0.000102845726],"domain_scores_gemma":[0.9979771,0.0007649664,0.0005536995,0.00037987315,0.00026667494,0.000057706937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007007605,0.00081589294,0.00065240473,0.0014765714,0.00045901508,0.0006224835,0.00089803303,0.00091125304,0.0014128502],"category_scores_gemma":[0.002706053,0.00025125864,0.00047533613,0.00042337045,0.0006191219,0.0013470735,0.00073952967,0.0009436156,0.0002802409],"study_design_candidate":"bench_or_experimental","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.0011302114,0.0002965893,0.0029069749,0.0010872987,0.000266124,0.00093131745,0.00032582929,0.048272572,0.42235425,0.06561338,0.0018579426,0.45495754],"study_design_scores_gemma":[0.00027850573,0.0024174429,0.0031379953,0.00022969813,0.0002172978,0.0041379114,0.00011049314,0.2799763,0.6783173,0.01772478,0.013340249,0.000111997084],"about_ca_topic_score_codex":0.000067794164,"about_ca_topic_score_gemma":0.000102547834,"teacher_disagreement_score":0.0014765714,"about_ca_system_score_codex":0.000364847,"about_ca_system_score_gemma":0.00036545846,"threshold_uncertainty_score":0.00472641},"labels":[],"label_agreement":null}]}