{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000701281,0.001208511,0.001685619,0.0008395324,0.001221619,0.00175672,0.002464725,0.001865982,0.007396304],"category_scores_gemma":[0.00298487,0.0006063701,0.001132539,0.001779165,0.0006822031,0.002139263,0.002194659,0.001304758,0.001883403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001240849,"about_ca_system_score_gemma":0.002580051,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01170402,"about_ca_topic_score_gemma":0.01596804,"domain_scores_codex":[0.9993196,0.00009848872,0.00004330866,0.0002822894,0.00012859,0.0001278273],"domain_scores_gemma":[0.9990876,0.0004700671,0.00006940847,0.0001360256,0.0001621792,0.00007465291],"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.0003591547,0.0001303214,0.0007718835,0.0002883171,0.00007318992,0.0002004216,0.0002270498,0.8399811,0.003162248,0.02256172,0.01361271,0.1186318],"study_design_scores_gemma":[0.00004413597,0.0000198193,0.00006018093,0.000006482146,0.00000781958,0.00002528077,0.00006132507,0.9881659,0.0003236763,0.009918611,0.001360387,0.00000638565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01957453,0.0003473189,0.9718436,0.0004794944,0.0001275373,0.0001233402,0.0005568735,0.001989539,0.004957753],"genre_scores_gemma":[0.2652534,0.0003136322,0.7251087,0.0001538154,0.0000999858,0.0003382753,0.001480947,0.0003261354,0.006925157],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01170402,"threshold_uncertainty_score":0.02474314,"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."}}