{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":349,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":349,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"c1fe0075ff10","filters":{"topic":"Optimization and Packing Problems"}},"results":[{"id":"W2126475333","doi":"10.1287/trsc.1050.0145","title":"A Tabu Search Algorithm for a Routing and Container Loading Problem","year":2006,"lang":"en","type":"article","venue":"Transportation Science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":325,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Université de Montréal","funders":"","keywords":"Tabu search; Vehicle routing problem; Routing (electronic design automation); Guided Local Search; Container (type theory); Mathematical optimization; Algorithm; Computer science; Search algorithm; Engineering; Mathematics; Computer network","authors":[{"name":"Michel Gendreau","is_ca":true},{"name":"Manuel Iori","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"Silvano Martello","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01246921401535756,"gpt":0.2430320924813416,"spread":0.2305628784659841,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009822031,0.001092812,0.00112681,0.001349825,0.001286182,0.001418491,0.001364897,0.001756059,0.007635905],"category_scores_gemma":[0.003337154,0.0006538049,0.000761508,0.002842076,0.0007096059,0.001142463,0.0008388798,0.001264742,0.002276864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001077711,"about_ca_system_score_gemma":0.001967238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007160286,"about_ca_topic_score_gemma":0.006328925,"domain_scores_codex":[0.9993473,0.0003022372,0.00002367413,0.00008463507,0.000161459,0.00008066622],"domain_scores_gemma":[0.9991793,0.0004943598,0.00006374173,0.0000725594,0.0001624211,0.00002760068],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001685032,0.0001910073,0.000646781,0.0001985476,0.00008634017,0.0001074126,0.0001653344,0.6205952,0.002604345,0.02608142,0.0145433,0.3346118],"study_design_scores_gemma":[0.0000661987,0.00007690865,0.0001873426,0.00002781494,0.00002611649,0.00007823207,0.00004477805,0.9830898,0.001113994,0.008182419,0.007089355,0.00001698558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02012994,0.0008638652,0.9615005,0.0003124666,0.0001150293,0.0002755292,0.0003469399,0.00327769,0.01317803],"genre_scores_gemma":[0.09944912,0.0003798855,0.89443,0.0001742635,0.00004163772,0.0004989229,0.0006602907,0.000483373,0.00388241],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007635905,"threshold_uncertainty_score":0.02554458,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029049650","doi":"10.1016/j.ejor.2007.01.054","title":"Solving circle packing problems by global optimization: Numerical results and industrial applications","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":215,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Circle packing; Rectangle; Packing problems; Container (type theory); Heuristic; Mathematical optimization; Global optimization; Computer science; Set packing; Work (physics); Mathematics; Combinatorics; Geometry; Engineering; Mechanical engineering","authors":[{"name":"Ignacio Castillo","is_ca":true},{"name":"F. J. Kampas","is_ca":false},{"name":"János D. Pintér","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06645379157372057,"gpt":0.3199350637391034,"spread":0.2534812721653829,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002288688,0.001496621,0.002159904,0.001551784,0.001009292,0.001530688,0.001009919,0.002973553,0.004043082],"category_scores_gemma":[0.008170557,0.0008286542,0.001138772,0.003175569,0.001660617,0.002135972,0.001186076,0.001394404,0.000452593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008151306,"about_ca_system_score_gemma":0.0007508816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004928314,"about_ca_topic_score_gemma":0.003095678,"domain_scores_codex":[0.9991973,0.0004043184,0.00003012327,0.00008670658,0.0002072615,0.00007426747],"domain_scores_gemma":[0.9932154,0.005539591,0.0002713137,0.0003518969,0.0005145399,0.0001073212],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001074314,0.0000622254,0.00024363,0.0001154952,0.00002159303,0.00002613732,0.00006429801,0.9674754,0.0006909333,0.009277369,0.0008670857,0.0210484],"study_design_scores_gemma":[0.00001182811,0.00002874025,0.00007914774,0.000005557499,0.000007055618,0.000009645873,0.00001417991,0.9957048,0.0004998952,0.003373653,0.000260182,0.000005212161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1629211,0.00416053,0.8096317,0.0006025602,0.0001910787,0.00009194262,0.0001370642,0.0004998751,0.02176426],"genre_scores_gemma":[0.6680851,0.001560792,0.3245576,0.000111094,0.000114584,0.0002186179,0.0002060502,0.0003230049,0.004823097],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004928314,"threshold_uncertainty_score":0.01352543,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2749062520","doi":"10.1002/net.20192","title":"A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":203,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Université de Montréal","funders":"Consiglio Nazionale delle Ricerche; Università di Bologna; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Vehicle routing problem; Tabu search; Heuristics; Mathematical optimization; Computer science; Minification; Heuristic; Routing (electronic design automation); Algorithm; Mathematics","authors":[{"name":"Michel Gendreau","is_ca":true},{"name":"Manuel Iori","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"Silvaro Martello","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01426255619985574,"gpt":0.2389436817591051,"spread":0.2246811255592494,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001315739,0.0009078415,0.001237695,0.001602567,0.0009766765,0.001484495,0.001503407,0.001483173,0.007728189],"category_scores_gemma":[0.003434071,0.0007042241,0.0005880769,0.002224958,0.0009781725,0.001080537,0.0007515802,0.0007635786,0.001094236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001554442,"about_ca_system_score_gemma":0.002117247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009768316,"about_ca_topic_score_gemma":0.007756586,"domain_scores_codex":[0.9993089,0.0004345971,0.00001707834,0.00005407384,0.00007883214,0.0001064674],"domain_scores_gemma":[0.9983439,0.001225687,0.0001254393,0.00008275653,0.0001495567,0.00007252771],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008880216,0.00009309866,0.0003082867,0.00006181855,0.00002616831,0.00005382529,0.0000526425,0.9511088,0.0004219328,0.006619405,0.00259854,0.03856679],"study_design_scores_gemma":[0.0000422628,0.00003544006,0.0000692939,0.00001295742,0.000008015867,0.0000142432,0.00002493058,0.9961826,0.0001863646,0.002649646,0.0007682669,0.000005925023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.135209,0.001688801,0.8395484,0.0006334932,0.0001627497,0.0005401283,0.0005744358,0.002151948,0.01949097],"genre_scores_gemma":[0.4262362,0.000564151,0.5664696,0.0002598091,0.00005044043,0.0007702634,0.0007234371,0.000294361,0.004631804],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009768316,"threshold_uncertainty_score":0.0258534,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969327924","doi":"10.1287/opre.2013.1248","title":"Combinatorial Benders' Cuts for the Strip Packing Problem","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":120,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Bounding overwatch; Packing problems; Benchmark (surveying); Scheduling (production processes); Heuristic; Mathematical optimization; Benders' decomposition; Computer science; Heuristics; Bin packing problem; Set (abstract data type); Preprocessor; Algorithm; Container (type theory); Set packing; Mathematics; Artificial intelligence","authors":[{"name":"Jean‐François Côté","is_ca":true},{"name":"Mauro Dell’Amico","is_ca":false},{"name":"Manuel Iori","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0674461263503884,"gpt":0.3422510084130599,"spread":0.2748048820626715,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001406435,0.002259715,0.001404019,0.001223035,0.0006925275,0.001978147,0.001594329,0.001520167,0.008370208],"category_scores_gemma":[0.004393619,0.0009517323,0.001501635,0.002223644,0.001155505,0.002421763,0.001123836,0.003655143,0.001361046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001288356,"about_ca_system_score_gemma":0.001021842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002161483,"about_ca_topic_score_gemma":0.001786316,"domain_scores_codex":[0.9987583,0.0003869453,0.00006636889,0.000267777,0.0003565855,0.0001640076],"domain_scores_gemma":[0.9984369,0.001048824,0.000162918,0.0001308937,0.0001350225,0.00008552845],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003278379,0.0002543431,0.0007323216,0.0006316635,0.0001364959,0.0002578811,0.0002343792,0.7014387,0.004070241,0.1520947,0.01922137,0.1206],"study_design_scores_gemma":[0.0001064902,0.0002086984,0.0005270154,0.00007610504,0.0000611221,0.0001982542,0.00009436967,0.806945,0.002100391,0.1694495,0.02020171,0.00003137077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0211184,0.001338939,0.9578114,0.0007300955,0.0002610441,0.0002905009,0.0007497905,0.0005278437,0.01717192],"genre_scores_gemma":[0.2016861,0.002654329,0.7758955,0.0005386038,0.0006755218,0.0007555528,0.003624683,0.000506233,0.01366354],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008370208,"threshold_uncertainty_score":0.02800119,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102019950","doi":"10.1109/tsmca.2005.851140","title":"A New Heuristic for Solving the Multichoice Multidimensional Knapsack Problem","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics - Part A Systems and Humans","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":116,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Knapsack problem; Continuous knapsack problem; Heuristic; Mathematical optimization; Mathematics; Change-making problem; Relaxation (psychology); Series (stratigraphy); Function (biology); Cutting stock problem; Linear programming; Value (mathematics); Computer science; Applied mathematics; Algorithm; Optimization problem; Statistics","authors":[{"name":"R. Parra-Hernandez","is_ca":true},{"name":"N.J. Dimopoulos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0191187641396252,"gpt":0.2262011737155466,"spread":0.2070824095759214,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007160304,0.0009808331,0.001258508,0.001374011,0.0007601369,0.001084295,0.001548857,0.001158173,0.002823632],"category_scores_gemma":[0.001642203,0.0005101077,0.0009484599,0.001381724,0.0005728187,0.001527515,0.00104902,0.001352608,0.0006483244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000627563,"about_ca_system_score_gemma":0.001291418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002063063,"about_ca_topic_score_gemma":0.003077913,"domain_scores_codex":[0.9991048,0.0002091081,0.0000480562,0.0001059955,0.0003993224,0.0001326773],"domain_scores_gemma":[0.9993413,0.000248313,0.00009869715,0.0001078376,0.0001504632,0.00005342072],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001485887,0.0002665435,0.0005684992,0.0004763611,0.0001165776,0.0003333081,0.0001567431,0.6446295,0.006841354,0.03757748,0.008133138,0.3007519],"study_design_scores_gemma":[0.00007256122,0.000157018,0.000190351,0.00005173096,0.00003490259,0.0003075884,0.00006574956,0.9706174,0.004082175,0.009838227,0.01453899,0.00004341853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007255167,0.0007992729,0.987308,0.00009753103,0.0001787107,0.0001145604,0.00004498387,0.0002725846,0.00392927],"genre_scores_gemma":[0.08146801,0.0007532184,0.9138815,0.0001318751,0.00008933296,0.0002763267,0.0001841597,0.0000955435,0.003120039],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002823632,"threshold_uncertainty_score":0.009445965,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072078883","doi":"10.1287/opre.1060.0278","title":"Dual-Optimal Inequalities for Stabilized Column Generation","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":113,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Dual (grammatical number); Mathematical optimization; Column generation; Mathematics; Linear programming; Column (typography); Binary number; Convergence (economics); Reduction (mathematics); Degeneracy (biology); Computer science","authors":[{"name":"Hatem Ben Amor","is_ca":true},{"name":"Jacques Desrosiers","is_ca":true},{"name":"José Valério de Carvalho","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1200784767221323,"gpt":0.3595593729949236,"spread":0.2394808962727914,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002204485,0.001555489,0.000925459,0.001407283,0.000659481,0.001720406,0.001236717,0.001282079,0.007448542],"category_scores_gemma":[0.007457399,0.0005962896,0.001051683,0.00179752,0.001291939,0.00152388,0.001639073,0.003590906,0.001361681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00118905,"about_ca_system_score_gemma":0.001125312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001262211,"about_ca_topic_score_gemma":0.001196725,"domain_scores_codex":[0.9985232,0.0005572502,0.00007022834,0.0001832796,0.0005076129,0.0001585769],"domain_scores_gemma":[0.9973573,0.001668117,0.0002988787,0.0002324915,0.0003642458,0.00007890804],"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.0002560093,0.0001634272,0.0003651936,0.000363039,0.00004450276,0.0001948855,0.0001332719,0.6420811,0.009603149,0.2358144,0.008233805,0.1027472],"study_design_scores_gemma":[0.00003421386,0.00003705745,0.00006009354,0.00003472223,0.00001019361,0.00003740584,0.000009991033,0.9551482,0.003161451,0.03848134,0.002974199,0.00001119852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00388297,0.0004193534,0.9908136,0.0001653818,0.00007854126,0.0000750523,0.00009669174,0.0001940325,0.004274369],"genre_scores_gemma":[0.2754464,0.001303311,0.7146572,0.0005024251,0.0002527364,0.0006732384,0.0007439352,0.0002735611,0.006147207],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007448542,"threshold_uncertainty_score":0.0249179,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967724669","doi":"10.1145/2816795.2818087","title":"Dapper","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":111,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Science and Technology Planning Project of Guangdong Province; Israel Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; 3D printing; Decomposition; Volume (thermodynamics); Key (lock); Simulated annealing; Container (type theory); Object (grammar); Pruning; Algorithm; Focus (optics); Mathematical optimization; Mathematics; Mechanical engineering; Artificial intelligence; Engineering","authors":[{"name":"Xuelin Chen","is_ca":false},{"name":"Hao Zhang","is_ca":true},{"name":"Jinjie Lin","is_ca":false},{"name":"Ruizhen Hu","is_ca":false},{"name":"Lin Lü","is_ca":false},{"name":"Qixing Huang","is_ca":false},{"name":"Bedřich Beneš","is_ca":false},{"name":"Daniel Cohen‐Or","is_ca":false},{"name":"Baoquan Chen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0425676426562453,"gpt":0.2401329803532276,"spread":0.1975653376969823,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009547431,0.001586707,0.001073715,0.000818963,0.00090082,0.002976522,0.003488589,0.00198954,0.06096582],"category_scores_gemma":[0.002891636,0.0007737532,0.001563173,0.00111061,0.0008271064,0.002986941,0.004423768,0.002215127,0.03143989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007567598,"about_ca_system_score_gemma":0.001270866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009638729,"about_ca_topic_score_gemma":0.001963789,"domain_scores_codex":[0.9988715,0.0001684051,0.00006926592,0.0002820402,0.0004507285,0.0001580143],"domain_scores_gemma":[0.9991274,0.0002331906,0.0000565692,0.0003481009,0.0001585482,0.00007617316],"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.0004431268,0.0002574552,0.001620547,0.001022123,0.0001343104,0.000511664,0.0002132601,0.1015727,0.01483854,0.1506404,0.2551884,0.4735576],"study_design_scores_gemma":[0.0001075943,0.0001770144,0.0004510468,0.00009796421,0.00004645608,0.0009402756,0.0001170268,0.3755153,0.01748551,0.1177259,0.487264,0.00007182767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004509036,0.0007008208,0.9167368,0.0006003314,0.0003679144,0.0002037437,0.002323,0.02433449,0.05022384],"genre_scores_gemma":[0.08545452,0.001387036,0.8279425,0.001224915,0.0001798328,0.0006497866,0.009121778,0.008724351,0.06531522],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.06096582,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2059707428","doi":"10.1137/s1052623497321432","title":"Approximating the Single-Sink Link-Installation Problem in Network Design","year":2001,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":100,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada); University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Sink (geography); Mathematical optimization; Network planning and design; Graph; Mathematics; Topology (electrical circuits); Upper and lower bounds; Computer science; Combinatorics; Computer network","authors":[{"name":"F. Sibel Salman","is_ca":false},{"name":"Joseph Cheriyan","is_ca":true},{"name":"R. Ravi","is_ca":false},{"name":"Sairam Subramanian","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02689754769041781,"gpt":0.2163742663813543,"spread":0.1894767186909365,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002928012,0.001694957,0.001932768,0.001174785,0.0009382626,0.001721935,0.002283213,0.002288833,0.006772333],"category_scores_gemma":[0.01564653,0.0008955247,0.001199468,0.001808132,0.00162812,0.00438606,0.001829169,0.002593191,0.0008563668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002079834,"about_ca_system_score_gemma":0.001572092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002874374,"about_ca_topic_score_gemma":0.004074696,"domain_scores_codex":[0.9983772,0.0008366063,0.00005049955,0.0002856828,0.0002555338,0.0001944963],"domain_scores_gemma":[0.9905398,0.007966354,0.0004505882,0.0004871944,0.0003517788,0.0002043037],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001570686,0.0001213803,0.0009688592,0.0002647801,0.00004239076,0.00008941754,0.0001044226,0.9167073,0.0006581881,0.05000369,0.003834344,0.02704814],"study_design_scores_gemma":[0.00003574099,0.00007188803,0.000168926,0.00003124984,0.00001660285,0.00004944969,0.00004566136,0.9327754,0.0003653833,0.0648398,0.001591398,0.000008460601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06340972,0.0009903806,0.9188752,0.001721499,0.0001210561,0.0001883457,0.0003234431,0.000387606,0.01398277],"genre_scores_gemma":[0.4710369,0.00129073,0.5187557,0.0005027165,0.000192772,0.0004629301,0.0007104847,0.0002858876,0.00676194],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006772333,"threshold_uncertainty_score":0.02265573,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3033378018","doi":"10.1016/j.ejor.2020.04.053","title":"The Pallet Loading Problem: Three-dimensional bin packing with practical constraints","year":2020,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":81,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pallet; Computer science; Bin; Mathematical optimization; Bin packing problem; Generator (circuit theory); Load bearing; Representation (politics); Algorithm; Structural engineering; Mathematics; Power (physics); Engineering","authors":[{"name":"Fatma Gzara","is_ca":true},{"name":"Samir Elhedhli","is_ca":true},{"name":"Burak C. Yildiz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1071445450138916,"gpt":0.328749102098871,"spread":0.2216045570849794,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001285932,0.001686674,0.002453601,0.001000867,0.001049901,0.004219056,0.002731663,0.003957127,0.009899769],"category_scores_gemma":[0.004849251,0.001454704,0.001322026,0.003301166,0.001711557,0.0035717,0.002855042,0.002388759,0.001430753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001332386,"about_ca_system_score_gemma":0.001616588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005382344,"about_ca_topic_score_gemma":0.003690159,"domain_scores_codex":[0.9987043,0.000404048,0.00006284899,0.0002491495,0.0003589173,0.0002206747],"domain_scores_gemma":[0.9984981,0.0009353307,0.000166508,0.000119152,0.0001228703,0.0001580259],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004252513,0.000197606,0.0006347163,0.0008081011,0.00006462308,0.0004740466,0.0001222399,0.89144,0.002966688,0.03212281,0.00886286,0.06188104],"study_design_scores_gemma":[0.00005032912,0.0000959773,0.0004399504,0.00004636001,0.00002442139,0.0002652081,0.0001039474,0.961248,0.001672196,0.03220088,0.003808021,0.00004462147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06510431,0.001813211,0.9090353,0.001872324,0.0003128194,0.0002665128,0.00159854,0.0006874116,0.0193096],"genre_scores_gemma":[0.6908427,0.002756726,0.2842059,0.0005831267,0.000437364,0.0004241043,0.002049811,0.0006059639,0.01809431],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009899769,"threshold_uncertainty_score":0.03311801,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043624414","doi":"10.1016/s0890-6955(00)00024-9","title":"Optimization of hole-making operations: a tabu-search approach","year":2000,"lang":"en","type":"article","venue":"International Journal of Machine Tools and Manufacture","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":77,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Tabu search; Mathematical optimization; Guided Local Search; Computer science; Engineering; Engineering drawing; Operations research; Industrial engineering; Mathematics","authors":[{"name":"Farhad Kolahan","is_ca":true},{"name":"Ming Liang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01325466737531286,"gpt":0.2526689565358197,"spread":0.2394142891605069,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001447901,0.001455101,0.002626447,0.002093722,0.0008995206,0.001357847,0.002216508,0.002430405,0.008702725],"category_scores_gemma":[0.003874677,0.001259704,0.001588637,0.00308173,0.001169614,0.001699557,0.000904823,0.001383992,0.0009832414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008998124,"about_ca_system_score_gemma":0.001604463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007379798,"about_ca_topic_score_gemma":0.006148681,"domain_scores_codex":[0.9994167,0.0002850178,0.000019049,0.00006195738,0.0001269264,0.00009042677],"domain_scores_gemma":[0.9986658,0.0009814079,0.00008113118,0.00006272956,0.0001683794,0.00004068855],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006712581,0.00005686586,0.000126009,0.00009179125,0.00003385972,0.00002327369,0.00002517945,0.9625634,0.0005127872,0.00377839,0.000956452,0.03176485],"study_design_scores_gemma":[0.00001674492,0.00004006729,0.00005407157,0.000009441962,0.00001203286,0.000007700398,0.00001212094,0.9963827,0.0001703128,0.003018401,0.0002716621,0.000004719592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03715583,0.001724339,0.9491694,0.0002365301,0.0001176032,0.0001724866,0.0001823736,0.0005496417,0.0106918],"genre_scores_gemma":[0.4400031,0.001523546,0.5497978,0.0002405853,0.0001307591,0.0004896565,0.0004359637,0.0005655532,0.006813139],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008702725,"threshold_uncertainty_score":0.02911353,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2898866180","doi":"10.1287/ijoc.2018.0806","title":"The Meet-in-the-Middle Principle for Cutting and Packing Problems","year":2018,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":73,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Bin packing problem; Dimension (graph theory); Packing problems; Set (abstract data type); Bin; Mathematical optimization; Limit (mathematics); Computation; Mathematics; Integer programming; Integer (computer science); Combinatorial optimization; Branch and cut; Computer science; Linear programming; Branch and bound; Algorithm; Combinatorics","authors":[{"name":"Jean‐François Côté","is_ca":true},{"name":"Manuel Iori","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03233966605804524,"gpt":0.2629264707529498,"spread":0.2305868046949046,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003151453,0.002216986,0.001994055,0.001540825,0.001764607,0.003906642,0.003133257,0.002903249,0.01011769],"category_scores_gemma":[0.009247986,0.00141671,0.002812422,0.004485128,0.003018158,0.006876649,0.003505742,0.007074368,0.004176705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001336492,"about_ca_system_score_gemma":0.00236403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001350886,"about_ca_topic_score_gemma":0.001219215,"domain_scores_codex":[0.9957343,0.001254616,0.0002836642,0.0007977394,0.001639824,0.0002898739],"domain_scores_gemma":[0.9978871,0.001175241,0.0002177987,0.0004094482,0.0002040257,0.0001064009],"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.0002077365,0.0001547803,0.0005440778,0.0005546818,0.00007001915,0.0002369439,0.0002708427,0.08183903,0.003663707,0.7047108,0.0157844,0.191963],"study_design_scores_gemma":[0.00006898839,0.0002193185,0.0002435017,0.0001423415,0.00003689859,0.0005859666,0.0001050359,0.2488692,0.002571947,0.6973548,0.04974895,0.00005310221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002153855,0.0005509977,0.9867575,0.0003791776,0.0001050253,0.0001202909,0.0001389533,0.0001614366,0.009632789],"genre_scores_gemma":[0.0481864,0.001408239,0.9440781,0.0004050232,0.0002701484,0.0005787725,0.0004583089,0.0002682294,0.004346817],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01011769,"threshold_uncertainty_score":0.03384703,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051064851","doi":"10.1007/s00453-007-9146-y","title":"Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":68,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Victoria; University of Waterloo","funders":"","keywords":"Algorithm; Theory of computation; Packing problems; Time complexity; Matching (statistics); Mathematics; Exponent; Dynamic programming; Set (abstract data type); Approximation algorithm; Combinatorics; Computer science; Mathematical optimization","authors":[{"name":"Michael R. Fellows","is_ca":false},{"name":"Christian Knauer","is_ca":false},{"name":"Nobuya Nishimura","is_ca":true},{"name":"Prabhakar Ragde","is_ca":true},{"name":"Frances Rosamond","is_ca":false},{"name":"Ulrike Stege","is_ca":true},{"name":"Dimitrios M. Thilikos","is_ca":false},{"name":"Sue Whitesides","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01963313073124341,"gpt":0.2472852207945475,"spread":0.2276520900633041,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00431656,0.003994491,0.003823163,0.003024165,0.001907723,0.006894243,0.006671759,0.004437863,0.03506356],"category_scores_gemma":[0.02836553,0.001862036,0.003864467,0.007222811,0.001979463,0.01524318,0.004304026,0.008355937,0.007668796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00483195,"about_ca_system_score_gemma":0.004770651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00689249,"about_ca_topic_score_gemma":0.01007202,"domain_scores_codex":[0.9948795,0.001520869,0.0002490019,0.001220965,0.001381027,0.0007485742],"domain_scores_gemma":[0.9854516,0.008762059,0.0007048466,0.003967794,0.000733223,0.0003803408],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001818924,0.001306659,0.00137331,0.001136662,0.000298394,0.0001850281,0.0004690682,0.2661395,0.004417473,0.181057,0.06779418,0.4740038],"study_design_scores_gemma":[0.0005814257,0.000121071,0.0004205346,0.00009680232,0.0001340883,0.0001522207,0.0001337824,0.6659329,0.002152475,0.3168581,0.01337016,0.00004651221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02181289,0.00262125,0.9434234,0.002037177,0.0004944394,0.0003925566,0.0008931168,0.004909647,0.02341549],"genre_scores_gemma":[0.152934,0.001255056,0.826587,0.000791283,0.0005312507,0.0009856658,0.002961542,0.002248863,0.01170542],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03506356,"threshold_uncertainty_score":0.1172993,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2955422897","doi":"10.1287/ijoo.2019.0013","title":"Three-Dimensional Bin Packing and Mixed-Case Palletization","year":2019,"lang":"en","type":"article","venue":"INFORMS Journal on Optimization","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":64,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Bin packing problem; Column generation; Benchmark (surveying); Computer science; Set (abstract data type); Range (aeronautics); Mathematical optimization; Column (typography); Bin; Key (lock); Algorithm; Mathematics; Engineering","authors":[{"name":"Samir Elhedhli","is_ca":true},{"name":"Fatma Gzara","is_ca":true},{"name":"Burak Yıldız","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00938567653688308,"gpt":0.2044652383476763,"spread":0.1950795618107933,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001655173,0.001515566,0.001565772,0.001420822,0.0007131243,0.002529899,0.002314656,0.001623745,0.007026781],"category_scores_gemma":[0.00478181,0.00105842,0.001684201,0.003525934,0.0009171396,0.002419787,0.001545562,0.00179696,0.001028339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00127457,"about_ca_system_score_gemma":0.001295543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005523612,"about_ca_topic_score_gemma":0.004610016,"domain_scores_codex":[0.9982966,0.0006941472,0.0001067748,0.0002882353,0.0003814669,0.0002329144],"domain_scores_gemma":[0.9980751,0.001120853,0.0002249016,0.0002497638,0.0001979184,0.0001315525],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001335291,0.0001995681,0.0007765105,0.0002681822,0.00008041438,0.0001366359,0.00004189937,0.9207097,0.000712206,0.02358724,0.004915009,0.04843916],"study_design_scores_gemma":[0.00001464496,0.00003490713,0.0001721194,0.00001624299,0.000009637334,0.00006258196,0.00001640902,0.9867165,0.0005302659,0.0105858,0.001829861,0.00001108829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03981902,0.001806473,0.9431332,0.0005180183,0.0001680475,0.0002061967,0.0007687735,0.0007247097,0.01285549],"genre_scores_gemma":[0.4010843,0.00162064,0.5879822,0.0002530978,0.0001303083,0.0003339944,0.001629992,0.0003361366,0.006629409],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007026781,"threshold_uncertainty_score":0.02350694,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4233354264","doi":"10.1007/0-387-28356-0_6","title":"Tabu Search","year":2006,"lang":"la","type":"book-chapter","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Tabu search; GRASP; Computer science; Guided Local Search; Heuristic; Focus (optics); Management science; Algorithm; Artificial intelligence; Engineering; Software engineering","authors":[{"name":"Michel Gendreau","is_ca":true},{"name":"Jean‐Yves Potvin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02204604703353505,"gpt":0.2145211637525276,"spread":0.1924751167189925,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002936381,0.001367333,0.001047211,0.001380192,0.0008707959,0.002142908,0.001653623,0.001150653,0.08362775],"category_scores_gemma":[0.001098265,0.0006185112,0.0007593962,0.003618058,0.0007198025,0.001858401,0.001019503,0.002293371,0.05107573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009587251,"about_ca_system_score_gemma":0.001147575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001711746,"about_ca_topic_score_gemma":0.00374081,"domain_scores_codex":[0.99965,0.00006257176,0.00001259373,0.00006944449,0.0001797697,0.00002555349],"domain_scores_gemma":[0.9997513,0.00008607788,0.000009927237,0.00006366232,0.00007358946,0.00001554063],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003850601,0.00007993665,0.00007643336,0.0003181636,0.00002301493,0.00003622873,0.00006918573,0.01197569,0.001245638,0.08953284,0.2825398,0.6140646],"study_design_scores_gemma":[0.0000219868,0.00005727174,0.0002122385,0.0002813752,0.00002335604,0.0002839486,0.00004772363,0.03138904,0.001987378,0.1215392,0.8441275,0.0000290357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.001567417,0.01450008,0.2984967,0.001205271,0.001130325,0.000147331,0.000961273,0.003863439,0.6781282],"genre_scores_gemma":[0.0234799,0.0124946,0.2960269,0.001141113,0.0006381128,0.0003514957,0.003266136,0.002252009,0.6603498],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.08362775,"threshold_uncertainty_score":0.2797627,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018407890","doi":"10.1016/j.eswa.2013.03.037","title":"An iterated local search heuristic for multi-capacity bin packing and machine reassignment problems","year":2013,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Bin packing problem; Mathematical optimization; Benchmark (surveying); Iterated local search; Metaheuristic; Computer science; Packing problems; Scheduling (production processes); Heuristic; Generalization; Iterated function; Upper and lower bounds; Job shop scheduling; Bin; Algorithm; Mathematics","authors":[{"name":"Renaud Masson","is_ca":true},{"name":"Thibaut Vidal","is_ca":true},{"name":"Julien Michallet","is_ca":false},{"name":"Puca Huachi Vaz Penna","is_ca":false},{"name":"Vinícius Petrucci","is_ca":false},{"name":"Anand Subramanian","is_ca":false},{"name":"Hugues Dubedout","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04250410525338499,"gpt":0.2585666167977702,"spread":0.2160625115443852,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001762954,0.0009493311,0.002160317,0.001315886,0.0007437507,0.001038666,0.002960289,0.002038881,0.004360852],"category_scores_gemma":[0.003857631,0.0009281916,0.001235178,0.001158565,0.0009554497,0.001424329,0.001387525,0.001267853,0.0006221409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00128662,"about_ca_system_score_gemma":0.00171868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006750838,"about_ca_topic_score_gemma":0.006705343,"domain_scores_codex":[0.9991986,0.0002933149,0.0000353388,0.00009765222,0.0002467231,0.0001283787],"domain_scores_gemma":[0.9981521,0.001164996,0.0001505564,0.0001078726,0.0003068859,0.0001176581],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001758391,0.0001763168,0.0002900817,0.0001102479,0.00005225198,0.000119185,0.0001134056,0.9292717,0.001548582,0.005357047,0.001631388,0.061154],"study_design_scores_gemma":[0.00002861648,0.00005005627,0.00004330377,0.000007801436,0.0000136989,0.0000136413,0.00001249201,0.9983945,0.0002475597,0.0008752978,0.0003063565,0.000006560264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04868378,0.0006344042,0.9413729,0.0002306477,0.0001375845,0.0002122853,0.00005338733,0.001003242,0.00767174],"genre_scores_gemma":[0.4717933,0.0003004557,0.5204991,0.0002078399,0.00009342624,0.0005206884,0.0001694917,0.000312912,0.006102719],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006750838,"threshold_uncertainty_score":0.01458853,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991548888","doi":"10.1287/opre.2014.1307","title":"An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Polytechnique Montréal; Université Laval","funders":"","keywords":"Bin packing problem; Packing problems; Mathematical optimization; Algorithm; Set packing; Benchmark (surveying); Branch and cut; Benders' decomposition; Preprocessor; Integer programming; Cutting stock problem; Relaxation (psychology); Heuristics; Computer science; Mathematics; Exact solutions in general relativity; Integer (computer science); Optimization problem; Bin","authors":[{"name":"Jean‐François Côté","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Jean‐Yves Potvin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0416455721630172,"gpt":0.3361884072885659,"spread":0.2945428351255487,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008693463,0.001613757,0.001633836,0.001329756,0.001098567,0.001943482,0.002289491,0.001931552,0.0158427],"category_scores_gemma":[0.003620997,0.0008431576,0.00121361,0.00249774,0.0007177971,0.002710652,0.002125035,0.002176091,0.004105035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001416724,"about_ca_system_score_gemma":0.003009665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005255193,"about_ca_topic_score_gemma":0.006629647,"domain_scores_codex":[0.998867,0.0001701984,0.00006336808,0.0002444988,0.0004557456,0.0001993034],"domain_scores_gemma":[0.9988629,0.0005417616,0.00009895641,0.0002426298,0.0002028762,0.00005093465],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001503337,0.0002928327,0.0004421981,0.0004313394,0.00005649185,0.0001693711,0.0001649161,0.4006996,0.003730239,0.04997978,0.01512726,0.5287556],"study_design_scores_gemma":[0.00009701132,0.00007266803,0.0001605619,0.00003852453,0.00001873459,0.0001718135,0.00005928583,0.952698,0.001265532,0.03561534,0.009780212,0.00002220369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002782305,0.0002394762,0.9900568,0.0001128804,0.00006766967,0.0001133254,0.0001249526,0.000980805,0.005521726],"genre_scores_gemma":[0.03285536,0.0002808085,0.9631874,0.00007668893,0.00004275128,0.0002470804,0.0004376898,0.000238851,0.00263329],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0158427,"threshold_uncertainty_score":0.05299914,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041693766","doi":"10.1057/jors.2011.134","title":"Automatic aircraft cargo load planning","year":2011,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science; Fuel efficiency; Purchasing; Pallet; Software; Operations research; Task (project management); Set (abstract data type); Project management; Integer programming; Linear programming; Moment (physics); Mathematical optimization; Industrial engineering; Simulation; Automotive engineering; Systems engineering; Engineering; Operations management; Operating system; Algorithm","authors":[{"name":"Sabine Limbourg","is_ca":false},{"name":"Michaël Schyns","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1069961567409366,"gpt":0.3363804880498422,"spread":0.2293843313089057,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003410277,0.0006694704,0.0006425495,0.0003206038,0.0004069758,0.0008044408,0.0008821763,0.0005833149,0.003841489],"category_scores_gemma":[0.0005959782,0.0004950369,0.0004855597,0.0003723133,0.0004690344,0.0006869318,0.0007727189,0.0006308835,0.0006410363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005659835,"about_ca_system_score_gemma":0.000993387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003915774,"about_ca_topic_score_gemma":0.004382443,"domain_scores_codex":[0.9996731,0.00007561444,0.00001141599,0.00006995167,0.0001131767,0.00005665107],"domain_scores_gemma":[0.9997212,0.0001497588,0.00003484709,0.00003989432,0.00003536366,0.00001885714],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001123443,0.00005514538,0.0003195037,0.00008170301,0.00001221257,0.00006338943,0.00006164656,0.9209961,0.008303414,0.004536434,0.001603617,0.06385464],"study_design_scores_gemma":[0.000009106305,0.00002044125,0.00007914935,0.000002940679,0.000002992366,0.00001405169,0.00001078172,0.9957187,0.001996802,0.001148704,0.0009927356,0.000003654842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03447305,0.00007362868,0.9595613,0.00007338038,0.00001795128,0.000060762,0.0001065087,0.001374959,0.004258438],"genre_scores_gemma":[0.5440373,0.0001396431,0.4486606,0.00005087934,0.00002744472,0.0001873656,0.0004128886,0.000402692,0.006081103],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003915774,"threshold_uncertainty_score":0.01285106,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024624524","doi":"10.1016/s0304-3975(03)00363-3","title":"An asymptotic fully polynomial time approximation scheme for bin covering","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Bin packing problem; Bin; Mathematics; Polynomial-time approximation scheme; Scheme (mathematics); Time complexity; Approximation algorithm; Polynomial; Combinatorics; Dual (grammatical number); Mathematical optimization; Discrete mathematics; Algorithm; Mathematical analysis","authors":[{"name":"Klaus Jansen","is_ca":false},{"name":"Roberto Solis-Oba","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006235549382664906,"gpt":0.2174321802765514,"spread":0.2111966308938865,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002060024,0.001408441,0.00211787,0.001371705,0.001389075,0.003444418,0.004097988,0.00183038,0.01083903],"category_scores_gemma":[0.0105408,0.0008319225,0.001289395,0.004130448,0.001304743,0.006923563,0.005362665,0.003107945,0.00275473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004384103,"about_ca_system_score_gemma":0.003884002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005718039,"about_ca_topic_score_gemma":0.008164953,"domain_scores_codex":[0.9964709,0.0006635631,0.0001783437,0.000611849,0.001314137,0.0007612383],"domain_scores_gemma":[0.9941959,0.002035724,0.0002612696,0.002743211,0.0004796072,0.0002842423],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002993218,0.0006760439,0.001498995,0.0005279077,0.0001351725,0.0001325401,0.0004983675,0.2685516,0.01819327,0.1353496,0.03530511,0.5361381],"study_design_scores_gemma":[0.0001395769,0.0001034161,0.0003145827,0.00002721753,0.00005665463,0.0001152541,0.00005545454,0.908615,0.003115655,0.08278948,0.004644193,0.00002353613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04453238,0.0009267079,0.9336464,0.000800242,0.0001959043,0.0002479307,0.0008302216,0.00460509,0.01421514],"genre_scores_gemma":[0.3800423,0.0006543436,0.6052738,0.000511391,0.0002454563,0.0004656379,0.001825466,0.0007809321,0.01020062],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01083903,"threshold_uncertainty_score":0.03626025,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130428886","doi":"10.1007/s00453-014-9955-8","title":"Online Bin Packing with Advice","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Bin packing problem; Advice (programming); Bin; Computer science; Theory of computation; Combinatorics; Mathematics; Algorithm; Programming language","authors":[{"name":"Joan Boyar","is_ca":false},{"name":"Shahin Kamali","is_ca":true},{"name":"Kim S. Larsen","is_ca":false},{"name":"Alejandro López-Ortíz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005320935873254548,"gpt":0.1880935076917519,"spread":0.1827725718184973,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009562926,0.001198641,0.001302654,0.0009378855,0.0009963134,0.001854823,0.001907837,0.001744007,0.0326816],"category_scores_gemma":[0.01061781,0.0007354887,0.0009548086,0.001921779,0.0007002114,0.003435147,0.002600266,0.00308063,0.01002038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009921975,"about_ca_system_score_gemma":0.001742303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00244242,"about_ca_topic_score_gemma":0.006074061,"domain_scores_codex":[0.9983953,0.0003144459,0.0000818844,0.0002954442,0.000659689,0.0002532557],"domain_scores_gemma":[0.9962923,0.001494778,0.0001232112,0.00150051,0.0004298497,0.0001593772],"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.001397725,0.0006771549,0.002109509,0.0005044198,0.00007917389,0.0002783574,0.0002141958,0.08560727,0.007437323,0.07208458,0.1083243,0.7212861],"study_design_scores_gemma":[0.0001710023,0.00009223739,0.0004993852,0.00006902381,0.00005160271,0.000215496,0.0000548288,0.7184554,0.006802801,0.2448768,0.02868629,0.0000250986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05011604,0.001136883,0.8604538,0.002716277,0.0008280771,0.0002321874,0.001710075,0.0176458,0.06516082],"genre_scores_gemma":[0.3140603,0.0005543166,0.6368095,0.0007307028,0.0004289092,0.0002405814,0.002626199,0.002286387,0.04226298],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0326816,"threshold_uncertainty_score":0.1093309,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4292448915","doi":"10.3389/fmech.2022.966691","title":"Two-dimensional irregular packing problems: A review","year":2022,"lang":"en","type":"review","venue":"Frontiers in Mechanical Engineering","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Yanshan University; National Natural Science Foundation of China","keywords":"Packing problems; Automotive industry; Aerospace; Shipbuilding; Computer science; Variety (cybernetics); Domain (mathematical analysis); Clothing; Field (mathematics); Manufacturing engineering; Engineering; Industrial engineering; Mathematics; Algorithm; Aerospace engineering; Artificial intelligence; Geography","authors":[{"name":"Baosu Guo","is_ca":false},{"name":"Yu Zhang","is_ca":false},{"name":"Jingwen Hu","is_ca":false},{"name":"Jinrui Li","is_ca":false},{"name":"Fenghe Wu","is_ca":false},{"name":"Qingjin Peng","is_ca":true},{"name":"Quan Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02429428230944709,"gpt":0.2508837935304755,"spread":0.2265895112210284,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005438687,0.001429899,0.001697119,0.002628212,0.0005332987,0.001476384,0.001278281,0.00122687,0.004770678],"category_scores_gemma":[0.001310749,0.0007716888,0.001011893,0.004854556,0.0006039991,0.002771718,0.0009390371,0.0013139,0.002658739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000564108,"about_ca_system_score_gemma":0.001365951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001507284,"about_ca_topic_score_gemma":0.001441868,"domain_scores_codex":[0.9996938,0.00003716847,0.00004126112,0.0000729825,0.0001235283,0.00003133794],"domain_scores_gemma":[0.9992628,0.0004088319,0.0000788058,0.00002527698,0.0001836954,0.00004063243],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005302091,0.000154594,0.0004976621,0.0227649,0.0001110921,0.0002005941,0.00008954642,0.004700341,0.001264454,0.01654388,0.04375743,0.9098626],"study_design_scores_gemma":[0.00001361288,0.0001666583,0.0009098818,0.005432199,0.0001627269,0.001543796,0.0001377938,0.002496177,0.0010682,0.01215097,0.9758509,0.00006694061],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0003780952,0.9941667,0.001952083,0.0002462048,0.0002518694,0.000009123381,0.00004285181,0.00002256078,0.002930491],"genre_scores_gemma":[0.001970804,0.9952418,0.001545127,0.0001281929,0.0002676291,0.00001215688,0.0001105889,0.000008531937,0.0007153862],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.004770678,"threshold_uncertainty_score":0.01595944,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124475618","doi":"10.1287/ijoc.1100.0406","title":"A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts","year":2010,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Bin packing problem; Mathematical optimization; Set packing; Bin; Branch and bound; Mathematics; Heuristics; Branch and cut; Algorithm; Branching (polymer chemistry); Set (abstract data type); Scheduling (production processes); Computer science; Integer programming","authors":[{"name":"Samir Elhedhli","is_ca":true},{"name":"Lingzi Li","is_ca":true},{"name":"Mariem Gzara","is_ca":false},{"name":"Joe Naoum‐Sawaya","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0101253620362066,"gpt":0.2244824884865048,"spread":0.2143571264502983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001151818,0.001206709,0.001539969,0.001177743,0.001155551,0.001575825,0.002229724,0.001847577,0.01146652],"category_scores_gemma":[0.004271437,0.0008438058,0.001030511,0.002626706,0.0007754767,0.00241947,0.00266595,0.003029564,0.002000377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001088032,"about_ca_system_score_gemma":0.002409001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003019581,"about_ca_topic_score_gemma":0.003522233,"domain_scores_codex":[0.9989367,0.0002434147,0.00006986788,0.000149158,0.0004481774,0.000152619],"domain_scores_gemma":[0.999019,0.0005505595,0.00007091121,0.00009746479,0.0001909695,0.00007110162],"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.000185434,0.0003251045,0.0005921123,0.0003141717,0.00008810638,0.0002499817,0.000211633,0.4041062,0.005237954,0.07208867,0.01399825,0.5026025],"study_design_scores_gemma":[0.000113443,0.00008609007,0.0001244925,0.00002253706,0.00002672277,0.0001519187,0.00003673074,0.9526123,0.001531577,0.03819547,0.007075271,0.0000234725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003181403,0.0001892938,0.9934086,0.0001825501,0.00005079924,0.0001487133,0.00005161969,0.0003475868,0.002439471],"genre_scores_gemma":[0.03090531,0.000223481,0.9662881,0.00007336927,0.00004317515,0.0003022304,0.0001923057,0.0001539366,0.00181812],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01146652,"threshold_uncertainty_score":0.0383594,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015024493","doi":"10.1007/s10107-003-0469-4","title":"The integration of an interior-point cutting plane method within a branch-and-price algorithm","year":2004,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Cutting-plane method; Column generation; Branch and bound; Bin packing problem; Algorithm; Interior point method; Mathematics; Bin; Mathematical optimization; Branching (polymer chemistry); Point (geometry); Dual (grammatical number); Plane (geometry); Tree (set theory); Computer science; Integer programming; Geometry; Combinatorics","authors":[{"name":"Samir Elhedhli","is_ca":true},{"name":"Jean‐Louis Goffin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01704059943685375,"gpt":0.275635538636096,"spread":0.2585949391992423,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001882198,0.001057659,0.002485543,0.001312739,0.0006643473,0.001304224,0.002091643,0.001866475,0.005321627],"category_scores_gemma":[0.003741961,0.0008432893,0.001073321,0.001764115,0.000902435,0.00170449,0.001251983,0.002508574,0.00199097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005667587,"about_ca_system_score_gemma":0.001458131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002871365,"about_ca_topic_score_gemma":0.002586182,"domain_scores_codex":[0.9990916,0.0002531562,0.00003799885,0.00008528015,0.0004781997,0.00005373107],"domain_scores_gemma":[0.9988418,0.0006753478,0.00006193756,0.00009543738,0.0002740207,0.00005151653],"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.0001580733,0.0003241677,0.0004741013,0.0002512508,0.00007777944,0.0001120412,0.0001300971,0.5493877,0.008833712,0.08633695,0.003505153,0.3504089],"study_design_scores_gemma":[0.00001414037,0.0000319025,0.00004961459,0.00001146028,0.00001277459,0.00002798919,0.000004365486,0.9912144,0.0007059639,0.006167457,0.00175282,0.00000714195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001040775,0.00006606267,0.9974359,0.00002821847,0.00003730288,0.00001851543,0.000004953056,0.0001069022,0.001261404],"genre_scores_gemma":[0.03663776,0.0001985536,0.960685,0.00003834581,0.00006108289,0.0001416003,0.000033205,0.0001681983,0.002036248],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005321627,"threshold_uncertainty_score":0.0178026,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043985142","doi":"10.1007/s00453-009-9349-5","title":"Approximability of Packing Disjoint Cycles","year":2009,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Disjoint sets; Theory of computation; Combinatorics; Packing problems; Set packing; Computer science; Mathematics; Algorithm; Set (abstract data type)","authors":[{"name":"Zachary Friggstad","is_ca":true},{"name":"Mohammad R. Salavatipour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007440738904930359,"gpt":0.2074974811256264,"spread":0.2000567422206961,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001955848,0.001594255,0.002274807,0.001719132,0.001443524,0.005054094,0.00395829,0.002311531,0.01194237],"category_scores_gemma":[0.0218774,0.00135523,0.00253298,0.003483576,0.002646001,0.009107812,0.003638473,0.004384355,0.0008073232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00282625,"about_ca_system_score_gemma":0.001404751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004137458,"about_ca_topic_score_gemma":0.003899548,"domain_scores_codex":[0.9977909,0.0006456506,0.0001260078,0.0004996682,0.0005724955,0.0003653082],"domain_scores_gemma":[0.9883929,0.008762493,0.0005790044,0.001425863,0.0004016543,0.0004380549],"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.00103861,0.0004422201,0.003739222,0.0007373143,0.0002379084,0.0003038124,0.0009657362,0.3771325,0.002833911,0.4941235,0.01192105,0.1065242],"study_design_scores_gemma":[0.00009205819,0.00005835102,0.0004490659,0.00005820362,0.00008512707,0.0001647648,0.0001351699,0.3776829,0.00123889,0.6168318,0.003185448,0.00001810554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.398469,0.002870517,0.5535089,0.002598879,0.0002324161,0.0001889396,0.0009212689,0.001105862,0.04010415],"genre_scores_gemma":[0.8380339,0.001634519,0.1434086,0.0003936584,0.0002916126,0.0002672269,0.001946054,0.0005875509,0.01343702],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01194237,"threshold_uncertainty_score":0.03995115,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2296334577","doi":"10.1145/2766912","title":"Foldabilizing furniture","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Folding (DSP implementation); Computer science; Object (grammar); Design for manufacturability; Mathematical optimization; Granularity; Set (abstract data type); Packing problems; Process (computing); Topology (electrical circuits); Graph; Algorithm; Mathematics; Theoretical computer science; Combinatorics; Artificial intelligence; Programming language; Engineering","authors":[{"name":"Honghua Li","is_ca":true},{"name":"Ruizhen Hu","is_ca":true},{"name":"Ibraheem Alhashim","is_ca":true},{"name":"Hao Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04175396911881586,"gpt":0.2407796478571418,"spread":0.199025678738326,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005225408,0.001148731,0.0008670148,0.0007496282,0.0006066242,0.001219534,0.001291963,0.0009560228,0.005283619],"category_scores_gemma":[0.002066077,0.0007075223,0.001235869,0.000595011,0.0009152915,0.001958277,0.001648856,0.0008854251,0.0007882892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008142227,"about_ca_system_score_gemma":0.0005467357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00160326,"about_ca_topic_score_gemma":0.001660617,"domain_scores_codex":[0.9993687,0.00009415833,0.0000361425,0.0001695214,0.0002176168,0.0001138029],"domain_scores_gemma":[0.9993358,0.0002316569,0.00009220053,0.0002089993,0.00008914659,0.00004215262],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001730082,0.0001055685,0.001971189,0.0002234788,0.00005476546,0.0002551108,0.0002646473,0.7704653,0.0628507,0.03052934,0.001527025,0.13158],"study_design_scores_gemma":[0.00001788434,0.0002363234,0.0009417628,0.00002501123,0.00003323948,0.0002333328,0.0001334483,0.9142904,0.03760872,0.04047133,0.005977278,0.00003130471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1167467,0.0001686828,0.8764783,0.0001374506,0.00002692506,0.00008637195,0.0001282871,0.0007916519,0.005435672],"genre_scores_gemma":[0.6024906,0.0002256559,0.3916894,0.00008549204,0.00002033963,0.0001217661,0.0005479137,0.0005719048,0.004246961],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005283619,"threshold_uncertainty_score":0.01767546,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3122681984","doi":"10.1287/ijoc.2020.1014","title":"Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem","year":2021,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Compute Canada; Università Degli Studi di Modena e Reggio Emila","keywords":"Bin packing problem; Set packing; Set (abstract data type); Packing problems; Generalization; Bin; Heuristics; Heuristic; Mathematics; Mathematical optimization; Benchmark (surveying); Bounding overwatch; Decomposition; Benders' decomposition; Algorithm; Container (type theory); Computer science; Preprocessor; Branch and cut; Combinatorial optimization; Integer programming; Artificial intelligence","authors":[{"name":"Jean‐François Côté","is_ca":true},{"name":"Mohamed Haouari","is_ca":false},{"name":"Manuel Iori","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01548544245106256,"gpt":0.2649396540186887,"spread":0.2494542115676262,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00114529,0.0024159,0.001217378,0.001590625,0.0006584458,0.002098203,0.001768391,0.001655907,0.01379391],"category_scores_gemma":[0.00383666,0.0008116574,0.002167156,0.002848766,0.000899863,0.002781464,0.001858036,0.004938826,0.003687087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001503181,"about_ca_system_score_gemma":0.001712678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002155154,"about_ca_topic_score_gemma":0.002178231,"domain_scores_codex":[0.9986748,0.0003722144,0.00007368316,0.0002865894,0.0004457364,0.0001470305],"domain_scores_gemma":[0.9988204,0.000546088,0.0001421246,0.0001950391,0.0002078647,0.00008843437],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002767177,0.0005380775,0.001023701,0.001028209,0.000163371,0.0003081185,0.0002273179,0.4917166,0.006749075,0.2150641,0.04199051,0.2409142],"study_design_scores_gemma":[0.00008044831,0.0001399443,0.0004609853,0.0001848241,0.00006807806,0.0003330279,0.00008588196,0.7848467,0.002527832,0.1789742,0.03224327,0.0000549029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007107111,0.00113219,0.9723173,0.0006615956,0.0002733252,0.0002795456,0.0006573066,0.0007023808,0.01686926],"genre_scores_gemma":[0.1245942,0.002601152,0.8541479,0.0008155836,0.0004832694,0.0008159414,0.003814288,0.0005312177,0.01219641],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01379391,"threshold_uncertainty_score":0.04614526,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098775996","doi":"10.1016/j.disopt.2009.04.001","title":"Rectangle packing with one-dimensional resource augmentation","year":2009,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutscher Akademischer Austauschdienst","keywords":"Rectangle; Bin packing problem; Mathematics; Combinatorics; Packing problems; Approximation algorithm; Set packing; Constant (computer programming); Mathematical optimization; Square (algebra); Bin; Algorithm; Set (abstract data type); Geometry; Computer science","authors":[{"name":"Klaus Jansen","is_ca":false},{"name":"Roberto Solis-Oba","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008249441214177488,"gpt":0.2028664908287158,"spread":0.1946170496145383,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001485467,0.001299257,0.00259047,0.0007491362,0.0005789389,0.002255163,0.0021167,0.001412242,0.005778567],"category_scores_gemma":[0.005131416,0.001025388,0.001161942,0.002487197,0.001206297,0.003629209,0.002229088,0.001838496,0.0009164338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009716862,"about_ca_system_score_gemma":0.0008040097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001462974,"about_ca_topic_score_gemma":0.001192297,"domain_scores_codex":[0.9983986,0.0007476714,0.00008286222,0.0002534146,0.000291144,0.0002263387],"domain_scores_gemma":[0.9979808,0.001181472,0.0001753325,0.0003955232,0.0001350814,0.000131844],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00036492,0.0001843034,0.0002366624,0.0002683006,0.00004653396,0.0001979621,0.00006172125,0.8240241,0.003456286,0.1204975,0.004612025,0.04604962],"study_design_scores_gemma":[0.00002771033,0.00007801658,0.00009097018,0.00001332394,0.00001421562,0.00009234813,0.00002036229,0.9557646,0.001160503,0.04087332,0.001846654,0.00001787324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03525041,0.0008838175,0.9472937,0.0003830762,0.0001865848,0.0001000816,0.0002021427,0.0004365807,0.01526362],"genre_scores_gemma":[0.5066832,0.00135414,0.4730608,0.0002322313,0.0002201256,0.0003375596,0.0003883517,0.0002552638,0.01746816],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005778567,"threshold_uncertainty_score":0.01933128,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158742617","doi":"10.1016/j.amc.2012.03.052","title":"The three-dimensional knapsack problem with balancing constraints","year":2012,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Knapsack problem; Continuous knapsack problem; Heuristics; Packing problems; Mathematical optimization; Mathematics; Cutting stock problem; Heuristic; Change-making problem; Upper and lower bounds; Polynomial-time approximation scheme; Combinatorial optimization; Extension (predicate logic); Computer science; Optimization problem; Algorithm","authors":[{"name":"Mauro Maria Baldi","is_ca":false},{"name":"Guido Perboli","is_ca":true},{"name":"Roberto Tadei","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01022187480809189,"gpt":0.2026838768217767,"spread":0.1924620020136848,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008272728,0.0009552404,0.001152124,0.0008779144,0.001045312,0.00322752,0.001559072,0.00258801,0.006640062],"category_scores_gemma":[0.003277084,0.0006112916,0.0008584175,0.00242311,0.001184667,0.002629218,0.002078999,0.001768419,0.001056392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006372168,"about_ca_system_score_gemma":0.0009031795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003551125,"about_ca_topic_score_gemma":0.00215073,"domain_scores_codex":[0.9992455,0.0002071966,0.00004552195,0.0001494385,0.0002392919,0.0001130153],"domain_scores_gemma":[0.9989478,0.0005281646,0.0001578709,0.0001264772,0.0001209165,0.0001188091],"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.0002889851,0.0001304536,0.0006777456,0.0004117189,0.00007153728,0.0004166818,0.0001017416,0.77647,0.004065156,0.1343427,0.008317383,0.07470582],"study_design_scores_gemma":[0.00004115955,0.00005195663,0.0005433034,0.00005602303,0.00002064812,0.0002102217,0.0001159184,0.8380911,0.002107582,0.1503219,0.008388174,0.00005201135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04350498,0.001444997,0.9237782,0.001135448,0.000500724,0.00008222052,0.0006978048,0.0002161282,0.02863949],"genre_scores_gemma":[0.6343414,0.002621914,0.3386334,0.0005916645,0.0004121448,0.0003267085,0.001190029,0.0002872345,0.02159547],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006640062,"threshold_uncertainty_score":0.02221328,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3082452785","doi":"10.1145/3414685.3417796","title":"TAP-Net","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; University of Guelph","funders":"National Natural Science Foundation of China","keywords":"Computer science; Reinforcement learning; Container (type theory); Graph; Packing problems; Encoder; ENCODE; Artificial neural network; Mathematical optimization; Algorithm; Artificial intelligence; Theoretical computer science; Mathematics; Engineering","authors":[{"name":"Ruizhen Hu","is_ca":false},{"name":"Juzhan Xu","is_ca":false},{"name":"Bin Chen","is_ca":false},{"name":"Minglun Gong","is_ca":true},{"name":"Hao Zhang","is_ca":true},{"name":"Hui Huang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02692642698113777,"gpt":0.216370443988352,"spread":0.1894440170072142,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004673345,0.001321273,0.000655417,0.0006589203,0.0005508308,0.001474279,0.003304221,0.001574091,0.04677902],"category_scores_gemma":[0.002374346,0.0005951486,0.0009083023,0.0005875584,0.000505197,0.002557234,0.001987788,0.002039544,0.01237465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001234334,"about_ca_system_score_gemma":0.001797902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006355721,"about_ca_topic_score_gemma":0.01203647,"domain_scores_codex":[0.9996588,0.00003905523,0.00002331245,0.0001234788,0.00008769079,0.00006759096],"domain_scores_gemma":[0.999552,0.0001565662,0.00003329471,0.00009146494,0.0001129624,0.00005380624],"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.0006810309,0.0004893588,0.002463764,0.001053812,0.0001449865,0.0005385382,0.0001168491,0.327501,0.006888235,0.05306285,0.2202539,0.3868057],"study_design_scores_gemma":[0.00007489465,0.0001432906,0.0002893835,0.00007670437,0.0000302026,0.0001319877,0.0000322136,0.8927606,0.00527909,0.03682008,0.06432977,0.00003188939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03217619,0.002230356,0.7078153,0.003285161,0.001718102,0.0008444881,0.01674686,0.09684473,0.1383388],"genre_scores_gemma":[0.3440008,0.002265496,0.4925617,0.003572117,0.0003164779,0.001655138,0.04433854,0.006005215,0.1052846],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04677902,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115819683","doi":"10.1590/s0101-74382012005000005","title":"Accelerating benders decomposition with heuristicmaster problem solutions","year":2012,"lang":"en","type":"article","venue":"Pesquisa Operacional","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Montfort Hospital; HEC Montréal","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Benders' decomposition; Generality; Mathematical optimization; Decomposition; Computer science; Scheme (mathematics); Heuristic; Decomposition method (queueing theory); Algorithm; Mathematics; Discrete mathematics","authors":[{"name":"Alysson M. Costa","is_ca":false},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Bernard Gendron","is_ca":true},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02978486250149506,"gpt":0.2427013799541104,"spread":0.2129165174526153,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001204651,0.001022216,0.0008026761,0.001111127,0.000465615,0.0007970713,0.001075995,0.0009658695,0.007437614],"category_scores_gemma":[0.003096264,0.0006454834,0.0007812604,0.0009441364,0.0005685106,0.001006656,0.001084587,0.001487691,0.001344681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005789472,"about_ca_system_score_gemma":0.001010353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002083151,"about_ca_topic_score_gemma":0.003083477,"domain_scores_codex":[0.9993364,0.0002108078,0.00002661898,0.00009199225,0.0002297609,0.0001043419],"domain_scores_gemma":[0.9991685,0.0004834453,0.00008275019,0.0001375793,0.00009668131,0.00003099293],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001678143,0.0001596456,0.0004901015,0.0001952353,0.00005351293,0.00006587628,0.0001197068,0.7546002,0.00900526,0.02562655,0.002374806,0.2071413],"study_design_scores_gemma":[0.00004704732,0.00007821275,0.0001222225,0.00001886242,0.00001280874,0.000033233,0.00003425237,0.9797167,0.002932013,0.01383566,0.003161567,0.000007385832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01140906,0.00009013781,0.9846975,0.00005459069,0.00002716736,0.00008650877,0.00002506323,0.000608177,0.003001763],"genre_scores_gemma":[0.1157304,0.0001490414,0.8815159,0.0000635505,0.00002562218,0.0001820535,0.0001777707,0.000206492,0.001949122],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007437614,"threshold_uncertainty_score":0.0248813,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116455242","doi":"10.1016/j.ic.2004.10.001","title":"Fast approximate PCPs for multidimensional bin-packing problems","year":2004,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Bin packing problem; Bin; Algorithm; Mathematical optimization; Theoretical computer science; Mathematics","authors":[{"name":"Tuğkan Batu","is_ca":true},{"name":"Ronitt Rubinfeld","is_ca":false},{"name":"Patrick White","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01218179140506341,"gpt":0.2194373216403773,"spread":0.2072555302353139,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001849559,0.001437183,0.00266066,0.001702193,0.001138248,0.002918016,0.002243194,0.001957897,0.01256125],"category_scores_gemma":[0.01230425,0.001128256,0.001384656,0.005160495,0.000879887,0.004272989,0.002967168,0.00277821,0.002394724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001765913,"about_ca_system_score_gemma":0.003013743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007087376,"about_ca_topic_score_gemma":0.01185608,"domain_scores_codex":[0.9981,0.0004561538,0.0001040004,0.000178046,0.0009134253,0.0002483985],"domain_scores_gemma":[0.995644,0.0022208,0.0002424832,0.0009841131,0.0006918791,0.0002168306],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000851569,0.000282769,0.000827714,0.0006042233,0.00009514178,0.0001405552,0.0001641235,0.5649655,0.002758859,0.08124566,0.02802736,0.3200365],"study_design_scores_gemma":[0.00006153817,0.00003891905,0.000104532,0.00001844376,0.00001102598,0.00004250345,0.0000265228,0.9539722,0.0006055546,0.04268269,0.002427831,0.000008224039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02399063,0.001463641,0.9616386,0.0006930277,0.0002727394,0.0002263071,0.0006199686,0.001615745,0.009479407],"genre_scores_gemma":[0.243456,0.001180905,0.7453016,0.0003428553,0.0002999582,0.0006931729,0.001797578,0.0005624482,0.006365553],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01256125,"threshold_uncertainty_score":0.04202163,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155714059","doi":"10.1016/j.cor.2006.03.026","title":"Roll assortment optimization in a paper mill: An integer programming approach","year":2006,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Trim; Computer science; Mill; Mathematical optimization; Pooling; Integer programming; Operations research; Mathematics; Engineering; Algorithm","authors":[{"name":"Satyaveer S. Chauhan","is_ca":true},{"name":"Alain Martel","is_ca":true},{"name":"Sophie D’Amour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03790654818600927,"gpt":0.3058959068982103,"spread":0.2679893587122011,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002466962,0.002079658,0.004182598,0.001985592,0.001502323,0.005588255,0.002588926,0.004349906,0.009954373],"category_scores_gemma":[0.004190641,0.003230806,0.002630316,0.003753628,0.001640132,0.004115556,0.001544821,0.002741991,0.0007011246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002404187,"about_ca_system_score_gemma":0.00219477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008449122,"about_ca_topic_score_gemma":0.00676306,"domain_scores_codex":[0.9990381,0.0003896733,0.00004788547,0.0001808779,0.0001582331,0.0001852528],"domain_scores_gemma":[0.9982085,0.001320727,0.0001752198,0.00005870733,0.000130785,0.0001060761],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004721573,0.00005270889,0.0001392521,0.00005590071,0.00002062532,0.00007138521,0.00001786192,0.9882108,0.0003905613,0.006829164,0.0004650498,0.003699443],"study_design_scores_gemma":[0.000007552851,0.00002340408,0.0000478929,0.000006091094,0.00001264691,0.000008433885,0.00002032988,0.9967109,0.0001720235,0.002751549,0.0002324525,0.000006690593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04996324,0.0009644232,0.9289176,0.0008790893,0.0002138433,0.0002030866,0.0003769636,0.0002322173,0.0182495],"genre_scores_gemma":[0.6000309,0.001905448,0.36425,0.0003648274,0.0003138224,0.0006354052,0.0005162873,0.0004431537,0.03154028],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009954373,"threshold_uncertainty_score":0.03330064,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2009313397","doi":"10.1139/l03-101","title":"Using genetic algorithms in solving the one-dimensional cutting stock problem in the construction industry","year":2004,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Construction waste; Stock (firearms); Integer programming; Cutting stock problem; Genetic algorithm; Profit (economics); Engineering; Linear programming; Mathematical optimization; Optimization problem; Computer science; Operations research; Waste management; Mathematics; Economics; Mechanical engineering","authors":[{"name":"A. Shahin","is_ca":false},{"name":"Ossama Salem","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02005764888547754,"gpt":0.2078137493595844,"spread":0.1877561004741069,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000680095,0.0006258559,0.0004633494,0.0006608684,0.000367335,0.000790273,0.0005742827,0.001095,0.0007272928],"category_scores_gemma":[0.001596902,0.0003307513,0.0004447539,0.0009019155,0.0007753285,0.0004809959,0.0003170944,0.0004988891,0.00009788803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007659011,"about_ca_system_score_gemma":0.001289147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01447357,"about_ca_topic_score_gemma":0.01206492,"domain_scores_codex":[0.9996909,0.0001742074,0.00001288679,0.00003476155,0.00005711612,0.00003022591],"domain_scores_gemma":[0.9994662,0.0004287428,0.00004227415,0.00001365562,0.00003887928,0.00001026883],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001207136,0.00001886035,0.0004089018,0.00002420403,0.00001821098,0.00004079979,0.00002430502,0.9847921,0.000349048,0.002305933,0.0001140694,0.01189158],"study_design_scores_gemma":[0.00001834728,0.00004594042,0.0002032813,0.0000128488,0.00001610811,0.00003300385,0.00004186622,0.9943177,0.0005163861,0.004258595,0.0005292202,0.000006658374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2363122,0.001560224,0.7528563,0.0005641286,0.00004617605,0.0001348264,0.00006481619,0.0002725256,0.008188993],"genre_scores_gemma":[0.6932626,0.001454378,0.3025371,0.0001362109,0.00002044782,0.0001986009,0.0001356238,0.00003365666,0.002221475],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01447357,"threshold_uncertainty_score":0.02877861,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156398306","doi":"10.1002/net.21459","title":"A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks","year":2012,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal; Polytechnique Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Travelling salesman problem; Pickup; Stack (abstract data type); Computer science; Constraint (computer-aided design); Algorithm; 2-opt; Branch and cut; Mathematical optimization; Mathematics; Integer programming; Artificial intelligence","authors":[{"name":"Jean‐François Côté","is_ca":true},{"name":"Claudia Archetti","is_ca":false},{"name":"M. Grazia Speranza","is_ca":false},{"name":"Michel Gendreau","is_ca":true},{"name":"Jean‐Yves Potvin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01037015660828235,"gpt":0.1923077332894443,"spread":0.1819375766811619,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001128426,0.001274565,0.001665179,0.001271811,0.001131122,0.001385901,0.001608947,0.0020471,0.007487654],"category_scores_gemma":[0.002653646,0.0008374311,0.000853244,0.002031551,0.0005477559,0.001842706,0.001083736,0.001758203,0.0009489363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001410665,"about_ca_system_score_gemma":0.00197871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00690271,"about_ca_topic_score_gemma":0.005449513,"domain_scores_codex":[0.9994443,0.000185971,0.00002741539,0.0001146858,0.0001143317,0.0001132132],"domain_scores_gemma":[0.9988891,0.0007888373,0.00007630781,0.00004724775,0.0001132746,0.00008521913],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003363929,0.0004002101,0.0006706331,0.0002090098,0.00009425807,0.0001869274,0.0001228432,0.7546445,0.001453262,0.02004072,0.009705349,0.2121358],"study_design_scores_gemma":[0.00008119854,0.00007475126,0.0001029427,0.00001276611,0.0000162707,0.00003612453,0.00002671354,0.9882754,0.000409718,0.009584581,0.001372215,0.000007364784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0681204,0.001092456,0.9185435,0.0006683603,0.0001371296,0.0003979673,0.0004156766,0.0009194236,0.009705156],"genre_scores_gemma":[0.1572109,0.0005199659,0.8367715,0.0001239076,0.00007441462,0.0004048744,0.0009405427,0.0001922031,0.003761708],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007487654,"threshold_uncertainty_score":0.02504867,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2962031742","doi":"10.1016/j.cor.2019.07.007","title":"Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design","year":2019,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Concordia University; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Benders' decomposition; Solver; Mathematical optimization; Algorithm; Mathematics; Decomposition; Branch and cut; Integer programming; Fixed charge; Linear programming; Integer (computer science); Flow network; Steiner tree problem; Computer science","authors":[{"name":"Carlos Armando Zetina","is_ca":true},{"name":"Ivan Contreras","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08187649673331249,"gpt":0.3443690654403821,"spread":0.2624925687070697,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001151356,0.001792444,0.001503821,0.001295712,0.0007497,0.001512551,0.00152268,0.001330849,0.0102266],"category_scores_gemma":[0.003662582,0.001301091,0.001134567,0.001675966,0.0006487191,0.001841468,0.0009617928,0.001870159,0.001119369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001677669,"about_ca_system_score_gemma":0.002661254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007873625,"about_ca_topic_score_gemma":0.009721307,"domain_scores_codex":[0.9993702,0.0002313292,0.00002401376,0.00009194396,0.0001739029,0.0001085804],"domain_scores_gemma":[0.9987281,0.0007816191,0.0001018131,0.0001403435,0.0001898789,0.00005827562],"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.00007985369,0.0000798597,0.0001489076,0.00008373695,0.00002680905,0.00001722002,0.00003116736,0.9268679,0.000470198,0.01456859,0.002435447,0.05519033],"study_design_scores_gemma":[0.00001778329,0.00001892076,0.00003414316,0.000009614681,0.000005715534,0.000005472907,0.000008650767,0.9892881,0.000183399,0.009973247,0.0004511983,0.00000383198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009812233,0.0003634085,0.9819329,0.0002120281,0.00008009609,0.0001011957,0.0001255016,0.0005692589,0.006803278],"genre_scores_gemma":[0.2586104,0.0006035953,0.7333596,0.0001769235,0.00009799621,0.0003924756,0.0004539361,0.0003096975,0.005995378],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0102266,"threshold_uncertainty_score":0.0342114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094814392","doi":"10.1002/net.10001","title":"Maximizing residual flow under an arc destruction","year":2001,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick; University of Windsor","funders":"","keywords":"Residual; Arc (geometry); Flow (mathematics); Flow network; Maximum flow problem; Mathematics; Multi-commodity flow problem; Mathematical optimization; Computer science; Algorithm; Geometry","authors":[{"name":"Y.P. Aneja","is_ca":true},{"name":"R. Chandrasekaran","is_ca":false},{"name":"K. P. K. Nair","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01790803809284282,"gpt":0.2179764931093047,"spread":0.2000684550164619,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001796766,0.0007111449,0.001114485,0.0008148895,0.0005177463,0.001099736,0.0012821,0.0009390724,0.003903483],"category_scores_gemma":[0.003513272,0.0004354672,0.0005374946,0.0009868828,0.001761202,0.002753148,0.001526202,0.0009999727,0.0003838048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009501132,"about_ca_system_score_gemma":0.0006918886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001163259,"about_ca_topic_score_gemma":0.0007462366,"domain_scores_codex":[0.9991075,0.0003423936,0.00003832807,0.0001871428,0.0001358996,0.0001886335],"domain_scores_gemma":[0.9981762,0.0008828847,0.0002805243,0.0002884959,0.0001519623,0.0002198914],"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.0004717134,0.0001430127,0.0008237459,0.0001963289,0.00005149246,0.0001719064,0.0001463261,0.8705351,0.009561175,0.07330229,0.002680855,0.04191598],"study_design_scores_gemma":[0.00006149302,0.0002026934,0.0003920914,0.00002071179,0.00002974113,0.0001479906,0.00008031851,0.9249985,0.007792317,0.06377143,0.002486244,0.00001647525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3125345,0.0005674284,0.6697515,0.0007073556,0.00005514986,0.0001129142,0.0001917795,0.0005613688,0.01551799],"genre_scores_gemma":[0.8971141,0.0003138715,0.09639832,0.00008458218,0.00004182987,0.00007370216,0.0001885018,0.0001359713,0.005649228],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003903483,"threshold_uncertainty_score":0.01305842,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050024620","doi":"10.1080/00207160.2012.685468","title":"Packing equal circles into a circle with circular prohibited areas","year":2012,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Waterloo","keywords":"Circle packing; Mathematics; Packing problems; Domain (mathematical analysis); RADIUS; Lattice (music); Sphere packing; Hexagonal lattice; Maxima and minima; Hexagonal crystal system; Maxima; Geometry; Combinatorics; Mathematical analysis; Computer science","authors":[{"name":"Yu. G. Stoyan","is_ca":false},{"name":"Georgiy Yaskov","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01230553617681728,"gpt":0.2322135809874888,"spread":0.2199080448106715,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000730706,0.0006203242,0.0009987763,0.000726644,0.0007034285,0.001528082,0.001150412,0.001131418,0.002794196],"category_scores_gemma":[0.003371034,0.0004735398,0.000619337,0.001348461,0.001167853,0.002257322,0.001630037,0.0005879228,0.000296686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006933533,"about_ca_system_score_gemma":0.000518728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002034897,"about_ca_topic_score_gemma":0.001518619,"domain_scores_codex":[0.9991156,0.0003217534,0.00005132217,0.0001975321,0.0001520752,0.0001616863],"domain_scores_gemma":[0.9975914,0.001345358,0.0004343185,0.0002968013,0.0001394205,0.0001928056],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005222815,0.0001282047,0.001439716,0.0002530299,0.00006154058,0.0004815159,0.0001357784,0.887543,0.00584756,0.07558052,0.001110664,0.02689622],"study_design_scores_gemma":[0.00004466065,0.0001816703,0.0003656894,0.00002379472,0.0000218118,0.0002576792,0.0001091385,0.967759,0.005365162,0.02350868,0.00234338,0.00001950863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5488263,0.0007932456,0.4359218,0.000281373,0.00004985595,0.00009861599,0.0001903026,0.0001870152,0.01365158],"genre_scores_gemma":[0.8939929,0.0003635729,0.1018097,0.00004329891,0.00002079026,0.00008619807,0.0001782922,0.00004694771,0.003458382],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002794196,"threshold_uncertainty_score":0.009347558,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133331715","doi":"10.1016/j.dam.2012.07.020","title":"On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Circle packing; Mathematics; Square (algebra); Packing problems; Combinatorics; Branch and bound; Symmetry (geometry); Symmetry breaking; Mathematical optimization; Geometry","authors":[{"name":"Alberto Costa","is_ca":false},{"name":"Pierre Hansen","is_ca":true},{"name":"Leo Liberti","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01938644715395996,"gpt":0.263916854461279,"spread":0.2445304073073191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006033139,0.00130436,0.002358823,0.001796944,0.001617947,0.002899919,0.002513682,0.002131312,0.00949984],"category_scores_gemma":[0.05306771,0.000944926,0.00076249,0.003223644,0.002479191,0.00516854,0.00233619,0.002924853,0.0007036441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002071827,"about_ca_system_score_gemma":0.002560694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008109698,"about_ca_topic_score_gemma":0.00700226,"domain_scores_codex":[0.9972218,0.001363888,0.00008809695,0.0001877256,0.000587068,0.000551413],"domain_scores_gemma":[0.9496109,0.04519903,0.001426455,0.001391025,0.001429105,0.0009435449],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007566102,0.0001550851,0.001065575,0.0002743736,0.00005250198,0.00009190504,0.0001212239,0.8815097,0.001228267,0.08276378,0.007378945,0.02460198],"study_design_scores_gemma":[0.00003136436,0.0000687237,0.0002790268,0.00003124274,0.00001890415,0.00002026502,0.00006254202,0.9571993,0.0004422419,0.04140227,0.0004287689,0.00001531003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5234804,0.01207971,0.3334017,0.007863392,0.001009552,0.0002457578,0.0009182972,0.0006186771,0.1203826],"genre_scores_gemma":[0.9471576,0.002468712,0.04444021,0.0005595143,0.0002430165,0.0001282514,0.000381456,0.0004118783,0.004209376],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.00949984,"threshold_uncertainty_score":0.03190666,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W131027357","doi":"10.1007/978-3-540-74456-6_11","title":"New Approximability Results for 2-Dimensional Packing Problems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Rectangle; Bin packing problem; Approximation algorithm; Combinatorics; Packing problems; Mathematics; Constant (computer programming); Square (algebra); Time complexity; Unit square; Bin; Discrete mathematics; Mathematical optimization; Algorithm; Computer science; Geometry","authors":[{"name":"Klaus Jansen","is_ca":false},{"name":"Roberto Solis-Oba","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03067121682218337,"gpt":0.2497607338974151,"spread":0.2190895170752317,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00365619,0.004991931,0.003496622,0.00500534,0.001815552,0.005384146,0.006857355,0.003228274,0.01756654],"category_scores_gemma":[0.01737122,0.002011791,0.004979219,0.006941879,0.003423377,0.01434195,0.005837907,0.01479726,0.003761057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003873834,"about_ca_system_score_gemma":0.001163475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002725552,"about_ca_topic_score_gemma":0.002758647,"domain_scores_codex":[0.9971576,0.0005011917,0.0001793701,0.0005128285,0.001273844,0.0003751751],"domain_scores_gemma":[0.9884722,0.008547875,0.0004628336,0.001343682,0.0007694206,0.0004039222],"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.0006938631,0.0006124068,0.001401662,0.001507632,0.0002503181,0.0003527392,0.0008533319,0.1612622,0.006005503,0.5809883,0.03753625,0.2085357],"study_design_scores_gemma":[0.00006471588,0.00008879801,0.0008029423,0.0001817798,0.0001460931,0.000337698,0.000105346,0.3718694,0.002175564,0.603847,0.02031646,0.00006416917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03067985,0.012116,0.8613675,0.002389977,0.001666699,0.0001770837,0.0007140499,0.001482462,0.08940644],"genre_scores_gemma":[0.2962771,0.01336124,0.5942135,0.002433566,0.004945743,0.001323977,0.003557384,0.0032825,0.08060485],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01756654,"threshold_uncertainty_score":0.05876589,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2559457754","doi":"10.1016/j.ejor.2016.11.042","title":"An iterative pseudo-gap enumeration approach for the Multidimensional Multiple-choice Knapsack Problem","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Engineering and Physical Sciences Research Council; National Natural Science Foundation of China","keywords":"Knapsack problem; Enumeration; Benchmark (surveying); Heuristics; Mathematical optimization; Mathematics; Constraint (computer-aided design); Limit (mathematics); Combinatorial optimization; Convergence (economics); Computer science; Algorithm; Combinatorics","authors":[{"name":"Chao Gao","is_ca":true},{"name":"Guanzhou Lu","is_ca":false},{"name":"Xin Yao","is_ca":false},{"name":"Jinlong Li","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1006192863563736,"gpt":0.340530058788879,"spread":0.2399107724325054,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00155888,0.001319034,0.001700934,0.001448324,0.0009727724,0.001668458,0.002720308,0.002020576,0.008937135],"category_scores_gemma":[0.006851013,0.0008138942,0.001471582,0.001988775,0.0009436026,0.002342705,0.003133571,0.002403849,0.001616877],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007906443,"about_ca_system_score_gemma":0.002373046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003168736,"about_ca_topic_score_gemma":0.004688342,"domain_scores_codex":[0.9984433,0.0005931994,0.00005209947,0.0001437245,0.0005606522,0.0002070016],"domain_scores_gemma":[0.9972573,0.00183449,0.0001094567,0.0002379326,0.0004427778,0.0001179788],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002188394,0.0002673183,0.0005546861,0.000347372,0.00005672666,0.0001756358,0.0002108779,0.7224216,0.00291867,0.08830258,0.006606135,0.1779195],"study_design_scores_gemma":[0.00001704981,0.00003405131,0.0000541219,0.00001829511,0.000007023033,0.00003737776,0.0000241929,0.9798997,0.0004112284,0.01830466,0.001183685,0.0000085723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004968254,0.0001409998,0.9878001,0.0001471095,0.00006230891,0.00009345605,0.00005771872,0.0002599299,0.006470099],"genre_scores_gemma":[0.1277491,0.0002446748,0.8657421,0.0002145273,0.00007393328,0.0005486366,0.0002501634,0.0002400542,0.004936856],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008937135,"threshold_uncertainty_score":0.02989775,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2754611409","doi":"10.1155/2017/1670709","title":"A Parallel Biased Random‐Key Genetic Algorithm with Multiple Populations Applied to Irregular Strip Packing Problems","year":2017,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Institute of Population and Public Health; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Key (lock); Algorithm; Genetic algorithm; Computer science; Mathematics; Machine learning","authors":[{"name":"Bonfim Amaro Júnior","is_ca":false},{"name":"Plácido Rogério Pinheiro","is_ca":false},{"name":"Pedro Veras Coelho","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02442172224273686,"gpt":0.2258418722871524,"spread":0.2014201500444155,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001088745,0.0008667826,0.001054298,0.0008145669,0.0005574992,0.0006362625,0.001466974,0.001347911,0.001095982],"category_scores_gemma":[0.002249272,0.000420108,0.0006839053,0.0008780826,0.0006531096,0.0005860483,0.001001815,0.0007382573,0.0002399187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007277895,"about_ca_system_score_gemma":0.00158578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006010411,"about_ca_topic_score_gemma":0.004361141,"domain_scores_codex":[0.9994766,0.000196535,0.00001958608,0.0000817952,0.0001519076,0.00007368834],"domain_scores_gemma":[0.9993363,0.0003574098,0.0000754255,0.00004731915,0.000142614,0.00004098315],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003857312,0.00003070631,0.000452981,0.00003133276,0.00003288079,0.00006129347,0.00004069625,0.9680642,0.001379514,0.003107925,0.0003089956,0.0264508],"study_design_scores_gemma":[0.0000219992,0.00003288016,0.00007435098,0.000003455402,0.000008167054,0.00001586912,0.000005567705,0.9984965,0.0002629385,0.0007877685,0.0002868565,0.000003559594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06261807,0.0005249871,0.932144,0.0002814769,0.00008731514,0.0001523725,0.00003835366,0.0003713511,0.003782051],"genre_scores_gemma":[0.5562799,0.0004300936,0.4393889,0.0002286205,0.00005277461,0.0004849879,0.0001169174,0.00007332977,0.002944485],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006010411,"threshold_uncertainty_score":0.01195085,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1993924585","doi":"10.1002/net.20448","title":"Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks","year":2012,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Pickup; Travelling salesman problem; Benchmark (surveying); Stack (abstract data type); Constraint (computer-aided design); Computer science; Mathematical optimization; Vehicle routing problem; Algorithm; Mathematics; Routing (electronic design automation); Artificial intelligence; Computer network","authors":[{"name":"Jean‐François Côté","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Jean‐Yves Potvin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01459087504712119,"gpt":0.2115262765057453,"spread":0.1969354014586241,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001197147,0.0006498137,0.001560052,0.0007917639,0.0006128735,0.0007414413,0.00102861,0.001003353,0.002384834],"category_scores_gemma":[0.003022522,0.0005580473,0.0006177265,0.0008468554,0.0004590928,0.001236473,0.0006758554,0.0006658076,0.0002367652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009148699,"about_ca_system_score_gemma":0.0007251591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005856001,"about_ca_topic_score_gemma":0.004771795,"domain_scores_codex":[0.9995,0.0002880497,0.00001694498,0.00007375854,0.00007370095,0.00004749474],"domain_scores_gemma":[0.9984981,0.001244712,0.0001037347,0.00002701801,0.00006304171,0.00006340305],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008419151,0.00007951753,0.0003522677,0.00005428906,0.00003773981,0.00006328141,0.00002586349,0.9792987,0.0002559487,0.006528934,0.0009214941,0.01229784],"study_design_scores_gemma":[0.00001500072,0.00003022153,0.00005800456,0.000003512333,0.000005287354,0.00000912629,0.00001026636,0.9972845,0.00006514908,0.002310686,0.0002058139,0.000002483819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2945811,0.003084448,0.6913794,0.0009199819,0.0001273917,0.000186113,0.0002626685,0.0003082326,0.009150792],"genre_scores_gemma":[0.7703307,0.0007751132,0.2220067,0.0001037851,0.00008999353,0.0002570684,0.0003510995,0.00007736663,0.006008155],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005856001,"threshold_uncertainty_score":0.01164383,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144900108","doi":"10.1111/j.1475-3995.2009.00723.x","title":"Optimal aircraft load balancing","year":2009,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Mathematical optimization; Payload (computing); Set (abstract data type); Integer programming; Function (biology); Linear programming; Macro; Position (finance); Cardinality (data modeling); Orientation (vector space); Operations research; Mathematics","authors":[{"name":"Bohdan Kaluzny","is_ca":true},{"name":"R. H. A. David Shaw","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04097455618872663,"gpt":0.3516766746058211,"spread":0.3107021184170945,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039885,0.001018448,0.0009392872,0.0008514203,0.0005262616,0.001435509,0.0008935534,0.000846926,0.009594538],"category_scores_gemma":[0.0009410384,0.0004533791,0.0004136947,0.0009470395,0.0004118057,0.0009548281,0.0007612464,0.0004153094,0.0009110242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001337846,"about_ca_system_score_gemma":0.001123742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01132351,"about_ca_topic_score_gemma":0.009481252,"domain_scores_codex":[0.9996204,0.0000752736,0.00001167125,0.00006887497,0.0001118365,0.0001117774],"domain_scores_gemma":[0.9998127,0.00006752268,0.00003940682,0.00001460879,0.00004481992,0.00002097903],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008865569,0.00005668296,0.0002492231,0.00009274163,0.00001143526,0.00005828367,0.00003080224,0.9585822,0.003858332,0.007952807,0.00235413,0.02666466],"study_design_scores_gemma":[0.00001671102,0.0000598706,0.0002580368,0.00001266677,0.000008339187,0.00001885266,0.00003614675,0.9926997,0.001097481,0.00397667,0.001809204,0.000006353879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1396317,0.000981565,0.7903402,0.0004922379,0.0001678595,0.0003022382,0.000719207,0.0006820679,0.06668279],"genre_scores_gemma":[0.8815905,0.0005077486,0.1012618,0.00009806698,0.00007380568,0.000169505,0.0004733247,0.0001527715,0.01567237],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01132351,"threshold_uncertainty_score":0.03209692,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994121331","doi":"10.1108/13552510310493738","title":"Availability modeling and optimization of reconfigurable manufacturing systems","year":2003,"lang":"en","type":"article","venue":"Journal of Quality in Maintenance Engineering","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval; Université du Québec en Abitibi-Témiscamingue","funders":"","keywords":"Control reconfiguration; Mathematical optimization; Integer programming; Linear programming; Computer science; Production (economics); Reliability engineering; Component (thermodynamics); Failure rate; Basis (linear algebra); Stochastic programming; Robust optimization; Engineering; Mathematics; Embedded system","authors":[{"name":"Mustapha Nourelfath","is_ca":true},{"name":"Daoud Aı̈t-Kadi","is_ca":true},{"name":"Wassy Isaac Soro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02289221077093223,"gpt":0.237647398735157,"spread":0.2147551879642248,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007695789,0.0008082538,0.0008003254,0.0006758719,0.0002966557,0.0008881476,0.0006753445,0.0009089035,0.001193129],"category_scores_gemma":[0.001847139,0.000570785,0.0008023744,0.000565228,0.0007989777,0.0007094486,0.0005755002,0.0005591646,0.0002005711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001047574,"about_ca_system_score_gemma":0.0006260701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005563297,"about_ca_topic_score_gemma":0.002266235,"domain_scores_codex":[0.9994017,0.0002218542,0.00002296745,0.00009236063,0.0001617934,0.00009934964],"domain_scores_gemma":[0.9992957,0.0004131916,0.0001690365,0.00003121078,0.00005964909,0.00003117199],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007279768,0.000003392294,0.00006885169,0.000007506943,0.00000420485,0.00001183986,0.000004100357,0.9966169,0.0002173894,0.002352145,0.00003155072,0.0006749394],"study_design_scores_gemma":[0.00000239618,0.000006387041,0.00007855329,0.00000150971,0.000001698885,0.000004278592,0.000002145469,0.9979121,0.0000913993,0.001807987,0.00008992533,0.00000162044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08719852,0.0009763129,0.903773,0.0003548111,0.00003804008,0.00003907394,0.0001483233,0.0002608299,0.007211015],"genre_scores_gemma":[0.9727366,0.0005327556,0.0230942,0.00003310832,0.00003278444,0.00009251577,0.0001060979,0.00004851431,0.003323348],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005563297,"threshold_uncertainty_score":0.01106179,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078289810","doi":"10.1016/s0305-0548(03)00244-2","title":"An analysis of lower bound procedures for the bin packing problem","year":2003,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Combinatorics; Mathematics; Bin packing problem; Bin; Algorithm","authors":[{"name":"Jean-Marie Bourjolly","is_ca":true},{"name":"Vianney Rebetez","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05096352631292451,"gpt":0.3525417086751189,"spread":0.3015781823621944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008504847,0.002330072,0.002611821,0.004291544,0.002353717,0.006092914,0.004121132,0.003580192,0.01149878],"category_scores_gemma":[0.04693179,0.001955901,0.003684662,0.005585326,0.002548914,0.007024443,0.003223406,0.006549248,0.002331504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004225339,"about_ca_system_score_gemma":0.005079885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005438604,"about_ca_topic_score_gemma":0.003864195,"domain_scores_codex":[0.991525,0.003129173,0.0002620444,0.0005089035,0.003546374,0.001028578],"domain_scores_gemma":[0.9594054,0.03403759,0.001231325,0.001923213,0.002877606,0.0005249472],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007090587,0.0007488949,0.001093623,0.0007048456,0.0001950163,0.0001066896,0.0004759877,0.4490211,0.005930928,0.3114969,0.0163462,0.2131708],"study_design_scores_gemma":[0.00003908601,0.00009614621,0.0003703733,0.00008083947,0.00006584298,0.00006399058,0.00003648519,0.9104331,0.001343436,0.08453558,0.002908619,0.0000264503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01447449,0.001808259,0.9683044,0.0008409821,0.0001324687,0.0002342969,0.0001343878,0.0005363156,0.01353435],"genre_scores_gemma":[0.2525546,0.004480949,0.7195741,0.001206651,0.001019264,0.00102926,0.001104776,0.002016465,0.0170139],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01149878,"threshold_uncertainty_score":0.0449785,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018050678","doi":"10.1109/icsmc.2012.6377989","title":"Optimization/simulation-based framework for the evaluation of supply chain management policies in the forest product industry","year":2012,"lang":"en","type":"article","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Supply chain; Supply chain management; Product (mathematics); Computer science; Chain (unit); Business; Marketing","authors":[{"name":"Wassim Jerbi","is_ca":true},{"name":"Jonathan Gaudreault","is_ca":true},{"name":"Sophie D’Amours","is_ca":true},{"name":"Mustapha Nourelfath","is_ca":true},{"name":"Sébastien Lemieux","is_ca":true},{"name":"Philippe Marier","is_ca":true},{"name":"Mathieu Bouchard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05564587000766884,"gpt":0.3172410658829411,"spread":0.2615951958752722,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003060199,0.001366358,0.001367719,0.001392056,0.0006608082,0.001553721,0.001423282,0.001061135,0.002929258],"category_scores_gemma":[0.003129543,0.0006514917,0.001346932,0.0007796558,0.001398512,0.0008372543,0.001181501,0.001393013,0.0003140155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002332274,"about_ca_system_score_gemma":0.003379822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01505768,"about_ca_topic_score_gemma":0.007888103,"domain_scores_codex":[0.9983144,0.001012863,0.00008561213,0.0001034252,0.0003595798,0.0001242365],"domain_scores_gemma":[0.9989114,0.0006631248,0.0001260736,0.00009251802,0.0001490394,0.0000577353],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001143248,0.00002318402,0.00008044649,0.00001723136,0.00001413728,0.00001214031,0.000009181353,0.984109,0.00034003,0.01319887,0.0000945277,0.002089872],"study_design_scores_gemma":[0.000008615512,0.000009237711,0.00002675306,0.000007229372,0.000004053373,0.000002914169,0.000003896771,0.9951578,0.0001917595,0.003939411,0.000644666,0.000003659198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007163083,0.0002064089,0.9868422,0.0001812437,0.0000298302,0.0001807047,0.0001182191,0.0003334151,0.004944866],"genre_scores_gemma":[0.3761788,0.000690167,0.6192606,0.0001237011,0.00006551619,0.001020371,0.0004006292,0.0001884504,0.002071667],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01505768,"threshold_uncertainty_score":0.02994007,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3118158855","doi":"10.1016/j.aei.2020.101234","title":"Optimizing 3D Irregular Object Packing from 3D Scans Using Metaheuristics","year":2020,"lang":"en","type":"article","venue":"Advanced Engineering Informatics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University Network of Excellence in Nuclear Engineering","keywords":"Container (type theory); Packing problems; Object (grammar); Metaheuristic; Volume (thermodynamics); Computer science; Mathematical optimization; Bin packing problem; Key (lock); Algorithm; Engineering; Artificial intelligence; Mathematics; Mechanical engineering","authors":[{"name":"Yinghui Zhao","is_ca":true},{"name":"Chris Rausch","is_ca":true},{"name":"Carl T. Haas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01443284863373439,"gpt":0.2050927582970104,"spread":0.190659909663276,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009990438,0.001161165,0.001842905,0.001683408,0.0006341789,0.001623441,0.00147037,0.002737869,0.00280871],"category_scores_gemma":[0.00366519,0.001614394,0.002005792,0.002562099,0.001086164,0.001591584,0.001524781,0.001549181,0.0004886143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001201604,"about_ca_system_score_gemma":0.001322821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005483839,"about_ca_topic_score_gemma":0.004820611,"domain_scores_codex":[0.9994757,0.0001716535,0.0000266872,0.00007819517,0.0001759653,0.00007180979],"domain_scores_gemma":[0.9979214,0.001545434,0.0001677504,0.0001417646,0.0001626028,0.00006104675],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006113401,0.00003349926,0.0001981305,0.00003890917,0.00002302282,0.00004744922,0.00002824848,0.9810336,0.0006940952,0.002484124,0.000436441,0.01492144],"study_design_scores_gemma":[0.000004679316,0.000008262222,0.0000288197,0.000003154068,0.000002452314,0.000007275305,0.000006779325,0.9981719,0.0001951749,0.001461206,0.0001079317,0.000002271422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0593693,0.0004445629,0.9332377,0.0002068561,0.00006940962,0.0001428276,0.0001699592,0.0007851824,0.005574081],"genre_scores_gemma":[0.4258725,0.0003084099,0.5690804,0.000154644,0.00006870496,0.0004219073,0.0005702954,0.0005199866,0.003003168],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005483839,"threshold_uncertainty_score":0.01090384,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2579916312","doi":"10.1287/ijoc.2017.0746","title":"Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem","year":2017,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Heuristics; Mathematical optimization; Lagrangian relaxation; Column generation; Sizing; Heuristic; Computer science; Selection (genetic algorithm); Mathematics; Machine learning","authors":[{"name":"Tao Wu","is_ca":false},{"name":"Kerem Akartunalı","is_ca":false},{"name":"Raf Jans","is_ca":true},{"name":"Zhe Liang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02287471009288828,"gpt":0.306114812320784,"spread":0.2832401022278958,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001684199,0.0007611999,0.0008236035,0.000856724,0.0004474779,0.0005864911,0.001255964,0.0007225227,0.003795061],"category_scores_gemma":[0.002589005,0.0004204247,0.0007343831,0.0008778801,0.0006994531,0.0007954483,0.0008572314,0.000877945,0.0004538194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006730215,"about_ca_system_score_gemma":0.001371922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00195625,"about_ca_topic_score_gemma":0.002601285,"domain_scores_codex":[0.9995512,0.0001776243,0.00001398188,0.00005411606,0.0001534567,0.00004961064],"domain_scores_gemma":[0.99885,0.0008584702,0.00007639714,0.00004667597,0.000113081,0.00005533074],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00014132,0.00008083131,0.0005179935,0.0001783602,0.00004896247,0.000170429,0.0001063461,0.8668247,0.004121658,0.03045244,0.002269039,0.0950878],"study_design_scores_gemma":[0.00002553805,0.00006204115,0.00008601986,0.000009095881,0.000008513034,0.0000292944,0.00001047903,0.9928001,0.0005512699,0.005453674,0.000959405,0.000004679154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01616495,0.0002651081,0.9797691,0.0001326683,0.00002973146,0.000132122,0.00002935701,0.0001489948,0.003328081],"genre_scores_gemma":[0.3519349,0.0005329143,0.6404723,0.0001861568,0.00009995074,0.0004910621,0.0001895607,0.0001341632,0.005959104],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003795061,"threshold_uncertainty_score":0.01269573,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013696768","doi":"10.5555/1109557.1109575","title":"An asymptotic approximation algorithm for 3D-strip packing","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Bin packing problem; Approximation algorithm; Mathematics; Algorithm; Combinatorics; Packing problems; Bin; Set (abstract data type); Computer science","authors":[{"name":"Klaus Jansen","is_ca":false},{"name":"Roberto Solis-Oba","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00843081260272268,"gpt":0.231809257577146,"spread":0.2233784449744234,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007201984,0.001296699,0.00139019,0.001221169,0.0008157651,0.001612428,0.002713424,0.00161503,0.008476607],"category_scores_gemma":[0.003846642,0.0006442665,0.001020672,0.003150729,0.0006001865,0.002897681,0.002848805,0.001764885,0.004876445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001410494,"about_ca_system_score_gemma":0.001484572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003172841,"about_ca_topic_score_gemma":0.002771961,"domain_scores_codex":[0.998448,0.0002267079,0.0001023749,0.0002413601,0.0006861541,0.0002953787],"domain_scores_gemma":[0.998684,0.0004053679,0.00009928473,0.0004772549,0.000255491,0.00007863047],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006928329,0.0004326769,0.001537479,0.0003194934,0.00008157243,0.0002313664,0.0002457216,0.2747789,0.01342481,0.03137374,0.02486122,0.6520203],"study_design_scores_gemma":[0.00007955053,0.00007708339,0.0002963236,0.00001832724,0.00001546461,0.0001859424,0.00003980522,0.9679911,0.002814027,0.02277964,0.005682938,0.00001980177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01873168,0.0006096512,0.9680191,0.0002832917,0.0001114668,0.0001278341,0.0003746829,0.0042419,0.007500308],"genre_scores_gemma":[0.1436446,0.0004167235,0.8487215,0.000249357,0.00007982158,0.0003663193,0.002030736,0.0003792433,0.004111729],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008476607,"threshold_uncertainty_score":0.02835709,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1517042457","doi":"10.1007/978-3-540-68891-4_13","title":"A Polynomial Time Approximation Scheme for the Square Packing Problem","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Square (algebra); Bin packing problem; Polynomial-time approximation scheme; Combinatorics; Approximation algorithm; Packing problems; Bin; Mathematical optimization; Time complexity; Scheme (mathematics); Discrete mathematics; Algorithm; Mathematical analysis; Geometry","authors":[{"name":"Klaus Jansen","is_ca":false},{"name":"Roberto Solis-Oba","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0155292284007949,"gpt":0.2150886482293441,"spread":0.1995594198285492,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009594553,0.001575047,0.001947146,0.001111642,0.001295639,0.002976853,0.003713461,0.001637287,0.01483471],"category_scores_gemma":[0.004436465,0.0009325058,0.001780062,0.004357569,0.001127476,0.005713005,0.003520533,0.003885049,0.004802673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002663796,"about_ca_system_score_gemma":0.002187217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004422678,"about_ca_topic_score_gemma":0.004791461,"domain_scores_codex":[0.9984744,0.000205215,0.00008287127,0.0003011688,0.0006526199,0.000283689],"domain_scores_gemma":[0.9982752,0.0007007777,0.00008678425,0.0006617872,0.0001729467,0.0001025976],"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.001232567,0.0005149352,0.0004389385,0.000554817,0.00008310942,0.0001541178,0.0003284929,0.1311245,0.01626703,0.1767559,0.05140289,0.6211427],"study_design_scores_gemma":[0.0004141475,0.0002024268,0.0003294257,0.00005993598,0.00008341715,0.0002928088,0.0001126172,0.7389675,0.006598585,0.2274009,0.02548641,0.00005173338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02282026,0.0009797757,0.9471743,0.000670338,0.0003417123,0.0002955092,0.0006798656,0.003659054,0.0233792],"genre_scores_gemma":[0.1455252,0.0009567265,0.8317383,0.0003406838,0.000266702,0.0004250339,0.001884906,0.0006299046,0.0182326],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01483471,"threshold_uncertainty_score":0.04962701,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965685568","doi":"10.4236/ajor.2013.32024","title":"A Particle Swarm Optimization Algorithm for a 2-D Irregular Strip Packing Problem","year":2013,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Particle swarm optimization; Packing problems; Algorithm; Benchmark (surveying); Generator (circuit theory); Set (abstract data type); Circle packing; Sequence (biology); Mathematical optimization; Multi-swarm optimization; Phase (matter); Mathematics; Optimization problem; Computer science; Combinatorics; Power (physics)","authors":[{"name":"Mohamed A. Wahby Shalaby","is_ca":false},{"name":"Mohamed Kashkoush","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03452771659394198,"gpt":0.3214010978096618,"spread":0.2868733812157198,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007565088,0.001153191,0.00116845,0.0007045033,0.0005915133,0.0008719039,0.001106567,0.00167293,0.002498241],"category_scores_gemma":[0.001553597,0.0005083876,0.0007438635,0.000972828,0.0004156873,0.0006923242,0.000948024,0.001091638,0.0005887193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004933199,"about_ca_system_score_gemma":0.00125105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005862439,"about_ca_topic_score_gemma":0.003795786,"domain_scores_codex":[0.999675,0.0000917334,0.00002248512,0.00006458758,0.000110277,0.00003593092],"domain_scores_gemma":[0.9995384,0.0002547109,0.00004361473,0.00002846766,0.0001110995,0.00002377084],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004415757,0.00004629598,0.0003280919,0.0000765229,0.0000278214,0.00005927189,0.00005121376,0.9419897,0.001225189,0.004335568,0.001819058,0.04999717],"study_design_scores_gemma":[0.00001164601,0.00002024868,0.00004087581,0.000004845018,0.000003898379,0.00000992997,0.000005955009,0.9982837,0.0001676236,0.0007205245,0.0007281663,0.000002610291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005988236,0.0001988848,0.9908862,0.000117284,0.00005984051,0.00009107253,0.00004733435,0.0002052128,0.002405879],"genre_scores_gemma":[0.1384824,0.0004149268,0.8550465,0.0001113657,0.00007343498,0.0006786319,0.0003194136,0.00007016837,0.004803155],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005862439,"threshold_uncertainty_score":0.01165664,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}