{"meta":{"query_hash":"5e665e336679","filters":{"venue":"Jurnal Riset Informatika"},"cohort_total":1,"direct_labels_cover":0,"predictions_cover":1,"exported":1,"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/5e665e336679","api":"https://metacan.xera.ac/api/v1/cohort?venue=Jurnal+Riset+Informatika"},"results":[{"id":"W4376321176","doi":"10.34288/jri.v4i1.341","title":"COMPARATIVE ANALYSIS OF THE K-NEAREST NEIGHBOR ALGORITHM ON VARIOUS INTRUSION DETECTION DATASETS","year":2022,"lang":"en","type":"article","venue":"Jurnal Riset Informatika","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"National Institute of Standards and Technology","keywords":"Computer science; Intrusion detection system; Data mining; Confidentiality; k-nearest neighbors algorithm; Intrusion; Computer security; Machine learning","score_opus":0.012682346111390774,"score_gpt":0.24854143010690133,"score_spread":0.23585908399551056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376321176","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.8445709,0.028961344,0.05970004,0.0022032447,0.0023608438,0.001032357,0.03570137,0.008000338,0.017469574],"genre_scores_gemma":[0.74953884,0.0057968213,0.14066677,0.00036491768,0.00025908023,0.00051762036,0.09853413,0.00031649644,0.0040052882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99195963,0.0015827607,0.0013026041,0.0015605437,0.0030978285,0.00049657933],"domain_scores_gemma":[0.9909079,0.0042789625,0.00048142963,0.0009974289,0.0030166672,0.00031756042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069332127,0.0018193021,0.0023715182,0.009420053,0.0014799738,0.0028131653,0.0018064325,0.0015624319,0.0011332387],"category_scores_gemma":[0.017381324,0.0003084889,0.0017586423,0.008414951,0.00053595495,0.0027932276,0.0010958669,0.0011309934,0.0008491692],"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.0033612151,0.0026087402,0.06825031,0.003516361,0.0023652283,0.0006866507,0.0005849294,0.18557183,0.004352254,0.0043137376,0.07500043,0.64938825],"study_design_scores_gemma":[0.00019998815,0.0011577932,0.0478408,0.00030752076,0.00044932583,0.0010314678,0.0013029777,0.90817547,0.010663903,0.0043251007,0.024363324,0.00018222297],"about_ca_topic_score_codex":0.017542908,"about_ca_topic_score_gemma":0.015129435,"teacher_disagreement_score":0.017542908,"about_ca_system_score_codex":0.0017235425,"about_ca_system_score_gemma":0.0014905405,"threshold_uncertainty_score":0.03666675},"labels":[],"label_agreement":null}]}