{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003348792,0.001704719,0.003985418,0.001803369,0.002656083,0.005099206,0.006211674,0.005154914,0.02585294],"category_scores_gemma":[0.01623138,0.002029659,0.002645343,0.004493868,0.003451014,0.00943797,0.005344009,0.00649442,0.003041792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002355471,"about_ca_system_score_gemma":0.001775677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004869492,"about_ca_topic_score_gemma":0.00490724,"domain_scores_codex":[0.9973074,0.0008562412,0.000157965,0.0006047521,0.0004578904,0.0006157838],"domain_scores_gemma":[0.9903092,0.00556434,0.0006739163,0.001285913,0.001062604,0.001103999],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006621724,0.0003383796,0.001041296,0.0001658998,0.00008942321,0.0002639622,0.0002100735,0.326319,0.001322767,0.6397119,0.006277734,0.02359743],"study_design_scores_gemma":[0.0001050106,0.00005992213,0.0001477984,0.00002529302,0.00003332847,0.0000505258,0.00007206576,0.669251,0.0006232389,0.3278656,0.001740461,0.000025767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0718637,0.0006899444,0.9056582,0.00171208,0.0003654867,0.0003241653,0.0006268923,0.0004562757,0.01830322],"genre_scores_gemma":[0.643538,0.001911635,0.2604951,0.0009745838,0.0005033776,0.0007138681,0.001539655,0.0005275307,0.08979621],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02585294,"threshold_uncertainty_score":0.08648676,"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."}}