{"id":"W2006429817","doi":"10.1002/net.21490","title":"Shortest paths avoiding forbidden subpaths","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Shortest path problem; Distance; K shortest path routing; Combinatorics; Yen's algorithm; Longest path problem; Euclidean shortest path; Constrained Shortest Path First; Shortest Path Faster Algorithm; Widest path problem; Path (computing); Mathematics; Discrete mathematics; Computer science; Graph; Dijkstra's algorithm; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007935676,0.0005203625,0.0007391953,0.0009028212,0.0006932099,0.0008951622,0.0011204,0.0008457865,0.002617263],"category_scores_gemma":[0.006578774,0.0004396576,0.0007278656,0.0008087144,0.0009861487,0.002057284,0.001451353,0.001026534,0.0002786198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006793559,"about_ca_system_score_gemma":0.0007645739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00167661,"about_ca_topic_score_gemma":0.00145799,"domain_scores_codex":[0.9992571,0.0001972626,0.00005054483,0.0002254813,0.0001636182,0.0001059035],"domain_scores_gemma":[0.9955069,0.00286137,0.0005720556,0.0004383776,0.0003845852,0.0002367592],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003926604,0.0001138898,0.003630821,0.0003805033,0.0001338269,0.0006397299,0.0004887427,0.7031822,0.009099549,0.1888394,0.002596471,0.09050222],"study_design_scores_gemma":[0.00003976444,0.00007289992,0.0004192113,0.00002755272,0.00002598449,0.0001618753,0.00009962167,0.7235097,0.002867743,0.2694776,0.00328059,0.00001732248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2910606,0.0003520849,0.7035205,0.0002758702,0.00004856269,0.0001197741,0.0002701642,0.000356647,0.003995847],"genre_scores_gemma":[0.7006817,0.0003384713,0.2931855,0.00008674918,0.00004368359,0.0001999175,0.0005287491,0.0001852669,0.004749924],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002617263,"threshold_uncertainty_score":0.008755624,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01678287490000113,"score_gpt":0.2574381522035938,"score_spread":0.2406552773035927,"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."}}