{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001889062,0.00012058,0.0001347559,0.00008918215,0.0003449707,0.0001275122,0.0005470929,0.00004408066,0.00001955574],"category_scores_gemma":[0.0000168485,0.000110754,0.00006317691,0.0006658562,0.00002668021,0.0004648034,0.0002060933,0.000106627,0.0001878605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002769955,"about_ca_system_score_gemma":0.00005204356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002257749,"about_ca_topic_score_gemma":0.000003538218,"domain_scores_codex":[0.9988832,0.00003337462,0.0002408485,0.0002282817,0.0002573612,0.0003568929],"domain_scores_gemma":[0.999303,0.00002521732,0.0000541399,0.0003824547,0.00007497447,0.0001602487],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004087086,0.0004072618,0.004604821,0.0000715586,0.00009190727,0.00007834422,0.03870146,0.2315498,0.00008553694,0.3682287,0.3458906,0.01024913],"study_design_scores_gemma":[0.0003353882,0.00003156993,0.002487032,0.00001636672,0.000004433452,0.0002379366,0.00009487819,0.9661562,0.00008093989,0.0003354047,0.0298428,0.0003770806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02347093,0.00002225271,0.8972578,0.0001049988,0.0002774566,0.0001905203,5.582865e-7,0.0001850414,0.07849044],"genre_scores_gemma":[0.7158774,0.000003187536,0.2810707,0.002375352,0.0001167918,0.00001078182,0.000002877754,0.000006160133,0.0005367451],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7346063,"threshold_uncertainty_score":0.4516418,"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."}}