{"meta":{"query_hash":"9598dfac4f04","filters":{"venue":"Operational Research"},"cohort_total":25,"direct_labels_cover":0,"predictions_cover":25,"exported":25,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/9598dfac4f04","api":"https://metacan.xera.ac/api/v1/cohort?venue=Operational+Research"},"results":[{"id":"W1002640774","doi":"10.1007/s12351-015-0190-0","title":"Some analysis results associated with the optimization problem for a discrete-time finite-buffer NT-policy queue","year":2015,"lang":"en","type":"article","venue":"Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Natural Science Foundation of China","keywords":"Computational intelligence; Queue; Buffer (optical fiber); Computer science; Mathematical optimization; Mathematics; Artificial intelligence; Computer network","score_opus":0.0585801835029579,"score_gpt":0.34571595907665564,"score_spread":0.28713577557369774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1002640774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018626695,0.0031110526,0.95073557,0.0030172886,0.00048632425,0.00008821994,0.0002012158,0.00014879004,0.023584876],"genre_scores_gemma":[0.7443806,0.007402448,0.20997418,0.0016466104,0.0020246608,0.00036537537,0.00050742034,0.00034360177,0.0333551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987895,0.0004272535,0.00006878596,0.00017330264,0.00037152373,0.00016971063],"domain_scores_gemma":[0.99339724,0.005119987,0.00043571126,0.00015373742,0.0006673523,0.0002260048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043557286,0.001660288,0.0012429145,0.0017313327,0.001129066,0.0034498412,0.0018644646,0.0015943691,0.0078057046],"category_scores_gemma":[0.01106093,0.0006940042,0.0016587252,0.0023078432,0.0020142798,0.0045121973,0.0011347936,0.0033703456,0.0006390757],"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.0001985313,0.00021018037,0.00083394186,0.00037556354,0.00008237362,0.00027048466,0.00023232654,0.25192192,0.0035439436,0.7127471,0.006854653,0.02272891],"study_design_scores_gemma":[0.000018148145,0.00003110696,0.00039095516,0.000044032775,0.000032960066,0.000057396217,0.000048653877,0.79698634,0.0005660902,0.2002099,0.0015884101,0.000025988804],"about_ca_topic_score_codex":0.0063545345,"about_ca_topic_score_gemma":0.0040248972,"teacher_disagreement_score":0.0078057046,"about_ca_system_score_codex":0.0036827123,"about_ca_system_score_gemma":0.0031191632,"threshold_uncertainty_score":0.026720107},"labels":[],"label_agreement":null},{"id":"W1967863088","doi":"10.1007/s12351-011-0106-6","title":"Tail asymptotics for M/M/c retrial queues with non-persistent customers","year":2011,"lang":"en","type":"article","venue":"Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Retrial queue; Mathematics; Lemma (botany); Joint probability distribution; Applied mathematics; Scalar (mathematics); Queue; Product (mathematics); Computer science; Queueing theory; Queueing system; Statistics; Computer network","score_opus":0.10422448553669783,"score_gpt":0.33374560155319144,"score_spread":0.2295211160164936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967863088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23183526,0.004921209,0.7226577,0.007008196,0.0007303474,0.00021747554,0.00070133776,0.0023354539,0.029593002],"genre_scores_gemma":[0.94737834,0.0019402055,0.024412038,0.0010923136,0.0009962113,0.00024111696,0.0005030662,0.00055549445,0.022881208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99699926,0.0008185334,0.00011716483,0.00042485454,0.0008010093,0.00083910435],"domain_scores_gemma":[0.95445496,0.029432522,0.004394843,0.0029098014,0.006057709,0.0027501432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01186277,0.0020608227,0.0023845977,0.0045577683,0.0023903104,0.004442648,0.0067507615,0.0033723852,0.009886392],"category_scores_gemma":[0.065613545,0.0016548935,0.0016058169,0.0031352038,0.005795101,0.007726649,0.0050642444,0.0068106144,0.001843068],"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.000732836,0.00037845323,0.0056825434,0.00043717428,0.00010823702,0.00079519255,0.0011793292,0.20712219,0.0071625332,0.7411067,0.013644954,0.021649871],"study_design_scores_gemma":[0.000040164057,0.000059146212,0.0011889571,0.00006879066,0.00004132617,0.00014982192,0.00015032184,0.8922803,0.00074426696,0.10455316,0.0006569659,0.00006675423],"about_ca_topic_score_codex":0.012682265,"about_ca_topic_score_gemma":0.008093584,"teacher_disagreement_score":0.012682265,"about_ca_system_score_codex":0.00633778,"about_ca_system_score_gemma":0.003962596,"threshold_uncertainty_score":0.06273705},"labels":[],"label_agreement":null},{"id":"W1982108162","doi":"10.1007/bf02941128","title":"Multiple criteria analysis in the context of information imperfections: Processing of additional information","year":2005,"lang":"en","type":"article","venue":"Operational Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Ambiguity; Context (archaeology); Computer science; Information processing; Process (computing); Computational intelligence; Order (exchange); Adaptation (eye); Bayesian probability; Data mining; Artificial intelligence; Psychology","score_opus":0.21571481054599323,"score_gpt":0.5078727336886218,"score_spread":0.2921579231426286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982108162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054565255,0.0012672207,0.9385818,0.001350423,0.00011813806,0.00013050143,0.00006844463,0.000060140417,0.003858005],"genre_scores_gemma":[0.72584856,0.0010496989,0.2713601,0.00019659268,0.00026999912,0.00023500473,0.00007351557,0.000042016054,0.0009245216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.982128,0.011671436,0.0007120226,0.0012784003,0.00358155,0.0006284779],"domain_scores_gemma":[0.892518,0.09299294,0.005009332,0.003414802,0.005067346,0.0009975651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02253808,0.001616349,0.0036729607,0.0024320418,0.0012783488,0.0065564928,0.0021643087,0.0025842981,0.0026184919],"category_scores_gemma":[0.08102563,0.00096650014,0.0016189922,0.0034674432,0.0029125633,0.007452544,0.0030949204,0.0029884211,0.00018291501],"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.0010882952,0.00043247183,0.0030145927,0.0015928051,0.0009206219,0.001139443,0.0017629266,0.59314656,0.005349385,0.19796884,0.0018601588,0.19172388],"study_design_scores_gemma":[0.00004713111,0.00012861965,0.00093159685,0.00010601203,0.0001064628,0.000086423315,0.00019693103,0.8068311,0.0013973427,0.18941003,0.00068420253,0.000074174524],"about_ca_topic_score_codex":0.0021317708,"about_ca_topic_score_gemma":0.0019820489,"teacher_disagreement_score":0.02253808,"about_ca_system_score_codex":0.0018710304,"about_ca_system_score_gemma":0.00251309,"threshold_uncertainty_score":0.11919421},"labels":[],"label_agreement":null},{"id":"W2091803583","doi":"10.1007/s12351-014-0156-7","title":"Climate-induced catastrophic shifts in pastoralism systems managed under the maximum sustainable yield model","year":2014,"lang":"en","type":"article","venue":"Operational Research","topic":"Ecosystem dynamics and resilience","field":"Environmental Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Environmental science; Arid; Ecosystem; Precipitation; Grazing; Biomass (ecology); Ecological stability; Climate change; Maximum sustainable yield; Herbivore; Desertification; Vegetation (pathology); Ecology; Atmospheric sciences; Meteorology; Geography; Biology; Geology","score_opus":0.04197141462096572,"score_gpt":0.30578572611242677,"score_spread":0.26381431149146106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091803583","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99892116,0.000025601423,0.00031511573,0.00008246668,0.00000401456,0.000003538039,0.00008906686,0.000010539338,0.0005485116],"genre_scores_gemma":[0.9998647,0.0000071583513,0.000052612482,0.00000437107,7.3841767e-7,0.0000019814279,0.00002680978,0.000001260479,0.00004040569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960047,0.0001473461,0.000022550747,0.000051104467,0.000025374175,0.0001531571],"domain_scores_gemma":[0.99856406,0.0006593282,0.0003296916,0.00014466578,0.00012186148,0.00018030823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016260643,0.0002427894,0.00033269593,0.0004788248,0.0005158011,0.0006740775,0.00060644175,0.00055532804,0.0016659985],"category_scores_gemma":[0.0035023517,0.00017295573,0.0005191873,0.00062332297,0.0007876674,0.0008485011,0.00072382524,0.0005200181,0.00006169424],"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.0014052766,0.0002699948,0.176624,0.00009988904,0.00036389753,0.0005031289,0.00036277,0.7894659,0.0063960417,0.011460343,0.0015789948,0.0114697525],"study_design_scores_gemma":[0.00009687411,0.0005042491,0.16409576,0.000018823348,0.00015793397,0.00015310157,0.0012112157,0.81701857,0.002091626,0.0138579225,0.0007455689,0.000048397964],"about_ca_topic_score_codex":0.011326124,"about_ca_topic_score_gemma":0.015266482,"teacher_disagreement_score":0.011326124,"about_ca_system_score_codex":0.0019066427,"about_ca_system_score_gemma":0.0006570967,"threshold_uncertainty_score":0.022520423},"labels":[],"label_agreement":null},{"id":"W2194624903","doi":"10.1007/s12351-015-0216-7","title":"Fuzzy chance-constrained geometric programming: the possibility, necessity and credibility approaches","year":2015,"lang":"en","type":"article","venue":"Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Credibility; Mathematical optimization; Computational intelligence; Ambiguity; Duality (order theory); Computer science; Credibility theory; Fuzzy logic; Optimization problem; Process (computing); Face (sociological concept); Mathematics; Artificial intelligence","score_opus":0.2686170978067754,"score_gpt":0.3633974369433609,"score_spread":0.09478033913658551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2194624903","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007901699,0.0020705,0.974021,0.0023796381,0.00013564194,0.000030883206,0.000073858304,0.00003245753,0.013354283],"genre_scores_gemma":[0.71506584,0.0064020525,0.26293918,0.00054131023,0.001512955,0.00024099315,0.00017230232,0.00012952156,0.012995851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99673504,0.0020138717,0.000116625604,0.00029620872,0.0006680873,0.00017005361],"domain_scores_gemma":[0.98429686,0.012764182,0.00092232245,0.00038316086,0.0010707467,0.00056280947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006646699,0.0015621344,0.001866672,0.002814826,0.001189842,0.0043102573,0.0021872115,0.002333054,0.004977785],"category_scores_gemma":[0.022983702,0.00095307804,0.0016987401,0.002770884,0.0054939752,0.0076122535,0.0028503977,0.0040714988,0.00032148894],"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.000019266516,0.000012418903,0.00014557166,0.00008001414,0.000030020734,0.000050690218,0.00007963701,0.041881796,0.00013176624,0.9486063,0.0008272537,0.008135286],"study_design_scores_gemma":[0.0000066434077,0.000018546129,0.00009380924,0.000049194612,0.000014042958,0.000044074935,0.000042106,0.147811,0.00010232163,0.8503231,0.0014769466,0.000018182698],"about_ca_topic_score_codex":0.0020627552,"about_ca_topic_score_gemma":0.001664704,"teacher_disagreement_score":0.006646699,"about_ca_system_score_codex":0.0026521184,"about_ca_system_score_gemma":0.0023169299,"threshold_uncertainty_score":0.03515148},"labels":[],"label_agreement":null},{"id":"W2474290527","doi":"10.1007/s12351-016-0251-z","title":"A new monarch butterfly optimization with an improved crossover operator","year":2016,"lang":"en","type":"article","venue":"Operational Research","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Government of Jiangsu Province; National Natural Science Foundation of China","keywords":"Crossover; Operator (biology); Benchmark (surveying); Butterfly; Computer science; Swarm intelligence; Mathematical optimization; Metaheuristic; Artificial intelligence; Particle swarm optimization; Mathematics; Algorithm; Ecology","score_opus":0.05427543962770417,"score_gpt":0.36476054377367145,"score_spread":0.3104851041459673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2474290527","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06902066,0.0012527845,0.9048914,0.00048784108,0.00063560245,0.00015915358,0.00020576273,0.00091789773,0.022428917],"genre_scores_gemma":[0.41646942,0.00062841445,0.5482933,0.00038839545,0.00024276639,0.00030962602,0.00030569936,0.00025754573,0.03310487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999814,0.00003675311,0.000008437775,0.000033835116,0.000076741475,0.0000302762],"domain_scores_gemma":[0.999881,0.000033373773,0.0000133085605,0.000023327733,0.00003340603,0.00001550643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031757783,0.0005751158,0.0008603788,0.0007534071,0.0004710794,0.00067479763,0.00134672,0.001118801,0.004447746],"category_scores_gemma":[0.00045119555,0.00029895408,0.00073282106,0.0009908363,0.0003732117,0.0006740633,0.00077991403,0.0007023361,0.00048473492],"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.00038052644,0.00024123782,0.00080069096,0.00024254106,0.00019689942,0.00022918137,0.0001024812,0.54396284,0.042117134,0.059241462,0.009053798,0.3434312],"study_design_scores_gemma":[0.000063356754,0.00012276079,0.00036127245,0.000012735329,0.00003933704,0.00008920014,0.000012188394,0.98747253,0.0030056725,0.0034836333,0.0053165765,0.000020647089],"about_ca_topic_score_codex":0.0025307008,"about_ca_topic_score_gemma":0.0040390654,"teacher_disagreement_score":0.004447746,"about_ca_system_score_codex":0.0006042303,"about_ca_system_score_gemma":0.0006725387,"threshold_uncertainty_score":0.014879227},"labels":[],"label_agreement":null},{"id":"W2807367385","doi":"10.1007/s12351-018-0410-5","title":"Formulating the integrated forest harvest-scheduling model to reduce the cost of the road-networks","year":2018,"lang":"en","type":"article","venue":"Operational Research","topic":"Forest Biomass Utilization and Management","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Resources Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Natural Resources Limited; Ontario Ministry of Natural Resources and Forestry","keywords":"Computational intelligence; Scheduling (production processes); Computer science; Operations research; Mathematical optimization; Artificial intelligence; Engineering; Mathematics","score_opus":0.08130707853938561,"score_gpt":0.3519637063581594,"score_spread":0.27065662781877375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807367385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11581996,0.00026471395,0.86439484,0.00062351726,0.00014662792,0.0002240355,0.0006979806,0.00044191274,0.017386287],"genre_scores_gemma":[0.8519895,0.00019272264,0.13548791,0.00013179467,0.00006181901,0.0003260979,0.0004497414,0.00019159509,0.011168786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996345,0.00008980768,0.0000123475975,0.00007350863,0.000071862254,0.00011786357],"domain_scores_gemma":[0.9993374,0.00039303984,0.000057707613,0.000031250736,0.000118635304,0.000061977276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008418506,0.0008892369,0.0015410696,0.0005492807,0.0006984547,0.0015873626,0.0018815268,0.0015876475,0.010967136],"category_scores_gemma":[0.0017091597,0.00095875753,0.000964186,0.0010045622,0.00051393075,0.0014458761,0.0008566182,0.0017614772,0.00055901223],"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.000008093782,0.00001349304,0.00011208511,0.000010457305,0.0000046784908,0.000012581526,0.000004173886,0.99684876,0.0001150811,0.0009716101,0.00016665757,0.0017322897],"study_design_scores_gemma":[0.000003983487,0.000004483024,0.00003877302,0.0000013405905,0.0000035432843,0.0000018366668,0.0000062775944,0.9991474,0.000050366925,0.0006597592,0.000081040525,0.0000012023281],"about_ca_topic_score_codex":0.036771823,"about_ca_topic_score_gemma":0.0485928,"teacher_disagreement_score":0.036771823,"about_ca_system_score_codex":0.0022209997,"about_ca_system_score_gemma":0.00417926,"threshold_uncertainty_score":0.07311559},"labels":[],"label_agreement":null},{"id":"W2886815464","doi":"10.1007/s12351-018-0415-0","title":"Solving a multi-objective sustainable waste collection problem considering a new collection network","year":2018,"lang":"en","type":"article","venue":"Operational Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Waste collection; Heuristic; Data collection; Computational intelligence; Supply chain network; Operations research; Hazardous waste; Meta heuristic; Network planning and design; Reverse logistics; Supply chain; Supply chain management; Municipal solid waste; Artificial intelligence; Waste management; Engineering; Algorithm; Business; Mathematics","score_opus":0.047808935460095334,"score_gpt":0.31450379207285645,"score_spread":0.2666948566127611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886815464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35066247,0.0011647902,0.6276431,0.0018058225,0.00024237599,0.00042072646,0.0005289931,0.00023499102,0.017296772],"genre_scores_gemma":[0.83340997,0.00057571067,0.15571497,0.00013905027,0.00012495903,0.00033038566,0.0003413254,0.0000745697,0.009289067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991062,0.0003481524,0.000041560532,0.0002108188,0.000116946656,0.00017629024],"domain_scores_gemma":[0.9976042,0.0016969339,0.00023180524,0.00007183526,0.00020618955,0.00018905937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022618596,0.0017685082,0.0025869862,0.0016298626,0.0013981302,0.003034289,0.0024478794,0.0045923963,0.005003395],"category_scores_gemma":[0.003943483,0.001252125,0.0015669529,0.0024809819,0.0011828013,0.0032313676,0.0018862858,0.0018744655,0.00022525628],"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.000057649777,0.00005738566,0.00037044304,0.00009621404,0.000041184056,0.00013934965,0.00002726301,0.9916698,0.000371802,0.0018513784,0.00025223917,0.005065286],"study_design_scores_gemma":[0.000017478624,0.000055460514,0.00013350563,0.000009044972,0.00002742004,0.000017524524,0.000049677612,0.9976566,0.00016527303,0.0015935429,0.000267588,0.0000068769064],"about_ca_topic_score_codex":0.015554188,"about_ca_topic_score_gemma":0.011039008,"teacher_disagreement_score":0.015554188,"about_ca_system_score_codex":0.0020368446,"about_ca_system_score_gemma":0.0023853104,"threshold_uncertainty_score":0.0309273},"labels":[],"label_agreement":null},{"id":"W2891565222","doi":"10.1007/s12351-018-0424-z","title":"Effects of non-normal quality data on the integrated model of imperfect maintenance, early replacement, and economic design of $${\\bar{X}}$$-control charts","year":2018,"lang":"en","type":"article","venue":"Operational Research","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Control chart; Normality; Reliability engineering; Computer science; Quality (philosophy); Reliability (semiconductor); Imperfect; \\bar x and R chart; Sample (material); Control (management); Control limits; Process (computing); Statistics; Mathematics; Engineering; Power (physics)","score_opus":0.05567758386509606,"score_gpt":0.32665989470964635,"score_spread":0.27098231084455027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891565222","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66942626,0.00057905144,0.32005244,0.0015667465,0.00017130135,0.00011714335,0.0005371319,0.00069855194,0.0068513155],"genre_scores_gemma":[0.9945803,0.00007215775,0.004445847,0.000029500616,0.000011070425,0.000023626706,0.00006250357,0.000029856417,0.00074508553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976961,0.0012280995,0.00006682555,0.0002972854,0.00030796358,0.00040370825],"domain_scores_gemma":[0.96577424,0.028700013,0.0022098883,0.0008566265,0.0019057617,0.0005534432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009775504,0.0011762207,0.0016753896,0.0008194868,0.00057035754,0.0029980324,0.001730395,0.0013926717,0.0025555294],"category_scores_gemma":[0.03851848,0.0010336722,0.00074674457,0.0005206532,0.0018884067,0.0024307973,0.0010466743,0.002516725,0.00014286004],"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.00013500421,0.000033903932,0.0004002252,0.000013536603,0.000010072183,0.000016573882,0.000011700952,0.99492455,0.00022180517,0.0033222977,0.00010196204,0.00080836844],"study_design_scores_gemma":[0.000016073842,0.000039106606,0.00022577945,0.000002547786,0.0000111551435,0.0000025482789,0.000004494826,0.99847,0.00024829915,0.00094314176,0.000029664128,0.0000071221953],"about_ca_topic_score_codex":0.020157266,"about_ca_topic_score_gemma":0.011354207,"teacher_disagreement_score":0.020157266,"about_ca_system_score_codex":0.0028703613,"about_ca_system_score_gemma":0.0019268455,"threshold_uncertainty_score":0.051698446},"labels":[],"label_agreement":null},{"id":"W2912136880","doi":"10.1007/s12351-019-00451-x","title":"A light robust model for aggregate production planning with consideration of environmental impacts of machines","year":2019,"lang":"en","type":"article","venue":"Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Aggregate planning; Production (economics); Aggregate (composite); Computer science; Production planning; Environmental pollution; Computational intelligence; Sensitivity (control systems); Variable (mathematics); Product (mathematics); Operations research; Control (management); Function (biology); Risk analysis (engineering); Mathematical optimization; Environmental science; Artificial intelligence; Engineering; Economics; Mathematics; Business; Microeconomics","score_opus":0.05105892803399259,"score_gpt":0.3152119319201446,"score_spread":0.264153003886152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912136880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014299681,0.00020816512,0.97723913,0.00031423094,0.000058957954,0.000050772032,0.00031943695,0.0002884318,0.007221249],"genre_scores_gemma":[0.90416026,0.0004629103,0.07638476,0.00021674701,0.00008713368,0.00028508416,0.00045606028,0.00017832864,0.017768733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995203,0.00013110494,0.000017566925,0.00012353943,0.00012611752,0.000081537226],"domain_scores_gemma":[0.99938726,0.00028166609,0.00012495281,0.000046235058,0.000109868335,0.000050007846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010045096,0.00081650185,0.0015780831,0.0006608791,0.00049060874,0.0018003484,0.0019984818,0.0016509466,0.0052087894],"category_scores_gemma":[0.0021171002,0.0006724304,0.0011239895,0.0008372504,0.0010924242,0.0013539147,0.0014215133,0.0011964656,0.0007045943],"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.000016236912,0.0000065667346,0.000039356768,0.000015160007,0.0000084731255,0.00001523889,0.000006044749,0.99269,0.00035442924,0.0049437336,0.00016220685,0.0017425466],"study_design_scores_gemma":[0.0000033286924,0.000008528152,0.000029115989,0.0000014988748,0.0000036264487,0.0000020770558,0.0000014733082,0.9977456,0.00007094648,0.0019688657,0.00016178518,0.0000030900321],"about_ca_topic_score_codex":0.011516691,"about_ca_topic_score_gemma":0.008130763,"teacher_disagreement_score":0.011516691,"about_ca_system_score_codex":0.0015339216,"about_ca_system_score_gemma":0.0012922882,"threshold_uncertainty_score":0.02289933},"labels":[],"label_agreement":null},{"id":"W3006547441","doi":"10.1007/s12351-020-00551-z","title":"Measuring consistency of interval-valued preference relations: comments and comparison","year":2020,"lang":"en","type":"article","venue":"Operational Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Consistency (knowledge bases); Preference; Preference relation; Mathematics; Reciprocal; Interval (graph theory); Multiplicative function; Sequential consistency; Causal consistency; Local consistency; Weak consistency; Relation (database); Strong consistency; Statistics; Consistency model; Discrete mathematics; Computer science; Combinatorics; Algorithm; Data mining; Constraint satisfaction problem; Mathematical analysis","score_opus":0.8489374756264574,"score_gpt":0.5710113278039322,"score_spread":0.2779261478225252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006547441","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28327638,0.028916853,0.24405614,0.35886717,0.010865335,0.0018275711,0.0029105658,0.0006399075,0.06864018],"genre_scores_gemma":[0.8455237,0.0051447703,0.11598562,0.022277966,0.0053245523,0.0009874209,0.00094818714,0.00023066936,0.0035771828],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.91613275,0.04347969,0.010277998,0.0039007438,0.025222221,0.0009866557],"domain_scores_gemma":[0.26069662,0.63603574,0.006591559,0.011931459,0.083745696,0.0009988897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.10548196,0.0008724042,0.0010843435,0.0033665088,0.002114373,0.0042626327,0.0051454366,0.0036049425,0.005880439],"category_scores_gemma":[0.47879985,0.0003198369,0.0021601408,0.00485439,0.004188842,0.007343473,0.0024814515,0.0038198903,0.0009790251],"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.0062674102,0.0007272035,0.07619978,0.00713822,0.0012431812,0.0026180204,0.035910226,0.008578638,0.01129372,0.17947447,0.09946185,0.57108736],"study_design_scores_gemma":[0.0011943954,0.004904405,0.15736128,0.01385447,0.002280894,0.0074367616,0.13345192,0.058821335,0.03302243,0.34206516,0.2441832,0.0014237191],"about_ca_topic_score_codex":0.005523395,"about_ca_topic_score_gemma":0.0036147542,"teacher_disagreement_score":0.10548196,"about_ca_system_score_codex":0.0038301288,"about_ca_system_score_gemma":0.002670136,"threshold_uncertainty_score":0.5578486},"labels":[],"label_agreement":null},{"id":"W3040613025","doi":"10.1007/s12351-020-00583-5","title":"Reliable cross-docking location problem under the risk of disruptions","year":2020,"lang":"en","type":"article","venue":"Operational Research","topic":"Supply Chain Resilience and Risk Management","field":"Business, Management and Accounting","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Computational intelligence; Flow network; Integer programming; Operations research; Supply chain; Lagrangian relaxation; Mathematical optimization; Network planning and design; Supply chain network; Supply network; Risk analysis (engineering); Supply chain management; Engineering; Mathematics; Artificial intelligence; Computer network; Algorithm; Business","score_opus":0.07509801975831788,"score_gpt":0.3635543060252351,"score_spread":0.2884562862669172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040613025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21622087,0.0010216192,0.7712422,0.0032067508,0.00018502052,0.00009883584,0.0006662817,0.0005363323,0.0068221735],"genre_scores_gemma":[0.97461253,0.00044093354,0.02065226,0.00008245626,0.00008513725,0.000047579964,0.00030915864,0.00008834672,0.0036815878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972258,0.00089276524,0.00020286752,0.0007250475,0.00040864942,0.0005447051],"domain_scores_gemma":[0.97390217,0.016890053,0.003960819,0.0023090148,0.0019623789,0.00097555434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004831393,0.0013035695,0.0028773067,0.0016739139,0.0016622562,0.0032867629,0.0037534232,0.0047399895,0.0066788634],"category_scores_gemma":[0.032539397,0.001335598,0.0012317137,0.003249682,0.003308318,0.0073941858,0.004554953,0.002907519,0.0007531231],"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.0003405033,0.000028999111,0.0016912202,0.00012382367,0.000083529114,0.0004815337,0.00017373568,0.9538089,0.0006942167,0.02994805,0.0022347465,0.0103907045],"study_design_scores_gemma":[0.00003324352,0.000079822385,0.0007412441,0.00003463395,0.0000456996,0.00026938718,0.00027241686,0.93224704,0.0006652237,0.065001115,0.00056837715,0.00004166603],"about_ca_topic_score_codex":0.0063515753,"about_ca_topic_score_gemma":0.002527963,"teacher_disagreement_score":0.0066788634,"about_ca_system_score_codex":0.0018235893,"about_ca_system_score_gemma":0.0015056088,"threshold_uncertainty_score":0.02555114},"labels":[],"label_agreement":null},{"id":"W3095582500","doi":"10.1007/s12351-020-00612-3","title":"Solving the integrated forest harvest scheduling model using metaheuristic algorithms","year":2020,"lang":"en","type":"article","venue":"Operational Research","topic":"Forest Management and Policy","field":"Environmental Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Metaheuristic; Computer science; Mathematical optimization; Scheduling (production processes); Computational intelligence; Transportation theory; Function (biology); Algorithm; Operations research; Mathematics; Artificial intelligence","score_opus":0.16341042277682608,"score_gpt":0.375260113949023,"score_spread":0.2118496911721969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095582500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23207317,0.00071652076,0.74630797,0.00051443506,0.00014091219,0.0002004677,0.00065896456,0.00039026805,0.01899734],"genre_scores_gemma":[0.8440801,0.00036824535,0.14331694,0.0001196826,0.00008273743,0.00035425022,0.0005088085,0.000118985095,0.011050285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965763,0.00008736622,0.000010862831,0.00007697192,0.000051734194,0.00011549224],"domain_scores_gemma":[0.99950016,0.00030228114,0.00007133274,0.000021909205,0.000053298525,0.000051022642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008612982,0.0010215903,0.0016251727,0.00082250044,0.00059081544,0.0017767814,0.0016750331,0.0021348442,0.0045105545],"category_scores_gemma":[0.0014149724,0.0010647157,0.0013875233,0.0013257659,0.0005928184,0.0011596256,0.0010401922,0.001812399,0.00034629143],"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.000017951723,0.000021871332,0.00012469503,0.000011850901,0.000015093731,0.00001938358,0.000005744751,0.99635184,0.0001219157,0.0010071417,0.000113509894,0.0021889487],"study_design_scores_gemma":[0.000013606131,0.000013616282,0.000054369688,0.000002289628,0.000007856989,0.000004197649,0.000006807449,0.99874425,0.00006860595,0.0009834381,0.0000987597,0.0000020733075],"about_ca_topic_score_codex":0.030646088,"about_ca_topic_score_gemma":0.023125803,"teacher_disagreement_score":0.030646088,"about_ca_system_score_codex":0.0015136603,"about_ca_system_score_gemma":0.0033752471,"threshold_uncertainty_score":0.060935438},"labels":[],"label_agreement":null},{"id":"W3119253730","doi":"10.1007/s12351-020-00617-y","title":"Transfer lines with multi-machine stages and non-deterministic processing time: transient performance analysis and control","year":2021,"lang":"en","type":"article","venue":"Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Transient (computer programming); Production line; Production control; Transfer function; Computational intelligence; Transfer line; Finite-state machine; Transient state; Production (economics); State (computer science); Control engineering; Control theory (sociology); Artificial intelligence; Control (management); Industrial engineering; Algorithm; Engineering","score_opus":0.019602477390361077,"score_gpt":0.29600619389925936,"score_spread":0.2764037165088983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119253730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14564867,0.00036497402,0.8482993,0.00035457467,0.00005629354,0.000052433425,0.00008288759,0.00029031895,0.0048504444],"genre_scores_gemma":[0.98439586,0.0001330765,0.012313862,0.000017894536,0.000026534906,0.000044931327,0.00003539329,0.00003190791,0.0030006645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940884,0.00023353401,0.000020237117,0.00012138879,0.0001294876,0.000086429434],"domain_scores_gemma":[0.9970329,0.0019757494,0.00051249255,0.00016431017,0.00026271868,0.0000518948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009919155,0.0007430284,0.00072957244,0.0003618856,0.00044022713,0.001145653,0.00086581724,0.0010701785,0.0018235025],"category_scores_gemma":[0.005348423,0.0004933851,0.00042353035,0.00087182,0.0010348477,0.0015157373,0.0005261309,0.00083796383,0.00023161332],"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.00011546016,0.000027964179,0.00025756983,0.000031961816,0.00001496378,0.000049416303,0.000023668248,0.98765683,0.0017797974,0.0058397613,0.0002244429,0.003978171],"study_design_scores_gemma":[0.000004882415,0.00001957467,0.000119886645,0.0000014665792,0.0000045980873,0.0000057401103,0.0000033622816,0.9981604,0.00041206047,0.0011967629,0.000068677036,0.0000026372634],"about_ca_topic_score_codex":0.0057504373,"about_ca_topic_score_gemma":0.0038123075,"teacher_disagreement_score":0.0057504373,"about_ca_system_score_codex":0.0012640294,"about_ca_system_score_gemma":0.0007198753,"threshold_uncertainty_score":0.011433959},"labels":[],"label_agreement":null},{"id":"W3136975880","doi":"10.1007/s12351-021-00629-2","title":"Modeling and solution methods for hybrid flow shop scheduling problem with job rejection","year":2021,"lang":"en","type":"article","venue":"Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Tardiness; Mathematical optimization; Computer science; Heuristics; Job shop scheduling; Flow shop scheduling; Computational intelligence; Integer programming; Scheduling (production processes); Pareto principle; Schedule; Mathematics; Artificial intelligence","score_opus":0.07102026708183304,"score_gpt":0.3806921119306955,"score_spread":0.30967184484886245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136975880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008025221,0.0004290453,0.989141,0.00017263807,0.000071679126,0.000036607813,0.00003712031,0.00007547985,0.002011203],"genre_scores_gemma":[0.66142243,0.0012114535,0.32606834,0.00018653258,0.00022696695,0.0004857589,0.00024398534,0.00017018648,0.009984336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949324,0.00022079973,0.000021920381,0.000076884506,0.0001266508,0.000060443184],"domain_scores_gemma":[0.9989353,0.0006819247,0.00011910507,0.000037701157,0.00018132784,0.00004466679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014841224,0.0009308175,0.0011251812,0.00067601615,0.00058887247,0.001303993,0.0018343971,0.0014004083,0.0023474835],"category_scores_gemma":[0.0021278975,0.0007269204,0.0011811772,0.00073344074,0.0006093296,0.001204614,0.0009360955,0.0013669638,0.00027996395],"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.00002064571,0.000026676315,0.00011917087,0.000045007033,0.000015061544,0.000016750064,0.000020636358,0.9829336,0.0004899065,0.008830504,0.00033442577,0.0071476516],"study_design_scores_gemma":[0.0000016541399,0.0000038564726,0.0000130444,0.0000016379179,0.0000017693604,0.0000018124393,0.0000022532822,0.9986941,0.00003814727,0.0011258712,0.000114639144,0.0000011901944],"about_ca_topic_score_codex":0.010718252,"about_ca_topic_score_gemma":0.005410091,"teacher_disagreement_score":0.010718252,"about_ca_system_score_codex":0.0009193986,"about_ca_system_score_gemma":0.0016732264,"threshold_uncertainty_score":0.02131176},"labels":[],"label_agreement":null},{"id":"W3169507859","doi":"10.1007/s12351-021-00648-z","title":"A robust possibilistic programming approach for blood supply chain network design in disaster relief considering congestion","year":2021,"lang":"en","type":"article","venue":"Operational Research","topic":"Blood donation and transfusion practices","field":"Business, Management and Accounting","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Operations research; Supply chain network; Network planning and design; Pooling; Supply chain; Service level; Robust optimization; Service (business); Queueing theory; Facility location problem; Risk analysis (engineering); Supply chain management; Mathematical optimization; Artificial intelligence; Business; Engineering","score_opus":0.1412188528817411,"score_gpt":0.3308354899447773,"score_spread":0.1896166370630362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169507859","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042122724,0.00010564816,0.99379504,0.00013240195,0.00001999104,0.00006879097,0.00004835016,0.000079274934,0.0015383163],"genre_scores_gemma":[0.46918797,0.0003943331,0.5234788,0.00019802338,0.00008668038,0.0006202828,0.00022383078,0.00021940743,0.005590665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982681,0.0008737963,0.00007423749,0.0002740841,0.0003494257,0.00016031504],"domain_scores_gemma":[0.9948544,0.0040410915,0.00029042098,0.0001250352,0.0005057175,0.00018341672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004667851,0.0017226886,0.0024930965,0.0015478389,0.00083661353,0.0025664393,0.003092866,0.0027470067,0.0058017126],"category_scores_gemma":[0.009227866,0.0024508305,0.0022397768,0.0014426516,0.0014818064,0.002051835,0.0022955113,0.0025376931,0.0004204666],"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.0000213559,0.000019229907,0.00007269011,0.000051276624,0.000024310435,0.000032140124,0.000025293008,0.99064213,0.00021122007,0.0049870717,0.00016648041,0.0037466818],"study_design_scores_gemma":[0.0000042609777,0.000012784086,0.0000135011915,0.000005030767,0.0000067509727,0.0000047362378,0.0000054451407,0.9971372,0.000046591485,0.0026524835,0.000108200526,0.0000030667704],"about_ca_topic_score_codex":0.010153117,"about_ca_topic_score_gemma":0.007297691,"teacher_disagreement_score":0.010153117,"about_ca_system_score_codex":0.0018872774,"about_ca_system_score_gemma":0.002703447,"threshold_uncertainty_score":0.024686217},"labels":[],"label_agreement":null},{"id":"W3201484950","doi":"10.1007/s12351-021-00674-x","title":"Designing pharmaceutical supply chain networks with perishable items considering congestion","year":2021,"lang":"en","type":"article","venue":"Operational Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kwantlen Polytechnic University; University of British Columbia","funders":"","keywords":"Supply chain; Computer science; Metric (unit); Sensitivity (control systems); Computational intelligence; Job shop scheduling; Production (economics); Scheduling (production processes); Operations research; Mathematical optimization; Greenhouse gas; Supply chain management; Supply chain network; Risk analysis (engineering); Operations management; Business; Economics; Microeconomics; Schedule; Engineering; Artificial intelligence; Mathematics; Marketing","score_opus":0.07239243685779077,"score_gpt":0.33582319408030725,"score_spread":0.26343075722251647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201484950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20633388,0.00021585161,0.77650964,0.00040729763,0.00006846049,0.00032123787,0.00010552434,0.00023666702,0.015801487],"genre_scores_gemma":[0.91615725,0.00025652026,0.076986045,0.000048880393,0.000023711522,0.0001739612,0.00007954983,0.000030593794,0.0062434375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994568,0.00017446681,0.00002053146,0.00014795641,0.000089321635,0.00011095646],"domain_scores_gemma":[0.9989918,0.000452323,0.00016141268,0.00006696724,0.00021910128,0.00010837872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077139755,0.00079585315,0.00068105786,0.0008916788,0.0011850281,0.0017188075,0.0012234703,0.0011678982,0.0049592797],"category_scores_gemma":[0.0025750264,0.00067661045,0.0005747623,0.001099167,0.0006276356,0.0025209207,0.0013006948,0.00065835915,0.00046294014],"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.00011634163,0.00012660166,0.0012276787,0.00011457704,0.00002270804,0.00019112251,0.000092251204,0.9566773,0.0069573163,0.010851288,0.00034333844,0.023279425],"study_design_scores_gemma":[0.000013273579,0.00014157579,0.00023556068,0.000016238997,0.00002988792,0.000028487775,0.0001414975,0.9901029,0.0021973103,0.00611278,0.00097089447,0.000009624941],"about_ca_topic_score_codex":0.0039042947,"about_ca_topic_score_gemma":0.0060179853,"teacher_disagreement_score":0.0049592797,"about_ca_system_score_codex":0.001268382,"about_ca_system_score_gemma":0.0013937996,"threshold_uncertainty_score":0.016590476},"labels":[],"label_agreement":null},{"id":"W4224282464","doi":"10.1007/s12351-022-00704-2","title":"Port-based supply chain decisions considering governmental pollution tax","year":2022,"lang":"en","type":"article","venue":"Operational Research","topic":"Energy, Environment, and Transportation Policies","field":"Energy","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"National Natural Science Foundation of China","keywords":"Pollution; Subsidy; Spillover effect; Business; Natural resource economics; Environmental economics; Economics; Environmental science; Microeconomics; Market economy","score_opus":0.056633660930105245,"score_gpt":0.3276580575856032,"score_spread":0.27102439665549793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224282464","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89054215,0.00027569386,0.037553195,0.0037345781,0.0002469518,0.00032669966,0.0011295009,0.0001972051,0.06599405],"genre_scores_gemma":[0.9910856,0.00009569702,0.001795931,0.00004852798,0.000019356887,0.000023253799,0.00010991899,0.000023915929,0.0067978143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985215,0.0005849191,0.000055463563,0.0001888474,0.00014209401,0.00050714024],"domain_scores_gemma":[0.99516785,0.0031783287,0.000382827,0.00016033072,0.0006321087,0.00047863807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037292535,0.0007775894,0.0013612114,0.0015637743,0.0015145541,0.0076354253,0.0012919983,0.0031688125,0.020702794],"category_scores_gemma":[0.008754504,0.0012343627,0.0013175557,0.0020726023,0.0011166715,0.0054144263,0.0013345432,0.0028677613,0.0008780282],"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.001092667,0.00030852464,0.0040782155,0.000054837707,0.00009588305,0.00037600065,0.00009083931,0.9603571,0.0006510472,0.023886306,0.0017985207,0.007210059],"study_design_scores_gemma":[0.000054829703,0.00013662135,0.0016402928,0.00002011066,0.00007195032,0.000020114956,0.00045954564,0.97884184,0.00063468184,0.017274428,0.0008158368,0.000029699017],"about_ca_topic_score_codex":0.030304734,"about_ca_topic_score_gemma":0.036676835,"teacher_disagreement_score":0.030304734,"about_ca_system_score_codex":0.0058576697,"about_ca_system_score_gemma":0.004946047,"threshold_uncertainty_score":0.069257796},"labels":[],"label_agreement":null},{"id":"W4367394417","doi":"10.1007/s12351-023-00774-w","title":"A multi-objective constrained partially observable Markov decision process model for breast cancer screening","year":2023,"lang":"en","type":"article","venue":"Operational Research","topic":"Global Cancer Incidence and Screening","field":"Medicine","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mammography; Breast cancer; Breast cancer screening; Markov decision process; Medicine; Computer science; Actuarial science; Cancer; Markov process; Economics; Statistics; Mathematics","score_opus":0.33942649106872147,"score_gpt":0.5076645604168483,"score_spread":0.1682380693481268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367394417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100079514,0.0026902405,0.8740779,0.00497044,0.0003759127,0.00045176205,0.004104019,0.00059786317,0.012652261],"genre_scores_gemma":[0.94041604,0.0014250681,0.038163543,0.00042720253,0.00017430825,0.00081988826,0.0014372618,0.00008249632,0.017054198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654514,0.0017365662,0.00013520465,0.0006517305,0.000306464,0.00062493974],"domain_scores_gemma":[0.9877857,0.009917396,0.00093790406,0.0001367635,0.00072545453,0.00049680506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004716175,0.0023302054,0.006087511,0.0018781868,0.0009880908,0.0040148916,0.0039022109,0.0056492058,0.010091192],"category_scores_gemma":[0.011744518,0.0022934668,0.0021365404,0.0024066486,0.00245282,0.0022976429,0.0027694413,0.0042212303,0.0009812695],"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.00008287895,0.000045318517,0.00039600636,0.00006546742,0.00004939196,0.00009556536,0.00003326183,0.9885373,0.00010137512,0.008901232,0.00034990645,0.0013422588],"study_design_scores_gemma":[0.000035147605,0.000027252874,0.00014490183,0.000010454335,0.00002118141,0.000009304923,0.000014176099,0.9963282,0.000033376564,0.0032102368,0.00015285854,0.000012949899],"about_ca_topic_score_codex":0.051303755,"about_ca_topic_score_gemma":0.026934186,"teacher_disagreement_score":0.051303755,"about_ca_system_score_codex":0.0040554316,"about_ca_system_score_gemma":0.00460569,"threshold_uncertainty_score":0.10201025},"labels":[],"label_agreement":null},{"id":"W4404373439","doi":"10.1007/s12351-024-00868-z","title":"Multi-venue location optimization with overlapping audience reach areas","year":2024,"lang":"en","type":"article","venue":"Operational Research","topic":"Facility Location and Emergency Management","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":true,"ca_institutions":"Department of National Defence","funders":"","keywords":"Computational intelligence; Computer science; Artificial intelligence","score_opus":0.09804418290431499,"score_gpt":0.34537199596031526,"score_spread":0.24732781305600027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404373439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21769875,0.002341674,0.744365,0.0013777916,0.00023794064,0.0005430176,0.0014531169,0.0006418825,0.031340733],"genre_scores_gemma":[0.9085396,0.00053029344,0.07657225,0.00019334782,0.000050250354,0.00036533776,0.0006136128,0.00012571452,0.0130096655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988387,0.00050448836,0.000030955292,0.00021296222,0.000099369274,0.00031343658],"domain_scores_gemma":[0.99814606,0.0011799692,0.00017765455,0.000053961907,0.0002264479,0.0002159386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001494547,0.0016775883,0.002013191,0.0010675234,0.0007730773,0.0021278479,0.0019408616,0.0022308442,0.0077548367],"category_scores_gemma":[0.0037262414,0.0009246648,0.0014554184,0.0015268167,0.0008687766,0.0011756608,0.0015743086,0.0014125825,0.00064263097],"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.000055261997,0.000047497328,0.00049476576,0.000047932073,0.000022904445,0.00007612698,0.000017830618,0.99260485,0.00018365656,0.0017894561,0.00064550916,0.00401414],"study_design_scores_gemma":[0.000013423047,0.00005675516,0.00028195896,0.0000092787395,0.0000114841,0.000015065679,0.000058751197,0.9976158,0.000076028686,0.001383594,0.00047033918,0.000007520827],"about_ca_topic_score_codex":0.034802154,"about_ca_topic_score_gemma":0.029395627,"teacher_disagreement_score":0.034802154,"about_ca_system_score_codex":0.0027312292,"about_ca_system_score_gemma":0.0020806002,"threshold_uncertainty_score":0.069199145},"labels":[],"label_agreement":null},{"id":"W4405213157","doi":"10.1007/s12351-024-00873-2","title":"Pareto-optimal peer evaluation in context-dependent DEA","year":2024,"lang":"en","type":"article","venue":"Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; McGill University","funders":"","keywords":"Attractiveness; Context (archaeology); Data envelopment analysis; Computer science; Computational intelligence; Pareto principle; Dominance (genetics); Machine learning; Mathematical optimization; Mathematics; Psychology","score_opus":0.3683363571449461,"score_gpt":0.5589452745761226,"score_spread":0.19060891743117653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405213157","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048327103,0.0006428594,0.94202834,0.00022746666,0.000038633112,0.00025235573,0.00005458773,0.00008224598,0.008346382],"genre_scores_gemma":[0.8398126,0.00044371982,0.15558639,0.00007052142,0.000052073872,0.00045320013,0.00010437948,0.00007506122,0.003402183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98525214,0.010302061,0.00049369497,0.0008444382,0.0022535485,0.00085417955],"domain_scores_gemma":[0.9782733,0.017318252,0.0007162627,0.0010006345,0.0023402972,0.00035132156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016832575,0.0012763537,0.0037927725,0.0025118075,0.0013812871,0.0034290075,0.0024096097,0.0019197938,0.0032246858],"category_scores_gemma":[0.041721974,0.00082628004,0.0013477093,0.0020693275,0.0019070604,0.0038958848,0.00334428,0.0015779509,0.00033532263],"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.00015606901,0.00017393414,0.00075425435,0.0002101637,0.00014504578,0.00009678539,0.00015504673,0.8553991,0.0005889354,0.101864554,0.0005240483,0.03993207],"study_design_scores_gemma":[0.000015570158,0.00005612182,0.00022235147,0.000026526457,0.000025886162,0.000021122492,0.00006209187,0.96537536,0.0005043626,0.033230413,0.0004488739,0.000011372876],"about_ca_topic_score_codex":0.0029853797,"about_ca_topic_score_gemma":0.002575145,"teacher_disagreement_score":0.016832575,"about_ca_system_score_codex":0.0028998498,"about_ca_system_score_gemma":0.0035163206,"threshold_uncertainty_score":0.08902025},"labels":[],"label_agreement":null},{"id":"W4405807159","doi":"10.1007/s12351-024-00883-0","title":"Product collection structures in closed-loop supply chains","year":2024,"lang":"en","type":"article","venue":"Operational Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Dalhousie University","funders":"","keywords":"Channel (broadcasting); Product (mathematics); Dual (grammatical number); Task (project management); Supply chain; Business; Computer science; Industrial organization; Operations research; Marketing; Telecommunications; Mathematics; Economics","score_opus":0.04613425917603377,"score_gpt":0.33962338124471936,"score_spread":0.2934891220686856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405807159","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63420653,0.00051809684,0.34066293,0.0006942849,0.000035052406,0.00020097072,0.0003690394,0.00029499948,0.023018127],"genre_scores_gemma":[0.96003795,0.00024027226,0.031795047,0.000028215853,0.000018411905,0.00008118957,0.00020810532,0.000042264248,0.0075484742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809295,0.0005800683,0.0001658828,0.00036273032,0.00049370906,0.00030472918],"domain_scores_gemma":[0.9773538,0.014219645,0.0027251046,0.0018037652,0.002907585,0.0009900429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022719696,0.00029918534,0.0007676526,0.0023712667,0.0023600592,0.006139535,0.0019219979,0.0015845818,0.010691866],"category_scores_gemma":[0.019295823,0.00089275086,0.0008089272,0.0039678277,0.004004711,0.010123294,0.002041209,0.0011683996,0.00094925915],"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.00051238184,0.00033303868,0.007473752,0.00017642899,0.00004542013,0.00031058432,0.0016607285,0.16821107,0.0031999655,0.75494504,0.0012074591,0.061924115],"study_design_scores_gemma":[0.000051020605,0.00018132919,0.002608148,0.00006714526,0.000027556829,0.00012675114,0.00067415775,0.32907882,0.0020038532,0.66257143,0.0025622647,0.00004757381],"about_ca_topic_score_codex":0.0064129937,"about_ca_topic_score_gemma":0.005075058,"teacher_disagreement_score":0.010691866,"about_ca_system_score_codex":0.0030850512,"about_ca_system_score_gemma":0.0024499448,"threshold_uncertainty_score":0.035767794},"labels":[],"label_agreement":null},{"id":"W4410930226","doi":"10.1007/s12351-025-00940-2","title":"An accelerated Benders decomposition algorithm for integrated seaside operations planning with berthing preemption","year":2025,"lang":"en","type":"article","venue":"Operational Research","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Preemption; Benders' decomposition; Computational intelligence; Decomposition; Computer science; Mathematical optimization; Operations research; Decomposition method (queueing theory); Operation planning; Algorithm; Artificial intelligence; Mathematics; Statistics; Operating system; Chemistry","score_opus":0.07833009290925859,"score_gpt":0.410827688518579,"score_spread":0.3324975956093204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410930226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013457758,0.0001323099,0.98194504,0.00008312813,0.000076708995,0.0000761254,0.00011008257,0.00070989877,0.0034090679],"genre_scores_gemma":[0.12541339,0.000111764726,0.8692998,0.000076209944,0.0000491472,0.00018434692,0.00038223952,0.0003037081,0.0041792532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994217,0.00014939671,0.000029955063,0.000105017825,0.00018972364,0.00010432079],"domain_scores_gemma":[0.999345,0.00028592785,0.00005634749,0.000075804455,0.0001713295,0.00006557777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010286415,0.0013446797,0.0013177978,0.000770222,0.00057443185,0.001051678,0.0014160285,0.0009998607,0.007122629],"category_scores_gemma":[0.0020940357,0.00095162896,0.0011470136,0.000937199,0.00038447912,0.001179711,0.0013041743,0.0019542389,0.001332906],"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.0003049353,0.00015223112,0.0003475889,0.00008103583,0.000060160786,0.000053005802,0.000054161566,0.8232218,0.003512394,0.007530365,0.0038576375,0.16082457],"study_design_scores_gemma":[0.000024747427,0.00002943219,0.000046700334,0.000004084266,0.000006284921,0.00000725866,0.000005973573,0.9972179,0.0003433706,0.001755366,0.0005552129,0.0000036410631],"about_ca_topic_score_codex":0.009606848,"about_ca_topic_score_gemma":0.012956523,"teacher_disagreement_score":0.009606848,"about_ca_system_score_codex":0.0007676855,"about_ca_system_score_gemma":0.0023711605,"threshold_uncertainty_score":0.023827612},"labels":[],"label_agreement":null},{"id":"W4411458621","doi":"10.1007/s12351-025-00946-w","title":"Assessing the challenges of digital transformation implementation in sustainable financial services using hybrid multi-criteria group decision-making framework","year":2025,"lang":"en","type":"article","venue":"Operational Research","topic":"Business and Economic Development","field":"Environmental Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Computational intelligence; Group decision-making; Digital transformation; Group (periodic table); Computer science; Financial services; Transformation (genetics); Process management; Business intelligence; Knowledge management; Business; Management science; Artificial intelligence; Finance; Economics; Psychology","score_opus":0.05555135738016045,"score_gpt":0.4187296603122404,"score_spread":0.36317830293208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411458621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7084257,0.0005624663,0.2675044,0.0029892537,0.000114100825,0.0010898168,0.00019662036,0.00008126168,0.019036384],"genre_scores_gemma":[0.96257263,0.00011599054,0.036430094,0.00006790354,0.000016088778,0.00019189173,0.000051399213,0.000008328539,0.00054570485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9854683,0.010382223,0.0003754609,0.0006096936,0.0015751491,0.0015891853],"domain_scores_gemma":[0.9819195,0.014596801,0.00094228797,0.00028004494,0.0012955831,0.0009658607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0194547,0.0012214308,0.0016238326,0.0028812096,0.00197353,0.008645726,0.0018624656,0.003490952,0.002977179],"category_scores_gemma":[0.022164583,0.0006618832,0.0017328579,0.0022841273,0.002365694,0.0041442635,0.004024391,0.002317687,0.00014163631],"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.00033884138,0.0005661538,0.00566061,0.00031480915,0.00031942377,0.00029115003,0.00065538374,0.9252911,0.0011220397,0.037688844,0.0006142937,0.027137378],"study_design_scores_gemma":[0.000045359422,0.00031507728,0.0011946122,0.00008984053,0.00007774368,0.000025226058,0.0019203817,0.9704339,0.00058865146,0.024614464,0.00064771605,0.000047025664],"about_ca_topic_score_codex":0.012503162,"about_ca_topic_score_gemma":0.013690599,"teacher_disagreement_score":0.0194547,"about_ca_system_score_codex":0.006905555,"about_ca_system_score_gemma":0.008993699,"threshold_uncertainty_score":0.10288751},"labels":[],"label_agreement":null},{"id":"W4417114302","doi":"10.1007/s12351-025-00988-0","title":"A multi-stage stochastic programming approach for overhaul and supply chain planning of modular physical assets: case study","year":2025,"lang":"en","type":"article","venue":"Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spare part; Modular design; Interdependence; Asset (computer security); Supply chain; Investment (military); Reduction (mathematics); Stochastic programming; Sample (material)","score_opus":0.14761244866642817,"score_gpt":0.41009672133500863,"score_spread":0.26248427266858043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417114302","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25983062,0.00044624324,0.72758704,0.00048377758,0.00006495982,0.0003933305,0.0003371519,0.00025296706,0.010603924],"genre_scores_gemma":[0.9049805,0.00024589524,0.089301154,0.000038030754,0.000025777748,0.00022487043,0.00012119008,0.000044606135,0.005017947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992107,0.00037564515,0.000029975658,0.00011579808,0.0001121888,0.00015557122],"domain_scores_gemma":[0.9977793,0.001748186,0.00011517524,0.000051472136,0.00015217636,0.00015382502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019644997,0.0011249095,0.0013022169,0.0009793087,0.0009208811,0.0017658427,0.0015998908,0.0020816855,0.0042207255],"category_scores_gemma":[0.0024041163,0.0010829949,0.0014258281,0.0015703383,0.00084695336,0.0012004119,0.0010484009,0.0015368982,0.00017846026],"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.000027575072,0.000040301424,0.00018383599,0.00001867277,0.000009740284,0.00008111816,0.000020296895,0.9930583,0.0002859976,0.0028836732,0.00009323083,0.0032972319],"study_design_scores_gemma":[0.000008342029,0.00004029799,0.00007815076,0.0000026173095,0.000005765254,0.000009750719,0.000010284561,0.99859184,0.0001093943,0.0010444656,0.00009427662,0.000004935607],"about_ca_topic_score_codex":0.025293907,"about_ca_topic_score_gemma":0.02424923,"teacher_disagreement_score":0.025293907,"about_ca_system_score_codex":0.0023053323,"about_ca_system_score_gemma":0.002699751,"threshold_uncertainty_score":0.050293386},"labels":[],"label_agreement":null}]}