{"meta":{"query_hash":"ad09bf94a824","filters":{"venue":"INFORMS Journal on Optimization"},"cohort_total":18,"direct_labels_cover":0,"predictions_cover":18,"exported":18,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/ad09bf94a824","api":"https://metacan.xera.ac/api/v1/cohort?venue=INFORMS+Journal+on+Optimization"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.028408940318962666,"score_gpt":0.29410412738804687,"score_spread":0.2656951870690842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896830491","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031757029,0.000102973514,0.99556595,0.00008814288,0.0000214376,0.000029647348,0.000017897546,0.00021744326,0.00078074133],"genre_scores_gemma":[0.16107416,0.0002102097,0.832938,0.00028408488,0.00007121479,0.00033832926,0.00020231407,0.00041371153,0.004467866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920803,0.0003389903,0.000035255583,0.00011184899,0.00025020476,0.00005567489],"domain_scores_gemma":[0.9981914,0.0010271274,0.00016006152,0.00019629522,0.00033428188,0.000090902555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023472467,0.0011246904,0.0011370183,0.00092878344,0.0005150403,0.0011259607,0.0012032029,0.0016044887,0.0031776633],"category_scores_gemma":[0.0066345576,0.0006224446,0.0008605046,0.000706848,0.0011029998,0.0012705353,0.0013382062,0.0017597801,0.0011641968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017049086,0.000117561816,0.00086342945,0.00016032686,0.00007200995,0.00014582134,0.0001680783,0.7917305,0.008617181,0.104940414,0.004020668,0.08899349],"study_design_scores_gemma":[0.0000055603473,0.000028501343,0.000032606316,0.0000060951165,0.0000029776986,0.000013893055,0.0000034529094,0.9945169,0.00057220337,0.0040541156,0.0007593222,0.000004492757],"about_ca_topic_score_codex":0.0036325937,"about_ca_topic_score_gemma":0.0041814735,"teacher_disagreement_score":0.0036325937,"about_ca_system_score_codex":0.0010997499,"about_ca_system_score_gemma":0.001563837,"threshold_uncertainty_score":0.012413561},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.046377934922608416,"score_gpt":0.24423321181679158,"score_spread":0.19785527689418317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901560921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050441884,0.00030454123,0.94556963,0.00034875158,0.00004289233,0.000046595873,0.00025459647,0.00034293107,0.0026481329],"genre_scores_gemma":[0.9447823,0.00022114272,0.052396677,0.00006656038,0.000040059796,0.00006908404,0.00024602754,0.00007704244,0.002101013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863917,0.000516256,0.00004782054,0.00031774174,0.00018854554,0.0002904173],"domain_scores_gemma":[0.9973621,0.0014312521,0.00056052266,0.00024109992,0.00027894613,0.0001261516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00205549,0.0009894586,0.0014544367,0.0006607267,0.0004948687,0.0014967424,0.0016982937,0.0017671307,0.0025707432],"category_scores_gemma":[0.007034518,0.0006725476,0.000988087,0.0010914707,0.00104151,0.0017713829,0.0015854706,0.0012183384,0.00032015936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022615815,0.0000050614576,0.00012324411,0.000012950289,0.00000832568,0.000022172695,0.0000056884383,0.994599,0.00016210548,0.0024292658,0.00018601232,0.0024236045],"study_design_scores_gemma":[0.000006321368,0.000019496621,0.00011429791,0.0000029750706,0.0000053079125,0.000016157936,0.000013894727,0.99430084,0.00019882058,0.0051154643,0.00020132738,0.000005132266],"about_ca_topic_score_codex":0.010009624,"about_ca_topic_score_gemma":0.0045397137,"teacher_disagreement_score":0.010009624,"about_ca_system_score_codex":0.00208574,"about_ca_system_score_gemma":0.0015433694,"threshold_uncertainty_score":0.019902706},"labels":[],"label_agreement":null},{"id":"W2955422897","doi":"10.1287/ijoo.2019.0013","title":"Three-Dimensional Bin Packing and Mixed-Case Palletization","year":2019,"lang":"en","type":"article","venue":"INFORMS Journal on Optimization","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00938567653688308,"score_gpt":0.20446523834767633,"score_spread":0.19507956181079325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955422897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039819025,0.0018064731,0.94313323,0.00051801826,0.00016804748,0.00020619672,0.0007687735,0.00072470965,0.012855492],"genre_scores_gemma":[0.40108427,0.0016206396,0.5879822,0.00025309782,0.00013030827,0.0003339944,0.0016299917,0.0003361366,0.0066294093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829656,0.0006941472,0.0001067748,0.00028823534,0.0003814669,0.00023291445],"domain_scores_gemma":[0.9980751,0.0011208529,0.00022490163,0.0002497638,0.00019791836,0.00013155254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016551731,0.0015155663,0.0015657716,0.0014208223,0.0007131243,0.0025298994,0.0023146558,0.0016237452,0.0070267813],"category_scores_gemma":[0.0047818096,0.0010584197,0.001684201,0.003525934,0.0009171396,0.0024197865,0.001545562,0.0017969598,0.0010283388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013352915,0.00019956805,0.0007765105,0.0002681822,0.00008041438,0.00013663586,0.000041899373,0.92070967,0.000712206,0.023587242,0.0049150093,0.04843916],"study_design_scores_gemma":[0.000014644956,0.000034907127,0.00017211935,0.000016242986,0.000009637334,0.00006258196,0.00001640902,0.9867165,0.00053026585,0.010585801,0.0018298612,0.000011088295],"about_ca_topic_score_codex":0.0055236123,"about_ca_topic_score_gemma":0.004610016,"teacher_disagreement_score":0.0070267813,"about_ca_system_score_codex":0.0012745702,"about_ca_system_score_gemma":0.0012955428,"threshold_uncertainty_score":0.02350694},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.047258966436400957,"score_gpt":0.3207108771548662,"score_spread":0.2734519107184652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955458186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030690057,0.0011421198,0.99183357,0.00041009087,0.00010354432,0.00015290124,0.00018626092,0.0003231235,0.0027794633],"genre_scores_gemma":[0.12015521,0.003173141,0.8687512,0.00048480878,0.00045831708,0.0008067761,0.0012614278,0.00029649845,0.004612677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963251,0.0016150326,0.00023834694,0.00061577244,0.000948316,0.00025741092],"domain_scores_gemma":[0.9926537,0.0046612695,0.0006921032,0.0010295394,0.0007424588,0.00022088269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032735392,0.001840263,0.0023329996,0.0020284131,0.0011168874,0.0035851113,0.0023290785,0.0020051235,0.008824345],"category_scores_gemma":[0.01299657,0.0011132259,0.0018787296,0.0059719714,0.0014260529,0.0041421466,0.0029369632,0.004617569,0.0023282997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027963612,0.00036943168,0.0010271254,0.00088726415,0.00016199746,0.00024027907,0.00019935855,0.4333434,0.0029269122,0.2032549,0.019374548,0.33793512],"study_design_scores_gemma":[0.000020773365,0.000097316064,0.00019276631,0.00006956166,0.000022686805,0.00013910985,0.000056983736,0.83683634,0.001572509,0.15297212,0.007998862,0.000020985348],"about_ca_topic_score_codex":0.00165071,"about_ca_topic_score_gemma":0.0017137121,"teacher_disagreement_score":0.008824345,"about_ca_system_score_codex":0.0018527119,"about_ca_system_score_gemma":0.002088338,"threshold_uncertainty_score":0.029520392},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.16963652680852584,"score_gpt":0.4728932681299927,"score_spread":0.30325674132146685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982146718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011885654,0.00010303381,0.998026,0.00010359118,0.000010914827,0.000017348248,0.000027307806,0.00013968808,0.00038345924],"genre_scores_gemma":[0.22600526,0.0004934363,0.76975244,0.0002744224,0.00016175535,0.0005719081,0.00046492537,0.0003916511,0.0018841206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99561596,0.0025597792,0.00018484017,0.00042777412,0.001022101,0.00018953672],"domain_scores_gemma":[0.9921721,0.00487204,0.000539319,0.0008781074,0.0013160178,0.0002223427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008274388,0.0017659713,0.00230926,0.001673373,0.00076433603,0.0021012772,0.0028061087,0.0022783123,0.0025056622],"category_scores_gemma":[0.01984061,0.00094721693,0.0016656964,0.0015432355,0.0013479751,0.0023716774,0.0031751734,0.0036681567,0.0006583661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000298494,0.00003139655,0.00029983852,0.000045330235,0.0000619553,0.000027093745,0.000039215534,0.9334717,0.00049661973,0.0326313,0.00092133315,0.031944297],"study_design_scores_gemma":[0.000002686907,0.000012357686,0.000024090137,0.0000062088766,0.0000045366623,0.0000049315877,0.0000022812683,0.9887636,0.00015518107,0.010770906,0.00024958036,0.0000037030266],"about_ca_topic_score_codex":0.0052550263,"about_ca_topic_score_gemma":0.0047571026,"teacher_disagreement_score":0.008274388,"about_ca_system_score_codex":0.001626979,"about_ca_system_score_gemma":0.001974164,"threshold_uncertainty_score":0.043759704},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03670787673228427,"score_gpt":0.2542556776300311,"score_spread":0.21754780089774683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999262999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014674102,0.0005591588,0.9744834,0.00053251296,0.00012599544,0.00010370727,0.0002242824,0.00028330626,0.00901349],"genre_scores_gemma":[0.37885368,0.0009380152,0.6108016,0.00049685355,0.00020388339,0.0003503718,0.0005340826,0.0002626422,0.007558939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877805,0.00041419515,0.00003901714,0.00016972811,0.00036929012,0.0002296833],"domain_scores_gemma":[0.99730456,0.001805203,0.00023460078,0.00027569695,0.00025314724,0.00012684775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020551682,0.001380101,0.0009116321,0.00097337406,0.0004309312,0.001641969,0.0013213595,0.0009893115,0.008107489],"category_scores_gemma":[0.0068776747,0.00061349355,0.0013265377,0.0014594754,0.0011334184,0.0014296474,0.0017361168,0.0034448777,0.0008744364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012373456,0.00011037762,0.000571424,0.0002805563,0.00005199559,0.00011077539,0.000084828556,0.7481999,0.0022685155,0.16334738,0.005512651,0.07933791],"study_design_scores_gemma":[0.000032233304,0.00006279197,0.0001126282,0.00002880628,0.000011310217,0.000029115556,0.000016730759,0.9391308,0.0008688409,0.05608197,0.003615047,0.000009649815],"about_ca_topic_score_codex":0.0024922974,"about_ca_topic_score_gemma":0.0025612935,"teacher_disagreement_score":0.008107489,"about_ca_system_score_codex":0.0012596587,"about_ca_system_score_gemma":0.0014341698,"threshold_uncertainty_score":0.02712226},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04660034792703439,"score_gpt":0.24599684941103322,"score_spread":0.19939650148399884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3019262760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017655745,0.0005330658,0.97165304,0.00075469166,0.000066214976,0.00016816665,0.00010174564,0.00038151979,0.008685897],"genre_scores_gemma":[0.17279015,0.00034613168,0.82118213,0.00030280394,0.00006417513,0.0004386731,0.00031971277,0.00031784843,0.004238373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986512,0.00048746847,0.000075271506,0.00022974526,0.00036201716,0.00019436219],"domain_scores_gemma":[0.9942972,0.004252895,0.00036461628,0.00036101884,0.00054061797,0.00018362893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039095855,0.0014022874,0.0013369662,0.0011051728,0.0011746158,0.0016184865,0.0021658354,0.0019702765,0.004909138],"category_scores_gemma":[0.013922246,0.0007843755,0.0013767857,0.0010317723,0.0020868904,0.0020244496,0.0026510353,0.0031171753,0.0008395287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018660507,0.00009938395,0.0009318632,0.0003199784,0.00006258349,0.00010114001,0.00015435679,0.8993033,0.0015554066,0.05150554,0.0032516909,0.042528108],"study_design_scores_gemma":[0.000021829901,0.000036860398,0.00009913678,0.000031152733,0.0000084491885,0.000019005618,0.000026950727,0.98092985,0.0006741725,0.016962335,0.0011838702,0.0000063796683],"about_ca_topic_score_codex":0.009875756,"about_ca_topic_score_gemma":0.011529243,"teacher_disagreement_score":0.009875756,"about_ca_system_score_codex":0.0024387909,"about_ca_system_score_gemma":0.004030297,"threshold_uncertainty_score":0.020676136},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Property (philosophy); Range (aeronautics); Set (abstract data type); Artificial intelligence; Engineering","score_opus":0.03218453083988348,"score_gpt":0.2940899635125121,"score_spread":0.2619054326726286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046504554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13636833,0.0011274663,0.8534764,0.0019513381,0.00007004347,0.00011004765,0.00025863678,0.00014621287,0.0064914227],"genre_scores_gemma":[0.84308183,0.00091519667,0.15314814,0.00013440182,0.00013484605,0.0002187559,0.00023920745,0.00008516816,0.0020424733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993849,0.0003669877,0.000020532723,0.000080541344,0.00008123002,0.00006588235],"domain_scores_gemma":[0.9907274,0.008021555,0.000539759,0.00022357191,0.00026538532,0.00022232681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022265858,0.0008058824,0.0009762704,0.0012166122,0.0008165502,0.0010853999,0.0009362472,0.0013075549,0.0024242753],"category_scores_gemma":[0.013078009,0.0003768374,0.0008732246,0.0013885689,0.0016356463,0.0016474694,0.0017643782,0.0018218533,0.00012041402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080195336,0.000056065404,0.0011851289,0.00011188358,0.00003684093,0.00012077579,0.00007588847,0.9221533,0.00059232657,0.065397985,0.001249735,0.008939848],"study_design_scores_gemma":[0.000013262304,0.00002879742,0.00020404281,0.000010476729,0.0000074256563,0.000025716585,0.00003364153,0.9485943,0.00023362497,0.050446063,0.00039592397,0.000006674851],"about_ca_topic_score_codex":0.0031841919,"about_ca_topic_score_gemma":0.0032650726,"teacher_disagreement_score":0.0031841919,"about_ca_system_score_codex":0.0012599077,"about_ca_system_score_gemma":0.0008156827,"threshold_uncertainty_score":0.011775494},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05708838260833872,"score_gpt":0.2791606620650704,"score_spread":0.2220722794567317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089129971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022956522,0.0002966426,0.97426504,0.0003384166,0.000041885505,0.00010791783,0.0005301679,0.00028548797,0.0011779463],"genre_scores_gemma":[0.6298508,0.0005277061,0.35978672,0.00044678908,0.00010786029,0.0007871546,0.001956176,0.00015416686,0.0063825897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799025,0.0011535995,0.00009533646,0.00034126098,0.0002375219,0.00018217602],"domain_scores_gemma":[0.9935249,0.00516215,0.00039130944,0.00024279163,0.0004950447,0.00018372935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036946973,0.0013165007,0.0021750955,0.0009607368,0.0005685897,0.001508119,0.0022454346,0.0017455486,0.0055965264],"category_scores_gemma":[0.008193608,0.0010507596,0.002116367,0.0015404358,0.001082143,0.0016822946,0.0013682637,0.0024174522,0.0008962811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005981398,0.000042904318,0.00063291687,0.000048339843,0.000046561803,0.000049054,0.000029380364,0.97991,0.00018992298,0.010169564,0.0005864742,0.008235026],"study_design_scores_gemma":[0.000004904229,0.000009818234,0.00006407887,0.0000029562596,0.0000042266092,0.0000035906291,0.0000031643826,0.99612206,0.000030752246,0.0036443507,0.00010636305,0.0000036625165],"about_ca_topic_score_codex":0.01340984,"about_ca_topic_score_gemma":0.013920576,"teacher_disagreement_score":0.01340984,"about_ca_system_score_codex":0.0013790788,"about_ca_system_score_gemma":0.0018488368,"threshold_uncertainty_score":0.026663601},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03240339166196765,"score_gpt":0.24328460482521036,"score_spread":0.2108812131632427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090345509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24034186,0.0009846329,0.7482568,0.0010988648,0.00009376598,0.0002632118,0.0014127254,0.00054367515,0.0070044813],"genre_scores_gemma":[0.84693444,0.0006987632,0.14646146,0.00011059734,0.00004464763,0.00042021318,0.0011715079,0.00014922934,0.0040090946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989986,0.00039970415,0.00005554169,0.00018615786,0.0002003407,0.00015971105],"domain_scores_gemma":[0.9970294,0.0021260334,0.00027675083,0.00012989089,0.00030807286,0.00012981507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002299595,0.0012986091,0.0015620333,0.0012101335,0.0007255154,0.0019735948,0.0018062253,0.0020106025,0.0019758756],"category_scores_gemma":[0.0040461784,0.0012884327,0.0016044276,0.0020458964,0.001367951,0.001646378,0.0010502042,0.0018180687,0.00024352361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007077437,0.000012915012,0.00015312865,0.00001023086,0.0000054897855,0.000009365919,0.00000618233,0.9979603,0.00006653194,0.0010262978,0.000046131016,0.0006963537],"study_design_scores_gemma":[0.0000022837805,0.0000035885557,0.000047599686,0.0000014799574,0.0000016655819,0.0000010458134,0.0000036360022,0.99914885,0.000054824744,0.0006648492,0.000068896006,0.0000013011447],"about_ca_topic_score_codex":0.04475573,"about_ca_topic_score_gemma":0.027646894,"teacher_disagreement_score":0.04475573,"about_ca_system_score_codex":0.0030647847,"about_ca_system_score_gemma":0.003454285,"threshold_uncertainty_score":0.08899045},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.041972657187275296,"score_gpt":0.33779397047857124,"score_spread":0.29582131329129596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151835984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018307186,0.0004294935,0.99257576,0.0002711852,0.000026102307,0.000031876436,0.000037068337,0.00005321591,0.0047446163],"genre_scores_gemma":[0.4708978,0.003155736,0.5166319,0.0005850443,0.0006630199,0.0010056751,0.00037301786,0.00044572455,0.0062421034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937034,0.0033381623,0.00029170263,0.00069389434,0.0015886732,0.00038420767],"domain_scores_gemma":[0.991021,0.00638662,0.0008396319,0.001015776,0.00056817423,0.00016894768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009671554,0.0030267325,0.0020588064,0.0022681064,0.00084018573,0.0032559806,0.002255716,0.0023469264,0.004121357],"category_scores_gemma":[0.018234108,0.0010936434,0.0027870913,0.0016145748,0.0032620681,0.00480994,0.0035230068,0.004738916,0.00051308057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033577027,0.00003483005,0.0002387299,0.0001993927,0.0001041715,0.00007556071,0.000091332775,0.42633978,0.0009499684,0.5514514,0.0013396568,0.019141618],"study_design_scores_gemma":[0.000014414043,0.000043002314,0.00008201287,0.00007383456,0.000026258549,0.000039552204,0.000023185114,0.69865656,0.00072868384,0.29671228,0.0035769327,0.000023263874],"about_ca_topic_score_codex":0.00084244803,"about_ca_topic_score_gemma":0.00063821446,"teacher_disagreement_score":0.009671554,"about_ca_system_score_codex":0.0018780804,"about_ca_system_score_gemma":0.001379402,"threshold_uncertainty_score":0.051148653},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0573044278968977,"score_gpt":0.30533611664792565,"score_spread":0.24803168875102793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3192155567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03554398,0.00038362297,0.956647,0.0002992855,0.000042507578,0.00011788297,0.00016700629,0.00033571085,0.0064629694],"genre_scores_gemma":[0.39760053,0.0005683374,0.5976174,0.00020858852,0.0000493145,0.00023196205,0.0004365235,0.00014403241,0.0031433497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994765,0.00019301417,0.000022487799,0.00008096384,0.00014429854,0.000082766775],"domain_scores_gemma":[0.9994301,0.00034152658,0.000091334994,0.00004226956,0.00005937418,0.00003539475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012388952,0.0011236769,0.00066316244,0.0012059824,0.00051249424,0.00084321626,0.0010593791,0.0007414168,0.0041522253],"category_scores_gemma":[0.0017161662,0.0005974811,0.001407187,0.0010867127,0.0006028512,0.0010177158,0.00070291327,0.0013202998,0.00036154798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000376866,0.000060847666,0.00026670733,0.00007718584,0.00003310433,0.000032156822,0.000022973034,0.96348166,0.0014853653,0.0103665795,0.00059887976,0.023536857],"study_design_scores_gemma":[0.000011322285,0.000041024028,0.0000505433,0.000008426221,0.0000074161217,0.000012591413,0.000010751268,0.99219066,0.00049730507,0.006669197,0.0004962348,0.0000044762896],"about_ca_topic_score_codex":0.004019663,"about_ca_topic_score_gemma":0.006801941,"teacher_disagreement_score":0.0041522253,"about_ca_system_score_codex":0.0011817039,"about_ca_system_score_gemma":0.0023967035,"threshold_uncertainty_score":0.013890624},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023924722562684773,"score_gpt":0.2276994575747005,"score_spread":0.20377473501201573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205482001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013969919,0.00035784344,0.98399276,0.00029589576,0.000023650393,0.00006527923,0.00016833076,0.00037020567,0.00075610814],"genre_scores_gemma":[0.6451427,0.00075535337,0.3510871,0.0001714989,0.00016433054,0.0002429789,0.0007547985,0.0002395263,0.001441765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984567,0.0005179477,0.00008551587,0.0003981795,0.0003720389,0.00016967401],"domain_scores_gemma":[0.99561006,0.0027791637,0.0006915517,0.0002724621,0.0004986769,0.00014806954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033467347,0.0015631298,0.002273029,0.001408419,0.00060199597,0.0023475674,0.0024304087,0.0015166461,0.0014760471],"category_scores_gemma":[0.0082284985,0.0015722653,0.0013515449,0.0016703726,0.0010663834,0.0022559373,0.0012250247,0.0019956469,0.0002937148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023229786,0.000024464585,0.00022128348,0.00003616707,0.000020110398,0.000020836336,0.000011523962,0.990099,0.00032311783,0.0024661734,0.00017882831,0.0065753143],"study_design_scores_gemma":[0.0000022794545,0.00000936372,0.00003879049,0.0000023227065,0.0000031153534,0.0000024403068,0.0000028248157,0.9981791,0.00013792537,0.0015504548,0.00006879829,0.0000026357238],"about_ca_topic_score_codex":0.011555965,"about_ca_topic_score_gemma":0.0078105913,"teacher_disagreement_score":0.011555965,"about_ca_system_score_codex":0.0018629701,"about_ca_system_score_gemma":0.0027491527,"threshold_uncertainty_score":0.022977412},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08734465264683301,"score_gpt":0.34677902944996775,"score_spread":0.25943437680313475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213236049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039805368,0.0010137584,0.9452987,0.0017707156,0.00005924961,0.000076491735,0.00029388798,0.00018701442,0.011494758],"genre_scores_gemma":[0.893135,0.001327472,0.09850643,0.00042599978,0.00021283247,0.00023825016,0.00042860393,0.00010354421,0.0056219343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936333,0.0029389882,0.00031543642,0.0010968898,0.0013469041,0.00066844793],"domain_scores_gemma":[0.9844976,0.0114173265,0.0017929227,0.0008139667,0.00092271686,0.0005554022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068211537,0.0015728896,0.0021552755,0.0012542432,0.0008596088,0.004472826,0.002216916,0.0026669404,0.004871276],"category_scores_gemma":[0.0239553,0.000805228,0.0018852853,0.0015413,0.0027665957,0.0052612145,0.0024162843,0.003361981,0.00041787548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007179846,0.000046205925,0.0005976826,0.000116104304,0.00006635681,0.00014115986,0.00015650087,0.58196926,0.00045566962,0.4060652,0.0012093731,0.009104589],"study_design_scores_gemma":[0.00001582535,0.00003611579,0.00012915973,0.000023967546,0.000013222361,0.000033981498,0.00003174824,0.78451574,0.00017133336,0.21427144,0.0007442538,0.000013281519],"about_ca_topic_score_codex":0.003969041,"about_ca_topic_score_gemma":0.0024293142,"teacher_disagreement_score":0.0068211537,"about_ca_system_score_codex":0.0029787421,"about_ca_system_score_gemma":0.0016580146,"threshold_uncertainty_score":0.03607416},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019399511709611655,"score_gpt":0.24546731220356632,"score_spread":0.22606780049395467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4304609420","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010603294,0.00038803215,0.9855273,0.00020039246,0.000054940378,0.00014239161,0.000118022355,0.00054593914,0.0024196892],"genre_scores_gemma":[0.2398162,0.00043191202,0.75476766,0.00028768482,0.00011755648,0.0005187194,0.00073111785,0.00027700633,0.0030520544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894494,0.0005711227,0.000039592145,0.00013537548,0.00019630106,0.00011274515],"domain_scores_gemma":[0.99479395,0.004059643,0.00027753564,0.00022936348,0.0005138292,0.00012575228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018144543,0.0011752795,0.0014442613,0.0015175424,0.0007313347,0.0010052325,0.0014601308,0.0010492491,0.00602558],"category_scores_gemma":[0.004892913,0.0006886294,0.0009344883,0.0021688703,0.0007678208,0.0012477053,0.00085532304,0.0018741764,0.0010195874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084852174,0.00015855089,0.0006159787,0.00015891965,0.000046739806,0.000068849535,0.000049005557,0.87863445,0.0012347957,0.009001076,0.004089175,0.10585764],"study_design_scores_gemma":[0.000012039933,0.000019865454,0.000051786046,0.000007034078,0.00000414602,0.00000986179,0.000005532939,0.9954977,0.0003032856,0.003663878,0.0004211967,0.000003723237],"about_ca_topic_score_codex":0.006328958,"about_ca_topic_score_gemma":0.0088302735,"teacher_disagreement_score":0.006328958,"about_ca_system_score_codex":0.0010976708,"about_ca_system_score_gemma":0.0020904755,"threshold_uncertainty_score":0.020157576},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006435144094496844,"score_gpt":0.2116394172331803,"score_spread":0.20520427313868347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380051626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05482637,0.00037934727,0.9407144,0.00045842357,0.00008613186,0.000048473164,0.000046181394,0.00037274422,0.003067861],"genre_scores_gemma":[0.93467677,0.0001318934,0.06210246,0.00017288254,0.000039155064,0.00008191126,0.000059731734,0.000036837646,0.002698374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996464,0.000109740664,0.000015239433,0.00008520187,0.000068964895,0.00007437714],"domain_scores_gemma":[0.9988747,0.0006890919,0.0001482119,0.000061130704,0.00015393547,0.00007283917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008885315,0.0008824953,0.00092755334,0.00033950646,0.00030816556,0.00057598006,0.0011107557,0.001011472,0.0015933743],"category_scores_gemma":[0.0026090492,0.00045554337,0.00045072034,0.00032156406,0.00096407766,0.000864091,0.00080982764,0.0013068819,0.00017698461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003542413,0.000031924545,0.00041748869,0.000021143398,0.000017399816,0.00002340861,0.000014758091,0.9796696,0.00046821035,0.0036386116,0.00033733464,0.015324718],"study_design_scores_gemma":[0.0000036129945,0.0000063849666,0.00002207357,0.0000011966716,0.0000016101088,0.0000024508465,0.0000011985962,0.99838567,0.00007699306,0.0014369863,0.000060799797,0.000001109198],"about_ca_topic_score_codex":0.0064084553,"about_ca_topic_score_gemma":0.0056189788,"teacher_disagreement_score":0.0064084553,"about_ca_system_score_codex":0.0011671787,"about_ca_system_score_gemma":0.0012753876,"threshold_uncertainty_score":0.012742281},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04304430783753299,"score_gpt":0.26220797550399727,"score_spread":0.21916366766646428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399170779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03659993,0.0006201429,0.953593,0.0008580727,0.000060067367,0.00025620006,0.00007802841,0.00023914133,0.0076954127],"genre_scores_gemma":[0.7578533,0.0007200034,0.23217943,0.00056104624,0.00013716707,0.0008673154,0.00021370676,0.00015331774,0.007314733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962321,0.0025614514,0.00011730378,0.0003817039,0.00044294944,0.0002644248],"domain_scores_gemma":[0.9628422,0.033967968,0.0010322981,0.0006393172,0.0007187279,0.00079941173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0109468335,0.001658081,0.002443346,0.002382252,0.0012797444,0.0027302643,0.003271208,0.0027199492,0.004480483],"category_scores_gemma":[0.04004582,0.0015493148,0.0011440461,0.0015088639,0.00487359,0.004109174,0.0032638763,0.0031981573,0.0005297407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017209235,0.00013220283,0.0007955405,0.00012657941,0.00006577075,0.00004694873,0.00010471098,0.8518321,0.00025192724,0.13670418,0.00067887316,0.009089132],"study_design_scores_gemma":[0.000021802587,0.000016849825,0.00003744498,0.000011287349,0.0000055031605,0.0000055548608,0.0000072315197,0.9607873,0.00006705789,0.038907763,0.00012592446,0.0000063270595],"about_ca_topic_score_codex":0.009033579,"about_ca_topic_score_gemma":0.009253663,"teacher_disagreement_score":0.0109468335,"about_ca_system_score_codex":0.0032803142,"about_ca_system_score_gemma":0.0036607857,"threshold_uncertainty_score":0.057893097},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Regular polygon; Artificial neural network; Mathematical optimization; Computer science; Mathematics; Artificial intelligence; Geometry","score_opus":0.009001984855003472,"score_gpt":0.24249124139660466,"score_spread":0.2334892565416012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413682498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01488746,0.00019743152,0.9828288,0.00025763485,0.00003410997,0.000031147145,0.00009112479,0.0004891779,0.0011830977],"genre_scores_gemma":[0.80706966,0.0003600264,0.18371916,0.000584017,0.00007753498,0.00022704633,0.00069915986,0.00030334122,0.0069599957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926156,0.00022392864,0.00004084123,0.00019863476,0.00017154313,0.00010351981],"domain_scores_gemma":[0.9983967,0.0007746927,0.00020167895,0.00017390122,0.00037790395,0.0000750661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017132725,0.001650256,0.0012444525,0.0004553758,0.00037142175,0.0010761572,0.0022813897,0.0015191631,0.0018051285],"category_scores_gemma":[0.0067579467,0.0007984058,0.00078404223,0.00045323497,0.0013784689,0.0017233833,0.0020377424,0.0024403227,0.00052362593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046395642,0.000014873595,0.0004778352,0.00003461458,0.000028526556,0.00005434618,0.000028986591,0.96681535,0.0011841842,0.006543228,0.0007462203,0.024025429],"study_design_scores_gemma":[0.0000014065713,0.000007782346,0.000021595048,0.0000022805052,0.0000015777448,0.0000036768881,0.0000016232236,0.997931,0.00019880284,0.0017563449,0.0000719631,0.0000020599073],"about_ca_topic_score_codex":0.0075712265,"about_ca_topic_score_gemma":0.008095675,"teacher_disagreement_score":0.0075712265,"about_ca_system_score_codex":0.0011429786,"about_ca_system_score_gemma":0.0015928592,"threshold_uncertainty_score":0.0150542855},"labels":[],"label_agreement":null}]}