{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003201715,0.0000645819,0.00006629786,0.00009107279,0.0001410683,0.00007875682,0.00006359533,0.00002160618,0.000009703219],"category_scores_gemma":[0.000002938868,0.00006443155,0.00001438401,0.0003647553,0.00007750149,0.0002720483,0.000001102625,0.00004239432,0.000001778813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000199449,"about_ca_system_score_gemma":0.00002742014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005087683,"about_ca_topic_score_gemma":0.00004244477,"domain_scores_codex":[0.9993468,0.000002822335,0.0001526869,0.0001472156,0.0001529128,0.0001975663],"domain_scores_gemma":[0.9997751,0.00002537963,0.00001714909,0.0000494667,0.0000896984,0.00004318941],"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.000006441535,0.00002796087,0.01257628,0.0001853955,0.00000967353,0.000003082026,0.004785235,0.8440365,0.04349257,0.03077454,0.0001953658,0.06390691],"study_design_scores_gemma":[0.0004374667,0.00001764206,0.01111388,0.00002971446,0.000006272327,0.000001570993,0.0001174823,0.9811672,0.005942456,0.0003514484,0.0006722938,0.0001425663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06856596,0.0000465425,0.9293441,0.00004809601,0.00008751159,0.000279739,0.00001835894,0.0001793996,0.00143026],"genre_scores_gemma":[0.9046504,0.000006051647,0.09512366,0.00001801696,0.00002376414,0.0000197302,0.00001948393,0.00001019652,0.0001286978],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8360844,"threshold_uncertainty_score":0.2627442,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00470585,0.0001019745,0.0001303258,0.0001499778,0.00027724,0.0002870965,0.0002159327,0.00004637316,0.00006118492],"category_scores_gemma":[0.0003244874,0.000102968,0.00003383751,0.0005745713,0.00008153556,0.0003050133,0.00005479967,0.0005192223,0.00002102287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001211658,"about_ca_system_score_gemma":0.00008695381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002327302,"about_ca_topic_score_gemma":0.000001038351,"domain_scores_codex":[0.99801,0.0002532306,0.0006414482,0.0001507244,0.0006534467,0.0002911148],"domain_scores_gemma":[0.9987792,0.0002036818,0.00008551938,0.0001149264,0.0005877474,0.0002289734],"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.00005342534,0.00004683088,0.0005298397,0.00001521403,0.00003633099,0.00001975344,0.0002371219,0.9630729,0.0004923679,0.0003688572,0.01207006,0.02305728],"study_design_scores_gemma":[0.007992225,0.001130622,0.006196234,0.0006140917,0.00004439718,0.0008873016,0.0007144261,0.5665427,0.001595351,0.0002884672,0.4128763,0.001117881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002633886,0.0007559313,0.9606091,0.0008318141,0.0001999654,0.0002949929,0.0000374365,0.00005445159,0.0345824],"genre_scores_gemma":[0.9808667,0.000219447,0.01798541,0.00004933562,0.0006533358,0.000002837054,0.00004216722,0.00003373173,0.0001470456],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9782328,"threshold_uncertainty_score":0.4198912,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006135296,0.0001124105,0.00009838953,0.00003138672,0.0001972439,0.00005955363,0.00009264967,0.00005569113,0.00005262325],"category_scores_gemma":[0.00001082354,0.00008122694,0.00002967772,0.0001968084,0.00007091053,0.00004630407,0.00001694074,0.0002332224,0.000006868233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003452299,"about_ca_system_score_gemma":0.00001798915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007626868,"about_ca_topic_score_gemma":0.00002494307,"domain_scores_codex":[0.9991623,0.00001227869,0.0001685523,0.0001295412,0.0001327369,0.0003945859],"domain_scores_gemma":[0.9992848,0.0004386739,0.00002539776,0.0001171265,0.0000662012,0.00006779328],"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.00001921824,0.000005982758,0.0009309096,0.00001669928,0.00003200517,0.000002886848,0.0001889677,0.9858066,0.00005213347,0.001059102,0.0004707494,0.01141479],"study_design_scores_gemma":[0.0005765005,0.00002660268,0.0003542832,0.00008408965,0.0000151666,0.00001558206,0.00004877845,0.9980828,0.00008885846,0.00003656487,0.0005489868,0.0001218239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01031493,0.0002787964,0.9833676,0.00008496494,0.0002602243,0.0005007061,0.000003384642,0.0002496056,0.004939819],"genre_scores_gemma":[0.9890727,0.000006675759,0.01039396,0.0001158303,0.0002309796,0.00001558245,0.00001154253,0.0000376352,0.0001150387],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9787578,"threshold_uncertainty_score":0.3312338,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001087293,0.00007283626,0.00007254749,0.0000952672,0.000679765,0.0003234018,0.0002066492,0.00006103144,0.00009137813],"category_scores_gemma":[0.000186507,0.00005561304,0.0000307793,0.0003216637,0.00005118866,0.0001194015,0.00003034272,0.0002472229,0.00005574595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004514353,"about_ca_system_score_gemma":0.00004451154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003281256,"about_ca_topic_score_gemma":0.0001005533,"domain_scores_codex":[0.9991048,0.00008797245,0.0001415085,0.0001233129,0.0002583961,0.0002840313],"domain_scores_gemma":[0.9990617,0.000367808,0.000004228082,0.0002413742,0.0002717093,0.00005319538],"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.000003826489,0.00001948015,0.00003736382,0.00003249975,0.00002178887,8.036543e-8,0.000495293,0.8276622,0.0004597496,0.1537729,0.01261651,0.004878336],"study_design_scores_gemma":[0.0004147123,0.00004656653,0.00003102597,0.0000141341,0.000003788488,6.838497e-7,0.0001134618,0.8681754,0.0005424723,0.001675229,0.1289016,0.00008090717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002969112,0.0003165211,0.8787284,0.004615261,0.00201513,0.002957553,0.00003919589,0.0004951482,0.1078636],"genre_scores_gemma":[0.993718,0.00006717433,0.004013883,0.0000313561,0.0003362412,0.0003033297,0.00004013046,0.00003276874,0.001457099],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9907489,"threshold_uncertainty_score":0.5228271,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002502932,0.0002789145,0.0003062761,0.00009857144,0.0004356187,0.0002754313,0.00009141726,0.0001301362,0.00002046776],"category_scores_gemma":[0.000002516776,0.0002230181,0.00007170629,0.00008560358,0.00005409768,0.0001012664,0.000001916399,0.0001957161,0.00002403849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004231683,"about_ca_system_score_gemma":0.00002109289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001936207,"about_ca_topic_score_gemma":0.0002647657,"domain_scores_codex":[0.9986599,0.00004306324,0.0004865977,0.000294601,0.000197048,0.0003187842],"domain_scores_gemma":[0.9992392,0.0001929473,0.000077263,0.0002375804,0.00007276797,0.0001802287],"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.0000194969,0.00005569378,0.00001737405,0.0006538345,0.0001708807,0.000001107537,0.003493083,0.9805105,0.0004269357,0.00385735,0.008204101,0.002589655],"study_design_scores_gemma":[0.001337075,0.0001226749,0.00003865901,0.000517885,0.0001271857,0.00005108118,0.0005483868,0.7411802,0.0001213483,0.00001808185,0.2555105,0.00042689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0134039,0.004596359,0.9735869,0.0002642927,0.002570367,0.00265719,0.0001318272,0.0004926989,0.002296489],"genre_scores_gemma":[0.9868841,0.0003647747,0.001897672,0.00004187442,0.0004009341,0.0002352938,0.000007014183,0.00006910877,0.01009926],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9734802,"threshold_uncertainty_score":0.9094412,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006190424,0.00007598206,0.00008781269,0.0001685911,0.0004022446,0.000322883,0.00006472718,0.00006590577,0.000361585],"category_scores_gemma":[0.00008245633,0.00008058489,0.00002963932,0.0003032169,0.00004787052,0.000202597,0.00001488418,0.0001214149,0.00005723547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008227115,"about_ca_system_score_gemma":0.00006467147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001680788,"about_ca_topic_score_gemma":0.001042195,"domain_scores_codex":[0.9990798,0.00006974964,0.0002206996,0.0001370395,0.000233211,0.0002594879],"domain_scores_gemma":[0.9992871,0.00008918942,0.000004337307,0.0001661158,0.0004144592,0.00003876365],"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.000003471732,0.00002389052,0.00002385639,0.00002519279,0.00000650776,2.517184e-7,0.0002303618,0.9329107,0.02829648,0.01649264,0.02175947,0.0002271623],"study_design_scores_gemma":[0.0004066777,0.00004343287,0.00004054844,0.000005830163,0.000002468648,0.000001124727,0.0001217358,0.9517906,0.01124328,0.0001068622,0.03612456,0.000112843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6121179,0.0004301022,0.3580205,0.001198207,0.0005944651,0.002258164,0.0002501403,0.0006126313,0.02451785],"genre_scores_gemma":[0.9516672,0.00004658597,0.03344489,0.00001775169,0.0004756499,0.0006323897,0.0006912465,0.00004015059,0.01298412],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3395493,"threshold_uncertainty_score":0.3959102,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006657239,0.00007902418,0.00006043779,0.0001218042,0.00004588729,0.00002200849,0.0001127268,0.0000659318,0.00007562261],"category_scores_gemma":[0.000007427565,0.00008022969,0.00004072538,0.0003086033,0.00002043285,0.00007899466,7.908698e-7,0.0001579551,0.0001115441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001470486,"about_ca_system_score_gemma":0.00001016335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004002153,"about_ca_topic_score_gemma":0.00001617304,"domain_scores_codex":[0.999607,0.000009491776,0.00008845848,0.00007625757,0.0001084716,0.0001102984],"domain_scores_gemma":[0.9995715,0.00002279039,0.000006187951,0.000272643,0.00003569489,0.00009117139],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000007050181,0.00005361536,0.000132445,0.00001782913,0.00005071896,0.000001788939,0.0005834733,0.9821044,0.00005247758,0.001639105,0.004624448,0.0107326],"study_design_scores_gemma":[0.003159519,0.0003663152,0.0007153559,0.0001131112,0.0001341749,0.00005072229,0.0005358637,0.3231184,0.006683665,0.02532448,0.6383218,0.001476618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003737856,0.0001292838,0.9792965,0.0006625655,0.001035281,0.0001125313,0.00001586541,0.0009282569,0.01408186],"genre_scores_gemma":[0.9926414,0.0001743741,0.006482323,0.0003006117,0.00002253358,0.00001360079,0.00000682572,0.00002968837,0.0003285979],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9889036,"threshold_uncertainty_score":0.3271672,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008552705,0.000177994,0.000156121,0.0001642603,0.0002368787,0.00026619,0.0001457494,0.0001173794,0.000108775],"category_scores_gemma":[0.00005763827,0.0001421485,0.00004833905,0.0007235782,0.00002084375,0.0003370268,0.0000120199,0.0004260608,0.00001452664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001652593,"about_ca_system_score_gemma":0.00002474312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.141297e-7,"about_ca_topic_score_gemma":0.000002824114,"domain_scores_codex":[0.998611,0.0001598531,0.0005379122,0.0001305774,0.0002443804,0.0003162343],"domain_scores_gemma":[0.9994121,0.0001172009,0.0001720193,0.0001415572,0.0000909243,0.00006624076],"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.00002204613,0.00002281213,0.0001774058,0.00001092887,0.00001302138,0.000005573883,0.0003461366,0.9860526,0.00002766216,0.0004286741,0.0004277659,0.01246541],"study_design_scores_gemma":[0.000450929,0.0000774353,0.00006138006,0.0001894593,0.000008287107,0.00007112037,0.00003442772,0.9962603,0.00002601663,0.001005959,0.001645834,0.0001688509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002558805,0.00019978,0.9793468,0.0006800603,0.0003992034,0.0003561811,3.975141e-7,0.0001804233,0.01858124],"genre_scores_gemma":[0.3276054,0.001325988,0.6691473,0.0004166732,0.001025405,0.00002709664,0.0000340889,0.0001264237,0.0002916052],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3273495,"threshold_uncertainty_score":0.5796648,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003018065,0.0001044124,0.0001164056,0.00007865837,0.0003885624,0.0003757189,0.0002273413,0.00001878982,0.0002670678],"category_scores_gemma":[0.0005250129,0.00006505185,0.00004013759,0.000298374,0.0002233506,0.0002515668,0.00005277862,0.0008678482,0.0001289734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004190924,"about_ca_system_score_gemma":0.0002514184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.741738e-7,"about_ca_topic_score_gemma":0.000003204043,"domain_scores_codex":[0.9977936,0.0004576582,0.0004015798,0.000113354,0.0009642669,0.0002695607],"domain_scores_gemma":[0.9983539,0.00051834,0.00006587343,0.00008540154,0.0007488225,0.0002276508],"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.0003597569,0.00006623549,0.00129102,0.00006384009,0.0003071587,0.00095683,0.00120295,0.901154,0.009241813,0.01677768,0.05875857,0.009820108],"study_design_scores_gemma":[0.006306277,0.003230366,0.004959599,0.001149731,0.00005942401,0.003008497,0.001039378,0.6786346,0.003764023,0.0006104699,0.2961718,0.001065719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1238416,0.00246599,0.4710548,0.1869613,0.001221148,0.002119648,0.00005057823,0.0004004718,0.2118846],"genre_scores_gemma":[0.977641,0.00006346688,0.02155238,0.000239285,0.0003754489,0.000001706051,0.000004519929,0.00004307807,0.00007905511],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8537995,"threshold_uncertainty_score":0.3770417,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001693066,0.000100467,0.0001512418,0.0001454633,0.00003110744,0.0001112483,0.0001826738,0.0000577961,0.0007666238],"category_scores_gemma":[0.00001882525,0.00008264191,0.00005561452,0.00006185652,0.00002378588,0.0003363931,0.00001499458,0.0001974509,0.000001777457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002287271,"about_ca_system_score_gemma":0.00001727477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000647427,"about_ca_topic_score_gemma":0.00000214238,"domain_scores_codex":[0.9992036,0.00002407023,0.0003442839,0.00007026405,0.0002749458,0.00008281506],"domain_scores_gemma":[0.9996471,0.00002749546,0.00005431805,0.00006316707,0.0001658674,0.00004206291],"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.00003240262,0.00003007799,0.00008303105,0.00002003283,0.00008376934,0.000003899321,0.0003540117,0.9594361,0.0001227894,0.0001936416,0.0001582033,0.03948206],"study_design_scores_gemma":[0.0008249094,0.00005596938,0.0008601281,0.0001018274,0.00002286974,0.0001640559,0.00005395604,0.9908316,0.0009864658,0.00007337856,0.00588665,0.0001381991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1375248,0.002522171,0.8362176,0.0009975838,0.0008011187,0.0002905671,0.00016879,0.00008484271,0.02139254],"genre_scores_gemma":[0.9634551,0.00114499,0.03489254,0.0001153616,0.0001386723,0.000001426917,0.0000466489,0.0000165357,0.0001887487],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8259303,"threshold_uncertainty_score":0.8393993,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001460828,0.0001191405,0.0001062786,0.00007532809,0.0007575316,0.0004768411,0.0002070303,0.00004412306,0.00000253737],"category_scores_gemma":[0.0001151535,0.00006846209,0.00004210075,0.000165075,0.00004314732,0.0001470856,0.00003064392,0.0002699123,0.000004896804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004008489,"about_ca_system_score_gemma":0.00001605499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001076442,"about_ca_topic_score_gemma":0.000009700359,"domain_scores_codex":[0.999013,0.00001748725,0.0003925888,0.00007434163,0.0001654008,0.0003372002],"domain_scores_gemma":[0.9992937,0.0003490372,0.0001222414,0.0001108744,0.00007560798,0.00004855326],"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.00002600803,0.00002020158,0.004529173,0.0001605311,0.00006652983,0.000004853259,0.01572986,0.7807469,0.00006241006,0.01644227,0.0009833792,0.1812279],"study_design_scores_gemma":[0.0006359853,0.0001623245,0.0005662002,0.0004015087,0.000005944833,0.0001542596,0.0005312279,0.8900248,0.0001398963,0.001375495,0.1058185,0.0001837704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7310985,0.0008578488,0.2167047,0.001371202,0.00350364,0.001393882,0.000003350443,0.000404064,0.04466285],"genre_scores_gemma":[0.9952453,0.00004849394,0.003886049,0.000268888,0.0004909181,0.000003798722,7.9694e-7,0.00002108858,0.00003469146],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2641468,"threshold_uncertainty_score":0.5826398,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004062642,0.0002094087,0.0002101753,0.0001251518,0.0001185198,0.0001328652,0.0001033624,0.0001320234,0.0000404808],"category_scores_gemma":[0.00001928844,0.0002084095,0.00005939571,0.0001522225,0.00003134899,0.0002566187,0.00002565092,0.0001784813,0.00001589727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003557833,"about_ca_system_score_gemma":0.000007652138,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001283757,"about_ca_topic_score_gemma":0.00001113977,"domain_scores_codex":[0.9988176,0.000009621864,0.0003160361,0.0002455869,0.0001309158,0.0004801936],"domain_scores_gemma":[0.999393,0.0002208109,0.00004394986,0.0001676521,0.00005079317,0.0001237769],"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.00003820853,0.0001264715,0.0007380048,0.0009126547,0.0003319458,0.00001925114,0.006285457,0.09888449,0.01092352,0.001761,0.003085419,0.8768936],"study_design_scores_gemma":[0.00249756,0.0001959045,0.0008603611,0.0002746675,0.00009647023,0.0001213965,0.0004587883,0.8573437,0.01962355,0.008130377,0.1089759,0.001421313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01799005,0.0003670433,0.9768158,0.0001025837,0.0005994524,0.0005214321,0.00002498152,0.0004441936,0.003134466],"genre_scores_gemma":[0.6277224,0.00008687621,0.3700938,0.0002956998,0.0004214149,0.00007221799,0.00006532247,0.0001612904,0.001081014],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8754722,"threshold_uncertainty_score":0.8498693,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002397538,0.0001679538,0.0001459978,0.0002549736,0.0001492278,0.0002252768,0.00006000884,0.0001171588,0.0004731575],"category_scores_gemma":[0.00003184174,0.0001441402,0.00004093985,0.0002265113,0.00001647751,0.0006096052,0.00001819162,0.000259095,0.00008041969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006266747,"about_ca_system_score_gemma":0.00002084922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001961925,"about_ca_topic_score_gemma":0.000004853689,"domain_scores_codex":[0.9990906,0.00001182653,0.0003611352,0.0001096208,0.0002319243,0.0001948528],"domain_scores_gemma":[0.9994703,0.0000481543,0.0001167624,0.0001198519,0.0001296789,0.0001152877],"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.00001457373,0.000009487069,0.001007247,0.00002319067,0.00002185379,0.00002479954,0.00009477265,0.990914,0.00002458298,0.0003783292,0.0004688151,0.007018292],"study_design_scores_gemma":[0.0007466832,0.00008726414,0.0001777266,0.000100782,0.000009497384,0.001186971,0.00002827971,0.9957025,0.0001269251,0.0001292677,0.001495504,0.000208603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2497326,0.0002284779,0.74028,0.0002540834,0.002042366,0.0004456546,0.000008816185,0.000377689,0.006630228],"genre_scores_gemma":[0.9642884,0.0003319347,0.03458285,0.0003513928,0.0001481555,0.000005019247,0.0000615635,0.00006609759,0.0001646206],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7145557,"threshold_uncertainty_score":0.5877869,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00013587,0.0004194097,0.0003444568,0.0002148405,0.00008408196,0.0001276073,0.0001959105,0.0005194076,0.02735555],"category_scores_gemma":[0.000003340476,0.0004349195,0.0001599784,0.00005325041,0.00005626803,0.00006751651,0.0000605671,0.0005544504,0.005332084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000728501,"about_ca_system_score_gemma":0.00003396159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001580512,"about_ca_topic_score_gemma":0.00003357094,"domain_scores_codex":[0.9985809,0.000009559354,0.0003976619,0.0003242621,0.0003144563,0.0003731863],"domain_scores_gemma":[0.9992898,0.00004753025,0.00004266433,0.0003927381,0.0001011818,0.0001260597],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000003043545,0.00001154057,0.00004861003,0.000250339,0.0001003817,0.00001855726,0.00006540077,0.6009743,0.00003331015,0.3652921,0.02926272,0.003939773],"study_design_scores_gemma":[0.0003169592,0.00003145942,0.00003647776,0.0002261698,0.00004482185,0.00001114226,0.000005071333,0.09124882,0.0001253337,0.0006721196,0.9065389,0.0007427065],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000005129276,0.0004815257,0.0466626,0.0001329896,0.0006381216,0.0002420833,0.00003970168,0.000433191,0.9513646],"genre_scores_gemma":[0.01004711,0.0007178466,0.005828127,0.0001115111,0.000387392,0.000003538874,0.0002354373,0.0001954173,0.9824736],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.8772762,"threshold_uncertainty_score":0.9998103,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001358458,0.00017895,0.0001785025,0.000081388,0.0001891294,0.0001972999,0.0001096521,0.00007607823,0.00001947324],"category_scores_gemma":[0.000003215395,0.0001472489,0.00001678759,0.0001880166,0.00005807439,0.0001717218,0.00001050976,0.0001002242,0.00002587441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006841919,"about_ca_system_score_gemma":0.00001341567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00043498,"about_ca_topic_score_gemma":0.00003103783,"domain_scores_codex":[0.9990528,0.00003823685,0.0002586678,0.0002690431,0.000129244,0.0002519988],"domain_scores_gemma":[0.9992881,0.00004294653,0.000039718,0.0003079637,0.0001405786,0.0001806286],"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.00001293019,0.0003048926,0.001820998,0.0009139613,0.0001369426,5.593703e-7,0.006195456,0.9600126,0.01510716,0.004331816,0.001404729,0.009757941],"study_design_scores_gemma":[0.0005642327,0.00005994055,0.0002480472,0.0000860214,0.000006456172,0.00001332952,0.0002578727,0.9913531,0.0004196377,0.0000152615,0.006753202,0.0002229238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00271181,0.000589838,0.9931818,0.00006961641,0.00005119862,0.002794851,0.00004191523,0.0003904737,0.000168525],"genre_scores_gemma":[0.9671525,0.00004056256,0.02615891,0.00003130431,0.00007485361,0.006207644,0.0001343394,0.00005973026,0.0001401304],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9670228,"threshold_uncertainty_score":0.6004637,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001320642,0.0001095608,0.00009502714,0.000128784,0.0008278057,0.0003452814,0.000182504,0.00004622171,0.0002708994],"category_scores_gemma":[0.00004321277,0.00007512651,0.00002462094,0.0003347528,0.0001722728,0.0002278488,0.00001988454,0.0002893749,0.00003188619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004347791,"about_ca_system_score_gemma":0.00009795764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000237172,"about_ca_topic_score_gemma":0.0001650799,"domain_scores_codex":[0.9988074,0.0001219934,0.0001605086,0.0001972405,0.0003594815,0.0003534033],"domain_scores_gemma":[0.9989106,0.0003429814,0.00000748202,0.0002477433,0.0003889998,0.0001021796],"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.00000345641,0.00001977172,0.00006761,0.0000113065,0.00002350031,5.16984e-7,0.0002116063,0.9292879,0.001224676,0.005936018,0.0002633856,0.06295033],"study_design_scores_gemma":[0.0004679086,0.00009863632,0.0000716455,0.00003066808,0.000005863767,0.00001340708,0.00008834985,0.9960629,0.0007162737,0.00009532561,0.0022308,0.0001181859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008509349,0.00005121941,0.9842901,0.0004455524,0.0001122341,0.0009312357,0.00004212221,0.0001775791,0.005440576],"genre_scores_gemma":[0.859951,0.000006116979,0.1391225,0.00004870072,0.000170534,0.0002271889,0.00009868562,0.00003993009,0.0003354025],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8514416,"threshold_uncertainty_score":0.6366896,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001592539,0.000062942,0.0000920746,0.00003311271,0.0002278122,0.00007074047,0.0002996865,0.00005507242,0.0004284591],"category_scores_gemma":[0.0001726396,0.00004124272,0.0001473709,0.0002375593,0.00006772488,0.0002110696,0.00004447737,0.0005243643,0.00002098379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001940007,"about_ca_system_score_gemma":0.0002737268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006203067,"about_ca_topic_score_gemma":0.000001382092,"domain_scores_codex":[0.9986311,0.0000873301,0.0002459916,0.00004878853,0.0008088348,0.0001779165],"domain_scores_gemma":[0.9991323,0.00009974977,0.00003909995,0.0001126675,0.0005430024,0.00007313365],"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.00001579204,0.0001015763,0.006243928,0.0001376578,0.0003700529,0.0000104348,0.02717146,0.6579022,0.004601837,0.002134967,0.2997113,0.001598725],"study_design_scores_gemma":[0.001009403,0.0001423886,0.02154656,0.0004269201,0.00002540241,0.0001415166,0.001499963,0.940402,0.005555236,0.002063147,0.0269269,0.0002605426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8621867,0.003885879,0.0358604,0.005245736,0.003605613,0.0009400036,0.00002445613,0.0002462121,0.08800501],"genre_scores_gemma":[0.9820259,0.0001003591,0.01659266,0.0001428157,0.0002028406,0.000003761161,7.647183e-7,0.00001776925,0.0009131421],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2824998,"threshold_uncertainty_score":0.4691326,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005838251,0.000101848,0.0001004515,0.00008829785,0.0001443516,0.0001902198,0.0002582193,0.00003962737,0.00009077325],"category_scores_gemma":[0.00004212594,0.00009718785,0.00002627849,0.0003142588,0.0003364485,0.0002876384,0.00002114976,0.00006559361,0.00005242779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004087485,"about_ca_system_score_gemma":0.000029903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.537321e-7,"about_ca_topic_score_gemma":4.531448e-8,"domain_scores_codex":[0.9991657,0.00002422965,0.0001441761,0.0002122487,0.0001679671,0.0002857274],"domain_scores_gemma":[0.9995338,0.00005760781,0.00001599157,0.0002072621,0.00005820579,0.0001271481],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000620102,0.0000263596,0.00002168149,0.00002620972,0.000003756329,3.315545e-7,0.0002012105,0.2501109,0.01322657,0.7330534,0.00008788722,0.003235423],"study_design_scores_gemma":[0.0002058185,0.00007887188,0.00002791758,0.00001197988,0.000002624772,0.000005203886,0.000001740526,0.9837121,0.01023853,0.005362841,0.0002114315,0.0001409024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03940375,0.000006670499,0.9550976,0.00002697901,0.0003298811,0.0001756357,0.00000217402,0.0002578326,0.004699485],"genre_scores_gemma":[0.7710934,6.549994e-7,0.2287654,0.00005758834,0.00005343822,0.000005992489,0.000003083178,0.00001233329,0.000008090927],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7336012,"threshold_uncertainty_score":0.3963206,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006026307,0.000102855,0.00009915698,0.00005204569,0.00003693264,0.00002889722,0.000085474,0.00004325614,0.00008048592],"category_scores_gemma":[0.000008876626,0.00008867042,0.00001781765,0.0001734172,0.0000164564,0.00006906506,0.00001053295,0.0001071705,0.00007541384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001431045,"about_ca_system_score_gemma":0.000005637155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009371729,"about_ca_topic_score_gemma":0.0000157267,"domain_scores_codex":[0.999512,0.00001257822,0.0001038359,0.0001086467,0.00009418192,0.000168792],"domain_scores_gemma":[0.999701,0.00003190213,0.00001655768,0.0001611361,0.00003122523,0.00005821874],"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.00001256649,0.0001345743,0.001035824,0.0001636049,0.0001415845,0.00001071897,0.0008034272,0.7050321,0.0008184609,0.002658922,0.009473987,0.2797143],"study_design_scores_gemma":[0.000414451,0.00005060025,0.0004550545,0.00004866202,0.00001250164,0.00001249549,0.00002403482,0.8925601,0.0008245139,0.0001117489,0.1052563,0.000229579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03080973,0.0002336746,0.881315,0.0008095019,0.0009016106,0.0003141669,0.00003601439,0.00382871,0.08175158],"genre_scores_gemma":[0.8672453,0.00003362047,0.1311037,0.0003724187,0.0003173375,0.000008727729,0.00007700394,0.00007988106,0.0007620708],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8364356,"threshold_uncertainty_score":0.3615875,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008151853,0.0007279338,0.002199525,0.0005530138,0.00005946861,0.000045825,0.0005740339,0.0002949575,0.0004921113],"category_scores_gemma":[0.0001419035,0.000759187,0.0005173117,0.001271602,0.00001317464,0.0001271082,0.0001907415,0.001536625,0.00002550609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006025907,"about_ca_system_score_gemma":0.00008007547,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002227458,"about_ca_topic_score_gemma":6.742595e-7,"domain_scores_codex":[0.9970403,0.0001176002,0.001150055,0.0005576354,0.0004708227,0.0006636002],"domain_scores_gemma":[0.9989986,0.0001198559,0.0001327223,0.0005497695,0.00001839261,0.0001807031],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[6.027437e-7,0.00002058675,1.55443e-7,0.07327042,0.0001669498,0.00004039448,0.00001296569,0.5523798,5.994069e-7,0.0003025502,0.00581758,0.3679874],"study_design_scores_gemma":[0.0001691438,0.00001268356,1.547046e-8,0.04103541,0.0002040702,0.00004451131,0.000001842958,0.1619508,4.678054e-7,0.00004435836,0.7958983,0.0006384152],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[4.072227e-8,0.9606453,0.03386881,0.00001071755,0.00332971,0.001092254,0.00002723278,0.0006786226,0.0003473016],"genre_scores_gemma":[6.19206e-7,0.9669608,0.03164456,0.00006259236,0.0001257176,0.0005997021,0.0002493642,0.0002848891,0.00007175357],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.7900807,"threshold_uncertainty_score":0.9994859,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004823836,0.0001420476,0.000128853,0.00008501181,0.0003579435,0.0003410703,0.0001437255,0.00006029195,0.00001245283],"category_scores_gemma":[0.00002580833,0.00008236067,0.0000404539,0.0001423642,0.00003239046,0.0001591787,0.00002041619,0.0006076411,0.000005293933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001662858,"about_ca_system_score_gemma":0.0000220202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002112796,"about_ca_topic_score_gemma":0.000003475503,"domain_scores_codex":[0.9992295,0.000004939141,0.0002617619,0.00007610524,0.0001598299,0.000267873],"domain_scores_gemma":[0.999337,0.0002547417,0.0001138158,0.0001028005,0.00009748437,0.00009422675],"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.0000106607,0.000008357406,0.0003650395,0.00004997204,0.00006861686,0.000002965196,0.001691881,0.4017515,0.0001860121,0.001302115,0.0002321513,0.5943308],"study_design_scores_gemma":[0.0009396694,0.000110761,0.0005018059,0.000153717,0.00001365413,0.0004152835,0.00005474735,0.9385872,0.000341705,0.0001590753,0.05852293,0.0001994429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03277739,0.00008670631,0.9601796,0.0003089892,0.0008319357,0.0003544044,0.000002815363,0.0001988374,0.005259342],"genre_scores_gemma":[0.9046798,0.00005216349,0.09407566,0.000532773,0.0005141559,0.000005883625,0.000002343692,0.00004738316,0.00008979822],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8719025,"threshold_uncertainty_score":0.3358571,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007315122,0.0001236921,0.0001728125,0.00004180088,0.00009284289,0.0001202649,0.0001071786,0.00005974937,0.00001028503],"category_scores_gemma":[0.0001417148,0.00008609775,0.00003473627,0.0001455377,0.00005555286,0.0001338257,0.00002823972,0.0001723761,0.000006223951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002783488,"about_ca_system_score_gemma":0.00000847879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007526978,"about_ca_topic_score_gemma":0.000007782868,"domain_scores_codex":[0.9991521,0.00003727309,0.0003763422,0.0001176883,0.0001356857,0.0001809097],"domain_scores_gemma":[0.999515,0.0001512572,0.00006898249,0.0001593739,0.00003746419,0.00006793807],"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.000007816571,0.00005619296,0.000004898748,0.0003657395,0.00005298563,0.000002939484,0.01099408,0.0179323,0.003268261,0.03544141,0.000004366319,0.931869],"study_design_scores_gemma":[0.0004836683,0.0001424102,0.00001105212,0.0004587414,0.00003237633,0.00009300052,0.001338924,0.9308717,0.01923033,0.04673723,0.0003591634,0.0002414514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009144701,0.00008410742,0.9893991,0.00008345889,0.00007808447,0.0002456758,0.00000116866,0.00022511,0.0007386126],"genre_scores_gemma":[0.220061,0.000008423529,0.7798103,0.00001489879,0.00002674175,0.00002679579,0.000004981977,0.00002581825,0.00002096475],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9316276,"threshold_uncertainty_score":0.3510964,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008621725,0.00008239915,0.0001262439,0.00004034413,0.00002107522,0.00001234672,0.00007968315,0.00004459679,0.00005140606],"category_scores_gemma":[0.00001517638,0.00007985308,0.00004504205,0.0001300285,0.00002344396,0.00006456019,0.000007890922,0.0000752228,0.00001097089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001773414,"about_ca_system_score_gemma":0.00000544405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000320876,"about_ca_topic_score_gemma":4.966146e-7,"domain_scores_codex":[0.9994958,0.00001083633,0.0001790948,0.00009519693,0.00008782677,0.000131246],"domain_scores_gemma":[0.9997155,0.0000204287,0.00002296923,0.0001746993,0.00002737154,0.00003902852],"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.00001258554,0.0002366699,0.001373654,0.0002126425,0.00007626222,0.000004716247,0.001700722,0.1973869,0.009022572,0.01035995,0.001901809,0.7777115],"study_design_scores_gemma":[0.0008545967,0.0001497969,0.0199612,0.0001220205,0.00003373164,0.00001279907,0.0001142403,0.8807839,0.07436653,0.01644798,0.006501027,0.0006521507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2035417,0.0009368396,0.6719252,0.0009977447,0.0009933563,0.0007182821,0.00005195962,0.0020197,0.1188152],"genre_scores_gemma":[0.9759235,0.00002124676,0.02392649,0.00003369981,0.00004051816,0.000002081567,0.000008101168,0.00001062509,0.00003368971],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7770594,"threshold_uncertainty_score":0.3256314,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009339667,0.0001048473,0.00008115081,0.000150985,0.00006761724,0.0000320428,0.0001369204,0.00009829922,0.00005366535],"category_scores_gemma":[0.00001511009,0.0001055658,0.00005872777,0.0003918633,0.00002307598,0.0001043077,0.000001148549,0.0002443813,0.00005651218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002341005,"about_ca_system_score_gemma":0.00001363328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003866338,"about_ca_topic_score_gemma":0.00002655493,"domain_scores_codex":[0.9994971,0.00001471623,0.0001151069,0.00009913611,0.0001339482,0.0001400655],"domain_scores_gemma":[0.9994739,0.00004068293,0.0000100745,0.0003153839,0.00004980533,0.0001101084],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000008868646,0.00005670348,0.000175042,0.00003424373,0.00005934646,0.000002616786,0.0008883981,0.9827644,0.0001102913,0.001581153,0.002460569,0.01185832],"study_design_scores_gemma":[0.005039585,0.0006408373,0.0009006325,0.0002482433,0.0002959091,0.0001094733,0.001658769,0.3441992,0.01279019,0.06837427,0.5631114,0.002631473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006762558,0.0002857323,0.9804246,0.0008410165,0.00140267,0.0001760421,0.00001702212,0.001342961,0.008747406],"genre_scores_gemma":[0.9926759,0.0001780085,0.006653892,0.0002536448,0.00003053833,0.00001511295,0.000006844548,0.00003536981,0.0001506831],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9859133,"threshold_uncertainty_score":0.4304849,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004750058,0.0001431554,0.0001428153,0.00008158478,0.000532133,0.0003161826,0.0001266774,0.00005702423,0.00003413059],"category_scores_gemma":[0.00004119159,0.0001052086,0.0001207118,0.000191612,0.00001676701,0.0001631475,0.00003240033,0.000395194,0.0000120379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001002052,"about_ca_system_score_gemma":0.00006237593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001110924,"about_ca_topic_score_gemma":0.000001413581,"domain_scores_codex":[0.998964,0.00001940953,0.0003964046,0.0000920897,0.0002493873,0.0002787531],"domain_scores_gemma":[0.9991523,0.0003605802,0.0001164716,0.0001046746,0.0001851619,0.00008079458],"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.00001378457,0.0000143391,0.00007475279,0.00002173699,0.00006661598,0.000006140569,0.0002633741,0.9738284,0.0002643103,0.006843178,0.0009725385,0.01763082],"study_design_scores_gemma":[0.001893944,0.00007646441,0.00009714138,0.000246864,0.00002234624,0.0003052307,0.00009909748,0.9827331,0.002368617,0.003861852,0.008069886,0.0002254969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1545965,0.0007937208,0.8007084,0.002411668,0.02046491,0.0009905453,0.00001727883,0.0007919942,0.019225],"genre_scores_gemma":[0.985348,0.00001563197,0.01342942,0.0004645851,0.0006672536,0.000002940678,0.00002016465,0.00003105479,0.00002094986],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8307515,"threshold_uncertainty_score":0.4290283,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000863405,0.0001462103,0.0001164569,0.0001042793,0.0001084765,0.00008392952,0.00006584555,0.00006810923,0.0001515299],"category_scores_gemma":[0.0000103631,0.0001406845,0.00002678332,0.0003342442,0.00001704345,0.0002875747,0.000006056087,0.00009450581,0.00001395818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005966212,"about_ca_system_score_gemma":0.0000111219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002096499,"about_ca_topic_score_gemma":0.000002653077,"domain_scores_codex":[0.9992068,0.00002667704,0.0001855681,0.0001754936,0.000218045,0.0001873954],"domain_scores_gemma":[0.9996576,0.00001751147,0.00004905828,0.0001542019,0.00005643536,0.00006524683],"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.0000256541,0.00001409148,0.0000682614,0.000009119767,0.00001461631,0.000001193266,0.0002144238,0.9964524,0.0003211737,0.0003668515,0.0006956907,0.001816537],"study_design_scores_gemma":[0.0005812672,0.0001044164,0.0003272823,0.00008961975,0.00002381886,0.000005869243,0.00004741199,0.9961895,0.001306772,0.00007802503,0.0009916611,0.0002543345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00570073,0.0001411232,0.9507948,0.0006341761,0.0001288731,0.0003620868,0.00001005892,0.0009286642,0.04129949],"genre_scores_gemma":[0.8359119,0.00004973165,0.1621702,0.0004181144,0.00009738463,0.00001487252,0.0007446456,0.00006432853,0.0005287465],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8302112,"threshold_uncertainty_score":0.5736946,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001441135,0.00008003943,0.00007186094,0.00001591464,0.0001173975,0.00005161078,0.00002725842,0.00002566762,0.000007160904],"category_scores_gemma":[0.00000151256,0.00005287711,0.000007732724,0.00006110564,0.00004426026,0.00004179353,0.0000100484,0.00005626274,0.00001395104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008728405,"about_ca_system_score_gemma":0.000005562155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.462216e-7,"about_ca_topic_score_gemma":0.00000278425,"domain_scores_codex":[0.9995922,0.000001996664,0.0001212838,0.00005099014,0.00009726338,0.0001362408],"domain_scores_gemma":[0.9997621,0.0000904392,0.00003406227,0.00005169363,0.0000205817,0.00004119163],"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.000007895019,0.00006760464,0.0003261946,0.0003420851,0.00009865304,4.513013e-7,0.00247823,0.6186057,0.0007311698,0.2748021,0.0008520839,0.1016878],"study_design_scores_gemma":[0.0004005611,0.00001674264,0.0003662893,0.00005952889,0.00002262053,0.00002780814,0.0001706241,0.9836958,0.0002381197,0.0143042,0.0005042105,0.000193478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04453172,0.000163774,0.9358588,0.00005219272,0.00008221511,0.0003376662,0.000001558741,0.0001847811,0.01878732],"genre_scores_gemma":[0.8575357,0.000006973175,0.1423653,0.00002124656,0.000023063,0.00001684622,0.000007187679,0.00001522905,0.000008514427],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8130039,"threshold_uncertainty_score":0.2156266,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002659541,0.00009396423,0.00007948623,0.00007416382,0.00007078372,0.00001787589,0.0001423215,0.00006509449,0.0003987936],"category_scores_gemma":[0.000009332113,0.00009661889,0.00004974628,0.0004461238,0.00002827832,0.00006629856,9.19807e-7,0.0002039721,0.00009785353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006185551,"about_ca_system_score_gemma":0.000004132209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002601371,"about_ca_topic_score_gemma":0.000006262225,"domain_scores_codex":[0.9995759,0.00001025353,0.0001118035,0.0001022297,0.00008988983,0.0001098948],"domain_scores_gemma":[0.99965,0.00003683215,0.000008810874,0.0001969049,0.00001922452,0.00008822803],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000009831441,0.00003761365,0.0001207233,0.00007526483,0.00008240632,0.000003740843,0.00114105,0.9753941,0.0004827319,0.002804885,0.006582665,0.01326497],"study_design_scores_gemma":[0.00172604,0.0004335137,0.0009359828,0.00007928724,0.0001587469,0.00001498025,0.000234908,0.4804213,0.005087075,0.004920957,0.5048295,0.001157692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001326311,0.00009784144,0.9853991,0.004151488,0.0004584519,0.0001500856,0.00002610884,0.001101413,0.00728924],"genre_scores_gemma":[0.9935329,0.0005244375,0.00405247,0.001706434,0.00004505973,0.00002116641,0.000009175051,0.00003480469,0.00007355319],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9922066,"threshold_uncertainty_score":0.4366511,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001204589,0.0001367594,0.00009632303,0.00006541939,0.0001961706,0.00007332443,0.00006724399,0.00004960099,0.0007519088],"category_scores_gemma":[0.000004265177,0.0001215582,0.0000277349,0.0001256914,0.00002607741,0.00042649,0.00002063189,0.0001412724,0.0001368539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005372664,"about_ca_system_score_gemma":0.00001618773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003266428,"about_ca_topic_score_gemma":0.00000796857,"domain_scores_codex":[0.9991907,0.00002115435,0.0001639315,0.0001077438,0.0001621626,0.0003542613],"domain_scores_gemma":[0.9996818,0.00002905289,0.00002063164,0.00009790253,0.0000532741,0.0001173719],"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.00001823023,0.0001275327,0.008899559,0.00009190767,0.00008686327,0.000001791355,0.001980495,0.9633502,0.001925085,0.01653664,0.00411451,0.002867196],"study_design_scores_gemma":[0.00287555,0.0002332054,0.02190436,0.0003909657,0.0001573085,0.0004796133,0.0006673007,0.8830364,0.002820502,0.0003750753,0.08485535,0.002204312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1854298,0.001261879,0.6396037,0.001406591,0.001610192,0.001050767,0.00009281379,0.001750953,0.1677933],"genre_scores_gemma":[0.9526069,0.00001122061,0.0466702,0.0001329735,0.0002190016,0.00004001439,0.0001075561,0.00003342221,0.0001787229],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.767177,"threshold_uncertainty_score":0.8232874,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009231098,0.00008828566,0.00007345309,0.000110116,0.00009904124,0.00007454739,0.00002228249,0.00004647415,0.000004776191],"category_scores_gemma":[0.000008630896,0.00008918382,0.00002129485,0.0001059686,0.000012716,0.0006612324,0.000007741667,0.00004746192,0.00002176345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003175609,"about_ca_system_score_gemma":0.00001322648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003809334,"about_ca_topic_score_gemma":0.000001825101,"domain_scores_codex":[0.9995037,0.000003995123,0.0002354064,0.00005410653,0.00009204503,0.0001107655],"domain_scores_gemma":[0.9997638,0.00001819704,0.00005153963,0.00003759375,0.00008804306,0.00004076021],"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.000003464971,0.000005230257,0.00001953296,0.0001176424,0.00000704874,3.369171e-8,0.001317609,0.9687999,0.00009187047,0.005426736,0.0001221561,0.0240887],"study_design_scores_gemma":[0.001085632,0.00002685421,0.0002284685,0.00004906282,0.00000470862,0.000006801431,0.0001126592,0.9911222,0.000422052,0.001406033,0.005403754,0.0001318076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01906975,0.00003739197,0.9787952,0.0001136348,0.0002104528,0.0003446537,0.00001204842,0.0003044224,0.001112441],"genre_scores_gemma":[0.9091993,0.00002957493,0.09006853,0.0002083276,0.00002950999,0.00004886552,0.0003881624,0.00001374571,0.00001400495],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8901295,"threshold_uncertainty_score":0.3636811,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006408776,0.0001329192,0.0001331546,0.0004452805,0.0001934758,0.0004190131,0.0002087496,0.00009200299,0.00006352409],"category_scores_gemma":[0.00001687876,0.0001336626,0.00002941984,0.0008751627,0.00004837363,0.000450545,0.00005046658,0.0003234501,0.00002058719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001891593,"about_ca_system_score_gemma":0.00004663066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002378422,"about_ca_topic_score_gemma":0.000252716,"domain_scores_codex":[0.998543,0.0001810166,0.0002960359,0.0002698417,0.0003246625,0.0003854573],"domain_scores_gemma":[0.9994096,0.00003900394,0.000007252506,0.0002738399,0.0001914786,0.00007883886],"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.000002846099,0.0001631416,0.0002088189,0.00001950139,0.000007718904,0.000002398295,0.0004503415,0.994146,0.0001043986,0.001226518,0.001051108,0.002617214],"study_design_scores_gemma":[0.0003651049,0.00004414586,0.0002805634,0.00002457085,0.000001824514,0.000003432536,0.00008135223,0.9948902,0.00006556787,0.00002945316,0.004066121,0.0001476664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005367372,0.0001672438,0.9837813,0.0002383531,0.0001667302,0.0008340476,0.000003781943,0.0002890329,0.009152093],"genre_scores_gemma":[0.6656798,0.00003970311,0.3329649,0.00004365925,0.0001633009,0.0002586614,0.0004435216,0.00004930244,0.000357177],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6603124,"threshold_uncertainty_score":0.5450602,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000444245,0.0001285132,0.0001467963,0.0003943647,0.00007615684,0.00008537278,0.0001956275,0.0001249795,0.00002721707],"category_scores_gemma":[0.00004909498,0.0001056999,0.00004162593,0.0005014155,0.00002863886,0.0001658991,0.000006410765,0.000917312,7.652869e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003471284,"about_ca_system_score_gemma":0.0003289137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008343588,"about_ca_topic_score_gemma":0.01708474,"domain_scores_codex":[0.9990135,0.00002544327,0.0004035119,0.00007368487,0.0001619455,0.0003218759],"domain_scores_gemma":[0.9996083,0.00004872186,0.00006874029,0.00009991173,0.0000480193,0.0001262997],"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":[4.84386e-7,0.000002698851,0.00198855,0.00002231889,0.00001206354,0.00004530505,0.001062675,0.9959828,0.0001909867,0.0001428651,0.00001270004,0.0005365168],"study_design_scores_gemma":[0.0009300205,0.00003133912,0.01160826,0.001324221,0.00002562937,0.001461302,0.0005544994,0.9824116,0.0001970341,0.0005357394,0.0005820093,0.0003383945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8506027,0.002938071,0.1416073,0.0009498093,0.001742979,0.0005223138,0.000007446267,0.0000618921,0.001567407],"genre_scores_gemma":[0.9759951,0.00001167151,0.02376572,0.00004915573,0.0001455008,0.000002726095,6.268129e-7,0.0000277271,0.000001723184],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1253924,"threshold_uncertainty_score":0.9533686,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001524062,0.0001162765,0.0001019796,0.00001667253,0.0001272438,0.00005300264,0.00004560814,0.00007257239,0.00000646599],"category_scores_gemma":[0.000002745695,0.00008166702,0.00001746577,0.00006877643,0.00003284804,0.000109772,0.00001379647,0.0001331644,9.114106e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009568793,"about_ca_system_score_gemma":0.000004377212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009905557,"about_ca_topic_score_gemma":0.00005111948,"domain_scores_codex":[0.9994696,0.00001008784,0.0001066691,0.00009528684,0.0000549569,0.000263407],"domain_scores_gemma":[0.9996274,0.0001633427,0.0000208753,0.00009210443,0.00002497861,0.000071292],"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.00001382237,0.00001153555,0.007621985,0.00005732895,0.0000775513,2.568064e-7,0.001220793,0.7233991,0.00000970682,0.0001046059,0.0006722231,0.2668111],"study_design_scores_gemma":[0.0005849453,0.00002623317,0.001527898,0.00004601428,0.00003163192,0.000009899257,0.00005226224,0.9897737,0.00001931021,0.00001620957,0.007776457,0.0001354603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008639148,0.004132618,0.986077,0.00003900324,0.0001938593,0.0004246899,0.000006354075,0.0001423931,0.0003449249],"genre_scores_gemma":[0.9612876,0.0007616492,0.03734316,0.00009211872,0.0003051438,0.00005974834,0.00001456899,0.00004138806,0.00009465381],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9526484,"threshold_uncertainty_score":0.3330284,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001052838,0.0001608223,0.0001678715,0.0002621523,0.0004544643,0.0002738041,0.0002242735,0.0001051852,0.0001710418],"category_scores_gemma":[0.00003676528,0.0001662377,0.00006383532,0.0004798608,0.00004040477,0.0001846503,0.00002772311,0.0003313224,0.0002356991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001687888,"about_ca_system_score_gemma":0.00006573644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001342692,"about_ca_topic_score_gemma":0.0000083582,"domain_scores_codex":[0.9983853,0.0002777329,0.0002307321,0.0002794033,0.0003138048,0.0005130513],"domain_scores_gemma":[0.9985106,0.0007154928,0.00001084125,0.0003458782,0.0002967178,0.0001204937],"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.00002650508,0.00005821964,0.00003408322,0.00003744636,0.00002481661,7.626964e-7,0.0001446698,0.9821889,0.0005217794,0.0005123696,0.01413559,0.002314811],"study_design_scores_gemma":[0.0008791774,0.0002174647,0.00007918864,0.00007892651,0.000004052873,8.235436e-7,0.00001591561,0.9958215,0.001099084,0.00004719448,0.001571361,0.0001853062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002719912,0.00003361796,0.9938741,0.0003120395,0.000693507,0.001474617,0.0000288933,0.000261911,0.0006013982],"genre_scores_gemma":[0.6912547,0.00001986521,0.3074721,0.0001792226,0.000169156,0.0001875295,0.0004669773,0.00005848347,0.0001919265],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6885348,"threshold_uncertainty_score":0.6778975,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007336334,0.00008402659,0.00006820977,0.00004025738,0.00006303392,0.00005425731,0.00005884213,0.00009375912,0.0001813325],"category_scores_gemma":[0.000002029192,0.00009076899,0.00001730749,0.0001552069,0.00001175579,0.0001409653,0.000007693076,0.0001454155,0.00001789815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002695552,"about_ca_system_score_gemma":0.000003935464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005526635,"about_ca_topic_score_gemma":0.00003629484,"domain_scores_codex":[0.9995204,0.00001752851,0.0001073451,0.0001004042,0.0000687922,0.0001854844],"domain_scores_gemma":[0.999764,0.00001189254,0.00001247597,0.0001371174,0.00001395555,0.00006056644],"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.00000396038,0.00000394735,0.0005427778,0.000003032459,0.000007082687,0.000002032798,0.00005459126,0.9786822,0.00001598767,0.0003480138,0.0009446866,0.01939172],"study_design_scores_gemma":[0.000161085,0.00001284484,0.001342578,0.00001470209,0.00000585373,0.00002243229,0.00002089704,0.993605,0.00001788648,0.0005476114,0.004131095,0.0001180473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03801974,0.000269508,0.9436379,0.00009924691,0.001180899,0.00009184948,8.263498e-7,0.0008212961,0.01587871],"genre_scores_gemma":[0.9783296,0.0002926261,0.02028476,0.0001224951,0.000629327,0.000005193364,0.00004320628,0.0000416937,0.0002510832],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9403099,"threshold_uncertainty_score":0.3701452,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002709173,0.0001211176,0.0001876204,0.0002013834,0.00002581064,0.0001120405,0.0002827145,0.00004565271,0.00003932136],"category_scores_gemma":[0.00001890212,0.0001077136,0.00007370925,0.0001094886,0.00002450409,0.0003836202,0.00003377772,0.0001633835,0.00001917549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007801801,"about_ca_system_score_gemma":0.00002345075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.625898e-7,"about_ca_topic_score_gemma":5.126161e-7,"domain_scores_codex":[0.9988633,0.00001817326,0.0004276031,0.000054087,0.0004729217,0.0001639507],"domain_scores_gemma":[0.9991572,0.00007519776,0.0002059876,0.0001043925,0.0003521451,0.0001050356],"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.00006950361,0.001338611,0.01525183,0.00100096,0.003217968,0.0002192109,0.03754668,0.8313853,0.003588169,0.02048563,0.00385996,0.08203623],"study_design_scores_gemma":[0.004414104,0.0003984431,0.008291907,0.003390598,0.000235121,0.005361479,0.0005256513,0.939384,0.007136618,0.01429697,0.01520041,0.001364652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1118247,0.0001559291,0.8862665,0.0001044659,0.0009503751,0.00006761349,0.000001584481,0.00007184158,0.000556921],"genre_scores_gemma":[0.8676379,0.00001711058,0.1316276,0.00007571202,0.0005998458,0.000001473384,0.000003898374,0.00003049711,0.000005921031],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7558132,"threshold_uncertainty_score":0.4392435,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002789607,0.0001492672,0.0002172663,0.0000819106,0.00004741767,0.0000336085,0.00008000341,0.00006828809,0.00005688711],"category_scores_gemma":[0.00005779979,0.0001111781,0.0000666934,0.0001188686,0.00005588569,0.0000384088,0.00001483509,0.0001187352,0.00000706121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004035425,"about_ca_system_score_gemma":0.000008421131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007467865,"about_ca_topic_score_gemma":0.000003565215,"domain_scores_codex":[0.9992828,0.000008208395,0.0002508654,0.00008902968,0.000117692,0.0002513876],"domain_scores_gemma":[0.9992369,0.0004407183,0.00007801914,0.0001836068,0.00001392214,0.00004679157],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009027952,0.0003712928,0.001192261,0.002142352,0.0003108293,7.156385e-7,0.02149093,0.1370531,0.01024257,0.7750585,0.0003195244,0.05172765],"study_design_scores_gemma":[0.00757426,0.0008051205,0.01826314,0.003703499,0.0002386093,0.00002990566,0.005127941,0.7540325,0.04076741,0.1668533,0.0001176748,0.002486654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7832102,0.00004627445,0.1861524,0.00003318785,0.0001085929,0.001078396,0.00007480651,0.0001082639,0.0291879],"genre_scores_gemma":[0.997605,0.000005806098,0.002229045,0.00002034376,0.00003487951,0.00005021894,0.00001157121,0.00004037462,0.000002799633],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6169794,"threshold_uncertainty_score":0.4533713,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009074321,0.000360426,0.0003307367,0.0003875728,0.0001154209,0.0001339025,0.0004878213,0.0003214913,0.00002235461],"category_scores_gemma":[0.00008722686,0.0003442069,0.00009614081,0.0002671332,0.0001784323,0.0001458307,0.0001197844,0.0004850912,0.00001171233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002164091,"about_ca_system_score_gemma":0.0001951201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009103145,"about_ca_topic_score_gemma":0.00007763968,"domain_scores_codex":[0.997857,0.000006076992,0.0005003475,0.0007107708,0.0004496182,0.0004761422],"domain_scores_gemma":[0.9987152,0.0003831331,0.0001027111,0.0004928241,0.0001574835,0.000148648],"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.000009365594,0.000004549213,0.000005707104,0.00008250506,0.000005972916,0.000001755669,0.0002202828,0.8065566,0.00003536206,0.0005871156,0.000126921,0.1923638],"study_design_scores_gemma":[0.0006258287,0.00007941228,0.00001976986,0.0004766663,0.000008200876,0.0000137459,4.924978e-8,0.9226955,0.0008186977,0.06201823,0.01267445,0.0005694939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001283811,0.000273744,0.9888709,0.0001353132,0.001524323,0.0006267233,0.00002023458,0.0002656638,0.008270323],"genre_scores_gemma":[0.01876174,0.00002254476,0.9787966,0.0004163239,0.0008124002,0.000009883528,0.00006892429,0.00009274346,0.001018855],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1917943,"threshold_uncertainty_score":0.999901,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003875484,0.000139864,0.000134571,0.0001840964,0.0004409291,0.0002266692,0.0003378403,0.00003259078,0.0001452733],"category_scores_gemma":[0.0008680125,0.00007738049,0.00007768394,0.0001984742,0.0001058955,0.0006674994,0.00003074888,0.0003399175,0.00003832256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000846643,"about_ca_system_score_gemma":0.0001135255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001742429,"about_ca_topic_score_gemma":0.000002801565,"domain_scores_codex":[0.9976256,0.0007258154,0.000492968,0.0001716946,0.0007099312,0.0002739489],"domain_scores_gemma":[0.9963306,0.001739945,0.00007771892,0.0001858827,0.001517238,0.0001486491],"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.0001681993,0.00016342,0.0009296609,0.0000369186,0.0001391467,0.000007531139,0.001311596,0.8791366,0.08653414,0.004390482,0.01483536,0.01234693],"study_design_scores_gemma":[0.003477618,0.0007589275,0.005266807,0.0001538155,0.00001829292,0.00009310085,0.0001855899,0.9293881,0.004933377,0.0001042307,0.05530743,0.0003127118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01689723,0.0003034724,0.9750347,0.001955823,0.0003117185,0.0008237573,0.00005599751,0.00005035201,0.004566964],"genre_scores_gemma":[0.9084443,0.0001074627,0.08964273,0.00008574635,0.0007966363,0.00002460419,0.00003348986,0.00005729029,0.0008077084],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8915471,"threshold_uncertainty_score":0.3391315,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003538519,0.0004316853,0.0005485335,0.0002941456,0.0001956567,0.0003326916,0.0004492919,0.0001641288,0.00004445929],"category_scores_gemma":[0.0001662073,0.0003996271,0.00007316824,0.0002953388,0.00004456774,0.0002103456,0.00009034635,0.0003530546,0.00005891469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001070478,"about_ca_system_score_gemma":0.00001672211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001783669,"about_ca_topic_score_gemma":0.00003777364,"domain_scores_codex":[0.9979209,0.0000158964,0.0006556499,0.000392069,0.0003506331,0.0006648807],"domain_scores_gemma":[0.9987162,0.000113675,0.00009533354,0.0007769247,0.0000496239,0.000248237],"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.000006605874,0.00006041021,0.0004326731,0.0006089813,0.00003910264,0.000007086695,0.0007229765,0.9941593,0.0006511595,0.00100123,0.00003620247,0.002274263],"study_design_scores_gemma":[0.00245973,0.0000365075,0.001257646,0.0007988667,0.00002581647,0.0000151538,0.00001861405,0.9920642,0.0001584154,0.002252429,0.0003330414,0.0005795626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0041401,0.00008424846,0.9914114,0.00007975356,0.0001623228,0.001547376,0.00001122368,0.0006162728,0.001947322],"genre_scores_gemma":[0.6700163,0.00001094807,0.3292691,0.00001426182,0.00005434943,0.0004470713,0.000014896,0.0001221859,0.00005087176],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6658762,"threshold_uncertainty_score":0.9998456,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002590876,0.0001124611,0.00009474437,0.00001914123,0.0001595553,0.0000546927,0.00007090186,0.00007580817,0.00001920908],"category_scores_gemma":[0.000002994846,0.00007802997,0.00002207838,0.0001011984,0.00002056876,0.0001154996,0.00001881357,0.0001812022,0.000002640102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001439497,"about_ca_system_score_gemma":0.000007290995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004738752,"about_ca_topic_score_gemma":0.00004388416,"domain_scores_codex":[0.999308,0.00001526305,0.0001084183,0.000094877,0.00007892417,0.0003944486],"domain_scores_gemma":[0.9995618,0.0001838506,0.0000153499,0.0001232883,0.00003695404,0.00007879168],"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.00002054259,0.0000177866,0.03918775,0.00005261856,0.00005410043,2.120729e-7,0.001343339,0.9512854,0.000009979227,0.0008193396,0.0006715589,0.006537429],"study_design_scores_gemma":[0.000691598,0.00003021621,0.002771108,0.00003724306,0.00002381696,0.000003847524,0.000179404,0.9890074,0.00003679503,0.000009904175,0.007073642,0.0001349875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01842105,0.002898898,0.9760957,0.00005938453,0.0002168137,0.0005721453,0.00001116437,0.0001872197,0.001537565],"genre_scores_gemma":[0.9947367,0.0003336261,0.004370584,0.00007774628,0.0002856326,0.00004534694,0.00002335165,0.0000432766,0.00008376279],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9763156,"threshold_uncertainty_score":0.318197,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006277828,0.00009923556,0.00008587579,0.0004026101,0.0001289152,0.0001515809,0.0002413524,0.00007898262,0.002321501],"category_scores_gemma":[0.00005835717,0.0001094383,0.00004217031,0.0004412027,0.00004043315,0.0003882737,0.000004175995,0.0004865932,0.0001792729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004834936,"about_ca_system_score_gemma":0.0001479322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003050838,"about_ca_topic_score_gemma":0.00007101549,"domain_scores_codex":[0.9984195,0.00004715666,0.0002645905,0.0001827528,0.0008292759,0.0002567149],"domain_scores_gemma":[0.9992963,0.0001175164,0.00000745297,0.0001141225,0.0003978327,0.00006676847],"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.00001421069,0.00006528853,0.0001080834,0.000003714611,0.00001486263,0.000006504544,0.0002849172,0.9880625,0.0015239,0.002678456,0.00076658,0.006470958],"study_design_scores_gemma":[0.0006533479,0.00004875181,0.003451525,0.00005768917,0.000001791808,0.00002658187,0.0001083758,0.9496263,0.001933275,0.0006136521,0.04327933,0.0001993851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03688787,0.0003092275,0.7173389,0.01053487,0.001854624,0.0005815776,0.00007142746,0.0004649304,0.2319566],"genre_scores_gemma":[0.9859372,0.0001922754,0.01024429,0.0001321695,0.0001345768,0.00004002049,0.00003516952,0.00001515391,0.003269104],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9490494,"threshold_uncertainty_score":0.9985905,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001564567,0.0001207182,0.0003349784,0.0001812664,0.00001402299,0.00002818179,0.00007556009,0.00007234551,0.00001355403],"category_scores_gemma":[0.0002904594,0.0001180982,0.00004638084,0.0001304812,0.00001211962,0.000245391,0.000004447143,0.000238316,3.238997e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009541213,"about_ca_system_score_gemma":0.00001693817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001241509,"about_ca_topic_score_gemma":0.00000162703,"domain_scores_codex":[0.9986847,0.00005466,0.0008530773,0.00008377085,0.0001430162,0.0001807737],"domain_scores_gemma":[0.9994736,0.00009016882,0.0001535674,0.0001161643,0.0001067409,0.00005971902],"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.000005433297,0.000009523174,0.0003135836,0.0004216817,0.00001648792,0.000001675079,0.000255058,0.9975483,0.000618784,0.0007104513,0.00000747559,0.00009156812],"study_design_scores_gemma":[0.0003810254,0.00001578279,0.0001254867,0.0003939647,0.00000574032,0.0000323563,0.0002232199,0.9967077,0.001792852,0.00006534222,0.0001296503,0.000126898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2561338,0.0008669951,0.7417042,0.00002000893,0.0005070479,0.00009770117,0.000002311413,0.0000345447,0.00063335],"genre_scores_gemma":[0.9786188,0.0004691844,0.02084817,0.000004743769,0.00002002237,0.000001879042,5.592597e-7,0.00001993591,0.00001668447],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7224851,"threshold_uncertainty_score":0.4815904,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000815127,0.00008351196,0.0001338005,0.0004090903,0.0003829456,0.000285351,0.0002412208,0.0000457839,0.00006937351],"category_scores_gemma":[0.00008121521,0.00006461242,0.00006795676,0.001443165,0.00007931451,0.0001528734,0.00001617495,0.0001380565,0.000004075252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004207261,"about_ca_system_score_gemma":0.0000944046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000280732,"about_ca_topic_score_gemma":0.0003649349,"domain_scores_codex":[0.9990515,0.0001038401,0.000210161,0.0001614427,0.0002316373,0.0002414303],"domain_scores_gemma":[0.9989833,0.0002303325,0.000009403768,0.0003225669,0.000398064,0.00005638755],"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.000003150691,0.00004011627,0.0002032677,0.00003629872,0.0002016554,2.279489e-7,0.0007785988,0.9879604,0.0008734852,0.008048424,0.001051874,0.0008025027],"study_design_scores_gemma":[0.0001398323,0.00006773155,0.0002676432,0.00001738609,0.00004699884,7.968954e-7,0.0001426473,0.9949522,0.0008290356,0.00006696819,0.003387519,0.00008123634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03953164,0.000345865,0.9574953,0.0002448087,0.000199402,0.0009333082,0.00001941143,0.0001062195,0.001124018],"genre_scores_gemma":[0.973033,0.00006829169,0.02649433,0.0000277401,0.00003053053,0.0001207351,0.00003880941,0.00002089808,0.0001657292],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9335013,"threshold_uncertainty_score":0.2945347,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001196427,0.00008067251,0.00006527564,0.00008419597,0.00005885858,0.00002800903,0.0001292248,0.0000725279,0.0001345484],"category_scores_gemma":[0.0001499658,0.00005025562,0.00002701613,0.0003455119,0.00002035089,0.00008840558,0.000007720475,0.0001115454,0.000001499582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000326874,"about_ca_system_score_gemma":0.00001256894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001284591,"about_ca_topic_score_gemma":0.00001398173,"domain_scores_codex":[0.9992939,0.00005389349,0.0001894701,0.00006352182,0.0002457889,0.000153455],"domain_scores_gemma":[0.9991882,0.000440286,0.00003904216,0.0002295634,0.00008780864,0.00001513918],"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.000002758854,0.00002558248,0.009034604,0.00003810059,0.00001466401,6.043729e-9,0.00074593,0.9756515,4.931022e-7,0.01287372,0.0002171884,0.001395426],"study_design_scores_gemma":[0.0002572011,0.000006057395,0.01447667,0.00002676089,0.0000374248,7.326773e-8,0.0003466703,0.9837561,0.00005654752,0.0004239174,0.0005482153,0.00006436537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004673156,0.0002302993,0.9894165,0.001321636,0.0002296355,0.001553448,0.000005898767,0.00005774624,0.002511723],"genre_scores_gemma":[0.9719847,0.00001054129,0.02738386,0.0002050661,0.00009298823,0.0002338662,0.00002751169,0.00001534628,0.00004616362],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9673115,"threshold_uncertainty_score":0.2049365,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008593153,0.0003726516,0.0003927313,0.0001233855,0.00008856835,0.0001318422,0.0002456334,0.0001291206,0.00004826837],"category_scores_gemma":[0.00009452704,0.0004270491,0.00008494299,0.0004816537,0.00002030384,0.0006966649,0.00006700583,0.0003745726,0.00004085628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001094997,"about_ca_system_score_gemma":0.00002382036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000039187,"about_ca_topic_score_gemma":7.117397e-7,"domain_scores_codex":[0.9984377,0.000008333203,0.0006807286,0.0001393155,0.0002683041,0.0004656106],"domain_scores_gemma":[0.9992225,0.00008256871,0.0001025469,0.0002949541,0.00006768484,0.0002297035],"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.000003016339,0.000003470949,0.00002942606,0.0002418868,0.00008251543,0.000003289462,0.003204039,0.9917118,0.001769787,0.0000983255,0.00003761311,0.002814808],"study_design_scores_gemma":[0.00041383,0.00001856815,0.00001667266,0.0001514149,0.0000602408,0.000004919397,0.0001614553,0.9834079,0.001784133,0.00000880794,0.01348008,0.0004920189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01000946,0.0004601989,0.9861107,0.00001725,0.0006456747,0.0001961143,0.00005204582,0.001351517,0.001157076],"genre_scores_gemma":[0.2249223,0.0001679605,0.7743853,0.0001750692,0.000143259,0.000008160756,0.00008085772,0.0001111129,0.000006071532],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2149128,"threshold_uncertainty_score":0.9998181,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008620859,0.0001390641,0.0001478192,0.00007118857,0.001591409,0.0009012691,0.0002011372,0.00006243234,0.000006671161],"category_scores_gemma":[0.0001461299,0.0000920075,0.00005854672,0.00005533947,0.00002587563,0.0002685691,0.00004086478,0.0003735747,0.000002465117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004853304,"about_ca_system_score_gemma":0.00002454939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004206272,"about_ca_topic_score_gemma":0.00000176249,"domain_scores_codex":[0.9991878,0.00001130166,0.000309051,0.00008958708,0.0001430951,0.000259225],"domain_scores_gemma":[0.9991026,0.0002489224,0.0003240575,0.0001216709,0.0001327975,0.00006993434],"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.00001878282,0.000006039082,0.0009783232,0.00007035894,0.00008516631,0.000001956629,0.0008552555,0.7555943,0.00009097083,0.0006920485,0.0002397324,0.2413671],"study_design_scores_gemma":[0.0005755965,0.00009450907,0.0007611046,0.0002194964,0.00001819597,0.0002477174,0.00005767975,0.9923177,0.0002581074,0.0002528806,0.005063645,0.000133361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01460084,0.0002434211,0.9811156,0.0004117113,0.0007158212,0.0005132708,0.00000107644,0.0001737507,0.002224487],"genre_scores_gemma":[0.824193,0.00004487882,0.1749645,0.0001389727,0.0005258119,0.00001049414,0.000001364884,0.0000385914,0.00008235177],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8095922,"threshold_uncertainty_score":0.9997084,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002362774,0.0003369607,0.0002667691,0.000192691,0.0001835624,0.0002170199,0.0002187336,0.000178355,0.00003772611],"category_scores_gemma":[0.000006511974,0.0003373019,0.0001153105,0.0002845488,0.00004081532,0.000383274,0.0000139483,0.000166574,0.00004851236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001118217,"about_ca_system_score_gemma":0.00001934395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002401956,"about_ca_topic_score_gemma":0.00000525147,"domain_scores_codex":[0.998365,0.00004086063,0.0004133759,0.0003970546,0.0002873436,0.0004963777],"domain_scores_gemma":[0.9992401,0.0000653622,0.00008013572,0.0004004358,0.00009059987,0.000123369],"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.00001276793,0.0001375838,0.00007903466,0.0001336984,0.00006335908,0.000004187907,0.0002425289,0.8815109,0.00418216,0.002369948,0.001773908,0.1094899],"study_design_scores_gemma":[0.0008240507,0.0001926222,0.000134336,0.00005223328,0.00003407502,0.000006212303,0.00003182553,0.9872912,0.004375192,0.000710742,0.00588572,0.0004617734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007556271,0.0001041096,0.9850903,0.0001275764,0.0009192692,0.0007267048,0.0001641631,0.001015458,0.01109679],"genre_scores_gemma":[0.2730432,0.0001296887,0.7195329,0.0002511725,0.00207195,0.0004915741,0.002659757,0.0004041378,0.001415591],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2722876,"threshold_uncertainty_score":0.9999079,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002967116,0.0002821973,0.0002310697,0.0002324033,0.0002311351,0.0001822664,0.0005144439,0.000205829,0.00003313865],"category_scores_gemma":[0.00002799252,0.0002226922,0.00008519211,0.0002045483,0.0002015421,0.0001554581,0.00008769197,0.0003559299,0.00002600701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001384035,"about_ca_system_score_gemma":0.00009273361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002572795,"about_ca_topic_score_gemma":0.000008160205,"domain_scores_codex":[0.9987015,0.000006486836,0.0002792023,0.0003884699,0.0003022485,0.0003220502],"domain_scores_gemma":[0.9991432,0.0002563387,0.0000864638,0.0003558704,0.0001095806,0.00004859201],"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.000003286176,0.000003722821,0.000005734735,0.00008038963,0.00001111401,0.000001330004,0.0007154061,0.8650153,0.00009777507,0.0001180475,0.0007481732,0.1331998],"study_design_scores_gemma":[0.0001838897,0.00002785081,0.00000606607,0.0001938325,0.000006419624,0.00001766953,8.514476e-8,0.9830505,0.0003582397,0.0008721527,0.01499467,0.0002886147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001200908,0.0004561446,0.9941858,0.000236224,0.0005311327,0.0007308549,0.00001032557,0.0002200771,0.003617412],"genre_scores_gemma":[0.04417531,0.0002490967,0.9516403,0.0006995398,0.001507618,0.00009715959,0.00008773236,0.0001867079,0.00135653],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1329111,"threshold_uncertainty_score":0.9081126,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007792157,0.00009758362,0.0001888803,0.000249952,0.0002228667,0.0003194941,0.0001908883,0.00003203641,0.0001579249],"category_scores_gemma":[0.00009868884,0.00008724222,0.00006454567,0.0008008621,0.0001274343,0.000513528,0.00001976767,0.0002598795,0.00002292949],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000963984,"about_ca_system_score_gemma":0.0001104995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005135353,"about_ca_topic_score_gemma":0.000006746508,"domain_scores_codex":[0.9986541,0.0001230021,0.0004164471,0.0001049357,0.0003654527,0.0003360478],"domain_scores_gemma":[0.9982326,0.0001221563,0.00004548372,0.0001467803,0.001290331,0.0001626738],"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.000003109927,0.00003825485,0.00003566717,0.000009206074,0.00003879975,8.850566e-7,0.0004578028,0.8976051,0.000625279,0.0001355717,0.0009395956,0.1001107],"study_design_scores_gemma":[0.0004042574,0.0003577812,0.00003980881,0.00003982534,0.000008059431,0.00002207764,0.0007823248,0.9956167,0.001273495,0.00006739428,0.001285996,0.0001022864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01961863,0.0001706394,0.9783022,0.0008262228,0.0000939137,0.0005560065,0.000007551015,0.00004683917,0.0003779817],"genre_scores_gemma":[0.5394927,0.0001929745,0.459742,0.00003694655,0.0001441146,0.0001109037,0.00001049157,0.00003896237,0.0002309646],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.519874,"threshold_uncertainty_score":0.3557635,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}