{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0106448,0.003547523,0.002287883,0.003377645,0.001412755,0.006028217,0.008556612,0.002721372,0.007309982],"category_scores_gemma":[0.04282706,0.001202432,0.002387799,0.004624535,0.002767521,0.0118731,0.004098473,0.006025235,0.001193368],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004044019,"about_ca_system_score_gemma":0.001383681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001578297,"about_ca_topic_score_gemma":0.00173873,"domain_scores_codex":[0.9820957,0.005890548,0.001057301,0.002690983,0.005937495,0.00232797],"domain_scores_gemma":[0.951571,0.03504376,0.004071823,0.004957892,0.002772965,0.001582529],"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.001408368,0.001026102,0.00399294,0.001316335,0.0004525791,0.0005885858,0.0003881631,0.6691216,0.006863487,0.206574,0.01276728,0.09550047],"study_design_scores_gemma":[0.00005868248,0.0001604658,0.0005888461,0.00006460961,0.00009630082,0.0003598864,0.00009299118,0.9162872,0.002265089,0.07493325,0.005058575,0.00003404099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05304757,0.004894644,0.9157422,0.001848728,0.0004009187,0.0002479072,0.0006652258,0.0007946258,0.02235818],"genre_scores_gemma":[0.5627394,0.004469527,0.4156764,0.001090213,0.00209836,0.0007214107,0.002264938,0.001244186,0.009695485],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0106448,"threshold_uncertainty_score":0.05629569,"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."}}