{"id":"W3126046128","doi":"10.1007/s10479-017-2725-7","title":"Negative dependence in matrix arrangement problems","year":2017,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Eidgenössische Technische Hochschule Zürich; Swiss Finance Institute","keywords":"Theory of computation; Mathematical optimization; Maximization; Computer science; Minification; Matrix (chemical analysis); Scheduling (production processes); Mathematics; Algorithm","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.002099534,0.00006519233,0.0001149178,0.0002368971,0.0002871683,0.0001681226,0.0003936951,0.00004869763,0.0001042807],"category_scores_gemma":[0.0009796474,0.00006659474,0.00002284085,0.0002215135,0.0001052873,0.0003681282,0.00009280262,0.0002480221,0.00003662242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002412685,"about_ca_system_score_gemma":0.00005033955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003947052,"about_ca_topic_score_gemma":0.0006773013,"domain_scores_codex":[0.998866,0.0001627643,0.0002314876,0.0001331893,0.000344086,0.0002624695],"domain_scores_gemma":[0.9989236,0.0001070435,0.00001510703,0.000458602,0.0004447668,0.00005090103],"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.000003662166,0.0000324533,0.001795597,0.00004547051,0.00001338825,0.000002495419,0.000838235,0.9862574,0.005358641,0.001598404,0.0003762782,0.003677928],"study_design_scores_gemma":[0.0002974303,0.00005452445,0.0181366,0.000120192,0.000001320312,0.000001039336,0.0002294608,0.9241984,0.05570161,0.0006235642,0.0005076228,0.0001281822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9139485,0.0005877567,0.04679272,0.0050723,0.0001765536,0.001353812,0.0000308899,0.0001114018,0.03192608],"genre_scores_gemma":[0.9710454,0.0003810652,0.02782776,0.000007918999,0.00002796719,0.00007809717,0.000002724252,0.00001516934,0.0006138764],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.062059,"threshold_uncertainty_score":0.2715655,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2819698716354554,"score_gpt":0.4996053223965837,"score_spread":0.2176354507611283,"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."}}