{"id":"W2040122307","doi":"10.1016/j.tcs.2011.05.021","title":"Shortest paths between shortest paths","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"K shortest path routing; Shortest path problem; Shortest Path Faster Algorithm; Combinatorics; Yen's algorithm; Euclidean shortest path; Mathematics; Distance; Sequence (biology); Vertex (graph theory); Control reconfiguration; Floyd–Warshall algorithm; Longest path problem; Discrete mathematics; Graph; Computer science; Dijkstra's algorithm; Biology","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.0004699382,0.001027264,0.0007465656,0.003140882,0.001373735,0.001793706,0.001251876,0.001242579,0.01968806],"category_scores_gemma":[0.005210102,0.000679712,0.0008577683,0.003918859,0.000705689,0.003863298,0.002102127,0.001671925,0.003056732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000930067,"about_ca_system_score_gemma":0.001300928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001375475,"about_ca_topic_score_gemma":0.002414416,"domain_scores_codex":[0.9991432,0.0001430738,0.00006354314,0.0002911572,0.0002577904,0.0001012567],"domain_scores_gemma":[0.9976671,0.001201924,0.000288075,0.0002458408,0.0003924491,0.0002046841],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007992767,0.0002992497,0.00282095,0.002583904,0.0003680772,0.0008509616,0.001079338,0.06016086,0.01866569,0.5042873,0.03923805,0.3688464],"study_design_scores_gemma":[0.0001464176,0.0002437161,0.00166694,0.00027963,0.0001592707,0.0006763691,0.0006537906,0.05902388,0.007545575,0.8044437,0.1251017,0.00005910961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.172436,0.002910607,0.7291766,0.00245243,0.0008299299,0.001051805,0.01589191,0.002010055,0.07324068],"genre_scores_gemma":[0.3862251,0.003663552,0.5438222,0.0004799349,0.000229311,0.0009422189,0.01525244,0.0005980786,0.04878704],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01968806,"threshold_uncertainty_score":0.06586313,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03888412546932748,"score_gpt":0.2914092214865761,"score_spread":0.2525250960172487,"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."}}