{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","bibliometrics","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["sts"],"category_scores_codex":[0.01271051,0.0005545681,0.0005461235,0.01140436,0.001497808,0.002827009,0.007042945,0.0002510592,0.001942447],"category_scores_gemma":[0.001554037,0.0005783798,0.0001356352,0.005799676,0.009151137,0.004929994,0.003551047,0.002177486,0.0002814766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003330401,"about_ca_system_score_gemma":0.000791559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001450991,"about_ca_topic_score_gemma":0.002649293,"domain_scores_codex":[0.9861467,0.0002067702,0.001760218,0.001558329,0.008738667,0.001589281],"domain_scores_gemma":[0.9947727,0.0002290036,0.00007554522,0.001411465,0.003162355,0.0003489269],"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.00005330098,0.0003168792,0.00003577051,0.0002578575,0.0001196199,0.0001054082,0.0006686032,0.2763981,0.001074523,0.7133514,0.003652886,0.003965688],"study_design_scores_gemma":[0.001647216,0.0002446439,0.000624404,0.002165018,0.00004076527,0.00004149073,0.004135163,0.5473665,0.002989461,0.04200934,0.3972454,0.001490592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.001022123,0.0002043664,0.01037998,0.002964101,0.003742011,0.003714392,0.0001571409,0.0002086894,0.9776072],"genre_scores_gemma":[0.082486,0.01371541,0.1521325,0.0001085977,0.0005080253,0.002516873,0.0005913069,0.0002015285,0.7477398],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.6713421,"threshold_uncertainty_score":0.9998021,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003764254,0.00006662653,0.000113518,0.00007173776,0.00005154963,0.00001748712,0.00007614922,0.00001885149,0.00005030804],"category_scores_gemma":[0.00005358461,0.0000594046,0.00001753129,0.0003642382,0.00002012932,0.00008050596,0.00003325708,0.00009207775,8.280999e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002959269,"about_ca_system_score_gemma":0.000008225524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001920184,"about_ca_topic_score_gemma":0.000009353498,"domain_scores_codex":[0.999392,0.00003777079,0.0002972741,0.00005057652,0.0001417258,0.0000806057],"domain_scores_gemma":[0.9997495,0.00006085161,0.00004479956,0.0001023337,0.00002588315,0.00001661815],"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.000002490176,0.00007990367,0.0001794107,0.0003744213,0.000007000674,2.12294e-7,0.002978318,0.9895857,0.00008030826,0.001766868,0.0001079716,0.004837425],"study_design_scores_gemma":[0.0001157457,0.00001443591,0.00007679644,0.00002465645,0.000004517678,0.000003632268,0.0001001666,0.9968161,0.001065707,0.001262381,0.0004417632,0.0000741007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01370809,0.00003335589,0.9828478,0.00006225329,0.00005959034,0.000482717,0.00001559467,0.0001459428,0.002644699],"genre_scores_gemma":[0.7962658,0.00005839647,0.2031752,0.00003876794,0.000006399148,0.0001241472,0.0000537675,0.0000450817,0.0002324078],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7825578,"threshold_uncertainty_score":0.2422449,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00005656862,0.0002365295,0.0002380003,0.00006477421,0.00003406736,0.00005486369,0.0001034195,0.0003424416,0.002796958],"category_scores_gemma":[0.00001293785,0.000222161,0.00008500663,0.0000158103,0.00008154457,0.00004173117,0.00002115517,0.0004324956,0.0003788375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000159801,"about_ca_system_score_gemma":0.000009556245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.839548e-7,"about_ca_topic_score_gemma":0.000005281585,"domain_scores_codex":[0.9993039,9.23482e-7,0.0002276309,0.0001469363,0.0001233308,0.0001972176],"domain_scores_gemma":[0.9996023,0.00002763039,0.00003199092,0.0001983381,0.00003838479,0.0001014022],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[7.566302e-7,0.000007309778,6.812378e-8,0.0002924934,0.00005853213,0.000009922148,0.00004858542,0.0001068751,0.0001390171,0.794444,0.000462807,0.2044297],"study_design_scores_gemma":[0.000114295,0.0000127312,3.71099e-8,0.00009648239,0.00002570935,0.00001250245,0.000005143176,0.006412175,0.0002167979,0.01110135,0.9816219,0.0003808617],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[6.995611e-7,0.0001035949,0.08607303,0.00003342932,0.0002914681,0.0002816307,0.00000311909,0.001155642,0.9120574],"genre_scores_gemma":[0.001228038,0.00008745541,0.2460253,0.00007617924,0.0002236141,0.00003011426,0.0000503557,0.0001675278,0.7521114],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9811591,"threshold_uncertainty_score":0.9981146,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00115237,0.0001490899,0.0002059479,0.00009013067,0.0002619022,0.0002020509,0.000141245,0.00006839224,0.0002150189],"category_scores_gemma":[0.00006963887,0.0001210461,0.0001056163,0.0002570475,0.00001484895,0.000130104,0.000006701237,0.0003402145,0.00003990631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006972288,"about_ca_system_score_gemma":0.00003356343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000112473,"about_ca_topic_score_gemma":2.639025e-7,"domain_scores_codex":[0.9987755,0.00003495737,0.000443776,0.00008000048,0.0001936996,0.0004720519],"domain_scores_gemma":[0.998961,0.0006399751,0.00005070887,0.00009387924,0.00008952881,0.0001648813],"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.0000205773,0.000008673918,0.000002256543,0.00002833173,0.00002105627,0.000002577229,0.0001308732,0.7085003,0.000007874386,0.0002963334,0.000754249,0.2902269],"study_design_scores_gemma":[0.0006382341,0.0001205338,0.000004724255,0.0001112043,0.000009078032,0.00002819057,0.00003037712,0.9839568,0.0002513707,0.0009621308,0.01373078,0.0001565331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00314387,0.00002101739,0.994144,0.00006979647,0.0001586152,0.0002714217,9.416795e-7,0.000243156,0.001947158],"genre_scores_gemma":[0.08858147,0.00000550976,0.9105452,0.0004878836,0.0002738727,0.000004323125,0.000003554187,0.0000385947,0.00005959752],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2900704,"threshold_uncertainty_score":0.4936115,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006104122,0.0001069658,0.0001442019,0.00004113598,0.00003314075,0.00004100401,0.00003266837,0.00005398511,0.000001578008],"category_scores_gemma":[0.000004467625,0.00008453715,0.00001742795,0.00001719568,0.0000385629,0.0001386082,0.00001581103,0.00001821522,5.742472e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002562488,"about_ca_system_score_gemma":0.000001768856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001543163,"about_ca_topic_score_gemma":0.000001222964,"domain_scores_codex":[0.9994764,0.00002092879,0.0001914106,0.0001569683,0.00005117881,0.0001030545],"domain_scores_gemma":[0.9997128,0.00005288723,0.00005156735,0.0001025938,0.00001282918,0.00006733917],"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.00001590368,0.0001685804,0.008917346,0.0003361987,0.0001128789,6.432311e-7,0.001323572,0.7675256,0.007079061,0.0000282931,0.0000376408,0.2144543],"study_design_scores_gemma":[0.00111357,0.00008510069,0.001899183,0.00004372613,0.00002025274,0.000001673156,0.00002122361,0.9964138,0.0001732564,0.000001038729,0.0001108338,0.0001163934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01389689,0.0002207756,0.9851432,0.000003754497,0.0001202309,0.0005450933,0.00001827053,0.0000506937,0.0000010455],"genre_scores_gemma":[0.5187804,0.0001151936,0.4809366,0.000003473958,0.00004461329,0.00003928647,0.00001783521,0.00002190244,0.00004070798],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5048835,"threshold_uncertainty_score":0.3447325,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004016779,0.0002437116,0.0003832357,0.00009430252,0.00006996389,0.0002004629,0.00005213293,0.0001000975,0.000002548815],"category_scores_gemma":[0.00003583496,0.0001563602,0.00002195523,0.0002473037,0.00008048423,0.0001609118,0.00001400325,0.0001832676,0.000004186646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002767315,"about_ca_system_score_gemma":0.00001687566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006473273,"about_ca_topic_score_gemma":0.00005129779,"domain_scores_codex":[0.9987428,0.00007559974,0.0003416792,0.0002703004,0.000199897,0.0003697795],"domain_scores_gemma":[0.9994485,0.00008531891,0.00006006207,0.0001924213,0.00003952453,0.0001741946],"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.0006742558,0.001602864,0.248505,0.03741912,0.001961326,0.001038243,0.0335066,0.3626986,0.0004787121,0.1402277,0.002303378,0.1695841],"study_design_scores_gemma":[0.02915832,0.004832046,0.0124083,0.01114538,0.000998083,0.003579339,0.05415537,0.6527176,0.0007254228,0.006877356,0.2123217,0.01108107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9686347,0.00320882,0.01287855,0.0001360722,0.000439941,0.002370308,0.0000195105,0.0006866549,0.01162543],"genre_scores_gemma":[0.971408,0.00007038192,0.02814152,0.00001530536,0.00002184908,0.00008673951,0.000009037019,0.00004693979,0.0002002437],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.290019,"threshold_uncertainty_score":0.6376184,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001006236,0.00008611563,0.0001343866,0.000116506,0.0002255634,0.0001014166,0.0001059553,0.00007022643,0.00005051139],"category_scores_gemma":[0.0003206279,0.00008091242,0.00002840029,0.0003929953,0.000123126,0.0001362521,0.00002528599,0.0002358394,0.00001535855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001700445,"about_ca_system_score_gemma":0.00005891309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005382003,"about_ca_topic_score_gemma":0.0000229198,"domain_scores_codex":[0.9989751,0.0001123521,0.0002342553,0.0001189752,0.0002499077,0.0003093966],"domain_scores_gemma":[0.9991707,0.0001791304,0.000008415477,0.0001894693,0.0003361105,0.0001162074],"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.000005586074,0.00006284684,0.00001206939,0.00005701763,0.00001407784,0.000001793006,0.0002378019,0.9895903,0.0003451922,0.007660192,0.0003947604,0.001618389],"study_design_scores_gemma":[0.0003684629,0.00009665495,0.00008475396,0.00009887445,0.000003292857,0.000001099665,0.00005348588,0.9905731,0.00429009,0.004154856,0.0001746939,0.0001006561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06260461,0.0004022242,0.933629,0.001277094,0.00004825114,0.0005529463,0.000007363436,0.0001624883,0.00131608],"genre_scores_gemma":[0.8560601,0.0001355878,0.1436357,0.00005484817,0.00003073171,0.00003606125,0.00001131699,0.0000189874,0.0000166765],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7934555,"threshold_uncertainty_score":0.3299513,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005507009,0.0003551947,0.0004433919,0.00009564203,0.000189341,0.0002036425,0.0002326739,0.0002321213,0.0000166831],"category_scores_gemma":[0.00004575716,0.0003289132,0.0001103092,0.0002160596,0.00005494143,0.0001955991,0.00002483783,0.0002698303,0.00001810711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005553278,"about_ca_system_score_gemma":0.000009368564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001830864,"about_ca_topic_score_gemma":7.224625e-7,"domain_scores_codex":[0.9981012,0.00001777982,0.000572021,0.00045504,0.0002087289,0.000645207],"domain_scores_gemma":[0.9990773,0.0002064682,0.00007199786,0.000313163,0.00007839998,0.0002527045],"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.00000813857,0.0004197005,9.872211e-7,0.00145986,0.00003585189,2.208964e-8,0.000410716,0.9110433,0.002722657,0.0746286,0.00001135695,0.009258853],"study_design_scores_gemma":[0.0008182149,0.00005600851,1.515212e-7,0.00002417488,0.00006299471,0.000003056574,0.00008489952,0.98022,0.0008767326,0.0168569,0.0005864004,0.0004104631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000659286,0.00001270434,0.991511,0.000006269509,0.00003700076,0.002085214,0.00000205296,0.001237799,0.004448682],"genre_scores_gemma":[0.3467824,0.000001783363,0.6519138,0.00002121105,0.0001068112,0.0009879451,0.00004328649,0.0001054345,0.00003729669],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3461232,"threshold_uncertainty_score":0.9999163,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000324443,0.0002915785,0.0003343694,0.0002064647,0.0002312568,0.0003400869,0.00009938778,0.000150384,0.00003582599],"category_scores_gemma":[0.000143616,0.0002469215,0.00004500455,0.0004632716,0.00009702286,0.0004087041,0.00007980787,0.0001831288,0.0000123685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004823942,"about_ca_system_score_gemma":0.00002276716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002532982,"about_ca_topic_score_gemma":0.000006782604,"domain_scores_codex":[0.9984319,0.00002427045,0.00047751,0.0003730068,0.0003411554,0.0003521156],"domain_scores_gemma":[0.9991873,0.0001594264,0.00009511944,0.0002414165,0.0001254996,0.0001912575],"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.0000349879,0.00004123051,0.0002341256,0.0001298197,0.00002474102,0.000009994262,0.0003027314,0.9250632,0.00001104302,0.007310832,0.00003856535,0.06679872],"study_design_scores_gemma":[0.004577026,0.0002863348,0.0004301378,0.00134669,0.0001460694,0.0002114342,0.001071452,0.9621585,0.0001059441,0.02502891,0.003264187,0.001373297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02064212,0.0007754189,0.9740038,0.0000925056,0.0001174043,0.0004971056,0.000004986096,0.0006283431,0.003238311],"genre_scores_gemma":[0.3587263,0.0002260043,0.6408071,0.00007776367,0.00004816517,0.00002253352,0.00001171886,0.00004986552,0.00003060583],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3380842,"threshold_uncertainty_score":0.9999983,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000430236,0.00007973009,0.000155868,0.00004422322,0.00003734815,0.00004137776,0.00007881973,0.00002614913,0.00000959317],"category_scores_gemma":[0.00009695232,0.00006710321,0.00006576339,0.0001372558,0.000009491844,0.0001437901,0.000009865523,0.0001014793,0.00000539006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002695042,"about_ca_system_score_gemma":0.000005884794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.038215e-8,"about_ca_topic_score_gemma":5.284973e-8,"domain_scores_codex":[0.9992235,0.00001969987,0.0003663703,0.00008434535,0.0001693196,0.0001367731],"domain_scores_gemma":[0.9995983,0.00002798818,0.0001157373,0.00006646982,0.0001117398,0.00007975692],"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.00005047988,0.00001548601,3.333984e-7,0.0001766312,0.0000592261,0.000001775969,0.0002058457,0.9485455,0.00009994981,0.0002480851,0.02012563,0.03047111],"study_design_scores_gemma":[0.0008114466,0.0004255246,0.000002741247,0.0001521669,0.0001900935,0.00007395674,0.0004636172,0.9643132,0.001110876,0.008341457,0.02389858,0.0002163156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003585254,0.0001195706,0.996995,0.001398876,0.0004372839,0.000427027,1.729292e-7,0.00005974534,0.0002038565],"genre_scores_gemma":[0.3341302,0.00004049908,0.6629701,0.0001271302,0.002387797,0.0000226072,0.000001165576,0.000051196,0.0002693427],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3340248,"threshold_uncertainty_score":0.273639,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001135006,0.00009392801,0.000197182,0.00005199652,0.00001032128,0.00001036536,0.0000484536,0.00005245362,0.00004324139],"category_scores_gemma":[0.00003509197,0.00007786213,0.00002532963,0.0001924039,0.0001673973,0.0000847851,0.000008345098,0.00004859445,0.000005363358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003154668,"about_ca_system_score_gemma":0.000028092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005038193,"about_ca_topic_score_gemma":0.000003725298,"domain_scores_codex":[0.9993074,0.00001581485,0.0002994991,0.00007193215,0.0001882931,0.0001170618],"domain_scores_gemma":[0.9996123,0.00002719412,0.00007470239,0.000127983,0.00009529854,0.00006250192],"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.00001793446,0.0001212829,0.0002953311,0.0007035284,0.0000915815,0.000002377911,0.00116556,0.8450446,0.0001728134,0.003743401,0.00003633615,0.1486053],"study_design_scores_gemma":[0.0004696877,0.0001263095,0.0001248092,0.0001481534,0.00002986631,0.00001071055,0.0005252946,0.9979428,0.00027038,0.0002570011,0.000007785986,0.0000871887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02737541,0.00002072968,0.9692926,0.00001166038,0.00004061017,0.0002753904,0.000002661687,0.0002855931,0.002695358],"genre_scores_gemma":[0.7794505,0.000002445291,0.2205017,0.000003148557,0.000001754079,0.00001058803,0.000009174802,0.00001581494,0.000004868682],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7520751,"threshold_uncertainty_score":0.3175125,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002426258,0.00006033686,0.00008083867,0.00002915155,0.00008692636,0.00002959913,0.00007476128,0.0000208495,0.00001688449],"category_scores_gemma":[0.0000218039,0.00006268213,0.00001065845,0.0004370094,0.00006814102,0.000132858,0.000002193843,0.00003963146,0.00001146144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009964473,"about_ca_system_score_gemma":0.00001334855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001212775,"about_ca_topic_score_gemma":0.000001935755,"domain_scores_codex":[0.9994114,0.00001433834,0.0001455153,0.0001596204,0.0001204495,0.0001486552],"domain_scores_gemma":[0.9996769,0.00005377361,0.00001521807,0.00005069435,0.00003197025,0.0001713811],"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.000005740478,0.000002197022,0.000009249698,0.000009905347,0.000001801899,2.547726e-7,0.0009293638,0.9817807,0.005155401,0.007235255,0.00003039415,0.004839753],"study_design_scores_gemma":[0.0001030886,0.00003112803,0.0004934666,0.000003540902,0.00001069503,6.99864e-7,0.0000520296,0.9966104,0.001607883,0.0008881625,0.0001110838,0.00008781897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00758994,0.00001600923,0.991501,0.0004124071,0.00005222297,0.0002301307,0.0000011314,0.0001519744,0.00004518094],"genre_scores_gemma":[0.6057867,0.000001467917,0.3938873,0.0002620886,0.00003050181,0.00002255922,0.000003638701,0.000004760973,9.739981e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5981968,"threshold_uncertainty_score":0.2556103,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000263744,0.0002007198,0.0002243308,0.0002501731,0.0001446043,0.0002014262,0.00008975599,0.0001122069,0.0001908203],"category_scores_gemma":[0.00006084241,0.0001807467,0.00003358227,0.000642065,0.0000472035,0.0003772846,0.00004305467,0.0001684201,0.00001570495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006363077,"about_ca_system_score_gemma":0.00001687521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005687588,"about_ca_topic_score_gemma":0.00001601597,"domain_scores_codex":[0.9986122,0.0000205799,0.0004385525,0.0002826125,0.0003357941,0.000310311],"domain_scores_gemma":[0.9994488,0.0001464895,0.00006949554,0.0001597564,0.0001023961,0.00007310399],"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.00003041174,0.00008042266,0.001198984,0.00003009657,0.000005530374,0.00000562405,0.00003283651,0.9652306,0.000003844755,0.0009389769,0.0001187754,0.03232383],"study_design_scores_gemma":[0.0007868394,0.00002745867,0.0006314909,0.0001425511,0.00001038031,0.00001501363,0.000085664,0.9958003,0.00001054472,0.0008606244,0.001385293,0.000243836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01032939,0.000147701,0.9810632,0.00001693629,0.0001474087,0.0003324452,0.000003116247,0.0002398469,0.007719963],"genre_scores_gemma":[0.452857,0.00002129266,0.5469421,0.00002663941,0.00003933487,0.00002023178,0.00002419196,0.00002964719,0.00003963636],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4425276,"threshold_uncertainty_score":0.7370636,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004174225,0.0001258272,0.0002288487,0.0001005967,0.0002191355,0.00009147105,0.00007559235,0.00006170848,0.000009077275],"category_scores_gemma":[0.0001484322,0.0001258096,0.0001008183,0.0001879603,0.0000185443,0.000170436,0.00005559224,0.0001459641,6.093454e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009787425,"about_ca_system_score_gemma":0.0000456877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001290459,"about_ca_topic_score_gemma":0.000002325934,"domain_scores_codex":[0.999052,0.00001938459,0.0003748897,0.0001160864,0.0001395489,0.0002980474],"domain_scores_gemma":[0.9994804,0.00004862364,0.0001149856,0.00009264138,0.0001077265,0.0001556207],"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.00006343675,0.00003729866,0.000062689,0.000626041,0.00002512872,0.00007399086,0.0004368676,0.9603373,0.000008773746,0.03020518,0.0006931344,0.007430176],"study_design_scores_gemma":[0.002405319,0.00008025541,0.0004758916,0.00008171255,0.000180844,0.0000362737,0.000789934,0.9550843,0.00004405124,0.02870717,0.01185646,0.0002577676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04961735,0.000824633,0.9485636,0.0002100068,0.0001507024,0.0002905647,0.000004626938,0.00004241932,0.0002961464],"genre_scores_gemma":[0.7866469,0.003401501,0.2083891,0.0001778592,0.000380703,0.00003728624,0.000007715817,0.00003730721,0.0009216334],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7401745,"threshold_uncertainty_score":0.5130366,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001583142,0.0001205087,0.0002660631,0.0002464041,0.0001634524,0.0001722498,0.0001729405,0.00005428185,0.00003096829],"category_scores_gemma":[0.000312837,0.00007693921,0.0001942195,0.0004901105,0.00005529032,0.0002379677,0.00004064692,0.000157775,0.000006734116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003209427,"about_ca_system_score_gemma":0.000007858049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.288764e-7,"about_ca_topic_score_gemma":0.000001609105,"domain_scores_codex":[0.9988483,0.00005789451,0.0005483886,0.0000729637,0.0002490607,0.0002233731],"domain_scores_gemma":[0.9987313,0.0005935611,0.0001351513,0.0001855785,0.0001467226,0.0002076952],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005807787,0.0002051536,0.0001110422,0.00002762246,0.0009396512,0.000001207049,0.0008301965,0.4151761,0.0003584079,0.004519494,0.0001689342,0.5776041],"study_design_scores_gemma":[0.0003120492,0.00001144981,0.0001181862,0.00001728457,0.0006916773,0.00001831974,0.0003868905,0.9942735,0.00001841675,0.001451266,0.002591818,0.0001091396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005701807,0.001937555,0.9920359,0.00002656554,0.00009242065,0.0001255764,0.000001807313,0.00003784546,0.00004057758],"genre_scores_gemma":[0.825456,0.0001496344,0.1741969,0.00002106891,0.00009406322,0.00001543272,0.000001322406,0.00001887386,0.00004676017],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8197542,"threshold_uncertainty_score":0.313749,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007446812,0.0001069755,0.000151889,0.0001747259,0.0002832453,0.00009029763,0.00006397282,0.00006715731,0.00002738379],"category_scores_gemma":[0.0002650134,0.00009158288,0.0000586252,0.0002968309,0.0001076181,0.0003537295,0.00002440762,0.0001814687,0.000006939548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004797871,"about_ca_system_score_gemma":0.00006586003,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001253467,"about_ca_topic_score_gemma":0.00005084776,"domain_scores_codex":[0.9988292,0.00003858864,0.0002494396,0.0001270924,0.0003617791,0.0003939185],"domain_scores_gemma":[0.9990185,0.0001648794,0.00001508497,0.0001743634,0.0004978441,0.0001293336],"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.00003499303,0.0001011043,0.00007394383,0.0001078311,0.00006496322,1.9473e-7,0.0009324269,0.9646192,0.0002856055,0.0136642,0.0003920278,0.01972357],"study_design_scores_gemma":[0.0003182746,0.000161636,0.0002256943,0.0001296853,0.00002262272,0.000007275412,0.001123295,0.9965948,0.0002420766,0.00080624,0.0002249693,0.0001434016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1370633,0.0001743988,0.8612029,0.0001125568,0.00005773133,0.000919852,0.00003217364,0.00007447657,0.0003625774],"genre_scores_gemma":[0.8949338,0.000006987103,0.1045208,0.00001745816,0.0000516516,0.0003739639,0.00002752973,0.00002198388,0.00004590253],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7578704,"threshold_uncertainty_score":0.3734641,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006979746,0.00006591609,0.00008595457,0.00005239568,0.0002849445,0.00008027878,0.0003447011,0.00002664466,0.000008975892],"category_scores_gemma":[0.00008559106,0.00005228261,0.00002166842,0.0003125467,0.0004273428,0.0005329338,0.000001229954,0.00006620407,0.000003385303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002549117,"about_ca_system_score_gemma":0.00005018311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006664783,"about_ca_topic_score_gemma":0.0009166611,"domain_scores_codex":[0.9990822,0.00000589819,0.0003434607,0.0001346713,0.0002791671,0.000154595],"domain_scores_gemma":[0.9993642,0.00004133758,0.00008949654,0.000313826,0.0001478645,0.00004326178],"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.000003470306,0.00002446028,0.007839345,0.0001263561,0.000002202845,3.194314e-7,0.001472979,0.9431061,0.001048202,0.04173846,0.000003776202,0.004634364],"study_design_scores_gemma":[0.0002835167,0.00001446082,0.6362644,0.00007890639,0.000008550235,1.356162e-7,0.0002098914,0.3536414,0.004610988,0.004590878,0.0001703958,0.0001264634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.704364,0.00008054214,0.2922388,0.0002359183,0.0002577976,0.0005161948,0.000008428079,0.0001231579,0.002175214],"genre_scores_gemma":[0.9940869,0.00002968879,0.005817217,0.00000496194,0.000004818553,0.00002095292,0.0000058358,0.000006210501,0.00002347881],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6284251,"threshold_uncertainty_score":0.2191592,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001623012,0.00009110458,0.0001191322,0.0001210187,0.0004092493,0.0001389689,0.0001375084,0.0000368862,0.00003465273],"category_scores_gemma":[0.0002926574,0.00005717581,0.00001898836,0.0006980064,0.000137149,0.0002348877,0.00001419182,0.0001947111,0.000006658346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000267533,"about_ca_system_score_gemma":0.000104536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005278075,"about_ca_topic_score_gemma":0.0001326644,"domain_scores_codex":[0.9987763,0.0001041006,0.000221553,0.0001367828,0.000421668,0.0003396107],"domain_scores_gemma":[0.9979867,0.0002772033,0.00001150149,0.0002398414,0.001412779,0.0000720121],"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.00002517687,0.00008930233,0.00008760615,0.0002507283,0.0000761677,4.748069e-7,0.001290404,0.9844324,0.001162611,0.009915196,0.000250823,0.0024191],"study_design_scores_gemma":[0.0005245762,0.0001792556,0.00007716622,0.000182415,0.00001048565,0.000003226591,0.001602752,0.976626,0.01971046,0.0001217275,0.0008392081,0.0001227612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08744001,0.0002039036,0.9061292,0.0009114238,0.00002316023,0.002264254,0.00001030128,0.0000913746,0.002926361],"genre_scores_gemma":[0.9318562,0.0000445746,0.06758884,0.00002037785,0.00001220757,0.0002922134,0.00001519238,0.00002637825,0.0001440164],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8444162,"threshold_uncertainty_score":0.3147656,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002814379,0.0001660329,0.0002663925,0.00005403026,0.00005330079,0.00005492136,0.000112661,0.00005989491,0.000002114234],"category_scores_gemma":[0.00001030679,0.0001175833,0.00005912793,0.0003780557,0.000034694,0.0005335259,8.042568e-7,0.0003407324,2.569424e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002596092,"about_ca_system_score_gemma":0.00001827952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001210917,"about_ca_topic_score_gemma":0.0000520516,"domain_scores_codex":[0.9987233,0.00002702702,0.0006208889,0.0001400672,0.0002597365,0.000228957],"domain_scores_gemma":[0.9995213,0.00004815575,0.0002095247,0.00006168173,0.00007111167,0.00008823888],"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.0001366125,0.00004162035,0.00106283,0.0003327377,0.00003800349,0.00002832695,0.01518731,0.9567191,0.00009004339,0.00074117,0.000007753422,0.02561446],"study_design_scores_gemma":[0.02074503,0.005058485,0.09889512,0.004556794,0.001342625,0.0002282804,0.06065831,0.7861294,0.0005876992,0.01438274,0.004589437,0.002826061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5555191,0.0004104905,0.4421306,0.0005428861,0.0000696447,0.0009319047,0.000004803006,0.0001111215,0.0002794137],"genre_scores_gemma":[0.7223235,0.00003680319,0.2774552,0.0000623706,0.00004933444,0.00002178378,0.0000274742,0.00002195982,0.000001633266],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1705897,"threshold_uncertainty_score":0.4794909,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006605585,0.0001718751,0.0002076615,0.00009659999,0.0003147403,0.0001687776,0.00006895055,0.00006976942,0.0000450658],"category_scores_gemma":[0.0002254671,0.0001656518,0.00005093915,0.0001452312,0.00002388713,0.0002155436,0.00001617769,0.0001968987,0.000009825107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003468415,"about_ca_system_score_gemma":0.0000121515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.130815e-7,"about_ca_topic_score_gemma":2.251355e-7,"domain_scores_codex":[0.9989108,0.0001156063,0.0003671268,0.0001561219,0.0001938729,0.0002564668],"domain_scores_gemma":[0.9987413,0.0007338625,0.0001092648,0.00006621382,0.0001819997,0.0001673657],"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.00002665506,0.00003946948,0.0000204381,0.00003572661,0.00002549868,5.026171e-7,0.0001513721,0.9915869,0.000005836347,0.004702344,0.001265787,0.002139496],"study_design_scores_gemma":[0.001072221,0.0001253363,0.00009053305,0.00004824897,0.00002311116,0.00002958389,0.000007677701,0.9923862,0.00001771978,0.004490466,0.001532198,0.0001767392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001236444,0.00005646738,0.9972929,0.0003504067,0.0003106345,0.0002995218,0.000007377043,0.0001564833,0.0002897949],"genre_scores_gemma":[0.2309849,0.00006306647,0.7680709,0.0004607088,0.0002503662,0.00001536862,0.00005533162,0.00005285429,0.0000464718],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2297485,"threshold_uncertainty_score":0.6755084,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007117764,0.0001599356,0.0005352114,0.0002733596,0.00005658541,0.00006774698,0.0004915582,0.00003959026,0.00002893607],"category_scores_gemma":[0.0002279876,0.00009059356,0.0007130911,0.001157561,0.00004355949,0.0002250925,0.00005253159,0.0002529107,0.000001817979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004523394,"about_ca_system_score_gemma":0.00003141442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.840375e-7,"about_ca_topic_score_gemma":0.00001088152,"domain_scores_codex":[0.9978663,0.00009162779,0.001151967,0.0001101978,0.0006040153,0.000175913],"domain_scores_gemma":[0.9986002,0.00007041334,0.0004585395,0.0004130271,0.00033787,0.0001199342],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001797494,0.0002954045,0.00009297705,0.00004770596,0.0001692736,8.485807e-7,0.0002958342,0.4715286,0.0009524314,0.00005066487,0.000155565,0.5263927],"study_design_scores_gemma":[0.0004950741,0.00005322953,0.002103847,0.0002742838,0.0006294338,0.000005808119,0.00003242472,0.992505,0.0006748665,0.001797404,0.001306375,0.000122318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1871701,0.002755804,0.808977,0.0001795675,0.0004917238,0.0002944398,0.00001350332,0.00003914508,0.00007869757],"genre_scores_gemma":[0.8922159,0.0004015705,0.1072793,0.00003358351,0.00002592119,0.000001244881,0.000001458565,0.00001543313,0.00002556875],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7050458,"threshold_uncertainty_score":0.3694298,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002407507,0.000103062,0.0001785493,0.00009029621,0.00004118265,0.00006159201,0.0001132409,0.00004998814,0.000028534],"category_scores_gemma":[0.0001005991,0.00009172705,0.0000476735,0.0002434755,0.00001159143,0.00007201373,0.00001120915,0.0001552151,0.00003098596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000808967,"about_ca_system_score_gemma":0.00002004914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.080503e-7,"about_ca_topic_score_gemma":5.474483e-7,"domain_scores_codex":[0.9990651,0.00001412332,0.0004427959,0.00006750154,0.0002235371,0.0001869658],"domain_scores_gemma":[0.9994118,0.0000303106,0.0001037078,0.00009982671,0.0001876041,0.0001667709],"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.00005449339,0.0001910238,0.0002329704,0.0001396656,0.00007183717,0.00003467438,0.0003666089,0.8453102,0.003772717,0.004505263,0.001598698,0.1437219],"study_design_scores_gemma":[0.001416857,0.0005666876,0.00006793939,0.0002779478,0.000183094,0.0003058411,0.0003565913,0.7099045,0.001322444,0.004310832,0.2807325,0.0005547636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01355502,0.0001628334,0.9843364,0.000206633,0.000268087,0.0002333059,4.667609e-7,0.00008180803,0.001155405],"genre_scores_gemma":[0.3910016,0.00008818911,0.608481,0.00006252327,0.0002348504,0.000008295722,0.000002307266,0.00003128789,0.00008993618],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3774466,"threshold_uncertainty_score":0.374052,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002475691,0.00009895315,0.0001395235,0.0001612599,0.00005108269,0.00002943563,0.0001318597,0.00006199614,0.00000402126],"category_scores_gemma":[0.00004941782,0.0000751462,0.00003492545,0.0000248491,0.00003896682,0.0002653223,0.00006631749,0.0001795967,5.500782e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005795167,"about_ca_system_score_gemma":0.000005801626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.365187e-7,"about_ca_topic_score_gemma":5.592013e-7,"domain_scores_codex":[0.9993781,0.000004658777,0.0002609035,0.00007028408,0.0001315648,0.0001544248],"domain_scores_gemma":[0.9996197,0.00005285514,0.0001172646,0.00007963311,0.00008186341,0.00004864571],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009787332,0.0000591648,0.00005719256,0.0000757102,0.0003587877,0.000002497402,0.0004826423,0.2562988,0.01727727,0.01465929,0.00006187741,0.7105688],"study_design_scores_gemma":[0.001859399,0.0001648755,0.00009055349,0.0002004372,0.00012524,0.0004881916,0.00137012,0.6717255,0.2072334,0.114261,0.00216099,0.0003203967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4806935,0.000639467,0.5174363,0.0006158482,0.0003254655,0.0001204413,0.000001586492,0.00008921053,0.00007819239],"genre_scores_gemma":[0.7320045,0.0002623608,0.2675599,0.00005421059,0.00007880586,0.00001102804,7.217093e-7,0.00001376005,0.0000147918],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7102485,"threshold_uncertainty_score":0.3064373,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006702651,0.0001161768,0.0001719422,0.00003341792,0.0001203749,0.00005065793,0.00008019446,0.00006333329,0.00001051671],"category_scores_gemma":[0.00005873921,0.0001163429,0.00003563217,0.0002383622,0.00006963081,0.00006042833,0.00001713623,0.0001222534,0.000004474124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002237639,"about_ca_system_score_gemma":0.00001309652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001026078,"about_ca_topic_score_gemma":6.038973e-7,"domain_scores_codex":[0.9992107,0.00003400004,0.000288868,0.000212016,0.0001193046,0.0001351136],"domain_scores_gemma":[0.9994142,0.0001748917,0.00007842913,0.0001659744,0.00009610131,0.00007037842],"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.00006865936,0.001246873,0.02080262,0.001321522,0.0001421114,7.96947e-7,0.003067565,0.5601464,0.01038761,0.1262927,0.00006358972,0.2764596],"study_design_scores_gemma":[0.0002945218,0.00002832805,0.002185681,0.00003362683,0.00002288157,0.000001226052,0.0001662326,0.9961397,0.0001613547,0.0004300653,0.0004048181,0.0001315821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2553537,0.0001116012,0.7434487,0.00001613052,0.00002473345,0.0004457583,0.00001836335,0.0003035131,0.0002773954],"genre_scores_gemma":[0.9117339,0.000001862109,0.0875236,0.000009569118,0.00003879917,0.00005563914,0.0006167563,0.00001398482,0.000005874261],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6563802,"threshold_uncertainty_score":0.4744326,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001596247,0.00006216616,0.00008119915,0.0003269793,0.0000818202,0.00001665891,0.0001185342,0.0000123435,0.00001014243],"category_scores_gemma":[0.00003205361,0.00006391764,0.00001900673,0.0009520123,0.0001745178,0.0003681984,0.00004655138,0.00005557721,0.000007634721],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001313736,"about_ca_system_score_gemma":0.000006346293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007024676,"about_ca_topic_score_gemma":0.000005328698,"domain_scores_codex":[0.9993887,0.000008565163,0.0001509735,0.0001310923,0.0001683203,0.0001523723],"domain_scores_gemma":[0.9997721,0.0000299661,0.00002800714,0.00008633433,0.00005411333,0.00002948577],"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.00004826685,0.001604986,0.008423832,0.0007093611,0.000152126,0.00008352688,0.03501297,0.5559478,0.009925323,0.0987418,0.0002209464,0.2891291],"study_design_scores_gemma":[0.001042233,0.00009735483,0.04469522,0.0002080172,0.00002018078,0.00001177158,0.005122054,0.9305936,0.01564212,0.001830888,0.0003632878,0.0003732607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2799481,0.0000239463,0.6320593,0.00004953547,0.0002337613,0.001079657,0.000001502156,0.0002856405,0.08631855],"genre_scores_gemma":[0.9449843,0.000007038363,0.05489174,0.000006446705,0.000003156955,0.00004800074,0.000001049727,0.000005204477,0.00005303639],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6650363,"threshold_uncertainty_score":0.2606486,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003315951,0.0001451969,0.000195618,0.0002845964,0.00003360809,0.00006028934,0.0001077812,0.00005296913,0.000004211931],"category_scores_gemma":[0.000006149385,0.0001123975,0.00003462175,0.0002892399,0.00002497287,0.0002820844,0.0000449258,0.00009362026,0.000008187028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007530617,"about_ca_system_score_gemma":0.000002018685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006690028,"about_ca_topic_score_gemma":0.00003222022,"domain_scores_codex":[0.9988315,0.00006716634,0.0004875432,0.0001627495,0.0002142801,0.0002367563],"domain_scores_gemma":[0.9997292,0.00002131026,0.00005924335,0.0001196239,0.00003794632,0.00003266883],"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.00001167564,0.00008534198,0.000110894,0.0009125296,0.0000228117,0.00001896102,0.009197188,0.9675292,0.0006640171,0.002844292,0.000004335795,0.01859879],"study_design_scores_gemma":[0.0009243064,0.00005383524,0.001009364,0.0002799424,0.00002338814,0.00001053131,0.00587393,0.9883103,0.001359033,0.0001701289,0.001719955,0.0002652488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.571615,0.00009271449,0.4119386,0.00003954804,0.0001109122,0.001351682,9.9883e-7,0.0002540354,0.01459651],"genre_scores_gemma":[0.8468013,0.00001231776,0.1528517,0.00000351411,0.00002018059,0.0001344245,0.00003285823,0.00001615141,0.0001275176],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2751863,"threshold_uncertainty_score":0.4583437,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002934382,0.00007159,0.0001274613,0.0001583515,0.0001437937,0.00006491515,0.0001217239,0.00004823934,0.00004438366],"category_scores_gemma":[0.0001695753,0.00006532828,0.00005045129,0.0003857484,0.00006382875,0.0001718815,0.00003037471,0.0001256593,0.00003569724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001119389,"about_ca_system_score_gemma":0.00002722873,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001085486,"about_ca_topic_score_gemma":0.00001831624,"domain_scores_codex":[0.9991354,0.00002529488,0.0002297933,0.00008820749,0.0002222202,0.0002990902],"domain_scores_gemma":[0.9987675,0.0001226904,0.000006206401,0.0001601149,0.0008567203,0.00008677667],"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.00002884223,0.0002388087,0.000007345272,0.0003655659,0.00006796491,0.000001523375,0.00106063,0.9331498,0.000942384,0.01198463,0.003837151,0.04831538],"study_design_scores_gemma":[0.0002063711,0.0001515066,0.00000442306,0.00004188815,0.000002567206,0.000003582357,0.000282074,0.9796157,0.0009521035,0.0004850767,0.01817676,0.00007795243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06166404,0.0004497245,0.931582,0.001496278,0.00007392945,0.001881532,0.00001526528,0.0002111435,0.002626065],"genre_scores_gemma":[0.9616896,0.0002307957,0.03684344,0.00005481266,0.00007259574,0.0004085113,0.00006545524,0.00003224943,0.0006025675],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9000255,"threshold_uncertainty_score":0.266401,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002768145,0.00008998881,0.0001588273,0.00007198784,0.0001475229,0.0000334857,0.00008238752,0.00006344785,0.00001916689],"category_scores_gemma":[0.00009606173,0.00006667073,0.00009667622,0.0002466773,0.0000196831,0.000246875,7.405914e-7,0.0001408728,0.000003058253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006648608,"about_ca_system_score_gemma":0.00002336122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.47813e-7,"about_ca_topic_score_gemma":0.00000612576,"domain_scores_codex":[0.9991148,0.000008370004,0.0004927109,0.00006650161,0.0001800701,0.0001375961],"domain_scores_gemma":[0.9992039,0.0001852155,0.0001801102,0.00006873474,0.0003098917,0.00005221446],"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.0002590164,0.00003654286,0.00004241541,0.0002121246,0.00009312493,0.000003492168,0.003855663,0.8838081,0.0009661821,0.004788303,0.0003107913,0.1056242],"study_design_scores_gemma":[0.007250437,0.004649666,0.009536018,0.003393609,0.001105553,0.0004198432,0.02768244,0.841611,0.03961879,0.02463654,0.03850147,0.001594621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07141516,0.00004769182,0.9270959,0.00004044181,0.0009679752,0.0002225806,0.000002056704,0.0000724367,0.0001357318],"genre_scores_gemma":[0.5756801,0.00001376785,0.4240666,0.00001293359,0.000186758,0.000009392608,0.000002243172,0.00001647917,0.00001171677],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.504265,"threshold_uncertainty_score":0.2718754,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009744176,0.0000940712,0.0001663153,0.0006593214,0.00007354333,0.00009491968,0.0001746422,0.00007128859,0.00003302201],"category_scores_gemma":[0.0003245306,0.00006655771,0.00002950198,0.0002902444,0.0001610807,0.0001794871,0.00001226137,0.0003570268,0.00000503042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001477237,"about_ca_system_score_gemma":0.0002634372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004786449,"about_ca_topic_score_gemma":0.01190464,"domain_scores_codex":[0.998834,0.00005241622,0.0002721088,0.0001088979,0.000212449,0.0005201198],"domain_scores_gemma":[0.999005,0.0001431836,0.00002584521,0.000110771,0.0001348688,0.0005803343],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009614212,0.0001216993,0.7645944,0.0008752012,0.0001295445,0.001457809,0.006928398,0.140768,0.0009811433,0.03374865,0.002330237,0.04796875],"study_design_scores_gemma":[0.01178682,0.001280048,0.2840773,0.004049372,0.00003577234,0.001797165,0.01019554,0.6340278,0.0005443555,0.03862984,0.01193307,0.001642884],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9901994,0.0008744345,0.004958585,0.0003643458,0.00007668819,0.0002302692,0.000004640134,0.00001351584,0.003278152],"genre_scores_gemma":[0.9942197,0.00003369988,0.005524182,0.000005138052,0.00008951639,0.000007554242,0.000001060937,0.00002267337,0.00009649123],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4932598,"threshold_uncertainty_score":0.6643071,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003256578,0.0001480198,0.0001987054,0.0001003259,0.00003344736,0.00002166406,0.0001780296,0.0000500675,0.00001211754],"category_scores_gemma":[0.000001386168,0.0001205652,0.00004098207,0.0001450363,0.00002708651,0.0001564475,0.00003826747,0.0001296438,3.748518e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001711154,"about_ca_system_score_gemma":0.000003554537,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004083949,"about_ca_topic_score_gemma":3.855141e-7,"domain_scores_codex":[0.9990212,0.000055,0.0003281094,0.000160559,0.00027276,0.0001623909],"domain_scores_gemma":[0.999622,0.00001480899,0.00007454678,0.0002477496,0.000005040866,0.00003587654],"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.000007258914,0.000212358,0.002782166,0.0002279423,0.00002680253,0.000005321317,0.0003652149,0.9941307,0.00007075295,0.0002791714,9.593155e-7,0.001891333],"study_design_scores_gemma":[0.0003343377,0.00004089489,0.0004188256,0.0001629754,0.00002977288,0.000006224284,0.004091948,0.9947567,0.0000391122,0.000006049749,0.000003670129,0.0001095197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2916261,0.00004278704,0.7064106,0.000005804363,0.000026339,0.0003027003,0.000002084767,0.00004110102,0.001542522],"genre_scores_gemma":[0.8736283,0.00005779393,0.1261483,0.000004723239,0.000009343426,0.00003775019,0.0000834902,0.00002032119,0.000009974096],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5820022,"threshold_uncertainty_score":0.4916507,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000244128,0.0001237822,0.0001745887,0.0001473258,0.00003466905,0.00005221419,0.00007300497,0.00006990624,0.000005504515],"category_scores_gemma":[0.00004735178,0.0001087611,0.00004939388,0.000124328,0.000006740964,0.0002361483,0.00003021252,0.0002209475,8.20246e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004316666,"about_ca_system_score_gemma":0.000007380871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.806144e-7,"about_ca_topic_score_gemma":8.640875e-8,"domain_scores_codex":[0.999278,0.000004293057,0.0003374845,0.00004422431,0.0001408723,0.0001950993],"domain_scores_gemma":[0.9996009,0.00002416713,0.00007668275,0.00006208839,0.0000157762,0.0002203162],"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.000002152023,0.00001640243,0.000109564,0.00006192312,0.00006700812,0.000001660477,0.0001830376,0.9801194,0.0001943982,0.01184177,0.0004010821,0.007001621],"study_design_scores_gemma":[0.001603565,0.00007275584,0.0000467397,0.0005801442,0.0001577559,0.0000172873,0.0004198263,0.9897878,0.0007499462,0.0004566385,0.005703132,0.0004044491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1856963,0.000488969,0.8103715,0.00005696017,0.0007892718,0.0001947102,5.04442e-7,0.000177533,0.002224233],"genre_scores_gemma":[0.9393603,0.00005664457,0.06002663,0.000008160604,0.0003910334,0.000001406387,9.334629e-7,0.00002595344,0.0001289034],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.753664,"threshold_uncertainty_score":0.4435151,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001974056,0.0002257717,0.0003451479,0.0001295737,0.0002054232,0.00006758318,0.0001559709,0.0002136453,0.0009889225],"category_scores_gemma":[0.0002479582,0.0001875139,0.00006553084,0.00192172,0.0001168445,0.0002544354,0.00000333697,0.0005893267,0.00006431966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005593293,"about_ca_system_score_gemma":0.0001380282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002121251,"about_ca_topic_score_gemma":0.0005093495,"domain_scores_codex":[0.9969959,0.0005541242,0.0005426626,0.0004348673,0.0009250607,0.0005473332],"domain_scores_gemma":[0.9970854,0.0006325924,0.00004898475,0.0002751731,0.001695577,0.0002622924],"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.0002400223,0.0004970373,0.00370786,0.001731632,0.0002395879,0.0002037561,0.003182287,0.9254155,0.002967081,0.05379754,0.002103842,0.00591389],"study_design_scores_gemma":[0.01538983,0.001817451,0.2244856,0.003192219,0.000832913,0.00007663215,0.02084637,0.3429818,0.1065887,0.03981404,0.23782,0.006154493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01464287,0.0001860816,0.9812315,0.0009541079,0.00008970248,0.0006215441,0.00005426949,0.0005336377,0.001686263],"genre_scores_gemma":[0.163717,0.00008229703,0.8341143,0.0001512352,0.00007332629,0.0003399287,0.00112746,0.00005997346,0.0003344645],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5824337,"threshold_uncertainty_score":0.9999243,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002711423,0.000260921,0.0003007266,0.0002571657,0.00003560343,0.000140626,0.0001792713,0.0001152347,0.000184713],"category_scores_gemma":[0.0001052496,0.0002096572,0.00004611276,0.0003262382,0.00002053834,0.0001893647,0.00007033197,0.0002348721,0.0006554966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001111416,"about_ca_system_score_gemma":0.000002597977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005583295,"about_ca_topic_score_gemma":0.000001688653,"domain_scores_codex":[0.9984505,0.00000875884,0.0005134041,0.0002424823,0.0002160308,0.0005688153],"domain_scores_gemma":[0.9994339,0.0000966447,0.0000164409,0.0002288934,0.00004379925,0.0001803203],"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":[8.785506e-7,0.00007898388,0.000009150606,0.0009308369,0.00002075793,7.841027e-7,0.004510041,0.9652742,0.01391706,0.002381389,0.00004045556,0.01283552],"study_design_scores_gemma":[0.0003869671,0.00003089173,0.00005948743,0.0003326353,0.00001127434,0.00000575258,0.0002520159,0.9825677,0.007259066,0.007053179,0.001488195,0.0005528205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03038694,0.00002179473,0.962818,0.00009687425,0.00007869076,0.001669388,5.52177e-7,0.0009616266,0.003966173],"genre_scores_gemma":[0.8579504,0.000001684522,0.1406203,0.0000269731,0.00003579947,0.001219439,0.000004571151,0.00007796894,0.00006291959],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8275635,"threshold_uncertainty_score":0.8549572,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006937486,0.00009305878,0.00009891325,0.0001296754,0.0003565492,0.0004525872,0.00005073833,0.0001008383,0.00002427405],"category_scores_gemma":[0.0001525503,0.00008398039,0.00001677592,0.0001836611,0.00003035647,0.001543148,0.0000278396,0.000198757,0.00002098103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002152537,"about_ca_system_score_gemma":0.00004402806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007230657,"about_ca_topic_score_gemma":0.00008528954,"domain_scores_codex":[0.9990219,0.000009811585,0.0003725336,0.00007148206,0.0003078411,0.0002163797],"domain_scores_gemma":[0.9990197,0.00006927164,0.00002503381,0.00006472321,0.000720246,0.0001010513],"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.00006841798,0.00004257465,0.001348385,0.007135274,0.00008998405,1.692204e-7,0.02440848,0.5307756,0.001622594,0.3147742,0.006559751,0.1131745],"study_design_scores_gemma":[0.0001988898,0.00002106113,0.00004522776,0.00001477217,0.000001895089,0.000006769656,0.0007545242,0.9343756,0.00002549196,0.0001203238,0.06434298,0.00009248348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4450377,0.0002064844,0.542298,0.000475742,0.0006086992,0.003624633,0.0002288406,0.0004599635,0.007059931],"genre_scores_gemma":[0.9858547,0.00005123276,0.01231459,0.00002693521,0.00008760885,0.0005573957,0.0001592335,0.00001150525,0.0009367752],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.540817,"threshold_uncertainty_score":0.4364309,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000715235,0.0001280777,0.0002109742,0.0002972878,0.00009905983,0.0001902663,0.0003091497,0.00004834202,0.000009583042],"category_scores_gemma":[0.00006572409,0.000113554,0.00006987328,0.0006515716,0.0001104322,0.0006980188,0.00004328655,0.000232513,0.000001469736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001687317,"about_ca_system_score_gemma":0.00007859679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002339957,"about_ca_topic_score_gemma":0.00002872205,"domain_scores_codex":[0.9984419,0.00001672902,0.0005992812,0.0001344016,0.0003287582,0.0004788862],"domain_scores_gemma":[0.9995307,0.00001809416,0.00008670222,0.000112033,0.0001056215,0.0001468052],"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.000004164674,0.00008996475,0.001096258,0.00004180993,0.000002918213,0.00001678075,0.0004815595,0.9785753,0.01461015,0.00006030741,0.00000370191,0.005017062],"study_design_scores_gemma":[0.0004151348,0.00001980913,0.000338804,0.000138385,0.000008232495,0.00006585478,0.000314664,0.9966893,0.001623361,0.0001743902,0.00007631757,0.0001357017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4913855,0.0001196059,0.507925,0.00002110714,0.0003123823,0.00007589236,4.465627e-7,0.00003828696,0.0001217522],"genre_scores_gemma":[0.6809648,0.000004920837,0.3189368,0.00001095688,0.00006361794,7.601526e-7,3.108547e-7,0.000011807,0.000006072428],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1895792,"threshold_uncertainty_score":0.4630598,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006280855,0.00004821799,0.0001132625,0.00003889928,0.00008743226,0.00005910937,0.0001627663,0.00004185547,0.00003201676],"category_scores_gemma":[0.0008283235,0.0000238659,0.00004457773,0.0003112158,0.0001060329,0.0001522017,0.00002178339,0.0005759714,4.104062e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000549972,"about_ca_system_score_gemma":0.00009035218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003461589,"about_ca_topic_score_gemma":0.0001042129,"domain_scores_codex":[0.9987235,0.0002290351,0.0003506992,0.00004960561,0.0005260284,0.0001210957],"domain_scores_gemma":[0.999238,0.0003167825,0.00005977146,0.0001117723,0.0002508749,0.00002286451],"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.00008728911,0.0002058141,0.0009625604,0.0002019793,0.00004202695,0.0000277817,0.01263243,0.8292822,0.1482634,0.005377235,0.002520319,0.0003969754],"study_design_scores_gemma":[0.01331267,0.001181974,0.06979609,0.003688408,0.0001010313,0.008146991,0.1259112,0.5458376,0.2029007,0.02155324,0.005933081,0.001637017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9978041,0.00002404082,0.0005039026,0.001236196,0.00009905138,0.0002038049,0.00000192845,0.000002783148,0.0001242025],"genre_scores_gemma":[0.9960009,0.00001368679,0.003831069,0.00002655521,0.0000910028,0.000007725545,8.839748e-7,0.000005548668,0.00002256332],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2834446,"threshold_uncertainty_score":0.2502341,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001808876,0.00008719804,0.0001213626,0.00004499537,0.0001513153,0.00004076567,0.00007962403,0.00005470838,0.0001619183],"category_scores_gemma":[0.00008562434,0.00008370205,0.00005520186,0.0001926721,0.00003492365,0.00009503938,0.00001777113,0.0001193218,0.00006218383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003344166,"about_ca_system_score_gemma":0.00001881455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002595976,"about_ca_topic_score_gemma":1.971123e-7,"domain_scores_codex":[0.9992566,0.00001277448,0.0001625184,0.0001205927,0.0001819917,0.0002655057],"domain_scores_gemma":[0.9996015,0.00007592628,0.0000137887,0.0001041935,0.0001153369,0.00008925033],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007297783,0.0002923282,0.001374557,0.001427886,0.0002476149,0.00003653441,0.001134257,0.03950836,0.003799919,0.0272735,0.009779994,0.9150521],"study_design_scores_gemma":[0.0007774543,0.00007197916,0.0001401559,0.00004987741,0.00001582899,0.0000465055,0.00004969117,0.9136517,0.0008605419,0.001011637,0.08303124,0.0002933705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03005793,0.0005678822,0.9550681,0.0003853579,0.0004848932,0.001164382,0.000006650607,0.001035511,0.0112293],"genre_scores_gemma":[0.2911163,0.0002436402,0.7040289,0.00007470795,0.0007668411,0.0002280437,0.0001542269,0.00009945797,0.003287867],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9147587,"threshold_uncertainty_score":0.341327,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005010693,0.0001200121,0.0001662776,0.0001443832,0.0003971693,0.0002326145,0.0001490429,0.00002743712,0.000072556],"category_scores_gemma":[0.001296439,0.00009808499,0.00004377753,0.0002099157,0.0001453107,0.0001366241,0.00002694695,0.0003529525,0.00002966151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004668917,"about_ca_system_score_gemma":0.00005316998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.525297e-7,"about_ca_topic_score_gemma":1.828207e-7,"domain_scores_codex":[0.9982042,0.0005189882,0.0004129281,0.0001187776,0.0004138197,0.0003312786],"domain_scores_gemma":[0.9976513,0.0008968973,0.00005625547,0.00009515485,0.00113363,0.0001667822],"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.0006275302,0.0003390806,0.00005369267,0.0002507638,0.0001467675,0.00007445057,0.002538799,0.9332905,0.002399453,0.006923743,0.01054419,0.04281096],"study_design_scores_gemma":[0.0007669917,0.000652897,0.00004273642,0.0001855036,0.000008099491,0.000009473472,0.00004877141,0.9909299,0.0009508124,0.000105033,0.006192023,0.0001077379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004792086,0.00005151516,0.9931784,0.0002333868,0.0001472861,0.0004369631,0.000007702317,0.00003596823,0.001116677],"genre_scores_gemma":[0.5242186,0.000009684091,0.4750227,0.0000592818,0.0005754879,0.000007175177,0.00000807886,0.00003912534,0.00005997158],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5194265,"threshold_uncertainty_score":0.399979,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007077304,0.00017203,0.0002397668,0.00002802166,0.0000903316,0.0002561146,0.0001274226,0.00009094592,0.00002298946],"category_scores_gemma":[0.00003629199,0.0001127372,0.00008442833,0.0001198756,0.00000971763,0.000209178,0.00001455991,0.00008038645,0.0001121741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005258365,"about_ca_system_score_gemma":7.773612e-7,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001434377,"about_ca_topic_score_gemma":0.000001021636,"domain_scores_codex":[0.9991078,0.00001755189,0.0003200335,0.0001447359,0.0001412568,0.0002686477],"domain_scores_gemma":[0.9995791,0.00009197264,0.00005002562,0.0001152739,0.00006363261,0.0001000042],"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.000007802842,0.0002307966,0.0004044463,0.007145861,0.0004518333,0.00001458929,0.002543627,0.622292,0.003824091,0.02092425,0.3391993,0.002961377],"study_design_scores_gemma":[0.0006835426,0.0001211815,0.00043858,0.0007156298,0.00007154548,0.0001120469,0.002304496,0.8772973,0.0001170028,0.00002305538,0.1174435,0.0006721296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3747566,0.06333199,0.3697523,0.0009531697,0.02200224,0.01468828,0.0002306146,0.01072747,0.1435573],"genre_scores_gemma":[0.9939914,0.00008593342,0.0008079382,0.000005835868,0.0004371271,0.0002702728,0.00002629024,0.00002488364,0.004350313],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6192349,"threshold_uncertainty_score":0.4597291,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003416754,0.00009784315,0.0001169199,0.0001200335,0.0002589115,0.0003434916,0.0001832543,0.00006760532,0.00004024554],"category_scores_gemma":[0.001511913,0.00006693561,0.0000244191,0.0007680404,0.0003462655,0.0002126855,0.0001168085,0.0003341793,0.00002841778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008065392,"about_ca_system_score_gemma":0.0001154817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001809445,"about_ca_topic_score_gemma":0.00001886922,"domain_scores_codex":[0.9984782,0.0001375609,0.0001994035,0.0002209247,0.0006513586,0.0003125313],"domain_scores_gemma":[0.9989021,0.0003450934,0.00001081931,0.0002293308,0.0003058003,0.0002067983],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001368783,0.001214161,0.01378939,0.001025465,0.0002148487,0.00001455838,0.007549684,0.04571718,0.0003301946,0.2767351,0.01211685,0.6411557],"study_design_scores_gemma":[0.001446712,0.0002897645,0.005977475,0.00004582423,0.00001802523,0.00003670734,0.003688953,0.9290966,0.0008944147,0.03944449,0.01853028,0.0005306927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.732706,0.003297919,0.09963838,0.01080856,0.000459739,0.005041897,0.00005019462,0.0008665842,0.1471308],"genre_scores_gemma":[0.9850414,0.00001629095,0.01432233,0.00002085544,0.00009683235,0.0001196136,0.00002385318,0.00001292228,0.0003459016],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8833795,"threshold_uncertainty_score":0.3312297,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003464545,0.00008784742,0.00008617902,0.00005568889,0.0001390655,0.00006082196,0.0001322646,0.00001600929,0.00001662345],"category_scores_gemma":[0.000005167761,0.00008532052,0.00002327303,0.0001406349,0.00007023273,0.0003024238,0.000006517943,0.00005280721,0.00001387577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003861289,"about_ca_system_score_gemma":0.00001329813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.95466e-7,"about_ca_topic_score_gemma":5.4337e-7,"domain_scores_codex":[0.9991567,9.944747e-7,0.0001459054,0.000134778,0.0001848204,0.0003768341],"domain_scores_gemma":[0.9997057,0.00002154501,0.00002101705,0.0001050539,0.00002755244,0.0001191229],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002959467,0.00008946193,0.00001529765,0.0002190198,0.000009817893,3.906755e-7,0.003342285,0.1209543,0.1904692,0.05366128,0.00008937137,0.6311467],"study_design_scores_gemma":[0.0001753454,0.000003658062,0.000009034711,0.000005233591,0.000005359556,4.638933e-7,0.00004083622,0.9758613,0.02028557,0.002799465,0.0006954024,0.0001183729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002511102,0.00002802577,0.991564,0.000007605956,0.00009044601,0.0003745327,0.00000726216,0.0002796735,0.005137389],"genre_scores_gemma":[0.6203696,0.000001179904,0.3794343,0.00001956758,0.00002730287,0.00007683894,0.000005602805,0.00001306836,0.000052549],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.854907,"threshold_uncertainty_score":0.347927,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001348512,0.0000943502,0.0001286186,0.0002391412,0.0003208322,0.0004529864,0.00008860685,0.0000700833,0.0000321485],"category_scores_gemma":[0.0003183915,0.00006552871,0.00003235929,0.0004930121,0.00006865355,0.0007958278,0.00002700199,0.0001516007,0.000005110105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004547083,"about_ca_system_score_gemma":0.00006544343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003142438,"about_ca_topic_score_gemma":0.000005453005,"domain_scores_codex":[0.9988675,0.00003343635,0.0005010118,0.00005861167,0.0003152609,0.0002242371],"domain_scores_gemma":[0.9987425,0.0002543943,0.00005320834,0.00009548718,0.0007720453,0.00008242631],"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.0001276211,0.00006263666,0.00001977165,0.001069124,0.00009429983,0.000002970432,0.002067304,0.4005458,0.00004756147,0.4901565,0.01266993,0.09313644],"study_design_scores_gemma":[0.0003452657,0.000174657,0.00005101626,0.00004966137,0.000005780841,0.000142475,0.001083264,0.9815114,0.00002936038,0.00037167,0.01615146,0.00008404781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0598336,0.0004167162,0.8443024,0.001076558,0.0004286681,0.01195377,0.0002882401,0.0006324788,0.08106758],"genre_scores_gemma":[0.9974493,0.00001079893,0.001748535,0.00004151763,0.00005793435,0.0003764649,0.0001008426,0.000005882938,0.0002086569],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9376158,"threshold_uncertainty_score":0.4368158,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004487676,0.0001961905,0.0002384739,0.0001168414,0.0001808441,0.0001625215,0.0002700303,0.000163688,0.000001753785],"category_scores_gemma":[0.000032507,0.0001340639,0.000030863,0.001153282,0.00002976173,0.0001945992,0.0000137843,0.0002819033,0.000007057206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001019603,"about_ca_system_score_gemma":0.0000776693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003690251,"about_ca_topic_score_gemma":0.00002023541,"domain_scores_codex":[0.9987878,0.00004330139,0.0003685086,0.0002710422,0.0001538774,0.0003754811],"domain_scores_gemma":[0.999335,0.0001108281,0.00005757743,0.0003194646,0.0001060167,0.00007110361],"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.000007634077,0.00003890319,0.000004177683,0.0001212093,0.00002225202,3.556324e-7,0.00232114,0.9642897,0.0001210594,0.03116627,0.0007859329,0.001121338],"study_design_scores_gemma":[0.0004468994,0.00001368201,0.000003097295,0.00007176922,0.000006709114,0.00001182555,0.009341703,0.9857465,0.00001152864,0.0003576628,0.003785346,0.0002032584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005510524,0.000077481,0.9935734,0.0001821982,0.00001978429,0.002343165,0.000009034232,0.0006694909,0.00257441],"genre_scores_gemma":[0.6651715,0.00001955979,0.3114074,0.0001458058,0.00009717323,0.02240849,0.0001982914,0.000100594,0.0004511782],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.682166,"threshold_uncertainty_score":0.5466967,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009880494,0.00009509427,0.0001989717,0.0003745774,0.0001845729,0.00008593131,0.0002122852,0.0000286938,0.0001265748],"category_scores_gemma":[0.0003489803,0.00007865444,0.0000648874,0.0007724771,0.0002514003,0.0003390519,0.00003535572,0.0004885405,0.00003509285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008382089,"about_ca_system_score_gemma":0.00008944294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005386007,"about_ca_topic_score_gemma":0.00002192704,"domain_scores_codex":[0.998684,0.0001107518,0.0004111655,0.00009372566,0.0003777069,0.0003225955],"domain_scores_gemma":[0.9987484,0.00009919926,0.00003726767,0.0001364587,0.0008126678,0.0001660342],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004107261,0.0006400517,0.0005070441,0.0001345405,0.0003100927,0.00004481035,0.0298766,0.2786378,0.004604815,0.003505461,0.0002990427,0.6813987],"study_design_scores_gemma":[0.000965432,0.002105522,0.0005549016,0.0003454607,0.00004272552,0.0002275979,0.01551194,0.9673388,0.006186288,0.0005312136,0.005665255,0.0005248505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1427324,0.0002689795,0.8476874,0.0001596499,0.0002290339,0.0007607022,0.000003345442,0.0001741747,0.007984363],"genre_scores_gemma":[0.6926812,0.000056834,0.3070701,0.000007307046,0.00006605052,0.00002288566,8.141957e-7,0.00002406752,0.00007071249],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.688701,"threshold_uncertainty_score":0.3207435,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004190318,0.00005021646,0.00005866245,0.00007748853,0.0001694027,0.00003166117,0.00008192191,0.00004540222,0.0002135891],"category_scores_gemma":[0.00004828477,0.00003637317,0.00002782589,0.0004210939,0.00004235353,0.0002476691,0.00000748479,0.000164261,0.00004993573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003642737,"about_ca_system_score_gemma":0.00002306974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003612474,"about_ca_topic_score_gemma":0.00007448319,"domain_scores_codex":[0.9992622,0.00005312695,0.0001636273,0.00005705435,0.0002570421,0.000206932],"domain_scores_gemma":[0.999668,0.00002548393,0.000006127168,0.0001354962,0.0001202249,0.00004464461],"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.00002400217,0.001287298,0.006873426,0.001611042,0.0001513262,4.777784e-7,0.03030247,0.366347,0.2862162,0.2506394,0.01042171,0.04612567],"study_design_scores_gemma":[0.0008754772,0.0001325777,0.00736142,0.0002143603,0.00004007194,0.000007092667,0.00187831,0.6914419,0.2685079,0.0004700198,0.02859431,0.0004765774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7894611,0.0006966094,0.1360502,0.001574306,0.00075584,0.004652856,0.00005574354,0.0005061012,0.06624729],"genre_scores_gemma":[0.9924706,0.00002150036,0.006035012,0.000004432403,0.0000369874,0.0001120638,0.00001449744,0.00001381933,0.001291117],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3250949,"threshold_uncertainty_score":0.2338651,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004804668,0.0001202908,0.0002633684,0.00015559,0.00006537187,0.0000584756,0.0002030075,0.00008573449,0.000008605412],"category_scores_gemma":[0.00002898581,0.00008613957,0.00006802649,0.0006272228,0.00003710173,0.0002983044,0.00002224473,0.0001464537,0.000001376013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006110763,"about_ca_system_score_gemma":0.00005521408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002324336,"about_ca_topic_score_gemma":2.70324e-7,"domain_scores_codex":[0.9988111,0.00003872373,0.000477642,0.00008702275,0.0003950749,0.0001904849],"domain_scores_gemma":[0.9991452,0.00001783272,0.0001904693,0.000172626,0.0003391162,0.0001347493],"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.00002954948,0.0001240456,0.00002616729,0.00008704686,0.00004320819,0.000001077005,0.0005364257,0.9930788,0.0001232751,0.005539429,0.0003763477,0.00003458007],"study_design_scores_gemma":[0.001111207,0.0001356904,0.000004073156,0.0001076334,0.00004221681,0.000008439668,0.0004267468,0.9974141,0.000230052,0.0002630063,0.0001569681,0.00009991197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0172081,0.00002884299,0.9792688,0.00004002405,0.001669628,0.0004105006,0.000008799998,0.0001003217,0.00126501],"genre_scores_gemma":[0.6202558,0.00004210905,0.3790375,0.0000341957,0.0004047721,0.00001836301,0.00004067719,0.00008689251,0.00007972879],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6030477,"threshold_uncertainty_score":0.351267,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003501313,0.0001879788,0.0003687276,0.0001447176,0.00003417224,0.00004246886,0.0002044,0.0001314536,0.00001271994],"category_scores_gemma":[0.00009054629,0.0001932422,0.00006315319,0.00007828459,0.00003622737,0.0002166348,0.00001471506,0.0001501473,0.000001121629],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005961612,"about_ca_system_score_gemma":0.000007668657,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004367168,"about_ca_topic_score_gemma":0.000001134055,"domain_scores_codex":[0.9986943,0.000007189992,0.0006711578,0.0001887561,0.0001538361,0.000284759],"domain_scores_gemma":[0.9994597,0.00007026835,0.00008931221,0.0002860093,0.00001603571,0.00007862483],"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.000004002074,0.000121105,0.00005492725,0.002959398,0.0000112732,4.256614e-7,0.0003918108,0.9762465,0.0003420972,0.01966807,0.000001796734,0.0001985458],"study_design_scores_gemma":[0.0007269381,0.00002270544,0.000118155,0.0002093619,0.00001218551,4.555315e-7,0.00002239322,0.9948471,0.0001438112,0.003708328,0.000004543437,0.0001840186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003904883,0.00003029334,0.9927933,0.00002486296,0.00002927825,0.001018887,0.000005666859,0.0001146348,0.002078245],"genre_scores_gemma":[0.7047664,0.00004347281,0.2947826,0.000001561471,0.00001269528,0.0003235448,0.00001857256,0.00004299598,0.000008181184],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7008615,"threshold_uncertainty_score":0.788019,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000353566,0.00007101893,0.00008433429,0.0001349516,0.00008971008,0.00004447707,0.00006673588,0.00002395431,0.00002054299],"category_scores_gemma":[0.00000495774,0.00006717754,0.00001311188,0.0003437193,0.00005041705,0.000167427,0.00003499573,0.00005838867,3.04138e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002569226,"about_ca_system_score_gemma":0.00000147968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003857237,"about_ca_topic_score_gemma":0.000005103766,"domain_scores_codex":[0.9994095,0.00001025133,0.000138533,0.0001580408,0.0001145939,0.0001690803],"domain_scores_gemma":[0.9998212,0.00001063878,0.00002586768,0.00009026732,0.0000107994,0.00004118251],"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.00004578945,0.001448808,0.008435112,0.002161724,0.0005194797,0.0003379763,0.02437566,0.7971499,0.0180509,0.008574219,0.00197466,0.1369258],"study_design_scores_gemma":[0.0005615954,0.00009221051,0.0002726019,0.00001757058,0.0001141767,0.00006900142,0.01149002,0.9858547,0.001029125,0.0001103278,0.0001947546,0.0001938861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4990581,0.000001262171,0.49977,0.00001634118,0.00003954576,0.0003939959,3.656195e-7,0.00003926532,0.0006811001],"genre_scores_gemma":[0.7637973,3.710585e-7,0.236054,0.00008271519,0.000007506575,0.00003177654,1.592231e-7,0.000006983525,0.0000191433],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.2647392,"threshold_uncertainty_score":0.2739421,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001239622,0.0001121726,0.0001364381,0.0002226822,0.0003036695,0.0007388027,0.00009863577,0.0001007352,0.000004703875],"category_scores_gemma":[0.0003729459,0.00009563353,0.00003500467,0.0001563352,0.00004111875,0.001152695,0.00004398983,0.0001512614,0.00003493407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008431882,"about_ca_system_score_gemma":0.0000493161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003807208,"about_ca_topic_score_gemma":0.000003233931,"domain_scores_codex":[0.998595,0.00001966517,0.0004690509,0.00008528734,0.0005500877,0.0002809279],"domain_scores_gemma":[0.999069,0.0002308446,0.00003618075,0.0001148758,0.0004383737,0.0001106785],"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.00001892129,0.00001063778,0.00002036444,0.000461922,0.00001609051,7.832903e-8,0.002055124,0.540006,0.0000123123,0.4037707,0.001738896,0.05188886],"study_design_scores_gemma":[0.0003749177,0.00004789384,0.00001790297,0.0001129507,0.000002579703,0.000005249165,0.000512889,0.9468177,0.000007706807,0.002218346,0.04977264,0.0001092285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0107479,0.0001139395,0.9760801,0.00006321373,0.0001986728,0.001505681,0.00002522273,0.0001423749,0.01112293],"genre_scores_gemma":[0.947934,0.00001264637,0.05106881,0.0001194342,0.00009540393,0.0005512733,0.00009609501,0.00001401321,0.000108349],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9371861,"threshold_uncertainty_score":0.7124292,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007137609,0.00006300207,0.0001017737,0.0007513694,0.00007741393,0.0001376627,0.0002212359,0.00006610419,0.00004411584],"category_scores_gemma":[0.0004422201,0.00005856067,0.00002098736,0.0003459099,0.00007042716,0.0005760826,0.00001065799,0.0006522647,0.00001294722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001929163,"about_ca_system_score_gemma":0.0006283598,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001427976,"about_ca_topic_score_gemma":0.1652894,"domain_scores_codex":[0.9990801,0.00002314166,0.0002976777,0.00003776132,0.0002219154,0.0003393881],"domain_scores_gemma":[0.999201,0.00008256637,0.00003804129,0.0000764114,0.0002996355,0.000302329],"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.00002014828,0.00001797651,0.1752853,0.000376838,0.00005540885,0.0001815075,0.006619737,0.6778048,0.0002756719,0.1183432,0.0008240169,0.02019537],"study_design_scores_gemma":[0.001432707,0.0001447018,0.07428889,0.0008987813,0.000009790401,0.0003304106,0.0013466,0.8497223,0.001128546,0.03409964,0.03606456,0.0005330762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9487582,0.00002094761,0.04703,0.0001241893,0.0002745467,0.0001375265,0.000004355774,0.000008161533,0.003642062],"genre_scores_gemma":[0.9833562,0.00001031579,0.01654189,0.00001259752,0.00005652219,0.000002482755,0.000002509292,0.000008992986,0.000008422985],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1719175,"threshold_uncertainty_score":0.8499419,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}