{"id":"W2084046657","doi":"10.1016/j.disopt.2012.01.001","title":"Emergency path restoration problems","year":2012,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Server; Scheduling (production processes); Computer science; Path (computing); Time complexity; Node (physics); Computer network; Distributed computing; Mathematical optimization; Mathematics; Algorithm; Engineering","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.0004384249,0.0001351027,0.000102211,0.000123662,0.0002016381,0.0001227157,0.0003541439,0.00007312315,0.0002579122],"category_scores_gemma":[0.00006793436,0.0001253711,0.00004775721,0.0006464201,0.00001838017,0.002549633,0.0001127547,0.00009310598,0.00009888375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004621119,"about_ca_system_score_gemma":0.00003312211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009646862,"about_ca_topic_score_gemma":0.000001589901,"domain_scores_codex":[0.9986262,0.0001263844,0.0002970582,0.0002454737,0.0003322665,0.0003726293],"domain_scores_gemma":[0.9991111,0.00001311959,0.0001301428,0.0004044706,0.0001647709,0.0001764658],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002932874,0.00008609896,0.002920632,0.00002203896,0.000009745966,3.362431e-7,0.001688988,0.9158221,0.0001375055,0.07406121,0.003189594,0.002058752],"study_design_scores_gemma":[0.000189185,0.00004144222,0.0005430616,0.0000113452,0.000004134723,0.000002614811,0.00002744273,0.9946676,0.00008001074,0.0004243473,0.00380818,0.0002006195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001596968,0.0002244505,0.9864433,0.0006331061,0.0005907208,0.0003215567,0.000002277864,0.0002694088,0.01135546],"genre_scores_gemma":[0.4131606,0.0006472453,0.5833369,0.0002125457,0.0002574722,0.0001153531,0.0002190646,0.00003685572,0.002013952],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4130009,"threshold_uncertainty_score":0.5112484,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02471990667949928,"score_gpt":0.2708562861310064,"score_spread":0.2461363794515072,"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."}}