{"id":"W1563143451","doi":"","title":"The α-reliable shortest path problem","year":2008,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Shortest path problem; Mathematical optimization; Computer science; Path (computing); Heuristic; Knapsack problem; Set (abstract data type); Integer programming; A priori and a posteriori; Constrained Shortest Path First; Longest path problem; Mathematics; K shortest path routing; Theoretical 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":"codex-gemma-dda1882f352a","candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001581352,0.0001179845,0.00009438789,0.0002231818,0.003509635,0.0004886324,0.0005114017,0.00004191223,0.0005243733],"category_scores_gemma":[0.0001936012,0.00008559228,0.00004808299,0.001198972,0.0002461636,0.0008106137,0.0002815679,0.0002904845,0.004271287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006315806,"about_ca_system_score_gemma":0.0001017968,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007703662,"about_ca_topic_score_gemma":0.003058106,"domain_scores_codex":[0.9981027,0.00003496861,0.0003053302,0.0003079807,0.00074367,0.00050533],"domain_scores_gemma":[0.9986159,0.00003720913,0.000008618994,0.0005010456,0.0008153582,0.00002191093],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003053869,0.0006446523,0.00328996,0.00008674654,0.0001078649,0.00003841787,0.0005465091,0.07603365,0.0004232716,0.3111268,0.5760028,0.03166876],"study_design_scores_gemma":[0.0002062285,0.000014483,0.003025835,0.000009669029,0.000005685531,0.000003466889,0.0004657133,0.4018525,0.00001842676,0.0005903507,0.5936587,0.0001489047],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4046341,0.001879834,0.01525684,0.08011449,0.003145092,0.008157543,0.00002520859,0.001147616,0.4856393],"genre_scores_gemma":[0.9537694,0.0006016821,0.001343623,0.0006190958,0.001001909,0.000569593,0.00007989347,0.0000282511,0.04198651],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5491354,"threshold_uncertainty_score":0.9989041,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08721923934476747,"score_gpt":0.3182600762586555,"score_spread":0.231040836913888,"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."}}