{"meta":{"query_hash":"3373e47b9119","filters":{"venue":"Journal of the Operational Research Society"},"cohort_total":122,"direct_labels_cover":0,"predictions_cover":122,"exported":122,"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/3373e47b9119","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+the+Operational+Research+Society"},"results":[{"id":"W1964527755","doi":"10.1057/palgrave.jors.2601754","title":"The multi-source Weber problem with constant opening cost","year":2004,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Group for Research in Decision Analysis","funders":"","keywords":"Constant (computer programming); Computer science; Mathematical optimization; Fixed cost; Scheduling (production processes); Heuristic; Project management; Purchasing; Heuristics; Operations research; Mathematics; Operations management; Economics; Engineering; Systems engineering","score_opus":0.08263044589991356,"score_gpt":0.3331939620917556,"score_spread":0.25056351619184203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964527755","genre_codex":"commentary","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.34623662,0.0011045643,0.0511784,0.5569595,0.0016534019,0.0048884302,0.000010975754,0.000076359254,0.037891746],"genre_scores_gemma":[0.9841703,0.00015663431,0.0042139944,0.002917389,0.0006677365,0.000038490496,0.0000038193984,0.000019486666,0.007812134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979248,0.00004989458,0.00033570916,0.00011978706,0.0012942537,0.00027556648],"domain_scores_gemma":[0.9981641,0.00007633621,0.000113215225,0.0001946967,0.0014289306,0.000022690885],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0039264956,0.00009284367,0.000098399236,0.00004224186,0.0017091711,0.0007197621,0.0006233038,0.00003095438,0.000113861024],"category_scores_gemma":[0.00032287466,0.00004373325,0.00014087786,0.00053539313,0.00029493496,0.0007559614,0.0002746035,0.0004960272,0.00006857045],"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.00038550433,0.00069983385,0.009469219,0.00022082272,0.0006743531,0.000010084479,0.0018731242,0.48838353,0.0022153521,0.29200247,0.19737886,0.0066868444],"study_design_scores_gemma":[0.0023950443,0.00004173381,0.0055832313,0.00021527223,0.00003454636,0.000014501363,0.0053304336,0.021977622,0.00014696135,0.0019992227,0.9620802,0.00018126026],"about_ca_topic_score_codex":0.00033147735,"about_ca_topic_score_gemma":0.00056484,"teacher_disagreement_score":0.7647013,"about_ca_system_score_codex":0.00019088268,"about_ca_system_score_gemma":0.00032154188,"threshold_uncertainty_score":0.99959046},"labels":[],"label_agreement":null},{"id":"W1965406319","doi":"10.1057/palgrave.jors.2601450","title":"An optimal maintenance policy for skipping imminent preventive maintenance for systems experiencing random failures","year":2003,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Reliability and Maintenance Optimization","field":"Engineering","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":"Simon Fraser University","funders":"","keywords":"Preventive maintenance; Planner; Operations research; Computer science; Operations management; Mean time between failures; Weibull distribution; Weighting; Reliability engineering; Economics; Failure rate; Mathematics; Statistics; Engineering","score_opus":0.024042599302717745,"score_gpt":0.3338758463127009,"score_spread":0.30983324700998316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965406319","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.047227163,0.00063284463,0.94714016,0.0021048652,0.000725868,0.0018559493,0.000045612946,0.0000202916,0.00024724906],"genre_scores_gemma":[0.94649565,0.0004137108,0.050965264,0.000089603134,0.00062467536,0.0003472985,0.0000067896744,0.000037843027,0.0010191627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980605,0.00020819658,0.000517489,0.00016844027,0.00056686875,0.00047848816],"domain_scores_gemma":[0.99722373,0.0005049942,0.00012412167,0.0002110897,0.0018211629,0.000114891554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041893306,0.00013948492,0.00024918694,0.000064804204,0.00052660063,0.00022142396,0.0003813234,0.000092917566,0.000009273613],"category_scores_gemma":[0.002565202,0.00009284861,0.000383117,0.00027493396,0.00013954325,0.0005839116,0.00002457092,0.00033262634,5.669932e-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.0001590843,0.00005350584,0.000015477019,0.00012900983,0.00009450433,3.559313e-7,0.0023959905,0.9537873,0.010325874,0.016314426,0.016556378,0.0001680409],"study_design_scores_gemma":[0.0035853612,0.00032652472,0.000092806884,0.00043297012,0.000020332549,0.000052995965,0.010614226,0.92771447,0.009446378,0.0016864738,0.045798287,0.00022917501],"about_ca_topic_score_codex":0.000013523485,"about_ca_topic_score_gemma":0.000003661264,"teacher_disagreement_score":0.8992685,"about_ca_system_score_codex":0.00068325887,"about_ca_system_score_gemma":0.0005129571,"threshold_uncertainty_score":0.40502393},"labels":[],"label_agreement":null},{"id":"W1966322892","doi":"10.1057/palgrave.jors.2601363","title":"An automated surface surveillance system","year":2002,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Industrial Vision Systems and Defect Detection","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Department of National Defence; University of Ottawa","funders":"","keywords":"Computer science; Information system; Operations research; Engineering","score_opus":0.0663606705683462,"score_gpt":0.3445808029151294,"score_spread":0.27822013234678317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966322892","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.9953806,0.00041889097,0.00058952096,0.0004018825,0.0012634313,0.00019618384,0.0000116717265,0.00013512177,0.0016026925],"genre_scores_gemma":[0.998744,0.000044464807,0.00026644696,0.000013804856,0.00057731906,0.0000016000217,5.0508544e-7,0.000013713826,0.00033816256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981072,0.0003539939,0.00032611287,0.000067984474,0.000959109,0.00018561468],"domain_scores_gemma":[0.9988676,0.00015337636,0.000055509965,0.0001704089,0.00066506723,0.000088077155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029616365,0.000069662914,0.00013595576,0.000029292954,0.00035019775,0.00016252103,0.0002581319,0.00010274125,0.00007027744],"category_scores_gemma":[0.000110637484,0.00004379426,0.00015858456,0.00039286722,0.000039063878,0.0002551313,0.000020010608,0.00053794775,0.000035595447],"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.000017226948,0.00005507898,0.001069808,0.00007171847,0.00013970505,0.0000062979184,0.000909005,0.5769297,0.08295012,0.00035217925,0.33690885,0.0005903132],"study_design_scores_gemma":[0.00036660206,0.000088878944,0.002102743,0.000069312824,0.0000023785185,0.00010311903,0.00055795634,0.98485196,0.0029400038,0.00000580624,0.008840101,0.00007115698],"about_ca_topic_score_codex":0.000015630196,"about_ca_topic_score_gemma":0.000002678287,"teacher_disagreement_score":0.40792224,"about_ca_system_score_codex":0.00034267106,"about_ca_system_score_gemma":0.000051021423,"threshold_uncertainty_score":0.26934734},"labels":[],"label_agreement":null},{"id":"W1969787279","doi":"10.1057/jors.2013.114","title":"A comparison of several enumerative algorithms for Sudoku","year":2013,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université Laval","funders":"Max-Planck-Gesellschaft","keywords":"Backtracking; Integer programming; Grid; Algorithm; Integer (computer science); Benchmark (surveying); Computer science; Set (abstract data type); Constraint (computer-aided design); Linear programming; Mathematics; Column (typography); Mathematical optimization","score_opus":0.09510289117562633,"score_gpt":0.40199805820218587,"score_spread":0.30689516702655956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969787279","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.9728655,0.0009166356,0.021390839,0.0020384877,0.00080981344,0.0009226784,0.00004238341,0.00001230123,0.0010013316],"genre_scores_gemma":[0.99579126,0.000020459767,0.0033044207,0.000028626488,0.00026350567,0.000029032873,0.0000016359531,0.000010148401,0.0005509327],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986536,0.00015452564,0.00036739957,0.000052384567,0.00059645285,0.00017565853],"domain_scores_gemma":[0.99842566,0.0003245115,0.000071199094,0.0001002157,0.001017699,0.000060698585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001527526,0.000067715984,0.00018689774,0.000032846336,0.00020939777,0.00006466095,0.00028994572,0.000058598147,0.000094389274],"category_scores_gemma":[0.00014598596,0.00004226905,0.00028374285,0.0001792077,0.00010838697,0.00024837066,0.00003083872,0.00038225047,0.0000059184567],"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.000081708145,0.00032495835,0.0038973512,0.00032588004,0.0011595407,6.3766555e-7,0.020244662,0.21419635,0.19104232,0.02274452,0.5436751,0.002306941],"study_design_scores_gemma":[0.0017978245,0.00055351434,0.010318569,0.00025155616,0.000031502255,0.00003821984,0.009702854,0.87145364,0.073471166,0.01574857,0.016373403,0.0002592024],"about_ca_topic_score_codex":0.000010130022,"about_ca_topic_score_gemma":0.0000016826081,"teacher_disagreement_score":0.65725726,"about_ca_system_score_codex":0.00008216316,"about_ca_system_score_gemma":0.00010919098,"threshold_uncertainty_score":0.17236818},"labels":[],"label_agreement":null},{"id":"W1981300442","doi":"10.1057/jors.2010.173","title":"Optimal inspection intervals for safety systems with partial inspections","year":2010,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":13,"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","funders":"","keywords":"IEC 61508; Warranty; Reliability engineering; Safety instrumented system; Reliability (semiconductor); Computer science; Downtime; Functional safety; Purchasing; Risk analysis (engineering); System safety; Work (physics); Operations research; Operations management; Work in process; Engineering; Business","score_opus":0.025236050826913263,"score_gpt":0.309776259610299,"score_spread":0.2845402087833857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981300442","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.5292868,0.00013619903,0.45801276,0.0057677925,0.003657183,0.0012533705,0.000051656207,0.00008561172,0.0017486335],"genre_scores_gemma":[0.9845604,0.00012362942,0.014039221,0.000024113897,0.000852105,0.00004028046,0.000003874668,0.000017241777,0.00033915744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888647,0.000061825725,0.00029756635,0.00008013707,0.00049229444,0.00018173539],"domain_scores_gemma":[0.99840766,0.00017932882,0.00005749913,0.00013750239,0.001153193,0.00006484352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018653461,0.00007142515,0.00011551154,0.000038438488,0.00049576076,0.0001532559,0.0002006239,0.00008056503,0.000021327402],"category_scores_gemma":[0.00035885,0.000043046966,0.0001591138,0.00024252418,0.00016420195,0.00037474552,0.000025592046,0.0007401455,0.0000020428333],"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.00007908348,0.000043667493,0.00018739936,0.00003282901,0.00008335779,2.2008624e-7,0.0004566452,0.9687491,0.008816007,0.0052367626,0.016236266,0.00007866094],"study_design_scores_gemma":[0.000856877,0.0002562558,0.0016278096,0.00008934451,0.00002009107,0.00009615113,0.000794179,0.9538182,0.0037902442,0.0002456607,0.0382957,0.00010949341],"about_ca_topic_score_codex":0.000011083468,"about_ca_topic_score_gemma":0.000023777595,"teacher_disagreement_score":0.4552736,"about_ca_system_score_codex":0.00021749512,"about_ca_system_score_gemma":0.00020816844,"threshold_uncertainty_score":0.3813041},"labels":[],"label_agreement":null},{"id":"W1987070476","doi":"10.1057/palgrave.jors.2601894","title":"Incorporating operations research techniques to evaluate information systems impact on healthcare","year":2004,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Canadian Hospice Palliative Care Association; Home and Community Care Support Services; Statistics Canada; University of Toronto","funders":"","keywords":"Information system; Health care; Information technology; Computer science; Project management; Operations research; Information and Communications Technology; Scheduling (production processes); Purchasing; Healthcare system; Management science; Risk analysis (engineering); Operations management; Systems engineering; Business; Engineering; Economics","score_opus":0.24612224094520702,"score_gpt":0.48421707755483506,"score_spread":0.23809483660962805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987070476","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.7712733,0.0002760974,0.01027682,0.20650697,0.0023526219,0.0036709602,0.00009230108,0.00007827665,0.005472664],"genre_scores_gemma":[0.99413073,0.000035754885,0.0013525009,0.0019993684,0.0022572586,0.00004921224,0.00002495227,0.000013124447,0.00013709889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957227,0.00016663436,0.00059870246,0.00014091776,0.002990199,0.0003808201],"domain_scores_gemma":[0.99109536,0.00014026229,0.00014387096,0.00031238634,0.008256648,0.00005144572],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.011549524,0.00012868177,0.00017262028,0.00041249272,0.0016579432,0.0018198736,0.00087598374,0.00009933797,0.00004470236],"category_scores_gemma":[0.0021676396,0.00007408747,0.00016992555,0.0019627986,0.00015610056,0.0035840222,0.0003983257,0.0011330511,0.00020708649],"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.00033391465,0.0003705755,0.0019218691,0.0003753303,0.00013448465,0.000005536635,0.0013652346,0.4222022,0.007079078,0.33401465,0.2256725,0.0065246243],"study_design_scores_gemma":[0.004976695,0.0030725477,0.06520134,0.0118881855,0.00012579888,0.00036188582,0.02495289,0.1820478,0.018453714,0.07308198,0.6134856,0.0023516042],"about_ca_topic_score_codex":0.0024420936,"about_ca_topic_score_gemma":0.00010108078,"teacher_disagreement_score":0.38781306,"about_ca_system_score_codex":0.0008001038,"about_ca_system_score_gemma":0.0012181957,"threshold_uncertainty_score":0.9996418},"labels":[],"label_agreement":null},{"id":"W1987229601","doi":"10.1057/palgrave.jors.2601742","title":"Minisum collection depots location problem with multiple facilities on a network","year":2004,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":24,"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","funders":"","keywords":"Lagrangian relaxation; Computer science; Facility location problem; Service (business); Set (abstract data type); Tree network; Mathematical optimization; Purchasing; Operations research; Node (physics); Network planning and design; Relaxation (psychology); Tree (set theory); Branch and bound; Flow network; Computer network; Mathematics; Algorithm; Operations management; Engineering","score_opus":0.05802353771575256,"score_gpt":0.29560488966094006,"score_spread":0.2375813519451875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987229601","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.8766805,0.00017479119,0.013038338,0.09619011,0.0010574795,0.0017451212,0.0000052421237,0.000048867005,0.01105954],"genre_scores_gemma":[0.9935076,0.00003470558,0.0017274488,0.0010849978,0.0008174108,0.000030941916,0.000006370251,0.000009445364,0.0027810389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99801177,0.00004707833,0.00031085618,0.0001346883,0.0012596492,0.00023594189],"domain_scores_gemma":[0.99806184,0.00005998678,0.00010161081,0.00015217156,0.0016060564,0.000018327888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019204741,0.00009711744,0.0001054657,0.00008005051,0.000910662,0.00027759952,0.00027497677,0.000047877253,0.00009204506],"category_scores_gemma":[0.00032228944,0.000059827747,0.00011652865,0.0009679717,0.00011569363,0.00069181685,0.00008797679,0.00037679472,0.000059778857],"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.00023907582,0.00027792435,0.0049056355,0.00015505234,0.00011597197,0.0000012412784,0.000644404,0.87104106,0.0002106088,0.026348189,0.09572556,0.00033527706],"study_design_scores_gemma":[0.011373241,0.0010445267,0.2103162,0.0016839163,0.00015610896,0.000040488834,0.019626534,0.112037756,0.001218721,0.041837815,0.5995615,0.0011031762],"about_ca_topic_score_codex":0.0005797337,"about_ca_topic_score_gemma":0.0009490114,"teacher_disagreement_score":0.7590033,"about_ca_system_score_codex":0.00028089553,"about_ca_system_score_gemma":0.00035734454,"threshold_uncertainty_score":0.7004168},"labels":[],"label_agreement":null},{"id":"W1989080137","doi":"10.1057/palgrave.jors.2602305","title":"Solving school bus routing problems through integer programming","year":2006,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":101,"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é de Montréal; HEC Montréal","funders":"","keywords":"Vehicle routing problem; Integer programming; Routing (electronic design automation); Mathematical optimization; Purchasing; Computer science; Integer (computer science); Linear programming; Scheduling (production processes); Operations research; Mathematics; Engineering; Computer network; Operations management","score_opus":0.05082829012856907,"score_gpt":0.35152154272370767,"score_spread":0.30069325259513857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989080137","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.21956629,0.0023039335,0.75826293,0.0077293436,0.0013944461,0.0011758852,0.00000851567,0.00020995145,0.009348728],"genre_scores_gemma":[0.68963,0.00009279543,0.30813923,0.000089477704,0.0010647061,0.0000137625575,0.0000024236394,0.00004412321,0.000923515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974034,0.00029960962,0.0005734067,0.00011867578,0.0011916789,0.00041323708],"domain_scores_gemma":[0.9981661,0.000381597,0.000115126684,0.00017811304,0.0010831539,0.00007595222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049402234,0.00012326654,0.0001699653,0.00004698829,0.0005924508,0.00037505873,0.00045560865,0.00010301887,0.00007778617],"category_scores_gemma":[0.001115635,0.00008624888,0.00025658045,0.0007040255,0.00011549976,0.0005957288,0.00012598644,0.0012638762,0.000009540065],"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.000004282629,0.000039896575,0.002683036,0.00004321626,0.00007146976,0.0000015851222,0.00081707374,0.9640953,0.013537849,0.001589481,0.016041938,0.0010748608],"study_design_scores_gemma":[0.0010836056,0.00008299608,0.0045076404,0.0005704562,0.000028202974,0.00013694004,0.001355917,0.951883,0.009341685,0.003106412,0.02756874,0.00033436206],"about_ca_topic_score_codex":0.000037322134,"about_ca_topic_score_gemma":0.0000061789733,"teacher_disagreement_score":0.4700637,"about_ca_system_score_codex":0.00050759234,"about_ca_system_score_gemma":0.00030647375,"threshold_uncertainty_score":0.5490984},"labels":[],"label_agreement":null},{"id":"W1989455494","doi":"10.1057/palgrave.jors.2602471","title":"A finite horizon model for repairable systems with repair restrictions","year":2007,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Component (thermodynamics); Operations research; Time horizon; Computer science; Purchasing; Function (biology); Reliability engineering; Engineering; Mathematical optimization; Operations management; Mathematics","score_opus":0.045504795346182736,"score_gpt":0.31273260420822396,"score_spread":0.2672278088620412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989455494","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.025829084,0.0003017712,0.9706861,0.0010139414,0.00032260563,0.0005710232,0.000015841,0.000048758408,0.0012109043],"genre_scores_gemma":[0.90950716,0.0005810217,0.08477406,0.000053465854,0.0005122094,0.00004331438,0.000005003877,0.00003247885,0.00449132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986868,0.000045249955,0.00032081158,0.00008348483,0.00062241266,0.00024124599],"domain_scores_gemma":[0.9979259,0.00043816268,0.00005482527,0.00017117025,0.0013377926,0.000072142924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003999299,0.000067109024,0.00010750852,0.000049641792,0.00039270116,0.00007540429,0.00016805086,0.00007407861,0.0000030704095],"category_scores_gemma":[0.00055647606,0.00004084069,0.00020355951,0.00036459655,0.000075502656,0.00029257694,0.000020604482,0.0004176317,8.613897e-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.000051739884,0.000026135702,0.00008543213,0.00004371841,0.000058333957,5.0728914e-7,0.000247795,0.95457023,0.00045837747,0.0022996867,0.042118065,0.0000399918],"study_design_scores_gemma":[0.00030820837,0.0001619382,0.00013472846,0.000079828016,0.000010733466,0.000015921438,0.00042226992,0.9925394,0.00014761748,0.0004124706,0.005716136,0.0000507463],"about_ca_topic_score_codex":0.000010706769,"about_ca_topic_score_gemma":0.000013514025,"teacher_disagreement_score":0.885912,"about_ca_system_score_codex":0.00035911138,"about_ca_system_score_gemma":0.00029664306,"threshold_uncertainty_score":0.30203795},"labels":[],"label_agreement":null},{"id":"W1995340813","doi":"10.1057/jors.2013.170","title":"A column generation algorithm for tactical timber transportation planning","year":2014,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":28,"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":"Column generation; Operations research; Truck; Computer science; Time horizon; Scheduling (production processes); Flow network; Heuristics; Engineering; Operations management; Economics; Finance; Mathematical optimization","score_opus":0.08738142139463055,"score_gpt":0.39749695608852875,"score_spread":0.3101155346938982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995340813","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.03530289,0.000051225637,0.9628641,0.0010775095,0.0003307087,0.00019159733,0.000011249729,0.000014268143,0.00015646179],"genre_scores_gemma":[0.29186904,0.000027617683,0.70591354,0.00019355884,0.0014952862,0.000024299436,0.000020146137,0.00003225805,0.00042421662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985199,0.00021360084,0.0003259734,0.000078710465,0.0006774539,0.00018434951],"domain_scores_gemma":[0.9984297,0.00052277633,0.00005806847,0.00009229381,0.0008265729,0.00007058387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037059868,0.000069176895,0.00011550111,0.000035992867,0.0003437377,0.00011794423,0.00017160014,0.00008484248,0.0000314551],"category_scores_gemma":[0.0004966834,0.000052620195,0.0001701605,0.00021085437,0.00005181127,0.00024576084,0.00000817224,0.00040968612,0.0000018893686],"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.0000047178078,0.000020927533,0.00018525784,0.000016315702,0.000059022892,2.4350223e-7,0.0007049784,0.95049095,0.0095782345,0.0005946489,0.03181213,0.0065325885],"study_design_scores_gemma":[0.0004238955,0.000052722702,0.0011894004,0.00002391773,0.000012089303,0.0000073640267,0.00008127376,0.985816,0.0032530476,0.00020579503,0.008876183,0.000058326892],"about_ca_topic_score_codex":0.0000016196472,"about_ca_topic_score_gemma":0.0000014479094,"teacher_disagreement_score":0.25695053,"about_ca_system_score_codex":0.00017325931,"about_ca_system_score_gemma":0.0001269847,"threshold_uncertainty_score":0.26437873},"labels":[],"label_agreement":null},{"id":"W1999614211","doi":"10.1057/palgrave.jors.2601590","title":"Exact solution of the generalized routing problem through graph transformations","year":2003,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Graph traversal; Vehicle routing problem; Mathematical optimization; Computer science; Graph; Tree traversal; Scheduling (production processes); Routing (electronic design automation); Mathematics; Combinatorics; Theoretical computer science; Algorithm","score_opus":0.06518996431258268,"score_gpt":0.35665408507138946,"score_spread":0.2914641207588068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999614211","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.25277025,0.0008789525,0.7270448,0.007870351,0.00087579736,0.0009817462,0.000027021331,0.000042895063,0.009508182],"genre_scores_gemma":[0.84294814,0.00030683543,0.15631004,0.00008271962,0.00009788688,0.000008042282,0.000001176602,0.00001878052,0.0002264032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974033,0.00076003635,0.00053928106,0.0000656486,0.000998244,0.00023345476],"domain_scores_gemma":[0.9986029,0.00026971602,0.00012722246,0.00018337683,0.0007749162,0.000041817184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045948424,0.00008752468,0.00014337296,0.00003471109,0.0006072943,0.00007009522,0.00036964208,0.00007921074,0.000057406633],"category_scores_gemma":[0.0005681177,0.00005151903,0.00035734585,0.0007575324,0.00013541243,0.00041244025,0.000032898424,0.0006614179,0.0000011027846],"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.000004911621,0.00003687574,0.0005009025,0.00004033314,0.00011071747,9.349337e-8,0.003250176,0.936942,0.036630176,0.0154928295,0.006804238,0.00018677693],"study_design_scores_gemma":[0.0029575306,0.00011637206,0.0059643593,0.0005007114,0.0001006721,0.00014737333,0.002269519,0.7826799,0.1695546,0.02112997,0.014181809,0.0003971398],"about_ca_topic_score_codex":0.000009071856,"about_ca_topic_score_gemma":0.000003147205,"teacher_disagreement_score":0.59017783,"about_ca_system_score_codex":0.00020448555,"about_ca_system_score_gemma":0.00032345,"threshold_uncertainty_score":0.46708786},"labels":[],"label_agreement":null},{"id":"W2000827343","doi":"10.1057/palgrave.jors.2602398","title":"The multiple location of transfer points","year":2007,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"McMaster University; University of Toronto","funders":"","keywords":"Facility location problem; 1-center problem; Transfer (computing); Computer science; Point (geometry); Operations research; Minimax; Set (abstract data type); Location model; Scheduling (production processes); Mathematical optimization; Mathematics","score_opus":0.07398700312680562,"score_gpt":0.33751123393688454,"score_spread":0.2635242308100789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000827343","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.90476847,0.00050476054,0.017214706,0.06959524,0.001321962,0.0007192165,0.000002886338,0.000011186627,0.0058615897],"genre_scores_gemma":[0.9977775,0.00007522695,0.00019393825,0.0006618886,0.0004846028,0.000002656596,0.0000020134698,0.0000052318646,0.0007969304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99808484,0.000042238473,0.00043528999,0.00007066177,0.0011827501,0.00018423954],"domain_scores_gemma":[0.9969454,0.00020270151,0.00006166087,0.00016517892,0.002612085,0.000012999764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00840306,0.000056358433,0.0000757139,0.00005584074,0.0006299951,0.000119778284,0.00046641193,0.00003212862,0.00008896316],"category_scores_gemma":[0.0011674179,0.000030280047,0.00015904428,0.0007381232,0.00017202382,0.00048048864,0.00009267588,0.0002693011,0.000021975773],"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.0008869363,0.0010103288,0.042622965,0.0008180718,0.0007417022,0.0000027663568,0.0033710839,0.039167054,0.025531026,0.4380202,0.4260116,0.021816254],"study_design_scores_gemma":[0.0020098314,0.000063915315,0.2872499,0.00019065868,0.000056621906,0.0000040759933,0.008285755,0.06051027,0.0042246543,0.007039842,0.6301234,0.00024111965],"about_ca_topic_score_codex":0.00017472563,"about_ca_topic_score_gemma":0.00034785894,"teacher_disagreement_score":0.43098035,"about_ca_system_score_codex":0.00007608273,"about_ca_system_score_gemma":0.00011869134,"threshold_uncertainty_score":0.48454762},"labels":[],"label_agreement":null},{"id":"W2010499157","doi":"10.1057/jors.2008.144","title":"Enterprise risk management: coping with model risk in a large bank","year":2009,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Credit Risk and Financial Regulations","field":"Economics, Econometrics and Finance","cited_by":148,"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","funders":"","keywords":"Risk management; Coping (psychology); Project management; Enterprise risk management; Business; Risk analysis (engineering); Computer science; Economics; Finance; Management; Psychology","score_opus":0.0387498835096953,"score_gpt":0.30276072157877976,"score_spread":0.26401083806908443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010499157","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.9088262,0.0015050357,0.07440925,0.0062693493,0.00015450468,0.00042461924,0.00021894182,0.0000058259825,0.008186323],"genre_scores_gemma":[0.98894495,0.0029943855,0.0067862193,0.00013581045,0.00016272147,0.0000058580113,0.0000024506978,0.000007927345,0.00095967134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9987909,0.00005896405,0.0004807221,0.00015040982,0.00024885335,0.0002701253],"domain_scores_gemma":[0.9991889,0.00008120883,0.00029643485,0.0001908001,0.00018111426,0.00006156546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031861754,0.00007819081,0.00018773376,0.00013781372,0.00047919384,0.00011510669,0.00033458462,0.000056628396,0.000044109373],"category_scores_gemma":[0.00023633466,0.00005776516,0.0002007752,0.00047224894,0.00006276338,0.00032426347,0.00006607629,0.0006931075,0.000014678051],"study_design_candidate":"observational","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.00018872782,0.00059257227,0.398283,0.000016932985,0.0001593759,0.00000937554,0.0041858223,0.15428436,0.000015923248,0.40775433,0.032475356,0.0020342006],"study_design_scores_gemma":[0.0019605868,0.00015884085,0.6869631,0.00007879353,0.000011121327,0.0000073833307,0.00027657556,0.19139974,0.000011458458,0.09942542,0.019560186,0.00014681692],"about_ca_topic_score_codex":0.000034962937,"about_ca_topic_score_gemma":0.000040265542,"teacher_disagreement_score":0.30832893,"about_ca_system_score_codex":0.00026361892,"about_ca_system_score_gemma":0.000107627406,"threshold_uncertainty_score":0.368562},"labels":[],"label_agreement":null},{"id":"W2012576518","doi":"10.1057/palgrave.jors.2601622","title":"Obituary Stafford Beer","year":2003,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Military History and Strategy","field":"Social Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Liverpool John Moores University; Royal Society","keywords":"Obituary; Operations research; Management; Computer science; Engineering; Philosophy; Economics; Theology","score_opus":0.12875391369534012,"score_gpt":0.425615443532944,"score_spread":0.2968615298376039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012576518","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.63025635,0.0032758696,0.0005544503,0.03165794,0.0018162169,0.0005157661,0.000013706438,0.000012303882,0.33189738],"genre_scores_gemma":[0.96947306,0.00043645376,0.0013032886,0.00040980396,0.0004886039,0.000002743967,4.1644586e-7,0.000005008468,0.027880613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967657,0.0011382242,0.0002197736,0.00007504918,0.0015516095,0.0002496832],"domain_scores_gemma":[0.9984749,0.00034429887,0.000055665038,0.00010838177,0.00088432315,0.00013245005],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008353266,0.000047217665,0.00008669234,0.000025443656,0.0018576006,0.00006760708,0.00040152363,0.000069664544,0.0011972684],"category_scores_gemma":[0.0013502983,0.000030524294,0.00024018239,0.00031082964,0.0005357965,0.00035357595,0.000025066269,0.0005859078,0.000018681594],"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.000025728928,0.0001484939,0.001316911,0.000007954324,0.000069710644,0.000005599549,0.021507837,0.0004428953,0.0017477866,0.50014806,0.47417307,0.000405988],"study_design_scores_gemma":[0.00020725449,0.00006945363,0.0011838119,0.000015306781,0.0000045008587,0.000008195574,0.011725335,0.000026630389,0.00018663595,0.013832016,0.9726864,0.000054473898],"about_ca_topic_score_codex":0.00014377685,"about_ca_topic_score_gemma":0.00018782697,"teacher_disagreement_score":0.4985133,"about_ca_system_score_codex":0.00035765948,"about_ca_system_score_gemma":0.0025311774,"threshold_uncertainty_score":0.99971575},"labels":[],"label_agreement":null},{"id":"W2015416155","doi":"10.1057/jors.2009.150","title":"An evaluation of the applicability of system dynamics to patient flow modelling","year":2009,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Discrete event simulation; Perspective (graphical); Project management; System dynamics; Operations research; Purchasing; Computer science; Operations management; Resource (disambiguation); Health care; Management science; Process management; Simulation; Business; Systems engineering; Engineering; Economics","score_opus":0.2285444489794828,"score_gpt":0.5310893255004253,"score_spread":0.30254487652094253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015416155","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.92837405,0.000050135037,0.059009373,0.010254366,0.00027399074,0.0016201311,0.00004599971,0.0000036507913,0.00036827914],"genre_scores_gemma":[0.97651947,0.000015590254,0.022950476,0.00026998724,0.00016385733,0.00002740288,0.0000072928333,0.0000069545977,0.000038970942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935583,0.002827562,0.0009778022,0.00012697643,0.002295037,0.00021430849],"domain_scores_gemma":[0.9900498,0.00034219061,0.0003596929,0.00041269368,0.008719258,0.00011641131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015047299,0.00007263319,0.00019694107,0.000046970432,0.0011993445,0.000020176607,0.00040761608,0.0001300488,0.000028460641],"category_scores_gemma":[0.00078140694,0.00004011913,0.000175355,0.00057172246,0.00006795972,0.00018168328,0.000065980756,0.00078108336,0.000001545603],"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.000038389113,0.00012332926,0.001252233,0.00006569762,0.000014868801,2.393127e-8,0.005072939,0.9851274,0.001177313,0.0045628585,0.00042590452,0.0021390542],"study_design_scores_gemma":[0.00028102333,0.00018383467,0.003617428,0.0003080842,0.000015873891,0.0000011955387,0.006541732,0.98819965,0.00027657338,0.00047784022,0.000060854494,0.000035888625],"about_ca_topic_score_codex":0.00008716784,"about_ca_topic_score_gemma":0.00004745901,"teacher_disagreement_score":0.048145395,"about_ca_system_score_codex":0.0012001845,"about_ca_system_score_gemma":0.0030697426,"threshold_uncertainty_score":0.922451},"labels":[],"label_agreement":null},{"id":"W2023345879","doi":"10.1057/palgrave.jors.2601261","title":"Optimal component replacement decisions using vibration monitoring and the proportional-hazards model","year":2002,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":157,"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","funders":"","keywords":"Weibull distribution; Context (archaeology); Purchasing; Computer science; Preventive maintenance; Reliability engineering; Operations research; Operations management; Engineering; Statistics; Mathematics","score_opus":0.07724871446964189,"score_gpt":0.3347167128229625,"score_spread":0.2574679983533206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023345879","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.8017094,0.00078350777,0.18892983,0.0074780267,0.0003365866,0.0004959257,0.000005875699,0.000012375299,0.0002484448],"genre_scores_gemma":[0.951772,0.0017602796,0.045955043,0.000042781925,0.00022837032,0.000011871283,0.0000010374089,0.000011144374,0.00021750209],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828404,0.00012993233,0.00036429285,0.00008406528,0.0009769335,0.00016074066],"domain_scores_gemma":[0.99883795,0.00025261258,0.00006867768,0.00014564324,0.00063794147,0.00005717219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025479733,0.00007405561,0.00011166015,0.000030954536,0.0006185588,0.00015622431,0.00018452297,0.00004943834,0.000028033992],"category_scores_gemma":[0.00046306182,0.000040263993,0.00013526414,0.00017897789,0.00020810703,0.00036093334,0.00008175937,0.0004518313,0.0000011657553],"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.00003188939,0.000025953908,0.00007732969,0.000006974401,0.000039917417,2.1322822e-7,0.000730221,0.9910305,0.0037015318,0.0010697755,0.0031006658,0.00018500544],"study_design_scores_gemma":[0.00058278587,0.000020828005,0.0003540476,0.00006602655,0.000010668312,0.000024864863,0.00029486758,0.99692404,0.0008009179,0.0006570683,0.00021957685,0.000044296492],"about_ca_topic_score_codex":0.0000040467608,"about_ca_topic_score_gemma":4.2464055e-7,"teacher_disagreement_score":0.15006253,"about_ca_system_score_codex":0.00029484573,"about_ca_system_score_gemma":0.00009835264,"threshold_uncertainty_score":0.47575167},"labels":[],"label_agreement":null},{"id":"W2023863254","doi":"10.1057/palgrave.jors.2602469","title":"A tabu search heuristic for a routing problem arising in servicing of offshore oil and gas platforms","year":2007,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Heuristics; Pickup; Computer science; Subsea; Vehicle routing problem; Operations research; Submarine pipeline; Heuristic; Routing (electronic design automation); Marine engineering; Engineering; Algorithm; Computer network; Operating system","score_opus":0.055558270644770216,"score_gpt":0.36890622218435587,"score_spread":0.31334795153958567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023863254","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.92239004,0.00023836587,0.076053545,0.00077537267,0.00006936717,0.00015068664,0.000004995917,0.000008022561,0.0003095785],"genre_scores_gemma":[0.83455926,0.00014323585,0.16500857,0.000029114295,0.0001423035,0.000003031885,0.0000012748392,0.000021476457,0.00009171611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981502,0.00008350855,0.0005803946,0.00009388354,0.00075009215,0.00034190752],"domain_scores_gemma":[0.9978191,0.0011476256,0.000088529436,0.00010031205,0.00076639425,0.00007799384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013075143,0.000085055624,0.00019367183,0.00011670693,0.00023083614,0.000073979005,0.0002259632,0.00008484467,0.000005942545],"category_scores_gemma":[0.0008162279,0.00006171362,0.00011086944,0.00053400383,0.00008489139,0.00022447908,0.00009386655,0.0007121039,1.7775369e-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.000083380655,0.00005202089,0.012508177,0.0005314253,0.00009516111,0.0000027304714,0.010017332,0.9259923,0.035040654,0.001529646,0.00030210434,0.013845083],"study_design_scores_gemma":[0.00093216985,0.00007137058,0.007041941,0.00053643977,0.000009265378,0.000045125103,0.003192895,0.978439,0.008437554,0.0011160689,0.00008159026,0.00009661174],"about_ca_topic_score_codex":0.000020667869,"about_ca_topic_score_gemma":0.000023262168,"teacher_disagreement_score":0.08895503,"about_ca_system_score_codex":0.0002703218,"about_ca_system_score_gemma":0.00022914854,"threshold_uncertainty_score":0.45316097},"labels":[],"label_agreement":null},{"id":"W2023870045","doi":"10.1057/jors.2013.148","title":"A simulation case study to improve staffing decisions at mass immunization clinics for pandemic influenza","year":2013,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Influenza Virus Research Studies","field":"Medicine","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Staffing; Pandemic; Vaccination; Immunization; Pandemic influenza; Discrete event simulation; Medicine; Influenza pandemic; Transmission (telecommunications); Medical emergency; Environmental health; Business; Operations management; Coronavirus disease 2019 (COVID-19); Computer science; Nursing; Virology; Simulation; Disease; Infectious disease (medical specialty); Economics; Immunology","score_opus":0.2977615324184378,"score_gpt":0.5431305836028207,"score_spread":0.24536905118438296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023870045","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.9905069,0.00021540107,0.003822732,0.0019061818,0.0001396921,0.0033528851,0.00002040548,0.000008255883,0.000027561122],"genre_scores_gemma":[0.9890642,0.0000781191,0.00821094,0.0010363071,0.00041995957,0.0001457737,0.0000026798282,0.000027433274,0.0010145615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99617714,0.0004154286,0.0008263509,0.0002084306,0.0019523927,0.0004202693],"domain_scores_gemma":[0.9858989,0.0050270017,0.0002005383,0.00038258193,0.008232909,0.0002580714],"candidate_categories":["metaresearch","sts"],"consensus_categories":[],"category_scores_codex":[0.0063111815,0.00013578321,0.00030201895,0.00015142327,0.0015226783,0.00018324141,0.00031018863,0.00008732501,0.000085794694],"category_scores_gemma":[0.020774206,0.000083137835,0.0003342383,0.00060991157,0.00012872336,0.0004163815,0.0004631248,0.0008240413,0.00003250116],"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.0031560715,0.0027441615,0.25285485,0.00018079113,0.0025132804,0.00012926558,0.040973265,0.501297,0.13098168,0.00017901922,0.04608551,0.018905105],"study_design_scores_gemma":[0.025927234,0.012761154,0.12565146,0.0008393109,0.0004433926,0.0007739072,0.10582473,0.68782884,0.002778888,0.0021520252,0.03422129,0.00079774193],"about_ca_topic_score_codex":0.00009756516,"about_ca_topic_score_gemma":0.000035505833,"teacher_disagreement_score":0.18653186,"about_ca_system_score_codex":0.001100583,"about_ca_system_score_gemma":0.00093730196,"threshold_uncertainty_score":0.9997772},"labels":[],"label_agreement":null},{"id":"W2023919456","doi":"10.1057/palgrave.jors.2601370","title":"Response to reply to the comments of Ganjavi, Aouni and Wang 2002","year":2002,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Complex Systems and Decision Making","field":"Decision Sciences","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":"Laurentian University","funders":"","keywords":"Operations research; Computer science; Management science; Management; Sociology; Economics; Mathematics","score_opus":0.39276221393410937,"score_gpt":0.5070218270183282,"score_spread":0.11425961308421884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023919456","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.7479207,0.0008803994,0.0019193072,0.24692543,0.00043575492,0.0005106488,0.000024143332,0.0000024531837,0.0013812032],"genre_scores_gemma":[0.96749276,0.000019145335,0.0030583674,0.0060515576,0.00022586688,0.0000044525696,3.9522128e-8,0.0000072946336,0.02314051],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9919463,0.0015485605,0.0008922891,0.00019968623,0.005176976,0.00023622102],"domain_scores_gemma":[0.98994386,0.006277749,0.00024186414,0.00060839154,0.0027202307,0.0002079291],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.030691728,0.000081574406,0.0002329154,0.00016086927,0.0008331927,0.00053705054,0.0014318395,0.00003618466,0.0009901405],"category_scores_gemma":[0.01827907,0.000036667487,0.000244741,0.0012986506,0.00014053867,0.00023326384,0.00072826585,0.00040356154,0.00012517664],"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.00017548815,0.000043037646,0.00069109653,0.0000011413114,0.000020821333,0.0000020100772,0.004303971,0.0011256197,0.0048009832,0.00056952,0.98611814,0.0021481798],"study_design_scores_gemma":[0.0005208578,0.00032914118,0.03849694,0.00011013778,0.000004022142,0.00007946419,0.0045116306,0.0070460974,0.00033234933,0.0029135938,0.9455765,0.00007928026],"about_ca_topic_score_codex":0.000034463043,"about_ca_topic_score_gemma":0.000014045279,"teacher_disagreement_score":0.24087387,"about_ca_system_score_codex":0.000121542515,"about_ca_system_score_gemma":0.0001652716,"threshold_uncertainty_score":0.9999231},"labels":[],"label_agreement":null},{"id":"W2025851246","doi":"10.1057/jors.2010.178","title":"A spreadsheet decision support optimization model for railcar storage at Canadian Pacific Railway","year":2011,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Calgary; Canadian Pacific Railway (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Purchasing; Operations research; Decision support system; Product (mathematics); Computer science; Operations management; Business; Engineering","score_opus":0.10633479089231937,"score_gpt":0.3669484108489791,"score_spread":0.26061361995665977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025851246","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.09572055,0.00019694761,0.8544497,0.016977182,0.0017201231,0.002290319,0.00045731102,0.000044307446,0.02814356],"genre_scores_gemma":[0.82727396,0.00027367892,0.15765963,0.00034029226,0.00030867645,0.000024042694,0.000055620836,0.000022054759,0.014042029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782634,0.00018260365,0.00034714508,0.00013536605,0.0011745987,0.00033392306],"domain_scores_gemma":[0.9973126,0.00028881629,0.00014248627,0.0001272154,0.0018426911,0.00028621382],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0046199257,0.00007842282,0.00011888578,0.00010592322,0.0020667277,0.00011972606,0.00040786533,0.0001373559,0.00057097926],"category_scores_gemma":[0.0007735835,0.000058271024,0.00022859874,0.00036291947,0.00021677608,0.0004979774,0.00001937526,0.0002683471,0.000006371146],"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.00012751111,0.00005115997,0.0017239753,0.0000062847193,0.00003963156,0.0000022259221,0.04378498,0.8351111,0.000057902853,0.005040294,0.113848455,0.00020647679],"study_design_scores_gemma":[0.0012798925,0.00016145923,0.0038193658,0.00008193894,0.00004038289,0.000010297362,0.007621049,0.9441177,0.00009353939,0.0024495216,0.04009931,0.00022548951],"about_ca_topic_score_codex":0.0026204204,"about_ca_topic_score_gemma":0.015302327,"teacher_disagreement_score":0.73155344,"about_ca_system_score_codex":0.0006925074,"about_ca_system_score_gemma":0.0031395482,"threshold_uncertainty_score":0.9992325},"labels":[],"label_agreement":null},{"id":"W2027903764","doi":"10.1057/jors.2014.69","title":"Allocating operating funding in the public sector and the newsvendor problem","year":2014,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Newsvendor model; Public sector; Business; Economics; Audit; Government (linguistics); Value (mathematics); Finance; Public economics; Accounting; Marketing; Computer science","score_opus":0.08991959424061807,"score_gpt":0.31525455269580527,"score_spread":0.2253349584551872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027903764","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.54156053,0.00052802934,0.00092567556,0.42565072,0.0006576826,0.0015314252,9.586857e-7,0.000014834723,0.02913016],"genre_scores_gemma":[0.9896247,0.00003733478,0.0004673181,0.007402452,0.0019603323,0.000032077936,0.0000013769891,0.00001107651,0.0004633499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99761266,0.00040046,0.00039159745,0.00012717835,0.0011519846,0.00031614146],"domain_scores_gemma":[0.9984004,0.00074732694,0.00019312568,0.00018992573,0.00045342123,0.000015790563],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.019418046,0.000097444674,0.00013984894,0.000082949366,0.0012772281,0.0017932162,0.00082490407,0.00003369735,0.00008963251],"category_scores_gemma":[0.0018048335,0.000042022428,0.00015238425,0.00059072225,0.00026520813,0.0010381796,0.0004177334,0.00068864156,0.000008492406],"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.000054643737,0.00015868671,0.020440178,0.00020217172,0.00014827648,0.0000029956927,0.004411473,0.0025802325,0.0011432715,0.8253957,0.14087744,0.0045849034],"study_design_scores_gemma":[0.0057091163,0.000070708214,0.018126363,0.00038892956,0.000051820698,0.000045362016,0.027889527,0.35721964,0.000048594244,0.027209625,0.5629234,0.00031695873],"about_ca_topic_score_codex":0.00013797417,"about_ca_topic_score_gemma":0.00008809048,"teacher_disagreement_score":0.7981861,"about_ca_system_score_codex":0.000091281676,"about_ca_system_score_gemma":0.00009147655,"threshold_uncertainty_score":0.999243},"labels":[],"label_agreement":null},{"id":"W2030906319","doi":"10.1057/palgrave.jors.2602361","title":"Impact of the pheromone trail on the performance of ACO algorithms for solving the<i>car-sequencing</i>problem","year":2008,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"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é Laval; Université du Québec à Chicoutimi","funders":"","keywords":"Ant colony optimization algorithms; Computer science; Algorithm; Ant colony; Artificial intelligence; Purchasing; Machine learning; Mathematical optimization; Mathematics; Engineering; Operations management","score_opus":0.10655571609995261,"score_gpt":0.37194488080600396,"score_spread":0.26538916470605134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030906319","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.9917686,0.00015888359,0.0049428423,0.0023093724,0.00013891493,0.0004188182,0.000021429913,0.0000062789977,0.00023488632],"genre_scores_gemma":[0.9799526,0.00031445906,0.019094119,0.0000744469,0.00024183265,0.000013549908,5.9274805e-7,0.000023829989,0.00028457178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976981,0.00031599574,0.00047742188,0.000081670805,0.0011625766,0.00026421592],"domain_scores_gemma":[0.9970346,0.001410894,0.00019719401,0.00030141723,0.001011283,0.000044615044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056626904,0.0001129656,0.00018704159,0.000026404072,0.00078828644,0.00004199883,0.00083490013,0.00007041546,0.000034192628],"category_scores_gemma":[0.00076453236,0.00004644367,0.0005463371,0.00047309123,0.00033052536,0.00018198484,0.00008728749,0.0008185771,6.7698414e-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.000024149385,0.00003165708,0.0011872547,0.000031737658,0.00018781157,1.4677856e-7,0.0031159115,0.9199002,0.06790375,0.00019615934,0.007022862,0.00039837687],"study_design_scores_gemma":[0.0005912105,0.00028771232,0.018439641,0.00019990923,0.000021297348,0.000056905883,0.0005788743,0.9229761,0.0564428,0.000179862,0.00013515224,0.00009056911],"about_ca_topic_score_codex":0.000017950722,"about_ca_topic_score_gemma":0.000001221047,"teacher_disagreement_score":0.017252387,"about_ca_system_score_codex":0.00035837013,"about_ca_system_score_gemma":0.00065086706,"threshold_uncertainty_score":0.60629416},"labels":[],"label_agreement":null},{"id":"W2032871323","doi":"10.1057/palgrave.jors.2601752","title":"Weight-restricted DEA in action: from expert opinions to mathematical models","year":2004,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":36,"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 Alberta","funders":"","keywords":"Preference; Computer science; Data envelopment analysis; Operations research; Set (abstract data type); Value (mathematics); Purchasing; Process (computing); Action (physics); Mathematical optimization; Mathematics; Economics; Operations management; Statistics; Machine learning","score_opus":0.3440686376758279,"score_gpt":0.5149145855269718,"score_spread":0.17084594785114388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032871323","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.75455105,0.00024951305,0.0965987,0.1463781,0.0005115478,0.000357478,0.000028292525,0.000008830964,0.0013164759],"genre_scores_gemma":[0.9704509,0.000053645643,0.027196407,0.0010851647,0.0004696727,0.000009899414,0.0000020323794,0.000009934196,0.0007223634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99208677,0.0006403149,0.0009856453,0.00027701395,0.005690991,0.0003192591],"domain_scores_gemma":[0.9947341,0.0026100997,0.00018108028,0.0004959788,0.0017589708,0.00021977135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006875027,0.00010816518,0.000284668,0.0002893988,0.0005754158,0.00047868863,0.001635437,0.000105574436,0.00034976413],"category_scores_gemma":[0.005564713,0.00005993704,0.00043122945,0.002848601,0.00019397716,0.0006168476,0.00031577106,0.0008259294,0.00013346963],"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.0001257287,0.00106839,0.00079961505,0.0000031454713,0.00015796741,0.000019202529,0.010852423,0.8095242,0.015566179,0.05903086,0.10132007,0.001532261],"study_design_scores_gemma":[0.001823019,0.00020880291,0.011071272,0.0002935083,0.000019646679,0.000058042573,0.005169332,0.16934219,0.0042954492,0.79200566,0.015431526,0.00028155546],"about_ca_topic_score_codex":0.00013541868,"about_ca_topic_score_gemma":0.0000735656,"teacher_disagreement_score":0.7329748,"about_ca_system_score_codex":0.0006107757,"about_ca_system_score_gemma":0.0013540704,"threshold_uncertainty_score":0.6661883},"labels":[],"label_agreement":null},{"id":"W2035201919","doi":"10.1057/palgrave.jors.2602603","title":"The capacitated team orienteering and profitable tour problems","year":2008,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":162,"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; Polytechnique Montréal","funders":"","keywords":"Orienteering; Computer science; Operations research; Heuristic; Heuristics; Project management; Matching (statistics); The Internet; Purchasing; Operations management; Mathematical optimization; Engineering; Artificial intelligence; Mathematics; World Wide Web","score_opus":0.062302060283768806,"score_gpt":0.32529913499987456,"score_spread":0.2629970747161058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035201919","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.9723146,0.0018569047,0.017684205,0.0044474904,0.00059951394,0.0005530091,0.00000628508,0.0000462991,0.0024916779],"genre_scores_gemma":[0.9550995,0.0015527079,0.03961578,0.000063978194,0.0003420296,0.00001684815,8.0470994e-7,0.00003186789,0.0032764634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844086,0.00020675897,0.00027922713,0.00006700813,0.0007610376,0.00024511482],"domain_scores_gemma":[0.9986048,0.00042785774,0.00004798614,0.000125791,0.0007195813,0.00007403239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035634984,0.00007088262,0.000094715666,0.000025203793,0.0011518237,0.00012510167,0.00026935452,0.00004806614,0.000012398096],"category_scores_gemma":[0.0007592113,0.000039034847,0.000084269646,0.0003502338,0.0002014808,0.00024619713,0.0000773345,0.0006801106,0.00000204796],"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.000014881643,0.00003239627,0.00608154,0.000049980998,0.0001838088,0.0000023791154,0.0055734734,0.86359817,0.0251414,0.0011433691,0.097486645,0.0006919382],"study_design_scores_gemma":[0.0008965866,0.00010604869,0.012440088,0.00014005041,0.000012239953,0.00045263334,0.001699703,0.93405586,0.008417182,0.00076269766,0.040826254,0.00019065203],"about_ca_topic_score_codex":0.0000053871586,"about_ca_topic_score_gemma":0.0000022616027,"teacher_disagreement_score":0.070457675,"about_ca_system_score_codex":0.00013343318,"about_ca_system_score_gemma":0.00019254195,"threshold_uncertainty_score":0.8859013},"labels":[],"label_agreement":null},{"id":"W2035305502","doi":"10.1057/jors.2012.111","title":"An interval-coefficient fuzzy binary linear programming, the solution, and its application under uncertainties","year":2012,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Optimization and Mathematical Programming","field":"Engineering","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":"University of Regina","funders":"","keywords":"Interval (graph theory); Mathematical optimization; Fuzzy logic; Binary number; Mathematics; Linear programming; Fuzzy number; Computer science; Fuzzy set; Applied mathematics; Artificial intelligence","score_opus":0.05726540508139351,"score_gpt":0.3608952675132997,"score_spread":0.3036298624319062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035305502","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.5519722,0.0076044174,0.4128666,0.023567889,0.00095516775,0.0020910345,0.000010258593,0.00013574529,0.0007966787],"genre_scores_gemma":[0.9927939,0.00017299557,0.006390505,0.00012442977,0.00031093226,0.000023302993,0.0000025260292,0.000013691252,0.00016768131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875623,0.00012969019,0.00024561098,0.00005990808,0.0005717917,0.00023677341],"domain_scores_gemma":[0.999096,0.00014254374,0.000048106736,0.00012472567,0.00047891805,0.000109710476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024340504,0.00007376318,0.00008483394,0.00002851435,0.0004556456,0.0001145988,0.00024221608,0.000053621465,0.000017574388],"category_scores_gemma":[0.00014926615,0.00003958491,0.00009106289,0.00024326854,0.00014091973,0.0003577417,0.0000732197,0.00040791984,0.0000055568325],"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.00003999835,0.00089376396,0.0006426527,0.00029806758,0.00034795122,4.3385387e-7,0.016109977,0.8254018,0.0270485,0.08648297,0.025871165,0.016862739],"study_design_scores_gemma":[0.00024928185,0.00009746215,0.00081319275,0.000052955296,0.000020873491,0.00002965802,0.0029757668,0.97135,0.0012919997,0.0008458397,0.022167142,0.00010581734],"about_ca_topic_score_codex":0.0000022318964,"about_ca_topic_score_gemma":0.0000011637208,"teacher_disagreement_score":0.4408217,"about_ca_system_score_codex":0.00011713342,"about_ca_system_score_gemma":0.000060086077,"threshold_uncertainty_score":0.35045037},"labels":[],"label_agreement":null},{"id":"W2035828426","doi":"10.1057/jors.2014.98","title":"An algorithm and upper bounds for the weighted maximal planar graph problem","year":2014,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Advanced Manufacturing and Logistics Optimization","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":"Université de Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Heuristics; Integer programming; Planarity testing; Cutting-plane method; Algorithm; Theory of computation; Planar graph; Linear programming; Heuristic; Upper and lower bounds; Constructive; Mathematics; Computer science; Graph; Mathematical optimization; Combinatorics","score_opus":0.022674243508155736,"score_gpt":0.303632595344079,"score_spread":0.28095835183592327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035828426","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.0045754747,0.0002621467,0.99241316,0.002215083,0.00015946725,0.0002085011,0.000017040666,0.000012492675,0.00013664718],"genre_scores_gemma":[0.5449347,0.0008005662,0.4526209,0.0002232027,0.00094426266,0.000030110861,0.000013375645,0.000033259395,0.00039962507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991778,0.00006154666,0.0001565446,0.00006540779,0.00037749056,0.00016118103],"domain_scores_gemma":[0.9991117,0.0003721753,0.00003199962,0.00010764653,0.00032014734,0.0000563012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013605646,0.00006385547,0.00007649168,0.000024708548,0.0005483154,0.00014253288,0.00021325283,0.000047534402,0.000007815952],"category_scores_gemma":[0.00008721315,0.00003384435,0.00007904079,0.000084084204,0.00012141277,0.00018450702,0.000018831779,0.00034597938,4.2190027e-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.00003242395,0.00004367888,0.00009563579,0.00004314892,0.00015347426,3.1913805e-7,0.00078543404,0.94963497,0.001305955,0.012518522,0.020138951,0.015247467],"study_design_scores_gemma":[0.00041899557,0.00012965228,0.0012154104,0.000018408926,0.000013632034,0.000018390816,0.00018130813,0.9525356,0.00094147725,0.023608621,0.0208486,0.00006987019],"about_ca_topic_score_codex":0.000003448454,"about_ca_topic_score_gemma":0.0000016663687,"teacher_disagreement_score":0.54035926,"about_ca_system_score_codex":0.000053611515,"about_ca_system_score_gemma":0.000046873207,"threshold_uncertainty_score":0.42172542},"labels":[],"label_agreement":null},{"id":"W2036642374","doi":"10.1057/palgrave.jors.2602526","title":"Modelling and analysis of Canadian Forces strategic lift and pre-positioning options","year":2007,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Lift (data mining); Strategic planning; Operations research; Computer science; Airlift; Engineering; Business; Marketing","score_opus":0.07323123270736108,"score_gpt":0.32877240577378425,"score_spread":0.25554117306642316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036642374","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.94009787,0.0011229042,0.055323437,0.00090058876,0.000064642685,0.000116852345,0.00002458891,0.000005540781,0.0023435515],"genre_scores_gemma":[0.98745745,0.001035916,0.011325568,0.000024844545,0.000039309132,6.521904e-7,0.000004228153,0.000005114749,0.00010691838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992723,0.000036049092,0.00021243752,0.000045581775,0.00030277675,0.00013089525],"domain_scores_gemma":[0.9992992,0.00013780838,0.000034969988,0.00005115773,0.0003653709,0.00011147864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015789447,0.0000425298,0.000092713635,0.00031088127,0.00028057475,0.00009877277,0.00007867686,0.000044922723,0.00002566998],"category_scores_gemma":[0.000023588276,0.000031538955,0.00007971945,0.00083171786,0.00007178271,0.00015428578,0.000014391228,0.00024643284,1.1742831e-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.0000024432693,0.000003989018,0.0011704807,0.000011339551,0.00022555797,2.5377057e-7,0.0010712831,0.9929057,0.0006042189,0.003836384,0.00013496874,0.000033378594],"study_design_scores_gemma":[0.000093440576,0.00001830341,0.0037422914,0.000031094256,0.000050648327,0.000005982603,0.0004946826,0.9947041,0.00019984422,0.0004548448,0.0001695933,0.00003514422],"about_ca_topic_score_codex":0.0011716719,"about_ca_topic_score_gemma":0.0022034221,"teacher_disagreement_score":0.047359556,"about_ca_system_score_codex":0.00006262555,"about_ca_system_score_gemma":0.00012447449,"threshold_uncertainty_score":0.21579824},"labels":[],"label_agreement":null},{"id":"W2037425183","doi":"10.1057/palgrave.jors.2602356","title":"VLSN search algorithms for partitioning problems using matching neighbourhoods","year":2007,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of New Brunswick","funders":"","keywords":"Neighbourhood (mathematics); Matching (statistics); Computer science; Exponential function; Algorithm; Mathematical optimization; Class (philosophy); Theoretical computer science; Mathematics; Artificial intelligence; Statistics","score_opus":0.14358398482718118,"score_gpt":0.4266171361414274,"score_spread":0.2830331513142462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037425183","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.1583024,0.00018892846,0.83986884,0.00072336284,0.00034226984,0.00029438824,0.0000072362072,0.000020453763,0.00025209042],"genre_scores_gemma":[0.47565934,0.000055473552,0.5230635,0.000082699255,0.00089885795,0.0000055546234,0.000002566268,0.000040729614,0.00019129428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759054,0.00020870096,0.0005173794,0.000107943866,0.0011094043,0.000466018],"domain_scores_gemma":[0.9975907,0.0008447451,0.00007727778,0.00014289438,0.001214922,0.00012944723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014032365,0.00010236865,0.00015700643,0.0000896353,0.00080148433,0.0002262546,0.00035686782,0.0000993955,0.00004112665],"category_scores_gemma":[0.00045463038,0.0000771936,0.0002555991,0.00052618945,0.00009540274,0.00038133172,0.00008280661,0.00083227805,0.000001680559],"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.000009310842,0.00002356679,0.00049483014,0.000053733344,0.00008058356,8.0772907e-7,0.0014134446,0.9587601,0.03588764,0.00085038634,0.0009772652,0.0014483689],"study_design_scores_gemma":[0.00050979306,0.000048288177,0.0015587976,0.00014524425,0.000012371138,0.000056413035,0.00089627976,0.9828359,0.011295439,0.0015334514,0.0009971712,0.000110865636],"about_ca_topic_score_codex":0.000010437275,"about_ca_topic_score_gemma":0.0000025421625,"teacher_disagreement_score":0.31735694,"about_ca_system_score_codex":0.000490548,"about_ca_system_score_gemma":0.00029620665,"threshold_uncertainty_score":0.616445},"labels":[],"label_agreement":null},{"id":"W2041505992","doi":"10.1057/palgrave.jors.2602040","title":"Implementing the balanced scorecard using the analytic hierarchy process &amp; the analytic network process","year":2005,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":173,"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 à Trois-Rivières","funders":"","keywords":"Balanced scorecard; Analytic network process; Analytic hierarchy process; Computer science; Performance measurement; Process (computing); Process management; Dependency (UML); Set (abstract data type); Scarcity; Operations research; Risk analysis (engineering); Management science; Business; Engineering; Economics; Artificial intelligence; Marketing","score_opus":0.4029990021949929,"score_gpt":0.5727073674400269,"score_spread":0.16970836524503402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041505992","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.91165835,0.0009557603,0.011882873,0.07329622,0.0005689135,0.001056572,0.000017503384,0.00001013665,0.00055366004],"genre_scores_gemma":[0.99025786,0.0000620043,0.0032195074,0.0022726199,0.002768307,0.000020703586,0.0000011769007,0.000025544647,0.0013722772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9843957,0.0025203587,0.0017628596,0.00045470774,0.009823166,0.0010432476],"domain_scores_gemma":[0.9832516,0.00866783,0.001032236,0.0011967693,0.0056821764,0.00016942534],"candidate_categories":["metaresearch","sts","scholarly_communication"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.06652182,0.00024603787,0.00043130555,0.00014069775,0.006115627,0.0030374813,0.00528461,0.000094543364,0.00066460454],"category_scores_gemma":[0.013494923,0.000085894804,0.0008238227,0.003965654,0.0008698191,0.001001088,0.0010273925,0.0019762425,0.000038553804],"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.0001935465,0.00012473008,0.018235998,0.000019242423,0.0004154573,0.000004834514,0.013630065,0.84523624,0.0021009897,0.0012118404,0.10701266,0.011814415],"study_design_scores_gemma":[0.0010000778,0.000062902836,0.01498069,0.00027192774,0.00010637042,0.00029147966,0.015607748,0.8621515,0.00032579023,0.029146576,0.07576593,0.00028901207],"about_ca_topic_score_codex":0.000016676506,"about_ca_topic_score_gemma":0.00013022272,"teacher_disagreement_score":0.0785995,"about_ca_system_score_codex":0.00039050705,"about_ca_system_score_gemma":0.0018411452,"threshold_uncertainty_score":0.99799746},"labels":[],"label_agreement":null},{"id":"W2041693766","doi":"10.1057/jors.2011.134","title":"Automatic aircraft cargo load planning","year":2011,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science; Fuel efficiency; Purchasing; Pallet; Software; Operations research; Task (project management); Set (abstract data type); Project management; Integer programming; Linear programming; Moment (physics); Mathematical optimization; Industrial engineering; Simulation; Automotive engineering; Systems engineering; Engineering; Operations management; Operating system; Algorithm","score_opus":0.10699615674093656,"score_gpt":0.3363804880498422,"score_spread":0.22938433130890568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041693766","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.8621867,0.003885879,0.035860397,0.005245736,0.0036056128,0.0009400036,0.000024456132,0.0002462121,0.088005014],"genre_scores_gemma":[0.98202586,0.00010035909,0.016592663,0.00014281571,0.00020284056,0.0000037611608,7.647183e-7,0.000017769247,0.00091314205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986311,0.0000873301,0.0002459916,0.000048788534,0.0008088348,0.00017791653],"domain_scores_gemma":[0.99913234,0.00009974977,0.00003909995,0.00011266747,0.00054300245,0.000073133655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001592539,0.000062941996,0.000092074595,0.000033112712,0.00022781217,0.00007074047,0.0002996865,0.000055072418,0.00042845905],"category_scores_gemma":[0.00017263959,0.000041242718,0.00014737085,0.0002375593,0.00006772488,0.00021106961,0.000044477372,0.0005243643,0.00002098379],"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.00001579204,0.00010157633,0.0062439283,0.0001376578,0.00037005293,0.000010434804,0.027171465,0.65790224,0.0046018367,0.0021349671,0.29971132,0.0015987254],"study_design_scores_gemma":[0.0010094035,0.00014238861,0.021546563,0.00042692013,0.000025402414,0.00014151658,0.0014999625,0.94040203,0.005555236,0.0020631475,0.0269269,0.0002605426],"about_ca_topic_score_codex":0.000006203067,"about_ca_topic_score_gemma":0.0000013820921,"teacher_disagreement_score":0.28249976,"about_ca_system_score_codex":0.0001940007,"about_ca_system_score_gemma":0.00027372682,"threshold_uncertainty_score":0.4691326},"labels":[],"label_agreement":null},{"id":"W2050784217","doi":"10.1057/palgrave.jors.2602574","title":"A patient assignment algorithm for home care services","year":2008,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":123,"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":"","keywords":"Workload; Integer programming; Tabu search; Linear programming; Computer science; Algorithm; Mathematical optimization; Heuristic; Heuristics; Nurse scheduling problem; Project management; Operations research; Nursing; Mathematics; Medicine; Job shop scheduling; Economics; Schedule","score_opus":0.2117213361653014,"score_gpt":0.46105186763497386,"score_spread":0.24933053146967246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050784217","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.9099647,0.003619267,0.059417278,0.02317481,0.0020453641,0.0009001203,0.00020933527,0.000014299554,0.00065487303],"genre_scores_gemma":[0.933432,0.00010999599,0.06330845,0.0005172439,0.0006241677,0.000022845252,0.0000034360332,0.000009726046,0.0019721368],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99458295,0.00035190518,0.00054963405,0.00017303608,0.004059451,0.00028301417],"domain_scores_gemma":[0.99272954,0.0016816282,0.00021495218,0.0002770625,0.0049563674,0.00014043332],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.005632114,0.00007654205,0.00017375356,0.00009074653,0.0018056072,0.0002518363,0.0008219169,0.00006363025,0.00009263937],"category_scores_gemma":[0.0013123485,0.00004022374,0.000525247,0.0006321571,0.00019649825,0.0003073126,0.00017469248,0.00042108734,0.000026031948],"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.00024198828,0.0013991531,0.019376118,0.000060147406,0.0009396566,0.000027002809,0.08583694,0.07956588,0.006723623,0.0044799815,0.65221256,0.14913698],"study_design_scores_gemma":[0.005501955,0.0021751474,0.05175472,0.0003252509,0.00009174396,0.00060966425,0.07378464,0.29921043,0.008990126,0.04314557,0.5137364,0.0006743142],"about_ca_topic_score_codex":0.00001616787,"about_ca_topic_score_gemma":0.0000036968343,"teacher_disagreement_score":0.21964456,"about_ca_system_score_codex":0.00023241118,"about_ca_system_score_gemma":0.0010133189,"threshold_uncertainty_score":0.9994939},"labels":[],"label_agreement":null},{"id":"W2054446414","doi":"10.1057/palgrave.jors.2601440","title":"Using composite moving averages to forecast sales","year":2002,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Forecasting Techniques and Applications","field":"Decision Sciences","cited_by":9,"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 Calgary","funders":"","keywords":"Moving average; Exponential smoothing; Computer science; Simple (philosophy); Weighted arithmetic mean; Statistics; Operations research; Econometrics; Mathematics; Machine learning","score_opus":0.5716533084416737,"score_gpt":0.5276959159345209,"score_spread":0.043957392507152804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054446414","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.9234688,0.00019833056,0.037594818,0.03607279,0.00018706072,0.00035867954,0.000023778384,0.000012270979,0.0020834252],"genre_scores_gemma":[0.9098103,0.00002993998,0.086811356,0.000533107,0.0003206092,0.000004614454,3.3797815e-7,0.0000084171,0.0024813274],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961532,0.00026825446,0.00052270637,0.0001577906,0.0026692685,0.00022880985],"domain_scores_gemma":[0.99626565,0.0011777449,0.00017747418,0.00031347666,0.0019269303,0.00013872633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006530721,0.00007207548,0.00014526257,0.00011009144,0.0010594721,0.0005423719,0.0011845075,0.0000483623,0.00029348282],"category_scores_gemma":[0.002380201,0.000040423358,0.0002868623,0.0010370674,0.00015814778,0.00031106715,0.00038593737,0.00047107518,0.00006124237],"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.000023693783,0.0002113061,0.006905996,0.0000060298235,0.000060769602,0.0000043087034,0.0026909579,0.042421173,0.091213115,0.009024349,0.83514434,0.012293988],"study_design_scores_gemma":[0.0005663863,0.00030452062,0.018692585,0.00027952564,0.000018904486,0.00041885301,0.0017326456,0.7350399,0.011383622,0.042367633,0.1888695,0.00032594198],"about_ca_topic_score_codex":0.000014329944,"about_ca_topic_score_gemma":0.0000049719306,"teacher_disagreement_score":0.69261867,"about_ca_system_score_codex":0.0001780759,"about_ca_system_score_gemma":0.00011683907,"threshold_uncertainty_score":0.81487095},"labels":[],"label_agreement":null},{"id":"W2054669984","doi":"10.1057/palgrave.jors.2601420","title":"Some applications of the clustered travelling salesman problem","year":2002,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":88,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Computer science; Vehicle routing problem; Purchasing; Operations research; Scheduling (production processes); Traveling purchaser problem; Lin–Kernighan heuristic; Routing (electronic design automation); Mathematical optimization; Bottleneck traveling salesman problem; Engineering; Operations management; Algorithm; Computer network; Mathematics","score_opus":0.07207568656996226,"score_gpt":0.34042582006238425,"score_spread":0.268350133492422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054669984","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.28432262,0.008688932,0.6149587,0.07064986,0.0019009595,0.005338081,0.000121727615,0.00017174352,0.0138473585],"genre_scores_gemma":[0.88856137,0.0007876664,0.10754166,0.00019316179,0.00073583674,0.000027605656,0.0000010504114,0.000036916103,0.0021147276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982001,0.0002728288,0.00041184045,0.00006950199,0.00086942565,0.00017626531],"domain_scores_gemma":[0.9987128,0.00031845583,0.00010527139,0.00022971282,0.000580537,0.00005321653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023399326,0.00006985118,0.00011771362,0.00003770692,0.0003746184,0.000059374,0.00059215684,0.00006801683,0.00006675775],"category_scores_gemma":[0.00016806785,0.000041632222,0.00023283999,0.0005135805,0.00014563273,0.00017710096,0.00008309222,0.0006697426,0.000004573612],"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.000002694164,0.000057495086,0.00038378843,0.000061174425,0.000095393654,1.2929966e-7,0.0016676362,0.96159184,0.016482908,0.002600824,0.015592214,0.0014639163],"study_design_scores_gemma":[0.00054009777,0.000030322746,0.0018130493,0.00012789288,0.000021406455,0.000031227653,0.00039690666,0.97465193,0.011413245,0.00301713,0.007848187,0.00010858334],"about_ca_topic_score_codex":0.0000014522161,"about_ca_topic_score_gemma":9.866288e-7,"teacher_disagreement_score":0.60423875,"about_ca_system_score_codex":0.00015286937,"about_ca_system_score_gemma":0.000089888454,"threshold_uncertainty_score":0.29097354},"labels":[],"label_agreement":null},{"id":"W2056251021","doi":"10.1057/palgrave.jors.2601926","title":"Maximizing the value of an Earth observation satellite orbit","year":2005,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":149,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Satellite; Computer science; Operations research; Earth observation satellite; Orbit (dynamics); Profit (economics); Earth observation; Tabu search; Remote sensing; Geodesy; Aerospace engineering; Geology; Algorithm; Mathematics; Economics; Engineering","score_opus":0.09892549807221367,"score_gpt":0.36858711387949034,"score_spread":0.26966161580727666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056251021","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.4104065,0.0013484652,0.30669606,0.27615035,0.00065822067,0.0012003198,0.000010157367,0.00003646342,0.0034934848],"genre_scores_gemma":[0.6376398,0.0008617818,0.35589218,0.00233044,0.0005995004,0.000007388369,0.0000026567882,0.0000130963945,0.0026531196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683326,0.0006660608,0.0004024191,0.00011733403,0.0017607176,0.00022017388],"domain_scores_gemma":[0.9973949,0.00036189824,0.00016954266,0.0003515584,0.0016306349,0.00009141807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006440432,0.00006568097,0.00010499824,0.00004618281,0.0005830552,0.00032706457,0.0014658871,0.00004756887,0.000040677587],"category_scores_gemma":[0.00039174908,0.00003460256,0.00017767579,0.00065307535,0.00016406935,0.0013401757,0.00026073988,0.0005769152,0.000007318297],"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.00004496202,0.00042882844,0.0014291008,0.00003388603,0.00014841474,0.0000020696136,0.011897719,0.6087373,0.028760267,0.29614443,0.010054295,0.042318724],"study_design_scores_gemma":[0.0004810817,0.00017409671,0.015529597,0.00005434648,0.000004046773,0.00003365753,0.00035321296,0.93484133,0.007914087,0.0038560145,0.036680438,0.00007808236],"about_ca_topic_score_codex":0.0000133376025,"about_ca_topic_score_gemma":0.000008993135,"teacher_disagreement_score":0.32610402,"about_ca_system_score_codex":0.00008815046,"about_ca_system_score_gemma":0.00067710364,"threshold_uncertainty_score":0.4484448},"labels":[],"label_agreement":null},{"id":"W2062240916","doi":"10.1057/palgrave.jors.2601594","title":"A probabilistic one-centre location problem on a network","year":2003,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":18,"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","funders":"","keywords":"Probabilistic logic; Facility location problem; Computer science; Mathematical optimization; Scheduling (production processes); Operations research; Applied probability; Mathematics; Statistics; Artificial intelligence","score_opus":0.0849702469264187,"score_gpt":0.3123176196378173,"score_spread":0.2273473727113986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062240916","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.4976319,0.0009192571,0.0065551363,0.28403902,0.0045103002,0.0067994054,0.0000074557993,0.000110622685,0.19942687],"genre_scores_gemma":[0.9904231,0.00003360493,0.00120125,0.002867562,0.0010511527,0.000020717134,0.0000041306907,0.000012293746,0.004386213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99782115,0.00012119369,0.0003697884,0.00013842167,0.0012839835,0.0002654687],"domain_scores_gemma":[0.99778837,0.00007764176,0.000106825195,0.00019568263,0.0018104939,0.00002096104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004301259,0.00008832347,0.00010899625,0.000056953566,0.0006162494,0.00027374152,0.0003390544,0.000042908974,0.00050992955],"category_scores_gemma":[0.0011775836,0.000059339476,0.0001594822,0.0009270475,0.00008739886,0.0004893641,0.00008752598,0.00038964726,0.00016638364],"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.000041595464,0.00040947262,0.0012867671,0.0001668307,0.00008514741,5.35568e-7,0.00017782448,0.19952027,0.00008220109,0.5107325,0.28710335,0.00039351964],"study_design_scores_gemma":[0.0015354076,0.00008960335,0.015854686,0.000495079,0.0000706044,0.000003877969,0.0013949659,0.045645513,0.000063515865,0.06384075,0.8706904,0.00031558605],"about_ca_topic_score_codex":0.0000507614,"about_ca_topic_score_gemma":0.00008329213,"teacher_disagreement_score":0.58358705,"about_ca_system_score_codex":0.00020244297,"about_ca_system_score_gemma":0.00030165643,"threshold_uncertainty_score":0.55833715},"labels":[],"label_agreement":null},{"id":"W2063602291","doi":"10.1057/jors.2013.149","title":"Queueing Networks: A Fundamental Approach","year":2013,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Advanced Queuing Theory Analysis","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":"University of Regina","funders":"","keywords":"Queueing theory; Computer science; Operations research; Scheduling (production processes); Project management; Distributed computing; Mathematical optimization; Computer network; Mathematics; Systems engineering; Engineering","score_opus":0.04623458807439799,"score_gpt":0.31629052565665644,"score_spread":0.27005593758225843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063602291","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.89958453,0.00075302797,0.04523758,0.027356587,0.00082748994,0.0010165212,0.000001820794,0.00004637958,0.025176054],"genre_scores_gemma":[0.9905596,0.000023187253,0.0033829443,0.0019841937,0.002516002,0.000014514647,0.0000028096738,0.000016204021,0.0015005403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981725,0.00009298894,0.0003218459,0.000121476085,0.0010100192,0.00028117435],"domain_scores_gemma":[0.9982789,0.00018771167,0.00021557466,0.00017571525,0.0011201125,0.000021964013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031211374,0.00009248509,0.0001469938,0.00008107653,0.0007914191,0.0006654282,0.000592339,0.000050471674,0.00048747938],"category_scores_gemma":[0.0004925786,0.000056326746,0.00034533493,0.0007222919,0.00019315415,0.0019348022,0.00033171914,0.00066761347,0.00007125276],"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.00009397536,0.0005440905,0.013953425,0.00011422651,0.0007341617,0.000004880267,0.0006400882,0.46667594,0.008680863,0.17856348,0.32645974,0.0035351387],"study_design_scores_gemma":[0.0008640817,0.00002546984,0.007827545,0.000121957295,0.00006729559,0.000028501865,0.0045718644,0.89650863,0.000088471745,0.05082428,0.038811438,0.0002604494],"about_ca_topic_score_codex":0.000087937755,"about_ca_topic_score_gemma":0.000003344199,"teacher_disagreement_score":0.4298327,"about_ca_system_score_codex":0.00016202324,"about_ca_system_score_gemma":0.00008134451,"threshold_uncertainty_score":0.6416739},"labels":[],"label_agreement":null},{"id":"W2064908274","doi":"10.1057/jors.2013.106","title":"Health-based pharmaceutical pay-for-performance risk-sharing agreements","year":2013,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Pharmaceutical Economics and Policy","field":"Economics, Econometrics and Finance","cited_by":14,"is_retracted":false,"has_abstract":true,"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":"Actuarial science; Markov chain; Clinical trial; Risk analysis (engineering); Population; Health care; Business; Marketing; Computer science; Medicine; Economics; Environmental health","score_opus":0.22293858660637894,"score_gpt":0.4309106411635537,"score_spread":0.20797205455717477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064908274","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.8247374,0.0016941937,0.0033613073,0.1654205,0.0009814682,0.0011668704,0.00025273403,0.000008927034,0.002376535],"genre_scores_gemma":[0.9884897,0.0013486481,0.0022104182,0.0063267294,0.00066714955,0.000035594494,0.0000040927325,0.00001737967,0.0009002794],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834603,0.000061446044,0.00078347005,0.0001818048,0.00017399206,0.0004532478],"domain_scores_gemma":[0.9985506,0.00028519213,0.0003935337,0.00019509731,0.00032903205,0.00024655543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004735869,0.00009831335,0.00026288306,0.0000777329,0.0006554707,0.00022223216,0.0006242672,0.0000619057,0.0006106795],"category_scores_gemma":[0.00041867606,0.000068567824,0.00035291654,0.00020291212,0.00012203766,0.00039143118,0.00013037515,0.0008095724,0.00020322003],"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.00017273215,0.0005884543,0.40376273,0.0003492855,0.0007705932,5.594928e-7,0.0011867046,0.02734155,0.0005928381,0.10147718,0.44384408,0.019913288],"study_design_scores_gemma":[0.0022955677,0.00023070113,0.056567762,0.000058025016,0.0000064477495,0.0000057643488,0.000051211566,0.62081915,0.0007107843,0.029460153,0.28959534,0.00019911153],"about_ca_topic_score_codex":0.000094618656,"about_ca_topic_score_gemma":0.0000022609404,"teacher_disagreement_score":0.5934776,"about_ca_system_score_codex":0.00044848287,"about_ca_system_score_gemma":0.00034977045,"threshold_uncertainty_score":0.6686513},"labels":[],"label_agreement":null},{"id":"W2065524587","doi":"10.1057/jors.2011.95","title":"Environmentally friendly facility location with market competition","year":2011,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":14,"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":"Competition (biology); Facility location problem; Profit (economics); Industrial organization; Order (exchange); Monopoly; Economics; Production (economics); Purchasing; Business; Microeconomics; Environmental economics; Operations research; Operations management; Finance","score_opus":0.06595132098429969,"score_gpt":0.27430766250889377,"score_spread":0.2083563415245941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065524587","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.87966496,0.00015745687,0.021397974,0.019746674,0.0008514376,0.0012280227,0.000020273905,0.000035431687,0.076897755],"genre_scores_gemma":[0.99646366,0.000032710752,0.0008550957,0.00076539564,0.00023059241,0.000010836443,0.0000099799145,0.000005407476,0.0016263],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9982024,0.00006611249,0.0002973254,0.00012769837,0.0011317246,0.00017474675],"domain_scores_gemma":[0.9989273,0.000024357312,0.000099558514,0.00019450476,0.0007354763,0.000018825454],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0024991042,0.000084554755,0.000094344374,0.000060436978,0.00048091882,0.00012306987,0.00037380838,0.00003455506,0.003082733],"category_scores_gemma":[0.0001318124,0.00005267319,0.00011115538,0.00037024845,0.00020732159,0.0010193528,0.00015113615,0.00028858782,0.0001304066],"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.0016146785,0.0034606305,0.10516386,0.0009248466,0.0009377877,0.000013145565,0.00407393,0.019420274,0.004923233,0.1907872,0.66080064,0.007879753],"study_design_scores_gemma":[0.0016905828,0.0001920456,0.67072827,0.00014632219,0.000078364574,0.000013205927,0.0065413313,0.021596294,0.0005338728,0.003993099,0.29412726,0.00035935268],"about_ca_topic_score_codex":0.00024901875,"about_ca_topic_score_gemma":0.00010661847,"teacher_disagreement_score":0.5655644,"about_ca_system_score_codex":0.00014860104,"about_ca_system_score_gemma":0.000098703465,"threshold_uncertainty_score":0.9978286},"labels":[],"label_agreement":null},{"id":"W2065990064","doi":"10.1057/jors.2010.30","title":"Production planning with uncertainty in the quality of raw materials: a case in sawmills","year":2010,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":25,"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é Laval","funders":"","keywords":"Production planning; Time horizon; Production (economics); Computer science; Stochastic programming; Mathematical optimization; Product (mathematics); Capacity planning; Quality (philosophy); Operations research; Mathematics; Economics","score_opus":0.08852421422799558,"score_gpt":0.40937107740112694,"score_spread":0.3208468631731314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065990064","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.9978041,0.000024040815,0.0005039026,0.0012361956,0.00009905138,0.00020380493,0.0000019284498,0.0000027831484,0.00012420253],"genre_scores_gemma":[0.99600095,0.000013686786,0.0038310695,0.000026555206,0.000091002796,0.000007725545,8.8397485e-7,0.0000055486685,0.000022563318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987235,0.00022903507,0.00035069924,0.000049605613,0.0005260284,0.00012109568],"domain_scores_gemma":[0.99923795,0.0003167825,0.000059771464,0.00011177227,0.00025087487,0.000022864506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062808553,0.000048217986,0.00011326251,0.000038899278,0.00008743226,0.000059109374,0.00016276629,0.00004185547,0.000032016756],"category_scores_gemma":[0.0008283235,0.000023865903,0.00004457773,0.00031121582,0.00010603289,0.00015220171,0.00002178339,0.0005759714,4.1040624e-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.00008728911,0.00020581413,0.0009625604,0.00020197927,0.00004202695,0.000027781698,0.01263243,0.8292822,0.14826338,0.0053772354,0.0025203186,0.0003969754],"study_design_scores_gemma":[0.013312671,0.0011819737,0.069796085,0.0036884076,0.000101031284,0.008146991,0.1259112,0.5458376,0.20290071,0.021553243,0.0059330813,0.0016370165],"about_ca_topic_score_codex":0.000034615892,"about_ca_topic_score_gemma":0.00010421292,"teacher_disagreement_score":0.28344464,"about_ca_system_score_codex":0.000054997203,"about_ca_system_score_gemma":0.00009035218,"threshold_uncertainty_score":0.2502341},"labels":[],"label_agreement":null},{"id":"W2067892036","doi":"10.1057/palgrave.jors.2601062","title":"A comment on Chang and Dye (1999): EOQ model for deteriorating items with time-varying demand and partial backlogging","year":2001,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Quality and Supply Management","field":"Business, Management and Accounting","cited_by":14,"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","funders":"","keywords":"Economic order quantity; Operations research; Purchasing; Economics; Computer science; Mathematical economics; Microeconomics; Operations management; Mathematics; Business; Marketing","score_opus":0.09435567720227603,"score_gpt":0.3417681894229709,"score_spread":0.24741251222069485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067892036","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.84406054,0.00020895577,0.031127738,0.12280198,0.00009785007,0.00092590076,0.0000059191425,0.000012262835,0.000758871],"genre_scores_gemma":[0.98825604,0.00008824098,0.0025634256,0.007882228,0.00076122856,0.000025855365,0.0000044477024,0.000015169189,0.00040339172],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986483,0.0000537114,0.00025485604,0.00014226003,0.0006485577,0.0002523254],"domain_scores_gemma":[0.99918306,0.00023707013,0.00013676181,0.00009204951,0.00032498266,0.000026098603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035253316,0.00009945864,0.00014947525,0.000066716544,0.0010191174,0.0006391335,0.00016111133,0.000035630226,0.000021466862],"category_scores_gemma":[0.00015891403,0.000061897474,0.00007527181,0.000160735,0.00010975673,0.00070994673,0.0002051021,0.00026263925,0.0000023186853],"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.005649813,0.0016545855,0.047540218,0.0026432828,0.0020685317,0.00006850179,0.015412335,0.352677,0.029263765,0.13463844,0.38061535,0.027768163],"study_design_scores_gemma":[0.001122247,0.000081617865,0.0004884586,0.00018962355,0.000027008538,0.000008707668,0.00061005604,0.97586125,0.000058377478,0.0016574747,0.019793944,0.000101250065],"about_ca_topic_score_codex":0.000028559954,"about_ca_topic_score_gemma":0.000010292193,"teacher_disagreement_score":0.62318426,"about_ca_system_score_codex":0.000062815816,"about_ca_system_score_gemma":0.000052321844,"threshold_uncertainty_score":0.783833},"labels":[],"label_agreement":null},{"id":"W2071273455","doi":"10.1057/palgrave.jors.2600888","title":"IBM journey management library: an arena system for airport simulations","year":2000,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Air Canada","funders":"","keywords":"IBM; Purchasing; Service (business); Computer science; Customer service; Transport engineering; Operations research; Air traffic control; Engineering; Operations management; Business; Marketing","score_opus":0.2797493790220237,"score_gpt":0.5154256409100425,"score_spread":0.23567626188801882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071273455","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.7843848,0.00033624136,0.08125214,0.08581426,0.0007692151,0.004916718,0.0005690796,0.000160159,0.041797392],"genre_scores_gemma":[0.9585935,0.00004961906,0.02087125,0.00037936986,0.00050664885,0.0000362443,0.000011293279,0.000015434256,0.01953665],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957702,0.00032388108,0.0008467753,0.00022054213,0.0026081768,0.00023038955],"domain_scores_gemma":[0.9964802,0.0011340575,0.00023426027,0.0005304648,0.0014467232,0.00017423784],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0056422725,0.00009158662,0.00018146838,0.0001276377,0.0013125014,0.000764171,0.0013553924,0.000072446084,0.0014303738],"category_scores_gemma":[0.0003161746,0.000053204953,0.00039730858,0.0009800927,0.00012930049,0.0010997198,0.0001121042,0.00033403092,0.000035253546],"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.00013908344,0.00042374278,0.0027027861,0.000025059086,0.0001661222,0.000002711788,0.0010699969,0.1840458,0.0008779421,0.1275464,0.64792645,0.035073876],"study_design_scores_gemma":[0.0009578628,0.00019836272,0.011794214,0.000092600414,0.000029706174,0.000038847444,0.0027131473,0.19191581,0.0015538062,0.071476504,0.7190554,0.00017373681],"about_ca_topic_score_codex":0.0000032900891,"about_ca_topic_score_gemma":0.0000016555981,"teacher_disagreement_score":0.1742087,"about_ca_system_score_codex":0.0001377132,"about_ca_system_score_gemma":0.00034311003,"threshold_uncertainty_score":0.99998766},"labels":[],"label_agreement":null},{"id":"W2076620626","doi":"10.1057/jors.2013.77","title":"Modelling the future of the Canadian cardiac surgery workforce using system dynamics","year":2013,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University Health Network; University of Toronto; Royal Columbian Hospital; University of Saskatchewan","funders":"","keywords":"Workforce; Population ageing; Specialty; Workforce planning; Health care; Population; Economic shortage; Health human resources; Human resources; Resource (disambiguation); Business; Operations management; Medicine; Computer science; Engineering; Economics; Economic growth; Family medicine; Management; Government (linguistics); Environmental health","score_opus":0.18447613003977123,"score_gpt":0.44405738914069814,"score_spread":0.2595812591009269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076620626","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.86293155,0.0013602367,0.008074173,0.12007258,0.0040359753,0.002273992,0.000092217066,0.000007948075,0.0011513513],"genre_scores_gemma":[0.99325126,0.00026148392,0.0035136521,0.0005503703,0.0013420626,0.00002768872,0.000006047182,0.000018537297,0.0010288883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951274,0.0024369257,0.00074096746,0.00010003301,0.0011768371,0.00041784352],"domain_scores_gemma":[0.99393624,0.0011338618,0.00031707238,0.0003509498,0.004087878,0.00017401675],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.008501076,0.00009130086,0.00022507872,0.000058200487,0.00605957,0.00011214317,0.00049436605,0.00021574627,0.000056857203],"category_scores_gemma":[0.00038276022,0.00004139696,0.0003630376,0.0006833043,0.00015590091,0.00026231114,0.00010313127,0.001792774,0.0000063942516],"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":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007093463,0.000013523401,0.016069142,0.00010377661,0.00007407637,2.4020036e-7,0.0035403455,0.9401276,0.0000704664,0.015635805,0.024009507,0.0003483971],"study_design_scores_gemma":[0.00006738293,0.0000071025756,0.001842697,0.00042380855,0.000012792124,0.000004916733,0.014855463,0.9794105,0.000009299288,0.00013898047,0.003176663,0.000050351824],"about_ca_topic_score_codex":0.04676749,"about_ca_topic_score_gemma":0.0106816655,"teacher_disagreement_score":0.13031974,"about_ca_system_score_codex":0.0019866934,"about_ca_system_score_gemma":0.009978527,"threshold_uncertainty_score":0.99563396},"labels":[],"label_agreement":null},{"id":"W2080225004","doi":"10.1057/palgrave.jors.2601675","title":"Periodic review ( <i>s</i> , <i>S</i> ) inventory model with permissible delay in payments","year":2004,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Operations research; Payment; Constructive; Computer science; Standard deviation; Heuristic; Purchasing; Probabilistic logic; Mathematical economics; Economics; Operations management; Mathematics; Statistics; Artificial intelligence","score_opus":0.06460011845194524,"score_gpt":0.31820472101172737,"score_spread":0.2536046025597821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080225004","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.67350066,0.01916078,0.0012549293,0.24859737,0.0010443375,0.0035329694,0.000010512735,0.00005360857,0.052844856],"genre_scores_gemma":[0.9368143,0.0050501996,0.0014975562,0.051303003,0.0011947061,0.000072466806,0.000012322994,0.000051566294,0.004003875],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99737936,0.000050185583,0.00043120608,0.00016546922,0.0016501645,0.00032361317],"domain_scores_gemma":[0.9988643,0.00002440603,0.00019446756,0.00022295665,0.0006610615,0.00003278825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031952865,0.00013183188,0.00020565905,0.000114609684,0.0003946684,0.00024752037,0.00063386175,0.000042840416,0.0001582265],"category_scores_gemma":[0.00016603839,0.00007797538,0.00022263848,0.00075557973,0.00016916648,0.0012002431,0.00026290398,0.0005955551,0.00003086545],"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.00017648118,0.0010993562,0.018249588,0.0022058536,0.00024217894,0.000065679276,0.0009048834,0.14262061,0.0020036467,0.03413162,0.79777575,0.0005243534],"study_design_scores_gemma":[0.010876303,0.00025027725,0.0055826595,0.013801175,0.0002210877,0.000103141836,0.0032275873,0.06166824,0.00057745504,0.024330553,0.87835926,0.0010022813],"about_ca_topic_score_codex":0.00008247824,"about_ca_topic_score_gemma":0.000053235304,"teacher_disagreement_score":0.26331368,"about_ca_system_score_codex":0.00039260864,"about_ca_system_score_gemma":0.00051739975,"threshold_uncertainty_score":0.31797436},"labels":[],"label_agreement":null},{"id":"W2081606268","doi":"10.1057/jors.2012.26","title":"Implementing a parametric maximum flow algorithm for optimal open pit mine design under uncertain supply and demand","year":2012,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Mining Techniques and Economics","field":"Engineering","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Project management; Parametric statistics; Optimal design; Algorithm; Operations research; Scheduling (production processes); Open-pit mining; Mathematical optimization; Engineering; Mathematics; Mining engineering; Systems engineering; Statistics; Machine learning","score_opus":0.1252303502094552,"score_gpt":0.3796928823080662,"score_spread":0.254462532098611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081606268","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.11323353,0.0008883925,0.8834187,0.001441697,0.0001516697,0.00071223965,0.000041176845,0.0000108340755,0.00010181003],"genre_scores_gemma":[0.17294842,0.00036872324,0.8259361,0.000099957535,0.00036645058,0.00004115847,0.0000047174185,0.000021676959,0.0002127933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890894,0.00007477172,0.00028108078,0.000073605675,0.0002523481,0.000409264],"domain_scores_gemma":[0.9990651,0.00047146255,0.000052512303,0.000097341195,0.0002031024,0.0001104956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063321386,0.00008207127,0.00014597968,0.000050623712,0.00036618664,0.000267763,0.00036187872,0.000059581558,0.000069908325],"category_scores_gemma":[0.00013594661,0.000058647238,0.00010578555,0.00015651422,0.000045253306,0.00043414353,0.00024374707,0.00029086907,0.0000010114181],"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.00009362603,0.00019783317,0.0031627796,0.00012105708,0.00086487446,0.0000016100024,0.0028018025,0.48764187,0.005070533,0.0024541041,0.43456253,0.06302736],"study_design_scores_gemma":[0.0006576753,0.00012847806,0.0007955768,0.000033587767,0.0000173023,0.00005253994,0.0005635842,0.9798419,0.0020983317,0.0015878004,0.014115047,0.00010820649],"about_ca_topic_score_codex":0.00001200824,"about_ca_topic_score_gemma":0.000001772919,"teacher_disagreement_score":0.4922,"about_ca_system_score_codex":0.00020115182,"about_ca_system_score_gemma":0.00011846038,"threshold_uncertainty_score":0.28164485},"labels":[],"label_agreement":null},{"id":"W2081687870","doi":"10.1057/palgrave.jors.2601773","title":"A free coordination hull approach to efficiency measurement","year":2004,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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":"York University","funders":"","keywords":"Hull; Data envelopment analysis; Binary number; Component (thermodynamics); Computer science; Zero (linguistics); Mathematical optimization; Sample (material); Analogy; Simple (philosophy); Set (abstract data type); Operations research; Mathematics; Engineering; Arithmetic","score_opus":0.2740224884239578,"score_gpt":0.45442554024430004,"score_spread":0.18040305182034222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081687870","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.47267377,0.000621969,0.34582046,0.16622104,0.0009583823,0.0010414734,0.000023915482,0.000017294395,0.012621682],"genre_scores_gemma":[0.98696834,0.0000065916465,0.0109317545,0.00076292845,0.00029401935,0.000007732328,3.9774662e-7,0.000008596153,0.0010196376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98273396,0.0007898586,0.0009332729,0.00032451595,0.014848062,0.00037029927],"domain_scores_gemma":[0.98847675,0.0007057439,0.00030224674,0.0007481908,0.009552758,0.00021428213],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.048444204,0.00011644628,0.00025180102,0.00030508757,0.0011566955,0.0006974434,0.003096821,0.00007751261,0.00005902534],"category_scores_gemma":[0.031417485,0.0000630136,0.00056991464,0.0035943976,0.00027769688,0.0004414305,0.0004910835,0.00070990005,0.00006578382],"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.000064970474,0.0013420912,0.0008550065,0.000007947371,0.00013066662,0.0000025966178,0.006234968,0.678276,0.033158194,0.031276442,0.2472219,0.0014291903],"study_design_scores_gemma":[0.01262719,0.002903231,0.07814962,0.0007988469,0.00024966654,0.0004913499,0.028323095,0.21483065,0.04631091,0.4506071,0.16299015,0.0017182083],"about_ca_topic_score_codex":0.000032761764,"about_ca_topic_score_gemma":0.00001766396,"teacher_disagreement_score":0.51429456,"about_ca_system_score_codex":0.0011065872,"about_ca_system_score_gemma":0.0019068237,"threshold_uncertainty_score":0.9798269},"labels":[],"label_agreement":null},{"id":"W2081877096","doi":"10.1057/palgrave.jors.2602070","title":"A methodology to optimize foundation seminar assignments","year":2005,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saskatchewan Health Quality Council","funders":"","keywords":"Foundation (evidence); Computer science; Liberal arts education; The arts; Heuristic; Mathematics education; Operations research; Psychology; Artificial intelligence; Mathematics; Visual arts; Higher education; History; Art","score_opus":0.6168729675288916,"score_gpt":0.5914161163089076,"score_spread":0.02545685121998409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081877096","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.39306194,0.00032017764,0.3292792,0.27269036,0.001431216,0.0004877127,0.000013382817,0.0000125531515,0.0027034443],"genre_scores_gemma":[0.52473694,0.0000348015,0.45826966,0.0017189424,0.0010288447,0.000009110457,8.8244644e-7,0.000008363224,0.014192427],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9934753,0.00167938,0.0006612882,0.00019602705,0.0036829505,0.0003050134],"domain_scores_gemma":[0.99123967,0.00507632,0.00021223383,0.00034234193,0.0029333355,0.0001961227],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.040024072,0.000074573894,0.00019557003,0.00016687386,0.0009038438,0.00043216904,0.001147183,0.00007699962,0.0007049175],"category_scores_gemma":[0.028452665,0.000041680025,0.00034704435,0.0011797182,0.00016221846,0.00047496444,0.00025880002,0.0006202765,0.00035918975],"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.00015065592,0.00031107754,0.001488771,0.0000021500252,0.0001991224,0.0000018306891,0.00455216,0.38178653,0.027388128,0.009895213,0.5449278,0.029296584],"study_design_scores_gemma":[0.0021951366,0.0006029644,0.022470923,0.00011537723,0.00006137767,0.00024956808,0.0059834095,0.1495544,0.013299689,0.05787882,0.7472354,0.00035289943],"about_ca_topic_score_codex":0.000010266669,"about_ca_topic_score_gemma":0.000006926565,"teacher_disagreement_score":0.27097142,"about_ca_system_score_codex":0.00033078017,"about_ca_system_score_gemma":0.00081906613,"threshold_uncertainty_score":0.98849726},"labels":[],"label_agreement":null},{"id":"W2085896549","doi":"10.1057/palgrave.jors.2601885","title":"Two optimization models of the optimum inspection problem","year":2005,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Industrial Vision Systems and Defect Detection","field":"Engineering","cited_by":18,"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","funders":"","keywords":"Computer science; Operations research; Project management; Scheduling (production processes); Purchasing; Management science; Mathematical optimization; Operations management; Engineering; Systems engineering; Mathematics","score_opus":0.06112229944376461,"score_gpt":0.3283507921021784,"score_spread":0.26722849265841375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085896549","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.6833814,0.0013774424,0.27127427,0.011866495,0.004396972,0.0025454687,0.000049799404,0.00012342757,0.024984753],"genre_scores_gemma":[0.99283713,0.00008616443,0.0058101835,0.000031259762,0.00082669844,0.0000059449135,5.0059265e-7,0.00001251843,0.00038959263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823487,0.00018468355,0.0004040313,0.000060073104,0.0009817703,0.00013455702],"domain_scores_gemma":[0.99879223,0.00008637769,0.00010986619,0.00014409953,0.0008290088,0.00003842042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020893107,0.00006566408,0.0001112923,0.00004738187,0.0003616868,0.00007236076,0.0002441143,0.000082703424,0.000037395683],"category_scores_gemma":[0.00009876596,0.00003596209,0.00024129223,0.00045970443,0.00006459632,0.00042950382,0.000053887157,0.0005973709,0.0000022547576],"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.000010970881,0.000018843728,0.000024579307,0.000008523002,0.00003549503,4.5760608e-8,0.00036001668,0.97915184,0.0067175203,0.0006965396,0.012566157,0.00040946362],"study_design_scores_gemma":[0.00050483155,0.00004538089,0.00010479174,0.00008271913,0.00000755159,0.000025793175,0.00025604566,0.9848465,0.010810825,0.00035733427,0.002911489,0.00004677205],"about_ca_topic_score_codex":0.000017155193,"about_ca_topic_score_gemma":0.0000096409885,"teacher_disagreement_score":0.30945578,"about_ca_system_score_codex":0.00034030864,"about_ca_system_score_gemma":0.00018615155,"threshold_uncertainty_score":0.2781839},"labels":[],"label_agreement":null},{"id":"W2088225495","doi":"10.1057/palgrave.jors.2602619","title":"Assessing the performance of Canadian bank branches using data envelopment analysis","year":2008,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"York University","funders":"","keywords":"Data envelopment analysis; Inefficiency; Computer science; Order (exchange); Operations research; Information system; Project management; Econometrics; Scheduling (production processes); Economics; Business; Operations management; Statistics; Finance; Mathematics; Engineering; Microeconomics; Management","score_opus":0.521389292434807,"score_gpt":0.5187625611757518,"score_spread":0.002626731259055215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088225495","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.9904428,0.00018568718,0.0011058339,0.0076623796,0.00011973716,0.00007761818,0.000015493932,9.666218e-7,0.00038948786],"genre_scores_gemma":[0.99166834,0.00022302328,0.007217024,0.00025540104,0.00015176788,5.471802e-7,0.000002955453,0.0000051908532,0.00047577402],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9915191,0.001026736,0.0009879249,0.0002529955,0.005881768,0.00033149708],"domain_scores_gemma":[0.9930074,0.0022439468,0.00049584854,0.001044928,0.0030559963,0.00015188496],"candidate_categories":["metaresearch","sts"],"consensus_categories":[],"category_scores_codex":[0.03166156,0.00009477014,0.00031324476,0.0006280308,0.002536472,0.00050553767,0.0037078664,0.00006143719,0.0002889589],"category_scores_gemma":[0.0052989046,0.00004485041,0.0004544031,0.008551674,0.0007777381,0.0012353577,0.00049586926,0.0006566747,0.000010741312],"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.000018220691,0.00016061908,0.5592271,0.0000080512455,0.0015623891,0.000009779937,0.0067889085,0.37257236,0.0073999166,0.00029185275,0.04925029,0.0027104907],"study_design_scores_gemma":[0.00015535676,0.000021370783,0.27743676,0.000036607278,0.00014264735,0.00007583737,0.0022597278,0.7072347,0.0015217541,0.00014889512,0.010872857,0.00009349962],"about_ca_topic_score_codex":0.004203433,"about_ca_topic_score_gemma":0.002580181,"teacher_disagreement_score":0.33466232,"about_ca_system_score_codex":0.00033535494,"about_ca_system_score_gemma":0.00520503,"threshold_uncertainty_score":0.9987621},"labels":[],"label_agreement":null},{"id":"W2089725715","doi":"10.1057/jors.2009.83","title":"Saving-based algorithms for vehicle routing problem with simultaneous pickup and delivery","year":2009,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Heuristics; Vehicle routing problem; Pickup; Computer science; Heuristic; Routing (electronic design automation); Extension (predicate logic); Mathematical optimization; Algorithm; Mathematics; Embedded system; Artificial intelligence","score_opus":0.04172816528484367,"score_gpt":0.33600109162972863,"score_spread":0.29427292634488494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089725715","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.5133755,0.00051714294,0.4769649,0.007818444,0.00013367737,0.00085037266,0.000018056102,0.000061893414,0.00025997125],"genre_scores_gemma":[0.68921566,0.000028162065,0.31029093,0.00018996188,0.00016068961,0.0000039039933,0.0000011716219,0.000014716885,0.00009479917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986078,0.00013495018,0.00027021198,0.000099563644,0.0006354581,0.0002520109],"domain_scores_gemma":[0.99782455,0.0009984875,0.00006460621,0.00010375634,0.00092163496,0.000086958455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025386577,0.00009266898,0.00013513911,0.00003806392,0.00043320082,0.0001596989,0.00020729972,0.000064570915,0.0000067231294],"category_scores_gemma":[0.00049033953,0.00006107836,0.00009997586,0.00025890177,0.00007530355,0.00018546889,0.000023523438,0.00046470325,4.1216856e-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.00003382004,0.000026148673,0.00030256892,0.000022425957,0.000039500348,0.0000017709879,0.00039128066,0.9836964,0.008506459,0.0001231186,0.0009212385,0.00593529],"study_design_scores_gemma":[0.00079508807,0.00023034985,0.0009859145,0.000096061885,0.000011676188,0.000023872573,0.00016074801,0.9943893,0.002503943,0.00019724037,0.0005241299,0.00008166846],"about_ca_topic_score_codex":0.0000028256102,"about_ca_topic_score_gemma":0.00000196585,"teacher_disagreement_score":0.17584011,"about_ca_system_score_codex":0.00019377658,"about_ca_system_score_gemma":0.00025738255,"threshold_uncertainty_score":0.33318743},"labels":[],"label_agreement":null},{"id":"W2109971354","doi":"10.1057/palgrave.jors.2602235","title":"A simulation study of scheduling clinic appointments in surgical care: individual surgeon <i>versus</i> pooled lists","year":2006,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":84,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Paul's Hospital; Vancouver General Hospital; Centre for Advancing Health Outcomes; University of British Columbia","funders":"","keywords":"Medicine; Scheduling (production processes); Discrete event simulation; Pooling; Medical emergency; Asynchronous communication; Operations management; Computer science; Simulation; Artificial intelligence; Engineering","score_opus":0.2040889459157151,"score_gpt":0.5314158404879024,"score_spread":0.3273268945721872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109971354","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.99585646,0.00019920143,0.00019197815,0.0015653434,0.0005166063,0.0011103966,0.00001732904,0.0000052688965,0.0005374108],"genre_scores_gemma":[0.9966262,0.000054400458,0.002287997,0.000079768455,0.0005281782,0.0000331624,0.00003204955,0.000016797496,0.00034144227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99308044,0.0029687185,0.0015542678,0.00019363682,0.0018157397,0.00038720111],"domain_scores_gemma":[0.9929928,0.0032103152,0.00046893684,0.00022908492,0.0030021498,0.00009671435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009192678,0.000120016186,0.00032961354,0.000160713,0.0011419388,0.00005083022,0.00033935547,0.000220631,0.00015865907],"category_scores_gemma":[0.0016560389,0.00008398843,0.00019248946,0.00088177563,0.000085298336,0.00032151505,0.00016847832,0.0016294114,0.000009436354],"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.0006257243,0.001295876,0.14760365,0.00010447124,0.000113491136,0.000007739331,0.014744333,0.8330522,0.00013786058,0.00072624313,0.0011787183,0.00040966185],"study_design_scores_gemma":[0.04582555,0.003985582,0.4393717,0.0017739506,0.00020975461,0.000010091426,0.2041398,0.2943825,0.0001717472,0.00072201283,0.008695203,0.00071210845],"about_ca_topic_score_codex":0.0006371919,"about_ca_topic_score_gemma":0.0007176515,"teacher_disagreement_score":0.5386697,"about_ca_system_score_codex":0.0005870442,"about_ca_system_score_gemma":0.0023445874,"threshold_uncertainty_score":0.8782985},"labels":[],"label_agreement":null},{"id":"W2110400651","doi":"10.1057/jors.2012.65","title":"Designing global supply networks for conflict or disaster support: the case of the Canadian Armed Forces","year":2012,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Modellium (Canada); Université Laval","funders":"","keywords":"Humanitarian Logistics; Operations research; Supply network; Order (exchange); Business; Robustness (evolution); Computer science; Risk analysis (engineering); Industrial organization; Engineering; Finance","score_opus":0.12032517714007837,"score_gpt":0.36402606521959985,"score_spread":0.24370088807952148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110400651","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.76908904,0.000783818,0.009783621,0.2008777,0.0052116974,0.0045985915,0.00013009399,0.000017403245,0.009508056],"genre_scores_gemma":[0.9939494,0.000019947769,0.00021563141,0.0029795459,0.001079593,0.00002363306,0.0000049889904,0.000007059996,0.0017201965],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984681,0.00009411977,0.00036617887,0.00008070681,0.0006031356,0.00038776195],"domain_scores_gemma":[0.998502,0.00016869913,0.00013271491,0.00020941623,0.0009422398,0.00004490921],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004766945,0.000089430825,0.00011174703,0.000030664876,0.0014622279,0.0002801641,0.0005943694,0.000050426737,0.0004521867],"category_scores_gemma":[0.00066169375,0.000038945935,0.00027448725,0.0004559093,0.000221353,0.0006431038,0.00019086672,0.00026117224,0.0000071059535],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019604924,0.00017023546,0.039730202,0.00019695309,0.0004223117,0.000005737908,0.0025929161,0.03433983,0.00013863304,0.05751307,0.8620596,0.0026344394],"study_design_scores_gemma":[0.0019271463,0.00008724095,0.07077034,0.00015644376,0.00024023812,0.00015091227,0.020856237,0.13889387,0.00014804481,0.0016547752,0.76476955,0.000345178],"about_ca_topic_score_codex":0.016078105,"about_ca_topic_score_gemma":0.08319804,"teacher_disagreement_score":0.22486039,"about_ca_system_score_codex":0.00021055431,"about_ca_system_score_gemma":0.00041857845,"threshold_uncertainty_score":0.99983776},"labels":[],"label_agreement":null},{"id":"W2115781168","doi":"10.1057/jors.2011.25","title":"An incremental tabu search heuristic for the generalized vehicle routing problem with time windows","year":2011,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":73,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Tabu search; Vehicle routing problem; Mathematical optimization; Guided Local Search; Computer science; Neighbourhood (mathematics); Incremental heuristic search; Heuristic; Heuristics; Beam search; Routing (electronic design automation); Algorithm; Search algorithm; Mathematics","score_opus":0.07959455024081594,"score_gpt":0.3510110840672343,"score_spread":0.2714165338264184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115781168","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.76912457,0.0002944269,0.22508794,0.0022943367,0.0002230714,0.001792012,0.00003838742,0.000068525456,0.0010767068],"genre_scores_gemma":[0.7726311,0.000039260252,0.22641237,0.00011232767,0.00037191008,0.000031129737,0.000003840369,0.000042956948,0.00035510564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976652,0.000483041,0.0003580638,0.00011932418,0.0010190798,0.00035525995],"domain_scores_gemma":[0.9980683,0.0005684239,0.00007283872,0.00023349952,0.0009482423,0.00010872417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00711255,0.00011277715,0.00015090503,0.000038033602,0.00082303735,0.00017753318,0.0006382614,0.00006224902,0.00014515241],"category_scores_gemma":[0.00021909266,0.000060910595,0.00015009745,0.0003568712,0.00016499142,0.00033610364,0.00008079515,0.000660108,0.000005098789],"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.00018817997,0.00012012868,0.0025213796,0.000043902513,0.0003698496,0.0000019569904,0.0065565347,0.90977705,0.07205099,0.0012893659,0.00591324,0.0011674409],"study_design_scores_gemma":[0.0009944388,0.00021324934,0.0031004683,0.000047742036,0.000026115827,0.000032216034,0.00075485476,0.98208445,0.012173813,0.00016837503,0.0003025348,0.00010171228],"about_ca_topic_score_codex":0.000028468594,"about_ca_topic_score_gemma":0.0000041720646,"teacher_disagreement_score":0.07230745,"about_ca_system_score_codex":0.00023523266,"about_ca_system_score_gemma":0.00031221,"threshold_uncertainty_score":0.63302207},"labels":[],"label_agreement":null},{"id":"W2123870732","doi":"10.1057/jors.2010.49","title":"Optimization models for critical spare parts inventories—a reliability approach","year":2010,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":97,"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","funders":"","keywords":"Spare part; Reliability (semiconductor); Computer science; Project management; Operations research; Reliability engineering; Purchasing; Scheduling (production processes); Systems engineering; Operations management; Engineering","score_opus":0.053585881235284384,"score_gpt":0.3332193809567216,"score_spread":0.2796334997214372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123870732","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.007703531,0.000068928086,0.9850615,0.0044613564,0.00094363635,0.00048874103,0.00002440847,0.000020435178,0.0012274387],"genre_scores_gemma":[0.7339312,0.0001360106,0.26499185,0.00008757511,0.0005651641,0.000052579493,0.000012583138,0.000021314989,0.00020176695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984523,0.00009903212,0.00035992896,0.00012185934,0.000714959,0.00025193414],"domain_scores_gemma":[0.99717116,0.00043084894,0.000040146664,0.00023051961,0.002018539,0.00010879749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033006694,0.00008763627,0.00013786259,0.000027178452,0.00038083532,0.00014024916,0.00031676705,0.00014154278,0.00003805578],"category_scores_gemma":[0.0027357559,0.000059495032,0.00022877708,0.00022970718,0.0002571735,0.00064045214,0.00005236382,0.0007961686,6.79231e-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.000019582938,0.000063305415,0.000044566157,0.00006943123,0.000017152744,7.04276e-8,0.00043896586,0.9658201,0.00045533574,0.013818149,0.019189607,0.00006375316],"study_design_scores_gemma":[0.00023476606,0.00003617855,0.00005712394,0.000018965758,0.0000083513,0.00000814918,0.00023894724,0.9825475,0.00046948262,0.01374752,0.0025682573,0.00006472706],"about_ca_topic_score_codex":0.0000030446176,"about_ca_topic_score_gemma":0.0000021259393,"teacher_disagreement_score":0.72622764,"about_ca_system_score_codex":0.00016951491,"about_ca_system_score_gemma":0.00025639994,"threshold_uncertainty_score":0.34590006},"labels":[],"label_agreement":null},{"id":"W2136863244","doi":"10.1057/jors.2009.86","title":"An ant colony optimization metaheuristic for single-path multicommodity network flow problems","year":2009,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"University of Windsor","funders":"","keywords":"Metaheuristic; Ant colony optimization algorithms; Mathematical optimization; Multi-commodity flow problem; Computer science; Path (computing); Flow network; Ant colony; Node (physics); Minimum-cost flow problem; Parallel metaheuristic; Optimization problem; Flow (mathematics); Mathematics; Computer network; Engineering","score_opus":0.07605495017992003,"score_gpt":0.36306116388250936,"score_spread":0.28700621370258933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136863244","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.008507897,0.00025468794,0.98832005,0.0017423523,0.0003971191,0.0005704426,0.000019118817,0.00003857134,0.0001497867],"genre_scores_gemma":[0.33103496,0.00008829507,0.6678525,0.00016237504,0.0007527369,0.000011413552,0.000013492505,0.000023628658,0.000060571077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977713,0.00047362558,0.00048013564,0.00012594451,0.0008033081,0.00034565313],"domain_scores_gemma":[0.99762577,0.0005863912,0.00011309089,0.0002195499,0.0013215826,0.00013361035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054551335,0.000121891244,0.00021088946,0.00004136789,0.00057528116,0.00023590637,0.0004381284,0.00010863183,0.000027463426],"category_scores_gemma":[0.0010346383,0.00008894068,0.00022010197,0.0004296013,0.000072151095,0.00040440063,0.00002943748,0.00054654764,8.635269e-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.000020706279,0.000107863416,0.00006505529,0.00001973329,0.00005037926,4.6132058e-7,0.00034072498,0.982503,0.006650887,0.00020147156,0.009118034,0.00092169846],"study_design_scores_gemma":[0.00052388053,0.00025265923,0.00046924152,0.000057589827,0.000022138207,0.000017480192,0.00004397401,0.99621606,0.0006683555,0.0006630126,0.00096893386,0.00009668642],"about_ca_topic_score_codex":0.0000013490314,"about_ca_topic_score_gemma":0.0000011346144,"teacher_disagreement_score":0.32252708,"about_ca_system_score_codex":0.000346811,"about_ca_system_score_gemma":0.00019454137,"threshold_uncertainty_score":0.44246557},"labels":[],"label_agreement":null},{"id":"W2138023714","doi":"10.1057/jors.2010.53","title":"Cost allocation in the establishment of a collaborative transportation agreement—an application in the furniture industry","year":2010,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":123,"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; Université Laval","funders":"","keywords":"Purchasing; Supply chain; Cost reduction; Business; Computer science; Key (lock); Operations research; Operations management; Marketing; Economics; Engineering; Computer security","score_opus":0.049066076679056714,"score_gpt":0.3867948432864896,"score_spread":0.3377287666074329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138023714","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.982916,0.000053053907,0.008439047,0.0074005364,0.00010695854,0.00085192226,0.000019567324,0.0000037640436,0.00020917949],"genre_scores_gemma":[0.991176,0.000056592016,0.008336719,0.00017965614,0.00013931039,0.00007079076,0.00001909891,0.000008083345,0.000013730397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9975534,0.00069203007,0.00044216705,0.0000815289,0.0010851356,0.00014570415],"domain_scores_gemma":[0.9983985,0.00046453724,0.00012638875,0.00022047185,0.00076036964,0.00002974408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0089291325,0.00007503606,0.00010137064,0.000069810485,0.00015882864,0.00010003657,0.0005880308,0.00015444173,0.000020794947],"category_scores_gemma":[0.00033623344,0.000041476087,0.00006042857,0.0011670819,0.000101314436,0.0003828407,0.000009751656,0.0018131819,5.766628e-7],"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.00003314249,0.00027732327,0.013863362,0.000036164645,0.0000384683,0.0000010205288,0.04464396,0.8834912,0.047451787,0.003975394,0.0031507902,0.0030373398],"study_design_scores_gemma":[0.0020296352,0.00018949431,0.5331377,0.00013407343,0.000033722437,0.000021085354,0.068347774,0.3779595,0.010777203,0.0016507914,0.0054953843,0.00022367497],"about_ca_topic_score_codex":0.00004303761,"about_ca_topic_score_gemma":0.00058724236,"teacher_disagreement_score":0.5192743,"about_ca_system_score_codex":0.00012877762,"about_ca_system_score_gemma":0.00029968272,"threshold_uncertainty_score":0.7877474},"labels":[],"label_agreement":null},{"id":"W2144526341","doi":"10.1057/palgrave.jors.2602072","title":"Large-scale capacitated part-routing in the presence of process and routing flexibilities and setup costs","year":2005,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Routing (electronic design automation); Outsourcing; Scheduling (production processes); Production (economics); Mathematical optimization; Process (computing); Scale (ratio); Purchasing; Product (mathematics); Operations research; Heuristics; Fixed cost; Operations management; Mathematics; Engineering; Economics","score_opus":0.035065605024043295,"score_gpt":0.33038588850269296,"score_spread":0.2953202834786497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144526341","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.99270153,0.00035567684,0.0052689216,0.0011783526,0.00004128793,0.00015257116,0.000013042355,0.0000055628784,0.00028303536],"genre_scores_gemma":[0.99650294,0.00026718737,0.0030238724,0.000034164135,0.00009741328,0.0000034447598,0.000001286279,0.0000055313653,0.00006416027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990546,0.00010545187,0.00022882358,0.00006075897,0.00039672042,0.0001536092],"domain_scores_gemma":[0.9991405,0.0004757935,0.000049561248,0.000069393805,0.00023811334,0.00002664072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001927366,0.00005313922,0.00008585939,0.000022018094,0.0002049601,0.000058901358,0.00013397045,0.000035321355,0.000004621598],"category_scores_gemma":[0.00063962303,0.000031672444,0.000028400029,0.00012488871,0.00013695675,0.00023329192,0.000037377366,0.00041168046,1.1026541e-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.000013283517,0.00002973062,0.0017232479,0.00006838763,0.000020156074,4.6730548e-7,0.022823986,0.9723284,0.0005662467,0.0012640773,0.00073148956,0.00043048925],"study_design_scores_gemma":[0.0005833187,0.00005202222,0.006373739,0.00024553618,0.000007896054,0.000030251826,0.02481843,0.9607783,0.004763308,0.0017902683,0.00046347955,0.00009342623],"about_ca_topic_score_codex":0.0000059101453,"about_ca_topic_score_gemma":0.000023569331,"teacher_disagreement_score":0.011550113,"about_ca_system_score_codex":0.00006963194,"about_ca_system_score_gemma":0.00005035981,"threshold_uncertainty_score":0.17885697},"labels":[],"label_agreement":null},{"id":"W2149103160","doi":"10.1057/jors.2012.71","title":"Matching patient and physician preferences in designing a primary care facility network","year":2012,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Context (archaeology); Matching (statistics); Stakeholder; Health care; Incentive; Business; Purchasing; Computer science; Knowledge management; Marketing; Economics; Medicine; Microeconomics","score_opus":0.0688836860669017,"score_gpt":0.3052366764368525,"score_spread":0.23635299036995078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149103160","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.9944606,0.00076659495,0.0003003063,0.0014726423,0.00026692782,0.00023999828,0.000001928131,0.0000042652373,0.0024867386],"genre_scores_gemma":[0.9975704,0.00005815747,0.00064961374,0.0011304688,0.0005208386,0.000008655268,0.000005804531,0.00000337663,0.000052660464],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99853694,0.00009217029,0.0002815247,0.00008856521,0.0007396757,0.00026113607],"domain_scores_gemma":[0.999354,0.00005945808,0.00007149034,0.000093991475,0.00040210932,0.000018930097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023811609,0.00007241657,0.000107449334,0.000045639168,0.0004272835,0.0001713866,0.00019457251,0.000029925752,0.00003793027],"category_scores_gemma":[0.000082455714,0.00004813752,0.00008930071,0.0003461088,0.00006972746,0.0011194112,0.00025866553,0.0003394878,0.000010961349],"study_design_candidate":"observational","study_design_consensus":"observational","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.00031289304,0.0010936462,0.5620224,0.0024402272,0.00037490184,0.000002999992,0.053967606,0.16487661,0.004175044,0.03073709,0.07572332,0.10427327],"study_design_scores_gemma":[0.0011258536,0.00006205866,0.859877,0.0005591469,0.000045771885,0.0000026486705,0.05311702,0.0056424816,0.00013364962,0.010455714,0.06856486,0.0004138188],"about_ca_topic_score_codex":0.0002419517,"about_ca_topic_score_gemma":0.00008382345,"teacher_disagreement_score":0.29785457,"about_ca_system_score_codex":0.00015104841,"about_ca_system_score_gemma":0.0000751905,"threshold_uncertainty_score":0.32863626},"labels":[],"label_agreement":null},{"id":"W2160012199","doi":"10.1057/jors.2011.52","title":"Inventory control for point-of-use locations in hospitals","year":2011,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":73,"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é de Montréal","funders":"Vrije Universiteit Amsterdam","keywords":"Reorder point; Inventory control; Service level; Operations research; Computer science; Purchasing; Lead time; Service (business); Operations management; Capacity management; Economic order quantity; Order (exchange); Inventory theory; Perpetual inventory; Scheduling (production processes); Set (abstract data type); Information system; Mathematics; Statistics; Economics; Business; Supply chain; Engineering; Marketing","score_opus":0.10718632043852347,"score_gpt":0.3244634993816324,"score_spread":0.2172771789431089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160012199","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.9547445,0.00046626158,0.006283929,0.024351656,0.0015355923,0.0025704147,0.000018908033,0.000014913857,0.010013827],"genre_scores_gemma":[0.9963054,0.00002760878,0.0007499732,0.0015279823,0.00050402415,0.000032348562,0.0000026413063,0.000010678076,0.0008393403],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99866265,0.00005175943,0.00040172174,0.000088063694,0.0006058169,0.00018995955],"domain_scores_gemma":[0.9985044,0.00016143899,0.00020968016,0.00014963078,0.00095994555,0.000014921843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034645991,0.00006743374,0.0001349743,0.00014465458,0.0001910994,0.000109731576,0.00042579984,0.000039512503,0.00020549893],"category_scores_gemma":[0.00088157743,0.000046060337,0.00025099146,0.00032795712,0.00014630644,0.0011491728,0.000112690774,0.00022298607,0.000007914461],"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.0002830517,0.00086358585,0.19433352,0.00030149083,0.00033849056,0.000003168816,0.002032763,0.0014469107,0.0019480507,0.32749867,0.47028172,0.000668583],"study_design_scores_gemma":[0.010993731,0.00038361343,0.5196657,0.0007802264,0.00018140026,0.000006277715,0.01276762,0.08109401,0.0013111084,0.106745705,0.26546496,0.0006056374],"about_ca_topic_score_codex":0.00015885766,"about_ca_topic_score_gemma":0.00003167901,"teacher_disagreement_score":0.3253322,"about_ca_system_score_codex":0.00010769975,"about_ca_system_score_gemma":0.00013697892,"threshold_uncertainty_score":0.22500692},"labels":[],"label_agreement":null},{"id":"W2163940244","doi":"10.1057/palgrave.jors.2601775","title":"Design of balanced MBA student teams","year":2004,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":39,"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; HEC Montréal","funders":"","keywords":"Computer science; Metaheuristic; Project management; Population; Set (abstract data type); Operations research; Mathematical optimization; Norm (philosophy); Representation (politics); Management science; Mathematics; Engineering","score_opus":0.06223547916946872,"score_gpt":0.392809572784927,"score_spread":0.3305740936154583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163940244","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.18760543,0.00047417026,0.80727017,0.0032397665,0.00041063823,0.00038181047,0.0000046704727,0.0000211773,0.0005921858],"genre_scores_gemma":[0.7444952,0.00027224622,0.25480112,0.00006172164,0.0001772078,0.000004085078,4.4743226e-7,0.000016460983,0.0001715029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980624,0.00025450008,0.00034905568,0.000057201236,0.001106844,0.00017002049],"domain_scores_gemma":[0.9986905,0.00029949207,0.000069533635,0.00013901,0.0007416279,0.000059869075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041283155,0.00006444463,0.00013514349,0.00003817671,0.00015612661,0.000049632567,0.0004092593,0.000055206143,0.00003823597],"category_scores_gemma":[0.00041002,0.000043347263,0.00014034784,0.00035032202,0.00008915036,0.00015492357,0.000064398104,0.00050188217,0.0000031071136],"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.000006979905,0.000039455776,0.00027618214,0.000011890589,0.00007097103,5.962159e-7,0.00097493496,0.9572019,0.03819704,0.00034935595,0.0026628207,0.00020784434],"study_design_scores_gemma":[0.0053425,0.0005680211,0.025401395,0.0005916108,0.000054545828,0.00012308381,0.0032369886,0.7486933,0.20660336,0.007107115,0.0018540109,0.00042407],"about_ca_topic_score_codex":0.0000027745943,"about_ca_topic_score_gemma":2.9445465e-7,"teacher_disagreement_score":0.5568898,"about_ca_system_score_codex":0.00036565363,"about_ca_system_score_gemma":0.0003732434,"threshold_uncertainty_score":0.21804562},"labels":[],"label_agreement":null},{"id":"W2175760929","doi":"10.1057/jors.2015.77","title":"Good Laboratory Practice for optimization research","year":2015,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Statistical Methods in Clinical Trials","field":"Mathematics","cited_by":78,"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é de Montréal","funders":"","keywords":"Management science; Set (abstract data type); Computer science; Engineering ethics; Operations research; Engineering management; Engineering","score_opus":0.8964348371194648,"score_gpt":0.7340319064664583,"score_spread":0.16240293065300648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175760929","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.0059003728,0.0006108568,0.8308791,0.14651957,0.0029669255,0.0035300096,0.0002590888,0.000030939635,0.009303122],"genre_scores_gemma":[0.004018126,0.00010140951,0.9922849,0.0004365323,0.0017962301,0.000045115517,8.1406245e-7,0.000027811473,0.001289055],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98838824,0.0064087505,0.000863533,0.0001794818,0.003774035,0.00038597596],"domain_scores_gemma":[0.8045787,0.16801107,0.00043234346,0.0004665125,0.026135975,0.00037539788],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.1123845,0.00009031969,0.00028597793,0.000068386355,0.00057382847,0.00023230456,0.0007463826,0.00017576934,0.00008043326],"category_scores_gemma":[0.64220184,0.0000557595,0.00025538407,0.000824235,0.0004695899,0.00042338416,0.00025437298,0.0015117445,0.000009651759],"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.00052072614,0.0006308062,0.000044282548,0.000063101266,0.00020966334,0.0000032867022,0.0009877416,0.006620184,0.0005279925,0.27796552,0.7120053,0.00042136267],"study_design_scores_gemma":[0.0023564897,0.0009420137,0.000026513573,0.00013294829,0.0000559117,0.000024331017,0.003503738,0.016159432,0.0013335885,0.89812344,0.07722323,0.00011835108],"about_ca_topic_score_codex":0.0000041193643,"about_ca_topic_score_gemma":8.6175055e-7,"teacher_disagreement_score":0.6347821,"about_ca_system_score_codex":0.0005284277,"about_ca_system_score_gemma":0.0028869596,"threshold_uncertainty_score":0.9139869},"labels":[],"label_agreement":null},{"id":"W2256226605","doi":"10.1057/jors.2015.99","title":"Systems simulation model for assessing the sustainability and synergistic impacts of sugar-sweetened beverages tax and revenue recycling on childhood obesity prevention","year":2015,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Obesity, Physical Activity, Diet","field":"Medicine","cited_by":29,"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 Saskatchewan","funders":"Office of Behavioral and Social Sciences Research; U.S. Department of Agriculture","keywords":"Sustainability; Psychological intervention; Public economics; Revenue; Childhood obesity; Tax revenue; Business; Environmental economics; Economics; Obesity; Overweight; Medicine; Finance","score_opus":0.08791971047031309,"score_gpt":0.4321531135405106,"score_spread":0.3442334030701975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2256226605","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.9922637,0.0001828485,0.0034342532,0.0032843892,0.000054053777,0.00074720586,0.000018003322,0.000002203788,0.000013365456],"genre_scores_gemma":[0.99875456,0.000041578736,0.0005841722,0.00003896954,0.00028744998,0.000008677101,0.0000032313708,0.000010207947,0.00027112453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789745,0.0004903829,0.00032982626,0.00013776789,0.0009680709,0.00017649053],"domain_scores_gemma":[0.99582505,0.001436624,0.00024719493,0.00017402651,0.0021837875,0.00013334244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056331293,0.000089815316,0.00025485508,0.00003330281,0.00040297414,0.00011635817,0.00011085716,0.000076029115,5.2130565e-7],"category_scores_gemma":[0.0060585667,0.00005051564,0.00015641142,0.00014739868,0.00019085298,0.00033819806,0.00010246879,0.00048257766,9.225562e-8],"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.0005385342,0.0065250853,0.16162677,0.0015459923,0.00053959934,0.0000030914557,0.0050741625,0.80861485,0.008167138,0.0033644005,0.0030430856,0.0009572681],"study_design_scores_gemma":[0.0010614076,0.00043525494,0.3946538,0.0003695765,0.00007344709,0.000009748974,0.00083479105,0.586116,0.0004496936,0.015928725,0.000015365309,0.000052166535],"about_ca_topic_score_codex":0.000046184217,"about_ca_topic_score_gemma":0.0000079995125,"teacher_disagreement_score":0.23302701,"about_ca_system_score_codex":0.00041134242,"about_ca_system_score_gemma":0.0009101305,"threshold_uncertainty_score":0.7253108},"labels":[],"label_agreement":null},{"id":"W2272145616","doi":"10.1057/jors.2014.127","title":"Coordinating contracts for supply chains that market with mail-in rebates and retailer promotions","year":2015,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Newsvendor model; Supply chain; Business; Order (exchange); Purchasing; Supply chain management; Work (physics); Marketing; Industrial organization; Finance","score_opus":0.12039845043525682,"score_gpt":0.32144319413650785,"score_spread":0.20104474370125103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2272145616","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.8649667,0.00043353118,0.00092614716,0.113932565,0.0004897853,0.002061037,0.000013633514,0.00001359101,0.017163038],"genre_scores_gemma":[0.99252343,0.000029788045,0.0011941126,0.00085908687,0.00065902487,0.00003996788,0.000005247749,0.000014311124,0.0046750284],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985236,0.00006516856,0.00022968378,0.00012472497,0.0008037562,0.00025308246],"domain_scores_gemma":[0.99852943,0.00020758837,0.00015318567,0.00010519202,0.0009727136,0.000031873165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056431643,0.00008846852,0.0001383403,0.00010422349,0.00034935703,0.00043392892,0.00024934806,0.000039455394,0.000113466085],"category_scores_gemma":[0.0008151181,0.000053106767,0.000086198124,0.0002952975,0.00013769374,0.0010177214,0.00014954519,0.00030071771,0.0000027992692],"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.00048602556,0.00044571943,0.17216523,0.00028614583,0.0002525964,0.000015169238,0.0015227295,0.0013572469,0.00060041976,0.047762148,0.7733111,0.0017955196],"study_design_scores_gemma":[0.011585483,0.00046077304,0.20698616,0.0010879639,0.000112643924,0.00005535662,0.026090723,0.19924352,0.0004079921,0.016489016,0.5369094,0.000570956],"about_ca_topic_score_codex":0.000053986903,"about_ca_topic_score_gemma":0.00006900688,"teacher_disagreement_score":0.23640165,"about_ca_system_score_codex":0.00013806303,"about_ca_system_score_gemma":0.0001540984,"threshold_uncertainty_score":0.41843864},"labels":[],"label_agreement":null},{"id":"W2287735273","doi":"10.1057/jors.2015.46","title":"A computational study of hybrid approaches of metaheuristic algorithms for the cell formation problem","year":2015,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Simulated annealing; A priori and a posteriori; Computer science; Mathematical optimization; Metaheuristic; Neighbourhood (mathematics); Local search (optimization); Algorithm; Iterated local search; Benchmark (surveying); Population; Tabu search; Mathematics","score_opus":0.19473064364162745,"score_gpt":0.3470540160032873,"score_spread":0.15232337236165983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287735273","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.035041135,0.00026052873,0.96347004,0.00031950325,0.00010083228,0.00062559353,0.000025748643,0.00000510269,0.0001515368],"genre_scores_gemma":[0.9328006,0.000027064963,0.06698969,0.0000057124676,0.000081403276,0.000019857789,0.0000065136073,0.000008751682,0.000060402417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986237,0.000089781795,0.0003763663,0.00004912277,0.0007591663,0.00010184063],"domain_scores_gemma":[0.9980806,0.00058063574,0.00014560377,0.000095603515,0.0010618644,0.000035682515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001953401,0.000060646475,0.0001263126,0.000035842215,0.00015046413,0.000029146006,0.00024299847,0.000018776176,0.0000020732293],"category_scores_gemma":[0.00026438668,0.000034315886,0.00010178415,0.00013019369,0.000077572375,0.00017479205,0.00004257622,0.00022766295,2.4595226e-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.000021615135,0.00012468125,0.000015700201,0.000060798662,0.000074407224,1.0263116e-7,0.0016820098,0.99406064,0.000059108173,0.00037359694,0.0032624174,0.00026492632],"study_design_scores_gemma":[0.000781882,0.00021664854,0.00012645731,0.000014525305,0.000030701074,0.000007010583,0.003323003,0.987452,0.0030930152,0.004729542,0.00018769263,0.00003757461],"about_ca_topic_score_codex":0.0000038900216,"about_ca_topic_score_gemma":9.864448e-7,"teacher_disagreement_score":0.89775944,"about_ca_system_score_codex":0.00009628449,"about_ca_system_score_gemma":0.00013932394,"threshold_uncertainty_score":0.13993613},"labels":[],"label_agreement":null},{"id":"W2291592553","doi":"10.1057/jors.2015.90","title":"Solving the vehicle routing problem with lunch break arising in the furniture delivery industry","year":2015,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":36,"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é Laval","funders":"","keywords":"Vehicle routing problem; Computer science; Heuristic; Mathematical optimization; Routing (electronic design automation); Integer programming; Heuristics; Linear programming; Process (computing); Last mile (transportation); Operations research; Algorithm; Mathematics; Mile; Artificial intelligence","score_opus":0.07099147204568494,"score_gpt":0.34300034658101936,"score_spread":0.2720088745353344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291592553","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.96947366,0.0006090655,0.008679506,0.018304769,0.00019182177,0.00046106786,0.0000035859246,0.000024684989,0.0022518516],"genre_scores_gemma":[0.9758264,0.000034475797,0.023103734,0.0003950389,0.00046131643,0.000008351494,8.7445886e-7,0.000024247953,0.00014556127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967161,0.0009364685,0.00037392598,0.00009998983,0.0015359012,0.0003376045],"domain_scores_gemma":[0.9978217,0.0008735264,0.000101832076,0.00023194666,0.0008916467,0.00007933931],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.012971357,0.000113842245,0.00013475902,0.00004481246,0.00058496254,0.00040451845,0.00074550236,0.00015825013,0.000011683478],"category_scores_gemma":[0.0007357898,0.00005193974,0.000105350315,0.0008314369,0.00014543961,0.00040976252,0.00012426246,0.0031954146,0.0000020312],"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.000016926997,0.000028125462,0.008358316,0.000013000193,0.00005958579,0.0000045987636,0.009379977,0.9689086,0.001420962,0.0002754822,0.010873302,0.00066111825],"study_design_scores_gemma":[0.0013926432,0.00011767841,0.018716067,0.00043821792,0.000031870695,0.00034917417,0.025495283,0.94811887,0.0012000492,0.00078748236,0.0031283044,0.00022436999],"about_ca_topic_score_codex":0.000035646015,"about_ca_topic_score_gemma":0.00001978898,"teacher_disagreement_score":0.020789744,"about_ca_system_score_codex":0.0004004069,"about_ca_system_score_gemma":0.0006255695,"threshold_uncertainty_score":0.99910426},"labels":[],"label_agreement":null},{"id":"W2406081839","doi":"10.1057/jors.2015.24","title":"Offering a downgraded service to enhance profit?","year":2015,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":true,"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; National Natural Science Foundation of China","keywords":"Service (business); Service provider; Business; Service design; Service delivery framework; Service level objective; Profit (economics); Purchasing; Service product management; Competition (biology); Service management; Marketing; Supply chain; Economics; Supply chain management; Microeconomics","score_opus":0.1387938037290649,"score_gpt":0.37707853091928056,"score_spread":0.23828472719021565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406081839","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.8083209,0.00013316161,0.00063760113,0.17343998,0.0011855963,0.0007630702,0.0000017417121,0.000020523834,0.015497479],"genre_scores_gemma":[0.9748229,0.00000959061,0.0012473657,0.016793018,0.0029790993,0.000025395291,0.0000022593408,0.000017645167,0.0041027195],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99774665,0.0000504977,0.00027669902,0.00012324084,0.0015451454,0.00025774102],"domain_scores_gemma":[0.9976886,0.000050299772,0.0001132874,0.00018589373,0.0019136015,0.00004833368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003736208,0.00008595289,0.000117878255,0.00009432784,0.00032001405,0.00043799652,0.00068238593,0.000034464065,0.00013667897],"category_scores_gemma":[0.0006161613,0.000054942102,0.00013489705,0.000868501,0.00004373559,0.0008751023,0.00053267786,0.00035959543,0.00019142662],"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.00011121804,0.0001121369,0.0035407662,0.00011984296,0.00010646164,0.0000048736642,0.0013411333,0.0046766642,0.007087594,0.014602435,0.96726435,0.0010325349],"study_design_scores_gemma":[0.0008781122,0.0000704263,0.007172983,0.00022991214,0.000025372585,0.0000077387385,0.004982743,0.014380583,0.0023672436,0.0047919955,0.9648619,0.00023093206],"about_ca_topic_score_codex":0.00011267164,"about_ca_topic_score_gemma":0.000031388336,"teacher_disagreement_score":0.16650206,"about_ca_system_score_codex":0.00021244206,"about_ca_system_score_gemma":0.00019650487,"threshold_uncertainty_score":0.42236105},"labels":[],"label_agreement":null},{"id":"W2597846560","doi":"10.1057/s41274-017-0201-z","title":"Dig-limits optimization through mixed-integer linear programming in open-pit mines","year":2017,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Mining Techniques and Economics","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Loader; Excavator; Open-pit mining; Integer programming; Linear programming; Engineering; Computer science; Mining engineering; Civil engineering; Mathematical optimization; Mathematics; Mechanical engineering","score_opus":0.133189246430766,"score_gpt":0.40414308883617944,"score_spread":0.2709538424054134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2597846560","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.8235932,0.0009074155,0.12872699,0.02580475,0.0023656855,0.0020748237,0.00003600117,0.00009284156,0.01639832],"genre_scores_gemma":[0.8066642,0.00097619655,0.19070472,0.00009949354,0.00056573027,0.00002884946,0.000004191788,0.000034535133,0.00092203927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899405,0.000051684015,0.00032827642,0.000092099755,0.0003160897,0.00021779256],"domain_scores_gemma":[0.99916095,0.00009569651,0.000098805416,0.00027904022,0.00031954312,0.000045982604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020011407,0.00008186369,0.00015192889,0.000028353259,0.00047023722,0.00060984696,0.0011089596,0.00008507325,0.0000463031],"category_scores_gemma":[0.0004853031,0.000058179015,0.0001234324,0.000084257874,0.00009484149,0.00096677453,0.0002779956,0.00047742974,0.0000028849936],"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.000031576838,0.00009593883,0.003291728,0.0000456064,0.000094634066,0.0000051956845,0.0015577254,0.9153793,0.0008480765,0.002567413,0.07378188,0.002300969],"study_design_scores_gemma":[0.0007866651,0.000101844395,0.0020375417,0.00030718822,0.000008097247,0.000033456465,0.00057876506,0.93920606,0.00388027,0.0011892514,0.051686253,0.00018460468],"about_ca_topic_score_codex":0.000041224015,"about_ca_topic_score_gemma":0.000046160018,"teacher_disagreement_score":0.06197773,"about_ca_system_score_codex":0.00022697925,"about_ca_system_score_gemma":0.00014049378,"threshold_uncertainty_score":0.58807683},"labels":[],"label_agreement":null},{"id":"W2609829388","doi":"10.1057/s41274-017-0213-8","title":"Managing losses in exotic horse race wagering","year":2017,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Sports Analytics and Performance","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":"McMaster University","funders":"","keywords":"Race (biology); Horse racing; Integer (computer science); Horizon; Horse; Mathematics; Computer science; Actuarial science; Econometrics; Business; Sociology; Biology","score_opus":0.16688297412231853,"score_gpt":0.3554627726158944,"score_spread":0.18857979849357584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609829388","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.974888,0.000996322,0.00034306193,0.01717096,0.00039464675,0.00009228959,0.0000075569405,0.0000012801994,0.0061058435],"genre_scores_gemma":[0.9941,0.0016509118,0.00037279588,0.00013507306,0.00028761875,0.0000018040938,3.6665264e-7,0.000007493915,0.0034439394],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9990779,0.000015852254,0.00041107793,0.00010756319,0.0001806634,0.00020693672],"domain_scores_gemma":[0.99912035,0.00006289691,0.0003096721,0.00029335788,0.00016269462,0.000050996186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039780186,0.00005669969,0.00017091891,0.00007848376,0.00070782553,0.00042473327,0.0006472408,0.00003972073,0.00021126225],"category_scores_gemma":[0.00045967003,0.00004309071,0.00017607602,0.000112344045,0.00013367867,0.00053512893,0.00017370323,0.0004962477,0.000029520425],"study_design_candidate":"observational","study_design_consensus":"observational","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.000040421608,0.00017843599,0.8439669,0.0000723369,0.00015544816,0.00004573104,0.0023092586,0.031523313,0.0002809113,0.09959308,0.020675352,0.0011588334],"study_design_scores_gemma":[0.0007470569,0.00005288889,0.81324375,0.00016018664,0.000003589444,0.00003494381,0.00045527724,0.1152861,0.00015714465,0.02959301,0.040104747,0.00016130894],"about_ca_topic_score_codex":0.00018475683,"about_ca_topic_score_gemma":0.00004698493,"teacher_disagreement_score":0.08376279,"about_ca_system_score_codex":0.00016729155,"about_ca_system_score_gemma":0.0000986418,"threshold_uncertainty_score":0.54440933},"labels":[],"label_agreement":null},{"id":"W2790169410","doi":"10.1080/01605682.2018.1440159","title":"Two-period pricing and ordering policy with price-sensitive uncertain demand","year":2018,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Economics; Demand management; Purchasing; Microeconomics; Product (mathematics); Supply chain; Industrial organization; Business; Marketing; Operations management","score_opus":0.04519415541789498,"score_gpt":0.33122021541783303,"score_spread":0.286026059999938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790169410","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.94027025,0.00010690694,0.0017372483,0.034112748,0.00022894521,0.00043839795,0.0000011494794,0.000012791993,0.023091568],"genre_scores_gemma":[0.99158126,0.000029379113,0.0012757983,0.0026474625,0.0033919413,0.000004003648,8.826171e-7,0.000013325405,0.0010559647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998486,0.00005136335,0.00020579317,0.00013010282,0.0008638142,0.00026292025],"domain_scores_gemma":[0.9985041,0.000076581426,0.00013729327,0.00011759316,0.001139639,0.000024794144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022798402,0.00009460713,0.00012063551,0.00012678375,0.00086973555,0.0004930935,0.00023543662,0.000026930937,0.000076359],"category_scores_gemma":[0.00036812987,0.000054918797,0.000075129836,0.0006221608,0.00033295204,0.0007693185,0.00030099537,0.00029709452,0.000011606519],"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.0015386583,0.00088016805,0.08128162,0.0010236225,0.0023319419,0.00013644979,0.020896513,0.015506379,0.047138058,0.55272883,0.2642663,0.01227142],"study_design_scores_gemma":[0.011177409,0.0009369182,0.11520914,0.0018371078,0.00022333823,0.00035930637,0.052248396,0.22561973,0.0045223334,0.015218267,0.5713394,0.0013086399],"about_ca_topic_score_codex":0.00019333628,"about_ca_topic_score_gemma":0.000045829354,"teacher_disagreement_score":0.5375106,"about_ca_system_score_codex":0.00015635198,"about_ca_system_score_gemma":0.00021639152,"threshold_uncertainty_score":0.66893905},"labels":[],"label_agreement":null},{"id":"W2794077441","doi":"10.1080/01605682.2018.1438761","title":"Applications of logic constrained equilibria to traffic networks and to power systems with storage","year":2018,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Transportation Planning and Optimization","field":"Social Sciences","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Computer science; Operations research; Information system; Scheduling (production processes); Computer data storage; Mathematical optimization; Engineering; Mathematics; Electrical engineering; Operating system","score_opus":0.03878335184551547,"score_gpt":0.3702936247805295,"score_spread":0.33151027293501406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794077441","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.76513934,0.00021461444,0.21118177,0.018992824,0.00026475347,0.0013301792,0.000034299155,0.00001532778,0.0028268513],"genre_scores_gemma":[0.9938594,0.00002159921,0.005027783,0.00019489757,0.00019577614,0.000011940116,0.0000016996962,0.0000045119746,0.000682401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985835,0.00019898292,0.00021540053,0.00008577,0.00076482986,0.00015153705],"domain_scores_gemma":[0.9979473,0.00023167366,0.000087593406,0.00007784214,0.0015078686,0.00014775025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023830957,0.000044575467,0.00009770258,0.000046798283,0.00059107004,0.00010779163,0.00021038247,0.00005002949,0.000041407842],"category_scores_gemma":[0.00017319572,0.000028557712,0.000043038202,0.0005891824,0.00040260665,0.00013184285,0.00001575128,0.00016507303,0.0000018936997],"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.00022978192,0.00013742519,0.0025078559,0.00002231321,0.0001323029,0.0000016715269,0.04323804,0.8699947,0.0015935818,0.055055913,0.026467154,0.0006192334],"study_design_scores_gemma":[0.0069933794,0.009571355,0.1309627,0.002202282,0.00025637358,0.00014474923,0.24074942,0.2413277,0.00044152598,0.0016736159,0.36407164,0.0016052687],"about_ca_topic_score_codex":0.0000441544,"about_ca_topic_score_gemma":0.000079692974,"teacher_disagreement_score":0.628667,"about_ca_system_score_codex":0.00006748636,"about_ca_system_score_gemma":0.0005272663,"threshold_uncertainty_score":0.45460927},"labels":[],"label_agreement":null},{"id":"W2800456440","doi":"10.1080/01605682.2017.1409411","title":"A two-period sourcing model with demand and supply risks","year":2018,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hamilton Health Sciences; Laurentian University","funders":"","keywords":"Purchasing; Production (economics); Yield (engineering); Product (mathematics); Carry (investment); Business; Industrial organization; Economics; Microeconomics; Marketing; Finance","score_opus":0.09225693361927755,"score_gpt":0.34672434751926456,"score_spread":0.254467413899987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800456440","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.96727294,0.00016518375,0.0027941857,0.020014782,0.00017407721,0.00031047355,0.0000018753115,0.000009654637,0.009256845],"genre_scores_gemma":[0.9924689,0.000029310419,0.001970377,0.0022369097,0.0018662302,0.0000061763067,0.0000010909957,0.00001395493,0.0014070511],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983661,0.000039847877,0.00021729186,0.00013346487,0.0009983325,0.00024496665],"domain_scores_gemma":[0.9987136,0.00004886941,0.00012619536,0.00014455541,0.00094107835,0.000025700556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026546803,0.00009389231,0.00012013447,0.00008350101,0.0009159263,0.00058986916,0.0003275678,0.000031204167,0.00016500785],"category_scores_gemma":[0.00015514858,0.000053320193,0.00010034696,0.00030527244,0.00035867398,0.00088152906,0.00030514636,0.00034716257,0.000015658823],"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.00086660206,0.00059608347,0.1239783,0.00038136353,0.0009364675,0.000028744891,0.0064689554,0.05572515,0.011444254,0.1354987,0.6605394,0.0035359932],"study_design_scores_gemma":[0.0033635928,0.00018127654,0.018864516,0.00031543328,0.00009402641,0.000051637482,0.006205681,0.8979912,0.00047249536,0.0106587885,0.061489675,0.00031171637],"about_ca_topic_score_codex":0.00007577008,"about_ca_topic_score_gemma":0.00004289634,"teacher_disagreement_score":0.842266,"about_ca_system_score_codex":0.00007343201,"about_ca_system_score_gemma":0.0001326305,"threshold_uncertainty_score":0.7044657},"labels":[],"label_agreement":null},{"id":"W2801514619","doi":"10.1080/01605682.2018.1457482","title":"A secondary goal in DEA cross-efficiency evaluation: A “one home run is much better than two doubles” criterion","year":2018,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Data envelopment analysis; Weighting; Mathematical optimization; Ranking (information retrieval); Efficiency; Computer science; Cardinality (data modeling); Ideal point; Set (abstract data type); Point (geometry); Operations research; Mathematics; Statistics; Data mining; Estimator; Artificial intelligence","score_opus":0.2150128802638039,"score_gpt":0.5223569650793601,"score_spread":0.3073440848155562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801514619","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.9704012,0.00038958294,0.0012063843,0.025544196,0.000534665,0.0003211418,0.000019215939,0.0000046093255,0.0015789625],"genre_scores_gemma":[0.99248606,0.000023369263,0.0027037053,0.0020287721,0.0011291289,0.000012251781,0.0000023486823,0.0000145680915,0.0015997994],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.98395485,0.0019333878,0.0015256391,0.000534807,0.011450653,0.00060068845],"domain_scores_gemma":[0.98687017,0.0017709646,0.00048304276,0.0007812086,0.00990713,0.00018749744],"candidate_categories":["metaresearch","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.056010008,0.00018353728,0.0004020848,0.00048746527,0.0015097493,0.001746841,0.0023975598,0.00014613882,0.00396514],"category_scores_gemma":[0.0057519064,0.00011273808,0.00065263134,0.0035732284,0.0013212988,0.0013211842,0.0005727722,0.0013206621,0.00023188788],"study_design_candidate":"observational","study_design_consensus":"observational","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.0012679412,0.0038844869,0.3767269,0.000059239028,0.0007102147,0.000051804975,0.0633013,0.01994008,0.11994998,0.00513048,0.366834,0.042143546],"study_design_scores_gemma":[0.0065942453,0.0009551987,0.49066648,0.00033925357,0.00008115958,0.00019944995,0.0034849301,0.39854223,0.009762397,0.071403585,0.017361015,0.00061004364],"about_ca_topic_score_codex":0.000081758844,"about_ca_topic_score_gemma":0.00014400863,"teacher_disagreement_score":0.37860215,"about_ca_system_score_codex":0.00066498184,"about_ca_system_score_gemma":0.002860902,"threshold_uncertainty_score":0.99979013},"labels":[],"label_agreement":null},{"id":"W2808256502","doi":"10.1080/01605682.2017.1390532","title":"Mathematical model, heuristics and exact method for order picking in narrow aisles","year":2017,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Transport Canada","funders":"Canadian Natural Resources Limited","keywords":"Aisle; Heuristics; Order picking; Computer science; Operator (biology); Set (abstract data type); Mathematical optimization; Representation (politics); Order (exchange); Operations research; Purchasing; Industrial engineering; Warehouse; Mathematics; Operations management; Engineering","score_opus":0.0885045417755892,"score_gpt":0.41407966613031094,"score_spread":0.32557512435472175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808256502","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.011423188,0.00009774081,0.9868679,0.0011266118,0.00006231055,0.000122058365,0.0000063699754,0.0000040669597,0.0002897414],"genre_scores_gemma":[0.592779,0.00011517937,0.40673625,0.000023084105,0.00011172816,0.000005434682,7.0452666e-7,0.000010674508,0.00021794133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926966,0.000035671037,0.00019067727,0.00005951883,0.00030270132,0.00014177586],"domain_scores_gemma":[0.99904907,0.0004103193,0.000052328487,0.00012977698,0.0003184305,0.00004006608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015205829,0.000057606474,0.00010950382,0.000025138512,0.0004190017,0.00015380069,0.00021764323,0.00005199436,0.000004688237],"category_scores_gemma":[0.0018283449,0.00003905305,0.000055222954,0.000032120384,0.00008416843,0.00018372956,0.00005927204,0.00034687982,2.2630307e-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.000006778307,0.000012444071,0.000051586852,0.000047460322,0.000014774819,4.4983662e-7,0.00031179574,0.99188703,0.00057561503,0.005013851,0.0017651374,0.00031307136],"study_design_scores_gemma":[0.0002681691,0.00001561847,0.00019749075,0.000042528416,0.000004758096,0.0000067515384,0.000103354796,0.96858174,0.0009736852,0.029587004,0.00017567258,0.00004324851],"about_ca_topic_score_codex":0.0000016596645,"about_ca_topic_score_gemma":0.0000030423898,"teacher_disagreement_score":0.5813558,"about_ca_system_score_codex":0.00008332471,"about_ca_system_score_gemma":0.00007451235,"threshold_uncertainty_score":0.32226646},"labels":[],"label_agreement":null},{"id":"W2897949212","doi":"10.1080/01605682.2018.1495158","title":"Data envelopment analysis with interactive fuzzy variables","year":2018,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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":"Sheridan College","funders":"National Office for Philosophy and Social Sciences; National Natural Science Foundation of China","keywords":"Data envelopment analysis; Fuzzy logic; Computer science; Data mining; Operations research; Fuzzy number; Purchasing; Fuzzy set operations; Fuzzy set; Mathematical optimization; Mathematics; Artificial intelligence; Operations management; Engineering","score_opus":0.2713218926309562,"score_gpt":0.5100930516040802,"score_spread":0.23877115897312406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897949212","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.7872404,0.00039534835,0.1211725,0.07169009,0.0010265264,0.00058268214,0.00023541733,0.000015871205,0.017641183],"genre_scores_gemma":[0.9751376,0.000030545954,0.02058574,0.0004934081,0.00046309675,0.0000016748634,0.000006298425,0.0000065632084,0.003275096],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9904083,0.001114176,0.00078543584,0.0003941333,0.0070046796,0.00029329743],"domain_scores_gemma":[0.98702466,0.0035204645,0.0005060533,0.0012972703,0.007509163,0.00014239168],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.030423341,0.00010663948,0.00031788283,0.00036807286,0.0011503325,0.0008871444,0.0039411904,0.000055776567,0.0007627982],"category_scores_gemma":[0.008856912,0.00004847949,0.0003370516,0.0056630503,0.0008175331,0.001043412,0.0010497011,0.00066308456,0.000075767726],"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.0006526062,0.0011056854,0.068754666,0.0000062444374,0.010515118,0.000022149216,0.014330664,0.048728086,0.007324701,0.0070434874,0.8333859,0.008130724],"study_design_scores_gemma":[0.0017586855,0.0010710628,0.13448209,0.00018985014,0.0012843438,0.00015646919,0.018628852,0.50518656,0.0051378487,0.025254909,0.30624858,0.00060078286],"about_ca_topic_score_codex":0.00003961827,"about_ca_topic_score_gemma":0.000189425,"teacher_disagreement_score":0.5271373,"about_ca_system_score_codex":0.0002618325,"about_ca_system_score_gemma":0.0016386625,"threshold_uncertainty_score":0.99949193},"labels":[],"label_agreement":null},{"id":"W2909094368","doi":"10.1080/01605682.2018.1510805","title":"Discrete-event simulation and design of experiments to study ambulatory patient waiting time in an emergency department","year":2019,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Emergency and Acute Care Studies","field":"Medicine","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Overcrowding; Emergency department; Ambulatory; Medical emergency; Medicine; Ambulatory care; Front line; Emergency medicine; Health care; Nursing","score_opus":0.0892249545169544,"score_gpt":0.4464426326439867,"score_spread":0.3572176781270323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909094368","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.9979446,0.00037883583,0.00009740683,0.0005638265,0.00008783258,0.0008916985,0.0000032489215,0.0000010741263,0.000031495358],"genre_scores_gemma":[0.9990507,0.00006903842,0.0006292381,0.000060812832,0.00006283046,0.000013277602,0.0000014826935,0.0000067340334,0.00010589539],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9981074,0.00029617938,0.00042400497,0.000110984634,0.0009249581,0.000136523],"domain_scores_gemma":[0.99898106,0.000100895704,0.00009315922,0.0001147534,0.0006324029,0.0000777523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014871169,0.00006849123,0.00017259346,0.000047380076,0.00013400757,0.000008691254,0.000086058106,0.000024735296,0.00013812633],"category_scores_gemma":[0.000211979,0.000042525953,0.00008566546,0.0001757279,0.000027328684,0.00013801464,0.00011515046,0.00019489053,0.0000024725896],"study_design_candidate":"observational","study_design_consensus":"observational","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.0010754381,0.0028978675,0.47224018,0.00008659228,0.0007419915,0.000011906864,0.055559106,0.2629258,0.19636399,0.00009175754,0.0057583093,0.0022470714],"study_design_scores_gemma":[0.0043590846,0.012048575,0.7517246,0.00051381387,0.00010031541,0.000012164238,0.04115382,0.17221382,0.016903425,0.00023864408,0.00044093493,0.00029082986],"about_ca_topic_score_codex":0.000006628645,"about_ca_topic_score_gemma":0.0000015805111,"teacher_disagreement_score":0.2794844,"about_ca_system_score_codex":0.0001317889,"about_ca_system_score_gemma":0.0001184744,"threshold_uncertainty_score":0.17341581},"labels":[],"label_agreement":null},{"id":"W2911799554","doi":"10.1080/01605682.2018.1507424","title":"A robust optimization approach to model supply and demand uncertainties in inventory systems","year":2019,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematical optimization; Robust optimization; Computer science; Operations research; Tree (set theory); Robustness (evolution); Scheduling (production processes); Mathematics","score_opus":0.1968097072148363,"score_gpt":0.39835964848768435,"score_spread":0.20154994127284806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911799554","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.6693227,0.0009888755,0.3184037,0.005402572,0.00044311024,0.0010847837,0.000013714748,0.000004561955,0.0043359473],"genre_scores_gemma":[0.94906324,0.00077911484,0.04226471,0.00023457722,0.00013560602,0.000013583424,0.000003009558,0.00001044803,0.0074957088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99600744,0.00053070893,0.00059434754,0.00019763916,0.0024732875,0.00019658609],"domain_scores_gemma":[0.9975486,0.00039828743,0.0001732808,0.00021939514,0.0015428155,0.00011761203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011302592,0.0000786552,0.00020146427,0.00021987267,0.0002374305,0.0005451718,0.0005494603,0.000080865786,0.000024824772],"category_scores_gemma":[0.0010442677,0.00004511959,0.00010883755,0.00090006203,0.0000938938,0.0006566101,0.0001752545,0.0003673294,0.000005623589],"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.00003355177,0.000039974784,0.016971536,0.000004825802,0.000010657476,1.9080018e-7,0.0018921166,0.96359134,0.000093399125,0.0020017107,0.015263941,0.00009675487],"study_design_scores_gemma":[0.00033657617,0.000044888955,0.00195678,0.000035165598,0.0000025108543,0.00001281222,0.0026725982,0.9933883,0.0000124580265,0.0007268415,0.0007577427,0.000053340547],"about_ca_topic_score_codex":0.000039181097,"about_ca_topic_score_gemma":0.0000054252673,"teacher_disagreement_score":0.27974048,"about_ca_system_score_codex":0.00017158691,"about_ca_system_score_gemma":0.00056709285,"threshold_uncertainty_score":0.5257104},"labels":[],"label_agreement":null},{"id":"W2969271328","doi":"10.1080/01605682.2019.1650625","title":"A two-echelon location-routing problem with synchronisation","year":2019,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Routing (electronic design automation); Vehicle routing problem; Facility location problem; Heuristic; Operations research; Mathematical optimization; Heuristics; Space (punctuation); Service (business); Computer network; Mathematics; Economics","score_opus":0.040601488755116454,"score_gpt":0.2840266485880459,"score_spread":0.24342515983292942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969271328","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.88806295,0.0010570273,0.080938876,0.004304307,0.00073493714,0.00117618,0.00001659016,0.000070718386,0.02363843],"genre_scores_gemma":[0.99090457,0.000051663137,0.008114263,0.00005688679,0.00021945799,0.0000039507345,0.0000035615662,0.000014866075,0.0006308105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986607,0.000050201532,0.00023381111,0.00006726758,0.0008094522,0.00017861272],"domain_scores_gemma":[0.9989373,0.0001357171,0.000046564262,0.00012392063,0.0007057215,0.00005075976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001196588,0.0000703952,0.00009706376,0.000028474435,0.00016822579,0.000081840386,0.00022355163,0.000045002478,0.0000807741],"category_scores_gemma":[0.000040674113,0.000041922616,0.000079679456,0.00030890104,0.0000811027,0.00021735342,0.000016082473,0.00056538323,0.000020789748],"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.00004340859,0.0000820075,0.024473676,0.00019190452,0.00028524143,0.0000036851777,0.0024674402,0.9130328,0.018742021,0.028393855,0.0117221465,0.0005617753],"study_design_scores_gemma":[0.0045148027,0.00068021915,0.06668616,0.0010946845,0.00009254822,0.00021273617,0.0029693968,0.8910697,0.01171115,0.004223854,0.01613416,0.00061060366],"about_ca_topic_score_codex":0.000010825714,"about_ca_topic_score_gemma":0.000010871392,"teacher_disagreement_score":0.10284161,"about_ca_system_score_codex":0.00029390404,"about_ca_system_score_gemma":0.00036099888,"threshold_uncertainty_score":0.24563402},"labels":[],"label_agreement":null},{"id":"W2969973120","doi":"10.1080/01605682.2019.1644978","title":"Strategic joining in an M/M/K queue with asynchronous and synchronous multiple vacations","year":2019,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Unobservable; Social planner; Social Welfare; Asynchronous communication; Queue; Microeconomics; Computer science; Queueing theory; Operations research; Business; Economics; Econometrics; Mathematics; Computer network","score_opus":0.044773392016632066,"score_gpt":0.32200251657684503,"score_spread":0.277229124560213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969973120","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.99596655,0.000086502616,0.0004264868,0.002541646,0.000048769423,0.00018256536,0.0000010706366,0.000005675337,0.00074073655],"genre_scores_gemma":[0.99682295,0.000018721192,0.0022023397,0.0003959555,0.0003642935,0.0000058851774,0.0000036283232,0.0000140820885,0.00017212065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986861,0.00009467975,0.00023913261,0.00015216299,0.0006103349,0.00021759051],"domain_scores_gemma":[0.99863297,0.00026476124,0.00017815921,0.00018813684,0.0007144665,0.000021519292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020020339,0.00009118749,0.00016102525,0.0001306783,0.0003786432,0.00034684016,0.00032147858,0.000045980232,0.00011206953],"category_scores_gemma":[0.00022351567,0.000057688325,0.00008059837,0.00058907527,0.00012640141,0.0016466758,0.00012230453,0.0005583502,0.000016502026],"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.00041109553,0.0006282016,0.34944594,0.00022325665,0.0003376464,0.000021558984,0.0017036595,0.47315794,0.035386316,0.13586646,0.0014335915,0.0013843223],"study_design_scores_gemma":[0.0040167402,0.0003323776,0.12556815,0.0005640434,0.00009951174,0.000079609184,0.016617317,0.8037448,0.0003801103,0.045267396,0.002792059,0.0005378949],"about_ca_topic_score_codex":0.00009682845,"about_ca_topic_score_gemma":0.00024499238,"teacher_disagreement_score":0.33058685,"about_ca_system_score_codex":0.0001563311,"about_ca_system_score_gemma":0.00024662787,"threshold_uncertainty_score":0.33445877},"labels":[],"label_agreement":null},{"id":"W2970111987","doi":"10.1080/01605682.2019.1630329","title":"Measuring efficiency in DEA in the presence of common inputs","year":2019,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Data envelopment analysis; Operations research; Computer science; Econometrics; Economics; Engineering; Statistics; Mathematics","score_opus":0.22522349012576287,"score_gpt":0.46056105905256894,"score_spread":0.23533756892680607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970111987","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.98670447,0.0002569507,0.00017950856,0.011208657,0.00013657624,0.00022422928,0.0000019498939,7.676387e-7,0.0012869047],"genre_scores_gemma":[0.9989805,0.00003218535,0.00031756202,0.00024773905,0.000054323944,0.0000023831224,1.652176e-7,0.0000039554416,0.00036115968],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9886791,0.0024318926,0.0010936726,0.0002068043,0.007289878,0.00029862416],"domain_scores_gemma":[0.99042404,0.0070006414,0.00036968305,0.0005937542,0.0015665462,0.000045359684],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.05524058,0.0000811913,0.00028560634,0.00029614716,0.00023650666,0.00024575548,0.0030876254,0.000067079935,0.00009305595],"category_scores_gemma":[0.010729946,0.000037970683,0.00033253388,0.0035167835,0.00033764998,0.0004445198,0.0003292638,0.001071757,0.000026650607],"study_design_candidate":"observational","study_design_consensus":"observational","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.0000974779,0.0009996083,0.5158707,0.000022592329,0.000039852082,0.000010801448,0.019575957,0.41955665,0.026506536,0.005218031,0.010839151,0.0012626826],"study_design_scores_gemma":[0.0016175599,0.00036182336,0.69561476,0.0005220969,0.000013115908,0.000064960856,0.010624361,0.26053956,0.0071562184,0.019640954,0.00362256,0.00022201856],"about_ca_topic_score_codex":0.00009461818,"about_ca_topic_score_gemma":0.00016877524,"teacher_disagreement_score":0.17974411,"about_ca_system_score_codex":0.00018661476,"about_ca_system_score_gemma":0.00077480316,"threshold_uncertainty_score":0.9976031},"labels":[],"label_agreement":null},{"id":"W3001004579","doi":"10.1080/01605682.2019.1700179","title":"Sublevel stope layout planning through a greedy heuristic approach based on dynamic programming","year":2020,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Mining Techniques and Economics","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Heuristics; Computer science; Benchmark (surveying); Heuristic; Greedy algorithm; Limit (mathematics); Set (abstract data type); Plan (archaeology); Algorithm; Mathematics","score_opus":0.13362556708655565,"score_gpt":0.35436592306229325,"score_spread":0.2207403559757376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3001004579","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.51905745,0.00080567494,0.44909582,0.020328445,0.00057381944,0.0013385774,0.000070397844,0.00024388224,0.008485954],"genre_scores_gemma":[0.90945727,0.000030448027,0.089524485,0.00064865686,0.00022474279,0.000012484357,0.0000056793515,0.000027171645,0.00006908878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998745,0.00006796487,0.00029559445,0.00011107168,0.0005319882,0.00024833452],"domain_scores_gemma":[0.9993384,0.00014877344,0.000056031455,0.00013225355,0.00023068073,0.00009384527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012065315,0.000100801946,0.00015525952,0.00002442182,0.00025708406,0.00015246171,0.0004291058,0.00007273657,0.000027968721],"category_scores_gemma":[0.00028986353,0.000072122144,0.00018582138,0.00020514517,0.000064456144,0.00016985054,0.00006986004,0.000932226,0.0000049856053],"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.00005033074,0.00005767193,0.0005284393,0.00010281991,0.00008099781,0.000005166026,0.0029204744,0.9503482,0.0007140109,0.0006525115,0.043835793,0.0007035692],"study_design_scores_gemma":[0.00030738572,0.00014544446,0.00045936904,0.00007236275,0.0000062974195,0.000011203754,0.0005112559,0.989176,0.00012928373,0.0001379935,0.008957425,0.00008598075],"about_ca_topic_score_codex":0.000003855193,"about_ca_topic_score_gemma":4.6022075e-7,"teacher_disagreement_score":0.3903998,"about_ca_system_score_codex":0.0002466607,"about_ca_system_score_gemma":0.00018971546,"threshold_uncertainty_score":0.405011},"labels":[],"label_agreement":null},{"id":"W3002166437","doi":"10.1080/01605682.2019.1685362","title":"Near-optimal search-and-rescue path planning for a moving target","year":2020,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Robotic Path Planning Algorithms","field":"Computer Science","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":"Defence Research and Development Canada","funders":"","keywords":"Mathematical optimization; Computer science; Motion planning; Heuristic; Integer programming; Path (computing); Computational complexity theory; Mathematics; Algorithm; Artificial intelligence","score_opus":0.11041881033095456,"score_gpt":0.375413378670801,"score_spread":0.2649945683398464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002166437","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.08429995,0.00044670943,0.86734796,0.047342565,0.00018920645,0.00030464408,0.000011936137,0.000016801421,0.00004024551],"genre_scores_gemma":[0.24619117,0.000017000197,0.75182295,0.0012585983,0.00055422646,0.000007844683,0.0000012455201,0.000011356232,0.00013561123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974261,0.00028469483,0.00031450563,0.00021396251,0.0013817411,0.00037900082],"domain_scores_gemma":[0.99808955,0.00062987633,0.000059222162,0.00017234335,0.0007977927,0.00025123818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038041167,0.00009757754,0.00017546913,0.000027946975,0.0009171127,0.00061540114,0.0011683992,0.000063441905,0.0000054049756],"category_scores_gemma":[0.0013401224,0.00006472599,0.0002067431,0.0003592434,0.0001695972,0.0005825552,0.0005671136,0.0008547414,0.000003528155],"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.000050725055,0.00004939371,0.0012084701,0.000052747084,0.00012747856,0.000024592246,0.01756643,0.93031454,0.0063143633,0.0038278338,0.03937101,0.0010923964],"study_design_scores_gemma":[0.00045981637,0.00024217041,0.0020883514,0.00006634546,0.0000034048496,0.000054123353,0.00045538502,0.9936247,0.00063688896,0.00027784298,0.0020161918,0.00007478273],"about_ca_topic_score_codex":0.000009691578,"about_ca_topic_score_gemma":6.359024e-8,"teacher_disagreement_score":0.1618912,"about_ca_system_score_codex":0.0001020335,"about_ca_system_score_gemma":0.001021589,"threshold_uncertainty_score":0.70537823},"labels":[],"label_agreement":null},{"id":"W3016112440","doi":"10.1080/01605682.2019.1678409","title":"Efficiency measurement for hierarchical situations","year":2020,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Data envelopment analysis; Computer science; Operations research; Set (abstract data type); Aggregate (composite); Projection (relational algebra); Efficient frontier; Unit (ring theory); Project management; Industrial engineering; Mathematical optimization; Economics; Engineering; Mathematics; Systems engineering; Portfolio; Algorithm","score_opus":0.46168337662408426,"score_gpt":0.5017266302751442,"score_spread":0.04004325365105993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016112440","genre_codex":"commentary","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.087423466,0.0004946738,0.36736453,0.5421576,0.0005087022,0.000721955,0.000030791794,0.000010227915,0.0012880889],"genre_scores_gemma":[0.98784685,0.000016382664,0.008892611,0.0021574611,0.0006482203,0.000008199168,6.4424205e-7,0.000007827927,0.00042182673],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9880213,0.00084421324,0.0009129461,0.00026163075,0.009661744,0.0002981384],"domain_scores_gemma":[0.9866079,0.0034821054,0.00030470546,0.00033362658,0.009022682,0.00024898065],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.03025894,0.00008841197,0.00023439036,0.00010163719,0.0012870672,0.0005041996,0.0018477893,0.00006208887,0.00017354092],"category_scores_gemma":[0.055067506,0.000046816353,0.0008178388,0.001970826,0.0003663355,0.00029815847,0.00023618655,0.00068765774,0.00004616748],"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.00018000824,0.0005545046,0.0016122448,0.000015883965,0.00023940155,0.0000024560575,0.008486059,0.1215261,0.05663431,0.027573507,0.7768523,0.006323213],"study_design_scores_gemma":[0.0018205789,0.0008734748,0.0063254843,0.00007315732,0.00007980197,0.000025586098,0.003987194,0.72809315,0.005543118,0.06882594,0.18407872,0.0002737786],"about_ca_topic_score_codex":0.0000022366005,"about_ca_topic_score_gemma":0.000004681649,"teacher_disagreement_score":0.90042335,"about_ca_system_score_codex":0.00024289961,"about_ca_system_score_gemma":0.0018687006,"threshold_uncertainty_score":0.9985525},"labels":[],"label_agreement":null},{"id":"W3036432451","doi":"10.1080/01605682.2020.1755897","title":"Algorithms for the Calzedonia workload allocation problem","year":2020,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Assembly Line Balancing Optimization","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; University of Bath","keywords":"Workload; Computer science; Mathematical optimization; Heuristic; Metaheuristic; Variable neighborhood search; Scheduling (production processes); Sequence (biology); Heuristics; Variable (mathematics); Job shop scheduling; Simple (philosophy); Project management; Process (computing); Operations research; Algorithm; Mathematics; Artificial intelligence; Schedule; Engineering","score_opus":0.07282075552152109,"score_gpt":0.34219029445526494,"score_spread":0.2693695389337438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036432451","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.010273107,0.0021759116,0.85023147,0.13487712,0.00059256126,0.0013753338,0.000020859477,0.00005208167,0.00040157966],"genre_scores_gemma":[0.90078264,0.0009172644,0.09383283,0.0011436677,0.0027194961,0.00007657023,0.0000071721392,0.00005176131,0.00046860756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998688,0.000072185896,0.00027763742,0.00007142484,0.0007127765,0.00017802102],"domain_scores_gemma":[0.9984473,0.00046642052,0.00005679899,0.000104421044,0.00085566874,0.00006940785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015376352,0.00007079595,0.00009674507,0.000013840842,0.0003977029,0.00012638088,0.0004032049,0.000055805293,0.000016233189],"category_scores_gemma":[0.0004885645,0.0000393537,0.00017130803,0.0003412217,0.000056216322,0.00020615284,0.000052055326,0.00048877887,0.0000052002047],"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.000016366808,0.000013574433,0.00009581637,0.000032405474,0.00010766543,1.7786087e-7,0.0012361492,0.88537544,0.006415581,0.0004512443,0.10409619,0.0021593838],"study_design_scores_gemma":[0.00036162094,0.00005384347,0.0007183651,0.00004220867,0.000015034063,0.0000056475096,0.00032270188,0.9776986,0.0019756034,0.00021838675,0.018532472,0.00005548511],"about_ca_topic_score_codex":0.000003269996,"about_ca_topic_score_gemma":0.0000025370207,"teacher_disagreement_score":0.89050955,"about_ca_system_score_codex":0.00016190669,"about_ca_system_score_gemma":0.0002553682,"threshold_uncertainty_score":0.30588493},"labels":[],"label_agreement":null},{"id":"W3038132896","doi":"10.1080/01605682.2020.1766848","title":"Special issue on <i>healthcare behavioural OR</i>","year":2020,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","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":"University of Toronto","funders":"","keywords":"Health care; Project management; Information and Communications Technology; Operations research; Computer science; Management science; Management; Economics; Engineering; Economic growth; World Wide Web","score_opus":0.37355796743339237,"score_gpt":0.5388450722009438,"score_spread":0.16528710476755143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038132896","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100504674,0.0000920911,0.00040616197,0.8864635,0.0032871547,0.001427291,0.000085036365,0.00002168512,0.007712358],"genre_scores_gemma":[0.7319605,0.001098349,0.01688713,0.102107845,0.12566315,0.00009476616,0.000046693018,0.000096378666,0.022045238],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99526477,0.0017443876,0.0007997726,0.00017380304,0.001587946,0.00042934518],"domain_scores_gemma":[0.99568963,0.00077854504,0.00023340956,0.0001931858,0.0027348457,0.00037038964],"candidate_categories":["sts","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0035154202,0.0001129794,0.00023019928,0.000041742474,0.0028889861,0.00006851575,0.0004684314,0.00020442298,0.002658703],"category_scores_gemma":[0.002440205,0.00006317168,0.00021225729,0.0006372657,0.0001115407,0.00025328735,0.00013653519,0.0027711287,0.00019913084],"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.00034621952,0.000086773616,0.0071703247,0.000080064376,0.00003232771,0.000006750887,0.012147632,0.00262463,0.000196247,0.0033622072,0.97247064,0.0014761627],"study_design_scores_gemma":[0.0021069467,0.0014190682,0.011996018,0.00048400986,0.000019540515,0.0000170929,0.014470216,0.009186172,0.00017733812,0.00018912274,0.95972145,0.00021302223],"about_ca_topic_score_codex":0.00008275944,"about_ca_topic_score_gemma":0.0000751275,"teacher_disagreement_score":0.7843557,"about_ca_system_score_codex":0.0004825477,"about_ca_system_score_gemma":0.004083811,"threshold_uncertainty_score":0.99952954},"labels":[],"label_agreement":null},{"id":"W3095370396","doi":"10.1080/01605682.2020.1824550","title":"Tri-party reverse supply chain coordination with competitive product acquisition process","year":2020,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":29,"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 Lethbridge","funders":"","keywords":"Supply chain; Product (mathematics); Incentive; Business; Quality (philosophy); Competition (biology); Industrial organization; Purchasing; Control (management); Process (computing); Tariff; Computer science; Operations research; Microeconomics; Marketing; Economics; Engineering","score_opus":0.03376628389292194,"score_gpt":0.2980879861201479,"score_spread":0.26432170222722595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095370396","genre_codex":"commentary","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.37620878,0.0001834629,0.0021200269,0.61127543,0.00033913233,0.0025008868,0.000013104736,0.000048771893,0.0073103835],"genre_scores_gemma":[0.9898821,0.0000143722955,0.0005126679,0.0061374297,0.002382643,0.000029601952,0.000018650246,0.000021003734,0.0010015278],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972074,0.00011509346,0.0003266531,0.00022279276,0.0018239564,0.00030409297],"domain_scores_gemma":[0.99588704,0.0001095192,0.0002885675,0.00014665523,0.003533415,0.000034802666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030013034,0.00013243874,0.0001791571,0.000105261934,0.0006623738,0.0004794261,0.00052296865,0.000037790312,0.0003273621],"category_scores_gemma":[0.00087467715,0.00008338187,0.00015001715,0.0013229015,0.00018649595,0.0017392136,0.00022620574,0.0005574819,0.000030400355],"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.0014966658,0.0006175162,0.023245128,0.0014744599,0.00056671374,0.000075053315,0.004803535,0.032426286,0.005398334,0.093764655,0.8350143,0.001117366],"study_design_scores_gemma":[0.01243391,0.00085003144,0.06583338,0.0011370897,0.00036693717,0.00006664382,0.11761825,0.13734874,0.004807423,0.014675747,0.64358866,0.0012732004],"about_ca_topic_score_codex":0.000033057415,"about_ca_topic_score_gemma":0.0000065714858,"teacher_disagreement_score":0.6136733,"about_ca_system_score_codex":0.0002649757,"about_ca_system_score_gemma":0.00035926982,"threshold_uncertainty_score":0.50945103},"labels":[],"label_agreement":null},{"id":"W3112689802","doi":"10.1080/01605682.2020.1843980","title":"Regulatory jurisdiction and policy coordination: A bi-level modeling approach for performance-based environmental policy","year":2020,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","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":"HEC Montréal","funders":"","keywords":"Stylized fact; Jurisdiction; Scope (computer science); Economics; State (computer science); Environmental regulation; Public economics; Environmental economics; Industrial organization; Microeconomics; Business; Computer science; Political science; Macroeconomics","score_opus":0.26873481466085153,"score_gpt":0.33097810816000994,"score_spread":0.062243293499158414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112689802","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.8929966,0.0007451101,0.027876725,0.07652379,0.00009775201,0.00046152467,0.0005343083,0.000006396253,0.00075778447],"genre_scores_gemma":[0.9917415,0.0006203811,0.0041030603,0.0017853082,0.0014807929,0.000019849214,0.000019417188,0.000016232727,0.00021350913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990094,0.000027651007,0.00044911925,0.00016450863,0.00012368803,0.00022564208],"domain_scores_gemma":[0.9994049,0.00009220074,0.00019353328,0.00010468434,0.00007920076,0.00012545795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015458168,0.00008709945,0.00018820184,0.00012719554,0.0005225175,0.00011396278,0.00021934917,0.00008341874,0.000026212256],"category_scores_gemma":[0.0003367545,0.000076962744,0.00020311758,0.00020759094,0.00012149956,0.00034302627,0.00008925339,0.00029189204,0.0000055561513],"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.00076039066,0.0007057176,0.03402537,0.0007127505,0.0006245791,5.77553e-7,0.016218912,0.607958,0.0035495316,0.30413988,0.025521304,0.005782951],"study_design_scores_gemma":[0.00091144827,0.00012036364,0.0032120703,0.000010365369,0.000003650142,0.000005310826,0.00040262117,0.9881822,0.00014990442,0.0028115185,0.0041024964,0.00008807936],"about_ca_topic_score_codex":0.000035706224,"about_ca_topic_score_gemma":8.601254e-7,"teacher_disagreement_score":0.38022414,"about_ca_system_score_codex":0.00051234936,"about_ca_system_score_gemma":0.00026877382,"threshold_uncertainty_score":0.40188348},"labels":[],"label_agreement":null},{"id":"W3170564327","doi":"10.1080/01605682.2021.1907238","title":"Information technology and performance: Integrating data envelopment analysis and configurational approach","year":2021,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Efficiency Analysis Using DEA","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":"HEC Montréal","funders":"","keywords":"Data envelopment analysis; Computer science; Information technology; Sample (material); Set (abstract data type); Performance measurement; Perspective (graphical); Investment (military); Operations research; Measure (data warehouse); Econometrics; Industrial organization; Business; Economics; Data mining; Marketing; Engineering; Statistics; Mathematics; Artificial intelligence","score_opus":0.1542810115454037,"score_gpt":0.43894782173292657,"score_spread":0.2846668101875229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170564327","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.9260519,0.000526232,0.05167686,0.020223614,0.00009517238,0.00012525372,0.000031660562,0.0000044252165,0.0012648955],"genre_scores_gemma":[0.9679477,0.00023618597,0.030999992,0.0002654819,0.00006151616,0.000002289598,0.000028151519,0.000002252874,0.00045638913],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954028,0.00039853877,0.0007853415,0.00019855509,0.0030447843,0.00016994079],"domain_scores_gemma":[0.9945502,0.0009625575,0.00031636274,0.00048169098,0.003615838,0.00007335068],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.014443342,0.00007929594,0.00023572928,0.00054369436,0.00094627705,0.00087765825,0.0009443518,0.000084561034,0.00007756829],"category_scores_gemma":[0.00853089,0.000044761706,0.00011814172,0.0046038316,0.0004453544,0.0015165769,0.0008262804,0.00061542855,0.00000422064],"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.0001366423,0.00057472754,0.59217376,0.00007650259,0.004172358,0.0000073932542,0.020768357,0.03376425,0.013627874,0.07833966,0.058549706,0.19780876],"study_design_scores_gemma":[0.0004574018,0.00006514285,0.1252512,0.0000336288,0.00014848745,0.00019309741,0.017048417,0.8365415,0.0016912111,0.003769758,0.014662476,0.00013768346],"about_ca_topic_score_codex":0.000004582303,"about_ca_topic_score_gemma":0.000008681339,"teacher_disagreement_score":0.80277723,"about_ca_system_score_codex":0.00008954078,"about_ca_system_score_gemma":0.0010711084,"threshold_uncertainty_score":0.99982065},"labels":[],"label_agreement":null},{"id":"W3170758597","doi":"10.1080/01605682.2021.1915193","title":"Dynamic assessment modelling for project portfolio benefits","year":2021,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Complex Systems and Decision Making","field":"Decision Sciences","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Project management; Project portfolio management; Portfolio; Risk analysis (engineering); Management science; Realisation; Key (lock); Operations research; Systems engineering; Process management; Engineering; Business","score_opus":0.47338574630609437,"score_gpt":0.5609825844433983,"score_spread":0.08759683813730396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170758597","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.3311954,0.0044325497,0.6402746,0.016323948,0.0021849098,0.0011523252,0.000114852905,0.000009641084,0.0043117707],"genre_scores_gemma":[0.881383,0.000094317315,0.104165345,0.00032043428,0.00042156703,0.000018602927,0.0000018441826,0.000014848025,0.013580042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923285,0.0005216595,0.001029774,0.00027163685,0.0055612368,0.00028718074],"domain_scores_gemma":[0.9869879,0.0037121687,0.0003607314,0.00043955923,0.008404487,0.00009518083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018134806,0.000092079266,0.00028000385,0.00012951891,0.0009772776,0.0010190737,0.0009823308,0.000067572706,0.00017627972],"category_scores_gemma":[0.0037602612,0.0000498399,0.00075124094,0.0011105257,0.00007666889,0.00040838053,0.00037885635,0.000521091,0.00000591734],"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.000065499975,0.000231052,0.0010148551,0.000016277354,0.00014763787,0.0000117955,0.001011982,0.49872538,0.0037827608,0.07838766,0.40964603,0.006959063],"study_design_scores_gemma":[0.000587828,0.000082204446,0.0023658809,0.000101233294,0.0000076381675,0.00013751113,0.0024908544,0.85129863,0.00013335016,0.067814775,0.0748938,0.00008628074],"about_ca_topic_score_codex":0.0000104225455,"about_ca_topic_score_gemma":0.000017743261,"teacher_disagreement_score":0.5501876,"about_ca_system_score_codex":0.00029988136,"about_ca_system_score_gemma":0.003322584,"threshold_uncertainty_score":0.98269504},"labels":[],"label_agreement":null},{"id":"W3177003813","doi":"10.1080/01605682.2021.1923376","title":"A hybrid algorithm for task sequencing problems with iteration in product development","year":2021,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Product Development and Customization","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":"University of Calgary","funders":"","keywords":"Computer science; Algorithm; Cluster analysis; Task (project management); Genetic algorithm; Population-based incremental learning; Markov chain; Duration (music); Algorithm design; Mathematical optimization; Mathematics; Machine learning","score_opus":0.04984315453548529,"score_gpt":0.2884622303813252,"score_spread":0.23861907584583988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3177003813","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.86500573,0.0010201212,0.0849969,0.043589294,0.0010739331,0.0027447713,0.0000072371395,0.000031801606,0.0015301862],"genre_scores_gemma":[0.9019666,0.000053549185,0.08996288,0.0016132795,0.0027441753,0.00012924382,0.00010091566,0.000036934183,0.0033924351],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983228,0.000040231575,0.0003631036,0.00017725718,0.000873471,0.00022317571],"domain_scores_gemma":[0.9971144,0.000052084408,0.00016537604,0.000103320905,0.0025532248,0.000011568434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003096225,0.00008774378,0.00012423212,0.00009462548,0.00047880536,0.00044172598,0.00020442817,0.000023318693,0.00002785176],"category_scores_gemma":[0.00043591668,0.000056075252,0.00006915875,0.00060385076,0.000042020343,0.0011978648,0.000102633894,0.00027866993,0.00000470067],"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.0006336745,0.0021034186,0.049623568,0.002358083,0.001402087,0.00012856215,0.017219502,0.10724635,0.20212696,0.020866776,0.29036766,0.30592334],"study_design_scores_gemma":[0.009252428,0.00012139765,0.031745113,0.0022101514,0.00009620473,0.00031233203,0.004312901,0.25775462,0.10696884,0.013663941,0.5723728,0.0011892666],"about_ca_topic_score_codex":0.0000082872375,"about_ca_topic_score_gemma":0.000030766627,"teacher_disagreement_score":0.30473408,"about_ca_system_score_codex":0.0003646591,"about_ca_system_score_gemma":0.0015889825,"threshold_uncertainty_score":0.42595735},"labels":[],"label_agreement":null},{"id":"W3195613663","doi":"10.1080/01605682.2021.1963196","title":"Modelling efficiency in the presence of shared inputs within groups of DMUs","year":2021,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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":"York University","funders":"","keywords":"Data envelopment analysis; Computer science; Operations research; Set (abstract data type); Unit (ring theory); Resource (disambiguation); Purchasing; Work (physics); Group (periodic table); Operations management; Mathematics; Statistics; Economics; Engineering","score_opus":0.22229319226402994,"score_gpt":0.4534313613978435,"score_spread":0.23113816913381358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195613663","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.9724659,0.0006164617,0.016689727,0.009468564,0.00016450128,0.00014244481,0.000012064351,9.948081e-7,0.00043939246],"genre_scores_gemma":[0.9948009,0.00006580882,0.0044864034,0.00016244486,0.00008324553,0.0000020630423,7.2931306e-7,0.000004751784,0.0003936006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9882084,0.0021396563,0.0014264242,0.0002416387,0.0077322344,0.00025162977],"domain_scores_gemma":[0.98719907,0.006086124,0.00064344227,0.0006474105,0.005364552,0.00005937986],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.03673919,0.00008902066,0.00032474915,0.00018213814,0.00037115416,0.0002543875,0.0024945007,0.00007583981,0.00011367293],"category_scores_gemma":[0.016183443,0.000043417076,0.00050605595,0.0039976295,0.0005565633,0.00044296327,0.0003671451,0.000872052,0.000004147381],"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.000027628004,0.0002955569,0.0026120518,0.000010058227,0.00003105678,0.0000064566243,0.010383149,0.9665242,0.012749031,0.004056613,0.003218116,0.00008610863],"study_design_scores_gemma":[0.0003803232,0.00009913602,0.0033760204,0.00017399929,0.000014355574,0.000041092,0.0068868124,0.96640563,0.008236064,0.014041309,0.00027572332,0.00006954109],"about_ca_topic_score_codex":0.000042294243,"about_ca_topic_score_gemma":0.000031485302,"teacher_disagreement_score":0.022335103,"about_ca_system_score_codex":0.00009584755,"about_ca_system_score_gemma":0.0017249227,"threshold_uncertainty_score":0.99210364},"labels":[],"label_agreement":null},{"id":"W3196581908","doi":"10.1080/01605682.2021.1967211","title":"Ranking decision making units based on the multi-directional efficiency measure","year":2021,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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":"York University","funders":"Ministerio de Ciencia, Innovación y Universidades","keywords":"Ranking (information retrieval); Measure (data warehouse); Rank (graph theory); Data envelopment analysis; Computer science; Data mining; Ranking SVM; Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.30183521202151264,"score_gpt":0.4842402435908072,"score_spread":0.18240503156929455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196581908","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.59184265,0.0014965651,0.28129345,0.11625169,0.0029226774,0.00066009106,0.00004007998,0.00002600954,0.0054667694],"genre_scores_gemma":[0.9839401,0.000016762137,0.012212429,0.0021152205,0.00035171752,0.000004091093,8.1356745e-7,0.000012739648,0.0013460803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9828938,0.0031038355,0.00096435077,0.00038398145,0.012270739,0.00038325478],"domain_scores_gemma":[0.96541315,0.02089805,0.00042335998,0.00077959447,0.012377211,0.000108629996],"candidate_categories":["metaresearch","sts","scholarly_communication"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.045476377,0.00014978317,0.00027210615,0.00023705406,0.003046119,0.0011461822,0.002041764,0.000112167465,0.00084745383],"category_scores_gemma":[0.0860032,0.000069515736,0.00073357084,0.0059439545,0.00042600004,0.00031273643,0.00033042114,0.0015128724,0.000061573286],"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.00021408332,0.0008098316,0.0073617063,0.0000056924086,0.00016786165,0.000037102094,0.0019294667,0.82764435,0.01501279,0.00599796,0.13052116,0.010297994],"study_design_scores_gemma":[0.0010413431,0.000111655594,0.015745329,0.0005406557,0.00003500042,0.000106836225,0.0026934966,0.95126075,0.004146637,0.006814117,0.017305998,0.00019819819],"about_ca_topic_score_codex":0.000004181028,"about_ca_topic_score_gemma":0.000029392162,"teacher_disagreement_score":0.39209747,"about_ca_system_score_codex":0.00040524921,"about_ca_system_score_gemma":0.0034509683,"threshold_uncertainty_score":0.99989074},"labels":[],"label_agreement":null},{"id":"W3204965069","doi":"10.1080/01605682.2023.2247008","title":"A hybrid inverse optimization-stochastic programming framework for network protection","year":2023,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Concordia University","funders":"National Physical Science Consortium; University of Maryland","keywords":"Parameterized complexity; Mathematical optimization; Computer science; Inverse; Stochastic programming; Stochastic optimization; Inverse problem; Optimization problem; Operations research; Mathematics; Algorithm","score_opus":0.11209090754159748,"score_gpt":0.3463890458041955,"score_spread":0.23429813826259802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204965069","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.019154945,0.00004360227,0.93575716,0.041124057,0.001708912,0.0019136216,0.000004103741,0.000056276123,0.00023733517],"genre_scores_gemma":[0.8648894,0.00013346762,0.10507491,0.005390848,0.015197227,0.0008709008,0.00009332915,0.00009057632,0.008259332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830383,0.000041413936,0.00034204463,0.00013249708,0.00088009937,0.0003001374],"domain_scores_gemma":[0.9982097,0.00011761812,0.00011648416,0.00014698562,0.0013899658,0.000019208885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038894764,0.00008294079,0.00010587599,0.000105421204,0.0010348397,0.00034998934,0.0003394067,0.00004467282,0.00018523862],"category_scores_gemma":[0.0020121115,0.00005958284,0.00024214092,0.0011307707,0.0000813043,0.00063263543,0.00018340623,0.00035425433,0.000065427084],"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.000032382293,0.000036777394,0.00007108999,0.00007829731,0.000050687457,3.4326166e-7,0.00007319732,0.8652348,0.000018449278,0.01639515,0.11697003,0.00103878],"study_design_scores_gemma":[0.00028843893,0.000021348189,0.00031005233,0.00009589195,0.000019307945,0.0000020746647,0.0005084918,0.9302919,0.0000049263776,0.014197711,0.054180946,0.00007889386],"about_ca_topic_score_codex":0.000045132798,"about_ca_topic_score_gemma":0.000015481117,"teacher_disagreement_score":0.8457345,"about_ca_system_score_codex":0.00011174591,"about_ca_system_score_gemma":0.00013370253,"threshold_uncertainty_score":0.79592544},"labels":[],"label_agreement":null},{"id":"W3210503411","doi":"10.1080/01605682.2021.1992308","title":"Time to delisted status for listed firms in Chinese stock markets: An analysis using a mixture cure model with time-varying covariates","year":2021,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Financial Distress and Bankruptcy Prediction","field":"Business, Management and Accounting","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":"Queen's University","funders":"","keywords":"Covariate; Stock (firearms); Computer science; Stock market; Macro; Econometrics; Operations research; Statistics; Actuarial science; Economics; Mathematics; Engineering","score_opus":0.034221229952164985,"score_gpt":0.32657426849522236,"score_spread":0.2923530385430574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210503411","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.987565,0.0000919282,0.008772871,0.002936975,0.00004554852,0.0003398663,0.00007760733,0.000007883559,0.00016230937],"genre_scores_gemma":[0.98371613,0.00001694209,0.012793628,0.0010031273,0.00080800365,0.000021934546,0.00020416437,0.000029576411,0.001406478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981772,0.000076469696,0.00035760476,0.00020848995,0.00087047025,0.0003098025],"domain_scores_gemma":[0.99719507,0.00011730513,0.00016905746,0.00017389763,0.0023066457,0.000038011865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001500281,0.0001289614,0.00026316498,0.00018324678,0.00053560646,0.0005195929,0.00026269088,0.00008478544,0.0002091834],"category_scores_gemma":[0.0006368736,0.000081149665,0.00025649182,0.0020467103,0.00005101232,0.0011026532,0.0001474552,0.0003654391,0.000004054446],"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.0009020919,0.00037751975,0.013636224,0.0001034105,0.0004486838,0.000010963147,0.0005815327,0.95438665,0.018521873,0.0003144808,0.010272701,0.00044387122],"study_design_scores_gemma":[0.0007396786,0.000026918859,0.039404545,0.000110632966,0.0001203221,0.0000035978503,0.0001453551,0.9583313,0.000026782032,0.00028094335,0.00070605683,0.000103894294],"about_ca_topic_score_codex":0.0001532428,"about_ca_topic_score_gemma":0.00017008712,"teacher_disagreement_score":0.025768321,"about_ca_system_score_codex":0.00022540682,"about_ca_system_score_gemma":0.0004960669,"threshold_uncertainty_score":0.50104463},"labels":[],"label_agreement":null},{"id":"W4286490894","doi":"10.1080/01605682.2022.2096502","title":"Verifying and managing additive consistency and deriving weights for hesitant fuzzy preference relations","year":2022,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","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 Alberta","funders":"National Natural Science Foundation of China","keywords":"Consistency (knowledge bases); Ambiguity; Preference; Rank (graph theory); Computer science; Weak consistency; Fuzzy logic; Mathematical optimization; Mathematics; Strong consistency; Artificial intelligence; Statistics; Programming language","score_opus":0.3586288390354071,"score_gpt":0.47228778580358177,"score_spread":0.11365894676817467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286490894","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.9682824,0.0014294041,0.0090791825,0.018667348,0.0005087726,0.0006699271,0.00012576726,0.0000061125297,0.001231062],"genre_scores_gemma":[0.9748994,0.000099796714,0.023360593,0.00026011188,0.00012527253,0.000028013626,0.0000013090589,0.000008682289,0.0012168235],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99523604,0.000827501,0.00063446676,0.00026818598,0.0028028938,0.0002309255],"domain_scores_gemma":[0.9893376,0.008462382,0.00029938485,0.00022791975,0.0015571782,0.00011550296],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0126803415,0.000086848326,0.0001972578,0.0001654271,0.0035111273,0.00066229084,0.0006163197,0.00003530711,0.0002993149],"category_scores_gemma":[0.008005433,0.000054741526,0.00017120442,0.00052121736,0.00024582597,0.0006118546,0.0008458346,0.00064424676,0.0000022448037],"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.0013900856,0.0005985121,0.04195711,0.000097316726,0.00083273614,0.00006335856,0.06375599,0.010275331,0.07075612,0.2656068,0.37918347,0.16548319],"study_design_scores_gemma":[0.0026943455,0.00062766555,0.19340622,0.00029778428,0.00005524087,0.00061119907,0.04507163,0.18669444,0.00059200893,0.47494742,0.0945813,0.00042073877],"about_ca_topic_score_codex":0.0000059876515,"about_ca_topic_score_gemma":0.0000067502774,"teacher_disagreement_score":0.28460217,"about_ca_system_score_codex":0.00020392267,"about_ca_system_score_gemma":0.00048476667,"threshold_uncertainty_score":0.99778616},"labels":[],"label_agreement":null},{"id":"W4319310318","doi":"10.1080/01605682.2023.2174052","title":"Mechanisms for feasibility and improvement for inventory-routing problems","year":2023,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Computer science; Mathematical optimization; Benchmark (surveying); Vehicle routing problem; Modular design; Routing (electronic design automation); Set (abstract data type); Exploit; Heuristic; Heuristics; Column generation; Scheme (mathematics); Class (philosophy); Operations research; Mathematics; Artificial intelligence","score_opus":0.1469068184216912,"score_gpt":0.4022142332776783,"score_spread":0.25530741485598707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319310318","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.2891212,0.000180459,0.70236564,0.0053127483,0.00065347867,0.0021864912,0.00005058175,0.000065084314,0.00006430794],"genre_scores_gemma":[0.73243123,0.00020766392,0.26572362,0.00016474685,0.0004004167,0.00016865064,0.000008868343,0.000052329757,0.0008424373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998761,0.000093400784,0.0003108495,0.00009737887,0.00049184996,0.00024554186],"domain_scores_gemma":[0.9984872,0.00056233816,0.000059472768,0.00010392747,0.0007184257,0.00006863875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009101466,0.00006733975,0.00011461539,0.000039515555,0.0004296441,0.000108121974,0.00019355194,0.00005794867,0.0000058291207],"category_scores_gemma":[0.0012466323,0.000048006597,0.00016768392,0.0002647208,0.000048375594,0.00014302741,0.000080280304,0.00025415584,5.4874624e-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.000046618337,0.000060383652,0.0011006686,0.00058590533,0.00026932717,2.5586567e-7,0.0029466841,0.7141715,0.22437665,0.013326815,0.03892895,0.0041862293],"study_design_scores_gemma":[0.0007847064,0.00013444196,0.0007742576,0.000052438663,0.000009386586,0.000002794686,0.00048597806,0.9758487,0.006393918,0.014179119,0.0012687567,0.00006553076],"about_ca_topic_score_codex":0.0000014046634,"about_ca_topic_score_gemma":0.0000015304179,"teacher_disagreement_score":0.44331005,"about_ca_system_score_codex":0.0002509085,"about_ca_system_score_gemma":0.00014677049,"threshold_uncertainty_score":0.33045185},"labels":[],"label_agreement":null},{"id":"W4321489718","doi":"10.1080/01605682.2023.2181715","title":"Explainable prediction of Qcodes for NOTAMs using column generation","year":2023,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","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; Polytechnique Montréal","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning; Column (typography); Interpretability; Operations research; Algorithm; Mathematics","score_opus":0.3138019965474357,"score_gpt":0.4117655621727654,"score_spread":0.09796356562532971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321489718","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.5704141,0.00029527993,0.41632584,0.010772372,0.0011892397,0.00068978505,0.000045386947,0.000021112324,0.00024687286],"genre_scores_gemma":[0.8995854,0.00018933727,0.098464176,0.0001646846,0.00091612845,0.000017667295,0.0000057464986,0.0000084995745,0.0006483094],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829143,0.00015259278,0.00030551705,0.000107083,0.0009486806,0.0001946663],"domain_scores_gemma":[0.9981525,0.00025683868,0.00013067448,0.00016933563,0.0012448038,0.00004585905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038736875,0.00004934944,0.00010328344,0.000059654107,0.0006443689,0.00018008245,0.0005460403,0.000051624258,0.0000061688365],"category_scores_gemma":[0.00038468314,0.000032116488,0.00019448079,0.0006429526,0.00007723735,0.0005660419,0.0001612132,0.0001922833,0.0000014728982],"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.00004873178,0.00023270979,0.0015790575,0.00010388546,0.00019424871,0.0000033882238,0.004886528,0.25872007,0.34680212,0.04001238,0.34203956,0.005377316],"study_design_scores_gemma":[0.00033028246,0.00016961661,0.0020716963,0.000032386662,0.0000044009034,0.000013075566,0.00025118518,0.98483,0.0057358406,0.003697455,0.0028290402,0.00003502178],"about_ca_topic_score_codex":0.000014165265,"about_ca_topic_score_gemma":0.0000021309854,"teacher_disagreement_score":0.7261099,"about_ca_system_score_codex":0.00014408898,"about_ca_system_score_gemma":0.0005215981,"threshold_uncertainty_score":0.49560294},"labels":[],"label_agreement":null},{"id":"W4378192551","doi":"10.1080/01605682.2023.2215823","title":"Ranking products through online reviews: A novel data-driven method based on interval type-2 fuzzy sets and sentiment analysis","year":2023,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":44,"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 Alberta","funders":"National Natural Science Foundation of China","keywords":"Ranking (information retrieval); Latent Dirichlet allocation; Computer science; Sentiment analysis; Data mining; Product (mathematics); Fuzzy logic; Machine learning; Artificial intelligence; Multiple-criteria decision analysis; Information retrieval; Operations research; Topic model; Mathematics","score_opus":0.29712324754170233,"score_gpt":0.48528260820225544,"score_spread":0.1881593606605531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378192551","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.13427204,0.0020714537,0.6175006,0.24201164,0.0018098713,0.001588011,0.00015678773,0.00007752273,0.00051205186],"genre_scores_gemma":[0.12620993,0.0014220232,0.867759,0.002520149,0.00070864323,0.000007728414,0.00014466677,0.000019013973,0.0012088809],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966922,0.0006404807,0.00049631705,0.0003554262,0.0015793414,0.0002362666],"domain_scores_gemma":[0.997707,0.00053853315,0.00023929069,0.00067237084,0.0007751918,0.00006759448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008959405,0.00010997597,0.00031986393,0.00015414333,0.00043742562,0.00038135308,0.0013613857,0.000039300074,0.00003685041],"category_scores_gemma":[0.0008354239,0.00006617738,0.00030548166,0.0033222758,0.00006319292,0.00057988666,0.00089918356,0.00045436807,0.00001528713],"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.00018486092,0.001918654,0.013258679,0.00027158193,0.008432019,0.00003344378,0.012034189,0.35365772,0.024730964,0.012457178,0.54666346,0.02635722],"study_design_scores_gemma":[0.00037844808,0.00006223554,0.0037038734,0.00012562747,0.00011671258,0.000006208791,0.00017049328,0.9827748,0.00027512744,0.00016530635,0.0121419635,0.00007918496],"about_ca_topic_score_codex":0.000011119655,"about_ca_topic_score_gemma":0.0000040236864,"teacher_disagreement_score":0.6291171,"about_ca_system_score_codex":0.00009597823,"about_ca_system_score_gemma":0.00030810566,"threshold_uncertainty_score":0.36773965},"labels":[],"label_agreement":null},{"id":"W4381995674","doi":"10.1080/01605682.2023.2224823","title":"Enhancing an existing algorithm for small-cardinality constrained portfolio optimisation","year":2023,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"Wilfrid Laurier University; Western University","funders":"","keywords":"Cardinality (data modeling); JavaScript; Computer science; Heuristics; Zoom; Executable; Portfolio; Algorithm; Mathematical optimization; Programming language; Mathematics; Data mining; Operating system","score_opus":0.37129724908971173,"score_gpt":0.5060031720084774,"score_spread":0.1347059229187657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381995674","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.42498055,0.00011752093,0.5608202,0.008880435,0.0014897838,0.00108175,0.00011537736,0.000041196003,0.00247316],"genre_scores_gemma":[0.59733886,0.00065154827,0.38464266,0.0005712196,0.003242908,0.000057617883,0.00007510232,0.000045719386,0.013374381],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947517,0.0007015192,0.0009876521,0.0002558099,0.0029556113,0.00034771365],"domain_scores_gemma":[0.99152595,0.0025736056,0.00045434965,0.00031670902,0.004953768,0.00017562519],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.035539463,0.00010448372,0.000240037,0.0001899551,0.0012429248,0.0006373671,0.0008064042,0.00010466039,0.00010857855],"category_scores_gemma":[0.008281178,0.00006448567,0.0004605022,0.0015653111,0.00021309026,0.0007237448,0.00014045187,0.00042816566,0.000015583999],"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.00019298418,0.00032222056,0.0073944298,0.000023739,0.0003887743,0.000019815652,0.009131502,0.29042596,0.026679797,0.0123411855,0.18290387,0.4701757],"study_design_scores_gemma":[0.0013764423,0.00036822486,0.017814472,0.00007259579,0.000036081863,0.00009991374,0.009640222,0.9018979,0.006436391,0.03500746,0.026999498,0.00025080415],"about_ca_topic_score_codex":0.00002112552,"about_ca_topic_score_gemma":0.000010088063,"teacher_disagreement_score":0.61147195,"about_ca_system_score_codex":0.00017290977,"about_ca_system_score_gemma":0.0012307357,"threshold_uncertainty_score":0.99311507},"labels":[],"label_agreement":null},{"id":"W4386587724","doi":"10.1080/01605682.2023.2244352","title":"<i>Journal of the Operational Research Society</i> (JORS): The last 40 years","year":2023,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Complex Systems and Decision Making","field":"Decision Sciences","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":"Simon Fraser University","funders":"","keywords":"Library science; Portfolio; Operations research; Sociology; Media studies; History; Computer science; Engineering; Economics","score_opus":0.43221455845643914,"score_gpt":0.5366990496990144,"score_spread":0.10448449124257525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386587724","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.87179166,0.0017186297,0.0011898347,0.1172182,0.004306935,0.0010065296,0.00007523469,0.000012508313,0.0026804898],"genre_scores_gemma":[0.97651017,0.00019679061,0.0011407519,0.0012930149,0.0031554662,0.000011872225,7.697529e-7,0.00002822388,0.017662931],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9741767,0.003802078,0.0019120773,0.00032673054,0.019113624,0.0006687568],"domain_scores_gemma":[0.97277886,0.013229671,0.0007706572,0.0009663622,0.01202371,0.00023073777],"candidate_categories":["metaresearch","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.08910747,0.000172419,0.00041764881,0.00026890266,0.0036010146,0.0021819454,0.005554156,0.0001592934,0.00064917834],"category_scores_gemma":[0.01757928,0.00007096927,0.001675931,0.0053811464,0.0011473638,0.00077994313,0.0019549413,0.003014389,0.00021085645],"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.00005809316,0.00007071964,0.0018638836,0.0000041681888,0.00010760504,0.000007656703,0.004066942,0.00892508,0.004298058,0.007064944,0.97249216,0.0010406843],"study_design_scores_gemma":[0.0016387015,0.0003054178,0.11825969,0.00032936712,0.000020991149,0.00056526274,0.026824534,0.024979781,0.0005696425,0.06829085,0.75799495,0.00022079815],"about_ca_topic_score_codex":0.00003660723,"about_ca_topic_score_gemma":0.000049778122,"teacher_disagreement_score":0.21449721,"about_ca_system_score_codex":0.00042721105,"about_ca_system_score_gemma":0.0040116957,"threshold_uncertainty_score":0.99982625},"labels":[],"label_agreement":null},{"id":"W4390266851","doi":"10.1080/01605682.2023.2253852","title":"Operational Research: methods and applications","year":2023,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":100,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mila - Quebec Artificial Intelligence Institute; Université du Québec à Montréal; University of Waterloo; HEC Montréal","funders":"Iowa Nutrient Research Center, College of Agriculture and Life Sciences, Iowa State University; Loughborough University; European Regional Development Fund; Università degli Studi di Udine; Canadian Institute for Advanced Research; University of Waterloo; Ministero dell’Istruzione, dell’Università e della Ricerca; University of Bath; Office of Naval Research; Harvard University; Canada Excellence Research Chairs, Government of Canada; Princeton University","keywords":"Computer science; Project management; Operations research; Management science; Information technology; Systems engineering; Data science; Engineering","score_opus":0.29442262056871504,"score_gpt":0.49970731345530944,"score_spread":0.2052846928865944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390266851","genre_codex":"commentary","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.2658785,0.001816853,0.030720633,0.6372122,0.0027529453,0.0050262995,0.000043004566,0.00020111089,0.05634844],"genre_scores_gemma":[0.92325455,0.001867552,0.017907714,0.008204371,0.009788416,0.0005089374,0.0000848802,0.00007107954,0.03831252],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971476,0.00025090386,0.00039186864,0.00018509409,0.0017139921,0.00031052172],"domain_scores_gemma":[0.9967407,0.0003528173,0.00005714643,0.00023778375,0.0025781477,0.000033387463],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.017119292,0.000082212246,0.00011600837,0.00027812904,0.0016382078,0.0005329888,0.00057054416,0.000054828586,0.00038543378],"category_scores_gemma":[0.0013563394,0.00005600956,0.00014569059,0.0021356607,0.0003259528,0.0008510751,0.0006314518,0.00063969195,0.0002750701],"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.000023890247,0.00013095215,0.0014920819,0.00013539876,0.000112558984,0.0000011374871,0.00038435747,0.0064580054,0.0041949907,0.33303523,0.6441154,0.009916001],"study_design_scores_gemma":[0.00030743147,0.000014118678,0.018419595,0.000027616918,0.000010866062,0.000003048687,0.0020293526,0.04219622,0.00010547136,0.021113146,0.9156834,0.00008974371],"about_ca_topic_score_codex":0.00013086751,"about_ca_topic_score_gemma":0.000035565245,"teacher_disagreement_score":0.65737605,"about_ca_system_score_codex":0.00010755677,"about_ca_system_score_gemma":0.00023215447,"threshold_uncertainty_score":0.9996615},"labels":[],"label_agreement":null},{"id":"W4391277884","doi":"10.1080/01605682.2024.2305646","title":"A class of distorted Gaussian copulas: theories and applications","year":2024,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Financial Risk and Volatility Modeling","field":"Economics, Econometrics and Finance","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":"Simon Fraser University","funders":"","keywords":"Class (philosophy); Gaussian; Computer science; Econometrics; Statistical physics; Mathematics; Mathematical economics; Mathematical optimization; Applied mathematics; Artificial intelligence; Physics","score_opus":0.06726802500815804,"score_gpt":0.337276108048369,"score_spread":0.27000808304021096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391277884","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.7847804,0.057996128,0.11410206,0.030348727,0.0009176151,0.0009482715,0.00053685723,0.000020040357,0.0103498995],"genre_scores_gemma":[0.99702734,0.0011121954,0.0008562965,0.000042512816,0.0002565559,0.0000073862175,0.0000017543157,0.0000066952025,0.00068923715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918544,0.000033683587,0.0004222556,0.000106328116,0.00014258576,0.000109714994],"domain_scores_gemma":[0.99933577,0.0001971171,0.00009732305,0.000117911135,0.00021049708,0.000041369436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023018285,0.00004745511,0.00014635142,0.000060016286,0.00024009346,0.00010146414,0.00018678083,0.00005183566,0.000043102656],"category_scores_gemma":[0.00027048794,0.000034176417,0.00016788038,0.0003001894,0.00021294499,0.00020358154,0.00006552379,0.0003605805,0.000006357182],"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.000010904494,0.000027281627,0.006307602,0.00005730451,0.000055985387,2.7781195e-7,0.0011680148,0.00026744523,0.00018911902,0.98822194,0.0026819292,0.0010121745],"study_design_scores_gemma":[0.00033148323,0.00011202253,0.02720752,0.00016062816,0.000012293848,0.000015674892,0.0007937188,0.08601381,0.0002068819,0.6456178,0.23940045,0.00012775628],"about_ca_topic_score_codex":0.000045861158,"about_ca_topic_score_gemma":0.000008885424,"teacher_disagreement_score":0.3426042,"about_ca_system_score_codex":0.000104649516,"about_ca_system_score_gemma":0.0001832177,"threshold_uncertainty_score":0.18466291},"labels":[],"label_agreement":null},{"id":"W4391655310","doi":"10.1080/01605682.2024.2312255","title":"The boundary-to-boundary <i>p</i> -dispersion configuration problem with oval objects","year":2024,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Boundary (topology); Regular polygon; Intersection (aeronautics); Mathematical optimization; Mathematics; Dispersion (optics); Computer science; Geometry; Mathematical analysis; Physics; Geography; Optics; Cartography","score_opus":0.03685802339477276,"score_gpt":0.31182225419214044,"score_spread":0.27496423079736765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391655310","genre_codex":"commentary","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.33232033,0.003655155,0.007968794,0.59281343,0.0048833378,0.003226877,0.00001612941,0.00012460838,0.054991312],"genre_scores_gemma":[0.98428863,0.00021273951,0.0005436961,0.0031976365,0.001664711,0.000032451135,0.000010634917,0.000020861797,0.010028666],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99738336,0.00007054021,0.0003508286,0.00017220991,0.0017465797,0.00027648237],"domain_scores_gemma":[0.99827355,0.00011737527,0.000055225602,0.00019988457,0.0013248647,0.000029092042],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0041459594,0.00011038782,0.000097906915,0.00009122533,0.0019183768,0.002361203,0.0005115674,0.000032663356,0.00021691216],"category_scores_gemma":[0.00023810245,0.000053791267,0.00018380064,0.000967435,0.00022289653,0.0011770166,0.00019985905,0.00053153094,0.00021721309],"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.00022654206,0.00012043248,0.00037784575,0.00029812963,0.00028026072,0.000007646898,0.0013467374,0.012042041,0.0039684786,0.07706181,0.89616156,0.008108541],"study_design_scores_gemma":[0.00025022012,0.000049803573,0.0017013428,0.00017665757,0.0000252449,0.000007749854,0.0016678951,0.019037543,0.00015379478,0.002294795,0.97453487,0.00010007868],"about_ca_topic_score_codex":0.00014305965,"about_ca_topic_score_gemma":0.00031596207,"teacher_disagreement_score":0.65196824,"about_ca_system_score_codex":0.0002156226,"about_ca_system_score_gemma":0.0005891637,"threshold_uncertainty_score":0.999381},"labels":[],"label_agreement":null},{"id":"W4396988484","doi":"10.1080/01605682.2024.2352461","title":"Optimization of elective patient admissions during pandemics: case of COVID-19","year":2024,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","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 Ottawa","funders":"","keywords":"Pandemic; Coronavirus disease 2019 (COVID-19); 2019-20 coronavirus outbreak; Severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2); Medical emergency; Medicine; Operations research; Computer science; Virology; Engineering; Outbreak; Infectious disease (medical specialty); Internal medicine","score_opus":0.17421182319208112,"score_gpt":0.5409967245773012,"score_spread":0.3667849013852201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396988484","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.92054915,0.0014212966,0.048711322,0.02650663,0.0008234774,0.0013427255,0.00015260695,0.000019277368,0.00047351653],"genre_scores_gemma":[0.98282427,0.0008195695,0.015010165,0.00034562615,0.00026535444,0.000028433473,0.000010301802,0.000018361685,0.000677929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99647826,0.0012759067,0.0010352192,0.00014264294,0.000815385,0.00025261106],"domain_scores_gemma":[0.9945268,0.0015268915,0.00029570976,0.000185383,0.003163354,0.0003018511],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004376043,0.00008701724,0.00021289196,0.00015511288,0.0015947364,0.000029824996,0.00018563888,0.00017560141,0.00039937836],"category_scores_gemma":[0.006261978,0.00005528642,0.00021859753,0.0008635425,0.00011854462,0.0002838093,0.00012146934,0.0012476956,0.0000018331044],"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":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013456149,0.00015851349,0.0020999666,0.0008638017,0.00018006886,0.00003564114,0.032304518,0.9382378,0.0075926627,0.0052176826,0.012826817,0.00034795192],"study_design_scores_gemma":[0.0020015568,0.00079589494,0.0009477864,0.002563414,0.000095973985,0.0008000168,0.054539714,0.9247031,0.0036159833,0.0017512458,0.007904215,0.00028110133],"about_ca_topic_score_codex":0.00023109732,"about_ca_topic_score_gemma":0.00005066147,"teacher_disagreement_score":0.06227511,"about_ca_system_score_codex":0.0007822159,"about_ca_system_score_gemma":0.009841365,"threshold_uncertainty_score":0.9997051},"labels":[],"label_agreement":null},{"id":"W4402920173","doi":"10.1080/01605682.2024.2407467","title":"Single-vendor single-buyer multi-product economic production quantity problem with stochastic constraints: a modified generalized elimination method","year":2024,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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","funders":"","keywords":"Vendor; Production (economics); Product (mathematics); Mathematical optimization; Computer science; Scheduling (production processes); Operations research; Mathematics; Economics; Business; Microeconomics; Marketing","score_opus":0.1337245709529202,"score_gpt":0.3549153087621609,"score_spread":0.22119073780924067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402920173","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.5469047,0.0016628694,0.2754944,0.15688652,0.007513873,0.005453953,0.00003687584,0.00024385603,0.0058029736],"genre_scores_gemma":[0.98075736,0.000018093073,0.01402918,0.00042915347,0.0027935384,0.000035040655,0.000016661752,0.000036196605,0.001884755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977897,0.00015309059,0.00046444905,0.0003362075,0.0009553468,0.00030124566],"domain_scores_gemma":[0.99853265,0.000115495204,0.00021730336,0.00021514863,0.0008925113,0.000026887197],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0045938767,0.00016659494,0.00020165555,0.00022960365,0.0005274669,0.0010717013,0.00037920315,0.00005085803,0.0002869437],"category_scores_gemma":[0.00040779423,0.000106495754,0.00023864239,0.0004829982,0.00027302522,0.0016814829,0.00017425253,0.00050145073,0.000039559207],"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.0006502348,0.0017159125,0.0002627371,0.0013466409,0.0015889055,0.00002644023,0.0019253182,0.45727286,0.12497544,0.19731778,0.18418553,0.028732201],"study_design_scores_gemma":[0.0036636645,0.00033814576,0.0012878866,0.0012425723,0.00039925493,0.00017942437,0.0033659902,0.9138861,0.007847012,0.008011892,0.059019044,0.0007590362],"about_ca_topic_score_codex":0.00009125542,"about_ca_topic_score_gemma":0.000051586103,"teacher_disagreement_score":0.4566132,"about_ca_system_score_codex":0.00061878306,"about_ca_system_score_gemma":0.0002725301,"threshold_uncertainty_score":0.9999653},"labels":[],"label_agreement":null},{"id":"W4402949598","doi":"10.1080/01605682.2024.2408390","title":"Solving dynamic facility layout problem using a hybridized heuristic dynamic programming approach","year":2024,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dynamic programming; Computer science; Heuristic; Project management; Heuristics; Operations research; Scheduling (production processes); Mathematical optimization; Systems engineering; Engineering; Algorithm; Mathematics; Artificial intelligence; Operating system","score_opus":0.03974492844909323,"score_gpt":0.3383505245559064,"score_spread":0.2986055961068132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402949598","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.04481519,0.0015429393,0.9522616,0.00032068233,0.00036887408,0.0003812822,0.000033168184,0.00008474642,0.00019151844],"genre_scores_gemma":[0.8561873,0.00014502373,0.14325479,0.000010286009,0.00008877325,0.000010180085,0.000013107962,0.000023483593,0.0002670984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982162,0.00012295623,0.00038235122,0.00016055084,0.00078878796,0.00032915024],"domain_scores_gemma":[0.99912834,0.00023254126,0.000046284273,0.00015470758,0.00035753616,0.00008061008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018034797,0.00013343038,0.00016713791,0.00007558658,0.00041350487,0.0003620699,0.00028598928,0.00007383562,0.000012847719],"category_scores_gemma":[0.00028025085,0.000093001625,0.00022547657,0.00033851998,0.00013749178,0.00032598944,0.0000910001,0.0010397356,0.0000034605782],"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.000007586596,0.000027585907,0.000014319655,0.00027142,0.00009918152,0.000004127114,0.00052600726,0.9941946,0.0024126524,0.00016025551,0.00042955918,0.0018526922],"study_design_scores_gemma":[0.00015757498,0.000021516169,0.000089749,0.00013765489,0.000021217596,0.00007646097,0.000242933,0.99678075,0.00015946785,0.0010993651,0.0011135697,0.00009975651],"about_ca_topic_score_codex":0.000006055553,"about_ca_topic_score_gemma":0.0000024064605,"teacher_disagreement_score":0.81137204,"about_ca_system_score_codex":0.0007843742,"about_ca_system_score_gemma":0.0002962826,"threshold_uncertainty_score":0.45171916},"labels":[],"label_agreement":null},{"id":"W4403306216","doi":"10.1080/01605682.2024.2412214","title":"An exact branch-and-price-and-cut algorithm for a practical and large-scale dial-a-ride problem","year":2024,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Giro (Canada); Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Dial; Scale (ratio); Purchasing; Project management; Algorithm; Operations research; Mathematical optimization; Economics; Mathematics; Operations management; Engineering; Management; Electrical engineering","score_opus":0.04458444319968899,"score_gpt":0.40219240256818095,"score_spread":0.357607959368492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403306216","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.058431424,0.0015140071,0.9269698,0.012150154,0.00022571284,0.00045876077,0.00004530811,0.000040779334,0.0001640554],"genre_scores_gemma":[0.12592499,0.0013230856,0.87141365,0.0001428981,0.0007332024,0.000026139245,0.0000036067147,0.000042930493,0.00038949674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986591,0.00022270012,0.00025233437,0.00013251057,0.0005023297,0.00023107514],"domain_scores_gemma":[0.99837744,0.0010373568,0.000027302727,0.000087609566,0.00032432924,0.00014595012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051544644,0.00008594979,0.00013536093,0.0000465409,0.00032281445,0.0004255789,0.000105937506,0.00008292817,0.00001988074],"category_scores_gemma":[0.00041676368,0.00005878121,0.00008605712,0.00019324287,0.00009503598,0.00052645535,0.00007131892,0.0006326152,7.425746e-7],"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.0002666753,0.0008013467,0.0044814693,0.0028740596,0.002754667,0.00005689418,0.049317736,0.21955904,0.13641961,0.046260484,0.14734074,0.38986728],"study_design_scores_gemma":[0.00036492324,0.00008714286,0.00081265566,0.00007593977,0.000019644993,0.0001638686,0.00025577025,0.98766553,0.000797179,0.0020774528,0.0076049278,0.00007498032],"about_ca_topic_score_codex":0.0000021916467,"about_ca_topic_score_gemma":0.0000023508312,"teacher_disagreement_score":0.76810646,"about_ca_system_score_codex":0.00009354714,"about_ca_system_score_gemma":0.00029523877,"threshold_uncertainty_score":0.41038674},"labels":[],"label_agreement":null},{"id":"W4404334244","doi":"10.1080/01605682.2024.2425684","title":"Less is more: adjusting convergence of Cooper’s algorithm in the continuous location-allocation problem","year":2024,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Royal Military College of Canada; Royal Ottawa Mental Health Centre","funders":"","keywords":"Mathematical optimization; Maxima and minima; Convergence (economics); Computer science; Path (computing); Descent (aeronautics); Algorithm; Heuristic; Descent direction; Gradient descent; Mathematics; Artificial intelligence; Engineering","score_opus":0.07639517502767265,"score_gpt":0.3454537284403607,"score_spread":0.26905855341268803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404334244","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.6231049,0.0050981757,0.031279843,0.32647744,0.0030216053,0.0031613219,0.000030599444,0.000054666656,0.0077715074],"genre_scores_gemma":[0.9952093,0.00023003855,0.00081043,0.0018494827,0.0005682862,0.000028074268,0.000008691431,0.000009865389,0.0012858822],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975884,0.00009443055,0.00057984877,0.00015279939,0.0013859943,0.00019852769],"domain_scores_gemma":[0.99758255,0.00014797524,0.00010771519,0.00019820793,0.0019521739,0.000011374979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005767431,0.0000940864,0.00013303329,0.00012694954,0.0003007604,0.00031768123,0.0006785322,0.000047098096,0.00018959524],"category_scores_gemma":[0.0004097301,0.00005541048,0.00015241311,0.0016367737,0.00017887875,0.000869441,0.00015530156,0.00046505226,0.000030559833],"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.000071017246,0.000849406,0.009098635,0.00299502,0.00043893623,0.000011792055,0.017752618,0.07240935,0.003122371,0.15277782,0.675057,0.06541605],"study_design_scores_gemma":[0.0006620507,0.000044530076,0.023716139,0.0008658696,0.00007144318,0.000011488172,0.03389832,0.8385221,0.0003997626,0.003323022,0.098251484,0.00023382514],"about_ca_topic_score_codex":0.0006341966,"about_ca_topic_score_gemma":0.000093970295,"teacher_disagreement_score":0.76611274,"about_ca_system_score_codex":0.00011506302,"about_ca_system_score_gemma":0.00032999934,"threshold_uncertainty_score":0.30634075},"labels":[],"label_agreement":null},{"id":"W4404705585","doi":"10.1080/01605682.2024.2430337","title":"Is multichannel retail marketing integration a panacea?","year":2024,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Consumer Retail Behavior Studies","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":"Athabasca University","funders":"Agencia Estatal de Investigación; Junta de Castilla y León","keywords":"Panacea (medicine); Marketing; Business; Purchasing","score_opus":0.1359451498914607,"score_gpt":0.37742899186742357,"score_spread":0.24148384197596287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404705585","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.88857645,0.0041575492,0.0005336043,0.09931344,0.001701387,0.0005124275,0.000009712869,0.000046375797,0.0051490846],"genre_scores_gemma":[0.9928101,0.00018827099,0.0004957646,0.00059807044,0.0010370084,0.0000120935765,0.0000023346975,0.000020536154,0.0048358403],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978795,0.0000886112,0.00035312923,0.00015392843,0.0012919416,0.00023286974],"domain_scores_gemma":[0.9978075,0.0003838778,0.00010152661,0.00014351145,0.0015488408,0.0000147476785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00597659,0.00010487721,0.00013456297,0.00013015358,0.00066037464,0.0010049322,0.00038057647,0.000054800053,0.00052669505],"category_scores_gemma":[0.0015957742,0.000062763575,0.00032799866,0.00083817577,0.00014833639,0.0010712398,0.0003312725,0.0007835546,0.000082848],"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.0001844099,0.00022829638,0.08725752,0.0006047813,0.0008399452,0.000046158766,0.0035725804,0.00009037487,0.02938665,0.013091474,0.71671486,0.14798295],"study_design_scores_gemma":[0.0011556341,0.000045595196,0.16345061,0.0021449109,0.00033743432,0.00006945218,0.0100541245,0.1798023,0.00085035845,0.0022189715,0.6393553,0.0005153187],"about_ca_topic_score_codex":0.00008600072,"about_ca_topic_score_gemma":0.000054308734,"teacher_disagreement_score":0.17971192,"about_ca_system_score_codex":0.00018129473,"about_ca_system_score_gemma":0.00021971886,"threshold_uncertainty_score":0.9690585},"labels":[],"label_agreement":null},{"id":"W4404864841","doi":"10.1080/01605682.2024.2432605","title":"Adaptive large neighbourhood search for the multi-depot arc routing problem with flexible assignment of end depot and different arc types","year":2024,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Université du Québec à Trois-Rivières","funders":"Mitacs","keywords":"Depot; Arc (geometry); Arc routing; Neighbourhood (mathematics); Computer science; Operations research; Routing (electronic design automation); Mathematical optimization; Computer network; Engineering; Mathematics; Geography; Mechanical engineering","score_opus":0.07232362554463277,"score_gpt":0.3580735006696667,"score_spread":0.2857498751250339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404864841","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.06996908,0.0019682138,0.9230626,0.0036405737,0.00015745003,0.0008567155,0.000054891887,0.000028943432,0.0002615215],"genre_scores_gemma":[0.90740794,0.00026499646,0.09176348,0.000028419772,0.00017179434,0.000027681996,0.000001570158,0.00003204163,0.00030206944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979266,0.00027043882,0.00034865065,0.00013545461,0.0009992775,0.00031961338],"domain_scores_gemma":[0.9975795,0.0015923532,0.00005690312,0.00013574272,0.00055447844,0.00008102305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041335057,0.000121653145,0.00017985563,0.00005458612,0.00042401484,0.00021310049,0.00028068895,0.00006146758,0.000041086645],"category_scores_gemma":[0.00019257015,0.000061245715,0.00015240665,0.00029474107,0.00013710117,0.00017237442,0.00013358444,0.0007597986,6.1821373e-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.00011619611,0.00015069843,0.0035789032,0.00034462538,0.0010824788,0.000002653859,0.0058834385,0.946239,0.023824513,0.011476775,0.0012619522,0.0060387654],"study_design_scores_gemma":[0.0006610666,0.0001863566,0.0047982424,0.0002831045,0.000040283245,0.000026637179,0.0013340681,0.9742039,0.017925963,0.00021601982,0.0002407835,0.00008358171],"about_ca_topic_score_codex":0.000009938138,"about_ca_topic_score_gemma":0.000008566193,"teacher_disagreement_score":0.8374389,"about_ca_system_score_codex":0.0002241621,"about_ca_system_score_gemma":0.0003063986,"threshold_uncertainty_score":0.33009893},"labels":[],"label_agreement":null},{"id":"W4405397627","doi":"10.1080/01605682.2024.2436622","title":"Operational research on dengue: critical review and research agenda","year":2024,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Mosquito-borne diseases and control","field":"Medicine","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":"HEC Montréal","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Dengue fever; Operations research; Computer science; Project management; Management science; Process management; Business; Systems engineering; Engineering; Medicine; Virology","score_opus":0.25525693839575603,"score_gpt":0.5580070271559404,"score_spread":0.3027500887601844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405397627","genre_codex":"commentary","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.06231307,0.20016964,0.000084990585,0.7289772,0.000559046,0.0019286635,0.00010467283,0.00002009526,0.0058426084],"genre_scores_gemma":[0.9506338,0.027174596,0.0005726336,0.0065129166,0.0029123123,0.00011053657,0.000014046879,0.000044229364,0.012024905],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9907216,0.0019276364,0.0005646876,0.00037764438,0.005748516,0.000659941],"domain_scores_gemma":[0.9887681,0.0040525617,0.000027349099,0.0004035806,0.006278508,0.00046989406],"candidate_categories":["metaresearch","sts","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.02356213,0.00013796429,0.0003323472,0.00023662669,0.0013592781,0.00061745907,0.00047274388,0.00013169338,0.001359757],"category_scores_gemma":[0.009592303,0.000080208374,0.0004324222,0.0012395863,0.0009782956,0.00031286973,0.000335476,0.0038711654,0.00011664641],"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.000175318,0.00031554454,0.00021476997,0.0013196181,0.00024872523,0.00013246508,0.0003474156,0.000018142213,0.0040249783,0.069447674,0.9214245,0.00233083],"study_design_scores_gemma":[0.0025118084,0.0028348754,0.019639732,0.013970654,0.00036158127,0.0013284822,0.0025809212,0.011108278,0.0012276256,0.010820787,0.93325377,0.00036148526],"about_ca_topic_score_codex":0.000024485204,"about_ca_topic_score_gemma":0.0000033248202,"teacher_disagreement_score":0.88832074,"about_ca_system_score_codex":0.0005266264,"about_ca_system_score_gemma":0.003981459,"threshold_uncertainty_score":0.9999408},"labels":[],"label_agreement":null},{"id":"W4406053857","doi":"10.1080/01605682.2024.2446655","title":"Decarbonizing road freight transportation: recent advances and future trends","year":2025,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Urban and Freight Transport Logistics","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":"HEC Montréal","funders":"","keywords":"Transport engineering; Traffic management; Business; Operations research; Engineering","score_opus":0.03585522645718325,"score_gpt":0.3057192762247652,"score_spread":0.26986404976758194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406053857","genre_codex":"review","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.27840015,0.47576606,0.025384909,0.10790103,0.010696004,0.0009527094,0.00030945212,0.00018633553,0.100403324],"genre_scores_gemma":[0.90134627,0.08841713,0.0061968206,0.00038335295,0.001524036,0.000008875879,0.000016898735,0.000022745115,0.0020838676],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989623,0.000039563794,0.0002709956,0.00007368142,0.0004951584,0.00015829965],"domain_scores_gemma":[0.99939877,0.000072444505,0.000027036936,0.00009074339,0.0003512778,0.00005970333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005698758,0.00007937382,0.000121168996,0.0000606138,0.00024353662,0.000060741553,0.00019273217,0.000070334376,0.000088586276],"category_scores_gemma":[0.000020085974,0.00005129864,0.00011937081,0.00046321066,0.000116559626,0.00019273677,0.000007071863,0.00054861454,4.7564376e-7],"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.00024163474,0.0003490182,0.02994834,0.0008560669,0.001749445,0.000060848088,0.0082310755,0.068044655,0.011416327,0.113156825,0.34967646,0.41626927],"study_design_scores_gemma":[0.0006106051,0.00004082544,0.0709668,0.00008582113,0.00003801619,0.0000087656435,0.0005392637,0.0063966517,0.0010219726,0.0018699386,0.91831297,0.00010838752],"about_ca_topic_score_codex":0.0000018997072,"about_ca_topic_score_gemma":0.000025001627,"teacher_disagreement_score":0.6229461,"about_ca_system_score_codex":0.00010396629,"about_ca_system_score_gemma":0.00012947244,"threshold_uncertainty_score":0.23834877},"labels":[],"label_agreement":null},{"id":"W4406188940","doi":"10.1080/01605682.2024.2449470","title":"Balancing contributions and rewards: a DEA approach for fair carbon emission abatement allocation","year":2025,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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":"Institute on Governance","funders":"Fundamental Research Funds for Central Universities of the Central South University; National Natural Science Foundation of China","keywords":"Project management; Purchasing; Carbon fibers; Scheduling (production processes); Operations research; Economics; Environmental economics; Emissions trading; Production (economics); Microeconomics; Computer science; Operations management; Greenhouse gas; Engineering; Management; Ecology","score_opus":0.10387283672899567,"score_gpt":0.4780515633196524,"score_spread":0.3741787265906567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406188940","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.5157431,0.0018297454,0.399179,0.07926685,0.00049361127,0.0011774417,0.000042246804,0.000011115762,0.0022568654],"genre_scores_gemma":[0.9909616,0.000057080324,0.0055132722,0.00030484045,0.00013821089,0.000018478993,0.0000036543659,0.000003862054,0.0029990033],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99574065,0.00061633997,0.00071734155,0.00023751007,0.0024578285,0.00023031018],"domain_scores_gemma":[0.99268794,0.0021498706,0.00024364589,0.00028046145,0.0045491424,0.00008891027],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.024216833,0.00008012984,0.00021229003,0.00017304995,0.0011100315,0.00041775446,0.0006494992,0.000084620726,0.000011323459],"category_scores_gemma":[0.014398949,0.00004458091,0.0002900758,0.0012029035,0.00014427531,0.00022645172,0.00020786202,0.00041894522,6.8553237e-7],"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.00042443222,0.0012120039,0.0404287,0.0001351648,0.0009628126,0.0000017683845,0.0070268656,0.15566626,0.26370305,0.05114617,0.4712577,0.008035063],"study_design_scores_gemma":[0.00088725646,0.00009226874,0.0060345144,0.00011597527,0.000050736086,0.000009698249,0.0033698431,0.9571108,0.0058819684,0.015095786,0.011263503,0.00008764717],"about_ca_topic_score_codex":0.00001999901,"about_ca_topic_score_gemma":0.000004245071,"teacher_disagreement_score":0.80144453,"about_ca_system_score_codex":0.00040853908,"about_ca_system_score_gemma":0.0011721802,"threshold_uncertainty_score":0.99390316},"labels":[],"label_agreement":null},{"id":"W4407081276","doi":"10.1080/01605682.2025.2457647","title":"Workforce population modelling: Population by convolution","year":2025,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"demographic modeling and climate adaptation","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":"Defence Research and Development Canada","funders":"","keywords":"Population; Workforce; Computer science; Convolution (computer science); Operations research; Mathematics; Economics; Artificial intelligence; Sociology; Demography; Economic growth","score_opus":0.2683297565795895,"score_gpt":0.48982604632995025,"score_spread":0.22149628975036073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407081276","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.75573987,0.0007385317,0.2270582,0.014158969,0.0007497238,0.00025985402,0.000012525619,0.000009736128,0.0012725616],"genre_scores_gemma":[0.9913053,0.00016929509,0.0024275456,0.00033578547,0.00013023452,0.0000043650393,0.000017326558,0.0000056178565,0.0056045507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99470645,0.0006492858,0.0008964215,0.0002040749,0.0033301834,0.00021357778],"domain_scores_gemma":[0.99575436,0.001044954,0.00032973857,0.00028187942,0.0025208085,0.000068287445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012267494,0.00008632613,0.00017839491,0.00019100969,0.00092031155,0.00043705234,0.0006453743,0.000117812444,0.000048065336],"category_scores_gemma":[0.0020572315,0.000052410778,0.00034459276,0.0015283489,0.00009724675,0.00064793404,0.00009213981,0.0005340001,0.000008991817],"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.00010041687,0.00011932033,0.039173722,0.00000783949,0.00006177914,2.4853586e-7,0.00047247397,0.73388547,0.0015821458,0.040475335,0.17486249,0.009258747],"study_design_scores_gemma":[0.00039128892,0.0000373522,0.0258162,0.00008034529,0.000014037024,0.0000038824355,0.0007536025,0.8351565,0.00009250255,0.12886128,0.008722602,0.00007042965],"about_ca_topic_score_codex":0.00015648044,"about_ca_topic_score_gemma":0.000012724703,"teacher_disagreement_score":0.2355654,"about_ca_system_score_codex":0.0002494416,"about_ca_system_score_gemma":0.00022548092,"threshold_uncertainty_score":0.70783854},"labels":[],"label_agreement":null},{"id":"W4407813880","doi":"10.1080/01605682.2025.2466681","title":"Optimal subsidy decisions for building electric vehicle charging piles: unit subsidy vs percentage subsidy","year":2025,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Electric Vehicles and Infrastructure","field":"Engineering","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":"Wilfrid Laurier University","funders":"Natural Science Foundation of Guangdong Province","keywords":"Subsidy; Electric vehicle; Unit (ring theory); Purchasing; Business; Operations management; Economics; Marketing; Mathematics; Physics; Market economy","score_opus":0.03090613903150347,"score_gpt":0.3383213767624891,"score_spread":0.3074152377309856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407813880","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.9794594,0.0014659804,0.015125963,0.0027160547,0.00037180446,0.0004488428,0.00002159654,0.000028552668,0.00036182394],"genre_scores_gemma":[0.99092907,0.0009518437,0.006532857,0.00031114492,0.00046043875,0.000021801105,0.0000056950284,0.000035584464,0.0007515921],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749374,0.00014708455,0.0005487801,0.0001873238,0.0009939742,0.00062907685],"domain_scores_gemma":[0.9975591,0.0010347652,0.00007824982,0.00024932908,0.00093594706,0.0001426247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022811508,0.00018602269,0.0002796038,0.00021477795,0.001044082,0.00029462844,0.000820143,0.00016233393,0.00009018789],"category_scores_gemma":[0.0006175754,0.0001338698,0.00045595856,0.0012363903,0.00008004119,0.0003986817,0.00011955667,0.001431525,0.0000040422406],"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.00023092078,0.00014644078,0.006455868,0.00013329691,0.0006438618,0.0000073288784,0.0012212631,0.2425608,0.58763266,0.012076434,0.14435135,0.004539793],"study_design_scores_gemma":[0.0027163916,0.0003875028,0.041136075,0.00044539152,0.00009366043,0.000089059016,0.0015443738,0.8373538,0.074688606,0.0033176634,0.03780615,0.00042130973],"about_ca_topic_score_codex":0.0000095803825,"about_ca_topic_score_gemma":0.000005410615,"teacher_disagreement_score":0.594793,"about_ca_system_score_codex":0.00056811224,"about_ca_system_score_gemma":0.000610615,"threshold_uncertainty_score":0.803034},"labels":[],"label_agreement":null},{"id":"W4408006955","doi":"10.1080/01605682.2025.2464218","title":"Optimal reward-based crowdfunding with co-creation","year":2025,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"FinTech, Crowdfunding, Digital Finance","field":"Business, Management and Accounting","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":"University of Calgary","funders":"","keywords":"Project management; Business; Purchasing; Computer science; Marketing; Operations research; Knowledge management; Economics; Management; Engineering","score_opus":0.03760215634849405,"score_gpt":0.35911187397834543,"score_spread":0.32150971762985137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408006955","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.8837518,0.00018864003,0.020879889,0.032924138,0.0004749909,0.0005903512,0.000008365174,0.00003750859,0.06114429],"genre_scores_gemma":[0.99094975,0.000008874027,0.0026034382,0.0014732109,0.0005823588,0.000010798197,0.000006882968,0.00001544923,0.0043492625],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99802107,0.00003540729,0.0003313573,0.00015790293,0.0011646332,0.00028966242],"domain_scores_gemma":[0.99783033,0.00022503066,0.00022177005,0.0001721897,0.0015356721,0.000015031393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024358372,0.00011626458,0.00015884996,0.00020144675,0.0008069799,0.0009823109,0.00054030475,0.00006700323,0.000090623034],"category_scores_gemma":[0.0008958415,0.000073703806,0.00020768748,0.0011466249,0.00028116652,0.0014216877,0.00014599712,0.00060398935,0.000027837154],"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.00088732725,0.00046647887,0.122562855,0.00045765424,0.00036949123,0.000023206596,0.0001988993,0.052880913,0.016256046,0.19461863,0.60895455,0.0023239413],"study_design_scores_gemma":[0.005447985,0.00027557864,0.12925224,0.0029018065,0.00014122108,0.000040635547,0.0017189938,0.10429819,0.018286992,0.008885985,0.72802716,0.000723214],"about_ca_topic_score_codex":0.000041453153,"about_ca_topic_score_gemma":0.000010551718,"teacher_disagreement_score":0.18573265,"about_ca_system_score_codex":0.00032266445,"about_ca_system_score_gemma":0.00060562603,"threshold_uncertainty_score":0.94724464},"labels":[],"label_agreement":null},{"id":"W4409515031","doi":"10.1080/01605682.2024.2406243","title":"Applications and challenges of simulation for healthcare operations management in Africa","year":2024,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"HIV/AIDS Impact and Responses","field":"Economics, Econometrics and Finance","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":"Queen's University","funders":"Bundesministerium für Bildung und Forschung","keywords":"Project management; Health care; Computer science; Scheduling (production processes); Information technology; Operations research; Purchasing; Management science; Information and Communications Technology; Engineering management; Process management; Systems engineering; Operations management; Business; Engineering; Economics","score_opus":0.2283302500766578,"score_gpt":0.4161837026288736,"score_spread":0.1878534525522158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409515031","genre_codex":"commentary","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.12635903,0.31443474,0.10602395,0.43502495,0.00076771947,0.0060404018,0.0009064634,0.00002421878,0.010418556],"genre_scores_gemma":[0.9866142,0.008572324,0.0033024414,0.00003830923,0.00011903951,0.000057558216,0.0000016691969,0.0000070374904,0.0012873831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992516,0.000046774443,0.00038207977,0.00009437249,0.00010845985,0.00011672602],"domain_scores_gemma":[0.9992499,0.0004063484,0.00004969829,0.000088200344,0.00016882383,0.000037047877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024287305,0.000041661453,0.00011617796,0.0001502288,0.00016793005,0.00007226872,0.00013271834,0.00004167687,0.000015266525],"category_scores_gemma":[0.00016488618,0.000030723568,0.00011323454,0.00026587554,0.00006562403,0.00017389156,0.00004277536,0.00017180093,0.0000030030226],"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.00004813673,0.00010341967,0.0002899569,0.00038699128,0.00013980494,5.196919e-7,0.0051836898,0.022491572,0.000116109986,0.9600288,0.0025362382,0.008674741],"study_design_scores_gemma":[0.0015368862,0.00038389052,0.015906792,0.00034459267,0.00001680844,0.000010503123,0.005554147,0.30845454,0.00012876256,0.13599487,0.5314785,0.000189657],"about_ca_topic_score_codex":0.000008340792,"about_ca_topic_score_gemma":0.000013502586,"teacher_disagreement_score":0.86025524,"about_ca_system_score_codex":0.000109375964,"about_ca_system_score_gemma":0.00009894148,"threshold_uncertainty_score":0.12915991},"labels":[],"label_agreement":null},{"id":"W4409623120","doi":"10.1080/01605682.2025.2489131","title":"A sustainable facility location problem with vehicle allocation: an urban logistics case study","year":2025,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Urban and Freight Transport Logistics","field":"Engineering","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":"École de Technologie Supérieure","funders":"Ministério da Ciência, Tecnologia e Inovação; Universidad de La Sabana; Ministerio de Ciencia, Tecnología e Innovación Productiva","keywords":"Facility location problem; City logistics; Purchasing; Green logistics; Scheduling (production processes); Project management; Operations research; Information and Communications Technology; Business; Facility management; Transport engineering; Computer science; Fleet management; Humanitarian Logistics; Operations management; Environmental economics; Process management; Engineering; Marketing; Systems engineering; Economics","score_opus":0.057793946692062226,"score_gpt":0.31825670377264875,"score_spread":0.2604627570805865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409623120","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.868469,0.0005553156,0.12618285,0.0016316844,0.00018234398,0.0013039334,0.000024111876,0.000049744933,0.0016010156],"genre_scores_gemma":[0.99636567,0.000020607107,0.0015407887,0.00004838394,0.00009646646,0.000018173276,0.000005328397,0.000007669603,0.0018969356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998505,0.0001513683,0.00032765046,0.000112431684,0.0006650242,0.00023853272],"domain_scores_gemma":[0.99736464,0.0001287191,0.000038705926,0.0002472115,0.0021379555,0.00008277858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019217631,0.00009705721,0.00013056671,0.000052835167,0.0005123378,0.00015509043,0.00029259402,0.00006102979,0.000018278717],"category_scores_gemma":[0.00011583142,0.000062110455,0.00006176422,0.0006678844,0.00019107373,0.00029635092,0.000033599263,0.0006264921,0.0000015743782],"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.00014419395,0.0014951362,0.06306575,0.00049827865,0.0006652059,0.0006311518,0.012405452,0.8525772,0.00073736685,0.022641791,0.044618487,0.00051996676],"study_design_scores_gemma":[0.008358486,0.0038152395,0.07882304,0.0003733945,0.0005290345,0.001427108,0.20259671,0.65911424,0.002226632,0.0076588164,0.033993404,0.0010838852],"about_ca_topic_score_codex":0.00013394983,"about_ca_topic_score_gemma":0.00015026027,"teacher_disagreement_score":0.19346297,"about_ca_system_score_codex":0.0004147992,"about_ca_system_score_gemma":0.0007284501,"threshold_uncertainty_score":0.394054},"labels":[],"label_agreement":null},{"id":"W4413401094","doi":"10.1080/01605682.2025.2546058","title":"Patient segmentation and resource allocation for tailored healthcare delivery","year":2025,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Advanced X-ray and CT Imaging","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Blood Services","keywords":"Health care; Computer science; Healthcare delivery; Purchasing; Resource allocation; Project management; Segmentation; Business; Operations management; Knowledge management; Operations research; Artificial intelligence; Marketing; Engineering; Systems engineering; Economics","score_opus":0.0265614889590065,"score_gpt":0.3436137566803511,"score_spread":0.3170522677213446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413401094","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.84485614,0.0059157475,0.09996294,0.047145378,0.00053056347,0.001074246,0.00002590846,0.000027535021,0.0004615234],"genre_scores_gemma":[0.99063206,0.00036958055,0.008015882,0.0006272491,0.000103336555,0.00002205625,0.0000059378935,0.000007377578,0.0002165289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926037,0.000061947656,0.00019266036,0.00005506867,0.00031141817,0.00011852725],"domain_scores_gemma":[0.9991962,0.00020079633,0.000031895805,0.000061409766,0.00047518124,0.0000345328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006301615,0.000045989098,0.000064324806,0.00003573486,0.00033599656,0.00005470168,0.00008605408,0.000030336349,0.0000029048067],"category_scores_gemma":[0.00011961361,0.000033790107,0.00006753787,0.00015548398,0.000046631194,0.00019878073,0.000032529664,0.00024611154,2.8950595e-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.0002919926,0.00011829099,0.0020698055,0.0007005041,0.00044450522,0.0000013399184,0.010333916,0.47525376,0.1657487,0.01343195,0.21147487,0.12013037],"study_design_scores_gemma":[0.004248295,0.0005848348,0.013016607,0.0011536855,0.000079015175,0.00004483336,0.033201773,0.60594684,0.12703742,0.021599893,0.19263233,0.00045449054],"about_ca_topic_score_codex":0.0000029732535,"about_ca_topic_score_gemma":0.0000027930666,"teacher_disagreement_score":0.1457759,"about_ca_system_score_codex":0.00021044062,"about_ca_system_score_gemma":0.00012520765,"threshold_uncertainty_score":0.2584248},"labels":[],"label_agreement":null},{"id":"W4414612673","doi":"10.1080/01605682.2025.2544865","title":"Green supply chain coordination with profit-sharing and government intervention: a game-theoretic approach applied to the pharmaceutical industry","year":2025,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Supply chain; Pharmaceutical industry; Government (linguistics); Purchasing; Supply chain management; Production (economics)","score_opus":0.030747634603894864,"score_gpt":0.3221034897736189,"score_spread":0.29135585516972407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414612673","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.6276955,0.00028066212,0.019892491,0.32765582,0.0003218812,0.0039230003,0.0000056428107,0.000027420178,0.020197544],"genre_scores_gemma":[0.9893389,0.000008188638,0.0004093059,0.0032244625,0.00057756493,0.00012478798,0.0000027453,0.0000132480845,0.0063008233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763155,0.00007948806,0.00030710734,0.00021219708,0.0014786641,0.00029100565],"domain_scores_gemma":[0.9989232,0.00011345758,0.00013182405,0.00020695281,0.00059721735,0.000027388292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005502893,0.00012308371,0.00013868013,0.00009730079,0.0005812671,0.0006845641,0.00066424854,0.0000707362,0.000094299794],"category_scores_gemma":[0.00028581504,0.00006773674,0.00010537274,0.00093222,0.00020371654,0.00039287546,0.0010032648,0.0009328782,0.0000040181635],"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.0007879657,0.00043712382,0.057790738,0.0012603274,0.0007493856,0.000009656408,0.0016225588,0.017378286,0.00049055665,0.82122236,0.08715642,0.011094616],"study_design_scores_gemma":[0.009167162,0.00023166921,0.10418681,0.0012660421,0.00048721608,0.000043982473,0.09140225,0.46864766,0.0006539831,0.033332754,0.289835,0.0007454635],"about_ca_topic_score_codex":0.000045189427,"about_ca_topic_score_gemma":0.000008053612,"teacher_disagreement_score":0.7878896,"about_ca_system_score_codex":0.00044002553,"about_ca_system_score_gemma":0.000103762126,"threshold_uncertainty_score":0.66012675},"labels":[],"label_agreement":null},{"id":"W4416223881","doi":"10.1080/01605682.2025.2579861","title":"Snowplough service area reconfiguration using workload balancing techniques with route optimisation for large municipalities","year":2025,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","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":true,"ca_institutions":"Surrey Place Centre; Ontario Tech University","funders":"","keywords":"Workload; Control reconfiguration; Scheduling (production processes); Service (business); Information technology; Information system; Information and Communications Technology","score_opus":0.07968452884789758,"score_gpt":0.38376901599018215,"score_spread":0.3040844871422846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416223881","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.19019027,0.00032981142,0.803176,0.00428855,0.00027901627,0.0007192041,0.000026032905,0.00006462168,0.00092649565],"genre_scores_gemma":[0.49429348,0.00017927449,0.5038389,0.00049555424,0.00029292604,0.000044096792,0.000009575362,0.00003372457,0.00081248407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846935,0.00023783639,0.00040131542,0.000103272985,0.0005345266,0.00025369757],"domain_scores_gemma":[0.9973579,0.0005266898,0.00010422631,0.00017798335,0.0017914729,0.000041694286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039326022,0.000108539796,0.00016867835,0.000092073446,0.0005632065,0.00020936172,0.00029696574,0.00010507025,0.000020046016],"category_scores_gemma":[0.0004193743,0.00007781767,0.00012360085,0.0006673645,0.000036643352,0.00045703189,0.000051072475,0.00047834532,2.4697852e-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.000058522564,0.000034734807,0.00078349956,0.00016495417,0.00019910687,3.4716257e-7,0.002873973,0.97247005,0.017057827,0.0016372583,0.0034141177,0.0013056],"study_design_scores_gemma":[0.00054237264,0.000034739325,0.0006541133,0.0007566885,0.000031522453,0.0000117123645,0.0019087427,0.973933,0.018886117,0.00044890906,0.002687012,0.00010509164],"about_ca_topic_score_codex":0.00001983682,"about_ca_topic_score_gemma":0.000022512239,"teacher_disagreement_score":0.30410323,"about_ca_system_score_codex":0.0005507058,"about_ca_system_score_gemma":0.00047221687,"threshold_uncertainty_score":0.43317857},"labels":[],"label_agreement":null},{"id":"W4416664807","doi":"10.1080/01605682.2025.2589320","title":"Operational research for sustainability and sustainable development: introduction to the Special Issue","year":2025,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Complex Systems and Decision Making","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":"Simon Fraser University","funders":"Khalifa University of Science, Technology and Research","keywords":"Sustainability; Information and Communications Technology; Project management; Information system; Information technology; Purchasing","score_opus":0.17995213537259894,"score_gpt":0.5150019423385109,"score_spread":0.335049806965912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416664807","genre_codex":"commentary","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.1461897,0.0009298402,0.03236956,0.8101754,0.0024955492,0.003949672,0.00001704228,0.0000075419953,0.0038656716],"genre_scores_gemma":[0.7161954,0.000020170748,0.010642281,0.0014414052,0.023236793,0.00018426985,0.000001993183,0.00001739757,0.24826027],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99113363,0.0016839074,0.001043852,0.0004196349,0.005148189,0.00057077844],"domain_scores_gemma":[0.96576697,0.0076352647,0.0001591875,0.0005942879,0.025690183,0.00015410999],"candidate_categories":["metaresearch","sts","scholarly_communication"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.08467657,0.00010952623,0.00025290903,0.00039257252,0.0052449238,0.0020833362,0.0015150339,0.00008364657,0.0003816961],"category_scores_gemma":[0.056556236,0.000054308086,0.00022003424,0.0026814619,0.00038909912,0.00052520324,0.0012995754,0.00081395515,0.000020495429],"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.00015253606,0.00005181301,0.0004695961,0.000015726879,0.000029463718,8.4945026e-7,0.0025558327,0.0022291527,0.00013215897,0.13441963,0.8546866,0.0052566463],"study_design_scores_gemma":[0.00032258377,0.000074626514,0.0072686966,0.00001994019,0.0000024174874,0.00001168264,0.020825882,0.0021401295,0.00017889366,0.13373818,0.8353665,0.000050458835],"about_ca_topic_score_codex":0.000046404693,"about_ca_topic_score_gemma":0.000073002026,"teacher_disagreement_score":0.808734,"about_ca_system_score_codex":0.0010902171,"about_ca_system_score_gemma":0.0049159215,"threshold_uncertainty_score":0.99895257},"labels":[],"label_agreement":null},{"id":"W4417405393","doi":"10.1080/01605682.2025.2599390","title":"Integrating buyer and supplier objectives in an iterative combinatorial auction for procurement","year":2025,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; McMaster University; Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Procurement; Purchasing; Project management; Supplier relationship management; Reverse auction; Information technology; Combinatorial auction; Information system; Scheduling (production processes)","score_opus":0.1491316531208211,"score_gpt":0.522288225136903,"score_spread":0.3731565720160819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417405393","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.9129596,0.00014153816,0.05556723,0.02810219,0.0009282154,0.001284631,0.000024337833,0.0000049058076,0.0009873773],"genre_scores_gemma":[0.9953257,0.000010788986,0.0027107548,0.00017203043,0.00025242407,0.000065756176,0.0000012650353,0.0000030275855,0.0014582883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997794,0.000523481,0.00046066073,0.00017091403,0.0009257285,0.00012524462],"domain_scores_gemma":[0.99599165,0.0015527713,0.00014348344,0.00013939754,0.002127403,0.00004528434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009743918,0.000059779937,0.00012777028,0.00011946912,0.00077992474,0.00037450975,0.0003682195,0.000054356587,0.000042127293],"category_scores_gemma":[0.0031749078,0.00003369756,0.000111148365,0.0006718291,0.00021176871,0.0005994967,0.00009415007,0.0004186639,0.0000011173427],"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.00039422142,0.00043533256,0.008121108,0.000012468948,0.00007411023,2.1790989e-7,0.011373126,0.002129417,0.022407806,0.9194643,0.028475758,0.007112157],"study_design_scores_gemma":[0.0014140415,0.00026695913,0.01917438,0.00007317648,0.000008660675,0.000006711301,0.021700839,0.012586944,0.008924853,0.91737986,0.018380294,0.000083265695],"about_ca_topic_score_codex":0.0000043399777,"about_ca_topic_score_gemma":0.000019429568,"teacher_disagreement_score":0.08236609,"about_ca_system_score_codex":0.00018033756,"about_ca_system_score_gemma":0.00047600793,"threshold_uncertainty_score":0.59986293},"labels":[],"label_agreement":null},{"id":"W7084045237","doi":"10.1080/01605682.2025.2554741","title":"Multi-operator driven iterated tabu search for inter-hospital operating room scheduling","year":2025,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Remote Sensing in Agriculture","field":"Environmental Science","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":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Tabu search; Scheduling (production processes); Job shop scheduling; Iterated local search; Project management; Information system; Iterated function","score_opus":0.03287432205564653,"score_gpt":0.35173993184677277,"score_spread":0.3188656097911262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084045237","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.9705351,0.000102956896,0.010719043,0.016727498,0.00061666657,0.0007809805,0.000013595063,0.000010591973,0.0004935631],"genre_scores_gemma":[0.88321817,0.00003665759,0.110897645,0.00069476,0.00032681684,0.000007009241,0.0000060587918,0.000016668919,0.004796196],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973354,0.0003682045,0.00048653287,0.000269263,0.0011182495,0.00042238605],"domain_scores_gemma":[0.9983287,0.00040734225,0.000097763404,0.00022517613,0.0008197986,0.00012124898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029094452,0.00015113736,0.00020312158,0.000041275955,0.0012481733,0.00049839425,0.00081555196,0.00013603843,0.00015154139],"category_scores_gemma":[0.0010610914,0.000088426874,0.00033780123,0.00071632053,0.000271783,0.00048605818,0.0005556381,0.0011090458,0.000027425367],"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.0000469135,0.00038266662,0.019076653,0.00003726109,0.00022896544,0.0000051240627,0.0041843043,0.18486622,0.6875905,0.00028392542,0.10166937,0.0016280974],"study_design_scores_gemma":[0.0026973474,0.00041705984,0.0450231,0.0006459887,0.00003740781,0.0000437057,0.004840721,0.84178275,0.08596312,0.00014247763,0.018024383,0.00038194892],"about_ca_topic_score_codex":0.00004487361,"about_ca_topic_score_gemma":0.000022654303,"teacher_disagreement_score":0.6569165,"about_ca_system_score_codex":0.0008426906,"about_ca_system_score_gemma":0.00035851554,"threshold_uncertainty_score":0.9600066},"labels":[],"label_agreement":null}]}