{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002629257,0.001757792,0.001232665,0.001937522,0.0009888456,0.001929025,0.003237086,0.001702107,0.005104695],"category_scores_gemma":[0.008127899,0.0006220331,0.001609628,0.002858404,0.00211662,0.005376733,0.003184448,0.003889631,0.0006489664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001833132,"about_ca_system_score_gemma":0.002176882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001754492,"about_ca_topic_score_gemma":0.002268462,"domain_scores_codex":[0.9976093,0.001029052,0.000101377,0.0005111771,0.0005780663,0.0001711432],"domain_scores_gemma":[0.9958734,0.002895667,0.0003057155,0.0003922726,0.0003395642,0.0001934131],"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.00006532238,0.0001201559,0.0004974679,0.0004579765,0.00008443587,0.0001732675,0.0002028908,0.298115,0.002527101,0.6211092,0.005031334,0.07161582],"study_design_scores_gemma":[0.00001668897,0.00006143327,0.0001708605,0.00003840827,0.00003088323,0.0001239775,0.0000638802,0.5734497,0.0008155545,0.4183162,0.006892886,0.00001950179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003282123,0.0001647997,0.9944073,0.000272053,0.00004218262,0.00006261475,0.00004867558,0.00005932453,0.001660838],"genre_scores_gemma":[0.1906264,0.001369949,0.8000996,0.0002853016,0.0003788261,0.0005085467,0.0004411733,0.0002586603,0.006031708],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005104695,"threshold_uncertainty_score":0.01707691,"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."}}