{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001071899,0.0008487312,0.0009676656,0.004796059,0.0008031934,0.002150239,0.001302677,0.001074361,0.001399798],"category_scores_gemma":[0.006673643,0.0002550597,0.0005277422,0.005022158,0.001308963,0.004243394,0.001410917,0.001041014,0.0003093285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001518956,"about_ca_system_score_gemma":0.0009604709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002041014,"about_ca_topic_score_gemma":0.001397682,"domain_scores_codex":[0.9976859,0.0006350303,0.0001227675,0.0004431685,0.001007999,0.0001051887],"domain_scores_gemma":[0.9974232,0.001195564,0.0003473243,0.0001589633,0.0007268884,0.0001481612],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000108219,0.00008034659,0.005361992,0.0005740817,0.00021893,0.0004060756,0.0003983393,0.3374898,0.00975249,0.4099541,0.007527173,0.2281285],"study_design_scores_gemma":[0.00002716397,0.0001068028,0.001872503,0.00006616693,0.00008015207,0.0006390922,0.0001635787,0.8401027,0.002983605,0.1378692,0.01598364,0.0001054276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01956128,0.00251668,0.972167,0.0004127615,0.0001844838,0.00006645275,0.0001863408,0.0001940174,0.004710963],"genre_scores_gemma":[0.7078426,0.003446533,0.2826115,0.000269513,0.0006447429,0.0003475315,0.0005954529,0.000138181,0.004103924],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004796059,"threshold_uncertainty_score":0.01102078,"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."}}