{"id":"W2168358943","doi":"10.1016/j.jda.2011.12.006","title":"Chains-into-bins processes","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bin; Ball (mathematics); Chain (unit); Combinatorics; Set (abstract data type); Object (grammar); Mathematics; Computer science; Process (computing); Mathematical optimization; Algorithm; Discrete mathematics; Geometry; Artificial intelligence; Physics","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.0001463495,0.0001124756,0.0001706586,0.0001211278,0.00003842346,0.00003038019,0.000176524,0.0000545608,0.0001838892],"category_scores_gemma":[0.00003564175,0.00009020832,0.00006885963,0.0002192031,0.00002594347,0.0002774253,0.00001255561,0.0001723427,0.00001887447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002507861,"about_ca_system_score_gemma":0.00004033691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005507969,"about_ca_topic_score_gemma":0.000004357739,"domain_scores_codex":[0.9992767,0.00001194769,0.0003214515,0.00005983351,0.0001769034,0.0001531513],"domain_scores_gemma":[0.9995036,0.00001615892,0.0001102832,0.00009464988,0.0001656071,0.0001097775],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004016576,0.00122753,0.01646761,0.005166899,0.00370823,0.001117303,0.1354447,0.37152,0.007627358,0.008061005,0.04791091,0.4013468],"study_design_scores_gemma":[0.01102282,0.004002733,0.01312695,0.002712685,0.0008145295,0.00226113,0.005156985,0.5485396,0.1308745,0.01798887,0.2587833,0.004715865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02683973,0.00668779,0.8751342,0.0004302485,0.003847905,0.0003115021,0.00002379248,0.0004811576,0.08624364],"genre_scores_gemma":[0.9060419,0.001384397,0.09148162,0.00007945076,0.0004258364,0.000003048518,0.000003707332,0.00005997382,0.0005200514],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8792022,"threshold_uncertainty_score":0.3678589,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0215612476024199,"score_gpt":0.2219656365516082,"score_spread":0.2004043889491883,"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."}}