{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.003260938,0.000396801,0.0004295266,0.0004761936,0.0007417792,0.0004616689,0.007635751,0.0001143502,0.0001655151],"category_scores_gemma":[0.0002418706,0.000331214,0.0001481173,0.002901711,0.006629492,0.001676427,0.003285596,0.0005979326,0.0004363696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009597539,"about_ca_system_score_gemma":0.000247227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006694041,"about_ca_topic_score_gemma":9.914463e-7,"domain_scores_codex":[0.9944699,0.0002750861,0.0005327945,0.001581373,0.001556115,0.001584768],"domain_scores_gemma":[0.9956252,0.0006318471,0.0001030058,0.002294134,0.0004179889,0.0009278143],"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.000007736511,0.00009745499,0.003176171,0.000003653993,0.000007016323,0.00007077055,0.000775256,0.0000109088,0.0003519843,0.9191293,0.0000235606,0.07634618],"study_design_scores_gemma":[0.000280737,0.0007380388,0.02253367,0.00004440343,0.00001042179,0.00007392804,0.00001858801,0.08124296,0.01138864,0.8827994,0.0001806497,0.0006885304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04821567,0.00003565861,0.9348867,0.0002440793,0.0005040948,0.0003300406,0.000006137948,0.0005297363,0.01524791],"genre_scores_gemma":[0.8095943,0.000005700123,0.189878,0.0002844902,0.0001795981,0.00001753374,0.000001353819,0.0000208675,0.00001812749],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7613786,"threshold_uncertainty_score":0.999914,"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."}}