{"id":"W1569707558","doi":"","title":"Variants of Shortest Path Problems","year":2011,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Digraph; Mathematics; Longest path problem; Combinatorics; Shortest path problem; Bottleneck; Discrete mathematics; Path (computing); Algebraic number; Mathematical optimization; Graph; Computer science","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.0005713394,0.00008776308,0.0001155697,0.0002384768,0.0001302656,0.00004189072,0.000211981,0.0000730449,0.0008324671],"category_scores_gemma":[0.00004656673,0.00008439636,0.00002662055,0.0006178698,0.00008440462,0.0001879208,0.00004002779,0.0002472638,0.0001557856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003167528,"about_ca_system_score_gemma":0.00006543256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002196023,"about_ca_topic_score_gemma":0.00006752473,"domain_scores_codex":[0.998966,0.00007295938,0.0002542032,0.0001466712,0.0002827454,0.0002774042],"domain_scores_gemma":[0.9992646,0.00003434398,0.000006319718,0.0002882783,0.0003264111,0.00008006115],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008767937,0.0005109995,0.002033636,0.0001881188,0.0001936349,0.00001800611,0.01435007,0.9128112,0.01759415,0.02282177,0.005011247,0.02445847],"study_design_scores_gemma":[0.0002662889,0.0001071377,0.002302627,0.00005526726,0.00000570636,0.00000904499,0.0001818786,0.9918936,0.003405371,0.0002977091,0.00131211,0.0001632005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1035259,0.001472996,0.4805487,0.0002828481,0.001543618,0.003682755,0.0002384645,0.001193859,0.4075109],"genre_scores_gemma":[0.9682594,0.0002699871,0.03028099,0.000006614726,0.00005082753,0.00008601726,0.00002963667,0.00003286748,0.0009836376],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8647335,"threshold_uncertainty_score":0.9114931,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1195355251014714,"score_gpt":0.310154888384663,"score_spread":0.1906193632831916,"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."}}