{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":22,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":22,"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","author_layer_release":"2026-06-26"},"query_hash":"7eb314db32b8","filters":{"venue":"RAIRO - Operations Research"}},"results":[{"id":"W2880529068","doi":"10.1051/ro/2018060","title":"Gangless cross-evaluation in DEA: an application to stock selection","year":2018,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Data envelopment analysis; Stock (firearms); Computer science; Envelopment; Selection (genetic algorithm); Operations research; Econometrics; Economics; Mathematical optimization; Mathematics; Engineering; Artificial intelligence","authors":[{"name":"Gholam R. Amin","is_ca":true},{"name":"Amar Oukil","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3279619726614527,"gpt":0.5950344385732645,"spread":0.2670724659118118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01259402,0.001418833,0.001662974,0.003648678,0.0008143616,0.001699954,0.0005752934,0.0007160464,0.00124921],"category_scores_gemma":[0.01534884,0.0003960178,0.001375048,0.003186795,0.0007450411,0.0009493495,0.001853155,0.001359572,0.0001914863],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001147103,"about_ca_system_score_gemma":0.001005528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003423527,"about_ca_topic_score_gemma":0.002928949,"domain_scores_codex":[0.9954441,0.002963699,0.0003081526,0.0002743915,0.0008393481,0.0001704064],"domain_scores_gemma":[0.9922381,0.005933674,0.0004194906,0.0003160003,0.0009627685,0.0001301385],"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.0002913929,0.0002378442,0.006616149,0.0003250794,0.0004488597,0.0001736821,0.0004090038,0.5991713,0.004037892,0.01751188,0.0005422166,0.3702347],"study_design_scores_gemma":[0.00001886711,0.0001931233,0.002082082,0.00003814353,0.00004965038,0.00004473256,0.00007036078,0.986532,0.003513928,0.006399168,0.001028712,0.00002918787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06080658,0.0005187029,0.9356341,0.0001247947,0.00003211344,0.0001464739,0.00004807397,0.0001941987,0.002494958],"genre_scores_gemma":[0.4544794,0.0004105623,0.5432824,0.00007491498,0.00003354444,0.0002687656,0.0001420455,0.00008120786,0.001227155],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01259402,"threshold_uncertainty_score":0.06660432,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2609748945","doi":"10.1051/ro/2017030","title":"Impact of vehicle tracking on a routing problem with dynamic travel times","year":2017,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Schedule; Computer science; Vehicle routing problem; Routing (electronic design automation); Adaptive routing; Dynamic positioning; Operations research; Real-time computing; Transport engineering; Static routing; Engineering; Computer network; Routing protocol; Marine engineering","authors":[{"name":"Jean Respen","is_ca":false},{"name":"Nicolas Zufferey","is_ca":false},{"name":"Jean‐Yves Potvin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06383388641025729,"gpt":0.4121994141531776,"spread":0.3483655277429203,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002659918,0.000798437,0.0005880035,0.0004307192,0.0006537514,0.001024002,0.0005970576,0.001170382,0.001504318],"category_scores_gemma":[0.009428306,0.0004610535,0.0003851426,0.0005388916,0.000789516,0.001594927,0.0007263162,0.001009135,0.0001081545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009170726,"about_ca_system_score_gemma":0.001175627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01135549,"about_ca_topic_score_gemma":0.00590782,"domain_scores_codex":[0.9991131,0.0004956656,0.00002891014,0.0001108145,0.000123432,0.0001280581],"domain_scores_gemma":[0.9912476,0.00769352,0.0004877523,0.0001865739,0.0002126392,0.000172015],"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.00009337221,0.00003616708,0.0006378922,0.0000148763,0.000008605301,0.00002124205,0.00001101582,0.994605,0.0005219919,0.0005960141,0.00006126239,0.003392602],"study_design_scores_gemma":[0.00001117469,0.0000864053,0.0003050914,0.000002474513,0.000006652931,0.000009796528,0.00001666274,0.9986877,0.0003910171,0.0004150252,0.00006473075,0.000003363994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.86713,0.0006274152,0.1262658,0.000583854,0.00006423125,0.00005703722,0.0001148535,0.0002919881,0.004864775],"genre_scores_gemma":[0.9872009,0.0001404628,0.0119619,0.00003142544,0.00001275211,0.00001334304,0.00005412375,0.00002029886,0.0005648429],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01135549,"threshold_uncertainty_score":0.02257878,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147243846","doi":"10.1051/ro/2014019","title":"Block decomposition approach to compute a minimum geodetic set","year":2014,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Geodetic datum; Block (permutation group theory); Set (abstract data type); Decomposition; Computer science; Algorithm; Mathematics; Arithmetic; Geodesy; Combinatorics; Geology; Programming language; Chemistry","authors":[{"name":"Tınaz Ekim","is_ca":false},{"name":"Aysel Erey","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05863119614734241,"gpt":0.3485741806096815,"spread":0.2899429844623391,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004951457,0.0006837678,0.000991873,0.001289917,0.00064878,0.0009839451,0.001081734,0.0007940147,0.008726893],"category_scores_gemma":[0.002005863,0.0003883764,0.0006396954,0.001723248,0.0004284849,0.002145635,0.00104686,0.001267385,0.001518082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001151218,"about_ca_system_score_gemma":0.001279866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003484259,"about_ca_topic_score_gemma":0.006349809,"domain_scores_codex":[0.9995697,0.00008899924,0.00002257682,0.00009791616,0.0001296721,0.00009125084],"domain_scores_gemma":[0.9992598,0.0003601117,0.00006304343,0.0001389399,0.0001186748,0.00005952188],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004023171,0.0002598399,0.001877304,0.0004589385,0.0001083317,0.0001400666,0.0002211263,0.4629878,0.01387417,0.1752123,0.01678737,0.3276704],"study_design_scores_gemma":[0.000039545,0.00006960535,0.0003338423,0.00001821922,0.00001995098,0.00007797949,0.00005726476,0.9246592,0.002912738,0.06633518,0.005466047,0.00001039003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0189705,0.000237516,0.9738439,0.0002169791,0.00003653628,0.00009890804,0.0002906653,0.0005156703,0.005789273],"genre_scores_gemma":[0.1883324,0.0003167603,0.8053219,0.0001228512,0.00004937488,0.0002066042,0.001317522,0.0002247373,0.004107909],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008726893,"threshold_uncertainty_score":0.02919436,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2987548641","doi":"10.1051/ro/2019061","title":"A new model for logistics and transportation of fashion goods in the presence of stochastic market demands considering restricted retailers capacity","year":2019,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Simulated annealing; Computer science; Taguchi methods; Profit (economics); Sorting; Mathematical optimization; Metaheuristic; Genetic algorithm; Operations research; Scheduling (production processes); Supply chain; Economics; Business; Algorithm; Microeconomics; Machine learning; Marketing; Mathematics","authors":[{"name":"Aidin Delgoshaei","is_ca":true},{"name":"Hengameh Norozi","is_ca":false},{"name":"Abolfazl Mirzazadeh","is_ca":false},{"name":"Maryam Farhadi","is_ca":false},{"name":"Golnaz Hooshmand Pakdel","is_ca":false},{"name":"Aisa Khoshniat Aram","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07942860718814532,"gpt":0.3119648954049459,"spread":0.2325362882168006,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001238087,0.001523429,0.001616394,0.001542779,0.0009941704,0.003128699,0.003816299,0.003617093,0.008425987],"category_scores_gemma":[0.001532714,0.001082534,0.002234071,0.002474681,0.0009839414,0.002648547,0.001489736,0.002422219,0.001209787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002488422,"about_ca_system_score_gemma":0.00245592,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01907084,"about_ca_topic_score_gemma":0.01449726,"domain_scores_codex":[0.999049,0.0002611428,0.00005213077,0.0002619752,0.0001922495,0.0001835194],"domain_scores_gemma":[0.9992938,0.0003070626,0.0001318115,0.00002967281,0.00018081,0.00005684563],"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.00003412291,0.00003588315,0.0002567536,0.00008668908,0.00002548433,0.0001713145,0.00004086982,0.9771474,0.0007002937,0.01813598,0.0006934535,0.002671813],"study_design_scores_gemma":[0.00001079197,0.00002719165,0.0001014044,0.00000879587,0.00001418168,0.00002746591,0.00002000722,0.9949009,0.0001152338,0.003552093,0.001212592,0.000009194349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02993203,0.001100306,0.9309149,0.00137619,0.0003865359,0.0002432925,0.00148151,0.0003577884,0.0342075],"genre_scores_gemma":[0.7819291,0.002712637,0.1095369,0.0003929583,0.0002636907,0.001003138,0.001302717,0.0001762074,0.1026827],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01907084,"threshold_uncertainty_score":0.03791964,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2566538835","doi":"10.1051/ro/2016076","title":"Chance-constrained data envelopment analysis modeling with random-rough data","year":2016,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Data envelopment analysis; Robustness (evolution); Quadratic equation; Mathematical optimization; Computer science; Mathematics; Stability (learning theory); Machine learning","authors":[{"name":"Rashed Khanjani Shiraz","is_ca":false},{"name":"Madjid Tavana","is_ca":false},{"name":"Debora Di Caprio","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.5605074718402389,"gpt":0.5311501072448088,"spread":0.02935736459543004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004102192,0.001451468,0.001806812,0.001378049,0.0005187703,0.002770012,0.002039548,0.001449394,0.001955503],"category_scores_gemma":[0.009022386,0.0009139651,0.002423437,0.002264658,0.001295394,0.002409905,0.001714398,0.00182306,0.0002383939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00207865,"about_ca_system_score_gemma":0.001790586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00726341,"about_ca_topic_score_gemma":0.003706563,"domain_scores_codex":[0.9962988,0.001694133,0.0002245768,0.0006668207,0.0008053954,0.0003102222],"domain_scores_gemma":[0.9956682,0.002807717,0.0006837089,0.0002666152,0.0004681843,0.0001055953],"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.00001533519,0.0000133806,0.000287973,0.00004428947,0.00003737092,0.00004678846,0.00003144505,0.945429,0.0002192723,0.05064119,0.0001617305,0.003072259],"study_design_scores_gemma":[0.000003389113,0.0000105199,0.0001018196,0.000007113957,0.000006707309,0.000007856422,0.000006811531,0.9824582,0.0001014235,0.01698815,0.0002984864,0.000009604588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009346058,0.0002164055,0.9883186,0.000255999,0.00001815667,0.0000468859,0.0001216623,0.00004045484,0.001635791],"genre_scores_gemma":[0.8095518,0.0009844222,0.1835068,0.0001449064,0.0000586898,0.0005274657,0.0003950315,0.00004714967,0.004783737],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00726341,"threshold_uncertainty_score":0.02169466,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2985494805","doi":"10.1051/ro/2019105","title":"Interactive multiobjective DEA target setting using lexicographic DDF","year":2019,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Lexicographical order; Computer science; Mathematical optimization; Process (computing); Efficient frontier; Function (biology); Multi-objective optimization; Algorithm; Mathematics","authors":[{"name":"Narges Soltani","is_ca":true},{"name":"Sebastián Lozano","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1950906747035397,"gpt":0.5178714991477066,"spread":0.3227808244441669,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002352071,0.001649289,0.001886785,0.001953607,0.0005511635,0.002000524,0.001748685,0.001136414,0.004068209],"category_scores_gemma":[0.003233454,0.0006736119,0.001587753,0.001755132,0.0006545821,0.00154036,0.001647031,0.001579438,0.0006387511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001221768,"about_ca_system_score_gemma":0.001282116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002142933,"about_ca_topic_score_gemma":0.001994584,"domain_scores_codex":[0.9982244,0.0008422289,0.0001138452,0.0002137229,0.0004985056,0.0001072752],"domain_scores_gemma":[0.9983429,0.001136041,0.0001243451,0.0001173796,0.0002291543,0.00005027681],"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.0001000836,0.0001329007,0.0006266125,0.0003689814,0.0001350687,0.0001093274,0.0001086572,0.8557835,0.002853753,0.03746834,0.0009520318,0.1013607],"study_design_scores_gemma":[0.00001272891,0.00006662602,0.00007599648,0.00001813561,0.00001416829,0.00002934386,0.00002030112,0.9884814,0.001054877,0.008734155,0.001480137,0.00001200812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003180492,0.0001728069,0.9940044,0.00003120206,0.00001359086,0.00005588262,0.00003049409,0.0000810034,0.002430141],"genre_scores_gemma":[0.2096857,0.0004574808,0.786118,0.00007116797,0.00003667954,0.0006472701,0.0002605041,0.0001282221,0.002595105],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004068209,"threshold_uncertainty_score":0.01360947,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3144499601","doi":"10.1051/ro/2021054","title":"Complete analysis of a discrete-time batch service queue with batch-size-dependent service time under correlated arrival process: D-MAP/<i>G<sub>n</sub><sup>(a,b)</sup>/</i>1","year":2021,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markovian arrival process; Computer science; Epoch (astronomy); Queueing theory; Bulk queue; Queue; Generating function; Markov process; Function (biology); Discrete time and continuous time; Real-time computing; Applied mathematics; Mathematical optimization; Algorithm; Mathematics; Discrete mathematics; Computer network; Statistics","authors":[{"name":"Umesh Gupta","is_ca":false},{"name":"Nitin Kumar","is_ca":false},{"name":"Sourav Pradhan","is_ca":false},{"name":"F. P. Barbhuiya","is_ca":false},{"name":"M. L. Chaudhry","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02341840888200112,"gpt":0.2928427222999386,"spread":0.2694243134179374,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002030708,0.0008547148,0.001000066,0.0009356898,0.0007459817,0.001272396,0.001378605,0.0008848719,0.002371207],"category_scores_gemma":[0.004763503,0.0004248633,0.001116393,0.0006625052,0.001105684,0.001669757,0.0008073943,0.001093394,0.0002230009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002689783,"about_ca_system_score_gemma":0.002590223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01336944,"about_ca_topic_score_gemma":0.005237207,"domain_scores_codex":[0.9992242,0.000191461,0.00002848138,0.0001174711,0.0002689828,0.000169456],"domain_scores_gemma":[0.9973437,0.001417397,0.000341677,0.0000975912,0.0006204309,0.0001791809],"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.000221872,0.00007612642,0.002719517,0.0001730681,0.0000908057,0.0003069528,0.0002092302,0.8604269,0.008053553,0.1195989,0.001632729,0.00649035],"study_design_scores_gemma":[0.000003956878,0.00001330668,0.0002999073,0.000002557437,0.000007357572,0.00001976267,0.00001261093,0.9940268,0.0002441215,0.005250145,0.0001122725,0.000007232625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1845917,0.001504184,0.8058618,0.00112367,0.0001460389,0.0001161058,0.0003540729,0.0003150971,0.005987222],"genre_scores_gemma":[0.9794708,0.0006105623,0.01451743,0.000127067,0.000100989,0.0000735568,0.0002270227,0.00006666134,0.004805945],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01336944,"threshold_uncertainty_score":0.02658325,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2493227902","doi":"10.1051/ro/2015054","title":"Strategic investments in R&amp;D and efficiency in the presence of free riders","year":2015,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Spillover effect; Business; Welfare; Industrial organization; Process (computing); Marketing; Microeconomics; Economics; Market economy; Computer science","authors":[{"name":"Mouna Ben Brahim","is_ca":false},{"name":"Georges Zaccour","is_ca":true},{"name":"Fouad Ben Abdelaziz","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.5530373471008291,"gpt":0.4081188183778541,"spread":0.144918528722975,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002540223,0.0006748417,0.00133979,0.001012835,0.0008360103,0.002301131,0.001016327,0.002397578,0.004640225],"category_scores_gemma":[0.009771895,0.0004354151,0.0009083785,0.0007972274,0.002735666,0.00249712,0.002044667,0.001289684,0.0003321945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001115363,"about_ca_system_score_gemma":0.0008871826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003849585,"about_ca_topic_score_gemma":0.002012434,"domain_scores_codex":[0.9986363,0.000513641,0.00005920256,0.0002375266,0.00007710344,0.0004762305],"domain_scores_gemma":[0.9875203,0.006868241,0.003224363,0.0006047587,0.0004558619,0.001326488],"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.001065312,0.000920407,0.04803674,0.0004447361,0.0005766344,0.002598169,0.0008467162,0.4676139,0.008454636,0.443772,0.002633498,0.02303729],"study_design_scores_gemma":[0.0004744076,0.000630988,0.01621443,0.00009359384,0.0003686725,0.0004033214,0.001534004,0.5846207,0.002749924,0.3904836,0.002325775,0.0001007294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9424816,0.0005861202,0.04021461,0.001942946,0.0000203326,0.00003413266,0.0001160022,0.00002777851,0.01457649],"genre_scores_gemma":[0.9973977,0.0001958104,0.001098867,0.00003681643,0.00001415181,0.00001379974,0.00001835246,0.000001662059,0.001222903],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004640225,"threshold_uncertainty_score":0.01552308,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3136294381","doi":"10.1051/ro/2021040","title":"Socially concerned periodic review replenishment system with customer service level and supply chain contracting","year":2021,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Supply chain; Profitability index; Business; Decentralization; Order (exchange); Microeconomics; Service (business); Industrial organization; Marketing; Economics; Finance","authors":[{"name":"Maryam Johari","is_ca":false},{"name":"Seyyed‐Mahdi Hosseini‐Motlagh","is_ca":false},{"name":"Mohammadreza Nematollahi","is_ca":true},{"name":"Mark Goh","is_ca":false},{"name":"Joshua Ignatius","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1086304915817077,"gpt":0.3339774089625199,"spread":0.2253469173808122,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008483855,0.001040374,0.001565426,0.001106586,0.001661074,0.003359992,0.002910188,0.002409836,0.004688794],"category_scores_gemma":[0.01587177,0.0006396964,0.00114239,0.001322194,0.002027947,0.003491647,0.002917198,0.001645054,0.0005570435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003372318,"about_ca_system_score_gemma":0.004024492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003322693,"about_ca_topic_score_gemma":0.002164979,"domain_scores_codex":[0.9903643,0.004303408,0.0005070814,0.001691119,0.002230853,0.0009033291],"domain_scores_gemma":[0.9891205,0.004791307,0.002167471,0.001466487,0.00158365,0.0008706471],"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.0007533106,0.0003824306,0.004627614,0.0004135631,0.0002863659,0.001440326,0.001198207,0.3911677,0.006816049,0.5062127,0.004335384,0.08236638],"study_design_scores_gemma":[0.0001440699,0.0003279887,0.00118239,0.00005207089,0.0001070626,0.0005748193,0.0002368941,0.8711557,0.001772115,0.1158472,0.008498159,0.0001014667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1648576,0.0007297678,0.8028485,0.002042816,0.0002013331,0.0007490871,0.0002866689,0.0004308995,0.0278533],"genre_scores_gemma":[0.9478067,0.0002253561,0.04354666,0.0001365698,0.0001277787,0.0002606377,0.00008310645,0.00003156815,0.007781639],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008483855,"threshold_uncertainty_score":0.04486746,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126642927","doi":"10.1051/ro:2005003","title":"Un problème d'approximation matricielle : quelle est la matrice bistochastique la plus proche d'une matrice donnée ?","year":2005,"lang":"fr","type":"article","venue":"RAIRO - Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Physics; Humanities; Philosophy","authors":[{"name":"Pawoumodom Ledogada Takouda","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04820096447093045,"gpt":0.346908263251655,"spread":0.2987072987807246,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00206144,0.0007101788,0.00117378,0.0006324801,0.0007056386,0.001789353,0.00103562,0.001525767,0.007213574],"category_scores_gemma":[0.0175248,0.0004403403,0.0009732053,0.001080221,0.001626643,0.003463216,0.001921482,0.002839177,0.0009111593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008294592,"about_ca_system_score_gemma":0.001357271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004749485,"about_ca_topic_score_gemma":0.004157448,"domain_scores_codex":[0.9982587,0.0005326008,0.0000782819,0.0004547015,0.0005533278,0.0001223507],"domain_scores_gemma":[0.9937318,0.004709306,0.0002530149,0.0005158503,0.0006366761,0.0001533137],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003638078,0.0001034491,0.00314894,0.001074726,0.000152237,0.0004042163,0.0008063059,0.286312,0.02406197,0.3909737,0.006517505,0.2860811],"study_design_scores_gemma":[0.00003461072,0.0001820974,0.001381358,0.0001196142,0.00003964828,0.0004571923,0.0004010589,0.8022714,0.009629757,0.1710061,0.01442724,0.00004995745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01731029,0.0003413209,0.9782479,0.001023141,0.00006860819,0.00003677782,0.000161776,0.0001182352,0.002691927],"genre_scores_gemma":[0.3396665,0.001823377,0.646001,0.0004199364,0.0002929392,0.0002535358,0.0006818635,0.0002195593,0.01064142],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007213574,"threshold_uncertainty_score":0.02413177,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2908334818","doi":"10.1051/ro/2019007","title":"Z-equilibria in Bi-matrix games with uncertain payoffs","year":2019,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; Statistics Canada","funders":"","keywords":"Mathematical economics; Nash equilibrium; Pareto principle; Game theory; Mathematical optimization; Normal-form game; Ranking (information retrieval); Computation; Pareto optimal; Fictitious play; Mathematics; Matrix (chemical analysis); Best response; Solution concept; Equilibrium selection; Computer science; Repeated game; Multi-objective optimization; Algorithm; Artificial intelligence","authors":[{"name":"Farida Achemine","is_ca":false},{"name":"Abdelkader Merakeb","is_ca":false},{"name":"Moussa Larbani","is_ca":true},{"name":"Philippe Marthon","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07441945382412024,"gpt":0.3335333790494214,"spread":0.2591139252253011,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001961577,0.0009924051,0.0007715755,0.001156338,0.0007661365,0.002226802,0.0009926022,0.001138731,0.002961884],"category_scores_gemma":[0.004718589,0.0003805787,0.000774089,0.0009917265,0.002129701,0.002824783,0.001854834,0.001591127,0.0004389041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001544523,"about_ca_system_score_gemma":0.001004164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002009738,"about_ca_topic_score_gemma":0.00142842,"domain_scores_codex":[0.9984629,0.0007613226,0.00007919421,0.000207505,0.0003094647,0.0001796854],"domain_scores_gemma":[0.9983289,0.001019008,0.0003000025,0.00005189208,0.0001937412,0.0001064097],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004301749,0.00002423704,0.0002618499,0.00005603844,0.00002592319,0.0001156517,0.0001453812,0.09655353,0.001327215,0.8942714,0.0004846837,0.006691069],"study_design_scores_gemma":[0.00002614782,0.00004805602,0.0001612219,0.00002536621,0.00001103654,0.00005682768,0.0001012894,0.4863841,0.0005772129,0.5109049,0.001679635,0.0000242533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03704284,0.000444966,0.9514539,0.0003272405,0.00003771747,0.00009866105,0.00008731429,0.00006068456,0.01044668],"genre_scores_gemma":[0.8245416,0.001186617,0.1655953,0.0001684251,0.000062319,0.0005854215,0.0001351695,0.00004325497,0.007681867],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002961884,"threshold_uncertainty_score":0.01120633,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2942309913","doi":"10.1051/ro/2019043","title":"A Non-Linear-Threshold-Accepting Function Based Algorithm for the Solution of Economic Dispatch Problem","year":2019,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Electric Power System Optimization","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematical optimization; Economic dispatch; Computer science; Harmony search; Benchmark (surveying); Heuristics; Heuristic; Electric power system; Algorithm; Power (physics); Mathematics","authors":[{"name":"Nabil Nahas","is_ca":false},{"name":"Mohamed Noomane Darghouth","is_ca":false},{"name":"Mohammed Abouheaf","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02926980076289461,"gpt":0.309141042920805,"spread":0.2798712421579104,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006595803,0.0007188463,0.00081738,0.0006797133,0.0005151611,0.0008024532,0.001372217,0.0009292162,0.003264579],"category_scores_gemma":[0.001200792,0.0002587365,0.0006400668,0.0008756283,0.000434967,0.0007871793,0.0006227084,0.001120344,0.0005004787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007672814,"about_ca_system_score_gemma":0.001443113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003079126,"about_ca_topic_score_gemma":0.002594907,"domain_scores_codex":[0.9996468,0.0001064959,0.00002110265,0.00006064759,0.0001005235,0.00006439473],"domain_scores_gemma":[0.9996865,0.0001814432,0.00003553948,0.00002017573,0.0000567147,0.00001971449],"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.0001494127,0.0001358538,0.0005528737,0.0001327073,0.0000510329,0.00009587313,0.00009620762,0.7854373,0.00315198,0.02819804,0.003607139,0.1783915],"study_design_scores_gemma":[0.00001375524,0.00002789702,0.00005245273,0.000003989368,0.000004038064,0.00001868742,0.000006712559,0.9965245,0.0004346326,0.002238863,0.0006704949,0.00000388909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009305116,0.0001435736,0.9873632,0.00009759212,0.00003769691,0.00005973874,0.00002270339,0.0002759976,0.00269446],"genre_scores_gemma":[0.2901214,0.0002301052,0.7042601,0.0001461449,0.00003687759,0.0003838267,0.000200604,0.0001423826,0.004478543],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003264579,"threshold_uncertainty_score":0.01092112,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2308641315","doi":"10.1051/ro/2015024","title":"Linear time algorithms to solve the linear ordering problem for oriented tree based graphs","year":2015,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Chicoutimi","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Time complexity; Computer science; Tree (set theory); Mathematics; Combinatorics","authors":[{"name":"Alain Quilliot","is_ca":false},{"name":"Djamal Rebaïne","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1094574019749217,"gpt":0.4049995213879207,"spread":0.295542119412999,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006794432,0.001596843,0.0008672746,0.0009773392,0.0008476094,0.001600252,0.001860552,0.001091164,0.01349604],"category_scores_gemma":[0.00437622,0.0005053339,0.0007167079,0.002386371,0.0007007605,0.002961311,0.001153673,0.002194473,0.002588887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001257705,"about_ca_system_score_gemma":0.002131897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003510129,"about_ca_topic_score_gemma":0.007282532,"domain_scores_codex":[0.9989838,0.0002394586,0.00005546591,0.0001982586,0.0002795311,0.0002434593],"domain_scores_gemma":[0.9973124,0.001795067,0.0002330464,0.0002937372,0.0002604935,0.0001052956],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006140052,0.0007813131,0.0009572333,0.001029798,0.0001276607,0.0001259019,0.0003020673,0.1797445,0.01420395,0.08961438,0.03454264,0.6779566],"study_design_scores_gemma":[0.0004551409,0.0003126558,0.0006172258,0.00005462321,0.0001037014,0.000222172,0.0003110107,0.7825714,0.01112218,0.1869453,0.01723836,0.00004634561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01558901,0.0005817622,0.9729431,0.0004820125,0.0001232398,0.000218129,0.0003146475,0.002505847,0.007242254],"genre_scores_gemma":[0.09696099,0.000621002,0.8948133,0.0001929667,0.0001104357,0.0003015967,0.00127704,0.0003787649,0.005343938],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01349604,"threshold_uncertainty_score":0.04514873,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2625464829","doi":"10.1051/ro/2017048","title":"Optimal power consumption control of sensor node based on (<i>N, D</i>)-policy discrete-time queues","year":2017,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"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":"Node (physics); Queue; Queueing theory; Computer science; Power control; Network packet; Transmission (telecommunications); Computer network; Sensor node; Wireless sensor network; Power (physics); Real-time computing; Mathematical optimization; Wireless; Key distribution in wireless sensor networks; Telecommunications; Mathematics; Wireless network; Engineering","authors":[{"name":"Renbin Liu","is_ca":false},{"name":"Attahiru Sule Alfa","is_ca":true},{"name":"Miaomiao Yu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03608862459387527,"gpt":0.360187388572784,"spread":0.3240987639789088,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001203174,0.0006590196,0.0007556035,0.0003655817,0.0005476549,0.001325353,0.001199115,0.0005405801,0.0008933839],"category_scores_gemma":[0.002268056,0.0003333932,0.0003816075,0.000473237,0.0008044725,0.001049999,0.0006250696,0.0007349612,0.00008756268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001737586,"about_ca_system_score_gemma":0.001651535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006761161,"about_ca_topic_score_gemma":0.004295795,"domain_scores_codex":[0.9992433,0.0001773076,0.00004104453,0.0002117664,0.0001334425,0.0001931409],"domain_scores_gemma":[0.9988542,0.0005775967,0.0002109764,0.00005650596,0.0001870167,0.0001137136],"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.0002737083,0.0001047766,0.001429494,0.0001006274,0.00004408712,0.00009979039,0.000127289,0.9523702,0.006970463,0.02345392,0.000632928,0.01439282],"study_design_scores_gemma":[0.00001400741,0.00002903612,0.00008776741,0.000001984605,0.000007243256,0.00000648916,0.00001510782,0.9969814,0.0005381099,0.002227482,0.00008746952,0.000003828075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1493853,0.0005596555,0.8458469,0.0005571116,0.0001079688,0.00007469499,0.00006203342,0.0002551879,0.003151084],"genre_scores_gemma":[0.9860162,0.0001605487,0.01286098,0.00005409274,0.00001732866,0.00003410978,0.00001538545,0.00001118955,0.0008302565],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006761161,"threshold_uncertainty_score":0.01344359,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3010623153","doi":"10.1051/ro/2019116","title":"Scheduling job shop problems with operators with respect to the maximum lateness","year":2020,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université du Québec à Chicoutimi","funders":"","keywords":"Operator (biology); Scheduling (production processes); Mathematical optimization; Job shop scheduling; Computer science; Duration (music); Job shop; Mathematics; Flow shop scheduling; Schedule","authors":[{"name":"Iméne Benkalaï","is_ca":true},{"name":"Djamal Rebaïne","is_ca":true},{"name":"Pierre Baptiste","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05790708007242472,"gpt":0.305543186624393,"spread":0.2476361065519683,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003905339,0.00125149,0.002025845,0.0007175168,0.0009324325,0.001676316,0.001549403,0.00113997,0.001594641],"category_scores_gemma":[0.005884242,0.000694879,0.0009403563,0.0009996835,0.001245366,0.002307419,0.001350544,0.001392552,0.0001909914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001189347,"about_ca_system_score_gemma":0.001664006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009104967,"about_ca_topic_score_gemma":0.0009441764,"domain_scores_codex":[0.998592,0.000651959,0.00007337078,0.0001950103,0.0002130006,0.0002747554],"domain_scores_gemma":[0.995743,0.002734446,0.0004879498,0.0002107171,0.0003000232,0.0005237569],"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.001062248,0.0002488663,0.001242486,0.0003888381,0.0001219296,0.0002919718,0.0002926791,0.9002981,0.01244321,0.05559472,0.001965214,0.02604968],"study_design_scores_gemma":[0.0002011528,0.000665613,0.0005150969,0.00002359166,0.00003577722,0.0001363314,0.00009635118,0.9070888,0.002158573,0.08752596,0.001522015,0.00003079822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2146936,0.0007343985,0.7788782,0.0004595216,0.0001254623,0.0002142334,0.0002842062,0.000316112,0.004294329],"genre_scores_gemma":[0.8615807,0.0004233532,0.132202,0.0001372476,0.0002079862,0.0002394122,0.0003411841,0.0001899249,0.004678251],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003905339,"threshold_uncertainty_score":0.02065367,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2767893134","doi":"10.1051/ro/2017086","title":"The cycle shop scheduling: mathematical model, properties and solution algorithms","year":2017,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Job shop scheduling; Heuristics; Mathematical optimization; Algorithm; Flow shop scheduling; Metaheuristic; Scheduling (production processes); Integer programming; Rate-monotonic scheduling; Schedule; Dynamic priority scheduling; Mathematics","authors":[{"name":"Bahman Naderia","is_ca":true},{"name":"Sheida Goharib","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1326806790402599,"gpt":0.3536112008502528,"spread":0.2209305218099929,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007935106,0.0009314682,0.0008536767,0.0007160375,0.0004457533,0.001213298,0.001102156,0.001026436,0.001426835],"category_scores_gemma":[0.001364511,0.0004610135,0.0008641985,0.001819957,0.0007204802,0.00133988,0.0005754574,0.001128707,0.0003876527],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001083464,"about_ca_system_score_gemma":0.001847574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004392376,"about_ca_topic_score_gemma":0.001901031,"domain_scores_codex":[0.9994739,0.0001725298,0.00002607912,0.00009871796,0.000179203,0.00004959379],"domain_scores_gemma":[0.9996558,0.000187424,0.00005168016,0.00002977619,0.0000590813,0.00001608635],"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.00004582551,0.00007044496,0.0005275302,0.0002781249,0.00004260094,0.0001229623,0.00008416224,0.814432,0.002263382,0.1216398,0.003639247,0.05685404],"study_design_scores_gemma":[0.00001038114,0.0000319162,0.0001117814,0.00001756117,0.00000949331,0.0000664224,0.00001852778,0.9506707,0.0004696727,0.04378799,0.004794942,0.00001054266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006424797,0.00212094,0.9861762,0.000318844,0.00007305428,0.00006284138,0.0001521553,0.0001540872,0.004517022],"genre_scores_gemma":[0.4423613,0.008781045,0.539914,0.0002339855,0.0004006279,0.0005339493,0.0007942176,0.0001515067,0.006829397],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004392376,"threshold_uncertainty_score":0.00873363,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091085418","doi":"10.1051/ro:2008007","title":"La différentiation automatique et son utilisation en optimisation","year":2008,"lang":"fr","type":"article","venue":"RAIRO - Operations Research","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Sketch; Computer science; Software; Focus (optics); Automatic differentiation; Software engineering; Key (lock); Ideal (ethics); Operations research; Engineering; Computer security; Programming language; Algorithm; Epistemology; Philosophy","authors":[{"name":"Jean‐Pierre Dussault","is_ca":true}],"retraction":null,"screen_n_in":0,"score":{"opus":0.148498466662761,"gpt":0.4375453487014911,"spread":0.2890468820387301,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005040761,0.001762232,0.001522708,0.001835458,0.0008823339,0.003515321,0.001392446,0.002070352,0.003910482],"category_scores_gemma":[0.01100115,0.0007245451,0.001512453,0.002970136,0.006619211,0.00413902,0.002118094,0.006580377,0.002221704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002400354,"about_ca_system_score_gemma":0.001386912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003867676,"about_ca_topic_score_gemma":0.002160908,"domain_scores_codex":[0.9946502,0.002498394,0.0003040466,0.0005626202,0.001804502,0.0001802358],"domain_scores_gemma":[0.995331,0.003309929,0.000214102,0.0005062155,0.0005509899,0.00008776419],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004687624,0.00001417091,0.0002157301,0.0003165714,0.00003596032,0.0000946406,0.0002977662,0.01919794,0.001497754,0.8829388,0.002982593,0.0923612],"study_design_scores_gemma":[0.00003451273,0.00007501083,0.0002996107,0.0002229675,0.00003346333,0.0003662811,0.00009320198,0.1313005,0.003982781,0.7135149,0.1500082,0.00006850506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003546846,0.02394135,0.9407453,0.002462039,0.0009076695,0.00002663031,0.00004691233,0.0003834342,0.02793983],"genre_scores_gemma":[0.2134035,0.03940357,0.7063138,0.00183332,0.002595413,0.0003182706,0.0001719246,0.001138911,0.03482137],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005040761,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994797589","doi":"10.1051/ro:2008008","title":"Asymptotic analysis of the trajectories of the logarithmic barrier algorithm without constraint qualifications","year":2008,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Logarithm; Differentiable function; Constraint (computer-aided design); Set (abstract data type); Mathematics; Multiplier (economics); Algorithm; Nonlinear system; Mathematical optimization; Computer science; Mathematical analysis; Geometry; Physics","authors":[{"name":"Abdelhamid Benchakroun","is_ca":true},{"name":"Jean‐Pierre Dussault","is_ca":true},{"name":"Khalid El Yassini","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.152142217960136,"gpt":0.4325296338383448,"spread":0.2803874158782088,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003140255,0.00116407,0.001013473,0.001234216,0.0006484468,0.001861122,0.001413381,0.001694906,0.005399509],"category_scores_gemma":[0.02660371,0.0004294714,0.0007148372,0.0006286753,0.002469372,0.002808531,0.002115781,0.002461428,0.0004983437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001812271,"about_ca_system_score_gemma":0.002073494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00426081,"about_ca_topic_score_gemma":0.001488385,"domain_scores_codex":[0.9993832,0.0002541136,0.00002260083,0.00009303998,0.0001350198,0.000112049],"domain_scores_gemma":[0.9919898,0.005488044,0.0007308626,0.0001952826,0.001153822,0.0004422387],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002780632,0.00008737574,0.002100572,0.0003388849,0.00006389845,0.0003356412,0.0003481392,0.5216265,0.005358301,0.4539098,0.001961048,0.01359171],"study_design_scores_gemma":[0.00001307638,0.00004618325,0.0001697027,0.00002871417,0.000007763374,0.00003069534,0.00004657598,0.9725246,0.0004994448,0.0261672,0.0004552897,0.00001077956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08895199,0.0008750467,0.8955207,0.001430654,0.00008656816,0.00008470067,0.0001248392,0.0002478828,0.01267756],"genre_scores_gemma":[0.9282563,0.001135773,0.04903021,0.0002798894,0.00007547296,0.0003035368,0.0003342087,0.0002549647,0.02032962],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005399509,"threshold_uncertainty_score":0.01806313,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160970399","doi":"10.1051/ro:2006011","title":"Numerical solutions of the mass transfer problem","year":2006,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Meromorphic and Entire Functions","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada; Australian Government","keywords":"Bounded function; Mathematics; Real line; Measure (data warehouse); Plane (geometry); Convergence (economics); Interval (graph theory); Rate of convergence; Numerical analysis; Function (biology); Transfer (computing); Line (geometry); Mass transfer; Transfer problem; Applied mathematics; Combinatorics; Mathematical optimization; Mathematical analysis; Computer science; Geometry; Physics","authors":[{"name":"Serge Dubuc","is_ca":true},{"name":"Issa Kagabo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1814456646088307,"gpt":0.3769839753734943,"spread":0.1955383107646635,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002228595,0.0007669331,0.0008755795,0.0008154286,0.0007012418,0.001219233,0.001057037,0.002385751,0.003506231],"category_scores_gemma":[0.01319934,0.0004044855,0.0004948121,0.000682298,0.002004498,0.001241275,0.001777355,0.001406633,0.000390862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001127389,"about_ca_system_score_gemma":0.00143198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003263957,"about_ca_topic_score_gemma":0.002325983,"domain_scores_codex":[0.9995657,0.0001835305,0.00002691428,0.00006119388,0.0001079231,0.00005473177],"domain_scores_gemma":[0.9955035,0.003418691,0.000321144,0.0002291159,0.0004023012,0.0001253107],"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.0001336871,0.00005582647,0.0006804317,0.00009045083,0.00002277718,0.00004943999,0.0001205737,0.8968553,0.001089191,0.07790081,0.0006922935,0.02230925],"study_design_scores_gemma":[0.00002533493,0.00001575606,0.00005037276,0.000009794892,0.000002742513,0.000009298139,0.00001654993,0.9821708,0.0003479095,0.01692492,0.0004215594,0.000004943595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05222172,0.0003943717,0.937086,0.0008926888,0.0001021293,0.0000703535,0.00006461728,0.0002399683,0.008928293],"genre_scores_gemma":[0.5745428,0.0002726107,0.4188183,0.000133597,0.00006562603,0.0003285597,0.0001088501,0.00009207418,0.00563774],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003506231,"threshold_uncertainty_score":0.0117861,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2593872908","doi":"10.1051/ro/2017011","title":"Lower and upper bounds for the linear arrangement problem on interval graphs","year":2017,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Chicoutimi","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Interval graph; Intersection graph; Mathematics; Interval (graph theory); Combinatorics; Indifference graph; Graph; Intersection (aeronautics); Upper and lower bounds; Discrete mathematics; Chordal graph; 1-planar graph; Line graph; Mathematical analysis","authors":[{"name":"Alain Quilliot","is_ca":false},{"name":"Djamal Rebaïne","is_ca":true},{"name":"Hélène Toussaint","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09050988374062498,"gpt":0.3953697445445166,"spread":0.3048598608038916,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005666245,0.003243553,0.002406136,0.003960003,0.002024496,0.0081731,0.006517542,0.003025908,0.02412657],"category_scores_gemma":[0.03614563,0.001395286,0.00270119,0.006913781,0.00263156,0.01549773,0.004835879,0.01081957,0.004627095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00476296,"about_ca_system_score_gemma":0.002465015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002991382,"about_ca_topic_score_gemma":0.003503189,"domain_scores_codex":[0.9913755,0.002125613,0.0003878238,0.001224926,0.002759758,0.002126278],"domain_scores_gemma":[0.9598809,0.03058739,0.001867972,0.003685244,0.002328009,0.001650329],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008707133,0.0006918469,0.002118712,0.001909569,0.0002195232,0.0002882768,0.0007334383,0.3501934,0.006126584,0.4342231,0.0366012,0.1660236],"study_design_scores_gemma":[0.00007056692,0.0002410818,0.001026005,0.0004241134,0.0001275278,0.0004192721,0.0003390297,0.5744355,0.003980474,0.3937266,0.02513503,0.00007479385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02962923,0.008839564,0.8853583,0.00535783,0.0005369792,0.0002658143,0.001925346,0.001778718,0.06630824],"genre_scores_gemma":[0.3272972,0.01007888,0.6293408,0.001926727,0.001832185,0.001180412,0.004945015,0.00212741,0.02127136],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02412657,"threshold_uncertainty_score":0.08071136,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154857537","doi":"10.1051/ro:2007028","title":"A note on tree realizations of matrices","year":2007,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Realization (probability); Diagonal; Tree (set theory); Mathematics; Combinatorics; Metric (unit); Class (philosophy); Zero (linguistics); Discrete mathematics; Computer science; Geometry; Statistics; Artificial intelligence; Engineering","authors":[{"name":"Alain Hertz","is_ca":true},{"name":"Sacha Varone","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1536482196114749,"gpt":0.4861941099809319,"spread":0.332545890369457,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006801841,0.0005320842,0.0007327767,0.0007106118,0.001144644,0.001480968,0.0005871385,0.00111455,0.007161839],"category_scores_gemma":[0.003495793,0.0004154553,0.0006870332,0.001145845,0.001213415,0.002670102,0.001453658,0.002195647,0.001466163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005841823,"about_ca_system_score_gemma":0.0004686876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001196311,"about_ca_topic_score_gemma":0.001690139,"domain_scores_codex":[0.9991912,0.0002508593,0.00003929349,0.0001558817,0.0002385036,0.0001242119],"domain_scores_gemma":[0.9982207,0.000856212,0.0002182567,0.0002036778,0.000212683,0.0002884332],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002580377,0.00001043585,0.0001987145,0.00003419598,0.000007200735,0.0001038044,0.0001063353,0.009632851,0.00229362,0.974445,0.002717085,0.01042492],"study_design_scores_gemma":[0.000009255194,0.000082116,0.0003190944,0.0000236222,0.000007708404,0.0001467457,0.0000662719,0.04781046,0.0009097062,0.9347683,0.0158345,0.00002218148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1470621,0.003469605,0.7510854,0.002132365,0.0005409875,0.00006078217,0.0005266948,0.0004767096,0.09464548],"genre_scores_gemma":[0.7763849,0.004661153,0.1932763,0.0008334481,0.00121529,0.0001978058,0.0008987027,0.0005438703,0.02198849],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007161839,"threshold_uncertainty_score":0.02395868,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166999867","doi":"10.1051/ro:2003002","title":"Optimal QoS control of interacting service stations","year":2002,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Advanced Queuing Theory Analysis","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":false},"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Queue; Network packet; Quality of service; Computer science; Monotonic function; Computer network; Queueing theory; Queue management system; Controller (irrigation); Mathematical optimization; Real-time computing; Mathematics","authors":[{"name":"Abdelkrim Haqiq","is_ca":false},{"name":"Ioannis Lambadaris","is_ca":true},{"name":"Noufissa Mikou","is_ca":false},{"name":"Luis Orozco–Barbosa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07844059589662435,"gpt":0.3581824464709942,"spread":0.2797418505743699,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001823073,0.001353856,0.00128029,0.0007229273,0.001195248,0.0025709,0.002464721,0.001832207,0.003801678],"category_scores_gemma":[0.005216893,0.0009955391,0.0006083797,0.0006922243,0.002026475,0.001484877,0.001897999,0.001580078,0.0004145623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003518821,"about_ca_system_score_gemma":0.002141819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01889208,"about_ca_topic_score_gemma":0.006884204,"domain_scores_codex":[0.9985393,0.0004197521,0.00005639266,0.0003016184,0.0002439265,0.0004390414],"domain_scores_gemma":[0.9972019,0.001229324,0.0005110163,0.0001292267,0.0004935699,0.0004349343],"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.0001498294,0.00005578329,0.0004339608,0.00002358065,0.00002462202,0.00009825103,0.00006524614,0.9805261,0.001540068,0.01257035,0.0001986805,0.004313482],"study_design_scores_gemma":[0.00002384585,0.00003400636,0.00008670522,0.000002170936,0.000007275763,0.00000459096,0.00001961323,0.9956337,0.0001620819,0.003897977,0.0001224244,0.000005703633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3886012,0.0004708945,0.5955207,0.001016537,0.0001470942,0.0001425577,0.0001593826,0.0004480805,0.01349363],"genre_scores_gemma":[0.9882993,0.0001057945,0.009388101,0.00003789442,0.00002828798,0.00004901602,0.00002943488,0.00001598997,0.002046313],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01889208,"threshold_uncertainty_score":0.03756422,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}