{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001120709,0.001022398,0.001356837,0.000812672,0.0008492553,0.0009846626,0.00224216,0.00118683,0.00497647],"category_scores_gemma":[0.005122181,0.00064377,0.0007534493,0.002082641,0.0005669065,0.002344769,0.001837148,0.001289812,0.0009123816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001367392,"about_ca_system_score_gemma":0.001772911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006246342,"about_ca_topic_score_gemma":0.009951643,"domain_scores_codex":[0.9986377,0.0002957387,0.00007946092,0.0003280376,0.0004694017,0.0001896592],"domain_scores_gemma":[0.997655,0.0013017,0.000180653,0.0004875333,0.0003089608,0.00006611148],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002027779,0.0001270597,0.0009349282,0.0002631105,0.00005706194,0.00007151692,0.0001472564,0.6175873,0.002506544,0.04777924,0.006693941,0.3236293],"study_design_scores_gemma":[0.00002846456,0.00002552598,0.0001243177,0.000008313291,0.000007831242,0.00003922461,0.00001763869,0.9688467,0.0008302198,0.02781758,0.002247453,0.000006661188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01424279,0.0006078756,0.9775333,0.0002528993,0.00005229365,0.0001090398,0.0002622166,0.001537777,0.005401798],"genre_scores_gemma":[0.2534027,0.0003228314,0.7416447,0.0001754929,0.00003750108,0.0001736193,0.0006727389,0.0001895561,0.00338092],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006246342,"threshold_uncertainty_score":0.01664799,"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."}}