{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026126197,0.000014162336,0.9943375,0.0008951443,0.00029430175,0.00028029282,0.000010096687,0.00024885108,0.0036583645],"genre_scores_gemma":[0.014569799,0.000018407185,0.98378396,0.000922017,0.00006824269,0.000040922867,0.000029821917,0.000024960016,0.0005418668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977881,0.00010558956,0.0005658838,0.0002913955,0.0009079797,0.00034105076],"domain_scores_gemma":[0.99830735,0.00019014537,0.00039840478,0.00042159145,0.00052926276,0.00015326872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014785656,0.0001835239,0.00018333709,0.000672436,0.0007438437,0.00042574535,0.0008455968,0.00004976045,0.0002389446],"category_scores_gemma":[0.000175012,0.0001465406,0.00005727664,0.0014725169,0.000025160325,0.0010692024,0.00024774132,0.00065107737,0.000006542438],"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.00014820747,0.000050331713,0.000010831785,0.000003166425,0.000019104435,0.000015548794,0.0009021129,0.98198336,0.000007081179,0.01086562,0.0003429713,0.005651662],"study_design_scores_gemma":[0.0011386514,0.0011597747,0.000015439515,0.000023529072,0.0000056069207,0.0005809899,0.00012854235,0.9935711,0.00049368915,0.00063265854,0.002027291,0.00022275373],"about_ca_topic_score_codex":0.000004303354,"about_ca_topic_score_gemma":8.5248405e-7,"teacher_disagreement_score":0.014308537,"about_ca_system_score_codex":0.00025085753,"about_ca_system_score_gemma":0.0002716569,"threshold_uncertainty_score":0.5975752},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015754597,0.00003960948,0.9474621,0.0061247936,0.0013386097,0.00019265588,0.0000058161468,0.00013540662,0.02894645],"genre_scores_gemma":[0.97989345,0.00023987168,0.0042528003,0.010430817,0.00085916073,0.000023415041,0.00080445694,0.000023015467,0.0034730143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987874,0.000010635242,0.00045258546,0.00016918965,0.00037858792,0.00020160453],"domain_scores_gemma":[0.9987608,0.000009950448,0.00013926992,0.0002321624,0.0008316641,0.000026110507],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036813214,0.00014082075,0.00011700239,0.00023753122,0.0004081246,0.0005466776,0.00013446133,0.00006165753,0.0026936703],"category_scores_gemma":[0.00023719636,0.00012516623,0.000081188875,0.0007821106,0.000027065118,0.0022186278,0.00005983503,0.00018255116,0.0007153935],"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.00001661082,0.00009774087,0.00034404994,0.00003767104,0.000020145695,0.0000025953925,0.000025947289,0.9766283,0.0000055124615,0.015889326,0.0026262521,0.0043058395],"study_design_scores_gemma":[0.00092155975,0.00002056001,0.011904913,0.00006520774,0.00006042886,0.000016807888,0.0010857973,0.8855857,0.00002646103,0.0016770228,0.09823481,0.00040068835],"about_ca_topic_score_codex":0.000036046677,"about_ca_topic_score_gemma":0.000056455563,"teacher_disagreement_score":0.96413887,"about_ca_system_score_codex":0.000117310876,"about_ca_system_score_gemma":0.00006230647,"threshold_uncertainty_score":0.998218},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24973264,0.00022847787,0.74028003,0.00025408337,0.0020423662,0.00044565456,0.000008816185,0.00037768902,0.0066302284],"genre_scores_gemma":[0.96428835,0.0003319347,0.034582846,0.00035139278,0.00014815546,0.0000050192466,0.0000615635,0.000066097586,0.0001646206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990906,0.000011826529,0.0003611352,0.00010962084,0.00023192426,0.00019485278],"domain_scores_gemma":[0.9994703,0.000048154303,0.00011676241,0.00011985185,0.00012967894,0.00011528765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023975382,0.00016795378,0.00014599782,0.00025497362,0.00014922784,0.00022527682,0.000060008835,0.000117158845,0.00047315753],"category_scores_gemma":[0.00003184174,0.00014414024,0.000040939853,0.0002265113,0.000016477514,0.00060960517,0.000018191622,0.00025909496,0.00008041969],"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.000014573731,0.000009487069,0.0010072466,0.000023190672,0.000021853788,0.000024799543,0.00009477265,0.99091405,0.000024582978,0.0003783292,0.0004688151,0.0070182923],"study_design_scores_gemma":[0.00074668316,0.00008726414,0.0001777266,0.00010078202,0.000009497384,0.0011869707,0.000028279706,0.9957025,0.0001269251,0.0001292677,0.001495504,0.00020860297],"about_ca_topic_score_codex":0.0000019619254,"about_ca_topic_score_gemma":0.000004853689,"teacher_disagreement_score":0.71455574,"about_ca_system_score_codex":0.000062667474,"about_ca_system_score_gemma":0.000020849224,"threshold_uncertainty_score":0.58778685},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009761167,0.000012150569,0.99450994,0.004131637,0.00011519062,0.00029333058,0.000024951645,0.0002950867,0.0006079646],"genre_scores_gemma":[0.012121708,0.000029027702,0.9836038,0.0036510685,0.00033501146,0.000020208934,0.00019316874,0.000015403197,0.000030599418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883854,0.000014610585,0.0003778582,0.00023338923,0.00035336678,0.00018222748],"domain_scores_gemma":[0.9985468,0.000096236785,0.0005041375,0.0003449866,0.000391814,0.00011603979],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004652444,0.00011498732,0.00012467049,0.00010313263,0.00022707392,0.0015073055,0.0011464494,0.000072818984,0.0000039383985],"category_scores_gemma":[0.00016631701,0.00009952594,0.00004336282,0.00036526215,0.000010103657,0.0053290613,0.00029759525,0.000171796,0.000019073994],"study_design_candidate":"simulation_or_modeling","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.000031519998,0.000074008516,0.00006614988,0.00004250948,0.00003750731,0.0000026666062,0.00032926173,0.4289823,0.00007202595,0.002320087,0.03358624,0.5344557],"study_design_scores_gemma":[0.00023702589,0.00022290419,0.000012110473,0.000030695246,0.000005960733,0.000015847429,0.000002997131,0.96669495,0.00026743035,0.0016869555,0.030697454,0.00012566934],"about_ca_topic_score_codex":2.6059888e-7,"about_ca_topic_score_gemma":1.2345646e-7,"teacher_disagreement_score":0.53771263,"about_ca_system_score_codex":0.00012716898,"about_ca_system_score_gemma":0.0000706577,"threshold_uncertainty_score":0.99952924},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025841791,0.000103328784,0.9722229,0.00027479336,0.0004735762,0.00092032185,0.000009366119,0.000035257268,0.00011866196],"genre_scores_gemma":[0.08898901,0.000797253,0.90914744,0.00016332851,0.000349979,0.00009469246,0.00028387067,0.00005783478,0.000116606214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941994,0.0004337167,0.0015485891,0.0007116989,0.0026554007,0.0004511987],"domain_scores_gemma":[0.9932352,0.0012136854,0.0013879003,0.0005210257,0.0033854994,0.00025672684],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009475323,0.00034149637,0.0005427508,0.0013964697,0.0004997842,0.0018303095,0.00057427416,0.00065255206,0.00015160855],"category_scores_gemma":[0.020633554,0.00029258122,0.000148574,0.00082577846,0.00006494008,0.0024876914,0.0003076597,0.002108054,0.0000036059514],"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.00014233627,0.000053525026,0.00022582004,0.000021233327,0.000015082302,0.000004552955,0.0014803183,0.957311,0.0000045693896,0.00005698502,0.000019018684,0.040665608],"study_design_scores_gemma":[0.0009978213,0.00021460747,0.00003596213,0.00033290376,0.000022617749,0.000018261582,0.0016476028,0.978701,0.000056011,0.017641379,0.000022129801,0.00030973088],"about_ca_topic_score_codex":0.0000061084847,"about_ca_topic_score_gemma":0.0000143405,"teacher_disagreement_score":0.063147224,"about_ca_system_score_codex":0.0005380347,"about_ca_system_score_gemma":0.00094457564,"threshold_uncertainty_score":0.9999526},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56311667,0.0008050198,0.32688552,0.00945544,0.010904996,0.0014728642,0.000037886057,0.000720969,0.086600624],"genre_scores_gemma":[0.92547524,0.004965925,0.03432464,0.017549844,0.006326235,0.00012598888,0.0027113913,0.00018658052,0.008334175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981542,0.00001387891,0.00073677715,0.0002844037,0.00053314026,0.00027755488],"domain_scores_gemma":[0.9987843,0.000013227883,0.00037359036,0.00027970303,0.00051433826,0.000034813074],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006354432,0.0003206366,0.0003153565,0.00058390165,0.00031023283,0.002140422,0.0002053094,0.00019231194,0.0012969115],"category_scores_gemma":[0.00019526616,0.00028647174,0.00012852719,0.0002669772,0.00004859891,0.0018726783,0.00059289334,0.00058521255,0.00004828523],"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.000047086225,0.000056362886,0.00017109333,0.0003344093,0.00005734988,0.0000103250895,0.0002179964,0.98631185,0.0000011771616,0.005483854,0.0023852747,0.0049232286],"study_design_scores_gemma":[0.0011250332,0.00005273082,0.0018322393,0.00058614777,0.00014889677,0.000016946608,0.0029064969,0.9089775,0.000019899206,0.0010136998,0.08238914,0.0009312761],"about_ca_topic_score_codex":0.0001915791,"about_ca_topic_score_gemma":0.000024166487,"teacher_disagreement_score":0.36235854,"about_ca_system_score_codex":0.00009284075,"about_ca_system_score_gemma":0.00009178459,"threshold_uncertainty_score":0.99995875},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077078966,0.000015993619,0.97542137,0.013552999,0.0004042235,0.0010869862,0.000004385675,0.000041358933,0.0017647629],"genre_scores_gemma":[0.97753906,0.00005922848,0.011967625,0.009569347,0.0006278428,0.00006130792,0.00006222183,0.000021106986,0.00009225616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989846,0.000004269385,0.00043878704,0.00011750094,0.00029444005,0.00016041928],"domain_scores_gemma":[0.9994046,0.00001251633,0.00019108556,0.00010453077,0.00026040705,0.00002684673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046918812,0.00010907384,0.00011086425,0.000104596,0.00027271907,0.00016963806,0.0002160749,0.000030417872,0.00015668718],"category_scores_gemma":[0.00018522551,0.000075641154,0.000086027925,0.00031556733,0.000016680562,0.0009865591,0.000097577,0.00008337018,0.000028298344],"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.00019376792,0.00003389429,0.00014478945,0.00013792254,0.00002165713,9.413459e-8,0.00017270383,0.9874428,0.00015814972,0.0006342545,0.0028210261,0.00823895],"study_design_scores_gemma":[0.0005493644,0.00009713582,0.00037162076,0.000044087916,0.000030035071,4.9638163e-7,0.0002922225,0.96671575,0.000083984094,0.00003298528,0.03167804,0.00010429819],"about_ca_topic_score_codex":0.000048738526,"about_ca_topic_score_gemma":0.000020035744,"teacher_disagreement_score":0.96983117,"about_ca_system_score_codex":0.000052419127,"about_ca_system_score_gemma":0.000014499348,"threshold_uncertainty_score":0.30845568},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07259402,0.0000067485157,0.9242997,0.002041172,0.000038002298,0.00055792346,0.000002733302,0.000054654665,0.0004050275],"genre_scores_gemma":[0.9819881,0.000009874382,0.01639474,0.0013012463,0.00019213668,0.000047954054,0.000028435392,0.00001941377,0.00001810689],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998673,0.00006086626,0.0005245266,0.00019367957,0.00032939017,0.0002185395],"domain_scores_gemma":[0.99871415,0.00020767104,0.00033915916,0.00016378482,0.00039194128,0.0001832675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008685953,0.00015540783,0.00022513932,0.00019754872,0.00011341336,0.00014564306,0.00015175952,0.00009492305,0.000032579926],"category_scores_gemma":[0.0010695561,0.000118785654,0.000027147791,0.0011107675,0.000019524468,0.00087698083,0.000022209206,0.0002859308,0.0000056128956],"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.0003339067,0.000107703265,0.0007369123,0.000062776715,0.000007891587,9.621781e-7,0.0014808658,0.98131347,0.0000036541805,0.002988909,0.00007262043,0.012890334],"study_design_scores_gemma":[0.00086951756,0.0014014887,0.0010603244,0.000091466245,0.000009730522,0.000016811875,0.00030157182,0.9903563,0.00009185155,0.0053421655,0.00023400504,0.0002247572],"about_ca_topic_score_codex":0.00004890302,"about_ca_topic_score_gemma":0.00012421863,"teacher_disagreement_score":0.9093941,"about_ca_system_score_codex":0.00014497219,"about_ca_system_score_gemma":0.00009297052,"threshold_uncertainty_score":0.48439386},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019688169,0.000016347596,0.9924224,0.0031958893,0.00030544912,0.00053992163,0.000035674137,0.00011713221,0.0013983734],"genre_scores_gemma":[0.66587925,0.00027470142,0.2896505,0.032226212,0.006358405,0.00014137945,0.004785074,0.00024427692,0.00044020728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984521,0.000008927427,0.000578105,0.0002609556,0.0003776114,0.00032225417],"domain_scores_gemma":[0.9987449,0.00005122237,0.0005243117,0.00025839024,0.0003650186,0.000056139776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048489915,0.00021073781,0.00023642794,0.0001810153,0.00040684387,0.00074194826,0.00042626233,0.000090382615,0.00029311038],"category_scores_gemma":[0.0003232024,0.00018264234,0.00009834271,0.00033891696,0.000011634678,0.0035059962,0.0001722646,0.00020969413,0.000023686642],"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.00024222408,0.00006286213,0.0015586345,0.000040173483,0.000037384492,0.0000017099783,0.00012708695,0.9917213,0.000006499926,0.00013519338,0.0035122486,0.0025547065],"study_design_scores_gemma":[0.0020083205,0.000032400367,0.00018129095,0.000038351314,0.00016719414,0.0000022266115,0.000051975414,0.9823488,0.0000034700997,0.000025887712,0.014902543,0.00023754376],"about_ca_topic_score_codex":0.00000714293,"about_ca_topic_score_gemma":0.000016675558,"teacher_disagreement_score":0.7027719,"about_ca_system_score_codex":0.00004684772,"about_ca_system_score_gemma":0.00007060088,"threshold_uncertainty_score":0.7447939},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023776076,0.000037541846,0.9965531,0.00022038948,0.00010634224,0.00018457882,0.000013218613,0.00005840641,0.00044878531],"genre_scores_gemma":[0.6317391,0.000587507,0.3673697,0.00013446012,0.00005577732,0.0000024430847,0.000080472426,0.000027566804,0.0000029474836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991176,0.000018596806,0.00044419858,0.000114079805,0.00017719796,0.00012828548],"domain_scores_gemma":[0.99948204,0.000027155771,0.00015862692,0.00015417284,0.00012344382,0.000054589687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013080974,0.00012198271,0.00014227326,0.00010531475,0.00009123833,0.00007285915,0.00017599264,0.00007298922,0.000012993804],"category_scores_gemma":[0.00018471145,0.00009424778,0.000016026195,0.00030274043,0.00002562914,0.0007681593,0.000058880567,0.0002463874,5.445592e-7],"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.000019261639,0.000007067302,0.000054573695,0.000036678644,0.000009078587,5.480682e-7,0.00031255634,0.9983971,0.000008625145,0.00009164392,0.00001854411,0.0010443354],"study_design_scores_gemma":[0.000446069,0.00003035683,0.000009920317,0.00008659716,0.000012077826,0.000008346802,0.0000765315,0.9990061,0.00009368551,0.000078115074,0.000045033554,0.00010718619],"about_ca_topic_score_codex":0.0000019947693,"about_ca_topic_score_gemma":0.000001694056,"teacher_disagreement_score":0.6293615,"about_ca_system_score_codex":0.000054297754,"about_ca_system_score_gemma":0.00003529272,"threshold_uncertainty_score":0.3843313},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008815448,0.00005736868,0.98684245,0.00025938096,0.0008081765,0.00076782925,0.00011209571,0.000019807252,0.0023174405],"genre_scores_gemma":[0.8054335,0.000800907,0.19183742,0.00037811146,0.00023168472,0.00015908894,0.0003032032,0.000057229696,0.000798823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962317,0.00021664244,0.0015284171,0.00023826273,0.0015578821,0.00022713699],"domain_scores_gemma":[0.99438244,0.001065663,0.0023198267,0.00032807357,0.0018030447,0.000100926976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032736156,0.00018292756,0.00044932493,0.0009764624,0.0004683758,0.00012540177,0.00054884685,0.0000902391,0.0007832507],"category_scores_gemma":[0.0023449606,0.00013939067,0.0002597881,0.0014530877,0.00007981173,0.0009028415,0.00009219693,0.00024241021,0.000002046531],"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.0006829706,0.00012378275,0.00072523305,0.0000066145117,0.000036105466,8.401835e-7,0.0004317082,0.98189723,0.000013304835,0.0011179263,0.0021667508,0.012797503],"study_design_scores_gemma":[0.0013675889,0.0013182703,0.000219823,0.000019688105,0.000033373337,0.00003097432,0.000816952,0.9901886,0.00036416488,0.0013415915,0.004140422,0.00015852478],"about_ca_topic_score_codex":0.000009365141,"about_ca_topic_score_gemma":0.0000014772959,"teacher_disagreement_score":0.7966181,"about_ca_system_score_codex":0.00016879114,"about_ca_system_score_gemma":0.0002465024,"threshold_uncertainty_score":0.8576046},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015772107,0.0002305387,0.9937311,0.00069010153,0.0007014117,0.00017306027,0.000015519892,0.0003033631,0.0025776965],"genre_scores_gemma":[0.1017974,0.00015866908,0.8968913,0.00046939854,0.00030276203,0.000028945364,0.00021643497,0.00006133678,0.000073781615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985123,0.00003201926,0.0005072357,0.00018855336,0.0003686482,0.000391186],"domain_scores_gemma":[0.9987675,0.00021784072,0.00006547067,0.00017988421,0.0005617764,0.00020751722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004322036,0.00021817579,0.00021899883,0.00028736558,0.00037097235,0.0004964799,0.00014433682,0.00019022147,0.00017078273],"category_scores_gemma":[0.00036831625,0.00020788866,0.00015358215,0.00041463037,0.000040052288,0.0006467593,0.000014911832,0.00039642412,0.000014047857],"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.00004542724,0.000049874758,0.00003267269,0.00007200646,0.000035694582,0.000007297658,0.000096218515,0.9919684,0.000045441968,0.003023839,0.00007649815,0.004546657],"study_design_scores_gemma":[0.0009801158,0.00011337428,0.000015974005,0.000120194425,0.000027922239,0.000056550907,0.00041568122,0.9927034,0.004825908,0.00038513576,0.00009160549,0.00026417943],"about_ca_topic_score_codex":3.5311376e-7,"about_ca_topic_score_gemma":2.8209018e-7,"teacher_disagreement_score":0.100220196,"about_ca_system_score_codex":0.0001980469,"about_ca_system_score_gemma":0.0001529091,"threshold_uncertainty_score":0.84774536},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011117005,0.000038585255,0.99091184,0.000029764462,0.0003568517,0.0002021374,0.000023340835,0.00019254284,0.0071332618],"genre_scores_gemma":[0.21600233,0.00054181024,0.7821642,0.00013764361,0.00010623066,0.00004081119,0.00070356793,0.00008005357,0.00022333633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873877,0.000026603306,0.00041468875,0.00018634276,0.0003488016,0.00028480982],"domain_scores_gemma":[0.99942416,0.000025414029,0.00011558752,0.00032685424,0.00003739466,0.00007056851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031348612,0.00018082173,0.00016139497,0.00043332583,0.00029572708,0.00012988898,0.00044862842,0.000046955476,0.00012221765],"category_scores_gemma":[0.00003250328,0.00017790271,0.000027831744,0.0004269221,0.000014413,0.0008340943,0.00019934222,0.00061913347,0.0000047932463],"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.000038598366,0.000052235864,0.000019107138,0.000025814636,0.00003035689,0.00002590035,0.00029856173,0.996017,2.4534503e-7,0.00028591004,0.00040716052,0.002799105],"study_design_scores_gemma":[0.0007707127,0.000049856226,0.000031068186,0.00001713138,0.000013142242,0.00006823642,0.00040561915,0.996105,0.0000033359838,0.000048565664,0.0022690613,0.00021826437],"about_ca_topic_score_codex":0.0000023647435,"about_ca_topic_score_gemma":7.5684056e-7,"teacher_disagreement_score":0.21489063,"about_ca_system_score_codex":0.00030425857,"about_ca_system_score_gemma":0.000019767183,"threshold_uncertainty_score":0.7254662},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017565118,0.000057423335,0.9573426,0.0011115745,0.0011941429,0.00018549841,0.000014471148,0.000053415573,0.022475708],"genre_scores_gemma":[0.97789884,0.0005480379,0.01532019,0.0027705634,0.00020359833,0.000017175986,0.000047931004,0.000029171282,0.0031645144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99601805,0.00018191693,0.001014249,0.00023559495,0.0022699006,0.00028028642],"domain_scores_gemma":[0.9978718,0.00035966004,0.00079471606,0.0003480848,0.0004652907,0.00016042095],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0030151831,0.00016158177,0.00022529555,0.00075284264,0.0012642959,0.00061294384,0.00057623535,0.0000577164,0.0024222748],"category_scores_gemma":[0.00046590672,0.00011805812,0.00014114176,0.0012348416,0.000032968423,0.0015845168,0.00012704103,0.00047801994,0.000054532135],"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.000087079745,0.00003069845,0.00019082692,2.498944e-7,0.000010432874,0.0000060570915,0.0004764438,0.96006745,0.0000015936071,0.0067801718,0.0048570554,0.027491927],"study_design_scores_gemma":[0.0005094509,0.00020298922,0.00009509105,0.0000048755596,0.0000076160363,0.00014451383,0.0013293392,0.9545402,0.0000057898374,0.030367747,0.012629713,0.00016266826],"about_ca_topic_score_codex":0.000015183748,"about_ca_topic_score_gemma":0.0000029661323,"teacher_disagreement_score":0.9603337,"about_ca_system_score_codex":0.00027642108,"about_ca_system_score_gemma":0.00023745059,"threshold_uncertainty_score":0.9984896},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007938353,0.000031388307,0.99003434,0.00010312283,0.00044910476,0.0006099052,0.000021016147,0.00023082354,0.0005819339],"genre_scores_gemma":[0.79424393,0.000060919952,0.20439306,0.00023530253,0.00017901589,0.00023089375,0.00044825676,0.00008211481,0.00012649443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984787,0.00012317812,0.00062491954,0.0001498153,0.00033749783,0.00028589455],"domain_scores_gemma":[0.9993309,0.00010413491,0.00022218007,0.00008481845,0.0001745921,0.00008340654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012301307,0.00018304808,0.00019413061,0.000485885,0.00047055318,0.0001664484,0.000122063284,0.0000842712,0.00025514254],"category_scores_gemma":[0.00023413007,0.00019801538,0.000074612566,0.00064719963,0.000015665402,0.000368104,0.000014712052,0.0006227643,0.000001569194],"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.00003402514,0.00004531183,0.0022551948,0.000015862708,0.000015001206,0.0000011299724,0.00018325653,0.99352866,0.0003396853,0.00009254812,0.00015969382,0.0033296254],"study_design_scores_gemma":[0.0015322802,0.00042412055,0.0000779244,0.000022230746,0.000011688047,0.000051789197,0.00004970543,0.99540323,0.00026905842,0.000030879433,0.0018999686,0.00022713795],"about_ca_topic_score_codex":0.000005482453,"about_ca_topic_score_gemma":0.000009277071,"teacher_disagreement_score":0.7863056,"about_ca_system_score_codex":0.0005663604,"about_ca_system_score_gemma":0.00012112177,"threshold_uncertainty_score":0.80748326},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040626038,0.000023705961,0.9553862,0.00011260555,0.000109321074,0.0001261833,2.5928182e-7,0.00087687967,0.0027387573],"genre_scores_gemma":[0.9458436,0.0014870632,0.052373566,0.000029296258,0.000021980259,0.000008099318,0.00001181004,0.000031139673,0.00019347513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992205,0.000004240929,0.0002340365,0.0000734217,0.00020828201,0.00025950008],"domain_scores_gemma":[0.9997121,0.000046694015,0.00007090707,0.00007457124,0.00003582597,0.000059869126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014967707,0.00012787821,0.00011057364,0.0001709848,0.00016054824,0.00008836659,0.00006727018,0.000064991706,0.000014554605],"category_scores_gemma":[0.00006278603,0.000094066396,0.000016552827,0.00030024195,0.000027404885,0.00036543992,0.000031064592,0.00039397867,0.000013809942],"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.0000124873395,0.0000015674458,0.00007069862,0.000007861007,0.000019806814,0.000009240388,0.00007944141,0.9607463,0.000010941445,0.00038787408,0.000022712191,0.038631063],"study_design_scores_gemma":[0.00033253364,0.00021591534,0.00013597889,0.00009361381,0.000006109479,0.000035319856,0.00028388793,0.9982571,0.000044595727,0.00008767323,0.0003707071,0.00013655046],"about_ca_topic_score_codex":1.2700052e-7,"about_ca_topic_score_gemma":2.450592e-7,"teacher_disagreement_score":0.9052175,"about_ca_system_score_codex":0.00015327445,"about_ca_system_score_gemma":0.000008027156,"threshold_uncertainty_score":0.38359162},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68713444,0.0014608302,0.2929286,0.0016488156,0.0041039055,0.00048849615,0.00023755539,0.00008424328,0.011913105],"genre_scores_gemma":[0.99571764,0.00047037305,0.0020115976,0.00021776836,0.0003033283,0.000020141788,0.00001586161,0.000031369786,0.0012119191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986813,0.000004629184,0.0008347825,0.00019402959,0.00002613729,0.00025910404],"domain_scores_gemma":[0.9994749,0.00008813834,0.00021516041,0.00011628123,0.000028137241,0.000077404424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005820367,0.00013479826,0.0002592023,0.0004548419,0.000082785205,0.00059502694,0.00015890409,0.00012010895,0.00026528767],"category_scores_gemma":[0.00015345,0.00013309826,0.00014361927,0.0001323436,0.000024117624,0.0010944987,0.000033213728,0.00025853983,0.000072169074],"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.0000617324,0.00001990308,0.0005056268,0.000033068573,0.000043224936,0.000009754123,0.0007019255,0.61092216,0.0000017174386,0.38520232,0.0013015922,0.0011970057],"study_design_scores_gemma":[0.0007710596,0.00018508409,0.00015101524,0.00018972227,0.0000063543566,0.000054981025,0.00015319095,0.9329583,0.000015706459,0.046276543,0.019002296,0.00023575174],"about_ca_topic_score_codex":0.000009141334,"about_ca_topic_score_gemma":0.000017072565,"teacher_disagreement_score":0.33892578,"about_ca_system_score_codex":0.00027577847,"about_ca_system_score_gemma":0.000034521843,"threshold_uncertainty_score":0.57378584},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007059722,0.000043773653,0.991379,0.0025513503,0.0015169985,0.00011669112,0.0000010449639,0.00012765963,0.003557459],"genre_scores_gemma":[0.8253664,0.0000797851,0.17031287,0.0028568706,0.0003977229,0.000009455627,0.00006466605,0.000019418456,0.0008928247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850816,0.000069187496,0.0004893085,0.0002095528,0.00039786205,0.00032592242],"domain_scores_gemma":[0.9988369,0.00014366914,0.00032180923,0.0002858215,0.00029858056,0.00011322546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005348478,0.00018769529,0.00019574001,0.00025391692,0.000494088,0.0006501007,0.00085806096,0.00013200942,0.00006284888],"category_scores_gemma":[0.00031699077,0.00015715834,0.000109392495,0.0007154712,0.000041273568,0.0016778331,0.0001957823,0.0007103691,0.000008648793],"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.00003209303,0.000021206166,0.0010285996,0.000003673343,0.000026043075,0.000014412314,0.00003534856,0.9457006,7.352076e-7,0.0441091,0.0004712586,0.008556923],"study_design_scores_gemma":[0.0006429185,0.00007857077,0.0009469639,0.00005583293,0.000009378297,0.00004578788,0.000021179512,0.996707,0.0000058704204,0.00049870514,0.00082764437,0.000160112],"about_ca_topic_score_codex":0.0000028120958,"about_ca_topic_score_gemma":0.0000010088276,"teacher_disagreement_score":0.8246604,"about_ca_system_score_codex":0.0002458664,"about_ca_system_score_gemma":0.00014839639,"threshold_uncertainty_score":0.6408731},"labels":[],"label_agreement":null}]}