{"id":"W4390480779","doi":"10.1109/tkde.2023.3346377","title":"A Distributed Solution for Efficient K Shortest Paths Computation Over Dynamic Road Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Wilfrid Laurier University; University of Toronto; York University","funders":"National Natural Science Foundation of China","keywords":"Shortest path problem; Graph; Computer science; Centrality; Computation; Notation; Algorithm; Scalability; Theoretical computer science; Combinatorics; Mathematics; Database","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.0001972468,0.0001423143,0.0001050895,0.0001570811,0.000123033,0.0003181822,0.0003532293,0.00004443428,0.00000185595],"category_scores_gemma":[0.000003506,0.0001413449,0.00003791249,0.000376577,0.00001182477,0.0006168268,0.000020579,0.0001245839,0.000009645019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004751683,"about_ca_system_score_gemma":0.00001751166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005568426,"about_ca_topic_score_gemma":0.000009564855,"domain_scores_codex":[0.9990764,0.000009050448,0.0001594046,0.0004574551,0.00008480495,0.0002128518],"domain_scores_gemma":[0.9993916,0.0001211316,0.00001369663,0.0003907155,0.00002234003,0.000060558],"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.00000437103,0.00009084258,5.099738e-7,0.0001032265,0.00005520592,0.000006975913,0.00007012914,0.4397606,0.0001224254,0.0005797453,0.000881912,0.5583241],"study_design_scores_gemma":[0.000179417,0.00004638869,0.0001209993,0.00009482967,0.00003678023,0.000006125729,0.000003178013,0.9954506,0.00002828864,0.00001235404,0.003858145,0.00016291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004446287,0.0008604901,0.9958399,0.00006145356,0.001605014,0.0002357963,0.0005506763,0.0003903837,0.00001169079],"genre_scores_gemma":[0.9863021,0.00008956665,0.01276172,0.000008562737,0.0000715831,0.00004056896,0.0006566238,0.00001697494,0.0000522447],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9858575,"threshold_uncertainty_score":0.5763876,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01659878325448288,"score_gpt":0.2679413858906808,"score_spread":0.251342602636198,"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."}}