{"id":"W2943265657","doi":"10.1109/access.2019.2914248","title":"Efficient Free-Form Contour Packing Based on Code Matching Strategy","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"Jiangsu Key Laboratory of Precision and Micro-Manufacturing Technology; National Natural Science Foundation of China; Natural Science Foundation of Hebei Province; Hebei Provincial Postdoctoral Science Foundation","keywords":"Computer science; Matching (statistics); Code (set theory); Algorithm; Artificial intelligence; Mathematics; Programming language; Statistics","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.0002538092,0.0007596069,0.0009855002,0.001308267,0.0005040596,0.0007874175,0.0009021754,0.0006774182,0.002804843],"category_scores_gemma":[0.001268952,0.0004093793,0.0005749503,0.002005251,0.0004261021,0.001564806,0.0009740415,0.000468861,0.0008935363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003241898,"about_ca_system_score_gemma":0.0006819886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002156811,"about_ca_topic_score_gemma":0.001338267,"domain_scores_codex":[0.9994913,0.00005583187,0.0000326829,0.00009172475,0.0002764905,0.00005188071],"domain_scores_gemma":[0.999519,0.000138509,0.00005725053,0.0001230135,0.0001318086,0.00003052151],"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.000255584,0.0001372372,0.0008972104,0.0001471845,0.00003157136,0.0002427736,0.0002045443,0.1492736,0.05298422,0.02081045,0.005514038,0.7695014],"study_design_scores_gemma":[0.00002071527,0.0000761121,0.0002814335,0.000007509955,0.00001210055,0.0002093535,0.00002868027,0.9725165,0.01944045,0.004673234,0.002713481,0.00002038808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0225051,0.0001379034,0.9744807,0.00003280904,0.00002788432,0.0000379379,0.00003439561,0.0007118666,0.002031421],"genre_scores_gemma":[0.3108534,0.000298991,0.6836273,0.00006370599,0.00003852689,0.0001032194,0.000366699,0.0002097094,0.004438503],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002804843,"threshold_uncertainty_score":0.009383142,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02192024885331195,"score_gpt":0.263776084000329,"score_spread":0.241855835147017,"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."}}