{"id":"W2151936469","doi":"10.1109/ntms.2008.ecp.9","title":"A Heuristic Approach to Minimum-Cost Network Hardening Using Attack Graph","year":2008,"lang":"en","type":"article","venue":"","topic":"Information and Cyber Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Proposition; Computer science; Heuristic; Negation; Exponential function; Mathematical optimization; Theoretical computer science; Hardening (computing); Mathematics; Artificial intelligence; Programming language","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009124154,0.001422594,0.001015755,0.001860799,0.0007691728,0.0009787692,0.00179093,0.001306915,0.005786037],"category_scores_gemma":[0.002698823,0.0005936196,0.0008734504,0.001234669,0.0009616755,0.002075521,0.00110718,0.001293545,0.000394009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001440308,"about_ca_system_score_gemma":0.00203802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002682715,"about_ca_topic_score_gemma":0.003841724,"domain_scores_codex":[0.9994368,0.0001862402,0.00002496826,0.0001211107,0.0001289989,0.0001018096],"domain_scores_gemma":[0.9986148,0.0009318116,0.0001111489,0.0001182097,0.000153118,0.00007086196],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000889372,0.0001667911,0.0004207489,0.000218473,0.00005110947,0.0001648296,0.0001030704,0.8400555,0.005295251,0.03531896,0.003245248,0.114871],"study_design_scores_gemma":[0.00003792274,0.00007298097,0.0001257752,0.00001785612,0.00002738862,0.0000932102,0.00007238687,0.9683331,0.001951082,0.0274921,0.001762945,0.00001321585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02275481,0.0002242042,0.9709372,0.0003776643,0.00003198694,0.0002251077,0.00008795407,0.0005581504,0.004802883],"genre_scores_gemma":[0.2475568,0.0002857978,0.7485261,0.0001655604,0.00003718056,0.0002602146,0.0002839073,0.0001596022,0.002724823],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005786037,"threshold_uncertainty_score":0.01935619,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06092136728709333,"score_gpt":0.2661659933606918,"score_spread":0.2052446260735985,"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."}}