{"id":"W2031103178","doi":"10.1063/1.4916215","title":"A new closeness centrality measure via effective distance in complex networks","year":2015,"lang":"en","type":"article","venue":"Chaos An Interdisciplinary Journal of Nonlinear Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":90,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"State Key Laboratory of Virtual Reality Technology and Systems; National Natural Science Foundation of China","keywords":"Centrality; Closeness; Measure (data warehouse); Shortest path problem; Computer science; Betweenness centrality; Dijkstra's algorithm; Complex network; Network science; Path (computing); Distance measures; Theoretical computer science; Topology (electrical circuits); Algorithm; Mathematics; Data mining; Artificial intelligence; Graph; Combinatorics","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":[],"consensus_categories":[],"category_scores_codex":[0.001976708,0.0002261256,0.0004867901,0.0002651695,0.00021425,0.0001453467,0.001089039,0.00003843443,0.00007474204],"category_scores_gemma":[0.00001705102,0.0001874099,0.0001883739,0.001169193,0.0003440377,0.0009080441,0.0005390468,0.0004689741,0.000004119832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002541567,"about_ca_system_score_gemma":0.0003579775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009015935,"about_ca_topic_score_gemma":0.0001052934,"domain_scores_codex":[0.9977341,0.0001755897,0.0006587927,0.000359515,0.0006110794,0.0004609829],"domain_scores_gemma":[0.9979642,0.00005869044,0.000496244,0.0003946168,0.000544017,0.0005422267],"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.001686027,0.00249203,0.4141066,0.00002957132,0.0002356593,0.0002169291,0.01228963,0.05433007,0.005627519,0.004903142,0.004243212,0.4998396],"study_design_scores_gemma":[0.002661693,0.001527683,0.1575631,0.0005732703,0.0001023764,0.0001311515,0.003264896,0.7863885,0.001978215,0.04377216,0.001098197,0.0009388017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.433391,0.0001158254,0.5650607,0.0002658665,0.0002712402,0.000201878,0.000005882255,0.0000186799,0.0006688826],"genre_scores_gemma":[0.9862399,0.000001608793,0.01262912,0.00002023494,0.001059893,0.000003605118,0.000007709185,0.00001482413,0.00002314424],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7320584,"threshold_uncertainty_score":0.7642354,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02782577385438575,"score_gpt":0.3487109843469604,"score_spread":0.3208852104925747,"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."}}