{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":263,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":263,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"1a9f3bd2850a","filters":{"topic":"Optimization and Mathematical Programming"}},"results":[{"id":"W178407265","doi":"10.1007/978-1-4419-1665-5","title":"Handbook of Metaheuristics","year":2010,"lang":"en","type":"book","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":1600,"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; Polytechnique Montréal","funders":"","keywords":"Metaheuristic; Philosophy; Computer science; Artificial intelligence","authors":[{"name":"Michel Gendreau","is_ca":true},{"name":"Jean‐Yves Potvin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04779527468722992,"gpt":0.3949777228414696,"spread":0.3471824481542397,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006997465,0.002223587,0.002587877,0.002632517,0.0005475088,0.002946213,0.003089151,0.001769818,0.06518848],"category_scores_gemma":[0.001711922,0.001274051,0.00124225,0.005559523,0.0006384194,0.002554059,0.001470199,0.003593398,0.05091326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007735228,"about_ca_system_score_gemma":0.001532334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001758427,"about_ca_topic_score_gemma":0.003297065,"domain_scores_codex":[0.9993377,0.00007494364,0.00005289862,0.0001160595,0.000377205,0.00004120122],"domain_scores_gemma":[0.9993136,0.0002815137,0.00004125593,0.0001453661,0.0001829758,0.0000353277],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003889448,0.000105394,0.0001192417,0.001128101,0.00008667114,0.00005583654,0.00005523847,0.01741335,0.002016354,0.03814224,0.2489384,0.6919003],"study_design_scores_gemma":[0.00003725905,0.00006475545,0.0004077411,0.0005145784,0.00004653825,0.0004312049,0.00003031671,0.02571541,0.001506083,0.05851978,0.912676,0.00005022281],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.001339839,0.1497179,0.5500793,0.00181872,0.003480773,0.0003187459,0.004064173,0.008143855,0.2810367],"genre_scores_gemma":[0.01593905,0.1028361,0.5876329,0.001859132,0.001699578,0.0007860175,0.008720096,0.003222954,0.2773041],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.06518848,"threshold_uncertainty_score":0.2180772,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4206262260","doi":"10.3390/math10020283","title":"Transformation and Linearization Techniques in Optimization: A State-of-the-Art Survey","year":2022,"lang":"en","type":"article","venue":"Mathematics","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":229,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal; Dalhousie University","funders":"","keywords":"Linearization; Transformation (genetics); Mathematical optimization; Optimization problem; Multiplication (music); Mathematics; Computer science; Piecewise linear function; Nonlinear system","authors":[{"name":"Mohammad Asghari","is_ca":true},{"name":"Amir M. Fathollahi‐Fard","is_ca":true},{"name":"Seyed Mohammad Javad Mirzapour Al-e-Hashem","is_ca":false},{"name":"Maxim A. Dulebenets","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01296940109311131,"gpt":0.2196650017124081,"spread":0.2066956006192968,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00180803,0.002012419,0.001940984,0.002259902,0.0005384139,0.002379544,0.001536386,0.001266738,0.005638844],"category_scores_gemma":[0.004035298,0.0009658295,0.002139935,0.00648547,0.001290688,0.003657503,0.00129242,0.002450973,0.002837554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008395647,"about_ca_system_score_gemma":0.001251444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002310652,"about_ca_topic_score_gemma":0.001334456,"domain_scores_codex":[0.9988142,0.0003073701,0.0001391072,0.000257703,0.0004142971,0.00006724817],"domain_scores_gemma":[0.9976031,0.001814407,0.0001245006,0.0001606444,0.0002704581,0.00002690933],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006682075,0.0001231037,0.0007732895,0.01102561,0.0001590183,0.0001789352,0.0003155093,0.04911633,0.002251238,0.1096214,0.01535547,0.8110133],"study_design_scores_gemma":[0.00004074532,0.0003951337,0.002109375,0.004836701,0.0003605641,0.001538993,0.0005639489,0.2331267,0.007054063,0.1797526,0.569941,0.0002801353],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.002555781,0.4883561,0.4886547,0.001454897,0.0005878727,0.00006339916,0.0001487416,0.0004861434,0.01769248],"genre_scores_gemma":[0.06076215,0.7797697,0.1508252,0.0006414155,0.00170991,0.0001716227,0.0005131409,0.0004340719,0.005172797],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.005638844,"threshold_uncertainty_score":0.0188638,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3140227716","doi":"10.1007/978-3-642-11474-8_11","title":"Chance Constrained Programming","year":2010,"lang":"en","type":"book-chapter","venue":"","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":175,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Decision maker; Computer science; Constraint (computer-aided design); Constraint programming; Mathematical optimization; Stochastic programming; Mathematical economics; Operations research; Mathematics","authors":[{"name":"David L. Olson","is_ca":false},{"name":"Desheng Wu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01168510702081728,"gpt":0.2046923402391704,"spread":0.1930072332183532,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003875699,0.001322232,0.0008934172,0.0007985553,0.0005774477,0.002102343,0.0009072307,0.0009360184,0.03578178],"category_scores_gemma":[0.001078029,0.0004614229,0.0005230742,0.001531835,0.001097505,0.001901073,0.0009111167,0.002584793,0.01058998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001396387,"about_ca_system_score_gemma":0.001149478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001741748,"about_ca_topic_score_gemma":0.003173351,"domain_scores_codex":[0.9996644,0.00007291331,0.000009909142,0.00005515744,0.000172843,0.00002480067],"domain_scores_gemma":[0.9997864,0.0001058952,0.00001268498,0.00002953886,0.0000470673,0.00001838356],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001248977,0.00003364059,0.00005964846,0.0001403394,0.00001578251,0.00004212431,0.00004510538,0.01366815,0.0003815781,0.6725788,0.1678133,0.1452091],"study_design_scores_gemma":[0.000005242002,0.00001288746,0.0001539869,0.0001723702,0.000009303795,0.00009128287,0.00002432839,0.01760101,0.0003953691,0.5725165,0.4089995,0.00001823535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.001129901,0.01461101,0.1876953,0.002331184,0.001394034,0.00004263169,0.000293353,0.0003251314,0.7921774],"genre_scores_gemma":[0.0483823,0.02254037,0.06276891,0.001333951,0.001906189,0.0001942614,0.0006878081,0.0006945255,0.8614917],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.03578178,"threshold_uncertainty_score":0.1197019,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139575211","doi":"10.1287/ijoc.12.3.223.12638","title":"A Simplex-Based Tabu Search Method for Capacitated Network Design","year":2000,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":167,"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; Université du Québec à Montréal","funders":"","keywords":"Tabu search; Mathematical optimization; Simplex; Integer programming; Set (abstract data type); Network planning and design; Integer (computer science); Mathematics; Column generation; Computer science; Fixed charge; Algorithm; Combinatorics","authors":[{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Judith M. Farvolden","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04292685753506973,"gpt":0.3050822956265041,"spread":0.2621554380914344,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001225729,0.001194153,0.001192875,0.001440955,0.0008240129,0.0009710818,0.001280752,0.001148598,0.007239245],"category_scores_gemma":[0.003930082,0.0007674427,0.0006585634,0.002723793,0.0005648971,0.0007245851,0.0008054352,0.001303637,0.001787493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000840631,"about_ca_system_score_gemma":0.001646204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006000961,"about_ca_topic_score_gemma":0.005310485,"domain_scores_codex":[0.9992034,0.0004806602,0.00001855249,0.00005425315,0.0002009649,0.00004215965],"domain_scores_gemma":[0.9988888,0.0007011346,0.00006525282,0.00007893318,0.0002332316,0.00003258348],"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.00006849281,0.00005334358,0.0002236048,0.00009152642,0.00005076225,0.00002499102,0.00005121809,0.8618448,0.000953318,0.009965228,0.003375842,0.1232969],"study_design_scores_gemma":[0.00001321796,0.0000169271,0.00002752336,0.00000775626,0.000004909984,0.000008453397,0.000006386128,0.9959014,0.0002579493,0.002568696,0.001181652,0.000005162606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004806411,0.0003620179,0.9892305,0.0000739589,0.00004361927,0.0001068658,0.0001344263,0.001036775,0.00420549],"genre_scores_gemma":[0.1052816,0.0003426898,0.8900179,0.00009245845,0.00003248124,0.0007554184,0.0003527555,0.0004759777,0.002648688],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007239245,"threshold_uncertainty_score":0.02421772,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2482729627","doi":"10.1016/j.compenvurbsys.2016.07.002","title":"An improved Genetic Algorithm for spatial optimization of multi-objective and multi-site land use allocation","year":2016,"lang":"en","type":"article","venue":"Computers Environment and Urban Systems","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":137,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Graduate Research and Innovation Projects of Jiangsu Province; Natural Sciences and Engineering Research Council of Canada; University of British Columbia; National Natural Science Foundation of China","keywords":"Crossover; Genetic algorithm; Robustness (evolution); Land use; Computer science; Land-use planning; Mathematical optimization; Optimal allocation; Spatial planning; Set (abstract data type); Operations research; Geography; Engineering; Mathematics; Environmental planning; Artificial intelligence; Civil engineering","authors":[{"name":"Xin Li","is_ca":true},{"name":"Lael Parrott","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01176985478876353,"gpt":0.1957047876324207,"spread":0.1839349328436572,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001155286,0.000950576,0.001384625,0.001121521,0.0005741125,0.0008523263,0.001931128,0.00224897,0.003130891],"category_scores_gemma":[0.002238921,0.0005975842,0.001129157,0.00163578,0.000538903,0.0007580753,0.0008542756,0.001056973,0.0004872176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001048574,"about_ca_system_score_gemma":0.001824646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01870317,"about_ca_topic_score_gemma":0.01532868,"domain_scores_codex":[0.999548,0.0001588335,0.00001972981,0.00006711287,0.000153589,0.00005258634],"domain_scores_gemma":[0.999346,0.0003555662,0.00004231076,0.0000349968,0.0001969876,0.00002408423],"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.00003574959,0.00005121894,0.0002878164,0.0000309559,0.00003980005,0.00003659064,0.00002846066,0.9479231,0.0008334593,0.002714488,0.00082103,0.04719736],"study_design_scores_gemma":[0.00001343899,0.00001444653,0.0000624566,0.000002753326,0.000007673444,0.000006576132,0.000002785309,0.9991224,0.0001085525,0.0004009602,0.0002552604,0.00000260927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0214138,0.0003377047,0.9724663,0.0001399852,0.0001520566,0.00009450765,0.00007737191,0.0004649466,0.004853336],"genre_scores_gemma":[0.2353088,0.0002432333,0.759054,0.0001680563,0.00009054792,0.0004146179,0.0002036157,0.0001375505,0.004379566],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01870317,"threshold_uncertainty_score":0.03718859,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131088269","doi":"10.1016/s0165-0114(03)00260-4","title":"Duality in linear programming with fuzzy parameters and matrix games with fuzzy pay-offs","year":2003,"lang":"en","type":"article","venue":"Fuzzy Sets and Systems","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":126,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Duality (order theory); Fuzzy logic; Dual (grammatical number); Linear programming; Mathematical optimization; Matrix (chemical analysis); Fuzzy number; Fuzzy set operations; Fuzzy classification; Fuzzy associative matrix; Fuzzy set; Algebra over a field; Discrete mathematics; Artificial intelligence; Computer science; Pure mathematics","authors":[{"name":"C. R. Bector","is_ca":true},{"name":"S. Chandra","is_ca":false},{"name":"V. Vijay","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0162352130909944,"gpt":0.2447732079311289,"spread":0.2285379948401345,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006831389,0.002079098,0.003399345,0.001985999,0.00134983,0.006130717,0.002296644,0.003051606,0.005351895],"category_scores_gemma":[0.01914989,0.001400383,0.001706429,0.002739807,0.005445255,0.008766442,0.003074354,0.005821872,0.0004846259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004422716,"about_ca_system_score_gemma":0.00260305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003233602,"about_ca_topic_score_gemma":0.002474325,"domain_scores_codex":[0.995972,0.002781375,0.0001207328,0.0003205732,0.0005219201,0.0002833804],"domain_scores_gemma":[0.9899718,0.008137229,0.0006257272,0.0002832884,0.0005926773,0.0003893157],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003856427,0.00003505853,0.0000759733,0.00007202102,0.00002175538,0.0000402505,0.00008720339,0.04312256,0.0001355601,0.9522811,0.0008617931,0.003228154],"study_design_scores_gemma":[0.00001657306,0.00001834307,0.00004193684,0.00002236836,0.000007992618,0.00002285223,0.00004020898,0.1210857,0.00005403439,0.8778716,0.0008060496,0.00001243271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02755404,0.003228003,0.926239,0.002968194,0.0003792193,0.00008443906,0.0001702039,0.00006248314,0.03931461],"genre_scores_gemma":[0.8217454,0.004922266,0.1373143,0.0007505988,0.001121406,0.0005493626,0.0002145462,0.0001597199,0.0332222],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006831389,"threshold_uncertainty_score":0.03612828,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089233175","doi":"10.1023/b:anor.0000039515.90453.1d","title":"Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design","year":2004,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":125,"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":"Tabu search; Theory of computation; Path (computing); Mathematical optimization; Mathematics; Heuristic; Set (abstract data type); Local search (optimization); Network planning and design; Computer science; Algorithm","authors":[{"name":"Ilfat Ghamlouche","is_ca":true},{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Michel Gendreau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1840381061706795,"gpt":0.3873745427847574,"spread":0.2033364366140779,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00157437,0.0007695176,0.001185574,0.001108185,0.0007832137,0.001063841,0.001912494,0.001252744,0.003399543],"category_scores_gemma":[0.00667131,0.0008469566,0.0007065383,0.001737756,0.001465963,0.002690365,0.001342354,0.001058725,0.0002853337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00120071,"about_ca_system_score_gemma":0.0008820649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003061703,"about_ca_topic_score_gemma":0.003298184,"domain_scores_codex":[0.9993662,0.0003135052,0.00002489437,0.0001107331,0.000124634,0.00006004193],"domain_scores_gemma":[0.9974662,0.00156974,0.0003315887,0.0001585613,0.0003074226,0.0001664434],"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.00008489429,0.00003267403,0.0002312771,0.00007028707,0.00001756914,0.00001953282,0.00004102128,0.9158854,0.0005077025,0.06530605,0.0006364531,0.01716716],"study_design_scores_gemma":[0.00001214918,0.0000468844,0.00005666529,0.00001001744,0.000009593269,0.00001813821,0.0000137867,0.9390497,0.0002424756,0.05994179,0.0005900451,0.000008692623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04410144,0.0005304311,0.949761,0.0002824957,0.00005011068,0.00006716116,0.00008741799,0.00007737614,0.005042573],"genre_scores_gemma":[0.7674485,0.001089999,0.221833,0.00008239096,0.00005671008,0.0002220669,0.000169979,0.0001030079,0.008994249],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003399543,"threshold_uncertainty_score":0.01137263,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011446372","doi":"10.1016/j.apm.2014.12.022","title":"An improved multi-choice goal programming approach for supplier selection problems","year":2014,"lang":"en","type":"article","venue":"Applied Mathematical Modelling","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":123,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Goal programming; Purchasing; Mathematical optimization; Selection (genetic algorithm); Computer science; Operations research; Interval (graph theory); Minification; Linear programming; Control (management); Mathematics; Operations management; Artificial intelligence; Economics","authors":[{"name":"Omid Jadidi","is_ca":false},{"name":"Sergio Cavalieri","is_ca":false},{"name":"Saeed Zolfaghari","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02383307217140284,"gpt":0.242820653460959,"spread":0.2189875812895561,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029862,0.001401739,0.002104715,0.001541941,0.0006577248,0.001673046,0.002548395,0.001975423,0.005491039],"category_scores_gemma":[0.004116553,0.0009635414,0.00196989,0.00185015,0.000696371,0.001699004,0.002288757,0.002374181,0.0008350473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001105155,"about_ca_system_score_gemma":0.001722818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005854333,"about_ca_topic_score_gemma":0.005271581,"domain_scores_codex":[0.9983085,0.000834688,0.00006673344,0.0001683448,0.0004908216,0.0001308887],"domain_scores_gemma":[0.9985127,0.0009361645,0.00007161954,0.00007830152,0.0003270798,0.00007405342],"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.00005207316,0.0001214972,0.000261265,0.0001285998,0.00008345245,0.00007976191,0.0000731169,0.9249758,0.0007963039,0.03347214,0.001727484,0.03822854],"study_design_scores_gemma":[0.000007590382,0.00001897144,0.00005045309,0.000006432935,0.00001033496,0.000008303239,0.000004993075,0.9931192,0.00008313225,0.00622055,0.0004644663,0.000005561961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00302968,0.0001131102,0.9943295,0.0001164975,0.00004025584,0.00003355879,0.00003444441,0.00007484163,0.002228074],"genre_scores_gemma":[0.2128608,0.0004252687,0.7772207,0.0002339838,0.0001496,0.000404473,0.0002171731,0.0002156277,0.00827244],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005854333,"threshold_uncertainty_score":0.01836938,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014193286","doi":"10.1023/b:fodm.0000036866.18909.f1","title":"Matrix Games with Fuzzy Goals and Fuzzy Linear Programming Duality","year":2004,"lang":"en","type":"article","venue":"Fuzzy Optimization and Decision Making","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":97,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Duality (order theory); Fuzzy logic; Dual (grammatical number); Mathematical optimization; Mathematics; Linear programming; Matrix (chemical analysis); Fuzzy number; Fuzzy associative matrix; Fuzzy set operations; Algebra over a field; Computer science; Fuzzy set; Artificial intelligence; Discrete mathematics; Pure mathematics","authors":[{"name":"C. R. Bector","is_ca":true},{"name":"S. Chandra","is_ca":false},{"name":"V. Vidyottama","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01353911193689595,"gpt":0.2800384306364021,"spread":0.2664993186995062,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003369185,0.001456867,0.001533531,0.001047421,0.001111928,0.00434145,0.00152952,0.002508841,0.005610254],"category_scores_gemma":[0.009123905,0.0007906329,0.001035602,0.001267399,0.002980161,0.005298315,0.002597301,0.003119397,0.0005717594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002500331,"about_ca_system_score_gemma":0.001751148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001936638,"about_ca_topic_score_gemma":0.001686772,"domain_scores_codex":[0.9970282,0.001881003,0.00008447588,0.000226401,0.0005696717,0.0002102361],"domain_scores_gemma":[0.9970245,0.002152969,0.0002624115,0.0001193788,0.0002591056,0.0001816862],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000211262,0.00001944509,0.00002388287,0.00002630078,0.00001015453,0.0000301842,0.00005401493,0.01440925,0.0001135239,0.9820696,0.0007672894,0.002455178],"study_design_scores_gemma":[0.00001791384,0.00001651435,0.00002467091,0.00001186234,0.000005473462,0.00002975272,0.00002901222,0.06419072,0.00007421526,0.9343243,0.001267563,0.00000801028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02442068,0.0009244417,0.8933453,0.00366589,0.0002562157,0.0001092187,0.0001521277,0.00006847477,0.07705775],"genre_scores_gemma":[0.8110012,0.001523747,0.1488279,0.000844516,0.0005607099,0.000514138,0.0001386591,0.00006527934,0.03652396],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005610254,"threshold_uncertainty_score":0.01876819,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3047295571","doi":"10.1016/j.jclepro.2020.123566","title":"A stochastic network design problem for hazardous waste management","year":2020,"lang":"en","type":"article","venue":"Journal of Cleaner Production","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":91,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Norges Forskningsråd","keywords":"Hazardous waste; Time horizon; Stochastic programming; Network planning and design; Population; Flow network; Linear programming; Operations research; Computer science; Engineering; Risk analysis (engineering); Mathematical optimization; Waste management; Business; Mathematics","authors":[{"name":"Hao Yu","is_ca":false},{"name":"Xu Sun","is_ca":false},{"name":"Wei Deng Solvang","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"C.K.M. Lee","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02700749703350222,"gpt":0.2232736385102206,"spread":0.1962661414767183,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002221163,0.001958779,0.001739667,0.001300721,0.0008998231,0.001914207,0.001465231,0.002641227,0.004531978],"category_scores_gemma":[0.004458451,0.001015513,0.001586102,0.001741425,0.001215042,0.001538979,0.00141131,0.001848163,0.0003217594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002532896,"about_ca_system_score_gemma":0.002438948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009186148,"about_ca_topic_score_gemma":0.009046646,"domain_scores_codex":[0.9980302,0.0009716523,0.00007587233,0.0004014339,0.0002962101,0.0002245426],"domain_scores_gemma":[0.9974541,0.001806863,0.000321068,0.00004248022,0.0002477661,0.0001277426],"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.00002296297,0.00001549921,0.000210555,0.00005679391,0.00002885321,0.00007376213,0.00001840796,0.9879545,0.00020983,0.00826356,0.0003497605,0.002795615],"study_design_scores_gemma":[0.00001279799,0.00002407555,0.00008790333,0.000007591466,0.0000136831,0.00001982454,0.0000153616,0.991686,0.00009011767,0.007314682,0.0007218494,0.000005950171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0250436,0.0006567588,0.9649558,0.0007766299,0.0001311925,0.0001862901,0.0005877371,0.0001328104,0.0075292],"genre_scores_gemma":[0.7847828,0.001784773,0.1969535,0.0003285845,0.0001720162,0.001211956,0.00123009,0.000132533,0.01340382],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009186148,"threshold_uncertainty_score":0.01837754,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2249032529","doi":"10.1016/j.automatica.2015.09.013","title":"Local optimization of dynamic programs with guaranteed satisfaction of path constraints","year":2015,"lang":"en","type":"article","venue":"Automatica","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":70,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Karush–Kuhn–Tucker conditions; Path (computing); Solver; Mathematical optimization; Mathematics; Bounded function; Convergence (economics); Point (geometry); Interior point method; Computer science","authors":[{"name":"Jun Fu","is_ca":false},{"name":"Johannes M.M. Faust","is_ca":false},{"name":"Benoît Chachuat","is_ca":false},{"name":"Alexander Mitsos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01068625831921516,"gpt":0.2189327711758131,"spread":0.2082465128565979,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002079613,0.001036488,0.001548013,0.000794443,0.0005721339,0.001578624,0.00147814,0.001182728,0.00435673],"category_scores_gemma":[0.008169236,0.0008100395,0.0009893676,0.0008020587,0.001788781,0.001856752,0.002735015,0.002046456,0.0004603956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001579271,"about_ca_system_score_gemma":0.001756713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00281937,"about_ca_topic_score_gemma":0.003148425,"domain_scores_codex":[0.9988536,0.0005222165,0.00003136522,0.0002009894,0.0002229531,0.000169046],"domain_scores_gemma":[0.9957846,0.003138456,0.0003776316,0.0002420911,0.0002697782,0.0001874362],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001568414,0.00005837194,0.0002632768,0.0001274556,0.00004552354,0.00006953451,0.00008920645,0.8911532,0.001611803,0.09340759,0.001133575,0.01188363],"study_design_scores_gemma":[0.00002025637,0.00005249175,0.00005743891,0.000009057974,0.000007160755,0.00001086429,0.00001855064,0.9629884,0.0004937492,0.03603283,0.0003025321,0.0000067508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05412489,0.000180775,0.9383228,0.000257572,0.0000322557,0.00004726388,0.0001070753,0.0002958853,0.00663145],"genre_scores_gemma":[0.8469721,0.0002484006,0.1435043,0.0001024168,0.00004392591,0.0002969475,0.0002703459,0.0004162387,0.008145362],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00435673,"threshold_uncertainty_score":0.01457477,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3115020944","doi":"10.1287/trsc.2020.1022","title":"Partial Benders Decomposition: General Methodology and Application to Stochastic Network Design","year":2020,"lang":"en","type":"article","venue":"Transportation Science","topic":"Optimization and Mathematical Programming","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":"Transport Canada; Université du Québec à Montréal","funders":"","keywords":"Benders' decomposition; Mathematical optimization; Decomposition; Network planning and design; Computer science; Stochastic programming; Class (philosophy); Dual (grammatical number); Decomposition method (queueing theory); Relaxation (psychology); Process (computing); Mathematics","authors":[{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Mike Hewitt","is_ca":false},{"name":"Francesca Maggioni","is_ca":false},{"name":"Walter Rei","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07043514893512383,"gpt":0.3222335593286785,"spread":0.2517984103935547,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002613413,0.001773118,0.001073638,0.001249733,0.0005117235,0.001099364,0.0009701484,0.0009995159,0.004839054],"category_scores_gemma":[0.003197815,0.0009090768,0.002051539,0.001653608,0.0009107301,0.001042558,0.001371962,0.002186465,0.0008827493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008330485,"about_ca_system_score_gemma":0.001831464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00201058,"about_ca_topic_score_gemma":0.002155139,"domain_scores_codex":[0.9992101,0.0003562115,0.00004061765,0.0001088226,0.0002266845,0.00005751386],"domain_scores_gemma":[0.9990159,0.0005387412,0.0001124477,0.0001241126,0.0001562058,0.00005247951],"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.00002847464,0.00003582302,0.0002763266,0.0001462099,0.00005308957,0.00005045804,0.00005917037,0.852577,0.002795701,0.08662682,0.001600072,0.05575089],"study_design_scores_gemma":[0.00001242306,0.00003055937,0.00005819489,0.00003191214,0.000009445588,0.00004388576,0.00001124797,0.9391889,0.0008380223,0.05541819,0.004348156,0.000009034265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004770375,0.00007600892,0.9986405,0.00003566988,0.000009695389,0.00002304589,0.00002554088,0.00005458774,0.0006579552],"genre_scores_gemma":[0.04641907,0.0007586352,0.9501033,0.00008840374,0.00005243966,0.0003308974,0.0002113951,0.0001522094,0.00188366],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004839054,"threshold_uncertainty_score":0.01618826,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046861175","doi":"10.1007/s10700-006-0021-0","title":"Acceptable optimality in linear fractional programming with fuzzy coefficients","year":2006,"lang":"en","type":"article","venue":"Fuzzy Optimization and Decision Making","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":61,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Linear programming; Mathematical optimization; Fuzzy logic; Fractional programming; Linear-fractional programming; Value (mathematics); Computer science; Nonlinear programming; Nonlinear system; Artificial intelligence; Statistics","authors":[{"name":"Apurv Mehra","is_ca":false},{"name":"S. Chandra","is_ca":false},{"name":"C. R. Bector","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0117602722515972,"gpt":0.2648410122389339,"spread":0.2530807399873367,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006145951,0.0008846999,0.001299467,0.001247658,0.00135264,0.003867949,0.001301966,0.001558583,0.002511263],"category_scores_gemma":[0.02720102,0.0008003158,0.0008156275,0.001635032,0.003794407,0.00340528,0.002045363,0.003362041,0.0002390522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00250862,"about_ca_system_score_gemma":0.001942432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003529731,"about_ca_topic_score_gemma":0.002861866,"domain_scores_codex":[0.9961926,0.002129305,0.0001480093,0.0002547236,0.0009787618,0.0002966365],"domain_scores_gemma":[0.9899269,0.008573522,0.0003313963,0.0002862321,0.0007103187,0.0001716519],"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.00004039612,0.00001826542,0.0001058041,0.00005857735,0.00001052731,0.00004602926,0.0002329012,0.09637947,0.0003507253,0.8959503,0.0005104032,0.006296593],"study_design_scores_gemma":[0.00001400221,0.0000222693,0.00005224881,0.00002786366,0.000007228418,0.00001771181,0.00005804856,0.1869825,0.0003437179,0.8116369,0.0008277759,0.00000984182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05417546,0.0008277535,0.9119652,0.001290529,0.0001177494,0.00004654948,0.00005686612,0.00005120033,0.03146868],"genre_scores_gemma":[0.8120926,0.0008580371,0.1774526,0.0002285991,0.0001621386,0.0002333315,0.0000803722,0.000127629,0.008764675],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006145951,"threshold_uncertainty_score":0.03250331,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3210181913","doi":"10.3390/jrfm14110519","title":"A Neutrosophic Fuzzy Optimisation Model for Optimal Sustainable Closed-Loop Supply Chain Network during COVID-19","year":2021,"lang":"en","type":"article","venue":"Journal of risk and financial management","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Fuzzy logic; Supply chain; Computer science; Supply chain network; Operations research; Transmission (telecommunications); Mathematical optimization; Supply chain management; Business; Engineering; Artificial intelligence; Mathematics","authors":[{"name":"Agnieszka Szmelter-Jarosz","is_ca":false},{"name":"Javid Ghahremani-Nahr","is_ca":false},{"name":"Hamed Nozari","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009570188888174623,"gpt":0.2247584781744923,"spread":0.2151882892863177,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009147012,0.001065414,0.001167384,0.00066815,0.0007544093,0.001983618,0.00107097,0.002107983,0.003033915],"category_scores_gemma":[0.00137916,0.0005868638,0.0009645292,0.0007921483,0.0009079839,0.001168443,0.000959586,0.00147414,0.0002194071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001597672,"about_ca_system_score_gemma":0.002307921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01626345,"about_ca_topic_score_gemma":0.007153077,"domain_scores_codex":[0.9995162,0.0001614286,0.00002024954,0.0001207645,0.00009167344,0.00008967459],"domain_scores_gemma":[0.99954,0.0002454895,0.00007479528,0.00001187211,0.00009548679,0.00003243366],"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.0000169311,0.00001106678,0.0001292301,0.00003328989,0.00001267337,0.00005148084,0.00002727306,0.9922985,0.0003260485,0.005625392,0.0001479153,0.001320147],"study_design_scores_gemma":[0.000006196879,0.00001881215,0.00005315265,0.000006171842,0.000005677954,0.000006795355,0.00001570731,0.9969318,0.00008321695,0.002629002,0.0002383986,0.000004979807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04704561,0.00056638,0.9373322,0.0005293668,0.00008090038,0.0001074937,0.0002229207,0.0001171638,0.01399805],"genre_scores_gemma":[0.9437733,0.0005666898,0.04758042,0.00009113456,0.00003008298,0.0003314823,0.0001821738,0.00002808726,0.007416614],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01626345,"threshold_uncertainty_score":0.03233761,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1905923734","doi":"10.1002/mcda.1466","title":"The Stochastic Goal Programming Model: Theory and Applications","year":2012,"lang":"en","type":"article","venue":"Journal of Multi-Criteria Decision Analysis","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Laurentian University","funders":"","keywords":"Certainty; Computer science; Decision maker; Stochastic programming; Operations research; Goal programming; Stochastic modelling; Management science; Mathematical economics; Mathematical optimization; Mathematics; Economics","authors":[{"name":"Belaı̈d Aouni","is_ca":true},{"name":"Fouad Ben Abdelaziz","is_ca":false},{"name":"Davide La Torre","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01815729588632378,"gpt":0.3098979751989721,"spread":0.2917406793126483,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002577262,0.000853928,0.0009951565,0.0011935,0.0004744155,0.002446035,0.001297052,0.00178394,0.003479611],"category_scores_gemma":[0.005633566,0.0004257328,0.001063273,0.002323893,0.002058126,0.001625758,0.002132977,0.002992805,0.0004743216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00149092,"about_ca_system_score_gemma":0.001524328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003916044,"about_ca_topic_score_gemma":0.001941285,"domain_scores_codex":[0.9978636,0.001215129,0.00007839748,0.0002518274,0.0004736905,0.000117346],"domain_scores_gemma":[0.9966101,0.002559013,0.0002547135,0.00009351308,0.0003440247,0.0001385959],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001800761,0.00005655433,0.0003571134,0.0001237552,0.00004715045,0.0001300166,0.0000977997,0.1982531,0.0001951287,0.7787836,0.002319731,0.01961797],"study_design_scores_gemma":[0.000009174071,0.00002115038,0.0001033382,0.00003938007,0.00001076846,0.00003807664,0.00002597143,0.5829042,0.00005367455,0.4130397,0.003742365,0.00001218848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009110712,0.002722054,0.9665442,0.002428217,0.00009884614,0.00004296103,0.000106916,0.00008743046,0.01885862],"genre_scores_gemma":[0.7122547,0.006937332,0.2652855,0.0009569272,0.0006363045,0.0004690991,0.0003428032,0.0001137831,0.01300359],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003916044,"threshold_uncertainty_score":0.01363003,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056235974","doi":"10.1007/s10479-012-1168-4","title":"A cardinality constrained stochastic goal programming model with satisfaction functions for venture capital investment decision making","year":2012,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Mathematical Programming","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":"Laurentian University","funders":"","keywords":"Venture capital; Portfolio; Investment (military); Cardinality (data modeling); Social venture capital; Theory of computation; Business; Capital investment; Resource (disambiguation); Selection (genetic algorithm); Goal programming; Economics; Microeconomics; Computer science; Finance; Industrial organization; Operations research; Mathematics; Artificial intelligence","authors":[{"name":"Belaı̈d Aouni","is_ca":true},{"name":"Cinzia Colapinto","is_ca":false},{"name":"Davide La Torre","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1297470419877422,"gpt":0.4075030370474891,"spread":0.2777559950597469,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004583159,0.001655376,0.003098135,0.001128364,0.0007840519,0.00358649,0.00302493,0.003740527,0.004968436],"category_scores_gemma":[0.01059469,0.001661107,0.001837132,0.002091866,0.001847118,0.003380845,0.002630084,0.004272275,0.0004758137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002818875,"about_ca_system_score_gemma":0.002484721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009627881,"about_ca_topic_score_gemma":0.006673086,"domain_scores_codex":[0.9965198,0.002053421,0.0001299344,0.000475845,0.0004038827,0.0004170217],"domain_scores_gemma":[0.9928844,0.005463585,0.0005723446,0.0001968526,0.0004487526,0.0004340917],"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.00007660946,0.00006885918,0.0003401277,0.00006578759,0.0000583359,0.0001098726,0.00006848732,0.9100334,0.0002330147,0.08427625,0.0009676131,0.003701528],"study_design_scores_gemma":[0.00001549719,0.00001908057,0.00006599484,0.00000836982,0.00001058613,0.00000967508,0.00001283853,0.9804298,0.00003893934,0.01915761,0.0002231199,0.000008478071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05307779,0.0005982097,0.934019,0.002162235,0.0001183678,0.0001722895,0.0007091239,0.0001658526,0.008977084],"genre_scores_gemma":[0.8579589,0.0007902978,0.1270916,0.0003406154,0.0001861219,0.0006066009,0.0006773052,0.0001010972,0.01224755],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009627881,"threshold_uncertainty_score":0.02423841,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2623014745","doi":"10.1287/trsc.2016.0728","title":"The Value of Flexibility in Robust Location–Transportation Problems","year":2017,"lang":"en","type":"article","venue":"Transportation Science","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":true,"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":"Flexibility (engineering); Mathematical optimization; Exploit; Set (abstract data type); Computer science; Facility location problem; Robust optimization; Linear programming; Mathematics; Statistics","authors":[{"name":"Amir Ardestani-Jaafari","is_ca":true},{"name":"Erick Delage","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0347453042944062,"gpt":0.2828744584522935,"spread":0.2481291541578873,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005172482,0.001431651,0.001648427,0.0007412148,0.00107511,0.002345116,0.001956582,0.002058946,0.00206869],"category_scores_gemma":[0.02435682,0.0009684404,0.001395445,0.001245527,0.002696298,0.003788123,0.002331788,0.003062048,0.0002350556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001495494,"about_ca_system_score_gemma":0.0009121998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002412941,"about_ca_topic_score_gemma":0.001594509,"domain_scores_codex":[0.9965114,0.00230154,0.0001036388,0.0003340278,0.0004645467,0.000284897],"domain_scores_gemma":[0.9806796,0.01641316,0.001111278,0.001090048,0.0003807112,0.0003251501],"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.00007150236,0.00001372123,0.0002364129,0.00004626985,0.00002707182,0.00008007991,0.00003737696,0.9604167,0.0003186087,0.03415339,0.0002601544,0.004338686],"study_design_scores_gemma":[0.00001406288,0.00004581252,0.00009113959,0.00002083348,0.00001318887,0.00003606245,0.00002607816,0.9529358,0.0002877002,0.04601473,0.0005012602,0.00001331373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05596551,0.001268576,0.9327501,0.001731851,0.00009070212,0.00004975591,0.0001488241,0.000144083,0.007850644],"genre_scores_gemma":[0.9148338,0.0006643365,0.08265851,0.0001522708,0.0001056363,0.00007697063,0.00008925667,0.0000790541,0.001340108],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005172482,"threshold_uncertainty_score":0.02735502,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W223119275","doi":"10.1023/a:1026102724889","title":"A Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements","year":2003,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":43,"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","funders":"","keywords":"Tabu search; Initialization; Mathematical optimization; Heuristic; Integer programming; Theory of computation; Scaling; Mathematics; Integer (computer science); Computer science; Scale (ratio); Algorithm","authors":[{"name":"Bernard Gendron","is_ca":true},{"name":"Jean‐Yves Potvin","is_ca":true},{"name":"Patrick Soriano","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2083074404042083,"gpt":0.4026867677618781,"spread":0.1943793273576698,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001974664,0.00106046,0.001716798,0.001766604,0.0008564771,0.001286345,0.002148462,0.0022897,0.01090311],"category_scores_gemma":[0.006198181,0.0009658962,0.001033271,0.002922848,0.0008112732,0.001814754,0.00135317,0.001542431,0.001400377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007342845,"about_ca_system_score_gemma":0.001691586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006081879,"about_ca_topic_score_gemma":0.00519607,"domain_scores_codex":[0.999202,0.0004734156,0.00002728562,0.00008009555,0.0001256743,0.00009161298],"domain_scores_gemma":[0.9980478,0.001359637,0.000099089,0.0001465216,0.0002639993,0.00008294496],"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.0003245753,0.0002560845,0.0008202047,0.0001445128,0.00005522263,0.00005184545,0.0001190109,0.8285403,0.0009834782,0.006954312,0.006870916,0.1548795],"study_design_scores_gemma":[0.00007498864,0.0000817194,0.0001081601,0.00001851031,0.00001333802,0.00001174122,0.00002879977,0.9955011,0.0001352949,0.003403436,0.0006148763,0.000007960608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1147306,0.002321695,0.8559616,0.001000592,0.0003249552,0.0005427205,0.0005888502,0.002979415,0.0215496],"genre_scores_gemma":[0.3227196,0.0005120856,0.670531,0.0003467359,0.0001116492,0.0005618635,0.0005714545,0.0004444736,0.004201186],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01090311,"threshold_uncertainty_score":0.03647459,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3006806717","doi":"10.1155/2020/7570686","title":"Green and Reliable Freight Routing Problem in the Road-Rail Intermodal Transportation Network with Uncertain Parameters: A Fuzzy Goal Programming Approach","year":2020,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Natural Science Foundation of Shandong Province; Ministry of Education of the People's Republic of China; Kungliga Tekniska Högskolan; National Natural Science Foundation of China","keywords":"Mathematical optimization; Routing (electronic design automation); Fuzzy logic; Fuzzy transportation; Fuzzy set; Computer science; Linearization; Operations research; Fuzzy number; Integer programming; Engineering; Nonlinear system; Mathematics","authors":[{"name":"Yan Sun","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01293138461203924,"gpt":0.2157450484727318,"spread":0.2028136638606925,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002195995,0.001837378,0.001894342,0.001489102,0.0007710228,0.002266627,0.001716447,0.002769205,0.001702762],"category_scores_gemma":[0.002163137,0.0008956254,0.001734851,0.001890792,0.001154573,0.001877663,0.001176879,0.00191026,0.0001965039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00287136,"about_ca_system_score_gemma":0.002540734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01089568,"about_ca_topic_score_gemma":0.007952253,"domain_scores_codex":[0.9988986,0.0004917102,0.00004112757,0.0001986945,0.0002225242,0.000147271],"domain_scores_gemma":[0.9991614,0.0005554359,0.00009459804,0.00002227921,0.0001246375,0.00004179735],"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.00001737727,0.00002282943,0.0001545053,0.00006471555,0.00003130416,0.00009027078,0.00004153971,0.9792908,0.0003178098,0.01532135,0.0002904482,0.004356964],"study_design_scores_gemma":[0.000004437225,0.00001724295,0.00004965394,0.00001243027,0.00001217613,0.00001225878,0.00002491258,0.9906731,0.000125694,0.008715012,0.000346931,0.00000610703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01210285,0.0004975953,0.9821454,0.0004044252,0.00002981426,0.00006233994,0.00006815122,0.0000548274,0.004634649],"genre_scores_gemma":[0.6540464,0.001848828,0.3367045,0.0002789361,0.0001198212,0.0005964679,0.0002214451,0.0001041179,0.006079434],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01089568,"threshold_uncertainty_score":0.0216645,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030995871","doi":"10.1007/s13675-014-0020-9","title":"Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design","year":2014,"lang":"en","type":"article","venue":"EURO Journal on Computational Optimization","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":41,"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","funders":"","keywords":"Column generation; Mathematics; Mathematical optimization; Lagrangian relaxation; Flow network; Fixed charge; Relaxation (psychology); Scale (ratio); Flow (mathematics)","authors":[{"name":"Bernard Gendron","is_ca":true},{"name":"Mathieu T. Larose","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01876723607481046,"gpt":0.2348211210597049,"spread":0.2160538849848945,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001087686,0.001062717,0.000929559,0.0006434114,0.0007029367,0.0009004608,0.001120951,0.0009930624,0.004922758],"category_scores_gemma":[0.002893714,0.0005293079,0.000640566,0.001379221,0.0007076306,0.0007682139,0.0008386848,0.001374307,0.0003990101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001343912,"about_ca_system_score_gemma":0.001657071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006008831,"about_ca_topic_score_gemma":0.006972932,"domain_scores_codex":[0.9994957,0.0002571696,0.00001414777,0.00005892341,0.0001104002,0.00006357265],"domain_scores_gemma":[0.9986982,0.0009976563,0.00007982996,0.00008922278,0.00007923834,0.00005564405],"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.00004376979,0.00006223494,0.0001849379,0.00007285264,0.00001513674,0.00004092583,0.00002277205,0.9471849,0.0006107811,0.007211308,0.001232587,0.04331765],"study_design_scores_gemma":[0.00002027055,0.00002923991,0.00003906673,0.000004337011,0.000004019914,0.00001076658,0.000006816515,0.9928804,0.0002730568,0.006290868,0.0004383593,0.000002838393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03066949,0.0003955292,0.9627535,0.000295321,0.00003271345,0.0002068433,0.0001289663,0.0005073486,0.005010242],"genre_scores_gemma":[0.3401514,0.0002884827,0.6563271,0.00008181186,0.00003386817,0.0004918131,0.0003248953,0.0001622296,0.002138396],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006008831,"threshold_uncertainty_score":0.01646823,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066316339","doi":"10.1002/mcda.448","title":"Fuzzy goal programming model: an overview of the current state‐of‐the art","year":2009,"lang":"en","type":"article","venue":"Journal of Multi-Criteria Decision Analysis","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval; Laurentian University","funders":"","keywords":"Goal programming; Decision maker; Computer science; Fuzzy logic; State (computer science); Operations research; Management science; Artificial intelligence; Mathematics; Engineering; Programming language","authors":[{"name":"Belaı̈d Aouni","is_ca":true},{"name":"Jean‐Marc Martel","is_ca":true},{"name":"Amal Hassaine","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05753464246591396,"gpt":0.3606880022258626,"spread":0.3031533597599486,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002936595,0.001053965,0.001478893,0.001961091,0.0004167062,0.004756394,0.002624788,0.002089146,0.003400818],"category_scores_gemma":[0.003205451,0.0005538453,0.001359225,0.004306091,0.001229929,0.002992933,0.001271738,0.00256615,0.0009983872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001946595,"about_ca_system_score_gemma":0.001902944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004363631,"about_ca_topic_score_gemma":0.001714927,"domain_scores_codex":[0.998113,0.0007683148,0.0001048324,0.0002576504,0.0006548465,0.0001013505],"domain_scores_gemma":[0.9987785,0.000847457,0.00007629178,0.00004878252,0.0001903654,0.00005852965],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001124742,0.0002429714,0.0006318728,0.002269885,0.0001800807,0.0002717497,0.0003121865,0.2112132,0.0006067182,0.4375516,0.009550751,0.3370565],"study_design_scores_gemma":[0.00003400758,0.00009479823,0.000374227,0.001090695,0.00008477068,0.0002373047,0.0001823009,0.5717631,0.0004657912,0.3490153,0.07658212,0.00007554833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.00756223,0.1303959,0.8217493,0.004408299,0.0002987392,0.0001574264,0.0002908448,0.0003886908,0.0347487],"genre_scores_gemma":[0.3163733,0.2027207,0.4658593,0.001859693,0.001262067,0.0006679718,0.0008697343,0.0002419119,0.01014519],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.004756394,"threshold_uncertainty_score":0.01553041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1573636743","doi":"10.1023/a:1011392328632","title":"Generalized Assignment Type Goal Programming Problem: Application to Nurse Scheduling","year":2001,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"IBM (Canada); Université du Québec à Trois-Rivières; Université de Montréal","funders":"","keywords":"Tabu search; Mathematical optimization; Nurse scheduling problem; Computer science; Scheduling (production processes); Job shop scheduling; Mathematics; Schedule; Flow shop scheduling","authors":[{"name":"Jacques A. Ferland","is_ca":true},{"name":"Ilham Berrada","is_ca":false},{"name":"Imene Nabli","is_ca":true},{"name":"Belaïd Ahiod","is_ca":false},{"name":"Philippe Michelon","is_ca":false},{"name":"Viviane Gascon","is_ca":true},{"name":"Éric Gagné","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01210832778810486,"gpt":0.26485392777579,"spread":0.2527455999876851,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001702896,0.001167445,0.00144343,0.0008398376,0.001087758,0.001502335,0.001480268,0.001892682,0.003859199],"category_scores_gemma":[0.004292551,0.0005551383,0.001190432,0.002215624,0.001158668,0.001498496,0.001408298,0.002124148,0.0003755215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001215965,"about_ca_system_score_gemma":0.002139343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01033287,"about_ca_topic_score_gemma":0.01147855,"domain_scores_codex":[0.9993405,0.0003750606,0.00001792344,0.00009275305,0.0001025544,0.00007122713],"domain_scores_gemma":[0.998556,0.001000233,0.0001116307,0.00005981261,0.0001636377,0.0001086437],"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.0001741599,0.0001882981,0.0006118449,0.0002126952,0.00006627078,0.0003572469,0.0001337022,0.8864833,0.0009633477,0.05241977,0.00657804,0.0518113],"study_design_scores_gemma":[0.00005647427,0.00006062208,0.0002048762,0.00001310896,0.00002389427,0.00007034049,0.00008806089,0.9501354,0.0002999461,0.04675853,0.002274753,0.00001397853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03470415,0.0004631029,0.955997,0.0008811083,0.0002601689,0.0001561854,0.0001994286,0.000297256,0.007041567],"genre_scores_gemma":[0.3821172,0.001312876,0.6041683,0.000391591,0.0003142611,0.0003631189,0.0003271614,0.0002016402,0.01080393],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01033287,"threshold_uncertainty_score":0.02054548,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037044553","doi":"10.1007/s00170-012-4469-5","title":"Model and algorithm for fuzzy joint replenishment and delivery scheduling without explicit membership function","year":2012,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Mathematical optimization; Fuzzy logic; Piecewise; Computer science; Fuzzy number; Scheduling (production processes); Ranking (information retrieval); Fuzzy set; Algorithm; Mathematics","authors":[{"name":"Lin Wang","is_ca":false},{"name":"Cai-Xia Dun","is_ca":false},{"name":"Chi-Guhn Lee","is_ca":true},{"name":"Qing-Liang Fu","is_ca":false},{"name":"Yu‐Rong Zeng","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02382898516789372,"gpt":0.2505368461348375,"spread":0.2267078609669437,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001190282,0.000804494,0.001875105,0.0007141597,0.0008466722,0.001530731,0.002407751,0.001973319,0.004267629],"category_scores_gemma":[0.001875845,0.0006906939,0.0009587261,0.0009066599,0.0007002592,0.00143267,0.001284026,0.0015358,0.0007067571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001959612,"about_ca_system_score_gemma":0.002919533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01762988,"about_ca_topic_score_gemma":0.009591045,"domain_scores_codex":[0.9995899,0.00007756711,0.00002314025,0.0001120377,0.0001286778,0.00006876837],"domain_scores_gemma":[0.9994486,0.0002969022,0.0000509583,0.00003229409,0.0001393671,0.00003185695],"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.00006128557,0.00002844531,0.0001169786,0.00003824484,0.00001561023,0.00002580493,0.00003168302,0.9664414,0.0007107951,0.009478136,0.0004506788,0.02260095],"study_design_scores_gemma":[0.000009815251,0.00000804476,0.00001796429,0.000002316124,0.000003539436,0.000005796413,0.000002983023,0.9979643,0.0001259391,0.001704405,0.0001518521,0.000003188722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005583063,0.0001046009,0.9926028,0.00009975934,0.00003288149,0.00004305224,0.00004315081,0.0001938191,0.001296901],"genre_scores_gemma":[0.476247,0.000320013,0.5157009,0.0001109561,0.00006089812,0.0004522022,0.0002383016,0.0001099319,0.006759722],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01762988,"threshold_uncertainty_score":0.03505456,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2972051872","doi":"10.1007/s00521-019-04466-5","title":"Derivation of personalized numerical scales from distribution linguistic preference relations: an expected consistency-based goal programming approach","year":2019,"lang":"en","type":"article","venue":"Neural Computing and Applications","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":36,"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":"National Natural Science Foundation of China","keywords":"Consistency (knowledge bases); Preference; Statement (logic); Computer science; Semantics (computer science); Problem statement; Linguistics; Natural language processing; Mathematics; Artificial intelligence; Management science; Statistics","authors":[{"name":"Xiaoan Tang","is_ca":true},{"name":"Qiang Zhang","is_ca":false},{"name":"Zhanglin Peng","is_ca":false},{"name":"Shanlin Yang","is_ca":false},{"name":"Witold Pedrycz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01990908669235801,"gpt":0.2472278303267873,"spread":0.2273187436344293,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004353713,0.0008331271,0.00104137,0.001314145,0.0005770383,0.002574048,0.002124025,0.001200903,0.004786784],"category_scores_gemma":[0.02132157,0.0009338608,0.001445048,0.001718266,0.001111244,0.004255238,0.002771497,0.003058408,0.0007868875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001219926,"about_ca_system_score_gemma":0.001575151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001560526,"about_ca_topic_score_gemma":0.001838712,"domain_scores_codex":[0.9967942,0.001502717,0.0001878338,0.0005913307,0.0007588349,0.0001651181],"domain_scores_gemma":[0.9934024,0.004234357,0.0004437603,0.000655618,0.001054991,0.0002088436],"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.000157991,0.000394907,0.002849069,0.0003122786,0.0002113203,0.000266577,0.001015572,0.1884674,0.003272683,0.621709,0.004047926,0.1772954],"study_design_scores_gemma":[0.00001698733,0.00005954035,0.0006148382,0.00003944296,0.00003404203,0.00004770451,0.0001011111,0.7770194,0.0008854906,0.2198579,0.001299335,0.00002415137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006302852,0.0000337744,0.9914399,0.0001532663,0.00001136617,0.00004388253,0.00005261366,0.00009642466,0.001865836],"genre_scores_gemma":[0.3621372,0.0001381487,0.6338061,0.000187958,0.00004676576,0.0003702206,0.000306224,0.0001887347,0.00281868],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004786784,"threshold_uncertainty_score":0.02302492,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035108481","doi":"10.1287/mnsc.1070.0848","title":"Interactive Coordination of Objective Decompositions in Multiobjective Programming","year":2008,"lang":"en","type":"article","venue":"Management Science","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":36,"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":"Automotive Research Center; University of Michigan","keywords":"Mathematical optimization; Decision maker; Selection (genetic algorithm); Decomposition; Multiobjective programming; Computer science; Multi-objective optimization; Sensitivity (control systems); Portfolio; Linear programming; Function (biology); Mathematics; Operations research; Artificial intelligence; Economics; Engineering","authors":[{"name":"Alexander Engau","is_ca":true},{"name":"Margaret M. Wiecek","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009861900291178453,"gpt":0.2510570572414315,"spread":0.2411951569502531,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007316743,0.001643066,0.001383725,0.001476677,0.0007741757,0.001841679,0.001477408,0.0009811785,0.002518056],"category_scores_gemma":[0.01053258,0.000856557,0.001458944,0.001452115,0.002135028,0.002355917,0.003549019,0.002062589,0.0004839155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001179301,"about_ca_system_score_gemma":0.001234664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001299514,"about_ca_topic_score_gemma":0.001262182,"domain_scores_codex":[0.9945312,0.00358984,0.0002066352,0.0004291883,0.0009169584,0.0003261579],"domain_scores_gemma":[0.9938864,0.004608231,0.0004736717,0.0005204979,0.0003190787,0.0001920573],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001525386,0.0001107512,0.0004529919,0.0001812218,0.0001161017,0.0001322094,0.0004575341,0.7605311,0.004064669,0.1399802,0.0007847607,0.09303588],"study_design_scores_gemma":[0.00004667477,0.00007397072,0.0001254061,0.0000353895,0.0000241302,0.00003118645,0.00005726992,0.9013572,0.00210128,0.09388692,0.002237496,0.00002314461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004097349,0.000140609,0.9940093,0.00005641886,0.00001219291,0.00003926471,0.000007051259,0.00007069657,0.001567075],"genre_scores_gemma":[0.2482995,0.0003471544,0.7491156,0.00007689968,0.00006175669,0.0004497641,0.00005495295,0.0001392287,0.001455194],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007316743,"threshold_uncertainty_score":0.0386951,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081516133","doi":"10.1007/s11269-008-9380-3","title":"A Two-Step Infinite α-Cuts Fuzzy Linear Programming Method in Determination of Optimal Allocation Strategies in Agricultural Irrigation Systems","year":2008,"lang":"en","type":"article","venue":"Water Resources Management","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Linear programming; Fuzzy logic; Mathematical optimization; Fuzzy number; Mathematics; Fuzzy set operations; Linear-fractional programming; Computer science; Fuzzy set; Artificial intelligence","authors":[{"name":"Hongwei Lu","is_ca":true},{"name":"Guohe Huang","is_ca":true},{"name":"Yan Ping Lin","is_ca":false},{"name":"Li He","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01524131894013521,"gpt":0.249950743449535,"spread":0.2347094245093997,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00260963,0.0006167731,0.001009441,0.0008751504,0.0007649846,0.001229816,0.001710329,0.001343976,0.00277224],"category_scores_gemma":[0.003691971,0.0007406299,0.0008884332,0.0007725842,0.00092449,0.001372631,0.0009740605,0.001704367,0.0002201831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009387424,"about_ca_system_score_gemma":0.001547109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006325911,"about_ca_topic_score_gemma":0.004676144,"domain_scores_codex":[0.9993477,0.000333387,0.00003113326,0.00008170264,0.0001524627,0.0000536141],"domain_scores_gemma":[0.9982759,0.00120606,0.00007353722,0.00004561034,0.0003271662,0.00007174077],"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.0001724588,0.0001161638,0.0004070942,0.0001563034,0.00005522796,0.00006977315,0.0001678349,0.8897203,0.002516945,0.02584313,0.0009784622,0.07979637],"study_design_scores_gemma":[0.00000773254,0.00002387972,0.00004653096,0.000008893838,0.000007871789,0.000007155135,0.000009978738,0.9969157,0.0003496734,0.002397789,0.0002193544,0.000005514452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009860252,0.00007715632,0.988477,0.00006805192,0.00002498751,0.00003860755,0.00001718043,0.00005053226,0.001386252],"genre_scores_gemma":[0.31314,0.0001764477,0.6828588,0.00009461134,0.00004235658,0.0003305682,0.00009810085,0.00007321687,0.003185919],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006325911,"threshold_uncertainty_score":0.01380116,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W75241701","doi":"10.1023/a:1013138919445","title":"A Comprehensive Input Format for Stochastic Linear Programs","year":2001,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Theory of computation; Range (aeronautics); Computer science; Mathematical economics; Mathematical optimization; Mathematics; Applied mathematics; Algorithm; Engineering","authors":[{"name":"Horand I. Gassmann","is_ca":true},{"name":"Eithan Schweitzer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3293820201981577,"gpt":0.4577544905665231,"spread":0.1283724703683654,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002941035,0.002207077,0.00139969,0.002120782,0.001029549,0.004614274,0.002471049,0.001958401,0.08332255],"category_scores_gemma":[0.0217408,0.001215468,0.001516039,0.003510644,0.0005701323,0.005015759,0.002937888,0.003259807,0.02717921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001037284,"about_ca_system_score_gemma":0.001924592,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001530891,"about_ca_topic_score_gemma":0.002176338,"domain_scores_codex":[0.9972302,0.0007819182,0.0004527207,0.0002668347,0.001033736,0.0002345755],"domain_scores_gemma":[0.9914077,0.004212582,0.0002833827,0.001633866,0.002301904,0.0001605666],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001050882,0.0003728289,0.0008328881,0.001451102,0.00007483792,0.0006081389,0.0003352721,0.07722991,0.006278973,0.1960923,0.2693641,0.4463087],"study_design_scores_gemma":[0.0002702022,0.0002167939,0.0004645656,0.0006608819,0.00006831932,0.0004982158,0.0001455315,0.4215552,0.02761376,0.2303661,0.3179728,0.000167624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002121292,0.0002718981,0.9415206,0.0008589724,0.0003954494,0.0002609383,0.01805457,0.02322002,0.01329614],"genre_scores_gemma":[0.0575736,0.001253226,0.8742293,0.0005478369,0.0003626206,0.001980401,0.03165817,0.01055582,0.02183904],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.08332255,"threshold_uncertainty_score":0.2787417,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2804809316","doi":"10.1155/2018/4949565","title":"Decision-Support Framework for Selecting the Optimal Road Toll Collection System","year":2018,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Multiple-criteria decision analysis; SWOT analysis; Ranking (information retrieval); Toll; Operations research; Selection (genetic algorithm); Decision support system; Computer science; Decision analysis; Evidential reasoning approach; Management science; Risk analysis (engineering); Transport engineering; Data mining; Engineering; Machine learning; Business decision mapping; Mathematics; Business","authors":[{"name":"Marina Milenković","is_ca":false},{"name":"Draženko Glavić","is_ca":false},{"name":"Miloš N. Mladenović","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009411637542008968,"gpt":0.2669230149179326,"spread":0.2575113773759237,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003909387,0.001502175,0.001514238,0.002189334,0.001005293,0.002884194,0.001847662,0.001752554,0.004773163],"category_scores_gemma":[0.004591352,0.000455777,0.001215424,0.001539217,0.0007101227,0.001406482,0.001407804,0.001381142,0.0006154845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001993801,"about_ca_system_score_gemma":0.003501179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008525749,"about_ca_topic_score_gemma":0.007412607,"domain_scores_codex":[0.9976889,0.001074764,0.0001661141,0.0002474794,0.0006416336,0.0001810586],"domain_scores_gemma":[0.9984214,0.0008966582,0.0001008127,0.0000434632,0.0004540949,0.00008352678],"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.00008835238,0.0001236701,0.0004963389,0.0002986264,0.00005989823,0.0003960042,0.0002268974,0.8724174,0.00122872,0.07363003,0.001639284,0.04939474],"study_design_scores_gemma":[0.00002875961,0.00004215191,0.00007378015,0.00004526929,0.00002020502,0.00003069393,0.000061218,0.9797932,0.0003804334,0.01778962,0.001721928,0.0000126553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007049022,0.0001611561,0.9873295,0.0002993317,0.00002481605,0.0002116253,0.0001929647,0.0002029775,0.004528724],"genre_scores_gemma":[0.3980339,0.0003784646,0.5977111,0.0001161378,0.00006859316,0.0009193826,0.0005088039,0.00003174922,0.002231762],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008525749,"threshold_uncertainty_score":0.02067512,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2555683065","doi":"10.1139/cjfr-2016-0299","title":"Strategic planning in a forest supply chain: a multigoal and multiproduct approach","year":2016,"lang":"en","type":"article","venue":"Canadian Journal of Forest Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Consejo Nacional de Investigaciones Científicas y Técnicas","keywords":"Maximization; Sustainability; Minification; Work (physics); Supply chain; Schedule; Production (economics); Yield (engineering); Forest management; Operations research; Computer science; Environmental economics; Business; Economics; Environmental science; Mathematics; Agroforestry; Ecology; Microeconomics; Engineering","authors":[{"name":"Diego Broz","is_ca":false},{"name":"Guillermo A. Durand","is_ca":false},{"name":"Daniel Alejandro Rossit","is_ca":false},{"name":"Fernando Tohmé","is_ca":false},{"name":"Mariano Frutos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07447308180755687,"gpt":0.3018994920027888,"spread":0.2274264101952319,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001892805,0.001378482,0.001233445,0.00174313,0.000894161,0.002489479,0.001780866,0.002000547,0.004489047],"category_scores_gemma":[0.002444005,0.000992008,0.001519565,0.001936257,0.002078125,0.00203043,0.001650456,0.001613763,0.0003392761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003479262,"about_ca_system_score_gemma":0.003011328,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01233675,"about_ca_topic_score_gemma":0.01302624,"domain_scores_codex":[0.9988058,0.0006932946,0.00003667427,0.0001461577,0.0001870294,0.0001310807],"domain_scores_gemma":[0.9987103,0.0009047888,0.0001128439,0.00003751025,0.0001127677,0.0001218445],"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.00002637375,0.00005262759,0.0003025368,0.00008070438,0.00004158463,0.0001379061,0.00009290948,0.9393085,0.0002669303,0.05385068,0.0002958114,0.005543463],"study_design_scores_gemma":[0.00001562411,0.00004730379,0.0001254321,0.00002726511,0.00001944024,0.00002621202,0.00007379222,0.9434266,0.0001314247,0.05499821,0.001096702,0.00001197923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0259381,0.0006037732,0.9566209,0.0008518441,0.00003768849,0.0001511742,0.0001228293,0.00006715267,0.01560644],"genre_scores_gemma":[0.5612892,0.001363281,0.4264886,0.0002168381,0.00006455347,0.0005139876,0.0001760381,0.00007959751,0.009807965],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9876633,"threshold_uncertainty_score":0.02524388,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075501806","doi":"10.1023/a:1013346202934","title":"Long-Term Planning of Waste Management System in the City of Regina – an Integrated Inexact Optimization Approach","year":2001,"lang":"en","type":"article","venue":"Environmental Modeling & Assessment","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Plan (archaeology); Municipal solid waste; Operations research; Solid waste management; Reliability (semiconductor); Stochastic programming; Computer science; Operations management; Waste management; Business; Engineering; Mathematical optimization; Mathematics; Geography","authors":[{"name":"Guohe Huang","is_ca":true},{"name":"Napussakorn Sae-lim","is_ca":true},{"name":"Z. Chen","is_ca":true},{"name":"Lei Liu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02351967010930485,"gpt":0.2533160536532565,"spread":0.2297963835439517,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000725523,0.0006048336,0.001009212,0.0006943769,0.0008001533,0.001586562,0.001104754,0.001409204,0.001420506],"category_scores_gemma":[0.001138233,0.0007701856,0.0009691769,0.0008025935,0.0005149181,0.0009343534,0.000811794,0.0006474195,0.0001695423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001619335,"about_ca_system_score_gemma":0.002571823,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.05708863,"about_ca_topic_score_gemma":0.05638251,"domain_scores_codex":[0.9995406,0.0001910505,0.00002312292,0.00007878758,0.00006371948,0.0001028076],"domain_scores_gemma":[0.9996439,0.0001385238,0.00005995023,0.00003156902,0.00008189686,0.00004415266],"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.00001403551,0.00001113258,0.0006194832,0.000008670439,0.00001423776,0.00004615803,0.000009441185,0.9964234,0.0001246067,0.0005085632,0.00007169305,0.002148601],"study_design_scores_gemma":[0.000003409036,0.00001704674,0.0006169054,0.000003434169,0.00001326735,0.00001102251,0.00003865953,0.9982658,0.0002033452,0.0006273199,0.0001926614,0.000007101533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6849126,0.001048693,0.3042158,0.0008319187,0.00007131077,0.00007861687,0.0007189451,0.000322565,0.007799448],"genre_scores_gemma":[0.9705165,0.0001987371,0.02682712,0.00002681881,0.00001343216,0.00006623056,0.0003138268,0.00004392142,0.001993366],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9429114,"threshold_uncertainty_score":0.1135127,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043472740","doi":"10.3926/jiem.451","title":"Workforce scheduling: A new model incorporating human factors","year":2012,"lang":"en","type":"article","venue":"Journal of Industrial Engineering and Management","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Workforce; Overtime; Human resources; Originality; Workforce management; Scheduling (production processes); Human resource management; Engineering; Operations management; Operations research; Computer science; Labour economics; Economics; Knowledge management; Psychology; Management; Social psychology","authors":[{"name":"Mohammed Othman","is_ca":true},{"name":"Gerard J. Gouw","is_ca":true},{"name":"Nadia Bhuiyan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06319480430748918,"gpt":0.254115396641964,"spread":0.1909205923344748,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001781269,0.001625962,0.001497966,0.0009262599,0.0008117607,0.0020456,0.003003385,0.002619741,0.009730148],"category_scores_gemma":[0.003395697,0.0009679036,0.001748699,0.001084639,0.0008141315,0.001455127,0.001386403,0.002368944,0.001120191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002252751,"about_ca_system_score_gemma":0.003092715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02318501,"about_ca_topic_score_gemma":0.01393097,"domain_scores_codex":[0.9988908,0.0003745011,0.00004301028,0.0002850382,0.0001720246,0.0002346488],"domain_scores_gemma":[0.9983699,0.0008350689,0.0002745798,0.0000489452,0.000264994,0.0002065303],"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.00005941241,0.00005391617,0.0005074314,0.00004957536,0.00002839254,0.00006822804,0.00006339999,0.9914964,0.0002811135,0.003054427,0.0005315735,0.003806031],"study_design_scores_gemma":[0.00001875861,0.000042823,0.0001690041,0.00001046295,0.00001527296,0.000011138,0.00002166223,0.9976932,0.00003838885,0.00136381,0.0006079774,0.000007407719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07369135,0.001082905,0.8964167,0.001767487,0.0005120877,0.000373116,0.001205028,0.0004199122,0.02453144],"genre_scores_gemma":[0.8675876,0.001259444,0.09158348,0.0004722417,0.0002874758,0.0009487955,0.0007987656,0.0001688726,0.03689327],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02318501,"threshold_uncertainty_score":0.04610014,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3200566607","doi":"10.1016/j.trb.2021.08.010","title":"Target-oriented robust location–transportation problem with service-level measure","year":2021,"lang":"en","type":"article","venue":"Transportation Research Part B Methodological","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematical optimization; Computer science; Profit (economics); Measure (data warehouse); Operations research; Quadratic equation; Affine transformation; Mathematics; Data mining; Economics","authors":[{"name":"Xin Wang","is_ca":true},{"name":"Yong‐Hong Kuo","is_ca":false},{"name":"Houcai Shen","is_ca":false},{"name":"Lianmin Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3869647240031798,"gpt":0.3925413887497071,"spread":0.005576664746527238,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004516187,0.002140377,0.002962183,0.001645923,0.0005701385,0.00343786,0.003471078,0.003704698,0.004020847],"category_scores_gemma":[0.008891079,0.001184506,0.002240531,0.002193134,0.001952802,0.003308034,0.003424409,0.001863746,0.0007721786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003323157,"about_ca_system_score_gemma":0.002489384,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006491541,"about_ca_topic_score_gemma":0.002191198,"domain_scores_codex":[0.9967937,0.00134999,0.0001311751,0.0008659834,0.0005116038,0.0003476151],"domain_scores_gemma":[0.9967844,0.001537487,0.0006078852,0.0002146412,0.0005882051,0.0002673059],"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.000196951,0.00008642227,0.0004662922,0.0002126451,0.0001760927,0.0001896362,0.00006334425,0.8844491,0.002076312,0.1016909,0.001536212,0.008856066],"study_design_scores_gemma":[0.00002905217,0.00009427287,0.0001916504,0.00001137321,0.0000405473,0.0000476097,0.00002739444,0.9698089,0.0007544891,0.02822883,0.0007450021,0.00002074862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01665766,0.0001601837,0.9782111,0.0005492342,0.00004253166,0.00007168821,0.0002749348,0.0001526733,0.003879941],"genre_scores_gemma":[0.8193383,0.0005330201,0.1624418,0.0003284311,0.0001794374,0.0004247868,0.001042105,0.0003856814,0.0153263],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006491541,"threshold_uncertainty_score":0.02411127,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078978921","doi":"10.1155/2013/837919","title":"Bilevel Multiobjective Programming Applied to Water Resources Allocation","year":2013,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Northern British Columbia","funders":"National High-tech Research and Development Program; Ministry of Water Resources; National Natural Science Foundation of China","keywords":"Mathematical optimization; Bilevel optimization; Linear programming; Computer science; Analytic hierarchy process; Fuzzy logic; Hierarchy; Operations research; Mathematics; Optimization problem; Artificial intelligence","authors":[{"name":"Shiqi Fang","is_ca":false},{"name":"Ping Guo","is_ca":true},{"name":"Mo Li","is_ca":false},{"name":"Liudong Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008404664537964594,"gpt":0.1948994056229248,"spread":0.1864947410849602,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001674587,0.001313544,0.001447296,0.00111287,0.0008184973,0.001734157,0.0008792665,0.001273121,0.001700778],"category_scores_gemma":[0.003215293,0.0006866104,0.001259338,0.002312609,0.0009539529,0.0009887128,0.001671279,0.002041283,0.0002235828],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001285811,"about_ca_system_score_gemma":0.001874875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005396524,"about_ca_topic_score_gemma":0.004095817,"domain_scores_codex":[0.9987746,0.0007046381,0.00005736928,0.0001276149,0.0002281813,0.0001076703],"domain_scores_gemma":[0.9989812,0.0006945507,0.00009212599,0.00003175444,0.0001552576,0.00004499064],"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.00001257466,0.00002464263,0.0002447264,0.0001041018,0.00003943135,0.00006517045,0.00004897212,0.9665526,0.0004564096,0.01800448,0.0002762278,0.01417079],"study_design_scores_gemma":[0.000003949293,0.00002001369,0.00003611728,0.00001109833,0.000006318606,0.00001203849,0.00001489599,0.9880271,0.0001933081,0.01108854,0.0005814685,0.00000516374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006632773,0.000538442,0.9892945,0.0001668348,0.00003443681,0.00004524359,0.00002182654,0.00005597904,0.003209888],"genre_scores_gemma":[0.5545452,0.001997183,0.4378328,0.0001461231,0.00007756973,0.0005306171,0.0001394972,0.00008063799,0.004650393],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005396524,"threshold_uncertainty_score":0.01073021,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149139265","doi":"10.3138/infor.48.3.143","title":"Goal Programming Model for Fire and Emergency Service Facilities Site Selection","year":2010,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"Laurentian University","funders":"","keywords":"Decision maker; Operations research; Service (business); Process (computing); Computer science; Site selection; Selection (genetic algorithm); Goal programming; Function (biology); Decision-making; Operations management; Process management; Business; Engineering; Artificial intelligence; Marketing","authors":[{"name":"Ines Kanoun","is_ca":false},{"name":"Habib Chabchoub","is_ca":false},{"name":"Belaı̈d Aouni","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04245466412944671,"gpt":0.3167141210032354,"spread":0.2742594568737887,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001688972,0.001245942,0.001200738,0.0006820058,0.0006275085,0.002185086,0.001745421,0.001737611,0.003866835],"category_scores_gemma":[0.002022509,0.0005511924,0.001065664,0.001434498,0.0009851659,0.001094497,0.001101819,0.002211451,0.0005771269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00229036,"about_ca_system_score_gemma":0.002821733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01655686,"about_ca_topic_score_gemma":0.01205298,"domain_scores_codex":[0.9987041,0.0007672354,0.00003826056,0.0001464542,0.0001636677,0.000180284],"domain_scores_gemma":[0.9990387,0.0006649873,0.00008700151,0.00002107196,0.0001180958,0.00007012195],"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.00004745548,0.00005590375,0.0002022971,0.00007401221,0.00003973132,0.0001202805,0.00008121073,0.938844,0.0002054282,0.05487273,0.001043659,0.004413227],"study_design_scores_gemma":[0.00001898394,0.00002921764,0.00006802816,0.000009924916,0.00001146389,0.0000123507,0.00002619769,0.9830946,0.00005585159,0.01573654,0.0009294951,0.000007247857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02348362,0.0006967227,0.9543646,0.001175966,0.0001138838,0.0001395695,0.0004407601,0.0002293814,0.01935557],"genre_scores_gemma":[0.778847,0.001519187,0.1987486,0.000381512,0.0001300589,0.0009588805,0.0006650249,0.00008547118,0.01866427],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01655686,"threshold_uncertainty_score":0.03292096,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973531844","doi":"10.3168/jds.s0022-0302(06)72233-0","title":"Modeling Small-Scale Dairy Farms in Central Mexico Using Multi-Criteria Programming","year":2006,"lang":"en","type":"article","venue":"Journal of Dairy Science","topic":"Optimization and Mathematical Programming","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":"University of Guelph","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Forage; Agricultural science; Production (economics); Linear programming; Gross margin; Scale (ratio); Goal programming; Herd; Dairy cattle; Agricultural engineering; Business; Mathematics; Economics; Environmental science; Engineering; Operations research; Agronomy; Animal science; Biology; Geography; Mathematical optimization","authors":[{"name":"D. Val-Arreola","is_ca":false},{"name":"E. Kebreab","is_ca":true},{"name":"J. France","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03319599578076352,"gpt":0.2780401787409914,"spread":0.2448441829602278,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007805991,0.0005325576,0.0005056459,0.0004338597,0.000597363,0.001327548,0.0008738647,0.001090936,0.001429256],"category_scores_gemma":[0.001256132,0.0005016678,0.0005826168,0.0006266049,0.0004590422,0.0006429152,0.0005080844,0.0004545269,0.00006708469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001964646,"about_ca_system_score_gemma":0.001513401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.08017536,"about_ca_topic_score_gemma":0.06292515,"domain_scores_codex":[0.9997595,0.00009456697,0.00000990861,0.00005036751,0.00002186516,0.00006388472],"domain_scores_gemma":[0.9992321,0.0004973829,0.0001324002,0.0000188341,0.00006683473,0.00005244363],"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.00002584157,0.00002385441,0.002381838,0.000009033396,0.00001318242,0.00004367634,0.00001303646,0.9961089,0.0001583598,0.0003285164,0.0000459124,0.0008477868],"study_design_scores_gemma":[0.00001342787,0.00002447459,0.001374768,0.000002241084,0.000007486934,0.000003809458,0.00004552896,0.9980849,0.00006459181,0.0002924213,0.00008317492,0.000003216545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9484981,0.0001492663,0.048351,0.0002768619,0.000009754081,0.00007546206,0.0003730904,0.00006956148,0.002196915],"genre_scores_gemma":[0.9894461,0.0001282338,0.009150883,0.00001278405,0.000004711778,0.0001207351,0.0001563626,0.000007624535,0.0009724849],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08017536,"threshold_uncertainty_score":0.1594174,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065990064","doi":"10.1057/jors.2010.30","title":"Production planning with uncertainty in the quality of raw materials: a case in sawmills","year":2010,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Optimization and Mathematical Programming","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":"Université Laval","funders":"","keywords":"Production planning; Time horizon; Production (economics); Computer science; Stochastic programming; Mathematical optimization; Product (mathematics); Capacity planning; Quality (philosophy); Operations research; Mathematics; Economics","authors":[{"name":"Masoumeh Kazemi Zanjani","is_ca":true},{"name":"Mustapha Nourelfath","is_ca":true},{"name":"Daoud Aı̈t-Kadi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08852421422799558,"gpt":0.4093710774011269,"spread":0.3208468631731314,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001775079,0.0006386227,0.001128545,0.0005013045,0.0007904035,0.001599957,0.001019136,0.002154744,0.002099841],"category_scores_gemma":[0.003324185,0.000879403,0.00095357,0.001130317,0.001143547,0.001250203,0.0007387953,0.001138581,0.0001059632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00138732,"about_ca_system_score_gemma":0.001056178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00768397,"about_ca_topic_score_gemma":0.005267237,"domain_scores_codex":[0.9993374,0.0003166922,0.00002284515,0.0001049146,0.0001175656,0.0001005105],"domain_scores_gemma":[0.9975584,0.001846442,0.0002987047,0.00006675582,0.0001031394,0.0001266438],"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.00007963018,0.00004433309,0.0007099865,0.00004112237,0.00001319463,0.001112743,0.00004258692,0.9881345,0.0007532191,0.006609225,0.0001101438,0.00234924],"study_design_scores_gemma":[0.00002767141,0.0001174582,0.000724823,0.000008568877,0.00001766554,0.00012229,0.00009313069,0.992039,0.0006223961,0.005952625,0.0002569117,0.00001752807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7740097,0.0006526556,0.2163608,0.0009499525,0.00003236593,0.0001651967,0.0003025996,0.0001216398,0.007405099],"genre_scores_gemma":[0.986433,0.0001714136,0.01216896,0.00001470369,0.000008882095,0.00004047517,0.00003039741,0.00001109986,0.00112108],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00768397,"threshold_uncertainty_score":0.01527846,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2774074136","doi":"10.1007/bf03398807","title":"Revisiting Dinkelbach-type algorithms for generalized fractional programs","year":2008,"lang":"en","type":"article","venue":"OPSEARCH","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":25,"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","funders":"","keywords":"Iterated function; Computer science; Type (biology); Mathematical optimization; Algorithm; Fractional programming; Applied mathematics; Mathematics; Nonlinear programming; Nonlinear system","authors":[{"name":"Jean-Pierre Crouzeix","is_ca":false},{"name":"Jacques A. Ferland","is_ca":true},{"name":"Hien Van Nguyen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09134289677039446,"gpt":0.3276415467877081,"spread":0.2362986500173136,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003515108,0.001200679,0.001471625,0.001483934,0.001121546,0.002508241,0.001975863,0.001839309,0.008431064],"category_scores_gemma":[0.0139126,0.0005368384,0.001261653,0.002080315,0.001727303,0.003703173,0.002917182,0.002837142,0.001360819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001705393,"about_ca_system_score_gemma":0.001778081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002911392,"about_ca_topic_score_gemma":0.00494731,"domain_scores_codex":[0.9985465,0.0006700405,0.00008795516,0.0001884962,0.0003840863,0.0001227534],"domain_scores_gemma":[0.9972188,0.001805784,0.00008575927,0.0003902337,0.0004138162,0.00008564207],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001548822,0.0001039379,0.0006631407,0.0002451121,0.00006024406,0.00005254625,0.000196287,0.1816443,0.001515834,0.609738,0.004399193,0.2012264],"study_design_scores_gemma":[0.00003420929,0.00005233251,0.0001308149,0.0001080825,0.0000181839,0.00004780974,0.00004868784,0.7000614,0.00139669,0.2886872,0.009394516,0.00001998496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008386067,0.0006075221,0.9769163,0.0004471916,0.0002737557,0.00005578698,0.00004619829,0.0001966277,0.01307056],"genre_scores_gemma":[0.1839115,0.0009755822,0.799596,0.0006525706,0.0002275034,0.0002061132,0.0001427533,0.0004069428,0.01388097],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008431064,"threshold_uncertainty_score":0.02820474,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2786155106","doi":"10.1016/j.ejor.2018.01.022","title":"Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design","year":2018,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":24,"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","funders":"European Regional Development Fund; Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; European Commission","keywords":"Heuristics; Mathematical optimization; Linear programming; Integer programming; Mathematics; Heuristic; Limit (mathematics); Fixed charge; Scaling; Iterative method; Set (abstract data type); Integer (computer science); Algorithm; Computer science","authors":[{"name":"Bernard Gendron","is_ca":true},{"name":"Saı̈d Hanafi","is_ca":false},{"name":"Raca Todosijević","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1243125413768113,"gpt":0.3508453785029433,"spread":0.226532837126132,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001261007,0.00109661,0.0009606261,0.0008863135,0.000522876,0.001110764,0.001351502,0.0008446975,0.003715091],"category_scores_gemma":[0.003906806,0.000667615,0.00097164,0.0008546094,0.0007681729,0.001154179,0.001129103,0.001550346,0.0004661606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009864216,"about_ca_system_score_gemma":0.001297706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00459762,"about_ca_topic_score_gemma":0.004691799,"domain_scores_codex":[0.9995771,0.0001839038,0.00001564384,0.00004544812,0.0001403189,0.00003755466],"domain_scores_gemma":[0.9987805,0.0007672912,0.00009819931,0.00006560438,0.0002489308,0.0000393371],"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.00002087504,0.00003813823,0.0001643751,0.00005479073,0.00001545336,0.00002338647,0.00004543173,0.9568185,0.00107262,0.02004911,0.0005197343,0.02117752],"study_design_scores_gemma":[0.00000135642,0.000009132649,0.00001267399,0.000002650645,0.000001529926,0.00000290288,0.000002161331,0.9974133,0.00008541225,0.002320715,0.0001464937,0.000001699859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005603657,0.0001295903,0.9897658,0.00008148215,0.00003300303,0.00004243949,0.00001532721,0.0001316373,0.004196987],"genre_scores_gemma":[0.5084659,0.0004552048,0.4844736,0.0001383369,0.00008463531,0.000401941,0.00007667646,0.0002436411,0.005659999],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00459762,"threshold_uncertainty_score":0.01242822,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070738041","doi":"10.1016/s0308-521x(01)00082-8","title":"Livestock manure systems for swine finishing enterprises","year":2002,"lang":"en","type":"article","venue":"Agricultural Systems","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Manure; Manure management; Agricultural science; Livestock; Environmental science; Agricultural engineering; Ammonia; Business; Mathematics; Agronomy; Engineering; Geography; Chemistry; Biology; Forestry","authors":[{"name":"David Stonehouse","is_ca":true},{"name":"Greg W. de Vos","is_ca":true},{"name":"Alfons Weersink","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01924228241561362,"gpt":0.1984967044175564,"spread":0.1792544220019427,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006006134,0.0002411714,0.0004048379,0.0002773511,0.0005173235,0.0009595508,0.000401192,0.0007439378,0.002215697],"category_scores_gemma":[0.001018768,0.0002012596,0.0003539479,0.0004716372,0.0002231664,0.0008011887,0.0005267074,0.0002798602,0.0001060664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008950726,"about_ca_system_score_gemma":0.0006972047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004252551,"about_ca_topic_score_gemma":0.007629335,"domain_scores_codex":[0.999761,0.0001241899,0.00001007295,0.00002569695,0.00003346506,0.00004542415],"domain_scores_gemma":[0.999713,0.0001694084,0.00004204473,0.00001407202,0.00004048762,0.00002084879],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.0003497823,0.0003027535,0.002639957,0.0001463991,0.00003888861,0.0001867257,0.00007105947,0.9254285,0.01119017,0.01063378,0.0008078286,0.04820428],"study_design_scores_gemma":[0.00005387916,0.0005182878,0.002143035,0.00001811672,0.00003578456,0.00003775348,0.0001941711,0.9841071,0.002885914,0.008267337,0.001725221,0.00001331071],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8568362,0.00103231,0.1332291,0.0005883349,0.00005486805,0.0001197256,0.0001701265,0.00006363713,0.007905782],"genre_scores_gemma":[0.9890068,0.0002937218,0.008733573,0.00001380377,0.000008523854,0.00003892809,0.0000599825,0.000007022767,0.001837696],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004252551,"threshold_uncertainty_score":0.008455575,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2194624903","doi":"10.1007/s12351-015-0216-7","title":"Fuzzy chance-constrained geometric programming: the possibility, necessity and credibility approaches","year":2015,"lang":"en","type":"article","venue":"Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Credibility; Mathematical optimization; Computational intelligence; Ambiguity; Duality (order theory); Computer science; Credibility theory; Fuzzy logic; Optimization problem; Process (computing); Face (sociological concept); Mathematics; Artificial intelligence","authors":[{"name":"Rashed Khanjani Shiraz","is_ca":false},{"name":"Madjid Tavana","is_ca":false},{"name":"Hirofumi Fukuyama","is_ca":false},{"name":"Debora Di Caprio","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2686170978067754,"gpt":0.3633974369433609,"spread":0.09478033913658551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006646699,0.001562134,0.001866672,0.002814826,0.001189842,0.004310257,0.002187212,0.002333054,0.004977785],"category_scores_gemma":[0.0229837,0.000953078,0.00169874,0.002770884,0.005493975,0.007612254,0.002850398,0.004071499,0.0003214889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002652118,"about_ca_system_score_gemma":0.00231693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002062755,"about_ca_topic_score_gemma":0.001664704,"domain_scores_codex":[0.996735,0.002013872,0.0001166256,0.0002962087,0.0006680873,0.0001700536],"domain_scores_gemma":[0.9842969,0.01276418,0.0009223224,0.0003831609,0.001070747,0.0005628095],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001926652,0.0000124189,0.0001455717,0.00008001414,0.00003002073,0.00005069022,0.00007963701,0.0418818,0.0001317662,0.9486063,0.0008272537,0.008135286],"study_design_scores_gemma":[0.000006643408,0.00001854613,0.00009380924,0.00004919461,0.00001404296,0.00004407494,0.000042106,0.147811,0.0001023216,0.8503231,0.001476947,0.0000181827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007901699,0.0020705,0.974021,0.002379638,0.0001356419,0.00003088321,0.0000738583,0.00003245753,0.01335428],"genre_scores_gemma":[0.7150658,0.006402052,0.2629392,0.0005413102,0.001512955,0.0002409931,0.0001723023,0.0001295216,0.01299585],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006646699,"threshold_uncertainty_score":0.03515148,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152797042","doi":"10.5539/mas.v6n4p12","title":"Hybrid Two-Stage Algorithm for Solving Transportation Problem","year":2012,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Applied Science Private University","keywords":"Simplex algorithm; Mathematical optimization; Computer science; Algorithm; Genetic algorithm; Linear programming; Population; Multi stage; Hybrid algorithm (constraint satisfaction); Mathematics; Stochastic programming; Engineering","authors":[{"name":"Saleem Z. Ramadan","is_ca":false},{"name":"Imad Zeyad Ramadan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01549142708471356,"gpt":0.2449014599449899,"spread":0.2294100328602763,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007321879,0.0007489849,0.0007821274,0.0008949382,0.000543205,0.0008006723,0.001746325,0.001715563,0.00502502],"category_scores_gemma":[0.001177974,0.0005049988,0.001127709,0.0009812143,0.0004274334,0.001065707,0.001031244,0.001022971,0.0008916053],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006678979,"about_ca_system_score_gemma":0.001274796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003966932,"about_ca_topic_score_gemma":0.003644038,"domain_scores_codex":[0.9994138,0.0001749036,0.00003458449,0.0001171459,0.0001976817,0.00006192754],"domain_scores_gemma":[0.9996388,0.0001785321,0.00002637572,0.00003525296,0.000102262,0.00001879367],"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.0001524898,0.0001244669,0.0006758188,0.0001892293,0.00008604964,0.000107508,0.00009561749,0.7907422,0.006241906,0.02665067,0.002956205,0.1719777],"study_design_scores_gemma":[0.00002672776,0.00005468095,0.00007938629,0.000006449171,0.000008913371,0.00004108487,0.000006564327,0.9941922,0.0009213944,0.00264971,0.002002734,0.00001019176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004987756,0.0001362797,0.9917641,0.00006196956,0.00003800321,0.0000784113,0.00002619603,0.0003094468,0.002597773],"genre_scores_gemma":[0.171653,0.0002504246,0.8195504,0.0001259163,0.0000381107,0.000571398,0.0002528218,0.0001067174,0.007451213],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00502502,"threshold_uncertainty_score":0.01681042,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134787308","doi":"10.3138/infor.47.1.5","title":"A Discrete Stochastic Goal Program for Portfolio Selection: The Case of United Arab Emirates Equity Market","year":2009,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Portfolio; Equity (law); Stochastic programming; Goal programming; Normality; Selection (genetic algorithm); Economics; Computer science; Econometrics; Portfolio optimization; Modern portfolio theory; Actuarial science; Financial economics; Operations research; Mathematical optimization; Mathematics; Statistics; Machine learning","authors":[{"name":"Fouad Ben Abdelaziz","is_ca":false},{"name":"Rimeh El Fayedh","is_ca":false},{"name":"Ananth Rao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04476132573014004,"gpt":0.3676382944881015,"spread":0.3228769687579615,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002723154,0.0007019489,0.0007917793,0.0006564786,0.0004759525,0.001297669,0.0008064059,0.001067116,0.002149991],"category_scores_gemma":[0.003382685,0.0003506645,0.0007198732,0.0005593232,0.0008257968,0.0006817654,0.001001017,0.0009604961,0.0001081469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00146813,"about_ca_system_score_gemma":0.001714682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008377704,"about_ca_topic_score_gemma":0.006195056,"domain_scores_codex":[0.9990382,0.0006460207,0.00002053892,0.0000839644,0.0001166578,0.0000946593],"domain_scores_gemma":[0.9984108,0.001160187,0.0001394983,0.00003422571,0.0001696193,0.00008558904],"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.00002231147,0.00003091712,0.0003507806,0.00001723775,0.00001787137,0.00006315404,0.00002406868,0.9795829,0.00009998277,0.01667976,0.0002526462,0.002858353],"study_design_scores_gemma":[0.000005886013,0.00001075034,0.00004608849,0.000002501679,0.000002597597,0.00000462065,0.000006419127,0.9973028,0.00002971168,0.00249166,0.00009543639,0.000001556953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1600826,0.0002608167,0.8282602,0.001084596,0.00003324303,0.0001285274,0.0001314145,0.0001106834,0.009907976],"genre_scores_gemma":[0.887897,0.0001757789,0.1072484,0.0001097089,0.00002851649,0.0002269777,0.0001152496,0.00002396831,0.00417458],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008377704,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4381885510","doi":"10.1016/j.eswa.2023.120899","title":"Developing a fuzzy optimized model for selecting a maintenance strategy in the paper industry: An integrated FGP-ANP-FMEA approach","year":2023,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Optimization and Mathematical Programming","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":"University of Windsor","funders":"","keywords":"Computer science; Failure mode and effects analysis; Risk analysis (engineering); Preventive maintenance; Fuzzy logic; Predictive maintenance; Reliability engineering; Proactive maintenance; Optimal maintenance; Operations research; Business; Engineering; Artificial intelligence","authors":[{"name":"Foroogh Behnia","is_ca":true},{"name":"Habib Zare Ahmadabadi","is_ca":false},{"name":"Beth‐Anne Schuelke‐Leech","is_ca":true},{"name":"Mitra Mirhassani","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05490420174599783,"gpt":0.2941163811366332,"spread":0.2392121793906354,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008097459,0.0008913849,0.001233799,0.001065406,0.0005974914,0.001342662,0.001372181,0.001924126,0.002812225],"category_scores_gemma":[0.001384842,0.000644094,0.001331643,0.0008625173,0.0004126712,0.000920614,0.0007003606,0.0008786246,0.0003746093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001187331,"about_ca_system_score_gemma":0.001687196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02740608,"about_ca_topic_score_gemma":0.0172782,"domain_scores_codex":[0.9997631,0.00006501946,0.00001270474,0.00004850396,0.00007207452,0.00003855499],"domain_scores_gemma":[0.9996299,0.0002063607,0.00003626023,0.00001589279,0.00009685555,0.00001475793],"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.000006909094,0.00001117774,0.0001094696,0.00002124063,0.00001235393,0.00002267257,0.000009369504,0.9925647,0.000342518,0.00127688,0.0001221294,0.00550051],"study_design_scores_gemma":[0.000001594049,0.00000531747,0.00003219424,0.000002676933,0.000004513869,0.000003806209,0.000003307441,0.9992625,0.00009261049,0.0005016223,0.00008829163,0.000001551136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01714808,0.0001999149,0.9762387,0.0001319989,0.00003149754,0.00007649032,0.00009417501,0.0002068864,0.005872328],"genre_scores_gemma":[0.7233408,0.0004196521,0.2680795,0.0001336798,0.00004849078,0.0004919702,0.0002498682,0.0001008385,0.007135219],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02740608,"threshold_uncertainty_score":0.05449313,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964676846","doi":"10.4236/ajor.2011.14024","title":"Solving Bilevel Linear Multiobjective Programming Problems","year":2011,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Optimization and Mathematical Programming","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":"Université de Montréal","funders":"","keywords":"Bilevel optimization; Mathematical optimization; Linear programming; Decision maker; Pareto principle; Set (abstract data type); Pareto optimal; Computer science; Linear-fractional programming; Multiobjective programming; Mathematics; Resolution (logic); Multi-objective optimization; Optimization problem; Operations research; Artificial intelligence","authors":[{"name":"Calice Olivier Pieume","is_ca":true},{"name":"Patrice Marcotte","is_ca":true},{"name":"Laure Pauline Fotso","is_ca":false},{"name":"Patrick Siarry","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.109670152862659,"gpt":0.3538734093731688,"spread":0.2442032565105098,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00212204,0.001421507,0.001989344,0.0007083859,0.0005984301,0.002550283,0.001138986,0.001936296,0.002839528],"category_scores_gemma":[0.005114761,0.0006374569,0.001121767,0.00130459,0.0007875319,0.001511736,0.00213034,0.002087505,0.0005826098],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004851343,"about_ca_system_score_gemma":0.001129228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001303327,"about_ca_topic_score_gemma":0.000897788,"domain_scores_codex":[0.9987932,0.0006521377,0.00006372943,0.0001490284,0.0002062409,0.000135662],"domain_scores_gemma":[0.9982759,0.001289094,0.0001297015,0.00007208697,0.0001714789,0.0000617262],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000432192,0.00006039835,0.0002935917,0.0004118371,0.00007744761,0.0001309745,0.0001239662,0.9229344,0.001225531,0.03099276,0.0006906274,0.0430152],"study_design_scores_gemma":[0.00001213026,0.0000374716,0.00004027837,0.00002867458,0.00001120014,0.00003364084,0.00004925981,0.9637544,0.0005197996,0.03415357,0.001351545,0.000007969974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009230673,0.0005556478,0.9865208,0.0001629192,0.00003261214,0.00003893284,0.00002786226,0.00005730288,0.00337331],"genre_scores_gemma":[0.4082527,0.002190225,0.5814542,0.000186216,0.0001780701,0.000477685,0.0002903724,0.0001550909,0.006815475],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002839528,"threshold_uncertainty_score":0.0112226,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154326504","doi":"10.1287/opre.1120.1041","title":"Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron","year":2012,"lang":"en","type":"article","venue":"Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":21,"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":"Polyhedron; Heuristics; Fixed charge; Projection (relational algebra); Facet (psychology); Variable (mathematics); Mathematical optimization; Fixed cost; Computer science; Space (punctuation); Transportation theory; Facility location problem; Charge (physics); Unit (ring theory); Fixed point; Mathematics; Combinatorics; Algorithm; Physics; Mathematical analysis","authors":[{"name":"Yogesh K. Agarwal","is_ca":false},{"name":"Y.P. Aneja","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05916643006389415,"gpt":0.3412065012197392,"spread":0.2820400711558451,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006448434,0.0007220649,0.0008860506,0.0003774335,0.0008257893,0.002349089,0.001158481,0.00110557,0.006248616],"category_scores_gemma":[0.002286062,0.0003590928,0.001024857,0.001097503,0.001152119,0.002598757,0.001287997,0.001509713,0.0004982541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009524117,"about_ca_system_score_gemma":0.001599798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004767458,"about_ca_topic_score_gemma":0.002676659,"domain_scores_codex":[0.9992679,0.0002104276,0.0000285013,0.0001328789,0.0002207396,0.0001396686],"domain_scores_gemma":[0.9993981,0.0002671627,0.00006740759,0.00006836158,0.0001050314,0.00009381269],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003057191,0.0002590616,0.002657754,0.0004128944,0.00006772781,0.0008989784,0.0003650067,0.4451757,0.004855097,0.4551166,0.007512758,0.08237268],"study_design_scores_gemma":[0.00006545331,0.0001322338,0.0009325146,0.00005652792,0.00002214317,0.0004722577,0.0003511721,0.6948493,0.002806133,0.2920709,0.008206148,0.00003515814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1255557,0.0004796015,0.8501697,0.0007756599,0.00009954552,0.0003341273,0.0007327336,0.0001721221,0.02168086],"genre_scores_gemma":[0.7607854,0.0009631224,0.226413,0.000151159,0.0001077012,0.0004196064,0.001190115,0.00009665056,0.009873101],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006248616,"threshold_uncertainty_score":0.02090371,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4360978753","doi":"10.1007/s10878-023-01002-z","title":"An augmented Lagrangian approach with general constraints to solve nonlinear models of the large-scale reliable inventory systems","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Augmented Lagrangian method; Theory of computation; Mathematical optimization; Nonlinear system; Computer science; Nonlinear programming; Lagrange multiplier; Minification; Scale (ratio); Lagrangian relaxation; Mathematics; Algorithm","authors":[{"name":"Abolfazl Gharaei","is_ca":true},{"name":"Alireza Amjadian","is_ca":false},{"name":"Ali Shavandi","is_ca":false},{"name":"Amir Amjadian","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01169545611259706,"gpt":0.2239217104963334,"spread":0.2122262543837363,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001415757,0.001277218,0.001739832,0.0008380609,0.0006394553,0.001523355,0.001680905,0.001623459,0.003547951],"category_scores_gemma":[0.002991013,0.001107542,0.001280206,0.001107824,0.0008855116,0.001468801,0.001734747,0.002025688,0.0004441983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008072551,"about_ca_system_score_gemma":0.002022585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01297838,"about_ca_topic_score_gemma":0.01434134,"domain_scores_codex":[0.9996228,0.0001765608,0.00001738555,0.00004040898,0.00009545163,0.00004731484],"domain_scores_gemma":[0.9988294,0.0007439009,0.0000967613,0.00005950902,0.0002045255,0.00006575091],"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.000008241872,0.00001580012,0.00006459445,0.0000266026,0.00001525494,0.00002945095,0.00001049956,0.9916151,0.0001056972,0.005089036,0.0003336989,0.002686093],"study_design_scores_gemma":[0.0000022987,0.000003606392,0.00001080397,0.000002031141,0.000001589211,0.000001550954,0.000002201787,0.9988086,0.00001401917,0.001051077,0.0001008817,0.00000133108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01386634,0.0005232213,0.9787586,0.0003245299,0.0001188695,0.00007789156,0.000145875,0.0001400935,0.006044583],"genre_scores_gemma":[0.6330602,0.0008060489,0.3535166,0.0002596066,0.000216908,0.0006717558,0.0004911901,0.0002089864,0.0107687],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01297838,"threshold_uncertainty_score":0.02580565,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2750313416","doi":"10.1155/2017/2139791","title":"Modified Approach for Optimization of Real Life Transportation Problem in Neutrosophic Environment","year":2017,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":20,"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":"","keywords":"Transportation theory; Minification; Transshipment (information security); Computer science; Mathematical optimization; Operations research; Mathematics","authors":[{"name":"Akanksha Singh","is_ca":false},{"name":"Amit Kumar","is_ca":false},{"name":"S. S. Appadoo","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02176716433971144,"gpt":0.2194571165274913,"spread":0.1976899521877798,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000977247,0.001141937,0.0008683235,0.001060127,0.0005785914,0.001230344,0.001663886,0.001594478,0.005676135],"category_scores_gemma":[0.001379181,0.0003384684,0.001751694,0.0009636663,0.0005698449,0.00155737,0.001231768,0.001514853,0.0005541933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001222816,"about_ca_system_score_gemma":0.00100579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003085682,"about_ca_topic_score_gemma":0.003130568,"domain_scores_codex":[0.999247,0.0002822947,0.00003656444,0.0001578857,0.0002064801,0.00006991871],"domain_scores_gemma":[0.9996939,0.0001310283,0.0000256844,0.00002399139,0.0001021703,0.00002328829],"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.0001039018,0.0001354663,0.0007288005,0.0007506535,0.0001732798,0.0005166815,0.0002446722,0.7147304,0.007107915,0.1867471,0.008995719,0.07976536],"study_design_scores_gemma":[0.00001293983,0.00007119596,0.0001862923,0.00003019852,0.0000335698,0.00009763656,0.00004059708,0.9618036,0.0006116364,0.0306497,0.006446727,0.00001598504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006218503,0.001112602,0.9838882,0.0004430937,0.0001757364,0.00006458775,0.00006285855,0.00004614725,0.00798823],"genre_scores_gemma":[0.4012159,0.004096064,0.5678086,0.0007185172,0.0005883211,0.0006745243,0.0004437449,0.0002128109,0.02424144],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005676135,"threshold_uncertainty_score":0.01898849,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041943131","doi":"10.5267/j.msl.2011.05.005","title":"A BSC method for supplier selection strategy using TOPSIS and VIKOR: A case study of part maker industry","year":2011,"lang":"en","type":"article","venue":"Management Science Letters","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"TOPSIS; VIKOR method; Selection (genetic algorithm); Computer science; Operations research; Supplier evaluation; Operations management; Business; Process management; Supply chain management; Supply chain; Mathematics; Marketing; Economics; Artificial intelligence","authors":[{"name":"Adel Azar","is_ca":false},{"name":"Laya Olfat","is_ca":false},{"name":"Khosravani Farzaneh","is_ca":false},{"name":"Reza Jalali","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06245540750417248,"gpt":0.3049574885431869,"spread":0.2425020810390144,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002595978,0.0007842088,0.0007325002,0.001884757,0.001347516,0.001342651,0.001113346,0.00141776,0.004065403],"category_scores_gemma":[0.003161681,0.0003968645,0.0008479773,0.003242653,0.0005602004,0.0007755861,0.0006080354,0.0007480059,0.0003874327],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002045818,"about_ca_system_score_gemma":0.002305944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02223834,"about_ca_topic_score_gemma":0.02846743,"domain_scores_codex":[0.9980782,0.001234394,0.00006904734,0.0001123994,0.000431061,0.00007494989],"domain_scores_gemma":[0.9982328,0.001181414,0.00008254193,0.00008311842,0.0003631602,0.00005687226],"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.0006768713,0.00112355,0.0139922,0.001120801,0.0002256151,0.004092817,0.003887883,0.5606436,0.01036287,0.04112179,0.006256405,0.3564956],"study_design_scores_gemma":[0.0001217956,0.0003416615,0.003597755,0.00007622063,0.00006877612,0.0003719963,0.002298754,0.9810268,0.003401613,0.003792167,0.00483247,0.00006991317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5162202,0.000449175,0.4586205,0.0008407807,0.0000630889,0.001145349,0.0005559519,0.0003394161,0.0217656],"genre_scores_gemma":[0.698851,0.000301061,0.2955228,0.00003112447,0.000007018595,0.0005477526,0.0002458881,0.00002628866,0.004467049],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02223834,"threshold_uncertainty_score":0.04421782,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2250241007","doi":"10.3138/infor.52.3.138","title":"A Fuzzy Goal Programming Model for Venture Capital Investment Decision Making","year":2014,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Venture capital; Cardinality (data modeling); Investment (military); Fuzzy logic; Selection (genetic algorithm); Computer science; Operations research; Process (computing); Capital (architecture); Decision-making; Economics; Business; Actuarial science; Finance; Operations management; Mathematics; Artificial intelligence; Data mining","authors":[{"name":"Belaı̈d Aouni","is_ca":false},{"name":"Cinzia Colapinto","is_ca":false},{"name":"Davide La Torre","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03860612207624459,"gpt":0.329191563143555,"spread":0.2905854410673104,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001625284,0.001067036,0.0009812168,0.0007555431,0.0006256183,0.002369197,0.001547921,0.001900467,0.00331229],"category_scores_gemma":[0.002068854,0.0004813832,0.001117495,0.00129126,0.001005698,0.001432475,0.001098128,0.001915149,0.0004926898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001852141,"about_ca_system_score_gemma":0.002174387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008420427,"about_ca_topic_score_gemma":0.005601095,"domain_scores_codex":[0.9990484,0.0004606266,0.00004291848,0.0001571993,0.0001861876,0.0001046708],"domain_scores_gemma":[0.9992898,0.0004863527,0.00006169111,0.00001884516,0.00009436645,0.00004901385],"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.00003448145,0.00004063218,0.0001893819,0.000088624,0.00003514179,0.00013993,0.0001062227,0.8878374,0.0004347947,0.1003935,0.0008624623,0.009837393],"study_design_scores_gemma":[0.00001246964,0.00002610148,0.00005720559,0.00001676961,0.000009609528,0.00002196518,0.00002040111,0.9615375,0.0001001002,0.03708624,0.001101768,0.000009805462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009908089,0.0003718524,0.9795946,0.0006290515,0.00004667671,0.00007110151,0.0002136609,0.00009864596,0.009066181],"genre_scores_gemma":[0.6516954,0.001173713,0.3348,0.0003122063,0.00009031685,0.0007701468,0.0004030698,0.00005124482,0.01070389],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008420427,"threshold_uncertainty_score":0.01674283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1963636653","doi":"10.1139/x10-179","title":"Using preference information in developing alternative forest plans","year":2010,"lang":"en","type":"article","venue":"Canadian Journal of Forest Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Multiple-criteria decision analysis; Preference; Preference elicitation; Context (archaeology); Computer science; Variety (cybernetics); Operations research; Group decision-making; Process (computing); Management science; Function (biology); Mathematics; Economics; Artificial intelligence; Statistics; Geography; Psychology","authors":[{"name":"Kyle Eyvindson","is_ca":false},{"name":"Annika Kangas","is_ca":false},{"name":"Mikko Kurttila","is_ca":false},{"name":"Teppo Hujala","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1208528920106481,"gpt":0.3366251721265314,"spread":0.2157722801158832,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005348553,0.0008177072,0.0005881178,0.001921102,0.0005743234,0.001252558,0.0009229185,0.0006033763,0.00296972],"category_scores_gemma":[0.01244918,0.0004687398,0.0008172402,0.001799415,0.0006878823,0.002274732,0.001083275,0.0007797353,0.0002492848],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001147716,"about_ca_system_score_gemma":0.001691668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002275935,"about_ca_topic_score_gemma":0.005394912,"domain_scores_codex":[0.9964684,0.002300589,0.0001317795,0.0001592033,0.0007848492,0.0001551974],"domain_scores_gemma":[0.995562,0.003331212,0.0002853468,0.0002541495,0.0004925472,0.0000747993],"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.0003306391,0.0002495125,0.002911862,0.0005352719,0.0001358618,0.0005590883,0.001128359,0.5003791,0.004783803,0.1195264,0.001160963,0.3682991],"study_design_scores_gemma":[0.0001150427,0.0003372826,0.001141407,0.0001532064,0.000101545,0.0002089615,0.0005518694,0.8687145,0.006486894,0.1166915,0.005430102,0.0000676527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07706579,0.0002098318,0.9116398,0.0003362662,0.00001615767,0.000313173,0.00009652111,0.00009060862,0.01023204],"genre_scores_gemma":[0.420852,0.000269707,0.5774136,0.00005013575,0.000007715664,0.0003041222,0.0001196992,0.00002121651,0.0009617567],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005348553,"threshold_uncertainty_score":0.02828616,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}