{"id":"W792477341","doi":"10.1007/978-3-319-12691-3_45","title":"A Fast Greedy Algorithm for the Critical Node Detection Problem","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Greedy algorithm; Cardinality (data modeling); Algorithm; Vertex (graph theory); Pairwise comparison; Computational complexity theory; Node (physics); Benchmark (surveying); Graph; Theoretical computer science; Data mining; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001455946,0.0005712467,0.0005091606,0.0005689249,0.0009637206,0.0009808252,0.004393572,0.0003301617,0.00001240757],"category_scores_gemma":[0.0001653469,0.0004339879,0.0002872723,0.0006415808,0.001507876,0.000406724,0.001364413,0.0009909809,0.00002769494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001885307,"about_ca_system_score_gemma":0.0002766176,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003626107,"about_ca_topic_score_gemma":0.0001306023,"domain_scores_codex":[0.9958757,0.00004766265,0.0005509541,0.001637947,0.001010519,0.0008771952],"domain_scores_gemma":[0.9950906,0.002497865,0.0002066171,0.001587024,0.0004405459,0.0001773714],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002578425,0.00001693707,0.000001056762,0.00003303572,0.00001070132,0.000008435512,0.000230168,0.003371144,0.00002312879,0.04384921,0.00001899673,0.9524346],"study_design_scores_gemma":[0.00018089,0.0001936574,0.00001394416,0.0001449535,0.00001267913,0.00009097251,1.53006e-7,0.7055895,0.000370684,0.2872837,0.005704707,0.0004141504],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[9.159826e-7,0.0003445683,0.9924412,0.002199295,0.00326746,0.0007688081,0.00001433566,0.0002215443,0.0007418998],"genre_scores_gemma":[0.007636459,0.00002413759,0.988646,0.001929682,0.00137656,0.00008050766,0.000002978692,0.00004222356,0.0002614998],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9520205,"threshold_uncertainty_score":0.9998112,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02038315314559135,"score_gpt":0.2565585156088256,"score_spread":0.2361753624632343,"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."}}