{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":18,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":18,"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":"ad09bf94a824","filters":{"venue":"INFORMS Journal on Optimization"}},"results":[{"id":"W2955422897","doi":"10.1287/ijoo.2019.0013","title":"Three-Dimensional Bin Packing and Mixed-Case Palletization","year":2019,"lang":"en","type":"article","venue":"INFORMS Journal on Optimization","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":64,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Bin packing problem; Column generation; Benchmark (surveying); Computer science; Set (abstract data type); Range (aeronautics); Mathematical optimization; Column (typography); Bin; Key (lock); Algorithm; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.00938567653688308,"gpt":0.2044652383476763,"spread":0.1950795618107933,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002397538,0.0001679538,0.0001459978,0.0002549736,0.0001492278,0.0002252768,0.00006000884,0.0001171588,0.0004731575],"category_scores_gemma":[0.00003184174,0.0001441402,0.00004093985,0.0002265113,0.00001647751,0.0006096052,0.00001819162,0.000259095,0.00008041969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006266747,"about_ca_system_score_gemma":0.00002084922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001961925,"about_ca_topic_score_gemma":0.000004853689,"domain_scores_codex":[0.9990906,0.00001182653,0.0003611352,0.0001096208,0.0002319243,0.0001948528],"domain_scores_gemma":[0.9994703,0.0000481543,0.0001167624,0.0001198519,0.0001296789,0.0001152877],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001457373,0.000009487069,0.001007247,0.00002319067,0.00002185379,0.00002479954,0.00009477265,0.990914,0.00002458298,0.0003783292,0.0004688151,0.007018292],"study_design_scores_gemma":[0.0007466832,0.00008726414,0.0001777266,0.000100782,0.000009497384,0.001186971,0.00002827971,0.9957025,0.0001269251,0.0001292677,0.001495504,0.000208603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2497326,0.0002284779,0.74028,0.0002540834,0.002042366,0.0004456546,0.000008816185,0.000377689,0.006630228],"genre_scores_gemma":[0.9642884,0.0003319347,0.03458285,0.0003513928,0.0001481555,0.000005019247,0.0000615635,0.00006609759,0.0001646206],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7145557,"threshold_uncertainty_score":0.5877869,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4304609420","doi":"10.1287/ijoo.2022.0082","title":"Machine-Learning–Based Arc Selection for Constrained Shortest Path Problems in Column Generation","year":2022,"lang":"en","type":"article","venue":"INFORMS Journal on Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Computer science; Mathematical optimization; Shortest path problem; Scheduling (production processes); Heuristic; Operations research; Selection (genetic algorithm); Crew scheduling; Artificial intelligence; Graph; Mathematics; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01939951170961166,"gpt":0.2454673122035663,"spread":0.2260678004939547,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001230131,0.0001830481,0.0001941306,0.000485885,0.0004705532,0.0001664484,0.0001220633,0.0000842712,0.0002551425],"category_scores_gemma":[0.0002341301,0.0001980154,0.00007461257,0.0006471996,0.0000156654,0.000368104,0.00001471205,0.0006227643,0.000001569194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005663604,"about_ca_system_score_gemma":0.0001211218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005482453,"about_ca_topic_score_gemma":0.000009277071,"domain_scores_codex":[0.9984787,0.0001231781,0.0006249195,0.0001498153,0.0003374978,0.0002858946],"domain_scores_gemma":[0.9993309,0.0001041349,0.0002221801,0.00008481845,0.0001745921,0.00008340654],"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.00003402514,0.00004531183,0.002255195,0.00001586271,0.00001500121,0.000001129972,0.0001832565,0.9935287,0.0003396853,0.00009254812,0.0001596938,0.003329625],"study_design_scores_gemma":[0.00153228,0.0004241205,0.0000779244,0.00002223075,0.00001168805,0.0000517892,0.00004970543,0.9954032,0.0002690584,0.00003087943,0.001899969,0.0002271379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007938353,0.00003138831,0.9900343,0.0001031228,0.0004491048,0.0006099052,0.00002101615,0.0002308235,0.0005819339],"genre_scores_gemma":[0.7942439,0.00006091995,0.2043931,0.0002353025,0.0001790159,0.0002308938,0.0004482568,0.00008211481,0.0001264944],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7863056,"threshold_uncertainty_score":0.8074833,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3192155567","doi":"10.1287/ijoo.2021.0056","title":"Critical-Path-Search Logic-Based Benders Decomposition Approaches for Flexible Job Shop Scheduling","year":2021,"lang":"en","type":"article","venue":"INFORMS Journal on Optimization","topic":"Scheduling and Optimization Algorithms","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":"University of Toronto; University of Regina","funders":"","keywords":"Job shop scheduling; GRASP; Mathematical optimization; Integer programming; Computer science; Scheduling (production processes); Greedy algorithm; Local optimum; Constraint programming; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0573044278968977,"gpt":0.3053361166479256,"spread":0.2480316887510279,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004322036,0.0002181758,0.0002189988,0.0002873656,0.0003709724,0.0004964799,0.0001443368,0.0001902215,0.0001707827],"category_scores_gemma":[0.0003683163,0.0002078887,0.0001535822,0.0004146304,0.00004005229,0.0006467593,0.00001491183,0.0003964241,0.00001404786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001980469,"about_ca_system_score_gemma":0.0001529091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.531138e-7,"about_ca_topic_score_gemma":2.820902e-7,"domain_scores_codex":[0.9985123,0.00003201926,0.0005072357,0.0001885534,0.0003686482,0.000391186],"domain_scores_gemma":[0.9987675,0.0002178407,0.00006547067,0.0001798842,0.0005617764,0.0002075172],"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.00004542724,0.00004987476,0.00003267269,0.00007200646,0.00003569458,0.000007297658,0.00009621851,0.9919684,0.00004544197,0.003023839,0.00007649815,0.004546657],"study_design_scores_gemma":[0.0009801158,0.0001133743,0.000015974,0.0001201944,0.00002792224,0.00005655091,0.0004156812,0.9927034,0.004825908,0.0003851358,0.00009160549,0.0002641794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001577211,0.0002305387,0.9937311,0.0006901015,0.0007014117,0.0001730603,0.00001551989,0.0003033631,0.002577696],"genre_scores_gemma":[0.1017974,0.0001586691,0.8968913,0.0004693985,0.000302762,0.00002894536,0.000216435,0.00006133678,0.00007378162],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1002202,"threshold_uncertainty_score":0.8477454,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3151835984","doi":"10.1287/ijoo.2021.0069","title":"Effective Budget of Uncertainty for Classes of Robust Optimization","year":2022,"lang":"en","type":"article","venue":"INFORMS Journal on Optimization","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Robust optimization; Robustness (evolution); Mathematical optimization; Conservatism; Computer science; Uncertainty analysis; Optimization problem; Sensitivity analysis; Set (abstract data type); Range (aeronautics); Mathematics; Engineering; Simulation","retraction":null,"screen_n_in":null,"score":{"opus":0.0419726571872753,"gpt":0.3377939704785712,"spread":0.295821313291296,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003273616,0.0001829276,0.0004493249,0.0009764624,0.0004683758,0.0001254018,0.0005488468,0.0000902391,0.0007832507],"category_scores_gemma":[0.002344961,0.0001393907,0.0002597881,0.001453088,0.00007981173,0.0009028415,0.00009219693,0.0002424102,0.000002046531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001687911,"about_ca_system_score_gemma":0.0002465024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009365141,"about_ca_topic_score_gemma":0.000001477296,"domain_scores_codex":[0.9962317,0.0002166424,0.001528417,0.0002382627,0.001557882,0.000227137],"domain_scores_gemma":[0.9943824,0.001065663,0.002319827,0.0003280736,0.001803045,0.000100927],"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.0006829706,0.0001237828,0.0007252331,0.000006614512,0.00003610547,8.401835e-7,0.0004317082,0.9818972,0.00001330484,0.001117926,0.002166751,0.0127975],"study_design_scores_gemma":[0.001367589,0.00131827,0.000219823,0.0000196881,0.00003337334,0.00003097432,0.000816952,0.9901886,0.0003641649,0.001341591,0.004140422,0.0001585248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008815448,0.00005736868,0.9868425,0.000259381,0.0008081765,0.0007678292,0.0001120957,0.00001980725,0.00231744],"genre_scores_gemma":[0.8054335,0.000800907,0.1918374,0.0003781115,0.0002316847,0.0001590889,0.0003032032,0.0000572297,0.000798823],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7966181,"threshold_uncertainty_score":0.8576046,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2896830491","doi":"10.1287/ijoo.2022.0072","title":"A Subsampling Line-Search Method with Second-Order Results","year":2022,"lang":"en","type":"article","venue":"INFORMS Journal on Optimization","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Agence Nationale de la Recherche","keywords":"Line search; Computer science; Context (archaeology); Mathematical optimization; Function (biology); Sample (material); Line (geometry); Saddle point; Reduction (mathematics); Algorithm; Artificial intelligence; Mathematics; Path (computing)","retraction":null,"screen_n_in":null,"score":{"opus":0.02840894031896267,"gpt":0.2941041273880469,"spread":0.2656951870690842,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001478566,0.0001835239,0.0001833371,0.000672436,0.0007438437,0.0004257454,0.0008455968,0.00004976045,0.0002389446],"category_scores_gemma":[0.000175012,0.0001465406,0.00005727664,0.001472517,0.00002516033,0.001069202,0.0002477413,0.0006510774,0.000006542438],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002508575,"about_ca_system_score_gemma":0.0002716569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004303354,"about_ca_topic_score_gemma":8.52484e-7,"domain_scores_codex":[0.9977881,0.0001055896,0.0005658838,0.0002913955,0.0009079797,0.0003410508],"domain_scores_gemma":[0.9983073,0.0001901454,0.0003984048,0.0004215915,0.0005292628,0.0001532687],"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.0001482075,0.00005033171,0.00001083179,0.000003166425,0.00001910443,0.00001554879,0.0009021129,0.9819834,0.000007081179,0.01086562,0.0003429713,0.005651662],"study_design_scores_gemma":[0.001138651,0.001159775,0.00001543951,0.00002352907,0.000005606921,0.0005809899,0.0001285423,0.9935711,0.0004936891,0.0006326585,0.002027291,0.0002227537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000261262,0.00001416234,0.9943375,0.0008951443,0.0002943017,0.0002802928,0.00001009669,0.0002488511,0.003658365],"genre_scores_gemma":[0.0145698,0.00001840719,0.983784,0.000922017,0.00006824269,0.00004092287,0.00002982192,0.00002496002,0.0005418668],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01430854,"threshold_uncertainty_score":0.5975752,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3089129971","doi":"10.1287/ijoo.2019.0037","title":"A Partially Ranked Choice Model for Large-Scale Data-Driven Assortment Optimization","year":2020,"lang":"en","type":"article","venue":"INFORMS Journal on Optimization","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal; Transport Canada","funders":"","keywords":"Computer science; Ranking (information retrieval); Task (project management); Scalability; Preference; Rank (graph theory); Quality (philosophy); Discrete choice; Tree (set theory); Consumer choice; Product (mathematics); Transaction data; Scale (ratio); Data mining; Database transaction; Machine learning; Mathematics; Economics; Microeconomics","retraction":null,"screen_n_in":null,"score":{"opus":0.05708838260833872,"gpt":0.2791606620650704,"spread":0.2220722794567317,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004848992,0.0002107378,0.0002364279,0.0001810153,0.0004068439,0.0007419483,0.0004262623,0.00009038261,0.0002931104],"category_scores_gemma":[0.0003232024,0.0001826423,0.00009834271,0.000338917,0.00001163468,0.003505996,0.0001722646,0.0002096941,0.00002368664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004684772,"about_ca_system_score_gemma":0.00007060088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000714293,"about_ca_topic_score_gemma":0.00001667556,"domain_scores_codex":[0.9984521,0.000008927427,0.000578105,0.0002609556,0.0003776114,0.0003222542],"domain_scores_gemma":[0.9987449,0.00005122237,0.0005243117,0.0002583902,0.0003650186,0.00005613978],"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.0002422241,0.00006286213,0.001558634,0.00004017348,0.00003738449,0.000001709978,0.000127087,0.9917213,0.000006499926,0.0001351934,0.003512249,0.002554707],"study_design_scores_gemma":[0.002008321,0.00003240037,0.0001812909,0.00003835131,0.0001671941,0.000002226612,0.00005197541,0.9823488,0.0000034701,0.00002588771,0.01490254,0.0002375438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001968817,0.0000163476,0.9924224,0.003195889,0.0003054491,0.0005399216,0.00003567414,0.0001171322,0.001398373],"genre_scores_gemma":[0.6658792,0.0002747014,0.2896505,0.03222621,0.006358405,0.0001413795,0.004785074,0.0002442769,0.0004402073],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7027719,"threshold_uncertainty_score":0.7447939,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4205482001","doi":"10.1287/ijoo.2021.0066","title":"Optimal Order Batching in Warehouse Management: A Data-Driven Robust Approach","year":2022,"lang":"en","type":"article","venue":"INFORMS Journal on Optimization","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Data warehouse; Analytics; Order picking; Order (exchange); Work order; Process (computing); Warehouse; Operations research; Industrial engineering; Data mining; Engineering; Reliability engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02392472256268477,"gpt":0.2276994575747005,"spread":0.2037747350120157,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003134861,0.0001808217,0.000161395,0.0004333258,0.0002957271,0.000129889,0.0004486284,0.00004695548,0.0001222177],"category_scores_gemma":[0.00003250328,0.0001779027,0.00002783174,0.0004269221,0.000014413,0.0008340943,0.0001993422,0.0006191335,0.000004793246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003042586,"about_ca_system_score_gemma":0.00001976718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002364744,"about_ca_topic_score_gemma":7.568406e-7,"domain_scores_codex":[0.9987388,0.00002660331,0.0004146888,0.0001863428,0.0003488016,0.0002848098],"domain_scores_gemma":[0.9994242,0.00002541403,0.0001155875,0.0003268542,0.00003739466,0.00007056851],"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.00003859837,0.00005223586,0.00001910714,0.00002581464,0.00003035689,0.00002590035,0.0002985617,0.996017,2.45345e-7,0.00028591,0.0004071605,0.002799105],"study_design_scores_gemma":[0.0007707127,0.00004985623,0.00003106819,0.00001713138,0.00001314224,0.00006823642,0.0004056192,0.996105,0.000003335984,0.00004856566,0.002269061,0.0002182644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001111701,0.00003858525,0.9909118,0.00002976446,0.0003568517,0.0002021374,0.00002334084,0.0001925428,0.007133262],"genre_scores_gemma":[0.2160023,0.0005418102,0.7821642,0.0001376436,0.0001062307,0.00004081119,0.0007035679,0.00008005357,0.0002233363],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2148906,"threshold_uncertainty_score":0.7254662,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4213236049","doi":"10.1287/ijoo.2021.0070","title":"Satisficing Models Under Uncertainty","year":2022,"lang":"en","type":"article","venue":"INFORMS Journal on Optimization","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Satisficing; Mathematical optimization; Probabilistic logic; Mathematics; Representation (politics); Optimization problem; Decision problem; Function (biology); Probability distribution; Computer science; Algorithm; Artificial intelligence; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.08734465264683301,"gpt":0.3467790294499677,"spread":0.2594343768031347,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003015183,0.0001615818,0.0002252955,0.0007528426,0.001264296,0.0006129438,0.0005762354,0.0000577164,0.002422275],"category_scores_gemma":[0.0004659067,0.0001180581,0.0001411418,0.001234842,0.00003296842,0.001584517,0.000127041,0.0004780199,0.00005453213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002764211,"about_ca_system_score_gemma":0.0002374506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001518375,"about_ca_topic_score_gemma":0.000002966132,"domain_scores_codex":[0.9960181,0.0001819169,0.001014249,0.000235595,0.002269901,0.0002802864],"domain_scores_gemma":[0.9978718,0.00035966,0.0007947161,0.0003480848,0.0004652907,0.000160421],"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.00008707974,0.00003069845,0.0001908269,2.498944e-7,0.00001043287,0.000006057091,0.0004764438,0.9600675,0.000001593607,0.006780172,0.004857055,0.02749193],"study_design_scores_gemma":[0.0005094509,0.0002029892,0.00009509105,0.00000487556,0.000007616036,0.0001445138,0.001329339,0.9545402,0.000005789837,0.03036775,0.01262971,0.0001626683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01756512,0.00005742333,0.9573426,0.001111574,0.001194143,0.0001854984,0.00001447115,0.00005341557,0.02247571],"genre_scores_gemma":[0.9778988,0.0005480379,0.01532019,0.002770563,0.0002035983,0.00001717599,0.000047931,0.00002917128,0.003164514],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9603337,"threshold_uncertainty_score":0.9984896,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3090345509","doi":"10.1287/ijoo.2019.0039","title":"Data-Driven Modeling and Optimization of the Order Consolidation Problem in E-Warehousing","year":2020,"lang":"en","type":"article","venue":"INFORMS Journal on Optimization","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Scheduling (production processes); Computer science; Consolidation (business); Tardiness; Simulated annealing; Heuristics; Material handling; Metaheuristic; Due date; Job shop scheduling; Operations research; Mathematical optimization; Algorithm; Industrial engineering; Engineering; Routing (electronic design automation); Mathematics; Queue","retraction":null,"screen_n_in":null,"score":{"opus":0.03240339166196765,"gpt":0.2432846048252104,"spread":0.2108812131632427,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001308097,0.0001219827,0.0001422733,0.0001053147,0.00009123833,0.00007285915,0.0001759926,0.00007298922,0.0000129938],"category_scores_gemma":[0.0001847114,0.00009424778,0.0000160262,0.0003027404,0.00002562914,0.0007681593,0.00005888057,0.0002463874,5.445592e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005429775,"about_ca_system_score_gemma":0.00003529272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001994769,"about_ca_topic_score_gemma":0.000001694056,"domain_scores_codex":[0.9991176,0.00001859681,0.0004441986,0.0001140798,0.000177198,0.0001282855],"domain_scores_gemma":[0.999482,0.00002715577,0.0001586269,0.0001541728,0.0001234438,0.00005458969],"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.00001926164,0.000007067302,0.00005457369,0.00003667864,0.000009078587,5.480682e-7,0.0003125563,0.9983971,0.000008625145,0.00009164392,0.00001854411,0.001044335],"study_design_scores_gemma":[0.000446069,0.00003035683,0.000009920317,0.00008659716,0.00001207783,0.000008346802,0.0000765315,0.9990061,0.00009368551,0.00007811507,0.00004503355,0.0001071862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002377608,0.00003754185,0.9965531,0.0002203895,0.0001063422,0.0001845788,0.00001321861,0.00005840641,0.0004487853],"genre_scores_gemma":[0.6317391,0.000587507,0.3673697,0.0001344601,0.00005577732,0.000002443085,0.00008047243,0.0000275668,0.000002947484],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6293615,"threshold_uncertainty_score":0.3843313,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3019262760","doi":"10.1287/ijoo.2019.0027","title":"Decremental Clustering for the Solution of <i>p</i>-Dispersion Problems to Proven Optimality","year":2020,"lang":"en","type":"article","venue":"INFORMS Journal on Optimization","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":8,"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; Université du Québec à Montréal","funders":"","keywords":"Solver; Cluster analysis; Series (stratigraphy); Integer (computer science); Mathematics; Combinatorics; State (computer science); Matrix (chemical analysis); Construct (python library); Dispersion (optics); Algorithm; Computer science; Mathematical optimization; Discrete mathematics; Statistics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.04660034792703439,"gpt":0.2459968494110332,"spread":0.1993965014839988,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004691881,0.0001090738,0.0001108642,0.000104596,0.0002727191,0.0001696381,0.0002160749,0.00003041787,0.0001566872],"category_scores_gemma":[0.0001852255,0.00007564115,0.00008602793,0.0003155673,0.00001668056,0.0009865591,0.000097577,0.00008337018,0.00002829834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005241913,"about_ca_system_score_gemma":0.00001449935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004873853,"about_ca_topic_score_gemma":0.00002003574,"domain_scores_codex":[0.9989846,0.000004269385,0.000438787,0.0001175009,0.00029444,0.0001604193],"domain_scores_gemma":[0.9994046,0.00001251633,0.0001910856,0.0001045308,0.000260407,0.00002684673],"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.0001937679,0.00003389429,0.0001447894,0.0001379225,0.00002165713,9.413459e-8,0.0001727038,0.9874428,0.0001581497,0.0006342545,0.002821026,0.00823895],"study_design_scores_gemma":[0.0005493644,0.00009713582,0.0003716208,0.00004408792,0.00003003507,4.963816e-7,0.0002922225,0.9667158,0.00008398409,0.00003298528,0.03167804,0.0001042982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007707897,0.00001599362,0.9754214,0.013553,0.0004042235,0.001086986,0.000004385675,0.00004135893,0.001764763],"genre_scores_gemma":[0.9775391,0.00005922848,0.01196762,0.009569347,0.0006278428,0.00006130792,0.00006222183,0.00002110699,0.00009225616],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9698312,"threshold_uncertainty_score":0.3084557,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4380051626","doi":"10.1287/ijoo.2023.0092","title":"Dynamic Routing and Wavelength Assignment with Reinforcement Learning","year":2023,"lang":"en","type":"article","venue":"INFORMS Journal on Optimization","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Polytechnique Montréal","funders":"","keywords":"Reinforcement learning; Computer science; Adaptive routing; Routing and wavelength assignment; Network topology; Routing (electronic design automation); Graph; Wavelength-division multiplexing; Artificial intelligence; Distributed computing; Computer network; Static routing; Wavelength; Theoretical computer science; Routing protocol","retraction":null,"screen_n_in":null,"score":{"opus":0.006435144094496844,"gpt":0.2116394172331803,"spread":0.2052042731386835,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001496771,0.0001278782,0.0001105736,0.0001709848,0.0001605482,0.00008836659,0.00006727018,0.00006499171,0.0000145546],"category_scores_gemma":[0.00006278603,0.0000940664,0.00001655283,0.000300242,0.00002740489,0.0003654399,0.00003106459,0.0003939787,0.00001380994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001532744,"about_ca_system_score_gemma":0.000008027156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.270005e-7,"about_ca_topic_score_gemma":2.450592e-7,"domain_scores_codex":[0.9992205,0.000004240929,0.0002340365,0.0000734217,0.000208282,0.0002595001],"domain_scores_gemma":[0.9997121,0.00004669401,0.00007090707,0.00007457124,0.00003582597,0.00005986913],"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.00001248734,0.000001567446,0.00007069862,0.000007861007,0.00001980681,0.000009240388,0.00007944141,0.9607463,0.00001094144,0.0003878741,0.00002271219,0.03863106],"study_design_scores_gemma":[0.0003325336,0.0002159153,0.0001359789,0.00009361381,0.000006109479,0.00003531986,0.0002838879,0.9982571,0.00004459573,0.00008767323,0.0003707071,0.0001365505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04062604,0.00002370596,0.9553862,0.0001126056,0.0001093211,0.0001261833,2.592818e-7,0.0008768797,0.002738757],"genre_scores_gemma":[0.9458436,0.001487063,0.05237357,0.00002929626,0.00002198026,0.000008099318,0.00001181004,0.00003113967,0.0001934751],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9052175,"threshold_uncertainty_score":0.3835916,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3046504554","doi":"10.1287/ijoo.2019.0031","title":"Spatial Separability in Hub Location Problems with an Application to Brain Connectivity Networks","year":2020,"lang":"en","type":"article","venue":"INFORMS Journal on Optimization","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Property (philosophy); Range (aeronautics); Set (abstract data type); Artificial intelligence; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03218453083988348,"gpt":0.2940899635125121,"spread":0.2619054326726286,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008685953,0.0001554078,0.0002251393,0.0001975487,0.0001134134,0.0001456431,0.0001517595,0.00009492305,0.00003257993],"category_scores_gemma":[0.001069556,0.0001187857,0.00002714779,0.001110767,0.00001952447,0.0008769808,0.00002220921,0.0002859308,0.000005612896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001449722,"about_ca_system_score_gemma":0.00009297052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004890302,"about_ca_topic_score_gemma":0.0001242186,"domain_scores_codex":[0.998673,0.00006086626,0.0005245266,0.0001936796,0.0003293902,0.0002185395],"domain_scores_gemma":[0.9987141,0.000207671,0.0003391592,0.0001637848,0.0003919413,0.0001832675],"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.0003339067,0.0001077033,0.0007369123,0.00006277671,0.000007891587,9.621781e-7,0.001480866,0.9813135,0.000003654181,0.002988909,0.00007262043,0.01289033],"study_design_scores_gemma":[0.0008695176,0.001401489,0.001060324,0.00009146625,0.000009730522,0.00001681187,0.0003015718,0.9903563,0.00009185155,0.005342165,0.000234005,0.0002247572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07259402,0.000006748516,0.9242997,0.002041172,0.0000380023,0.0005579235,0.000002733302,0.00005465467,0.0004050275],"genre_scores_gemma":[0.9819881,0.000009874382,0.01639474,0.001301246,0.0001921367,0.00004795405,0.00002843539,0.00001941377,0.00001810689],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9093941,"threshold_uncertainty_score":0.4843939,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2999262999","doi":"10.1287/ijoo.2021.0057","title":"Smooth and Flexible Dual Optimal Inequalities","year":2021,"lang":"en","type":"preprint","venue":"INFORMS Journal on Optimization","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":3,"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; Université du Québec à Montréal","funders":"","keywords":"Solver; Embedding; Dual (grammatical number); Column generation; Column (typography); Set (abstract data type); Mathematical optimization; Space (punctuation); Relaxation (psychology); Mathematics; Upper and lower bounds; Linear programming; Computer science; Combinatorics; Mathematical analysis; Artificial intelligence; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03670787673228427,"gpt":0.2542556776300311,"spread":0.2175478008977468,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006354432,0.0003206366,0.0003153565,0.0005839017,0.0003102328,0.002140422,0.0002053094,0.0001923119,0.001296912],"category_scores_gemma":[0.0001952662,0.0002864717,0.0001285272,0.0002669772,0.00004859891,0.001872678,0.0005928933,0.0005852125,0.00004828523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009284075,"about_ca_system_score_gemma":0.00009178459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001915791,"about_ca_topic_score_gemma":0.00002416649,"domain_scores_codex":[0.9981542,0.00001387891,0.0007367771,0.0002844037,0.0005331403,0.0002775549],"domain_scores_gemma":[0.9987843,0.00001322788,0.0003735904,0.000279703,0.0005143383,0.00003481307],"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.00004708623,0.00005636289,0.0001710933,0.0003344093,0.00005734988,0.00001032509,0.0002179964,0.9863119,0.000001177162,0.005483854,0.002385275,0.004923229],"study_design_scores_gemma":[0.001125033,0.00005273082,0.001832239,0.0005861478,0.0001488968,0.00001694661,0.002906497,0.9089775,0.00001989921,0.0010137,0.08238914,0.0009312761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5631167,0.0008050198,0.3268855,0.00945544,0.010905,0.001472864,0.00003788606,0.000720969,0.08660062],"genre_scores_gemma":[0.9254752,0.004965925,0.03432464,0.01754984,0.006326235,0.0001259889,0.002711391,0.0001865805,0.008334175],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3623585,"threshold_uncertainty_score":0.9999588,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2901560921","doi":"10.1287/ijoo.2021.0054","title":"Robust Facility Location Under Disruptions","year":2021,"lang":"en","type":"article","venue":"INFORMS Journal on Optimization","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Computer science; Facility location problem; Engineering; Operations research","retraction":null,"screen_n_in":null,"score":{"opus":0.04637793492260842,"gpt":0.2442332118167916,"spread":0.1978552768941832,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003681321,0.0001408207,0.0001170024,0.0002375312,0.0004081246,0.0005466776,0.0001344613,0.00006165753,0.00269367],"category_scores_gemma":[0.0002371964,0.0001251662,0.00008118887,0.0007821106,0.00002706512,0.002218628,0.00005983503,0.0001825512,0.0007153935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001173109,"about_ca_system_score_gemma":0.00006230647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003604668,"about_ca_topic_score_gemma":0.00005645556,"domain_scores_codex":[0.9987874,0.00001063524,0.0004525855,0.0001691896,0.0003785879,0.0002016045],"domain_scores_gemma":[0.9987608,0.000009950448,0.0001392699,0.0002321624,0.0008316641,0.00002611051],"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.00001661082,0.00009774087,0.0003440499,0.00003767104,0.0000201457,0.000002595393,0.00002594729,0.9766283,0.000005512461,0.01588933,0.002626252,0.00430584],"study_design_scores_gemma":[0.0009215598,0.00002056001,0.01190491,0.00006520774,0.00006042886,0.00001680789,0.001085797,0.8855857,0.00002646103,0.001677023,0.09823481,0.0004006884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0157546,0.00003960948,0.9474621,0.006124794,0.00133861,0.0001926559,0.000005816147,0.0001354066,0.02894645],"genre_scores_gemma":[0.9798934,0.0002398717,0.0042528,0.01043082,0.0008591607,0.00002341504,0.0008044569,0.00002301547,0.003473014],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9641389,"threshold_uncertainty_score":0.998218,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4399170779","doi":"10.1287/ijoo.2021.0024","title":"Monte Carlo Fictitious Play for Finding Pure Nash Equilibria in Identical Interest Games","year":2024,"lang":"en","type":"article","venue":"INFORMS Journal on Optimization","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Nash equilibrium; Mathematical economics; Mathematical optimization; Computer science; Scale (ratio); Game theory; Monte Carlo method; Term (time); Mathematics; Physics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.04304430783753299,"gpt":0.2622079755039973,"spread":0.2191636676664643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005820367,0.0001347983,0.0002592023,0.0004548419,0.00008278521,0.0005950269,0.0001589041,0.0001201089,0.0002652877],"category_scores_gemma":[0.00015345,0.0001330983,0.0001436193,0.0001323436,0.00002411762,0.001094499,0.00003321373,0.0002585398,0.00007216907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002757785,"about_ca_system_score_gemma":0.00003452184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009141334,"about_ca_topic_score_gemma":0.00001707257,"domain_scores_codex":[0.9986813,0.000004629184,0.0008347825,0.0001940296,0.00002613729,0.000259104],"domain_scores_gemma":[0.9994749,0.00008813834,0.0002151604,0.0001162812,0.00002813724,0.00007740442],"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.0000617324,0.00001990308,0.0005056268,0.00003306857,0.00004322494,0.000009754123,0.0007019255,0.6109222,0.000001717439,0.3852023,0.001301592,0.001197006],"study_design_scores_gemma":[0.0007710596,0.0001850841,0.0001510152,0.0001897223,0.000006354357,0.00005498102,0.000153191,0.9329583,0.00001570646,0.04627654,0.0190023,0.0002357517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6871344,0.00146083,0.2929286,0.001648816,0.004103906,0.0004884962,0.0002375554,0.00008424328,0.0119131],"genre_scores_gemma":[0.9957176,0.0004703731,0.002011598,0.0002177684,0.0003033283,0.00002014179,0.00001586161,0.00003136979,0.001211919],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3389258,"threshold_uncertainty_score":0.5737858,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2955458186","doi":"10.1287/ijoo.2019.0030","title":"Data Association via Set Packing for Computer Vision Applications","year":2020,"lang":"en","type":"article","venue":"INFORMS Journal on Optimization","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Association (psychology); Computer science; Set (abstract data type); Data association; Artificial intelligence; Data set; Computer vision; Filter (signal processing); Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.04725896643640096,"gpt":0.3207108771548662,"spread":0.2734519107184652,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004652444,0.0001149873,0.0001246705,0.0001031326,0.0002270739,0.001507306,0.001146449,0.00007281898,0.000003938399],"category_scores_gemma":[0.000166317,0.00009952594,0.00004336282,0.0003652622,0.00001010366,0.005329061,0.0002975953,0.000171796,0.00001907399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000127169,"about_ca_system_score_gemma":0.0000706577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.605989e-7,"about_ca_topic_score_gemma":1.234565e-7,"domain_scores_codex":[0.9988385,0.00001461058,0.0003778582,0.0002333892,0.0003533668,0.0001822275],"domain_scores_gemma":[0.9985468,0.00009623678,0.0005041375,0.0003449866,0.000391814,0.0001160398],"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.00003152,0.00007400852,0.00006614988,0.00004250948,0.00003750731,0.000002666606,0.0003292617,0.4289823,0.00007202595,0.002320087,0.03358624,0.5344557],"study_design_scores_gemma":[0.0002370259,0.0002229042,0.00001211047,0.00003069525,0.000005960733,0.00001584743,0.000002997131,0.966695,0.0002674304,0.001686955,0.03069745,0.0001256693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000009761167,0.00001215057,0.9945099,0.004131637,0.0001151906,0.0002933306,0.00002495165,0.0002950867,0.0006079646],"genre_scores_gemma":[0.01212171,0.0000290277,0.9836038,0.003651069,0.0003350115,0.00002020893,0.0001931687,0.0000154032,0.00003059942],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5377126,"threshold_uncertainty_score":0.9995292,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2982146718","doi":"10.1287/ijoo.2019.0045","title":"An Ensemble Learning Framework for Model Fitting and Evaluation in Inverse Linear Optimization","year":2021,"lang":"en","type":"preprint","venue":"INFORMS Journal on Optimization","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; University of Toronto","funders":"","keywords":"Metric (unit); Computer science; Mathematical optimization; Plan (archaeology); Inverse; Machine learning; Construct (python library); Optimization problem; Base (topology); Artificial intelligence; Mathematics; Algorithm; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1696365268085258,"gpt":0.4728932681299927,"spread":0.3032567413214668,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009475323,0.0003414964,0.0005427508,0.00139647,0.0004997842,0.00183031,0.0005742742,0.0006525521,0.0001516085],"category_scores_gemma":[0.02063355,0.0002925812,0.000148574,0.0008257785,0.00006494008,0.002487691,0.0003076597,0.002108054,0.000003605951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005380347,"about_ca_system_score_gemma":0.0009445756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006108485,"about_ca_topic_score_gemma":0.0000143405,"domain_scores_codex":[0.9941994,0.0004337167,0.001548589,0.0007116989,0.002655401,0.0004511987],"domain_scores_gemma":[0.9932352,0.001213685,0.0013879,0.0005210257,0.003385499,0.0002567268],"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.0001423363,0.00005352503,0.00022582,0.00002123333,0.0000150823,0.000004552955,0.001480318,0.957311,0.00000456939,0.00005698502,0.00001901868,0.04066561],"study_design_scores_gemma":[0.0009978213,0.0002146075,0.00003596213,0.0003329038,0.00002261775,0.00001826158,0.001647603,0.978701,0.000056011,0.01764138,0.0000221298,0.0003097309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02584179,0.0001033288,0.9722229,0.0002747934,0.0004735762,0.0009203219,0.000009366119,0.00003525727,0.000118662],"genre_scores_gemma":[0.08898901,0.000797253,0.9091474,0.0001633285,0.000349979,0.00009469246,0.0002838707,0.00005783478,0.0001166062],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.06314722,"threshold_uncertainty_score":0.9999526,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4413682498","doi":"10.1287/ijoo.2024.0048","title":"Wasserstein Distributionally Robust Shallow Convex Neural Networks","year":2025,"lang":"en","type":"article","venue":"INFORMS Journal on Optimization","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Regular polygon; Artificial neural network; Mathematical optimization; Computer science; Mathematics; Artificial intelligence; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.009001984855003472,"gpt":0.2424912413966047,"spread":0.2334892565416012,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005348478,0.0001876953,0.00019574,0.0002539169,0.000494088,0.0006501007,0.000858061,0.0001320094,0.00006284888],"category_scores_gemma":[0.0003169908,0.0001571583,0.0001093925,0.0007154712,0.00004127357,0.001677833,0.0001957823,0.0007103691,0.000008648793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002458664,"about_ca_system_score_gemma":0.0001483964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002812096,"about_ca_topic_score_gemma":0.000001008828,"domain_scores_codex":[0.9985082,0.0000691875,0.0004893085,0.0002095528,0.0003978621,0.0003259224],"domain_scores_gemma":[0.9988369,0.0001436691,0.0003218092,0.0002858215,0.0002985806,0.0001132255],"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.00003209303,0.00002120617,0.0010286,0.000003673343,0.00002604308,0.00001441231,0.00003534856,0.9457006,7.352076e-7,0.0441091,0.0004712586,0.008556923],"study_design_scores_gemma":[0.0006429185,0.00007857077,0.0009469639,0.00005583293,0.000009378297,0.00004578788,0.00002117951,0.996707,0.00000587042,0.0004987051,0.0008276444,0.000160112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007059722,0.00004377365,0.991379,0.00255135,0.001516999,0.0001166911,0.000001044964,0.0001276596,0.003557459],"genre_scores_gemma":[0.8253664,0.0000797851,0.1703129,0.002856871,0.0003977229,0.000009455627,0.00006466605,0.00001941846,0.0008928247],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8246604,"threshold_uncertainty_score":0.6408731,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}