{"id":"W2891737621","doi":"10.1287/ijoc.2017.0796","title":"Lateness Minimization in Pairwise Connectivity Restoration Problems","year":2018,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Pairwise comparison; Integer programming; Linear programming; Schedule; Mathematical optimization; Path (computing); Computer science; Integer (computer science); Minification; Mathematics; Path length; Algorithm; Combinatorics; Statistics","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.003642848,0.003037932,0.002410005,0.001598573,0.001177332,0.002287383,0.004000225,0.002758726,0.007276556],"category_scores_gemma":[0.01429234,0.001254964,0.001603754,0.002642549,0.001468699,0.003765337,0.001685305,0.00300206,0.0006691847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003072852,"about_ca_system_score_gemma":0.001988869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003603173,"about_ca_topic_score_gemma":0.003694043,"domain_scores_codex":[0.9974734,0.001203204,0.00009765902,0.0004708516,0.0003410403,0.000413883],"domain_scores_gemma":[0.9913417,0.00645097,0.0009607994,0.0002860835,0.0004323066,0.0005282817],"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.00022131,0.0002670321,0.0009021632,0.0004827359,0.00009020264,0.0002135639,0.0001278348,0.9495497,0.001179294,0.0221774,0.00399534,0.02079334],"study_design_scores_gemma":[0.00008845563,0.000256616,0.0005130573,0.00005756818,0.00005414553,0.0001589715,0.0001148323,0.9422308,0.0008868755,0.05348237,0.002130284,0.00002611907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1404727,0.002400285,0.8377143,0.002256114,0.0003044778,0.0006345768,0.001489559,0.0006554499,0.01407254],"genre_scores_gemma":[0.6949255,0.001829254,0.2852302,0.0005600263,0.0004533432,0.001100317,0.002120877,0.000834953,0.01294553],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007276556,"threshold_uncertainty_score":0.02434254,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03435752291567121,"score_gpt":0.2512574020572413,"score_spread":0.2168998791415701,"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."}}