{"meta":{"query_hash":"35770617e078","filters":{"venue":"Operations Research Forum"},"cohort_total":25,"direct_labels_cover":1,"predictions_cover":25,"exported":25,"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/35770617e078","api":"https://metacan.xera.ac/api/v1/cohort?venue=Operations+Research+Forum"},"results":[{"id":"W2939963135","doi":"10.1007/s43069-020-00042-z","title":"The Inventory Routing Problem with Demand Moves","year":2021,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Time horizon; Routing (electronic design automation); Operations research; Inventory theory; Computer science; Holding cost; Demand forecasting; Perpetual inventory; Total cost; Inventory cost; Inventory control; Operations management; Business; Economics; Mathematical optimization; Supply chain; Microeconomics; Marketing; Engineering; Computer network; Mathematics","score_opus":0.03831725747215989,"score_gpt":0.3362077405177609,"score_spread":0.29789048304560106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2939963135","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.18180001,0.00416008,0.6720392,0.016754046,0.00043261208,0.0018039203,0.000020479463,0.001005404,0.12198424],"genre_scores_gemma":[0.83803934,0.0003586539,0.1502713,0.0000666273,0.000114811635,0.00023076995,0.000027604285,0.00007560452,0.010815325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857694,0.0002657185,0.00017308159,0.00015948352,0.00036782312,0.00045694914],"domain_scores_gemma":[0.9990028,0.00017513662,0.0000058574606,0.00032557495,0.00040886388,0.00008174214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013745555,0.00008190799,0.000077503195,0.00006409564,0.0011735489,0.00045963892,0.00017135011,0.00004498959,0.000046042307],"category_scores_gemma":[0.00030722958,0.00005875727,0.000018619874,0.00065197295,0.00009806131,0.00020412078,0.00009261867,0.0003595821,0.00003209811],"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.000003073435,0.000014187555,0.0013047771,0.000015251429,0.00003757975,0.000007608093,0.0003852588,0.9719508,0.0036277934,0.016079046,0.0023185485,0.004256062],"study_design_scores_gemma":[0.00020623312,0.000032944325,0.0002298006,0.000043373246,0.0000035727835,0.000015222898,0.0015107837,0.9723505,0.011045355,0.00023797617,0.014207599,0.000116660136],"about_ca_topic_score_codex":0.000018065677,"about_ca_topic_score_gemma":0.00065295346,"teacher_disagreement_score":0.6562393,"about_ca_system_score_codex":0.00009099044,"about_ca_system_score_gemma":0.00017842486,"threshold_uncertainty_score":0.9026107},"labels":[],"label_agreement":null},{"id":"W3079159037","doi":"10.1007/s43069-020-00016-1","title":"Dynamic Constraint Aggregation for Solving Very Large-scale Airline Crew Pairing Problems","year":2020,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"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","funders":"","keywords":"Crew; Constraint (computer-aided design); Computer science; Set (abstract data type); Degeneracy (biology); Exploit; Mathematical optimization; Scale (ratio); Column generation; Pairing; Algorithm; Operations research; Mathematics; Engineering; Aeronautics","score_opus":0.05093061371344633,"score_gpt":0.3443331500059634,"score_spread":0.29340253629251706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3079159037","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.017943053,0.00024459514,0.9741751,0.0050116465,0.00012366749,0.0011378713,0.00008271963,0.0004426415,0.00083871424],"genre_scores_gemma":[0.71152985,0.00008781995,0.28729227,0.00013211563,0.00009567693,0.000321257,0.00018328291,0.000074589996,0.00028314826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982376,0.000096368676,0.00036207953,0.00030166542,0.0003403761,0.00066187757],"domain_scores_gemma":[0.99897856,0.00019328657,0.000014736379,0.00023128578,0.00039168235,0.00019047904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013802049,0.0001468963,0.00017855225,0.00016818772,0.00063808815,0.00025455718,0.00021569844,0.00010645382,0.000112832546],"category_scores_gemma":[0.0007745734,0.00015992136,0.00007222857,0.00060126605,0.00007002995,0.0003886081,0.000096835916,0.00040136627,0.000050155304],"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.0000063860903,0.000022689135,0.0001665875,0.00013351227,0.00002374417,0.0000010106521,0.0009410318,0.9762513,0.012361078,0.00088167965,0.0012282005,0.007982754],"study_design_scores_gemma":[0.00051695004,0.00008480371,0.000045897734,0.00006990637,0.0000058500623,0.0000025965567,0.0009969221,0.98941296,0.003883762,0.00008777052,0.004726,0.00016655013],"about_ca_topic_score_codex":0.000009334543,"about_ca_topic_score_gemma":0.0002224769,"teacher_disagreement_score":0.69358677,"about_ca_system_score_codex":0.00016973293,"about_ca_system_score_gemma":0.0001162675,"threshold_uncertainty_score":0.6521404},"labels":[],"label_agreement":null},{"id":"W3118945546","doi":"10.1007/s43069-020-00044-x","title":"Branch-and-Price for a Multi-attribute Technician Routing and Scheduling Problem","year":2021,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Branch and price; Arc routing; Technician; Column generation; Solver; Mathematical optimization; Integer programming; Scheduling (production processes); Algorithm; Routing (electronic design automation); Mathematics; Engineering; Computer network","score_opus":0.08663084792724975,"score_gpt":0.3906069132587584,"score_spread":0.30397606533150867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118945546","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.040910564,0.0007605418,0.9553169,0.0017959308,0.00004643449,0.00060866703,0.00002793747,0.00020038374,0.0003326282],"genre_scores_gemma":[0.3859794,0.00015698968,0.6130509,0.000033541754,0.00003665817,0.0001619332,0.000026254096,0.00003544291,0.0005189059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987275,0.00010441363,0.0002262526,0.00026317514,0.00017988746,0.00049880036],"domain_scores_gemma":[0.99905604,0.00018670206,0.000008101204,0.00019928008,0.0004353691,0.00011450832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014055157,0.00010522742,0.00014124258,0.00014866605,0.00070938974,0.00031944044,0.00009159516,0.00009422775,0.000013892572],"category_scores_gemma":[0.00097148796,0.00011392566,0.000026468075,0.00055587926,0.00005716102,0.00023945057,0.00014458677,0.00032150152,0.000004605],"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.000005870209,0.00006396801,0.004415133,0.0002791048,0.00007911006,0.0000063240445,0.0009732173,0.8501771,0.10053221,0.017157795,0.00033683548,0.025973339],"study_design_scores_gemma":[0.00046526553,0.000023423805,0.00036545773,0.000068962116,0.000005295811,0.000015955686,0.00053474423,0.9819887,0.01478677,0.00007613596,0.0015323652,0.00013691251],"about_ca_topic_score_codex":0.000017567625,"about_ca_topic_score_gemma":0.00014499908,"teacher_disagreement_score":0.34506884,"about_ca_system_score_codex":0.00007360305,"about_ca_system_score_gemma":0.000094151896,"threshold_uncertainty_score":0.5456124},"labels":[],"label_agreement":null},{"id":"W3192162026","doi":"10.1007/s43069-021-00068-x","title":"Review on Nature-Inspired Algorithms","year":2021,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Variety (cybernetics); Process (computing); Set (abstract data type); Engineering optimization; Class (philosophy); Optimization problem; Optimization algorithm; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics","score_opus":0.0741606981322478,"score_gpt":0.4232050557761675,"score_spread":0.3490443576439197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3192162026","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.000056900783,0.032356083,0.763772,0.1513978,0.0008355463,0.0015915137,0.000046504494,0.0003001503,0.04964351],"genre_scores_gemma":[0.010016564,0.063617215,0.8239211,0.025124408,0.00048609928,0.0011702948,0.00036864393,0.00010530573,0.07519036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950325,0.001091144,0.00039022128,0.0007993567,0.0018570111,0.0008297664],"domain_scores_gemma":[0.9949064,0.00037663002,0.00001941156,0.0017790453,0.0025810811,0.00033743025],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0024683934,0.00016594635,0.000255583,0.00038718944,0.0009381186,0.0008437899,0.0014656557,0.00014165846,0.0008183386],"category_scores_gemma":[0.004517947,0.00014709654,0.000099622855,0.0033919052,0.00011907708,0.0005845781,0.00085449853,0.0012757775,0.0015772652],"study_design_candidate":"not_applicable","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.0000056381336,0.00060549605,0.000020609918,0.00027284908,0.00006694319,0.0003351245,0.00009463616,0.004261764,0.00058121147,0.49100295,0.3465004,0.15625238],"study_design_scores_gemma":[0.0003998989,0.00018005444,0.000061008865,0.00056947645,0.000003643612,0.00006192591,0.00004794818,0.6004558,0.004883293,0.00092432124,0.39214662,0.00026601972],"about_ca_topic_score_codex":0.000027563892,"about_ca_topic_score_gemma":0.000053389133,"teacher_disagreement_score":0.596194,"about_ca_system_score_codex":0.00016461102,"about_ca_system_score_gemma":0.001167298,"threshold_uncertainty_score":0.9992001},"labels":[],"label_agreement":null},{"id":"W3209835046","doi":"10.1007/s43069-021-00097-6","title":"Deterministic Asymmetric-cost Differential Games for Energy Production with Production Bounds","year":2021,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hamilton–Jacobi–Bellman equation; Differential game; Profit (economics); Production (economics); Bounded function; Mathematical economics; Mathematics; Economics; Mathematical optimization; Upper and lower bounds; Optimal control; Microeconomics","score_opus":0.1715276890276076,"score_gpt":0.34731278583810077,"score_spread":0.17578509681049317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209835046","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.81741446,0.0021910088,0.07379833,0.0676948,0.0048061106,0.003196248,0.0019332356,0.00018617068,0.02877963],"genre_scores_gemma":[0.9767971,0.0006245937,0.0013760843,0.00010991203,0.0007953676,0.0010471733,0.0004799859,0.000043381773,0.018726414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982705,0.000036303827,0.000401364,0.00063945545,0.00006926856,0.00058308075],"domain_scores_gemma":[0.9989834,0.00006685549,0.000056882374,0.00046696476,0.00032178313,0.00010414309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053065753,0.0001366737,0.00025488678,0.00052844395,0.00085373834,0.00045513306,0.00014904325,0.00008801186,0.0002037513],"category_scores_gemma":[0.0010461909,0.00014689624,0.00007494458,0.00067786203,0.00012253296,0.00043133393,0.00008419211,0.00016598379,0.000111746536],"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.00027385005,0.0009991938,0.005659802,0.00020371705,0.0002351891,0.000008972237,0.0010378028,0.0037560477,0.0019095506,0.9345084,0.03027553,0.02113197],"study_design_scores_gemma":[0.002413983,0.001108226,0.005349754,0.000116207855,0.000039033643,0.00017274375,0.00296691,0.0794499,0.045872733,0.041324943,0.8198326,0.0013529701],"about_ca_topic_score_codex":0.0003071545,"about_ca_topic_score_gemma":0.0044313073,"teacher_disagreement_score":0.8931834,"about_ca_system_score_codex":0.00027671683,"about_ca_system_score_gemma":0.00013201537,"threshold_uncertainty_score":0.65663517},"labels":[],"label_agreement":null},{"id":"W4206974572","doi":"10.1007/s43069-021-00119-3","title":"Able Construction: A Spreadsheet Activity for Teaching Bayes’ Theorem","year":2022,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Statistics Education and Methodologies","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Wilfrid Laurier University","funders":"","keywords":"Exploit; Bayes' theorem; Graduation (instrument); Analytics; Computer science; Mathematics education; Bidding; Competence (human resources); Judgement; Autonomy; Data science; Bayesian probability; Artificial intelligence; Psychology; Engineering; Management; Epistemology; Marketing; Economics","score_opus":0.3169519663384597,"score_gpt":0.5358044830076717,"score_spread":0.21885251666921202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206974572","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.08054922,0.00006303629,0.8637668,0.016185725,0.0017415842,0.002509226,0.0010193003,0.00021710405,0.033948027],"genre_scores_gemma":[0.3443147,0.000008972205,0.62796307,0.00011657162,0.0001511802,0.0022687835,0.0000729987,0.00003477148,0.025068969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975061,0.0011982453,0.00018248479,0.00026117152,0.00043030933,0.00042173613],"domain_scores_gemma":[0.9957513,0.0034956133,0.000026231559,0.00037913406,0.00027050095,0.00007718117],"candidate_categories":["metaresearch","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004660662,0.000090723945,0.0001504953,0.00021715624,0.0031205139,0.00014822335,0.00025941562,0.000035853656,0.0014902432],"category_scores_gemma":[0.0085041355,0.00008672985,0.00005826659,0.000247508,0.00020358281,0.00014082793,0.00023159775,0.0005533182,0.0000164111],"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.000040487957,0.00014899783,0.000045719586,0.000020470656,0.000020075071,6.6164483e-7,0.001145992,0.00021951225,0.0012945627,0.8741521,0.11425343,0.008657938],"study_design_scores_gemma":[0.0006752978,0.00037399342,0.00004172436,0.000013888731,0.000017968492,0.00005461514,0.04820108,0.01770322,0.0045346073,0.67750806,0.25063455,0.00024099776],"about_ca_topic_score_codex":0.00011259667,"about_ca_topic_score_gemma":0.00012580579,"teacher_disagreement_score":0.26376545,"about_ca_system_score_codex":0.00021008801,"about_ca_system_score_gemma":0.00041066334,"threshold_uncertainty_score":0.99984765},"labels":[],"label_agreement":null},{"id":"W4221126329","doi":"10.1007/s43069-022-00126-y","title":"Understanding the Design Continuum Between Group Technology and Fractal Cell Designs for Manufacturing Systems Through the Central Backup Cellular Manufacturing System","year":2022,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Backup; Fractal; Remainder; Group technology; Cellular manufacturing; Unification; Computer science; Conceptual design; Distributed computing; Topology (electrical circuits); Parallel computing; Theoretical computer science; Engineering; Mathematics; Arithmetic; Mathematical optimization; Operating system; Mechanical engineering; Combinatorics; Programming language","score_opus":0.11985974478339925,"score_gpt":0.2915348363211791,"score_spread":0.17167509153777985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221126329","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.012315234,0.00050309626,0.9833158,0.00064693036,0.00036547586,0.0020762277,0.00012350845,0.00026407855,0.00038962613],"genre_scores_gemma":[0.9915316,0.000051949024,0.0068774796,0.000010136871,0.00015160286,0.00091206474,0.0000747818,0.00007086894,0.00031952545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976958,0.00031666478,0.00033710263,0.000339331,0.0004151361,0.00089594326],"domain_scores_gemma":[0.9986514,0.0007608144,0.000036528283,0.00042784208,0.000049552797,0.0000739012],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010657248,0.00022657035,0.00022393231,0.00024845393,0.004087214,0.00041016284,0.00048633554,0.0001068122,0.000013220621],"category_scores_gemma":[0.000035129742,0.00016437932,0.0000538625,0.00024694134,0.00019788841,0.00026559524,0.00026219172,0.00080244354,0.0000037128846],"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.000014674596,0.000011218354,0.000020178235,0.00010677537,0.000048560574,0.000005001991,0.00047962167,0.98604286,0.000831687,0.011526986,0.00076903275,0.00014340624],"study_design_scores_gemma":[0.0011402933,0.0003287441,0.00005593401,0.000077237986,0.00008224569,0.0000738839,0.054137714,0.8496468,0.075385,0.005126204,0.013339355,0.00060656754],"about_ca_topic_score_codex":0.000060283484,"about_ca_topic_score_gemma":0.000024182928,"teacher_disagreement_score":0.97921634,"about_ca_system_score_codex":0.000746945,"about_ca_system_score_gemma":0.00003386633,"threshold_uncertainty_score":0.9972093},"labels":[],"label_agreement":null},{"id":"W4224298808","doi":"10.1007/s43069-022-00136-w","title":"Distributed Integral Column Generation for Set Partitioning Problems","year":2022,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Computer science; Mathematical optimization; Scheduling (production processes); Heuristic; Crew scheduling; Column (typography); Heuristics; Set (abstract data type); Tree (set theory); Integer programming; Algorithm; Mathematics; Combinatorics","score_opus":0.12749409430182423,"score_gpt":0.3847809595954399,"score_spread":0.25728686529361566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224298808","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.057670124,0.00009293112,0.93664944,0.0020470277,0.00036420827,0.0014934612,0.00078375795,0.0003347739,0.00056429324],"genre_scores_gemma":[0.93257207,0.000014341771,0.059298597,0.000046577185,0.00013094,0.003570113,0.003235473,0.000049849616,0.0010820663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984094,0.00025994857,0.00026269088,0.00021492154,0.0003819771,0.00047107632],"domain_scores_gemma":[0.99926764,0.00008841882,0.0000099097215,0.00023576144,0.00031664476,0.0000816319],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017188855,0.000093698356,0.00010948093,0.00018703594,0.0019663791,0.00026890513,0.00019297563,0.000042183477,0.00037640124],"category_scores_gemma":[0.00030349812,0.00010953002,0.000046561934,0.0006876673,0.000043444357,0.00024174068,0.0001112917,0.00038801398,0.000014535187],"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.000003498118,0.00002223434,0.00029152932,0.000012451298,0.000015521759,3.6139247e-7,0.00022828647,0.959419,0.008631924,0.0036559575,0.026822444,0.000896785],"study_design_scores_gemma":[0.00030232905,0.000097755874,0.0000363098,0.0000051233246,0.0000036307858,0.000004349706,0.00061600725,0.955868,0.002667821,0.00017079209,0.040109914,0.000117936965],"about_ca_topic_score_codex":0.000050071292,"about_ca_topic_score_gemma":0.0002844448,"teacher_disagreement_score":0.8773508,"about_ca_system_score_codex":0.00037370098,"about_ca_system_score_gemma":0.000098280056,"threshold_uncertainty_score":0.9993329},"labels":[],"label_agreement":null},{"id":"W4225962937","doi":"10.1007/s43069-021-00116-6","title":"Nature-Inspired Techniques for Dynamic Constraint Satisfaction Problems","year":2022,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematical optimization; Computer science; Constraint (computer-aided design); Scheduling (production processes); Set (abstract data type); Constraint satisfaction; Context (archaeology); Optimization problem; Sequence (biology); Mathematics; Artificial intelligence","score_opus":0.02781063245877669,"score_gpt":0.34920630045351386,"score_spread":0.3213956679947372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225962937","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.0024347382,0.00006916948,0.97505754,0.017565036,0.00036637863,0.0020202154,0.00008901687,0.00036382268,0.002034069],"genre_scores_gemma":[0.8986329,0.00003173847,0.097719744,0.00034863967,0.00002238907,0.0020894571,0.00009466734,0.0000150243195,0.0010454773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799514,0.00025735723,0.0002650039,0.00043224808,0.0006130506,0.00043717437],"domain_scores_gemma":[0.9988744,0.00012941385,0.000029854406,0.00043887476,0.00043512374,0.00009230787],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001200297,0.000110890825,0.000112356356,0.0004937067,0.0023595637,0.00040951377,0.00044841616,0.00008353856,0.00026978043],"category_scores_gemma":[0.0001743175,0.00011742131,0.00007036269,0.0008575426,0.0001141907,0.0006270933,0.0003265543,0.0006651841,0.000013197468],"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.000019842277,0.00013732925,0.00074521033,0.00002473304,0.000036512833,0.000004231737,0.00055541156,0.037155442,0.014486977,0.55239874,0.009093244,0.38534233],"study_design_scores_gemma":[0.00045583947,0.0004374018,0.0011662338,0.00001189341,0.0000030660128,0.000061695006,0.00071311416,0.9278449,0.0019239006,0.004891458,0.0622419,0.00024862023],"about_ca_topic_score_codex":0.00012431636,"about_ca_topic_score_gemma":0.0012390843,"teacher_disagreement_score":0.89619815,"about_ca_system_score_codex":0.00043264797,"about_ca_system_score_gemma":0.00045038637,"threshold_uncertainty_score":0.9989392},"labels":[],"label_agreement":null},{"id":"W4294405730","doi":"10.1007/s43069-022-00156-6","title":"A Literature Review on Correlation Clustering: Cross-disciplinary Taxonomy with Bibliometric Analysis","year":2022,"lang":"en","type":"review","venue":"Operations Research Forum","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Cluster analysis; Taxonomy (biology); Discipline; Computer science; Data science; Set (abstract data type); Cross disciplinary; Bibliometrics; Information retrieval; Data mining; Management science; Artificial intelligence; Social science; Sociology; Engineering; Biology","score_opus":0.16849762507913518,"score_gpt":0.4663325407691728,"score_spread":0.2978349156900376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294405730","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015509495,0.9735361,0.012901379,0.000118109725,0.000039135837,0.0031295265,0.00036024983,0.00007225281,0.009841701],"genre_scores_gemma":[0.00010067499,0.9759228,0.0012091249,0.0000290516,0.00022605651,0.007679549,0.008928642,0.00007759242,0.0058264886],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949032,0.0011227021,0.0009223257,0.0010190716,0.0012836573,0.00074901554],"domain_scores_gemma":[0.99690056,0.0005452807,0.0002183143,0.0015755342,0.0005606442,0.00019967007],"candidate_categories":["metaepi_narrow","bibliometrics","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["bibliometrics"],"category_scores_codex":[0.0019607625,0.00054496044,0.0017856124,0.068598755,0.0017291866,0.0011970232,0.0009796082,0.00013217259,0.006044296],"category_scores_gemma":[0.00006411453,0.00040631279,0.0011570096,0.29313362,0.00013240922,0.0004003675,0.00088195136,0.0021537,0.000120290206],"study_design_candidate":"not_applicable","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.000011031907,0.00029864002,0.00040577754,0.0051746834,0.0022867958,0.000019569756,0.000018761237,0.00567462,2.1730514e-8,0.0022049034,0.017046733,0.96685845],"study_design_scores_gemma":[0.00008855455,0.00022783862,0.000019822153,0.015184993,0.0015710786,0.000005626716,0.000021006452,0.006728745,7.4484134e-8,0.000027634313,0.9757156,0.0004090551],"about_ca_topic_score_codex":0.00008361175,"about_ca_topic_score_gemma":0.00011812118,"teacher_disagreement_score":0.9664494,"about_ca_system_score_codex":0.00038689745,"about_ca_system_score_gemma":0.00053664745,"threshold_uncertainty_score":0.99983984},"labels":[{"model":"gemma","categories":["bibliometrics"],"domain":null,"study_design":"not_applicable","genre":"review","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":["bibliometrics"],"domain":null,"study_design":"design_other","genre":"review","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"split"},{"id":"W4312223687","doi":"10.1007/s43069-022-00184-2","title":"Using LINGO for Business Students","year":2022,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Spreadsheets and End-User Computing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Solver; Computer science; Scalar (mathematics); Set (abstract data type); Problem solver; Software; Integer programming; Mode (computer interface); Algebraic number; Linear programming; Theoretical computer science; Mathematical optimization; Algebra over a field; Algorithm; Mathematics; Programming language; Software engineering; Pure mathematics","score_opus":0.22374119205104206,"score_gpt":0.46674979258596505,"score_spread":0.24300860053492299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312223687","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.17102686,0.000108202665,0.8224631,0.0042464524,0.00066232396,0.0007286532,0.000014112299,0.00009939633,0.0006508966],"genre_scores_gemma":[0.9112894,0.0000043268046,0.08674032,0.00023145403,0.00013464624,0.00026541104,0.000013766095,0.000017173326,0.001303495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797064,0.00015220458,0.00017175678,0.0003482544,0.0008119559,0.00054517866],"domain_scores_gemma":[0.998854,0.00011409819,0.000012537951,0.0004777932,0.00046398395,0.000077611454],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001427925,0.00007554537,0.00009171105,0.00026994926,0.0032861533,0.0008012602,0.0015043411,0.000019228144,0.000044225726],"category_scores_gemma":[0.00015807545,0.00007549604,0.000038996117,0.0012421223,0.000031250536,0.0004117286,0.0021387292,0.00023292055,0.00001240352],"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.000022843236,0.00060937076,0.0045949463,0.000028680317,0.00005842445,0.00002255634,0.0025536497,0.77125335,0.007645357,0.17257391,0.01474253,0.025894351],"study_design_scores_gemma":[0.00033537598,0.000097043354,0.0006406278,0.000008322452,0.0000014870405,0.000013358211,0.00040869537,0.9556198,0.00033593777,0.0006517,0.041769348,0.000118267126],"about_ca_topic_score_codex":0.00038932625,"about_ca_topic_score_gemma":0.00007567991,"teacher_disagreement_score":0.74026257,"about_ca_system_score_codex":0.00016990787,"about_ca_system_score_gemma":0.00029003847,"threshold_uncertainty_score":0.9980114},"labels":[],"label_agreement":null},{"id":"W4321599248","doi":"10.1007/s43069-022-00180-6","title":"A General Mathematical Framework for Constrained Mixed-variable Blackbox Optimization Problems with Meta and Categorical Variables","year":2023,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Institut de Valorisation des Données; Hydro-Québec; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Categorical variable; Computer science; Notation; Mathematical optimization; Optimization problem; Variable (mathematics); Continuous optimization; Context (archaeology); Flexibility (engineering); Artificial intelligence; Machine learning; Algorithm; Mathematics; Multi-swarm optimization","score_opus":0.07086614826535843,"score_gpt":0.35872397314201365,"score_spread":0.28785782487665523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321599248","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.000052054434,0.000049450897,0.9928799,0.004550017,0.00006631016,0.0015666158,0.000037594866,0.00025315073,0.0005448931],"genre_scores_gemma":[0.004531019,0.00006228236,0.99125034,0.000087469714,0.000053701337,0.0016505776,0.0000946369,0.000037552476,0.0022323974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974763,0.0002178597,0.00031890502,0.00066235085,0.00057156355,0.0007530208],"domain_scores_gemma":[0.9974421,0.00081914465,0.000034955385,0.0005255126,0.0009577597,0.00022049095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012272967,0.0002054589,0.00030955486,0.000383231,0.0010042855,0.000726713,0.00045662237,0.00013957158,0.0000815658],"category_scores_gemma":[0.0011414414,0.00015901063,0.00004865419,0.0022750916,0.00028678204,0.00093127583,0.00033274223,0.00031335902,0.000028128768],"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.000005084732,0.00005112502,0.000003966135,0.000015929467,0.000078728015,0.0000031041943,0.0001472444,0.5126109,0.00005606578,0.48638257,0.0003176774,0.00032758267],"study_design_scores_gemma":[0.00051551475,0.00020647173,0.000002671257,0.0000203797,0.000029347413,0.000036776728,0.00021047369,0.92769784,0.00017960698,0.07007028,0.0008418868,0.00018874099],"about_ca_topic_score_codex":0.000024972174,"about_ca_topic_score_gemma":0.000021213822,"teacher_disagreement_score":0.4163123,"about_ca_system_score_codex":0.00008961015,"about_ca_system_score_gemma":0.00038171426,"threshold_uncertainty_score":0.77242535},"labels":[],"label_agreement":null},{"id":"W4322771373","doi":"10.1007/s43069-022-00190-4","title":"Model Development and Solver Demonstrations Using Randomized Test Problems","year":2023,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Solver; Python (programming language); Visualization; MATLAB; Scalability; Software engineering; Analytics; Development (topology); Programming language; Data science; Artificial intelligence; Database","score_opus":0.12980991366936692,"score_gpt":0.34702767892351927,"score_spread":0.21721776525415235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322771373","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.15182096,0.00048147442,0.8107154,0.0031679717,0.0002689074,0.0038536026,0.000070212736,0.0015887662,0.028032724],"genre_scores_gemma":[0.9284442,0.00031832518,0.06655895,0.000026689328,0.000023387882,0.00037508208,0.00010671061,0.000044830194,0.004101814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988695,0.000058637055,0.00026108974,0.00015739244,0.00026540307,0.0003880079],"domain_scores_gemma":[0.99940157,0.00017778917,0.000005864347,0.00014177954,0.00017107058,0.000101899815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010038939,0.0001012613,0.00015016254,0.00035683243,0.000734506,0.00027094368,0.0000865809,0.000065066284,0.00004239336],"category_scores_gemma":[0.00021950806,0.00009370107,0.000026415499,0.00068886153,0.00011515427,0.00026210252,0.00006159127,0.00019969237,0.000093002294],"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.000012570489,0.00001274995,0.00005895982,0.000022933418,0.000018560035,6.461009e-7,0.0007204403,0.9915266,0.0022386506,0.0034954716,0.0012483059,0.0006441008],"study_design_scores_gemma":[0.003693727,0.0000055939963,0.000008486954,0.000031936626,0.000003797081,0.0000025672684,0.00015636487,0.9936251,0.0007604942,0.00030925134,0.0012898134,0.00011285854],"about_ca_topic_score_codex":0.000018649054,"about_ca_topic_score_gemma":0.0003069763,"teacher_disagreement_score":0.77662325,"about_ca_system_score_codex":0.000056950794,"about_ca_system_score_gemma":0.00016523674,"threshold_uncertainty_score":0.5649301},"labels":[],"label_agreement":null},{"id":"W4323312451","doi":"10.1007/s43069-023-00202-x","title":"Model Development with Maple in PhD-Level Management Science Courses: A Personal Account","year":2023,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Maple; Computer science; Presentation (obstetrics); Mathematics education; Mathematics","score_opus":0.4506563412510798,"score_gpt":0.5069861037775598,"score_spread":0.05632976252648003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323312451","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.9394101,0.000014029616,0.022610929,0.0109469965,0.000043156324,0.0011230832,0.00005737515,0.00006657068,0.025727749],"genre_scores_gemma":[0.9514428,0.000011207791,0.010502526,0.000108817876,0.0000115941575,0.0007358146,0.000014689541,0.000010135921,0.037162468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99495655,0.00011489421,0.00034884756,0.0006481158,0.0031539758,0.0007776294],"domain_scores_gemma":[0.9982961,0.00024014531,0.000019568552,0.00059230474,0.0006849487,0.00016694187],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.010029995,0.000107286076,0.00012613783,0.0015039046,0.0018022786,0.00083397963,0.0012983438,0.000031522617,0.00026019436],"category_scores_gemma":[0.0004184075,0.0000766147,0.000023695904,0.0067976047,0.00066289795,0.0006952267,0.00059255806,0.00024534643,0.0024367012],"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.00010760066,0.00054414355,0.0037992967,0.000014088819,0.000027425083,0.000041516414,0.012123981,0.2179548,0.0045688283,0.67128986,0.028151156,0.061377306],"study_design_scores_gemma":[0.0006490822,0.0000682124,0.017111685,0.00005044261,0.0000024492388,0.0000069010885,0.039964445,0.88870263,0.0013178298,0.024225285,0.02762715,0.00027389353],"about_ca_topic_score_codex":0.000039146493,"about_ca_topic_score_gemma":0.0018931348,"teacher_disagreement_score":0.6707478,"about_ca_system_score_codex":0.00022877408,"about_ca_system_score_gemma":0.0010377701,"threshold_uncertainty_score":0.99949723},"labels":[],"label_agreement":null},{"id":"W4327814502","doi":"10.1007/s43069-023-00209-4","title":"PPE Supply Optimization Under Risks of Disruption from the COVID-19 Pandemic","year":2023,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Supply Chain Resilience and Risk Management","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pandemic; Stochastic programming; Context (archaeology); Supply chain; Personal protective equipment; Pareto principle; Coronavirus disease 2019 (COVID-19); Constraint (computer-aided design); Expected shortfall; Operations research; Computer science; Economics; Business; Risk management; Operations management; Mathematical optimization; Engineering; Marketing; Mathematics; Medicine; Finance","score_opus":0.23827468551805536,"score_gpt":0.43291459802501076,"score_spread":0.1946399125069554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327814502","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.7342206,0.00037594236,0.09974242,0.15390179,0.00074263563,0.0032713413,0.0001472744,0.0005609102,0.007037045],"genre_scores_gemma":[0.99390274,0.0005982599,0.00020885783,0.0021102126,0.00037663637,0.00019396323,0.0007773611,0.000021828966,0.0018101189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822,0.00009031326,0.00026843074,0.0002940213,0.0007017765,0.00042545673],"domain_scores_gemma":[0.99892944,0.00031093508,0.000042499607,0.00042625266,0.0002625916,0.000028265093],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015969684,0.00010867444,0.00011599683,0.00041767725,0.0011794836,0.00045050707,0.00046886542,0.0000663843,0.0010713063],"category_scores_gemma":[0.00070590415,0.00007472058,0.00006153076,0.0018809247,0.0002108137,0.0008018537,0.00042697272,0.0002112822,0.00063597073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024385788,0.00004811823,0.08455814,0.000023935825,0.000026169047,0.0000027646063,0.00016097898,0.826149,0.00024369442,0.022034602,0.06476755,0.0019606557],"study_design_scores_gemma":[0.0007312867,0.000026477652,0.029291486,0.000032937078,0.000031467574,7.351467e-7,0.015599033,0.8260624,0.000029671332,0.0066120783,0.121371776,0.00021064813],"about_ca_topic_score_codex":0.01570524,"about_ca_topic_score_gemma":0.006601113,"teacher_disagreement_score":0.25968212,"about_ca_system_score_codex":0.000088834495,"about_ca_system_score_gemma":0.00010120509,"threshold_uncertainty_score":0.99984187},"labels":[],"label_agreement":null},{"id":"W4327973085","doi":"10.1007/s43069-023-00207-6","title":"The Setup Carryover Assignment Problem","year":2023,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Unimodular matrix; Integer programming; Mathematical optimization; Integer (computer science); Sizing; Linear programming; Time horizon; Extension (predicate logic); Computer science; Mathematics; Discrete mathematics","score_opus":0.0795060178158165,"score_gpt":0.3382009867105791,"score_spread":0.25869496889476257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327973085","genre_codex":"other","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.039647363,0.0002590037,0.0007600784,0.23466222,0.0017721741,0.004112781,0.000017926655,0.0008155685,0.7179529],"genre_scores_gemma":[0.86427665,0.00012693193,0.00007960388,0.0018395152,0.0010724562,0.0010672038,0.00015762213,0.000047058416,0.13133296],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979684,0.00004738811,0.00019978483,0.0002545668,0.0008222218,0.0007076843],"domain_scores_gemma":[0.9992253,0.00007770969,0.000016136897,0.0004140341,0.00024632565,0.000020456677],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002128013,0.00010416648,0.00007614281,0.00033518337,0.0024220648,0.0015127012,0.00046059716,0.00003531454,0.0005952423],"category_scores_gemma":[0.00017769837,0.00007112095,0.000055258864,0.0013788808,0.00013261358,0.00074136385,0.00063444016,0.00021722539,0.006828911],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000006636701,0.00003054428,0.0007160535,0.000020600903,0.000022023069,0.000006144642,0.00004525158,0.0022383665,0.0001823983,0.2632262,0.72814137,0.0053643836],"study_design_scores_gemma":[0.00018744434,0.000012715763,0.0006273685,0.000012626369,0.0000039332617,1.9836108e-7,0.002586615,0.049334876,0.00003708369,0.0036229603,0.94347817,0.00009601412],"about_ca_topic_score_codex":0.00065944274,"about_ca_topic_score_gemma":0.0014604232,"teacher_disagreement_score":0.8246293,"about_ca_system_score_codex":0.00009270791,"about_ca_system_score_gemma":0.000045567373,"threshold_uncertainty_score":0.9995238},"labels":[],"label_agreement":null},{"id":"W4328121662","doi":"10.1007/s43069-023-00194-8","title":"Vaccine Allocation and Distribution: A Review with a Focus on Quantitative Methodologies and Application to Equity, Hesitancy, and COVID-19 Pandemic","year":2023,"lang":"en","type":"review","venue":"Operations Research Forum","topic":"COVID-19 epidemiological studies","field":"Mathematics","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; McMaster University","funders":"","keywords":"Equity (law); Pandemic; Context (archaeology); Distribution (mathematics); Coronavirus disease 2019 (COVID-19); Management science; Resource allocation; Operations research; Computer science; Economics; Political science; Infectious disease (medical specialty); Geography; Engineering; Medicine; Disease","score_opus":0.7992309039181115,"score_gpt":0.666315419516724,"score_spread":0.13291548440138745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4328121662","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008900591,0.8563906,0.11228042,0.025336266,0.000009924785,0.0054901233,0.00029087992,0.00013478413,0.000058078123],"genre_scores_gemma":[0.00005506821,0.9834151,0.010416657,0.0004817148,0.000032702497,0.005111138,0.00021672409,0.00003855972,0.00023228128],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949403,0.002271033,0.0007669314,0.0009668004,0.0005083359,0.0005466411],"domain_scores_gemma":[0.9791231,0.019465905,0.00014495071,0.0005501715,0.00038641872,0.00032942006],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.009256306,0.00040195312,0.0016697191,0.0002528905,0.0010226154,0.00014858322,0.00027933283,0.00022240747,0.000010499498],"category_scores_gemma":[0.05353018,0.00025444073,0.00007786174,0.0012675767,0.00027173254,0.000121371704,0.0011856359,0.0006187764,0.000033760844],"study_design_candidate":"not_applicable","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.000062332634,0.00006459791,0.00008844129,0.047732968,0.00028291804,0.000007963945,0.00017584149,0.000018107357,0.0000016922465,0.38153648,0.019014312,0.55101436],"study_design_scores_gemma":[0.00042951579,0.0014786447,0.0001127611,0.020483285,0.0006224939,0.00006995893,0.0004980748,0.00039246082,6.7843035e-7,0.10345854,0.8718016,0.00065196876],"about_ca_topic_score_codex":0.00036507126,"about_ca_topic_score_gemma":0.0037823503,"teacher_disagreement_score":0.8527873,"about_ca_system_score_codex":0.00059641385,"about_ca_system_score_gemma":0.00039765885,"threshold_uncertainty_score":0.99999076},"labels":[],"label_agreement":null},{"id":"W4388929300","doi":"10.1007/s43069-023-00277-6","title":"ChatGPT-Based Investment Portfolio Selection","year":2023,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"","keywords":"Portfolio; Portfolio optimization; Selection (genetic algorithm); Investment strategy; Black–Litterman model; Computer science; Stock (firearms); Stock market; Econometrics; Economics; Artificial intelligence; Replicating portfolio; Financial economics; Microeconomics; Engineering; Context (archaeology)","score_opus":0.22780718902306915,"score_gpt":0.4938378116246731,"score_spread":0.2660306226016039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388929300","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.6004482,0.00028676275,0.071941204,0.076167345,0.0019828505,0.0041276976,0.00016361756,0.0012225221,0.24365981],"genre_scores_gemma":[0.9257899,0.00025931414,0.002446877,0.00073233695,0.00016547722,0.0003359189,0.00021018351,0.000028528613,0.07003145],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99536574,0.0005192712,0.00049677875,0.000494049,0.0024928583,0.000631303],"domain_scores_gemma":[0.9974728,0.00040873795,0.000034214103,0.0005681656,0.0012965259,0.00021952468],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0061098,0.000112540394,0.0001522955,0.0018773822,0.0013376069,0.00084536226,0.0004943343,0.000097846256,0.001379756],"category_scores_gemma":[0.002717878,0.00008799882,0.00008131851,0.0073696156,0.000135702,0.00059423264,0.00013299382,0.00026591463,0.005655841],"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.000023287374,0.000098798766,0.0107226735,0.0000013851235,0.00001139332,0.000011328558,0.0002547049,0.40086225,0.0012124387,0.035180125,0.53646326,0.015158336],"study_design_scores_gemma":[0.0002702723,0.00015091045,0.004837465,0.0000060047214,0.000002199941,0.0000030752133,0.0006966968,0.63143355,0.0021656363,0.005442811,0.3548687,0.00012266837],"about_ca_topic_score_codex":0.00029675622,"about_ca_topic_score_gemma":0.0009253775,"teacher_disagreement_score":0.3253417,"about_ca_system_score_codex":0.00010894721,"about_ca_system_score_gemma":0.0006003122,"threshold_uncertainty_score":0.9999625},"labels":[],"label_agreement":null},{"id":"W4400184785","doi":"10.1007/s43069-024-00336-6","title":"One-Shot Learning for MIPs with SOS1 Constraints","year":2024,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université de Montréal","funders":"Institut de Valorisation des Données","keywords":"Shot (pellet); Computer science; Artificial intelligence; Chemistry","score_opus":0.16772378563297602,"score_gpt":0.42246039914045613,"score_spread":0.2547366135074801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400184785","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.00025097266,0.00025552732,0.9787889,0.012178668,0.00013742333,0.0010075641,0.00001796835,0.00022171582,0.007141267],"genre_scores_gemma":[0.34976462,0.00018631716,0.61857194,0.00014005358,0.000204043,0.0010375157,0.00010092319,0.000061747785,0.029932832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967722,0.00034987944,0.00025636665,0.00063994055,0.0011498055,0.0008317714],"domain_scores_gemma":[0.9973773,0.00072207896,0.000009577322,0.0005266105,0.0011145642,0.00024989052],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0023604303,0.00012876844,0.00015746037,0.00066333596,0.0010961884,0.0024306488,0.0008465942,0.00007191457,0.00037187804],"category_scores_gemma":[0.0010751657,0.000111677866,0.000054616597,0.0016805365,0.00037125117,0.00084343215,0.00031391962,0.0006705533,0.00037955277],"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.000025838803,0.00017864794,0.000060576127,0.00013604338,0.00013810414,0.000055067514,0.0009388493,0.0675058,0.0017802264,0.68592906,0.013353153,0.22989862],"study_design_scores_gemma":[0.000278037,0.0003625119,0.00001988923,0.0000675326,0.0000032401067,0.0000203854,0.00025115852,0.93863827,0.0011433113,0.0006998833,0.05837058,0.00014518475],"about_ca_topic_score_codex":0.000035444347,"about_ca_topic_score_gemma":0.000086093954,"teacher_disagreement_score":0.8711325,"about_ca_system_score_codex":0.00011963144,"about_ca_system_score_gemma":0.0011387183,"threshold_uncertainty_score":0.99860495},"labels":[],"label_agreement":null},{"id":"W4401368705","doi":"10.1007/s43069-024-00350-8","title":"A Modeling and Hybridized Decomposition Approach for the Multi-level Capacitated Lot-Sizing Problem with Setup Carryover, Backlogging, and Emission Control","year":2024,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Mathematical optimization; Sizing; Column generation; Computer science; Time horizon; Heuristic; Production planning; Decomposition; Integer programming; Inventory control; Set (abstract data type); Holding cost; Linear programming; Production (economics); Dynamic programming; Operations research; Mathematics; Economics","score_opus":0.09136895763153578,"score_gpt":0.3325534853734296,"score_spread":0.2411845277418938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401368705","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.068383716,0.0023902107,0.9124572,0.010032172,0.00013089209,0.0044505238,0.000049496663,0.00018808026,0.0019176718],"genre_scores_gemma":[0.98780364,0.00008621891,0.009635428,0.00036060493,0.00018186662,0.0007103172,0.0001371947,0.000037746486,0.0010469803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986788,0.000039912728,0.00019079182,0.0003843524,0.00030208266,0.00040403084],"domain_scores_gemma":[0.9994369,0.0000976066,0.000014147684,0.0001674893,0.0002553352,0.000028535816],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012566068,0.00014983975,0.00013294986,0.0002926961,0.0013330223,0.001684342,0.00013145416,0.00004120957,0.000018329129],"category_scores_gemma":[0.000069662965,0.00009686319,0.00003404016,0.00033110913,0.00011068106,0.0009803339,0.00013308128,0.00021968433,0.000005439905],"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.0015412074,0.0008893591,0.0031590664,0.0062312237,0.0015545612,0.000050139253,0.0040894756,0.613394,0.030604506,0.20254649,0.055719912,0.080220036],"study_design_scores_gemma":[0.0012922043,0.000033296386,0.00003156906,0.00013698127,0.000046978934,0.000004420537,0.0026205871,0.98600626,0.000039572733,0.00023094247,0.009418637,0.00013857416],"about_ca_topic_score_codex":0.00085283304,"about_ca_topic_score_gemma":0.00033786928,"teacher_disagreement_score":0.91941994,"about_ca_system_score_codex":0.000057218975,"about_ca_system_score_gemma":0.000044279877,"threshold_uncertainty_score":0.9999671},"labels":[],"label_agreement":null},{"id":"W4404612850","doi":"10.1007/s43069-024-00375-z","title":"A Behavioral Test and Classification of Solution Concepts in Games","year":2024,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Test (biology); Psychology; Computer science; Artificial intelligence","score_opus":0.16465823937813545,"score_gpt":0.47259736149743303,"score_spread":0.3079391221192976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404612850","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.69365907,0.0017692924,0.28042495,0.020185778,0.0003036642,0.00086634076,0.000022002068,0.00014325243,0.0026256393],"genre_scores_gemma":[0.9942029,0.000074877884,0.004997416,0.000009362294,0.000016983433,0.00007582094,0.0000038279154,0.0000045814145,0.0006142213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988933,0.000110014,0.00021211062,0.00025419804,0.00029306355,0.00023731487],"domain_scores_gemma":[0.9992705,0.00023913849,0.0000070514097,0.00024656442,0.00019220533,0.0000445222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075116934,0.00005135673,0.0000681862,0.00033727672,0.00013365872,0.00032007162,0.00027560504,0.000047355777,0.000021011541],"category_scores_gemma":[0.00026427818,0.000047589307,0.000017316763,0.00078876986,0.00025376034,0.0007528185,0.00016455824,0.00019656721,0.000061621504],"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.0000037376453,0.0002476592,0.007498269,0.000031207965,0.000004458995,0.000012717783,0.005276779,0.00043222567,0.16115023,0.505264,0.0025919178,0.31748682],"study_design_scores_gemma":[0.000034583605,0.00019878328,0.00492836,0.00007951116,0.0000010801767,0.0000054271063,0.0009813184,0.967845,0.01941188,0.003533139,0.0029054217,0.00007549926],"about_ca_topic_score_codex":0.0004461789,"about_ca_topic_score_gemma":0.0023008194,"teacher_disagreement_score":0.96741277,"about_ca_system_score_codex":0.00007249587,"about_ca_system_score_gemma":0.00019503754,"threshold_uncertainty_score":0.30864578},"labels":[],"label_agreement":null},{"id":"W4409217833","doi":"10.1007/s43069-025-00437-w","title":"On the Existence of Monge Solutions to Multi-marginal Optimal Transport with Quadratic Cost and Uniform Discrete Marginals","year":2025,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Geometric Analysis and Curvature Flows","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quadratic equation; Mathematics; Applied mathematics; Mathematical optimization; Mathematical economics; Geometry","score_opus":0.1147092383121214,"score_gpt":0.3981596332955925,"score_spread":0.28345039498347113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409217833","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.5752285,0.00019792232,0.38623032,0.028227113,0.00004264112,0.0022664377,0.00011509031,0.000024412364,0.0076675387],"genre_scores_gemma":[0.9726359,0.00004425651,0.01879613,0.00008871906,0.000009358315,0.00023147854,0.000011906827,0.000010311844,0.008171922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835443,0.00014791435,0.00029024563,0.00022066187,0.000556805,0.0004299284],"domain_scores_gemma":[0.9982888,0.0005634398,0.000025615662,0.00043672015,0.0005721112,0.000113308946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016344158,0.00012386327,0.00022550058,0.00047578855,0.0009864647,0.00014114327,0.00029800922,0.00004624947,0.00010552958],"category_scores_gemma":[0.00083593035,0.00007070461,0.00006144141,0.0018524086,0.00023368762,0.00016474447,0.00007334496,0.000377205,0.0000105683375],"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.00012932827,0.00039457093,0.00090275664,0.00007549468,0.00020944794,0.000009056887,0.0012130276,0.008130265,0.00028117132,0.9816498,0.005866175,0.0011388648],"study_design_scores_gemma":[0.008581411,0.008333674,0.057884466,0.003820985,0.0012707445,0.00010758609,0.13430019,0.6726265,0.0049197604,0.051694356,0.05393417,0.0025261655],"about_ca_topic_score_codex":0.00014388142,"about_ca_topic_score_gemma":0.0028352435,"teacher_disagreement_score":0.9299555,"about_ca_system_score_codex":0.00006235121,"about_ca_system_score_gemma":0.00023004028,"threshold_uncertainty_score":0.75871885},"labels":[],"label_agreement":null},{"id":"W4410461442","doi":"10.1007/s43069-025-00467-4","title":"Time-Dependent Routing and Road Network Precision","year":2025,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Routing (electronic design automation); Computer network","score_opus":0.029420819693897735,"score_gpt":0.34907756549632113,"score_spread":0.31965674580242337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410461442","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.00479607,0.00049221603,0.9224247,0.019226898,0.00037989524,0.0008371989,0.0000078046405,0.0001606995,0.051674534],"genre_scores_gemma":[0.6411215,0.0004232518,0.11380991,0.0008941518,0.00030599668,0.00022557961,0.00008091086,0.00002121741,0.2431175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986153,0.00014813153,0.0001425025,0.0003282933,0.0003625923,0.00040316544],"domain_scores_gemma":[0.99923444,0.00008761859,0.000006722794,0.0004902051,0.00012556848,0.00005541917],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015948832,0.00006446137,0.000074133604,0.00018111111,0.0009196347,0.0011590854,0.00069281785,0.000029782674,0.0000340591],"category_scores_gemma":[0.00015059278,0.000056426015,0.000016231914,0.000744351,0.00005543281,0.00091887754,0.0017524945,0.00017566975,0.00018690302],"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.0000046441123,0.000060610786,0.00032562908,0.000007547692,0.000027062611,0.000008718844,0.00013173961,0.006663962,0.00028044492,0.2653941,0.09488841,0.63220716],"study_design_scores_gemma":[0.00018143264,0.000044221175,0.0006336651,0.000040554787,0.0000015846622,9.569972e-7,0.00007828979,0.964948,0.00013382528,0.002549551,0.031314287,0.00007363487],"about_ca_topic_score_codex":0.00008641771,"about_ca_topic_score_gemma":0.00011030363,"teacher_disagreement_score":0.958284,"about_ca_system_score_codex":0.000035040113,"about_ca_system_score_gemma":0.000070587186,"threshold_uncertainty_score":0.9998778},"labels":[],"label_agreement":null},{"id":"W4414133469","doi":"10.1007/s43069-025-00516-y","title":"Stochastic Optimization Approaches to Biomass-to-Bioenergy Supply Chain Network Design Under Demand Uncertainty","year":2025,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Supply chain; Supply chain network; Stochastic programming; Robust optimization; Supply chain optimization; Renewable energy; Profit (economics); Electricity; Stochastic optimization; Network planning and design","score_opus":0.09649546229807995,"score_gpt":0.3038192620057607,"score_spread":0.20732379970768075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414133469","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.000941126,0.00007993059,0.92974365,0.060923047,0.00025246572,0.002839152,0.0000039657143,0.00013323301,0.0050834515],"genre_scores_gemma":[0.946873,0.0000062660133,0.029529585,0.005572625,0.000755205,0.0022481368,0.00025419294,0.000072322255,0.014688642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682915,0.00017262508,0.00038484263,0.0006952775,0.00066711486,0.001251009],"domain_scores_gemma":[0.99844223,0.00020512377,0.000028885257,0.0006272107,0.00062403193,0.000072500894],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0027202258,0.00026669417,0.00024261049,0.001799906,0.0016365517,0.0015969849,0.00066888327,0.00010472157,0.0002891625],"category_scores_gemma":[0.00073949713,0.0002594303,0.00006307026,0.005182698,0.000101890175,0.00073624804,0.0010586693,0.0002207486,0.00023868683],"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.000068046276,0.000072833005,0.00008613096,0.000048779337,0.00004794437,0.0000036122306,0.00003953938,0.74700934,0.000026199237,0.19639876,0.0552624,0.00093640614],"study_design_scores_gemma":[0.00043389387,0.000047427726,0.00016267603,0.00007859455,0.000023929042,2.9539885e-7,0.0031085159,0.96696764,0.000022906064,0.0058359774,0.02304065,0.00027749868],"about_ca_topic_score_codex":0.0017845385,"about_ca_topic_score_gemma":0.0018972784,"teacher_disagreement_score":0.9459319,"about_ca_system_score_codex":0.000437957,"about_ca_system_score_gemma":0.00021997957,"threshold_uncertainty_score":0.9999858},"labels":[],"label_agreement":null},{"id":"W4414212781","doi":"10.1007/s43069-025-00548-4","title":"Conditional Correlation via Generalized Random Forests with Application to Hedge Funds","year":2025,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Financial Risk and Volatility Modeling","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Toronto; York University","funders":"","keywords":"Conditional variance; Estimator; Hedge fund; Explanatory power; Variance (accounting); Correlation; Asset (computer security); Financial market; Financial asset","score_opus":0.04186775848480495,"score_gpt":0.32871523521775436,"score_spread":0.2868474767329494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414212781","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.10131403,0.00024320738,0.8865595,0.004398247,0.000088693916,0.00090798887,0.00011149982,0.000029366947,0.006347483],"genre_scores_gemma":[0.98983693,0.000026904356,0.004082168,0.00025414495,0.00006034988,0.00068897614,0.00035915614,0.000013777648,0.0046775676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998688,0.0000421845,0.00041337716,0.00039617956,0.00010495893,0.00035533012],"domain_scores_gemma":[0.9991641,0.00008394374,0.000029522274,0.0003366968,0.0002985913,0.00008711202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097579166,0.00010240417,0.00020929711,0.00055138214,0.00077297026,0.00016223763,0.00018267734,0.00009121866,0.00012868126],"category_scores_gemma":[0.00023839813,0.000106565516,0.000049725142,0.000895404,0.00007130709,0.0003103349,0.00006978199,0.0002182271,0.00048246575],"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.00019437788,0.000092214956,0.04113733,0.0000119460365,0.000024735797,4.5347568e-7,0.0001677775,0.1452712,0.00015748983,0.80656195,0.0039322083,0.002448309],"study_design_scores_gemma":[0.001441331,0.00010043572,0.023290103,0.000017746244,0.0000029082025,8.878266e-7,0.000050474162,0.8694689,0.00013165383,0.065214716,0.040131304,0.00014948602],"about_ca_topic_score_codex":0.001050122,"about_ca_topic_score_gemma":0.004645062,"teacher_disagreement_score":0.8885229,"about_ca_system_score_codex":0.00018781533,"about_ca_system_score_gemma":0.00012243012,"threshold_uncertainty_score":0.6201282},"labels":[],"label_agreement":null}]}