{"id":"W2152029757","doi":"10.1109/ias.2008.38","title":"An Efficient Approach to Minimum-Cost Network Hardening Using Attack Graphs","year":2008,"lang":"en","type":"article","venue":"","topic":"Information and Cyber Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Scalability; Binary decision diagram; Exploit; Hardening (computing); Theoretical computer science; Time complexity; Distributed computing; Algorithm; Computer security; Database","routes":{"ca_aff":true,"ca_fund":false,"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.0002629756,0.0001219865,0.0001224056,0.00009641334,0.0004049364,0.0001553399,0.000648462,0.00004656684,0.00001587331],"category_scores_gemma":[0.000005935584,0.0001097807,0.0000562174,0.0006549172,0.00002699308,0.0004228886,0.0001482078,0.0000966265,0.0001062738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003094152,"about_ca_system_score_gemma":0.00004816129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002108638,"about_ca_topic_score_gemma":0.000002995307,"domain_scores_codex":[0.9987919,0.00004230305,0.000232391,0.000262903,0.0002999252,0.000370628],"domain_scores_gemma":[0.9991556,0.00001373128,0.00005204009,0.0004890025,0.00008191782,0.0002076889],"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.000008852983,0.0002056374,0.0008531464,0.00000775247,0.00001201373,0.000007873249,0.01491283,0.8448314,0.00006026292,0.1246542,0.01189022,0.002555772],"study_design_scores_gemma":[0.0001610886,0.00002673149,0.001576551,0.000005218459,0.000001559692,0.00005969075,0.0001023364,0.992898,0.0001380047,0.0000379862,0.004803263,0.0001895042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2261792,0.00000982119,0.7383168,0.00005097185,0.0002529806,0.0001872321,4.696386e-7,0.0001846224,0.03481799],"genre_scores_gemma":[0.7828432,8.052384e-7,0.2155827,0.00139965,0.00006023185,0.000006478002,0.000003070273,0.000004744698,0.00009904575],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5566641,"threshold_uncertainty_score":0.4476727,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.050188385360192,"score_gpt":0.273555044512409,"score_spread":0.223366659152217,"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."}}