{"id":"W1603740932","doi":"10.1023/a:1013370208101","title":"3-Partitioning Problems for Maximizing the Minimum Load","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta; McMaster University; University of Waterloo","funders":"","keywords":"Theory of computation; Computer science; Combinatorics; Mathematics; Mathematical optimization; Algorithm; Discrete mathematics","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.0004265759,0.0001115479,0.0001720542,0.00008115488,0.0001488414,0.0001199809,0.0001603415,0.00008019971,0.00007869593],"category_scores_gemma":[0.0002290116,0.00008810639,0.0001041186,0.0002399026,0.00002229464,0.0002972946,0.000008531394,0.0001614344,0.000004377242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000106951,"about_ca_system_score_gemma":0.00002225497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.242261e-7,"about_ca_topic_score_gemma":7.296302e-8,"domain_scores_codex":[0.9989966,0.00003024848,0.0004670568,0.00006773237,0.0002782157,0.0001602003],"domain_scores_gemma":[0.9989984,0.0001283553,0.0002065815,0.0001042887,0.0005017131,0.00006064758],"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.00001119867,0.00003045577,0.00001059664,0.00001758879,0.0000357749,7.004194e-7,0.0003620855,0.996065,0.00003872635,0.0007586874,0.002019451,0.000649801],"study_design_scores_gemma":[0.001408332,0.00009968458,0.000003521891,0.00005204383,0.00004376449,0.00002007548,0.00006668931,0.994215,0.0003511086,0.0007090717,0.002922001,0.0001086674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001290759,0.001024094,0.9879255,0.0007301759,0.007225921,0.0002676941,0.000002426846,0.00009831295,0.001435113],"genre_scores_gemma":[0.4847935,0.0007273601,0.5116414,0.0001170315,0.002405439,0.00003548506,0.000009487317,0.00009524369,0.0001750079],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4835028,"threshold_uncertainty_score":0.3592874,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01708650442051253,"score_gpt":0.2139673845605278,"score_spread":0.1968808801400153,"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."}}