{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007472168,0.001330451,0.001215442,0.001436126,0.0005797418,0.001105433,0.001483595,0.0008434959,0.005209825],"category_scores_gemma":[0.002854476,0.0005708369,0.001007327,0.001169401,0.0007621029,0.001559445,0.001106888,0.001584133,0.0005736743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001115309,"about_ca_system_score_gemma":0.001396976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00180509,"about_ca_topic_score_gemma":0.002606283,"domain_scores_codex":[0.999281,0.0002198482,0.00003081754,0.0001263448,0.000258005,0.0000839752],"domain_scores_gemma":[0.9986191,0.0009251323,0.0001129663,0.0001463356,0.0001566858,0.00003977391],"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.00004559541,0.00005537243,0.0001639751,0.0001777839,0.0000307723,0.00006626025,0.00004690094,0.8595725,0.004074411,0.03391074,0.00164823,0.1002074],"study_design_scores_gemma":[0.00001708985,0.0000405854,0.00007461893,0.00001588533,0.00001481488,0.00004780241,0.00001600218,0.954877,0.002044357,0.0408953,0.001946787,0.000009729372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006282098,0.0001553185,0.9904912,0.0001242692,0.0000184186,0.00008053141,0.00005997762,0.0002922096,0.002495951],"genre_scores_gemma":[0.2764795,0.0005249511,0.7173074,0.0001157399,0.00004680721,0.0003213723,0.0002967304,0.0002035651,0.004703879],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005209825,"threshold_uncertainty_score":0.01742864,"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."}}