{"id":"W2308115879","doi":"10.1002/atr.1359","title":"Development of realistic shortest path algorithm considering lane changes","year":2015,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Traffic control and management","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Path (computing); Shortest path problem; Computer science; Algorithm; Yen's algorithm; K shortest path routing; Shortest Path Faster Algorithm; Dijkstra's algorithm; Theoretical computer science; Graph; Computer network","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.0001326903,0.00007480285,0.0001694635,0.00007995402,0.00001048224,0.000004051093,0.00004552386,0.00002018425,0.000003698899],"category_scores_gemma":[0.000007093885,0.00006922558,0.00002648177,0.00006508557,0.000007764747,0.0000975318,8.448424e-7,0.00006272961,5.989338e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003936787,"about_ca_system_score_gemma":0.00003051177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001757075,"about_ca_topic_score_gemma":0.0001706464,"domain_scores_codex":[0.9993277,0.000003980808,0.0003499631,0.00004506969,0.0001846552,0.00008867442],"domain_scores_gemma":[0.9996515,0.00001503242,0.0001159826,0.0000455432,0.0001055907,0.00006638541],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.00002865486,0.00002823447,0.00006602206,0.0000654641,0.00007608732,0.00005032419,0.003923437,0.6762096,0.004311554,0.0001392004,0.00006549083,0.315036],"study_design_scores_gemma":[0.01957052,0.001507411,0.6312643,0.002128546,0.001001733,0.0001286702,0.02368377,0.02058204,0.02259887,0.002146134,0.2734931,0.001894854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7056229,0.001317786,0.2911817,0.0001103219,0.001110064,0.0002094776,0.00002166212,0.0001019349,0.0003241917],"genre_scores_gemma":[0.8818452,0.0000928343,0.1179663,0.000007236133,0.00005094864,0.000002899274,0.00001468299,0.00001052495,0.000009361619],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6556275,"threshold_uncertainty_score":0.2822937,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01698139615444752,"score_gpt":0.2244687691235416,"score_spread":0.2074873729690941,"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."}}