{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":25,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":25,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"9598dfac4f04","filters":{"venue":"Operational Research"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05427543962770417,"gpt":0.3647605437736715,"spread":0.3104851041459673,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002058914,0.000204108,0.0001908328,0.0004471616,0.0006515151,0.001555629,0.001643525,0.0001075526,0.002040472],"category_scores_gemma":[0.0007893534,0.0001273474,0.00003420062,0.001346315,0.0002047843,0.002616789,0.0004968002,0.0003265322,0.0003740407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002337431,"about_ca_system_score_gemma":0.002532411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001924647,"about_ca_topic_score_gemma":0.00002992476,"domain_scores_codex":[0.9949691,0.0005916848,0.0003484118,0.0009370201,0.002376771,0.0007770035],"domain_scores_gemma":[0.9952164,0.0005048003,0.00004276118,0.001038683,0.002546715,0.0006506484],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001902934,0.001422689,0.002938925,0.00006333987,0.0002747599,0.0002470026,0.001880705,0.1754087,0.06338347,0.4037506,0.04381086,0.3049161],"study_design_scores_gemma":[0.002172478,0.0008660108,0.0006433123,0.00003176892,0.000002014564,0.0000350733,0.00001925134,0.984464,0.005284364,0.0007093667,0.00546055,0.0003117491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001579365,0.00003345874,0.9853568,0.01006421,0.00008636494,0.0006409304,0.00001644404,0.00009810857,0.002124302],"genre_scores_gemma":[0.06589469,0.00005408517,0.9022592,0.0003263495,0.0003740815,0.0001782643,0.00003140737,0.0000475353,0.0308344],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8090554,"threshold_uncertainty_score":0.9994808,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04780893546009533,"gpt":0.3145037920728564,"spread":0.2666948566127611,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00317878,0.0002229704,0.0002052468,0.0009640433,0.003313282,0.0017436,0.0002814546,0.0001075475,0.001185608],"category_scores_gemma":[0.001408871,0.0002333998,0.00006319185,0.003850865,0.0001982534,0.001900694,0.0007002103,0.0003978745,0.0004415037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009994337,"about_ca_system_score_gemma":0.0008688352,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01129482,"about_ca_topic_score_gemma":0.003341633,"domain_scores_codex":[0.9967049,0.0001155903,0.0003536945,0.0006232054,0.001030057,0.001172563],"domain_scores_gemma":[0.9960102,0.0002264323,0.00009929031,0.0002738303,0.003340188,0.00005002592],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005718687,0.0002557262,0.01044532,0.000432048,0.0001804766,0.0001019446,0.001336065,0.02412596,0.0007712787,0.2022147,0.7581414,0.001423199],"study_design_scores_gemma":[0.003736572,0.0002825273,0.004538826,0.0002172783,0.00005037933,0.00001405132,0.03120404,0.4686284,0.0007212309,0.04222918,0.4475207,0.0008568253],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1665151,0.0006682314,0.1445163,0.03039084,0.002592434,0.01791548,0.00000337761,0.00124066,0.6361576],"genre_scores_gemma":[0.8114776,0.00001490924,0.01027344,0.0009397121,0.007642963,0.0005648953,0.00003975945,0.00008296795,0.1689637],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6449625,"threshold_uncertainty_score":0.9997274,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1412188528817411,"gpt":0.3308354899447773,"spread":0.1896166370630362,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003294751,0.0001175118,0.0001488136,0.000209239,0.0004872599,0.001078302,0.0001294502,0.00008345231,0.000331749],"category_scores_gemma":[0.002010788,0.0001141773,0.00004176746,0.0008103587,0.00007356649,0.001023412,0.0000913698,0.0003136771,0.00002939102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002997137,"about_ca_system_score_gemma":0.0002289326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001245591,"about_ca_topic_score_gemma":0.0003290841,"domain_scores_codex":[0.9981393,0.000147696,0.0003058207,0.0004307517,0.0005710209,0.0004054073],"domain_scores_gemma":[0.997988,0.0008820175,0.00005104029,0.0001549863,0.0009005868,0.00002341332],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007703569,0.002612217,0.02610011,0.0008118525,0.0001578526,0.0001513057,0.0005463454,0.3466696,0.002936675,0.5901148,0.00646187,0.02266708],"study_design_scores_gemma":[0.008012995,0.0001424504,0.01413704,0.0004125722,0.0001408037,0.00006512291,0.003312207,0.8928022,0.000598988,0.0124917,0.06700255,0.0008813964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2323649,0.002738827,0.6546198,0.04519185,0.001141042,0.01154097,0.00003437288,0.0003968603,0.05197144],"genre_scores_gemma":[0.8977437,0.00003138818,0.09810826,0.0008015591,0.0009420239,0.0007129235,0.0003414268,0.00003351957,0.001285198],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6653788,"threshold_uncertainty_score":0.9999587,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07239243685779077,"gpt":0.3358231940803073,"spread":0.2634307572225165,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002273049,0.0001682131,0.0001673962,0.0003125666,0.0008255807,0.001616896,0.0002058407,0.00007122054,0.002865758],"category_scores_gemma":[0.0007253691,0.0001596418,0.00003565037,0.001120576,0.0001612578,0.001089387,0.0003860843,0.0004927374,0.0002025825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000181741,"about_ca_system_score_gemma":0.0002682905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000232873,"about_ca_topic_score_gemma":0.000101377,"domain_scores_codex":[0.9973392,0.0001208248,0.0002331876,0.000494074,0.001059453,0.0007532174],"domain_scores_gemma":[0.9977428,0.0003703138,0.00003834464,0.0002442865,0.001561838,0.00004243412],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005375598,0.0004809969,0.06925642,0.000788417,0.0002834289,0.002626978,0.0002308716,0.4775096,0.008720931,0.3384288,0.08795294,0.0131831],"study_design_scores_gemma":[0.001890371,0.00004523697,0.005934482,0.0002237588,0.00003933457,0.00004095133,0.006748017,0.6239418,0.001627105,0.001037152,0.3579173,0.0005544786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3799799,0.005189169,0.1855802,0.1155598,0.00170962,0.006596428,0.0000148847,0.0009740534,0.3043959],"genre_scores_gemma":[0.9861348,0.0000375042,0.00289045,0.002289938,0.001398219,0.0002211305,0.0001731559,0.00004749429,0.00680735],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6061549,"threshold_uncertainty_score":0.9994195,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.2686170978067754,"gpt":0.3633974369433609,"spread":0.09478033913658551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003416754,0.00009784315,0.0001169199,0.0001200335,0.0002589115,0.0003434916,0.0001832543,0.00006760532,0.00004024554],"category_scores_gemma":[0.001511913,0.00006693561,0.0000244191,0.0007680404,0.0003462655,0.0002126855,0.0001168085,0.0003341793,0.00002841778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008065392,"about_ca_system_score_gemma":0.0001154817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001809445,"about_ca_topic_score_gemma":0.00001886922,"domain_scores_codex":[0.9984782,0.0001375609,0.0001994035,0.0002209247,0.0006513586,0.0003125313],"domain_scores_gemma":[0.9989021,0.0003450934,0.00001081931,0.0002293308,0.0003058003,0.0002067983],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001368783,0.001214161,0.01378939,0.001025465,0.0002148487,0.00001455838,0.007549684,0.04571718,0.0003301946,0.2767351,0.01211685,0.6411557],"study_design_scores_gemma":[0.001446712,0.0002897645,0.005977475,0.00004582423,0.00001802523,0.00003670734,0.003688953,0.9290966,0.0008944147,0.03944449,0.01853028,0.0005306927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.732706,0.003297919,0.09963838,0.01080856,0.000459739,0.005041897,0.00005019462,0.0008665842,0.1471308],"genre_scores_gemma":[0.9850414,0.00001629095,0.01432233,0.00002085544,0.00009683235,0.0001196136,0.00002385318,0.00001292228,0.0003459016],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8833795,"threshold_uncertainty_score":0.3312297,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1042244855366978,"gpt":0.3337456015531914,"spread":0.2295211160164936,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001640333,0.0001190106,0.0001502321,0.0003717884,0.0005789018,0.0002251516,0.000293512,0.00005455405,0.0005621336],"category_scores_gemma":[0.0006874711,0.00009468153,0.00008853732,0.0006791734,0.000177392,0.0008294376,0.0001092801,0.000191004,0.0003221632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008369232,"about_ca_system_score_gemma":0.0001017062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000157894,"about_ca_topic_score_gemma":0.0001041706,"domain_scores_codex":[0.9984323,0.00002972242,0.0001857727,0.0003112782,0.0006730056,0.0003679394],"domain_scores_gemma":[0.9982895,0.0001838143,0.00005561442,0.000231967,0.00121601,0.00002311959],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.004517902,0.0005306626,0.005561199,0.0002344325,0.0005979169,0.00003067643,0.0006216248,0.02033396,0.002921249,0.9427952,0.01763625,0.004218967],"study_design_scores_gemma":[0.01209776,0.001386918,0.003056586,0.000448966,0.000752852,0.0000148786,0.009201308,0.4953322,0.008011295,0.06746645,0.3995803,0.00265051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7029187,0.0001034838,0.01122746,0.003540611,0.0005933368,0.002603989,0.00002817352,0.0002056894,0.2787785],"genre_scores_gemma":[0.9910093,0.000004577336,0.002797143,0.0003420879,0.001068986,0.0001158562,0.00007032596,0.00003241595,0.004559306],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8753287,"threshold_uncertainty_score":0.6154969,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07509801975831788,"gpt":0.3635543060252351,"spread":0.2884562862669172,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001371247,0.00007521311,0.00007867855,0.0001108584,0.0008605937,0.0005134596,0.0003601618,0.00003180787,0.0005805634],"category_scores_gemma":[0.0003635396,0.00004905253,0.0000401695,0.001092369,0.00018968,0.0007236674,0.0002643878,0.0002444868,0.0005093391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002998061,"about_ca_system_score_gemma":0.00008334711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001134707,"about_ca_topic_score_gemma":0.0000975198,"domain_scores_codex":[0.9984366,0.00003798286,0.0002267455,0.0002318292,0.000831373,0.0002354438],"domain_scores_gemma":[0.9987659,0.0001482725,0.00007077621,0.0001897004,0.0008105073,0.00001485268],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005945041,0.0001092842,0.1171933,0.00017544,0.00004686627,0.000001944547,0.0002803043,0.3872605,0.0006019677,0.4639114,0.02870832,0.001651083],"study_design_scores_gemma":[0.0009243868,0.0000686663,0.2491791,0.0001049152,0.00005126315,8.317677e-7,0.005695681,0.4464658,0.0004729453,0.02771054,0.2689878,0.0003380476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8295866,0.0004421634,0.01257961,0.07714149,0.0002083035,0.001942614,0.00001264328,0.00009840462,0.07798816],"genre_scores_gemma":[0.9967432,0.00006993001,0.000211047,0.001140986,0.0006404324,0.00008133237,0.0000353533,0.00001170474,0.001066018],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4362009,"threshold_uncertainty_score":0.6619079,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08130707853938561,"gpt":0.3519637063581594,"spread":0.2706566278187738,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001163021,0.0000843901,0.00006444378,0.00005807488,0.0005851769,0.0001591259,0.0005136641,0.00004148072,0.00007289887],"category_scores_gemma":[0.0003477107,0.00004108577,0.00003584742,0.0006770201,0.0001839798,0.0001089293,0.0001976361,0.0002725579,0.0000305079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000799263,"about_ca_system_score_gemma":0.00008619345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008269531,"about_ca_topic_score_gemma":0.001518277,"domain_scores_codex":[0.9987854,0.00009017914,0.0002048514,0.0001257917,0.0005338771,0.0002598448],"domain_scores_gemma":[0.9990014,0.0001222519,0.00001618048,0.0003458996,0.0004680245,0.00004628001],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001044394,0.000008322587,0.0002974721,0.000006027241,0.00001592102,8.958941e-8,0.0003017289,0.9402363,0.001889074,0.0487154,0.006107087,0.002412098],"study_design_scores_gemma":[0.00009130667,0.00001836366,0.006241934,0.00003394645,0.000002692368,5.855919e-7,0.000223003,0.9829904,0.001834637,0.0002357443,0.008276721,0.00005062199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6080515,0.0001398187,0.3421646,0.009179921,0.000543691,0.002770325,0.00002485446,0.00009748627,0.0370278],"genre_scores_gemma":[0.996224,0.00001232814,0.001093167,0.0002308067,0.0001545544,0.0001228127,0.00001418027,0.00001869718,0.002129404],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3881725,"threshold_uncertainty_score":0.4500767,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05105892803399259,"gpt":0.3152119319201446,"spread":0.264153003886152,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003087092,0.00005429363,0.00009340493,0.00008428989,0.00004841224,0.00002199666,0.00003723442,0.00002951033,0.00006106524],"category_scores_gemma":[0.00008656527,0.00004359979,0.0000163636,0.00007502271,0.00002768887,0.0001727434,0.0000110625,0.00007103988,0.000004310898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002949083,"about_ca_system_score_gemma":0.0000400244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001427432,"about_ca_topic_score_gemma":0.000002594738,"domain_scores_codex":[0.9993433,0.00001570454,0.0001555662,0.00009334478,0.0002794643,0.0001125925],"domain_scores_gemma":[0.999693,0.00007100203,0.00002061633,0.00008196831,0.0001026164,0.00003075036],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003869467,0.00003656132,0.0002987468,0.0001669736,0.00001653376,1.08538e-7,0.0003616312,0.8916233,0.1046213,0.002353839,0.0001432676,0.0003390639],"study_design_scores_gemma":[0.0002452263,0.00007710449,0.00008706977,0.00006687114,0.000003027503,0.000002265204,0.00007403175,0.9584705,0.04066987,0.0002234418,0.00003306983,0.00004751295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8897254,0.0001382042,0.1075891,0.0002579453,0.00003861532,0.0009616283,0.00001943061,0.00002600396,0.00124365],"genre_scores_gemma":[0.9639847,0.00001180143,0.03555956,0.000003569746,0.00001897114,0.00003477243,0.00002937144,0.00001376652,0.0003434472],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07425934,"threshold_uncertainty_score":0.1777948,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07102026708183304,"gpt":0.3806921119306955,"spread":0.3096718448488625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001286805,0.00008634855,0.00009838233,0.0001176866,0.0004768291,0.0002950713,0.00004930454,0.00005256491,0.00003512701],"category_scores_gemma":[0.000287246,0.00008272113,0.00002079757,0.0002753063,0.00003453003,0.0002237764,0.00002726408,0.0002415027,0.000004514585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008726267,"about_ca_system_score_gemma":0.0002102561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001034905,"about_ca_topic_score_gemma":0.00001759803,"domain_scores_codex":[0.9989786,0.0001080423,0.0001557072,0.0002399199,0.0002759787,0.0002417707],"domain_scores_gemma":[0.9987688,0.0001771538,0.000005701484,0.0001067407,0.0008640069,0.00007759265],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001790872,0.000009475981,0.00001604999,0.00004116049,0.00002250194,0.000001209649,0.00009699119,0.9781462,0.004843173,0.00121067,0.00003482754,0.01555985],"study_design_scores_gemma":[0.0003434318,0.00003536638,0.000006089957,0.00004316034,0.000005477122,0.00002794517,0.000122708,0.990604,0.007954032,0.0004820874,0.0002710592,0.0001045835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01869653,0.0005797399,0.9792092,0.0005132969,0.00008426298,0.000229976,0.000006573626,0.00007979855,0.0006005552],"genre_scores_gemma":[0.07147121,0.0001190453,0.9274862,0.00001888631,0.0001714492,0.0001387136,0.00009619386,0.00002887352,0.0004693678],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05277468,"threshold_uncertainty_score":0.3667432,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1634104227768261,"gpt":0.375260113949023,"spread":0.2118496911721969,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009297392,0.00009701027,0.00008075629,0.00004045738,0.000724704,0.000317758,0.0004402391,0.00003429574,0.002479729],"category_scores_gemma":[0.0005768948,0.00006643606,0.00003714933,0.0005744341,0.0002820071,0.0003754994,0.0004333162,0.0003638931,0.001748629],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001204954,"about_ca_system_score_gemma":0.00008520652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001008565,"about_ca_topic_score_gemma":0.0001751092,"domain_scores_codex":[0.998271,0.0001386725,0.0001624188,0.0002669684,0.0008134219,0.0003474847],"domain_scores_gemma":[0.999501,0.0001411946,0.00001995857,0.0001596438,0.00004880832,0.0001293374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001429074,0.00002103285,0.003263189,0.000005724069,0.00001308072,0.000005121399,0.0004329198,0.9731028,0.004643457,0.008844089,0.008939683,0.0007145897],"study_design_scores_gemma":[0.0001047161,0.00002517151,0.001118579,0.000006158862,0.000005242642,0.000001093939,0.00005541764,0.9895039,0.00009395379,0.0005691902,0.008435801,0.00008074582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8858369,0.0001023033,0.04568509,0.02174279,0.00009039421,0.0009344303,0.00002692615,0.00006744811,0.0455137],"genre_scores_gemma":[0.9773508,0.00001309667,0.01684214,0.0009101661,0.0001797139,0.00002598786,0.00002716687,0.00001742594,0.004633499],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09151389,"threshold_uncertainty_score":0.9990286,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05663366093010525,"gpt":0.3276580575856032,"spread":0.2710243966554979,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008567663,0.0001085625,0.000103913,0.0001846554,0.001320811,0.00006751645,0.0001940804,0.00003807363,0.01151736],"category_scores_gemma":[0.0001546578,0.000115926,0.00006535563,0.0003139376,0.0001554624,0.0001348979,0.00008194478,0.0003259627,0.0001259111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006846789,"about_ca_system_score_gemma":0.0002780031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00379966,"about_ca_topic_score_gemma":0.002023415,"domain_scores_codex":[0.9970189,0.000265487,0.000263855,0.0002978247,0.001792543,0.0003614455],"domain_scores_gemma":[0.9992392,0.000312817,0.00003466295,0.0002308344,0.00005599306,0.000126478],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009473837,0.0002642512,0.003833634,0.000003665624,0.00003200988,0.00004596623,0.0003048145,0.4070908,0.02552989,0.5519108,0.01004247,0.0008470101],"study_design_scores_gemma":[0.002476901,0.0003944233,0.1169718,0.00002353542,0.00001500889,0.00003019985,0.003896717,0.02071455,0.02432406,0.004688922,0.8259437,0.0005201391],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9358258,0.0002082276,0.0009678575,0.009719432,0.000230595,0.0003681793,0.000786728,0.00006411513,0.0518291],"genre_scores_gemma":[0.9878923,0.00003713241,0.0007701998,0.0009144736,0.00009576926,0.0002981275,0.0006512253,0.0000260924,0.009314696],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8159013,"threshold_uncertainty_score":0.9999793,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.8489374756264574,"gpt":0.5710113278039322,"spread":0.2779261478225252,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006003712,0.0000950774,0.000291645,0.0002838068,0.000371587,0.000453225,0.0006683924,0.00006021065,0.001619421],"category_scores_gemma":[0.026819,0.0000752743,0.00004614946,0.0007954763,0.0002684044,0.0004417215,0.0006058077,0.0003420979,0.000387797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004421965,"about_ca_system_score_gemma":0.0002220112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003776486,"about_ca_topic_score_gemma":0.00002306417,"domain_scores_codex":[0.993776,0.001028831,0.0009228758,0.0004845697,0.003573606,0.0002141375],"domain_scores_gemma":[0.9934806,0.003774189,0.0001261868,0.000354499,0.002064708,0.000199797],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001201889,0.0006966104,0.4784028,0.0000965327,0.0001501297,0.00002448133,0.02046247,0.003286238,0.09093151,0.1486265,0.1232419,0.1328789],"study_design_scores_gemma":[0.002416941,0.0005721528,0.2520173,0.0003158734,0.00001246683,0.00001090657,0.005670208,0.6776274,0.008600831,0.02127013,0.03107503,0.0004107385],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9563227,0.0005609107,0.01637113,0.01152836,0.0001407804,0.0006501063,0.00005496559,0.00002222023,0.01434884],"genre_scores_gemma":[0.9884918,0.000008653873,0.01058321,0.0002359646,0.00004274378,0.00001858694,0.000006982477,0.000007778022,0.0006042923],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6743412,"threshold_uncertainty_score":0.9992932,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.05567758386509606,"gpt":0.3266598947096463,"spread":0.2709823108445503,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003210289,0.00009119326,0.0001968282,0.0001076628,0.00007745068,0.00002323193,0.0002864155,0.00005918288,0.00004998279],"category_scores_gemma":[0.000760338,0.00006385382,0.00002243216,0.000129085,0.0003214661,0.0002648837,0.00007613963,0.0001676397,0.000007241421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006084579,"about_ca_system_score_gemma":0.0001685811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001903553,"about_ca_topic_score_gemma":0.00001672421,"domain_scores_codex":[0.9987428,0.0002410852,0.0003430273,0.0002065561,0.0002730272,0.0001935036],"domain_scores_gemma":[0.9982005,0.000862446,0.00004972667,0.0004514931,0.0003977485,0.00003812539],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001250391,0.0001035778,0.0006264799,0.0002939454,0.0001221663,2.804007e-7,0.0005587863,0.6907216,0.2795383,0.02281163,0.003238062,0.0007348264],"study_design_scores_gemma":[0.0006113472,0.0003771287,0.0019212,0.00007850079,0.000005514831,2.872106e-7,0.00002925726,0.9382015,0.05849274,0.0002000708,0.00002591053,0.00005657349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8487327,0.00003560875,0.1484974,0.0001758699,0.00005697883,0.0009430334,0.0001710861,0.000009989545,0.001377311],"genre_scores_gemma":[0.9979112,0.0001599435,0.001642399,0.00001530272,0.00003114486,0.00004827801,0.00002377977,0.00001213101,0.0001558709],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2474799,"threshold_uncertainty_score":0.2603883,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04197141462096572,"gpt":0.3057857261124268,"spread":0.2638143114914611,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003508766,0.0001020107,0.000111474,0.00008228706,0.0006672476,0.0002634145,0.000538996,0.00007520259,0.000164696],"category_scores_gemma":[0.000125085,0.00006888802,0.00002500808,0.000402883,0.0001362393,0.000252074,0.000428278,0.0003837752,0.0003477392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003920027,"about_ca_system_score_gemma":0.00005914745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004559338,"about_ca_topic_score_gemma":0.002023097,"domain_scores_codex":[0.9974856,0.0003360813,0.0002217995,0.0003503973,0.0009650794,0.0006410027],"domain_scores_gemma":[0.9992181,0.0002319766,0.0000268728,0.0003718481,0.00005477124,0.00009644082],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002058269,0.00006626625,0.00339267,0.00003818831,0.000003307896,0.00001437196,0.0002220621,0.8043128,0.004386496,0.1865278,0.0008717457,0.0001436798],"study_design_scores_gemma":[0.0001677767,0.00005263552,0.01904651,0.00003168279,0.000001234341,0.00000338919,0.001321777,0.9758883,0.00003400889,0.002797061,0.0005399057,0.0001157007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9737068,0.0000266326,0.001641883,0.003007631,0.00006981281,0.0006218555,0.000007315878,0.00001131899,0.02090676],"genre_scores_gemma":[0.9962734,0.00001540036,0.00009106276,0.0001124639,0.00004445566,0.0001435219,0.00001117181,0.00001330306,0.003295244],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1837307,"threshold_uncertainty_score":0.6892386,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0585801835029579,"gpt":0.3457159590766556,"spread":0.2871357755736977,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004926324,0.0001612031,0.0002416305,0.0007981724,0.0007920089,0.0007451791,0.0004027553,0.00007567829,0.00009691212],"category_scores_gemma":[0.007817489,0.0001036873,0.0001104065,0.003907361,0.0001819753,0.001419277,0.0001697512,0.000230464,0.000123327],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002094162,"about_ca_system_score_gemma":0.0002880553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003498261,"about_ca_topic_score_gemma":0.0003432807,"domain_scores_codex":[0.9976102,0.0001826384,0.0002976971,0.0004229389,0.001055067,0.0004314446],"domain_scores_gemma":[0.9958587,0.001142841,0.0001519681,0.0003602533,0.002448886,0.00003740457],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004709698,0.00006563832,0.0001411385,0.000007615856,0.0004018017,0.000001605744,0.0000991382,0.9104776,0.00003641813,0.08229219,0.005924075,0.00008180612],"study_design_scores_gemma":[0.001083027,0.00004924752,0.0001769729,0.00002228094,0.0002416914,1.652442e-7,0.000195049,0.9756548,0.00002173554,0.01466755,0.00769773,0.000189721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09340426,0.000408478,0.4903189,0.3294554,0.0001991821,0.009683719,0.0008348804,0.0008775183,0.07481768],"genre_scores_gemma":[0.9680565,0.000006170565,0.003637561,0.001412874,0.001872236,0.0005353266,0.003193921,0.00005966765,0.02122575],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8746522,"threshold_uncertainty_score":0.9358829,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.2157148105459932,"gpt":0.5078727336886218,"spread":0.2921579231426286,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01111628,0.00009358772,0.0002479007,0.002523429,0.0003044039,0.000634715,0.0007373844,0.0000792235,0.006653588],"category_scores_gemma":[0.01646644,0.00006289686,0.0001172523,0.004401852,0.0001998592,0.005094571,0.0001264752,0.0002536628,0.0002523577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001006564,"about_ca_system_score_gemma":0.0003981324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001711074,"about_ca_topic_score_gemma":0.0005230167,"domain_scores_codex":[0.9932581,0.0007300532,0.001510644,0.0001666909,0.004118925,0.000215649],"domain_scores_gemma":[0.9898219,0.005253109,0.0003059481,0.0003889292,0.004182988,0.00004713537],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006812669,0.000568991,0.0242872,0.00006121054,0.0001202951,0.000001241948,0.03243007,0.03641942,0.00465855,0.0208982,0.08977339,0.7901002],"study_design_scores_gemma":[0.0009392395,0.00008705421,0.1823295,0.0000545767,0.00001382672,0.000007423836,0.0129013,0.7051077,0.001066547,0.001629999,0.0957249,0.0001378638],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9187415,0.0001402901,0.05736252,0.005567532,0.0001775842,0.001661375,0.003425049,0.00002415123,0.01290005],"genre_scores_gemma":[0.993197,0.000005621848,0.005777713,0.000269536,0.00006225183,0.0001039067,0.000522567,0.000002641941,0.00005874062],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7899623,"threshold_uncertainty_score":0.9942545,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01960247739036108,"gpt":0.2960061938992594,"spread":0.2764037165088983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002808142,0.00008698612,0.0001394396,0.0001424125,0.0002125335,0.0001816651,0.00003829588,0.00003705682,0.00008208769],"category_scores_gemma":[0.00003224598,0.0000707072,0.00001473472,0.000458137,0.00007311269,0.0001653216,0.000006272874,0.0001642052,0.00000359983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001431703,"about_ca_system_score_gemma":0.00008281852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004804847,"about_ca_topic_score_gemma":0.00002620297,"domain_scores_codex":[0.9992008,0.00003916336,0.0001225947,0.0001831167,0.0002940731,0.0001602377],"domain_scores_gemma":[0.9994275,0.00009100498,0.000003353965,0.00007123777,0.0003237593,0.00008313711],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006566533,0.00007208522,0.009688229,0.0002165227,0.0002784412,0.00002891398,0.000923487,0.9608708,0.01417626,0.00001584874,0.000007193605,0.01365654],"study_design_scores_gemma":[0.0007311945,0.00004406774,0.0159383,0.00002741215,0.0000473093,0.000008849389,0.00004907489,0.9802831,0.00273831,4.269944e-7,0.00003979068,0.00009220635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6992967,0.0008256767,0.299183,0.0003499404,0.0000110786,0.0001313663,0.00003656096,0.00003275532,0.0001329311],"genre_scores_gemma":[0.9757516,0.0002218862,0.02333638,0.00003078698,0.00002476027,0.00002755859,0.00005487106,0.00001452482,0.0005375647],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.276455,"threshold_uncertainty_score":0.2883356,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.3394264910687215,"gpt":0.5076645604168483,"spread":0.1682380693481268,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001716055,0.000124719,0.0002105571,0.0001948016,0.0005545624,0.0001144278,0.0001666467,0.00009703069,0.000289526],"category_scores_gemma":[0.0009897287,0.0001068705,0.00007738084,0.0008009254,0.0001305915,0.0003053479,0.00008075351,0.0002969888,0.00004395008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001883762,"about_ca_system_score_gemma":0.001999906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003323647,"about_ca_topic_score_gemma":0.0005840297,"domain_scores_codex":[0.9974036,0.00005182638,0.0002564871,0.0004354649,0.001270252,0.0005823635],"domain_scores_gemma":[0.996848,0.0004005964,0.0000278146,0.0001707889,0.002330102,0.000222647],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.01676667,0.0004682599,0.0883587,0.000514495,0.0004511469,0.0002029015,0.003335654,0.5828658,0.0608001,0.003587832,0.05209767,0.1905508],"study_design_scores_gemma":[0.001902926,0.0001236551,0.04787357,0.0003529523,0.00001459342,0.00002580958,0.0006830606,0.9475634,0.0007140469,0.0003902583,0.0002392882,0.0001165186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8060853,0.0003658039,0.1685287,0.01708917,0.0001724244,0.003998326,0.001482715,0.0002238807,0.002053608],"genre_scores_gemma":[0.9641014,0.00006538369,0.02930239,0.0004647178,0.0002599939,0.0009449568,0.0001355933,0.00002755071,0.004697956],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3646975,"threshold_uncertainty_score":0.4358051,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04613425917603377,"gpt":0.3396233812447194,"spread":0.2934891220686856,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002227897,0.0001396763,0.0001170072,0.001616278,0.0003856971,0.001558162,0.0002782048,0.00005072005,0.002040361],"category_scores_gemma":[0.0006579262,0.0001278712,0.00004004798,0.002779681,0.00008665868,0.001167076,0.0002804554,0.0004317508,0.0005621107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003802499,"about_ca_system_score_gemma":0.0002706109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001998727,"about_ca_topic_score_gemma":0.0008852069,"domain_scores_codex":[0.997617,0.0000618136,0.0002358394,0.0005235948,0.00105018,0.0005115868],"domain_scores_gemma":[0.9991242,0.000134247,0.0000157587,0.0002267621,0.0004840587,0.00001494119],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007715262,0.0000949011,0.008546042,0.0005872501,0.00003569611,0.0001933104,0.0001993346,0.003252483,0.001056411,0.7286902,0.243871,0.01339616],"study_design_scores_gemma":[0.0005792486,0.0000319609,0.04918419,0.0001161219,0.00001026693,0.000004941466,0.001760624,0.1260572,0.0003663425,0.03680267,0.7847246,0.0003618445],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7571106,0.002041041,0.0006056771,0.08145371,0.002701014,0.004512797,0.00001344949,0.0004707644,0.151091],"genre_scores_gemma":[0.952894,0.00003160044,0.0001760072,0.0004511037,0.002011843,0.0002823438,0.0001220563,0.00003555441,0.04399554],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6918876,"threshold_uncertainty_score":0.9994783,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.1476124486664282,"gpt":0.4100967213350086,"spread":0.2624842726685804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001608294,0.0001318587,0.0001922629,0.0004583462,0.0004607879,0.0003842156,0.0001741887,0.00003492989,0.00002029877],"category_scores_gemma":[0.0003242504,0.0001204748,0.00004619593,0.0004775376,0.0001001539,0.0004270725,0.0003297802,0.0001754537,0.000002450488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004801196,"about_ca_system_score_gemma":0.00005581954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006009311,"about_ca_topic_score_gemma":0.00003224222,"domain_scores_codex":[0.9985292,0.00004054515,0.0002227312,0.0003860055,0.000508412,0.0003130966],"domain_scores_gemma":[0.9992239,0.0001599709,0.00004471657,0.0001878033,0.0003670617,0.00001652949],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002061856,0.0298252,0.191002,0.01055139,0.002162999,0.001490912,0.01473697,0.2234066,0.01000625,0.4330913,0.02046991,0.06119476],"study_design_scores_gemma":[0.001942381,0.0001003654,0.002651251,0.00005519989,0.00003233873,0.000003234184,0.01444535,0.9740199,0.00002502011,0.0001689216,0.006405169,0.0001508311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9388592,0.00009595422,0.05610495,0.0003905342,0.00006900194,0.003370425,0.00001225908,0.00003355027,0.001064126],"genre_scores_gemma":[0.9949276,3.580543e-7,0.002392038,0.0001627926,0.000247266,0.0007630188,0.000067378,0.00001648419,0.001423103],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7506134,"threshold_uncertainty_score":0.4912819,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07833009290925859,"gpt":0.410827688518579,"spread":0.3324975956093204,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005259665,0.0001200634,0.0001098815,0.000248945,0.0005857762,0.0004508061,0.0001306406,0.00008772083,0.0001374059],"category_scores_gemma":[0.00006645935,0.0001039991,0.00001970027,0.000363733,0.00005439925,0.0004064043,0.00001637617,0.0003008348,0.000004827719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001688489,"about_ca_system_score_gemma":0.0002539459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001837662,"about_ca_topic_score_gemma":0.0002353231,"domain_scores_codex":[0.9989733,0.00007272619,0.0001938657,0.000222724,0.0002616562,0.000275756],"domain_scores_gemma":[0.9988994,0.0001575474,0.000006544309,0.0001458496,0.0007101063,0.00008056931],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000487057,0.00008694052,0.0004016256,0.0000462927,0.00008696978,0.000006292947,0.0003168826,0.9386262,0.008053763,0.01026607,0.003715624,0.03834465],"study_design_scores_gemma":[0.0003756353,0.0001114857,0.001168764,0.00007546141,0.000007730179,0.000003937469,0.0003072027,0.9916464,0.003813549,0.000265828,0.002100735,0.0001232442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02851611,0.00008150657,0.9654747,0.0003055616,0.00009507614,0.0006336246,0.00008710592,0.0001388885,0.004667441],"genre_scores_gemma":[0.9328732,0.00001288103,0.06344587,0.000081566,0.0001088416,0.0003159686,0.002239555,0.00002545212,0.0008966615],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9043571,"threshold_uncertainty_score":0.4505376,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05555135738016045,"gpt":0.4187296603122404,"spread":0.36317830293208,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001345894,0.00006455525,0.00008405242,0.0001130359,0.0003572993,0.0003548495,0.0001876267,0.00003415838,0.0003888645],"category_scores_gemma":[0.0001032423,0.00005244559,0.00001791447,0.0003041676,0.00006943964,0.001549277,0.0001713796,0.000126744,0.00001009391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003415424,"about_ca_system_score_gemma":0.0001149155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003528038,"about_ca_topic_score_gemma":0.0003352631,"domain_scores_codex":[0.9989343,0.00006095215,0.0002870827,0.0001747436,0.0003055278,0.0002374047],"domain_scores_gemma":[0.9995615,0.0002403089,0.00003312292,0.00009533401,0.00005392456,0.0000158057],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0001608485,0.0005115499,0.1067589,0.0004161377,0.00002915337,0.00001773383,0.01169475,0.03248604,0.002984859,0.1772413,0.0002556063,0.6674432],"study_design_scores_gemma":[0.0005501307,0.00002201581,0.8290725,0.0003832515,0.000003101421,0.000002922738,0.01778701,0.1080447,0.0004219878,0.04179261,0.001766037,0.0001537056],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9748171,0.00009205322,0.02206974,0.0008247823,0.00006348618,0.0003252471,0.00000553467,0.000003423434,0.00179862],"genre_scores_gemma":[0.994442,0.00003507362,0.00538304,0.00004966878,0.00001661115,0.00003491216,0.00001253801,0.000004187074,0.00002192548],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7223136,"threshold_uncertainty_score":0.4257794,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"Department of National Defence","funders":"","keywords":"Computational intelligence; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.09804418290431499,"gpt":0.3453719959603153,"spread":0.2473278130560003,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001167836,0.0001008079,0.00007203281,0.0003860367,0.0004403656,0.0008202876,0.0001844951,0.00003689023,0.0007915953],"category_scores_gemma":[0.0003014175,0.00008665592,0.0000211421,0.001428779,0.00008342351,0.00143954,0.000102775,0.0001869559,0.001207556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001191079,"about_ca_system_score_gemma":0.0001341937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001078352,"about_ca_topic_score_gemma":0.0005869555,"domain_scores_codex":[0.9983755,0.00002724619,0.0001827874,0.0003713492,0.0007921773,0.0002509356],"domain_scores_gemma":[0.9988884,0.00003315249,0.00001100277,0.0001953149,0.0008555024,0.00001660176],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003848863,0.0001248631,0.0009837692,0.0004144627,0.00003469122,0.00001097242,0.0001797282,0.8694039,0.0005431673,0.1124773,0.01183624,0.003952444],"study_design_scores_gemma":[0.0001442051,0.00001055726,0.005451523,0.0001210988,0.000006728798,0.000001206568,0.0002005038,0.9469631,0.0000151515,0.0001098743,0.04685753,0.000118577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1006954,0.001586086,0.7746877,0.03459596,0.001521752,0.002874638,0.00001817557,0.0007892979,0.08323096],"genre_scores_gemma":[0.9894446,0.00004307251,0.003184523,0.0003890021,0.0005081131,0.0001564475,0.0002342032,0.000019597,0.006020473],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8887491,"threshold_uncertainty_score":0.9995701,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.3683363571449461,"gpt":0.5589452745761226,"spread":0.1906089174311765,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","scholarly_communication","insufficient_payload"],"consensus_categories":["metaresearch","insufficient_payload"],"category_scores_codex":[0.06212415,0.0001024077,0.0001830046,0.001279969,0.0003141672,0.001865701,0.0007007413,0.00009173842,0.005790147],"category_scores_gemma":[0.02251764,0.00007603315,0.0001049591,0.002773,0.0001775705,0.0006182736,0.0001831426,0.0005496723,0.004999783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004317035,"about_ca_system_score_gemma":0.001494988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003163003,"about_ca_topic_score_gemma":0.001352528,"domain_scores_codex":[0.9824434,0.00162063,0.0006363284,0.0007961949,0.01410188,0.000401582],"domain_scores_gemma":[0.9915314,0.003989667,0.00002297497,0.0004998408,0.003850593,0.0001054865],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001159581,0.0003903218,0.01044265,0.00001406978,0.0000987644,0.0001843424,0.005157431,0.3434213,0.004922325,0.1555195,0.1106554,0.369078],"study_design_scores_gemma":[0.0002312125,0.00006143229,0.005919444,0.00003288135,0.000008074588,0.000007698472,0.001305615,0.9088441,0.0005645089,0.01251326,0.07038995,0.0001218262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9271634,0.003479194,0.006131772,0.02784467,0.0005563364,0.0007512079,0.00003864917,0.00004286936,0.03399194],"genre_scores_gemma":[0.9807552,0.00001057574,0.0002926748,0.0001176802,0.0001589306,0.00009241211,0.00003010359,0.00001049819,0.01853191],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5654228,"threshold_uncertainty_score":0.9991705,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}