{"id":"W4256731050","doi":"10.1002/jgt.20161","title":"The <i>k</i>‐piece packing problem","year":2006,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Graph; Degree (music); Discrete mathematics; Matching (statistics); Time complexity","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.0009324223,0.0009999713,0.001581785,0.0007447802,0.001248202,0.002862433,0.001825905,0.002417197,0.009318509],"category_scores_gemma":[0.004586987,0.0009770868,0.0009610028,0.00201202,0.001195376,0.005318473,0.002101336,0.00117566,0.001074571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009047161,"about_ca_system_score_gemma":0.00055054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001395084,"about_ca_topic_score_gemma":0.0007577055,"domain_scores_codex":[0.9991397,0.000225868,0.00006677918,0.0002009036,0.0001068589,0.0002599105],"domain_scores_gemma":[0.9981483,0.0009276829,0.0002921213,0.0003071386,0.00008443927,0.0002402867],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002863165,0.0006985126,0.005731617,0.001722369,0.0003776134,0.001235354,0.001442089,0.4481699,0.02524519,0.2367956,0.03611621,0.2396023],"study_design_scores_gemma":[0.0002262532,0.0009091193,0.004227098,0.0001949433,0.0002464864,0.002601495,0.001504238,0.6275904,0.01990015,0.3123445,0.03014369,0.0001117504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5369627,0.001772475,0.4221703,0.002417667,0.0001955372,0.0003399946,0.001572831,0.0007606438,0.03380779],"genre_scores_gemma":[0.8205214,0.001050436,0.1643798,0.0002444284,0.0001992197,0.0002277713,0.001833935,0.0002624831,0.0112806],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009318509,"threshold_uncertainty_score":0.03117347,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.003255866224064684,"score_gpt":0.1759290234281393,"score_spread":0.1726731572040746,"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."}}