{"id":"W2039469367","doi":"10.1016/j.comcom.2007.10.024","title":"A game-theoretic intrusion detection model for mobile ad hoc networks","year":2007,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Intrusion detection system; Mobile ad hoc network; Overhead (engineering); Node (physics); Network packet; Computer network; Wireless ad hoc network; Resource allocation; Distributed computing; Resource (disambiguation); Service (business); Computer security; Wireless; Operating system","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009263417,0.000221396,0.0002272766,0.0001604817,0.0004955904,0.0001979404,0.003511119,0.0001674161,0.000002997705],"category_scores_gemma":[0.00001384577,0.0002338721,0.0001551962,0.0005974956,0.0001728241,0.00038775,0.001884893,0.000391753,0.00002073117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000135501,"about_ca_system_score_gemma":0.00005040166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001967365,"about_ca_topic_score_gemma":0.0000871989,"domain_scores_codex":[0.998233,0.000124409,0.0004983645,0.0004588353,0.0001825657,0.0005028063],"domain_scores_gemma":[0.9947572,0.0007486204,0.0001980662,0.003877511,0.0002503082,0.00016824],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001504642,0.0001405272,0.00001054032,0.00001029868,0.00001789555,7.129523e-7,0.0009168682,0.1176104,0.00005663213,0.04305089,0.0005644963,0.8376057],"study_design_scores_gemma":[0.0003754798,0.0001525573,0.00009736601,0.00003855672,0.00001341901,0.00001550718,0.00001050956,0.961911,0.00006892489,0.01208433,0.0249869,0.0002454652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001363017,0.003578494,0.9924824,0.0003256198,0.0004924052,0.0009871869,0.000002292579,0.0004934388,0.0002752071],"genre_scores_gemma":[0.5869864,0.0007747016,0.4112301,0.0004752795,0.0001295364,0.0002979641,0.00002315773,0.00002351487,0.00005931241],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8443006,"threshold_uncertainty_score":0.9537026,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02188444540775204,"score_gpt":0.2752206278828226,"score_spread":0.2533361824750706,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}