{"id":"W2911311653","doi":"10.1155/2019/9024745","title":"Approximating Betweenness Centrality to Identify Key Nodes in a Weighted Urban Complex Transportation Network","year":2019,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":61,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Science Foundation of Ningbo; Natural Science Foundation of Jiangsu Province; Government of Jiangsu Province","keywords":"Betweenness centrality; Centrality; Key (lock); Computer science; Node (physics); Flow network; Identification (biology); Complex network; Construct (python library); Data mining; Traffic flow (computer networking); Reliability (semiconductor); Network science; Computer network; Mathematical optimization; Mathematics; Engineering; Computer security; Statistics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004162112,0.0002015074,0.0005396424,0.0001897383,0.00005796737,0.00003556168,0.0002032967,0.00004390856,0.0001964851],"category_scores_gemma":[0.000002422113,0.0002029688,0.0002382486,0.0007205196,0.00001622168,0.0005494787,0.000001985128,0.0002708269,0.000004881016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006335461,"about_ca_system_score_gemma":0.00003726685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000846732,"about_ca_topic_score_gemma":0.0001889258,"domain_scores_codex":[0.9977879,0.00006816236,0.001237934,0.000233901,0.0003510723,0.0003210608],"domain_scores_gemma":[0.9986411,0.00007078718,0.0007734937,0.0001691116,0.000234233,0.0001112806],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0001818904,0.000144098,0.8085324,0.00004879515,0.0001006929,0.000005646744,0.002414595,0.168781,0.007275062,0.003664908,0.0001220473,0.008728943],"study_design_scores_gemma":[0.001016061,0.00007657149,0.9882816,0.000253697,0.00009318156,3.035307e-7,0.0006262211,0.0009851013,0.0008759335,0.006877452,0.0006861046,0.0002277367],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8898019,0.00003603329,0.1094212,0.00008567255,0.0001498837,0.000347109,0.00002807497,0.00002463625,0.0001054724],"genre_scores_gemma":[0.9585009,0.000004869916,0.04083877,0.00003185328,0.0002688894,0.00001173832,0.0003033965,0.00002374382,0.00001582535],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1797493,"threshold_uncertainty_score":0.827683,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01268089645452958,"score_gpt":0.2908432610882297,"score_spread":0.2781623646337001,"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."}}