{"id":"W3199751886","doi":"10.5539/jmr.v13n5p14","title":"A Comprehensive Comparison of Label Setting Algorithm and Dynamic Programming Algorithm in Solving Shortest Path Problems","year":2021,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Shortest path problem; Computer science; Algorithm; Dynamic programming; K shortest path routing; Path (computing); Mathematical optimization; Mathematics; Theoretical computer science; Graph; Computer network","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003095928,0.0001375658,0.0005384326,0.0004062239,0.00007375095,0.000103965,0.0001886964,0.0001017056,0.000008252337],"category_scores_gemma":[0.0005868946,0.0001342387,0.00005226218,0.0007155267,0.000081436,0.000151485,0.0001375987,0.0009230954,8.888467e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001376481,"about_ca_system_score_gemma":0.000114687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004341188,"about_ca_topic_score_gemma":0.000004966249,"domain_scores_codex":[0.9974055,0.0002800517,0.001023764,0.000130602,0.0007726355,0.0003874896],"domain_scores_gemma":[0.9973494,0.001145201,0.0002345742,0.0001752263,0.0009860558,0.0001095088],"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.000003982924,0.0007063288,0.003288624,0.002683097,0.0001916439,0.0002073349,0.01335281,0.1563025,0.02200054,0.0000680682,0.00006448761,0.8011306],"study_design_scores_gemma":[0.0005336339,0.00009263797,0.0004242454,0.001134405,0.00001373968,0.0001876503,0.005266977,0.9897014,0.001997338,0.0004768196,0.00005998468,0.0001111487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2168612,0.003691469,0.7787805,0.00009151456,0.0001017199,0.0003153455,0.000006800564,0.00003391586,0.0001174915],"genre_scores_gemma":[0.1090749,0.0002859008,0.8905435,0.000001862239,0.00002982764,0.000005272556,0.000001979023,0.00004056001,0.00001615186],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8333989,"threshold_uncertainty_score":0.5474097,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07689474368349493,"score_gpt":0.4005593809347281,"score_spread":0.3236646372512332,"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."}}