{"id":"W2050675408","doi":"10.1016/j.cor.2012.02.008","title":"Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":99,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Pairwise comparison; Simulated annealing; Heuristics; Algorithm; Population; Combinatorial optimization; Mathematical optimization; Graph; Mathematics; Theoretical computer science; Artificial intelligence","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.001848786,0.0001629226,0.0001952133,0.0001746324,0.001738454,0.0005639718,0.0004039493,0.00006197841,0.00005622571],"category_scores_gemma":[0.00004253232,0.0001376177,0.0001612946,0.001216207,0.0002383727,0.000366359,0.0002098515,0.0003463498,0.00000951408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002780811,"about_ca_system_score_gemma":0.0002297767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002033607,"about_ca_topic_score_gemma":0.00006913426,"domain_scores_codex":[0.9973419,0.0005694352,0.0003454779,0.0003711781,0.0006498753,0.0007220767],"domain_scores_gemma":[0.997533,0.0008627819,0.00002521704,0.0004558933,0.0009802098,0.0001428538],"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.0001742417,0.00144902,0.02025472,0.0000805993,0.0003944381,0.000001210818,0.00107131,0.5525407,0.002940258,0.298203,0.003444833,0.1194457],"study_design_scores_gemma":[0.0005327396,0.00009235447,0.0004112789,0.00003372686,0.00004773682,0.000001674793,0.0001622165,0.9892433,0.0022098,0.006191227,0.0009164294,0.000157483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01580814,0.00006655341,0.9811695,0.0007979507,0.0003012634,0.00152939,0.00002642629,0.00007764214,0.0002231222],"genre_scores_gemma":[0.8781515,8.923565e-7,0.1198309,0.00002489607,0.001418886,0.0004687261,0.00006846829,0.00002125183,0.00001454513],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8623433,"threshold_uncertainty_score":0.9995611,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1009544948136012,"score_gpt":0.4398514962153584,"score_spread":0.3388970014017572,"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."}}