{"id":"W4298867261","doi":"","title":"Upper bounds and algorithms for the maximum cardinality bin packing problem","year":2003,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval","funders":"","keywords":"Bin packing problem; Cardinality (data modeling); Bin; Computer science; Algorithm; Combinatorics; Upper and lower bounds; Mathematics; Mathematical optimization; Database","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.003124881,0.0001425198,0.0001402825,0.00005287957,0.0003694997,0.0002768071,0.0002166843,0.00007409022,0.00005086411],"category_scores_gemma":[0.0003291766,0.0001223278,0.00007196853,0.0002423034,0.00009825438,0.0001140974,0.00004682915,0.0001435802,0.000006298967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003677966,"about_ca_system_score_gemma":0.00003107179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008220933,"about_ca_topic_score_gemma":0.000136612,"domain_scores_codex":[0.9985013,0.000681865,0.0002190352,0.0002221313,0.0001384026,0.0002372473],"domain_scores_gemma":[0.9981285,0.000774893,0.00006102386,0.0005390001,0.0004194452,0.00007709084],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001579225,0.000346832,0.01986799,0.0007538895,0.0004383427,0.000002355476,0.02840085,0.01974279,0.004065049,0.6146421,0.008168976,0.303555],"study_design_scores_gemma":[0.001512557,0.000001052372,0.003405475,0.0005352751,0.00008910446,0.00003470012,0.0004765521,0.3420611,0.03082944,0.01395297,0.6063636,0.0007381581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007693144,0.002012843,0.9265072,0.003116746,0.0002282777,0.0005734995,0.00002682754,0.0003364593,0.05950506],"genre_scores_gemma":[0.8687708,0.0007549896,0.1265713,0.00009577083,0.00001710178,0.0001121489,0.00005491635,0.0000563602,0.003566623],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8610776,"threshold_uncertainty_score":0.4988384,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01503853518162119,"score_gpt":0.2180373778613141,"score_spread":0.202998842679693,"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."}}