{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Samir Elhedhli","is_ca":true},{"name":"Fatma Gzara","is_ca":true},{"name":"Burak Yıldız","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00938567653688308,"gpt":0.2044652383476763,"spread":0.1950795618107933,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001655173,0.001515566,0.001565772,0.001420822,0.0007131243,0.002529899,0.002314656,0.001623745,0.007026781],"category_scores_gemma":[0.00478181,0.00105842,0.001684201,0.003525934,0.0009171396,0.002419787,0.001545562,0.00179696,0.001028339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00127457,"about_ca_system_score_gemma":0.001295543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005523612,"about_ca_topic_score_gemma":0.004610016,"domain_scores_codex":[0.9982966,0.0006941472,0.0001067748,0.0002882353,0.0003814669,0.0002329144],"domain_scores_gemma":[0.9980751,0.001120853,0.0002249016,0.0002497638,0.0001979184,0.0001315525],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001335291,0.0001995681,0.0007765105,0.0002681822,0.00008041438,0.0001366359,0.00004189937,0.9207097,0.000712206,0.02358724,0.004915009,0.04843916],"study_design_scores_gemma":[0.00001464496,0.00003490713,0.0001721194,0.00001624299,0.000009637334,0.00006258196,0.00001640902,0.9867165,0.0005302659,0.0105858,0.001829861,0.00001108829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03981902,0.001806473,0.9431332,0.0005180183,0.0001680475,0.0002061967,0.0007687735,0.0007247097,0.01285549],"genre_scores_gemma":[0.4010843,0.00162064,0.5879822,0.0002530978,0.0001303083,0.0003339944,0.001629992,0.0003361366,0.006629409],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007026781,"threshold_uncertainty_score":0.02350694,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","authors":[{"name":"Mouad Morabit","is_ca":true},{"name":"Guy Desaulniers","is_ca":true},{"name":"Andrea Lodi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001814454,0.001175279,0.001444261,0.001517542,0.0007313347,0.001005232,0.001460131,0.001049249,0.00602558],"category_scores_gemma":[0.004892913,0.0006886294,0.0009344883,0.00216887,0.0007678208,0.001247705,0.000855323,0.001874176,0.001019587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001097671,"about_ca_system_score_gemma":0.002090476,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006328958,"about_ca_topic_score_gemma":0.008830274,"domain_scores_codex":[0.9989449,0.0005711227,0.00003959215,0.0001353755,0.0001963011,0.0001127451],"domain_scores_gemma":[0.994794,0.004059643,0.0002775356,0.0002293635,0.0005138292,0.0001257523],"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.00008485217,0.0001585509,0.0006159787,0.0001589196,0.00004673981,0.00006884953,0.00004900556,0.8786345,0.001234796,0.009001076,0.004089175,0.1058576],"study_design_scores_gemma":[0.00001203993,0.00001986545,0.00005178605,0.000007034078,0.00000414602,0.00000986179,0.000005532939,0.9954977,0.0003032856,0.003663878,0.0004211967,0.000003723237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01060329,0.0003880321,0.9855273,0.0002003925,0.00005494038,0.0001423916,0.0001180224,0.0005459391,0.002419689],"genre_scores_gemma":[0.2398162,0.000431912,0.7547677,0.0002876848,0.0001175565,0.0005187194,0.0007311178,0.0002770063,0.003052054],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006328958,"threshold_uncertainty_score":0.02015758,"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","authors":[{"name":"Bahman Naderi","is_ca":true},{"name":"Vahid Roshanaei","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001238895,0.001123677,0.0006631624,0.001205982,0.0005124942,0.0008432163,0.001059379,0.0007414168,0.004152225],"category_scores_gemma":[0.001716166,0.0005974811,0.001407187,0.001086713,0.0006028512,0.001017716,0.0007029133,0.0013203,0.000361548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001181704,"about_ca_system_score_gemma":0.002396703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004019663,"about_ca_topic_score_gemma":0.006801941,"domain_scores_codex":[0.9994765,0.0001930142,0.0000224878,0.00008096384,0.0001442985,0.00008276678],"domain_scores_gemma":[0.9994301,0.0003415266,0.00009133499,0.00004226956,0.00005937418,0.00003539475],"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.0000376866,0.00006084767,0.0002667073,0.00007718584,0.00003310433,0.00003215682,0.00002297303,0.9634817,0.001485365,0.01036658,0.0005988798,0.02353686],"study_design_scores_gemma":[0.00001132228,0.00004102403,0.0000505433,0.000008426221,0.000007416122,0.00001259141,0.00001075127,0.9921907,0.0004973051,0.006669197,0.0004962348,0.00000447629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03554398,0.000383623,0.956647,0.0002992855,0.00004250758,0.000117883,0.0001670063,0.0003357109,0.006462969],"genre_scores_gemma":[0.3976005,0.0005683374,0.5976174,0.0002085885,0.0000493145,0.0002319621,0.0004365235,0.0001440324,0.00314335],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004152225,"threshold_uncertainty_score":0.01389062,"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","authors":[{"name":"Milad Dehghani Filabadi","is_ca":true},{"name":"Houra Mahmoudzadeh","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009671554,0.003026732,0.002058806,0.002268106,0.0008401857,0.003255981,0.002255716,0.002346926,0.004121357],"category_scores_gemma":[0.01823411,0.001093643,0.002787091,0.001614575,0.003262068,0.00480994,0.003523007,0.004738916,0.0005130806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00187808,"about_ca_system_score_gemma":0.001379402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000842448,"about_ca_topic_score_gemma":0.0006382145,"domain_scores_codex":[0.9937034,0.003338162,0.0002917026,0.0006938943,0.001588673,0.0003842077],"domain_scores_gemma":[0.991021,0.00638662,0.0008396319,0.001015776,0.0005681742,0.0001689477],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003357703,0.00003483005,0.0002387299,0.0001993927,0.0001041715,0.00007556071,0.00009133277,0.4263398,0.0009499684,0.5514514,0.001339657,0.01914162],"study_design_scores_gemma":[0.00001441404,0.00004300231,0.00008201287,0.00007383456,0.00002625855,0.0000395522,0.00002318511,0.6986566,0.0007286838,0.2967123,0.003576933,0.00002326387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001830719,0.0004294935,0.9925758,0.0002711852,0.00002610231,0.00003187644,0.00003706834,0.00005321591,0.004744616],"genre_scores_gemma":[0.4708978,0.003155736,0.5166319,0.0005850443,0.0006630199,0.001005675,0.0003730179,0.0004457246,0.006242103],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009671554,"threshold_uncertainty_score":0.05114865,"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)","authors":[{"name":"El Houcine Bergou","is_ca":false},{"name":"Youssef Diouane","is_ca":true},{"name":"Vladimír Kunc","is_ca":false},{"name":"Vyacheslav Kungurtsev","is_ca":false},{"name":"Clément W. Royer","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002347247,0.00112469,0.001137018,0.0009287834,0.0005150403,0.001125961,0.001203203,0.001604489,0.003177663],"category_scores_gemma":[0.006634558,0.0006224446,0.0008605046,0.000706848,0.001103,0.001270535,0.001338206,0.00175978,0.001164197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00109975,"about_ca_system_score_gemma":0.001563837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003632594,"about_ca_topic_score_gemma":0.004181474,"domain_scores_codex":[0.999208,0.0003389903,0.00003525558,0.000111849,0.0002502048,0.00005567489],"domain_scores_gemma":[0.9981914,0.001027127,0.0001600615,0.0001962952,0.0003342819,0.00009090255],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001704909,0.0001175618,0.0008634294,0.0001603269,0.00007200995,0.0001458213,0.0001680783,0.7917305,0.008617181,0.1049404,0.004020668,0.08899349],"study_design_scores_gemma":[0.000005560347,0.00002850134,0.00003260632,0.000006095117,0.000002977699,0.00001389306,0.000003452909,0.9945169,0.0005722034,0.004054116,0.0007593222,0.000004492757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003175703,0.0001029735,0.995566,0.00008814288,0.0000214376,0.00002964735,0.00001789755,0.0002174433,0.0007807413],"genre_scores_gemma":[0.1610742,0.0002102097,0.832938,0.0002840849,0.00007121479,0.0003383293,0.0002023141,0.0004137115,0.004467866],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003632594,"threshold_uncertainty_score":0.01241356,"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","authors":[{"name":"Sanjay Dominik Jena","is_ca":true},{"name":"Andrea Lodi","is_ca":true},{"name":"Hugo Palmer","is_ca":false},{"name":"Claudio Sole","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003694697,0.001316501,0.002175095,0.0009607368,0.0005685897,0.001508119,0.002245435,0.001745549,0.005596526],"category_scores_gemma":[0.008193608,0.00105076,0.002116367,0.001540436,0.001082143,0.001682295,0.001368264,0.002417452,0.0008962811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001379079,"about_ca_system_score_gemma":0.001848837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01340984,"about_ca_topic_score_gemma":0.01392058,"domain_scores_codex":[0.9979903,0.001153599,0.00009533646,0.000341261,0.0002375219,0.000182176],"domain_scores_gemma":[0.9935249,0.00516215,0.0003913094,0.0002427916,0.0004950447,0.0001837294],"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.00005981398,0.00004290432,0.0006329169,0.00004833984,0.0000465618,0.000049054,0.00002938036,0.97991,0.000189923,0.01016956,0.0005864742,0.008235026],"study_design_scores_gemma":[0.000004904229,0.000009818234,0.00006407887,0.00000295626,0.000004226609,0.000003590629,0.000003164383,0.9961221,0.00003075225,0.003644351,0.000106363,0.000003662517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02295652,0.0002966426,0.974265,0.0003384166,0.00004188551,0.0001079178,0.0005301679,0.000285488,0.001177946],"genre_scores_gemma":[0.6298508,0.0005277061,0.3597867,0.0004467891,0.0001078603,0.0007871546,0.001956176,0.0001541669,0.00638259],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01340984,"threshold_uncertainty_score":0.0266636,"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","authors":[{"name":"Vedat Bayram","is_ca":false},{"name":"Gohram Baloch","is_ca":false},{"name":"Fatma Gzara","is_ca":true},{"name":"Samir Elhedhli","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003346735,0.00156313,0.002273029,0.001408419,0.000601996,0.002347567,0.002430409,0.001516646,0.001476047],"category_scores_gemma":[0.008228499,0.001572265,0.001351545,0.001670373,0.001066383,0.002255937,0.001225025,0.001995647,0.0002937148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00186297,"about_ca_system_score_gemma":0.002749153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01155597,"about_ca_topic_score_gemma":0.007810591,"domain_scores_codex":[0.9984567,0.0005179477,0.00008551587,0.0003981795,0.0003720389,0.000169674],"domain_scores_gemma":[0.9956101,0.002779164,0.0006915517,0.0002724621,0.0004986769,0.0001480695],"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.00002322979,0.00002446459,0.0002212835,0.00003616707,0.0000201104,0.00002083634,0.00001152396,0.990099,0.0003231178,0.002466173,0.0001788283,0.006575314],"study_design_scores_gemma":[0.000002279455,0.00000936372,0.00003879049,0.000002322706,0.000003115353,0.000002440307,0.000002824816,0.9981791,0.0001379254,0.001550455,0.00006879829,0.000002635724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01396992,0.0003578434,0.9839928,0.0002958958,0.00002365039,0.00006527923,0.0001683308,0.0003702057,0.0007561081],"genre_scores_gemma":[0.6451427,0.0007553534,0.3510871,0.0001714989,0.0001643305,0.0002429789,0.0007547985,0.0002395263,0.001441765],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01155597,"threshold_uncertainty_score":0.02297741,"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","authors":[{"name":"Patrick Jaillet","is_ca":false},{"name":"Sanjay Dominik Jena","is_ca":true},{"name":"Tsan Sheng Ng","is_ca":false},{"name":"Melvyn Sim","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006821154,0.00157289,0.002155276,0.001254243,0.0008596088,0.004472826,0.002216916,0.00266694,0.004871276],"category_scores_gemma":[0.0239553,0.000805228,0.001885285,0.0015413,0.002766596,0.005261214,0.002416284,0.003361981,0.0004178755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002978742,"about_ca_system_score_gemma":0.001658015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003969041,"about_ca_topic_score_gemma":0.002429314,"domain_scores_codex":[0.9936333,0.002938988,0.0003154364,0.00109689,0.001346904,0.0006684479],"domain_scores_gemma":[0.9844976,0.01141733,0.001792923,0.0008139667,0.0009227169,0.0005554022],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007179846,0.00004620593,0.0005976826,0.0001161043,0.00006635681,0.0001411599,0.0001565009,0.5819693,0.0004556696,0.4060652,0.001209373,0.009104589],"study_design_scores_gemma":[0.00001582535,0.00003611579,0.0001291597,0.00002396755,0.00001322236,0.0000339815,0.00003174824,0.7845157,0.0001713334,0.2142714,0.0007442538,0.00001328152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03980537,0.001013758,0.9452987,0.001770716,0.00005924961,0.00007649173,0.000293888,0.0001870144,0.01149476],"genre_scores_gemma":[0.893135,0.001327472,0.09850643,0.0004259998,0.0002128325,0.0002382502,0.0004286039,0.0001035442,0.005621934],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006821154,"threshold_uncertainty_score":0.03607416,"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","authors":[{"name":"Fatma Gzara","is_ca":true},{"name":"Samir Elhedhli","is_ca":true},{"name":"Yildiz Ugur","is_ca":true},{"name":"Gohram Baloch","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002299595,0.001298609,0.001562033,0.001210134,0.0007255154,0.001973595,0.001806225,0.002010603,0.001975876],"category_scores_gemma":[0.004046178,0.001288433,0.001604428,0.002045896,0.001367951,0.001646378,0.001050204,0.001818069,0.0002435236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003064785,"about_ca_system_score_gemma":0.003454285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.04475573,"about_ca_topic_score_gemma":0.02764689,"domain_scores_codex":[0.9989986,0.0003997041,0.00005554169,0.0001861579,0.0002003407,0.0001597111],"domain_scores_gemma":[0.9970294,0.002126033,0.0002767508,0.0001298909,0.0003080729,0.0001298151],"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.000007077437,0.00001291501,0.0001531287,0.00001023086,0.000005489786,0.000009365919,0.00000618233,0.9979603,0.00006653194,0.001026298,0.00004613102,0.0006963537],"study_design_scores_gemma":[0.000002283781,0.000003588556,0.00004759969,0.000001479957,0.000001665582,0.000001045813,0.000003636002,0.9991488,0.00005482474,0.0006648492,0.00006889601,0.000001301145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2403419,0.0009846329,0.7482568,0.001098865,0.00009376598,0.0002632118,0.001412725,0.0005436752,0.007004481],"genre_scores_gemma":[0.8469344,0.0006987632,0.1464615,0.0001105973,0.00004464763,0.0004202132,0.001171508,0.0001492293,0.004009095],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04475573,"threshold_uncertainty_score":0.08899045,"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","authors":[{"name":"Claudio Contardo","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003909586,0.001402287,0.001336966,0.001105173,0.001174616,0.001618486,0.002165835,0.001970276,0.004909138],"category_scores_gemma":[0.01392225,0.0007843755,0.001376786,0.001031772,0.00208689,0.00202445,0.002651035,0.003117175,0.0008395287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002438791,"about_ca_system_score_gemma":0.004030297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009875756,"about_ca_topic_score_gemma":0.01152924,"domain_scores_codex":[0.9986512,0.0004874685,0.00007527151,0.0002297453,0.0003620172,0.0001943622],"domain_scores_gemma":[0.9942972,0.004252895,0.0003646163,0.0003610188,0.000540618,0.0001836289],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001866051,0.00009938395,0.0009318632,0.0003199784,0.00006258349,0.00010114,0.0001543568,0.8993033,0.001555407,0.05150554,0.003251691,0.04252811],"study_design_scores_gemma":[0.0000218299,0.0000368604,0.00009913678,0.00003115273,0.000008449188,0.00001900562,0.00002695073,0.9809299,0.0006741725,0.01696233,0.00118387,0.000006379668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01765575,0.0005330658,0.971653,0.0007546917,0.00006621498,0.0001681666,0.0001017456,0.0003815198,0.008685897],"genre_scores_gemma":[0.1727902,0.0003461317,0.8211821,0.0003028039,0.00006417513,0.0004386731,0.0003197128,0.0003178484,0.004238373],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009875756,"threshold_uncertainty_score":0.02067614,"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","authors":[{"name":"Peyman Kafaei","is_ca":true},{"name":"Quentin Cappart","is_ca":true},{"name":"Nicolas Chapados","is_ca":true},{"name":"Hamed Pouya","is_ca":true},{"name":"Louis-Martin Rousseau","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008885315,0.0008824953,0.0009275533,0.0003395065,0.0003081656,0.0005759801,0.001110756,0.001011472,0.001593374],"category_scores_gemma":[0.002609049,0.0004555434,0.0004507203,0.0003215641,0.0009640777,0.000864091,0.0008098276,0.001306882,0.0001769846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001167179,"about_ca_system_score_gemma":0.001275388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006408455,"about_ca_topic_score_gemma":0.005618979,"domain_scores_codex":[0.9996464,0.0001097407,0.00001523943,0.00008520187,0.0000689649,0.00007437714],"domain_scores_gemma":[0.9988747,0.0006890919,0.0001482119,0.0000611307,0.0001539355,0.00007283917],"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.00003542413,0.00003192454,0.0004174887,0.0000211434,0.00001739982,0.00002340861,0.00001475809,0.9796696,0.0004682103,0.003638612,0.0003373346,0.01532472],"study_design_scores_gemma":[0.000003612995,0.000006384967,0.00002207357,0.000001196672,0.000001610109,0.000002450847,0.000001198596,0.9983857,0.00007699306,0.001436986,0.0000607998,0.000001109198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05482637,0.0003793473,0.9407144,0.0004584236,0.00008613186,0.00004847316,0.00004618139,0.0003727442,0.003067861],"genre_scores_gemma":[0.9346768,0.0001318934,0.06210246,0.0001728825,0.00003915506,0.00008191126,0.00005973173,0.00003683765,0.002698374],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006408455,"threshold_uncertainty_score":0.01274228,"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","authors":[{"name":"Taghi Khaniyev","is_ca":false},{"name":"Samir Elhedhli","is_ca":true},{"name":"Fatih Safa Erenay","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002226586,0.0008058824,0.0009762704,0.001216612,0.0008165502,0.0010854,0.0009362472,0.001307555,0.002424275],"category_scores_gemma":[0.01307801,0.0003768374,0.0008732246,0.001388569,0.001635646,0.001647469,0.001764378,0.001821853,0.000120414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001259908,"about_ca_system_score_gemma":0.0008156827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003184192,"about_ca_topic_score_gemma":0.003265073,"domain_scores_codex":[0.9993849,0.0003669877,0.00002053272,0.00008054134,0.00008123002,0.00006588235],"domain_scores_gemma":[0.9907274,0.008021555,0.000539759,0.0002235719,0.0002653853,0.0002223268],"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.00008019534,0.0000560654,0.001185129,0.0001118836,0.00003684093,0.0001207758,0.00007588847,0.9221533,0.0005923266,0.06539799,0.001249735,0.008939848],"study_design_scores_gemma":[0.0000132623,0.00002879742,0.0002040428,0.00001047673,0.000007425656,0.00002571658,0.00003364153,0.9485943,0.000233625,0.05044606,0.000395924,0.000006674851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1363683,0.001127466,0.8534764,0.001951338,0.00007004347,0.0001100477,0.0002586368,0.0001462129,0.006491423],"genre_scores_gemma":[0.8430818,0.0009151967,0.1531481,0.0001344018,0.0001348461,0.0002187559,0.0002392075,0.00008516816,0.002042473],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003184192,"threshold_uncertainty_score":0.01177549,"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","authors":[{"name":"Naveed Haghani","is_ca":false},{"name":"Claudio Contardo","is_ca":true},{"name":"Julian Yarkony","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002055168,0.001380101,0.0009116321,0.0009733741,0.0004309312,0.001641969,0.00132136,0.0009893115,0.008107489],"category_scores_gemma":[0.006877675,0.0006134936,0.001326538,0.001459475,0.001133418,0.001429647,0.001736117,0.003444878,0.0008744364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001259659,"about_ca_system_score_gemma":0.00143417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002492297,"about_ca_topic_score_gemma":0.002561294,"domain_scores_codex":[0.998778,0.0004141952,0.00003901714,0.0001697281,0.0003692901,0.0002296833],"domain_scores_gemma":[0.9973046,0.001805203,0.0002346008,0.0002756969,0.0002531472,0.0001268477],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001237346,0.0001103776,0.000571424,0.0002805563,0.00005199559,0.0001107754,0.00008482856,0.7481999,0.002268516,0.1633474,0.005512651,0.07933791],"study_design_scores_gemma":[0.0000322333,0.00006279197,0.0001126282,0.00002880628,0.00001131022,0.00002911556,0.00001673076,0.9391308,0.0008688409,0.05608197,0.003615047,0.000009649815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0146741,0.0005591588,0.9744834,0.000532513,0.0001259954,0.0001037073,0.0002242824,0.0002833063,0.00901349],"genre_scores_gemma":[0.3788537,0.0009380152,0.6108016,0.0004968536,0.0002038834,0.0003503718,0.0005340826,0.0002626422,0.007558939],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008107489,"threshold_uncertainty_score":0.02712226,"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","authors":[{"name":"Chun Cheng","is_ca":false},{"name":"Yossiri Adulyasak","is_ca":true},{"name":"Louis-Martin Rousseau","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00205549,0.0009894586,0.001454437,0.0006607267,0.0004948687,0.001496742,0.001698294,0.001767131,0.002570743],"category_scores_gemma":[0.007034518,0.0006725476,0.000988087,0.001091471,0.00104151,0.001771383,0.001585471,0.001218338,0.0003201594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00208574,"about_ca_system_score_gemma":0.001543369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01000962,"about_ca_topic_score_gemma":0.004539714,"domain_scores_codex":[0.9986392,0.000516256,0.00004782054,0.0003177417,0.0001885455,0.0002904173],"domain_scores_gemma":[0.9973621,0.001431252,0.0005605227,0.0002410999,0.0002789461,0.0001261516],"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.00002261582,0.000005061458,0.0001232441,0.00001295029,0.00000832568,0.0000221727,0.000005688438,0.994599,0.0001621055,0.002429266,0.0001860123,0.002423604],"study_design_scores_gemma":[0.000006321368,0.00001949662,0.0001142979,0.000002975071,0.000005307912,0.00001615794,0.00001389473,0.9943008,0.0001988206,0.005115464,0.0002013274,0.000005132266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05044188,0.0003045412,0.9455696,0.0003487516,0.00004289233,0.00004659587,0.0002545965,0.0003429311,0.002648133],"genre_scores_gemma":[0.9447823,0.0002211427,0.05239668,0.00006656038,0.0000400598,0.00006908404,0.0002460275,0.00007704244,0.002101013],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01000962,"threshold_uncertainty_score":0.01990271,"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","authors":[{"name":"Seksan Kiatsupaibul","is_ca":false},{"name":"Giulia Pedrielli","is_ca":false},{"name":"Christopher Ryan","is_ca":true},{"name":"Robert L. Smith","is_ca":false},{"name":"Zelda B. Zabinsky","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01094683,0.001658081,0.002443346,0.002382252,0.001279744,0.002730264,0.003271208,0.002719949,0.004480483],"category_scores_gemma":[0.04004582,0.001549315,0.001144046,0.001508864,0.00487359,0.004109174,0.003263876,0.003198157,0.0005297407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003280314,"about_ca_system_score_gemma":0.003660786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009033579,"about_ca_topic_score_gemma":0.009253663,"domain_scores_codex":[0.9962321,0.002561451,0.0001173038,0.0003817039,0.0004429494,0.0002644248],"domain_scores_gemma":[0.9628422,0.03396797,0.001032298,0.0006393172,0.0007187279,0.0007994117],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001720923,0.0001322028,0.0007955405,0.0001265794,0.00006577075,0.00004694873,0.000104711,0.8518321,0.0002519272,0.1367042,0.0006788732,0.009089132],"study_design_scores_gemma":[0.00002180259,0.00001684982,0.00003744498,0.00001128735,0.000005503161,0.000005554861,0.00000723152,0.9607873,0.00006705789,0.03890776,0.0001259245,0.00000632706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03659993,0.0006201429,0.953593,0.0008580727,0.00006006737,0.0002562001,0.00007802841,0.0002391413,0.007695413],"genre_scores_gemma":[0.7578533,0.0007200034,0.2321794,0.0005610462,0.0001371671,0.0008673154,0.0002137068,0.0001533177,0.007314733],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01094683,"threshold_uncertainty_score":0.0578931,"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","authors":[{"name":"Julian Yarkony","is_ca":false},{"name":"Yossiri Adulyasak","is_ca":true},{"name":"Maneesh Singh","is_ca":false},{"name":"Guy Desaulniers","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003273539,0.001840263,0.002333,0.002028413,0.001116887,0.003585111,0.002329079,0.002005124,0.008824345],"category_scores_gemma":[0.01299657,0.001113226,0.00187873,0.005971971,0.001426053,0.004142147,0.002936963,0.004617569,0.0023283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001852712,"about_ca_system_score_gemma":0.002088338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00165071,"about_ca_topic_score_gemma":0.001713712,"domain_scores_codex":[0.9963251,0.001615033,0.0002383469,0.0006157724,0.000948316,0.0002574109],"domain_scores_gemma":[0.9926537,0.004661269,0.0006921032,0.001029539,0.0007424588,0.0002208827],"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.0002796361,0.0003694317,0.001027125,0.0008872641,0.0001619975,0.0002402791,0.0001993585,0.4333434,0.002926912,0.2032549,0.01937455,0.3379351],"study_design_scores_gemma":[0.00002077336,0.00009731606,0.0001927663,0.00006956166,0.00002268681,0.0001391098,0.00005698374,0.8368363,0.001572509,0.1529721,0.007998862,0.00002098535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003069006,0.00114212,0.9918336,0.0004100909,0.0001035443,0.0001529012,0.0001862609,0.0003231235,0.002779463],"genre_scores_gemma":[0.1201552,0.003173141,0.8687512,0.0004848088,0.0004583171,0.0008067761,0.001261428,0.0002964984,0.004612677],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008824345,"threshold_uncertainty_score":0.02952039,"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","authors":[{"name":"Aaron Babier","is_ca":true},{"name":"Timothy C. Y. Chan","is_ca":true},{"name":"Taewoo Lee","is_ca":false},{"name":"Rafid Mahmood","is_ca":true},{"name":"Daria Terekhov","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008274388,0.001765971,0.00230926,0.001673373,0.000764336,0.002101277,0.002806109,0.002278312,0.002505662],"category_scores_gemma":[0.01984061,0.0009472169,0.001665696,0.001543235,0.001347975,0.002371677,0.003175173,0.003668157,0.0006583661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001626979,"about_ca_system_score_gemma":0.001974164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005255026,"about_ca_topic_score_gemma":0.004757103,"domain_scores_codex":[0.995616,0.002559779,0.0001848402,0.0004277741,0.001022101,0.0001895367],"domain_scores_gemma":[0.9921721,0.00487204,0.000539319,0.0008781074,0.001316018,0.0002223427],"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.0000298494,0.00003139655,0.0002998385,0.00004533023,0.0000619553,0.00002709375,0.00003921553,0.9334717,0.0004966197,0.0326313,0.0009213332,0.0319443],"study_design_scores_gemma":[0.000002686907,0.00001235769,0.00002409014,0.000006208877,0.000004536662,0.000004931588,0.000002281268,0.9887636,0.0001551811,0.01077091,0.0002495804,0.000003703027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001188565,0.0001030338,0.998026,0.0001035912,0.00001091483,0.00001734825,0.00002730781,0.0001396881,0.0003834592],"genre_scores_gemma":[0.2260053,0.0004934363,0.7697524,0.0002744224,0.0001617553,0.0005719081,0.0004649254,0.0003916511,0.001884121],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008274388,"threshold_uncertainty_score":0.0437597,"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","authors":[{"name":"Julien Pallage","is_ca":true},{"name":"Antoine Lesage‐Landry","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001713273,0.001650256,0.001244453,0.0004553758,0.0003714217,0.001076157,0.00228139,0.001519163,0.001805129],"category_scores_gemma":[0.006757947,0.0007984058,0.0007840422,0.000453235,0.001378469,0.001723383,0.002037742,0.002440323,0.0005236259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001142979,"about_ca_system_score_gemma":0.001592859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007571226,"about_ca_topic_score_gemma":0.008095675,"domain_scores_codex":[0.9992616,0.0002239286,0.00004084123,0.0001986348,0.0001715431,0.0001035198],"domain_scores_gemma":[0.9983967,0.0007746927,0.000201679,0.0001739012,0.000377904,0.0000750661],"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.00004639564,0.0000148736,0.0004778352,0.00003461458,0.00002852656,0.00005434618,0.00002898659,0.9668154,0.001184184,0.006543228,0.0007462203,0.02402543],"study_design_scores_gemma":[0.000001406571,0.000007782346,0.00002159505,0.000002280505,0.000001577745,0.000003676888,0.000001623224,0.997931,0.0001988028,0.001756345,0.0000719631,0.000002059907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01488746,0.0001974315,0.9828288,0.0002576348,0.00003410997,0.00003114714,0.00009112479,0.0004891779,0.001183098],"genre_scores_gemma":[0.8070697,0.0003600264,0.1837192,0.000584017,0.00007753498,0.0002270463,0.0006991599,0.0003033412,0.006959996],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007571226,"threshold_uncertainty_score":0.01505429,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}