{"id":"W2078130621","doi":"10.1186/s40649-015-0010-y","title":"Efficiently identifying critical nodes in large complex networks","year":2015,"lang":"en","type":"article","venue":"Computational Social Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":64,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Computer science; Pairwise comparison; Vertex (graph theory); Node (physics); Cardinality (data modeling); Greedy algorithm; Graph; Algorithm; Context (archaeology); Set (abstract data type); Time complexity; Theoretical computer science; Mathematics; Mathematical optimization; 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.0006777241,0.0002323266,0.0004000721,0.000123287,0.0003547249,0.0001795361,0.0002890068,0.00009688342,0.0002537952],"category_scores_gemma":[0.00002317563,0.0002669573,0.0001948213,0.000742675,0.0001393297,0.0001915682,0.0002232584,0.0004108701,0.00002138064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001191577,"about_ca_system_score_gemma":0.00006678946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009006613,"about_ca_topic_score_gemma":0.00002573843,"domain_scores_codex":[0.9978406,0.0002326047,0.0005363264,0.0003790883,0.0004071374,0.0006042707],"domain_scores_gemma":[0.9989109,0.0004047263,0.0001342277,0.0001303768,0.000258429,0.0001613128],"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.00001853403,0.0002175421,0.0584885,0.000002789945,0.0000423815,0.000004693278,0.0002458727,0.7966484,4.851112e-7,0.1286268,0.01258692,0.003117017],"study_design_scores_gemma":[0.0005492218,0.00001281184,0.03609811,0.00002177728,0.00002530185,6.543281e-7,0.0002452567,0.9082981,2.915203e-7,0.05353447,0.0009604343,0.000253587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01561187,0.000189197,0.9798352,0.000328998,0.0002340724,0.0001713868,0.00001193087,0.0001298575,0.003487514],"genre_scores_gemma":[0.9922811,8.440605e-7,0.004918327,0.0002956478,0.001947754,0.00003334423,0.0004597899,0.00003201039,0.0000311874],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9766693,"threshold_uncertainty_score":0.9999782,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05083340851624824,"score_gpt":0.3539425798192488,"score_spread":0.3031091713030005,"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."}}