{"id":"W2161879374","doi":"10.1109/icc.2007.29","title":"Fast Exact MultiConstraint Shortest Path Algorithms","year":2007,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Algorithm; Mathematical optimization; Path (computing); Shortest path problem; Approximation algorithm; Mathematics; Theoretical computer science","routes":{"ca_aff":true,"ca_fund":false,"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.0003337558,0.0001052186,0.00008799916,0.0001050151,0.000091732,0.0001147172,0.0002462221,0.00005155139,0.0003319846],"category_scores_gemma":[0.00002819192,0.00009403574,0.00004794038,0.000248926,0.00005428608,0.0003430179,0.00006640097,0.00009708024,0.0001065204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004042483,"about_ca_system_score_gemma":0.00004580063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003157339,"about_ca_topic_score_gemma":0.00005977015,"domain_scores_codex":[0.9990584,0.00001567344,0.0002192741,0.0002603162,0.0001943494,0.0002520088],"domain_scores_gemma":[0.9993778,0.00008445205,0.00004506774,0.0002821398,0.00007026591,0.000140311],"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.000001194591,0.00004255962,0.003093971,0.000001073401,0.000007237717,0.00002588465,0.0002719671,0.00047276,0.0004689691,0.03597471,0.0001808957,0.9594588],"study_design_scores_gemma":[0.0007204308,0.0000830826,0.1233202,0.00001590009,0.000006361497,0.0001910852,0.0004930318,0.8667864,0.003519301,0.0005196497,0.003843641,0.0005009898],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001802852,0.000006675511,0.9608704,0.0003591547,0.0003373495,0.0001070225,0.000001262766,0.0003239102,0.03619134],"genre_scores_gemma":[0.7015218,0.000004599694,0.2977214,0.0003529512,0.00003993748,0.000001600649,0.000002592237,0.000004189426,0.0003508624],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9589578,"threshold_uncertainty_score":0.3834666,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01236867475072697,"score_gpt":0.2490259893291628,"score_spread":0.2366573145784358,"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."}}