{"id":"W4402855487","doi":"10.3390/math12192995","title":"Generalized Shortest Path Problem: An Innovative Approach for Non-Additive Problems in Conditional Weighted Graphs","year":2024,"lang":"en","type":"article","venue":"Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Shortest path problem; Longest path problem; Mathematics; Path (computing); Widest path problem; Combinatorics; Mathematical optimization; Computer science; Discrete mathematics; Graph","routes":{"ca_aff":true,"ca_fund":true,"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.0005875067,0.0002509216,0.0003213669,0.0004001791,0.0001315113,0.0003311329,0.0006513572,0.00009573143,0.0000191169],"category_scores_gemma":[0.00002337063,0.0002175386,0.00009546902,0.001806932,0.0001227216,0.00060483,0.0001419702,0.0002366681,0.00000827154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005378076,"about_ca_system_score_gemma":0.000133731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009586982,"about_ca_topic_score_gemma":0.000008900096,"domain_scores_codex":[0.9982006,0.0000461531,0.0005019226,0.0005515473,0.0003335561,0.0003661998],"domain_scores_gemma":[0.9989772,0.0002340315,0.0000983689,0.0003844889,0.0002300904,0.0000758036],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002217224,0.0005970426,0.00002912692,0.0003061504,0.00005579566,0.00001039604,0.00692967,0.0002047738,0.0002337101,0.9869564,0.001065632,0.003609068],"study_design_scores_gemma":[0.0002639095,0.000101674,0.0000632068,0.0001027265,0.000005873452,0.00001735028,0.00008790365,0.5411108,0.0001998451,0.4573422,0.0005138296,0.0001906612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0077641,0.00005631231,0.9878327,0.0001314244,0.0001458359,0.001245955,0.0001638993,0.0002638432,0.002395928],"genre_scores_gemma":[0.1345028,0.000009738483,0.863853,0.00011107,0.00007676143,0.0008474534,0.000428289,0.00002868813,0.0001422408],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.540906,"threshold_uncertainty_score":0.8870966,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03580666959357446,"score_gpt":0.2776638185410328,"score_spread":0.2418571489474583,"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."}}