{"id":"W2060148847","doi":"10.1016/s1570-8667(03)00002-9","title":"Algorithms for shortest paths and d-cycle problems","year":2003,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Shortest path problem; Cyclomatic complexity; Mathematics; Yen's algorithm; Path (computing); Widest path problem; Combinatorics; Graph; Shortest Path Faster Algorithm; Algorithm; K shortest path routing; Dijkstra's algorithm; Computer science; Discrete mathematics; Software","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.00156312,0.0002071474,0.000363491,0.0002489941,0.0001961111,0.0002096555,0.0007597696,0.00007897602,0.000009389298],"category_scores_gemma":[0.000303487,0.0001626259,0.0001819765,0.0004293251,0.0001402986,0.001100976,0.000121162,0.0003326573,0.000003355064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000475421,"about_ca_system_score_gemma":0.0001326834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002445833,"about_ca_topic_score_gemma":0.000001584998,"domain_scores_codex":[0.9979171,0.0001430601,0.0005543486,0.0003282449,0.0005465724,0.0005106379],"domain_scores_gemma":[0.9982208,0.0003384313,0.0003259046,0.0003850939,0.0003992339,0.0003305195],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001201192,0.0006027349,0.002207578,0.0002004561,0.0005169209,0.0003595852,0.002893543,0.0022711,0.008954155,0.2439394,0.001860508,0.7360739],"study_design_scores_gemma":[0.005196482,0.003876489,0.001377754,0.0002604878,0.00008025668,0.002316451,0.000583625,0.1850818,0.008690463,0.7436748,0.04777519,0.001086237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003753144,0.002022526,0.9923092,0.0005179911,0.0004279102,0.000351278,0.0000135462,0.00003071753,0.0005737133],"genre_scores_gemma":[0.2107419,0.0005344164,0.7877672,0.000164292,0.0002868974,0.00003715765,0.000001994332,0.00004971922,0.000416402],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7349877,"threshold_uncertainty_score":0.6631691,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02654587817814907,"score_gpt":0.3063723455624698,"score_spread":0.2798264673843207,"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."}}