{"id":"W2065714066","doi":"10.1007/s00778-005-0177-1","title":"Optimization and evaluation of shortest path queries","year":2006,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Constrained Shortest Path First; Shortest path problem; K shortest path routing; Computer science; Yen's algorithm; Dijkstra's algorithm; Shortest Path Faster Algorithm; Euclidean shortest path; Scalability; Pruning; Path (computing); Query optimization; Algorithm; Theoretical computer science; Data mining; Database; Graph; Computer network","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.001103371,0.00003526946,0.00004143695,0.0000392315,0.0001054716,0.0001658779,0.0002366564,0.000008088287,0.00001575515],"category_scores_gemma":[0.00001366982,0.00002221151,0.00001220799,0.0001104052,0.00002853675,0.0005193976,0.00007360286,0.00004246934,0.000001064819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008616592,"about_ca_system_score_gemma":0.00002012198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001131205,"about_ca_topic_score_gemma":0.000002439662,"domain_scores_codex":[0.9994171,0.00006526477,0.000113773,0.00005609897,0.0002857229,0.00006205931],"domain_scores_gemma":[0.9996618,0.00001674612,0.00008869624,0.0001262949,0.00009437023,0.00001208241],"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.000008597644,0.0001397017,0.005293134,0.00001058842,0.00005529022,0.000008601028,0.0008980283,0.4134198,0.0005714037,0.09619103,0.01169604,0.4717078],"study_design_scores_gemma":[0.0002059308,0.00002792045,0.009616632,0.00001080289,0.00002275747,0.00002913683,0.00003698198,0.9788633,0.0001554928,0.01051249,0.0004760489,0.00004250859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04335089,0.0003897087,0.9529162,0.001020121,0.0001872575,0.00007922156,0.000001262649,0.00001424708,0.002041116],"genre_scores_gemma":[0.9603171,0.00009348289,0.03928962,0.00003915684,0.0001461165,0.000001568885,0.00000353004,0.000002727463,0.0001067271],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9169662,"threshold_uncertainty_score":0.1599565,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01871367238197218,"score_gpt":0.2452819636881325,"score_spread":0.2265682913061603,"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."}}