{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001786483,0.001734392,0.001574973,0.002698759,0.001692632,0.003974855,0.004661305,0.003218179,0.01498226],"category_scores_gemma":[0.01338253,0.001163729,0.001741084,0.005637723,0.001464921,0.009707578,0.004349643,0.003899313,0.002664285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002781576,"about_ca_system_score_gemma":0.002861757,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00407633,"about_ca_topic_score_gemma":0.005499593,"domain_scores_codex":[0.9983019,0.0004187064,0.0001312363,0.0005168475,0.0003794758,0.0002517852],"domain_scores_gemma":[0.9936481,0.004311814,0.0003298693,0.0008955121,0.0004679798,0.0003466466],"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.0009431257,0.0005303147,0.001368382,0.001343377,0.0001779554,0.0001045196,0.0004686407,0.1331412,0.002995706,0.3545873,0.0341051,0.4702343],"study_design_scores_gemma":[0.0003903148,0.00008302995,0.000309415,0.0001072487,0.0000898908,0.0001539575,0.0002025804,0.2999094,0.001946764,0.6789866,0.01778613,0.00003475211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03760387,0.003253822,0.9251349,0.002838121,0.0003664813,0.0005091241,0.0009412488,0.001852934,0.02749947],"genre_scores_gemma":[0.1787941,0.00265507,0.8008341,0.0007589576,0.0003204223,0.0008547705,0.00252784,0.000601767,0.01265304],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01498226,"threshold_uncertainty_score":0.05012065,"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."}}