{"id":"W12471151","doi":"","title":"Worst-case analysis for new online bin packing problems","year":2013,"lang":"en","type":"article","venue":"PORTO Publications Open Repository TOrino (Politecnico di Torino)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bin packing problem; Bin; Upper and lower bounds; Online algorithm; Mathematics; Combinatorics; Competitive analysis; Type (biology); Process (computing); Algorithm; Discrete mathematics; Computer science","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003259801,0.000468125,0.0005920748,0.000738697,0.0005287109,0.001903711,0.001139158,0.0002523336,0.000395422],"category_scores_gemma":[0.00008712662,0.0004846053,0.0003240046,0.002295969,0.00005290876,0.001720553,0.0002543293,0.0002974118,0.00006773721],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003577837,"about_ca_system_score_gemma":0.0002130455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00336401,"about_ca_topic_score_gemma":0.0002968019,"domain_scores_codex":[0.9969168,0.00005388687,0.001168127,0.0007484799,0.0003315943,0.0007810686],"domain_scores_gemma":[0.9965144,0.0001578086,0.0003259883,0.00163228,0.0006742524,0.000695213],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003499612,0.001731747,0.3810794,0.0006115448,0.005669873,0.00006100002,0.003439219,0.3858041,0.003396444,0.08184703,0.1091429,0.02718175],"study_design_scores_gemma":[0.003441633,0.0002794624,0.1065799,0.0002056343,0.001975836,0.0008366141,0.0009050361,0.1663308,0.003918781,0.00275423,0.7089326,0.003839452],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.182042,0.003886151,0.547893,0.005849842,0.01102267,0.02245066,0.000979743,0.009337534,0.2165383],"genre_scores_gemma":[0.9202538,0.00008442253,0.03152369,0.0001272561,0.001232961,0.002198411,0.001073874,0.000191517,0.04331403],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7382118,"threshold_uncertainty_score":0.9997606,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04426712383570507,"score_gpt":0.2804776871891357,"score_spread":0.2362105633534307,"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."}}