{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00105583,0.0001274576,0.000131785,0.0004365095,0.0003258602,0.0003417828,0.0001625454,0.00004869069,0.0001283132],"category_scores_gemma":[0.000231008,0.0001095684,0.00004401891,0.0006042211,0.00003353235,0.001506759,0.00007855146,0.0001824824,0.0003508121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000987441,"about_ca_system_score_gemma":0.00002402031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002145636,"about_ca_topic_score_gemma":0.0004687362,"domain_scores_codex":[0.9988262,0.00001403886,0.0004940811,0.0001476304,0.0002820494,0.0002359937],"domain_scores_gemma":[0.9993131,0.00001967436,0.0002123251,0.0001298402,0.0003095584,0.00001548939],"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.0002780675,0.0004696047,0.1585087,0.0003879612,0.00005449935,0.00002087971,0.001705889,0.4907936,0.0001247836,0.03523708,0.008085605,0.3043334],"study_design_scores_gemma":[0.00118249,0.00007669367,0.1402743,0.0002586305,0.00001084486,0.000005359615,0.0003444985,0.7891654,0.0000349794,0.002351762,0.06596771,0.0003273607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9691728,0.000008607458,0.01635746,0.001098957,0.001385103,0.0002271638,2.184646e-7,0.0000873118,0.01166235],"genre_scores_gemma":[0.9971364,0.000004674163,0.0001812761,0.001507704,0.00106341,0.000002305308,0.000008833549,0.000009685045,0.00008577423],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.304006,"threshold_uncertainty_score":0.4509096,"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."}}