{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002959928,0.002566969,0.001634034,0.001687626,0.001275182,0.004444555,0.003269792,0.002024376,0.01418374],"category_scores_gemma":[0.01015684,0.0009059104,0.002295865,0.004957211,0.002042012,0.008125116,0.003125373,0.004485956,0.00372439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00191524,"about_ca_system_score_gemma":0.001844317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001768002,"about_ca_topic_score_gemma":0.001746761,"domain_scores_codex":[0.9951228,0.001812984,0.000415469,0.001175992,0.001033618,0.0004391591],"domain_scores_gemma":[0.9954301,0.002586052,0.0003885768,0.0008683238,0.0005181447,0.0002088172],"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.0001391945,0.0001103249,0.0005020694,0.0006651231,0.00009939605,0.0001547308,0.0002350055,0.07500544,0.0009543499,0.8066753,0.02481483,0.09064433],"study_design_scores_gemma":[0.0000612653,0.00009415579,0.0002369601,0.0001017686,0.00005282638,0.0004233757,0.0001396824,0.1109878,0.0008663092,0.7946079,0.0923931,0.00003481456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009759596,0.005374693,0.9345146,0.001611086,0.000807935,0.0004313604,0.001446389,0.0005463882,0.04550797],"genre_scores_gemma":[0.2409423,0.01348922,0.7039266,0.001182775,0.001925763,0.00103936,0.004928635,0.00065214,0.03191322],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01418374,"threshold_uncertainty_score":0.04744929,"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."}}