{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004931162,0.0001447969,0.0001499784,0.00009240596,0.0002523381,0.0002418951,0.001185159,0.00009538067,0.0001192053],"category_scores_gemma":[0.00007421996,0.0001311916,0.00007104585,0.0005578495,0.00007155532,0.0008339493,0.0004484965,0.0004701162,0.0003885288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003679973,"about_ca_system_score_gemma":0.00002534494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002118389,"about_ca_topic_score_gemma":0.000008428412,"domain_scores_codex":[0.998348,0.0001388638,0.0001868754,0.0004059605,0.0002770473,0.0006432808],"domain_scores_gemma":[0.9985304,0.0003603973,0.00004953729,0.0007583859,0.0001116312,0.0001896247],"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.000008755026,0.0001011169,0.01244904,0.00001136399,0.00003964235,0.00007621104,0.0006438776,0.01330341,0.001177898,0.3807884,0.01889661,0.5725037],"study_design_scores_gemma":[0.0002687419,0.0001066847,0.005939898,0.00003299582,0.00000307512,0.00002963454,0.00006401827,0.8590837,0.0003122677,0.1300582,0.003731093,0.0003696955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02187794,0.0004544175,0.9682958,0.0003402906,0.0004162272,0.0003220344,4.067116e-7,0.0002953371,0.007997589],"genre_scores_gemma":[0.9873019,0.00004902228,0.01132521,0.0003149831,0.0002417971,0.00008080267,0.000002266662,0.0000190765,0.0006648914],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.965424,"threshold_uncertainty_score":0.5349836,"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."}}