{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":26,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":26,"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":"6f8f446585a3","filters":{"venue":"4OR"}},"results":[{"id":"W1975320652","doi":"10.1007/s10288-005-0071-0","title":"Bilevel programming: A survey","year":2005,"lang":"en","type":"article","venue":"4OR","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":453,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Bilevel optimization; Class (philosophy); Simple (philosophy); Mathematical optimization; Computer science; Nonlinear programming; Quadratic programming; Quadratic equation; Linear programming; Nonlinear system; Mathematics; Optimization problem; Artificial intelligence; Epistemology","authors":[{"name":"Benoît Colson","is_ca":false},{"name":"Patrice Marcotte","is_ca":true},{"name":"Gilles Savard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03416886300847194,"gpt":0.2682684370357858,"spread":0.2340995740273139,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002609101,0.001752311,0.003290727,0.002194519,0.0008091701,0.004918254,0.002339618,0.002221325,0.00521886],"category_scores_gemma":[0.005621284,0.001648576,0.001557112,0.007537689,0.001470027,0.005335092,0.003097742,0.004509043,0.002653187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009416775,"about_ca_system_score_gemma":0.001721822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001508306,"about_ca_topic_score_gemma":0.001482547,"domain_scores_codex":[0.9982687,0.0004926682,0.0001653967,0.0004616823,0.0005173842,0.00009405702],"domain_scores_gemma":[0.9968314,0.002172618,0.000113331,0.0003156638,0.0004635591,0.000103484],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009892738,0.0003849809,0.001443494,0.003838329,0.0002024603,0.00008111071,0.0001654982,0.02426464,0.0005756574,0.1926196,0.02262275,0.7537026],"study_design_scores_gemma":[0.00006850674,0.0002650952,0.001500827,0.00172252,0.000170914,0.0008068123,0.0003304663,0.1687407,0.001680667,0.5401075,0.2844924,0.0001135101],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.003758857,0.4203731,0.5446454,0.003584704,0.0005874702,0.00007505934,0.0003462503,0.0004048547,0.0262242],"genre_scores_gemma":[0.06745701,0.6124957,0.3012641,0.00166934,0.003451701,0.0002478656,0.001218755,0.0006249939,0.01157056],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.00521886,"threshold_uncertainty_score":0.01745886,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017383000","doi":"10.1007/s10288-002-0009-8","title":"The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms","year":2003,"lang":"en","type":"article","venue":"4OR","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":334,"is_retracted":false,"has_abstract":false,"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":"Set (abstract data type); Computer science; Plan (archaeology); Destinations; Operations research; Algorithm; Mathematical optimization; Engineering; Mathematics; Geography; Programming language","authors":[{"name":"Jean-Fran�ois Cordeau","is_ca":true},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01277443178779052,"gpt":0.2283156917083634,"spread":0.2155412599205729,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00479664,0.001651171,0.003860016,0.001294024,0.00148296,0.005735183,0.005864343,0.006763476,0.007627253],"category_scores_gemma":[0.01660343,0.001633031,0.00213064,0.004567868,0.003070304,0.01179011,0.004385687,0.004154083,0.0008278997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002087992,"about_ca_system_score_gemma":0.002058789,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009737788,"about_ca_topic_score_gemma":0.006790852,"domain_scores_codex":[0.9966492,0.00167917,0.0001553726,0.0009098882,0.0002997157,0.0003065261],"domain_scores_gemma":[0.9929765,0.005194021,0.000617695,0.0004723416,0.0003893015,0.0003501241],"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.0000893316,0.0001358434,0.0009711398,0.0003679986,0.00009699129,0.0001565543,0.0001351338,0.4745326,0.00015581,0.4711137,0.01492016,0.03732466],"study_design_scores_gemma":[0.00002682704,0.00003360827,0.000190016,0.00005031082,0.000028947,0.0001318958,0.000113324,0.6421881,0.0001071093,0.351687,0.005411539,0.00003120672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01867987,0.003876516,0.9613453,0.004210703,0.0003693939,0.0001338407,0.0008548477,0.0001789503,0.01035054],"genre_scores_gemma":[0.5464395,0.007971244,0.4141618,0.0008860312,0.001427018,0.0005570328,0.001994111,0.0003070986,0.02625626],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009737788,"threshold_uncertainty_score":0.02551568,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088243692","doi":"10.1007/s10288-008-0089-1","title":"Variable neighbourhood search: methods and applications","year":2008,"lang":"en","type":"article","venue":"4OR","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":258,"is_retracted":false,"has_abstract":false,"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":"Metaheuristic; Heuristics; Neighbourhood (mathematics); Mathematical optimization; Computer science; Variable neighborhood search; Tabu search; Variable (mathematics); Heuristic; Simulated annealing; Local search (optimization); Mathematics","authors":[{"name":"Pierre Hansen","is_ca":true},{"name":"Nenad Mladenović","is_ca":false},{"name":"José Andrés Moreno Pérez","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03730997085608331,"gpt":0.3194639916222266,"spread":0.2821540207661433,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001475628,0.0006947499,0.001042906,0.001202156,0.000482896,0.001068124,0.00122457,0.00162568,0.004807254],"category_scores_gemma":[0.005246222,0.0004552846,0.0007011039,0.00185817,0.0008759905,0.001389503,0.001006443,0.001223565,0.001135182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005329819,"about_ca_system_score_gemma":0.0006317463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0033493,"about_ca_topic_score_gemma":0.003381332,"domain_scores_codex":[0.9993861,0.0003298396,0.00002071503,0.00008203197,0.000152161,0.00002914954],"domain_scores_gemma":[0.9985356,0.001036251,0.00008548537,0.0001049639,0.0002050539,0.00003259682],"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.00008900173,0.00007178227,0.0007054405,0.0004281713,0.00009937433,0.00005905201,0.0001545398,0.4518483,0.001102727,0.249188,0.008991936,0.2872617],"study_design_scores_gemma":[0.00002014391,0.0000226773,0.0001726921,0.00004266532,0.00001449791,0.0000292084,0.00001849401,0.9183522,0.0003288665,0.07247429,0.008510866,0.0000132434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002614791,0.002825878,0.9895813,0.0002082227,0.0001343887,0.00002331416,0.00005256989,0.0001056986,0.004453821],"genre_scores_gemma":[0.1639588,0.005924525,0.8004272,0.0002028272,0.0003692336,0.0003956422,0.0002956014,0.0002614584,0.02816475],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004807254,"threshold_uncertainty_score":0.01608187,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065109168","doi":"10.1007/s10288-006-0009-1","title":"An exact algorithm for team orienteering problems","year":2006,"lang":"en","type":"article","venue":"4OR","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":219,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Orienteering; Vehicle routing problem; Computer science; Routing (electronic design automation); Algorithm; Mathematical optimization; Operations research; Work (physics); Artificial intelligence; Mathematics; Engineering; Computer network","authors":[{"name":"Sylvain Boussier","is_ca":false},{"name":"Dominique Feillet","is_ca":false},{"name":"Michel Gendreau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01094155590089829,"gpt":0.2544370093960222,"spread":0.2434954534951239,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009539129,0.0009410456,0.001118109,0.0008362254,0.0007414589,0.0009945784,0.001757157,0.001704727,0.009491019],"category_scores_gemma":[0.003127586,0.0006103619,0.0008199707,0.001113548,0.0006965399,0.0015218,0.001930829,0.001356049,0.001468588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001073495,"about_ca_system_score_gemma":0.001869488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007179363,"about_ca_topic_score_gemma":0.008318025,"domain_scores_codex":[0.9994704,0.0001224534,0.00002520048,0.000100961,0.0001909283,0.00009006378],"domain_scores_gemma":[0.9993346,0.0003464104,0.00004204617,0.00010605,0.0001255485,0.00004528361],"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.0001181602,0.00009719985,0.0003058187,0.0001124778,0.0000376028,0.00005777985,0.0000785982,0.7327613,0.001341157,0.0380314,0.005523747,0.2215348],"study_design_scores_gemma":[0.00003950532,0.00002588515,0.00005826927,0.000009254923,0.00000829496,0.00001735037,0.00001239676,0.981361,0.0002540247,0.01642051,0.00178775,0.000005718517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004166926,0.0001058108,0.9902148,0.0001004219,0.00007388888,0.00004937801,0.00004927011,0.0003523915,0.00488707],"genre_scores_gemma":[0.1139229,0.000188553,0.8779942,0.0001391053,0.00006869551,0.000307123,0.0001914897,0.0002030865,0.006984822],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009491019,"threshold_uncertainty_score":0.03175062,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2179770505","doi":"10.1007/s10288-015-0301-z","title":"Shared mobility systems","year":2015,"lang":"en","type":"article","venue":"4OR","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":110,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval; HEC Montréal","funders":"","keywords":"Popularity; Incentive; Dimensioning; Computer science; Operations research; Open research; Transport engineering; Engineering; World Wide Web; Political science","authors":[{"name":"Gilbert Laporte","is_ca":true},{"name":"Frédéric Meunier","is_ca":false},{"name":"Roberto Wolfler Calvo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04176909962028166,"gpt":0.2400736198954986,"spread":0.1983045202752169,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001442544,0.001076655,0.0009043903,0.001237938,0.002618033,0.004765798,0.002835117,0.001735253,0.03322919],"category_scores_gemma":[0.004165538,0.0004974515,0.0008294936,0.001773049,0.001259308,0.006934903,0.01173811,0.001686821,0.007343167],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001654869,"about_ca_system_score_gemma":0.003544687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004162543,"about_ca_topic_score_gemma":0.004116951,"domain_scores_codex":[0.9976289,0.0004823212,0.0001591584,0.0005662823,0.0006202164,0.0005432744],"domain_scores_gemma":[0.9965746,0.0003598024,0.0002095125,0.001830639,0.0006488127,0.0003766007],"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.0003931224,0.0002364561,0.002181833,0.0002572196,0.0001647473,0.0004967349,0.0008607781,0.06340215,0.004792965,0.6559851,0.04764613,0.2235828],"study_design_scores_gemma":[0.0001453175,0.0003636606,0.001397159,0.0001634868,0.000187823,0.000649907,0.001146923,0.2563511,0.005921304,0.3985191,0.3350257,0.000128681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07403068,0.001461863,0.6752383,0.002835022,0.001590774,0.0006289727,0.002482997,0.006584437,0.2351471],"genre_scores_gemma":[0.8159944,0.0008844986,0.0830747,0.0005050422,0.0003680541,0.0005049637,0.002894531,0.0003586652,0.09541515],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03322919,"threshold_uncertainty_score":0.1111628,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069736946","doi":"10.1007/s10288-013-0238-z","title":"A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration","year":2013,"lang":"en","type":"article","venue":"4OR","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":73,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"TRIPS architecture; Vehicle routing problem; Duration (music); Column generation; Computer science; Set (abstract data type); Routing (electronic design automation); Mathematical optimization; Time complexity; Variable (mathematics); Algorithm; Mathematics; Parallel computing; Computer network","authors":[{"name":"Dominique Feillet","is_ca":false},{"name":"Rodolphe Giroudeau","is_ca":false},{"name":"Olivier Naud","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01179034511206651,"gpt":0.2266155954218323,"spread":0.2148252503097658,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008144233,0.0008267137,0.001184043,0.0007597284,0.0005223888,0.0008895861,0.001827124,0.001442613,0.005956143],"category_scores_gemma":[0.002392741,0.0006052779,0.0007221854,0.001085523,0.0004465586,0.001646405,0.001139728,0.001313963,0.001006628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008126027,"about_ca_system_score_gemma":0.002206006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007083558,"about_ca_topic_score_gemma":0.008469872,"domain_scores_codex":[0.9995306,0.00008664564,0.00002482491,0.00009652037,0.0001932847,0.00006826594],"domain_scores_gemma":[0.9994245,0.0002927074,0.00004338191,0.00006288195,0.0001418083,0.00003478405],"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.0001243136,0.0001223733,0.0003188853,0.0001414764,0.00005144408,0.00006927761,0.00005576879,0.7321978,0.002440509,0.02159222,0.005126282,0.2377597],"study_design_scores_gemma":[0.00003256025,0.00002282743,0.00004227169,0.000006571699,0.000006074246,0.00002006394,0.000006248843,0.9942223,0.00026842,0.003874473,0.001492717,0.000005389398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002885137,0.0001684528,0.9942943,0.00007139496,0.0001069626,0.00004063694,0.00004098429,0.0002987373,0.002093274],"genre_scores_gemma":[0.07213869,0.0002372099,0.9219146,0.0001266796,0.00009163186,0.0002385501,0.0001633234,0.0001325581,0.004956712],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007083558,"threshold_uncertainty_score":0.0199253,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159913713","doi":"10.1007/s10288-010-0145-5","title":"A large neighbourhood search heuristic for the aircraft and passenger recovery problem","year":2010,"lang":"en","type":"article","venue":"4OR","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":73,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Université de Montréal","funders":"HEC Montréal","keywords":"Iterated local search; Operations research; Schedule; Computer science; Heuristic; Context (archaeology); Neighbourhood (mathematics); Set (abstract data type); Vehicle routing problem; Randomness; Mathematical optimization; Local search (optimization); Routing (electronic design automation); Engineering; Mathematics; Artificial intelligence","authors":[{"name":"Serge Bisaillon","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Gilbert Laporte","is_ca":true},{"name":"Fédérico Pasin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01226322866122709,"gpt":0.2616284954726309,"spread":0.2493652668114038,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001134876,0.0005336555,0.001147057,0.001116436,0.000578378,0.0007114083,0.001539815,0.001820516,0.005908704],"category_scores_gemma":[0.003536076,0.0005133812,0.0007746968,0.0009731571,0.0008358104,0.001289546,0.001157254,0.0009446965,0.0005701643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001035306,"about_ca_system_score_gemma":0.001116578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005702635,"about_ca_topic_score_gemma":0.00678273,"domain_scores_codex":[0.9995186,0.0002575729,0.00001618947,0.00006060721,0.00009276772,0.00005415228],"domain_scores_gemma":[0.9985488,0.001128203,0.00008389558,0.0000653696,0.00009881159,0.00007487462],"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.0001517353,0.00009568384,0.0002057285,0.00007204399,0.00003517844,0.00007430292,0.00005169481,0.9415246,0.0008170345,0.01253157,0.002046129,0.04239422],"study_design_scores_gemma":[0.00004304429,0.00003645565,0.0000605668,0.000008737783,0.000007139982,0.00001367862,0.000009883751,0.9947001,0.0001162717,0.004339546,0.0006587657,0.000005813972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04970352,0.001027137,0.934738,0.0004895271,0.0002164552,0.0001504575,0.0001313636,0.0004013027,0.01314214],"genre_scores_gemma":[0.5154577,0.0004468369,0.4680098,0.0002540777,0.0001233855,0.0004007803,0.0003125414,0.0002137234,0.01478124],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005908704,"threshold_uncertainty_score":0.01976657,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2915617487","doi":"10.1007/s10288-019-00399-w","title":"A selective survey of game-theoretic models of closed-loop supply chains","year":2019,"lang":"en","type":"article","venue":"4OR","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Supply chain; Closed loop; Key (lock); Loop (graph theory); Function (biology); Mechanism (biology); Computer science; Business; Feedback loop; Process management; Industrial organization; Marketing; Engineering; Mathematics; Control engineering; Physics; Biology; Computer security","authors":[{"name":"Pietro De Giovanni","is_ca":false},{"name":"Georges Zaccour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01395160591642028,"gpt":0.2155881406602788,"spread":0.2016365347438585,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003386384,0.001477796,0.001725232,0.001882015,0.001280196,0.006142139,0.002985106,0.003392449,0.00612816],"category_scores_gemma":[0.009236961,0.001257057,0.001931629,0.004392368,0.00299637,0.008571827,0.001710418,0.003137148,0.000850877],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004192552,"about_ca_system_score_gemma":0.00264392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006253746,"about_ca_topic_score_gemma":0.004269629,"domain_scores_codex":[0.9975465,0.001180644,0.000121923,0.0003250926,0.0005621104,0.0002637575],"domain_scores_gemma":[0.993378,0.005182984,0.0003023594,0.0004516964,0.0004997764,0.0001852853],"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.00002146205,0.00005630101,0.0003321584,0.0002292845,0.00003439892,0.00004467738,0.0001419089,0.06095364,0.0001492488,0.9255032,0.001876342,0.01065743],"study_design_scores_gemma":[0.00001111302,0.00004345557,0.0002060764,0.0001619284,0.00002085733,0.00007380299,0.0001005982,0.1418497,0.00009442851,0.8427121,0.01470108,0.00002478618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.04841242,0.07790808,0.7383717,0.01171023,0.0004439321,0.0001601137,0.0008045124,0.0003091936,0.1218799],"genre_scores_gemma":[0.8318872,0.08666725,0.06153047,0.001454743,0.001240477,0.0002494075,0.0007032378,0.0001365472,0.01613055],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.006253746,"threshold_uncertainty_score":0.03041917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1704392916","doi":"10.1007/s10288-003-0024-4","title":"Ten notes on equal-processing-time scheduling","year":2004,"lang":"en","type":"article","venue":"4OR","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":54,"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":"Flow shop scheduling; Computer science; Scheduling (production processes); Time complexity; Parallel computing; Open shop; Job shop scheduling; Mathematical optimization; Distributed computing; Mathematics; Algorithm; Operating system; Schedule","authors":[{"name":"Philippe Baptiste","is_ca":false},{"name":"Peter Brucker","is_ca":false},{"name":"Sigrid Knust","is_ca":false},{"name":"VadimG. Timkovsky","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01453392840013306,"gpt":0.2361701264133302,"spread":0.2216361980131972,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006272464,0.001650557,0.00103488,0.001639692,0.001777984,0.003864008,0.002729265,0.002520196,0.02111627],"category_scores_gemma":[0.01772633,0.0005843641,0.000819784,0.004367762,0.006890966,0.01146096,0.003122824,0.01026299,0.002870358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003687953,"about_ca_system_score_gemma":0.001793956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003171748,"about_ca_topic_score_gemma":0.00271043,"domain_scores_codex":[0.9970995,0.0009619608,0.0001872084,0.0004649015,0.001041973,0.00024445],"domain_scores_gemma":[0.9901083,0.006782725,0.0002621603,0.001560403,0.000979107,0.000307467],"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.0001115158,0.00003378578,0.00009536539,0.0001084954,0.00001419141,0.00003568905,0.00007405761,0.006984445,0.0001924183,0.9026657,0.02749837,0.06218595],"study_design_scores_gemma":[0.00001834861,0.00002551177,0.00008356119,0.00009956628,0.00001023495,0.00003554417,0.00004727979,0.01397088,0.0004846942,0.9082602,0.07694373,0.00002040612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006353709,0.03960274,0.6656137,0.06187741,0.02331593,0.00009038533,0.0005223018,0.000362848,0.2022611],"genre_scores_gemma":[0.3071046,0.0706332,0.3324893,0.02431527,0.04754451,0.0004709234,0.0009973965,0.0009534549,0.2154913],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02111627,"threshold_uncertainty_score":0.07064104,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142847239","doi":"10.1007/s10288-005-0065-y","title":"Sensitivity of trust-region algorithms to their parameters","year":2005,"lang":"en","type":"article","venue":"4OR","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Sensitivity (control systems); Trust region; Context (archaeology); Algorithm; Computer science; Basis (linear algebra); Mathematics; Engineering; Computer security","authors":[{"name":"Nicholas I. M. Gould","is_ca":false},{"name":"Dominique Orban","is_ca":true},{"name":"Annick Sartenaer","is_ca":false},{"name":"Philippe L. Toint","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07648040350217998,"gpt":0.3576830103733677,"spread":0.2812026068711877,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02747599,0.002295046,0.002808618,0.002749449,0.00139143,0.004559305,0.003027193,0.004749334,0.004005685],"category_scores_gemma":[0.3209106,0.001739512,0.001478957,0.001944263,0.005080184,0.008487429,0.006247529,0.005681639,0.0009846434],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003705851,"about_ca_system_score_gemma":0.002912087,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003705472,"about_ca_topic_score_gemma":0.001583933,"domain_scores_codex":[0.9800698,0.01255262,0.0008051647,0.002050567,0.003539186,0.0009826156],"domain_scores_gemma":[0.6236502,0.3366373,0.01036859,0.01371927,0.01283482,0.002789835],"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.000786257,0.0001167027,0.001777877,0.0004396696,0.0001787941,0.00009371386,0.0002720637,0.8782306,0.002211513,0.07477852,0.002750772,0.03836348],"study_design_scores_gemma":[0.00004810029,0.0001304558,0.0004414426,0.00008036767,0.00003746015,0.0001003696,0.00005530885,0.9597586,0.002461665,0.03599607,0.0008559893,0.00003415629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03850332,0.00205089,0.951912,0.001168217,0.0001857475,0.0002218582,0.000282426,0.000621062,0.005054445],"genre_scores_gemma":[0.7269403,0.001759056,0.265028,0.000429235,0.0002106352,0.0005735082,0.0005207845,0.0007960585,0.003742415],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02747599,"threshold_uncertainty_score":0.1453087,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976996892","doi":"10.1007/s10288-014-0269-0","title":"A reliable affine relaxation method for global optimization","year":2014,"lang":"en","type":"article","venue":"4OR","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"Agence Nationale de la Recherche","keywords":"Interval (graph theory); Affine transformation; Interval arithmetic; Relaxation (psychology); Constraint (computer-aided design); Computation; Operator (biology); Mathematics; Mathematical optimization; Branch and bound; Affine arithmetic; Upper and lower bounds; Global optimization; Algorithm; Local consistency; Linear inequality; Linear programming relaxation; Linear programming; Inequality; Constraint satisfaction; Statistics; Combinatorics","authors":[{"name":"Jordan Ninin","is_ca":false},{"name":"Frédéric Messine","is_ca":false},{"name":"Pierre Hansen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01547858183578562,"gpt":0.3128095133241821,"spread":0.2973309314883965,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001620269,0.00131844,0.001250567,0.0009926845,0.0006606782,0.001205862,0.001645406,0.001709621,0.008823407],"category_scores_gemma":[0.005107614,0.0007904841,0.001157272,0.001061956,0.001099147,0.001542101,0.002122767,0.003766106,0.002710896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005411113,"about_ca_system_score_gemma":0.001175034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002498543,"about_ca_topic_score_gemma":0.00313767,"domain_scores_codex":[0.9990816,0.0003203213,0.00003836811,0.0001156299,0.0003947131,0.00004933064],"domain_scores_gemma":[0.9987166,0.0005152898,0.00009436253,0.000264901,0.0003498805,0.00005896896],"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.0001910003,0.0000819739,0.0002602054,0.0004140666,0.0001171088,0.0001313066,0.0001692173,0.5386562,0.009509152,0.2134437,0.01416085,0.2228651],"study_design_scores_gemma":[0.00001441411,0.00003218682,0.00004853321,0.00002409969,0.00001536477,0.00002869232,0.00000976601,0.9711879,0.001341338,0.0201236,0.0071594,0.00001459678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007413079,0.0001577831,0.9962749,0.00009149744,0.00008761384,0.00001703803,0.0000491024,0.0002105609,0.002370247],"genre_scores_gemma":[0.06753274,0.0005211533,0.919757,0.0002111517,0.0002294944,0.0002048752,0.0002798816,0.001037003,0.01022667],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008823407,"threshold_uncertainty_score":0.02951717,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979173729","doi":"10.1007/s10288-009-0108-x","title":"Attraction probabilities in variable neighborhood search","year":2009,"lang":"en","type":"article","venue":"4OR","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Royal Military College of Canada","funders":"","keywords":"Attraction; Variable (mathematics); Context (archaeology); Mathematical optimization; Operator (biology); Variable neighborhood search; Mathematics; Local search (optimization); Convergence (economics); Current (fluid); Global optimization; Computer science; Metaheuristic; Geography; Mathematical analysis; Physics; Economics","authors":[{"name":"Jack Brimberg","is_ca":true},{"name":"Pierre Hansen","is_ca":true},{"name":"Nenad Mladenović","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0234880472998658,"gpt":0.2850018022420008,"spread":0.261513754942135,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002756758,0.0003872931,0.001051209,0.001521303,0.001009552,0.001367123,0.001659171,0.00174759,0.006582774],"category_scores_gemma":[0.01889062,0.0006874386,0.0006116848,0.001299502,0.001840179,0.003145163,0.001645301,0.001526693,0.0004658956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001246708,"about_ca_system_score_gemma":0.0007802232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003443611,"about_ca_topic_score_gemma":0.00267918,"domain_scores_codex":[0.999095,0.0005140323,0.00002614166,0.00009303959,0.0002043963,0.00006756952],"domain_scores_gemma":[0.9934866,0.005550171,0.0002897903,0.0001979265,0.0003258408,0.0001496432],"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.0000703271,0.00003280422,0.0006943929,0.0001027595,0.00002485773,0.00004755956,0.00008968445,0.4763483,0.0002604224,0.4958504,0.001854211,0.02462409],"study_design_scores_gemma":[0.00001207222,0.0000130733,0.0001639573,0.0000190852,0.000006803517,0.00001653246,0.00001076761,0.895899,0.0001213377,0.102878,0.0008514427,0.000007904255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04383951,0.001320382,0.9347435,0.0008229009,0.0001821938,0.00008181546,0.00008476961,0.000156058,0.01876878],"genre_scores_gemma":[0.7759691,0.001018538,0.2016394,0.000294602,0.0002836245,0.0003869561,0.0001657212,0.0002037177,0.02003837],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006582774,"threshold_uncertainty_score":0.02202153,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022150528","doi":"10.1007/s10288-004-0057-3","title":"Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints","year":2005,"lang":"en","type":"article","venue":"4OR","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Bounding overwatch; Mathematical optimization; CONTEST; Polarization (electrochemistry); Frequency assignment; Computer science; Assignment problem; Mathematics; Algorithm; Artificial intelligence","authors":[{"name":"Alain Hertz","is_ca":true},{"name":"David Schindl","is_ca":false},{"name":"Nicolas Zufferey","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01363488760412227,"gpt":0.2470552419651835,"spread":0.2334203543610613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003606599,0.001555458,0.001915646,0.002724159,0.001660583,0.002743705,0.002924687,0.002675829,0.01914763],"category_scores_gemma":[0.01773713,0.001114126,0.001745432,0.004507561,0.001562718,0.002767835,0.002027354,0.004604132,0.003021196],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002129965,"about_ca_system_score_gemma":0.003298317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009088437,"about_ca_topic_score_gemma":0.01163637,"domain_scores_codex":[0.9970468,0.0015601,0.00008369688,0.000185328,0.0007235632,0.0004005678],"domain_scores_gemma":[0.9909615,0.007240686,0.000321284,0.0006369996,0.0006924847,0.0001469741],"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.0002106361,0.0002937643,0.0003471708,0.0002577122,0.00005504322,0.00005149076,0.0001933213,0.6652563,0.001124122,0.120267,0.01544564,0.1964979],"study_design_scores_gemma":[0.00004896284,0.00003182131,0.0001213138,0.00004894962,0.0000135533,0.00001897506,0.00003489372,0.945883,0.0005109124,0.05083692,0.002435249,0.0000154821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009944898,0.0006624335,0.9718363,0.0006771081,0.0001165874,0.0001897658,0.0003978469,0.0009853152,0.01518983],"genre_scores_gemma":[0.108384,0.0004986978,0.8809626,0.0003554459,0.0001307496,0.0008070896,0.0009623577,0.0008188743,0.007080217],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01914763,"threshold_uncertainty_score":0.0640552,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043306426","doi":"10.1007/s10288-002-0008-9","title":"Chemical trees enumeration algorithms","year":2003,"lang":"en","type":"article","venue":"4OR","topic":"Computational Drug Discovery Methods","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Enumeration; Computer science; Algorithm; Data structure; Computational complexity theory; Theoretical computer science; Scheme (mathematics); Point (geometry); Mathematics; Discrete mathematics; Programming language","authors":[{"name":"Roberto Aringhieri","is_ca":false},{"name":"Pierre Hansen","is_ca":true},{"name":"Federico Malucelli","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02231578831565209,"gpt":0.2953709018991213,"spread":0.2730551135834692,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009625853,0.0009115969,0.001111479,0.002328952,0.001711055,0.002742261,0.002319067,0.001881155,0.04704538],"category_scores_gemma":[0.004646962,0.0007063194,0.001724134,0.003505528,0.0007793037,0.003816444,0.002351591,0.003353064,0.01363447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001435419,"about_ca_system_score_gemma":0.002319716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001536999,"about_ca_topic_score_gemma":0.003497258,"domain_scores_codex":[0.9989738,0.000282156,0.00005498357,0.0002208265,0.0003518091,0.0001163433],"domain_scores_gemma":[0.9983513,0.0007476492,0.00008265263,0.0004797486,0.0002615571,0.00007713806],"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.0001406992,0.0002522978,0.0004897199,0.0003731865,0.00006708506,0.0000623687,0.00008020904,0.03803688,0.001559167,0.4836148,0.05688777,0.4184359],"study_design_scores_gemma":[0.0001017038,0.0000567663,0.0002153226,0.0001315859,0.0000607875,0.0001701384,0.00005548215,0.2180347,0.004269988,0.6771514,0.09972887,0.00002320482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01232798,0.003171607,0.8351288,0.003172957,0.0006864928,0.0004047682,0.002467,0.004000317,0.1386401],"genre_scores_gemma":[0.126578,0.00340194,0.7861274,0.001472479,0.000431854,0.0006237315,0.007008289,0.00125071,0.07310559],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04704538,"threshold_uncertainty_score":0.1573825,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966106967","doi":"10.1007/s10288-004-0056-4","title":"Solving the frequency assignment problem with polarization by local search and tabu","year":2005,"lang":"en","type":"article","venue":"4OR","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Mathematical optimization; Computer science; Algorithm; Polarization (electrochemistry); Guided Local Search; Frequency assignment; Mathematics; Telecommunications","authors":[{"name":"Philippe Galinier","is_ca":true},{"name":"Michel Gendreau","is_ca":false},{"name":"Patrick Soriano","is_ca":false},{"name":"Serge Bisaillon","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01318882992554685,"gpt":0.2480817877844851,"spread":0.2348929578589383,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001409108,0.0008395431,0.001410009,0.001310183,0.001017026,0.001162974,0.001706175,0.001932608,0.007774634],"category_scores_gemma":[0.005020731,0.0007227128,0.0009239114,0.001532591,0.001022872,0.001942589,0.001346851,0.00189574,0.001167352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007841185,"about_ca_system_score_gemma":0.001352761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003049329,"about_ca_topic_score_gemma":0.003085554,"domain_scores_codex":[0.9992486,0.0004025213,0.00001936969,0.00007875329,0.0001299851,0.0001208019],"domain_scores_gemma":[0.9979318,0.001584814,0.0001098327,0.0001617737,0.0001474319,0.00006440342],"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.0002267556,0.0002130767,0.0005630402,0.0001117036,0.00006293984,0.00004859803,0.00009778762,0.8612989,0.001334769,0.01666424,0.004190132,0.1151881],"study_design_scores_gemma":[0.00007467761,0.00004170992,0.00008307271,0.00001030243,0.00001251621,0.00001712676,0.0000409629,0.982325,0.0003851306,0.0164842,0.0005183318,0.000007059651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06230468,0.0003797431,0.9252407,0.0005659699,0.00008506467,0.00009441319,0.0001345645,0.0007639644,0.01043084],"genre_scores_gemma":[0.4439035,0.0002110397,0.5497869,0.0003054156,0.00009946006,0.0003395494,0.0003218842,0.0003256143,0.004706511],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007774634,"threshold_uncertainty_score":0.02600873,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029358090","doi":"10.1007/s10288-008-0088-2","title":"Analysis of stationary discrete-time GI/D-MSP/1 queue with finite and infinite buffers","year":2008,"lang":"en","type":"article","venue":"4OR","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Markovian arrival process; Markov chain; Discrete time and continuous time; Queue; Computer science; Epoch (astronomy); Queueing theory; Renewal theory; Applied mathematics; Markov process; Bulk queue; Mathematics; Mathematical optimization; Statistics; Computer network","authors":[{"name":"S. K. Samanta","is_ca":false},{"name":"Umesh Gupta","is_ca":false},{"name":"M. L. Chaudhry","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00906742964980874,"gpt":0.2118071467518994,"spread":0.2027397171020907,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002544447,0.001041129,0.001216776,0.001686976,0.001084565,0.002281411,0.00270125,0.0009556996,0.0034861],"category_scores_gemma":[0.006507974,0.0006507136,0.001095628,0.0009950598,0.001803999,0.002317043,0.001425074,0.001434945,0.000277323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004649709,"about_ca_system_score_gemma":0.003434859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01744803,"about_ca_topic_score_gemma":0.008590983,"domain_scores_codex":[0.9990526,0.0002101986,0.00003133439,0.000152015,0.0002589887,0.0002948447],"domain_scores_gemma":[0.9967417,0.001770103,0.0003199071,0.0001084484,0.0007609396,0.0002989522],"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.0002758591,0.0001394433,0.00275259,0.0002404991,0.0001038278,0.0005297259,0.0002853996,0.6357976,0.007245832,0.3396336,0.003797299,0.009198408],"study_design_scores_gemma":[0.000004866206,0.0000111097,0.0001650293,0.000004629841,0.000009292204,0.00002174517,0.00001735734,0.992137,0.0001876904,0.007331066,0.0001038422,0.000006240061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1952773,0.002409662,0.7855613,0.001888106,0.0003290555,0.0001118506,0.0003399499,0.0004721062,0.01361062],"genre_scores_gemma":[0.9752597,0.0006196227,0.01699236,0.0002044194,0.0001668121,0.00004389823,0.0001519261,0.0000878279,0.006473514],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01744803,"threshold_uncertainty_score":0.03469294,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978730351","doi":"10.1007/s10288-011-0169-5","title":"Locating a general minisum ‘circle’ on the plane","year":2011,"lang":"en","type":"article","venue":"4OR","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"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":"Unit circle; Norm (philosophy); Mathematics; Combinatorics; Regular polygon; Euclidean geometry; Convex body; Euclidean distance; Scaling; Boundary (topology); Unit sphere; Plane (geometry); Great circle; Geometry; Mathematical analysis; Convex hull","authors":[{"name":"Jack Brimberg","is_ca":true},{"name":"Henrik Juel","is_ca":false},{"name":"Mark-Christoph Körner","is_ca":false},{"name":"Anita Schöbel","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05103679673092494,"gpt":0.2323024574442691,"spread":0.1812656607133441,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006046278,0.0006388114,0.0009837502,0.001286789,0.001498181,0.001766525,0.001568214,0.002343138,0.01284661],"category_scores_gemma":[0.003375673,0.0006050172,0.0005658102,0.0008296279,0.001372009,0.002537698,0.004334347,0.001157342,0.005038951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006553081,"about_ca_system_score_gemma":0.0006406546,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000586219,"about_ca_topic_score_gemma":0.0007088975,"domain_scores_codex":[0.9993829,0.0001238102,0.00003159402,0.0001973179,0.0001707332,0.00009372381],"domain_scores_gemma":[0.9992722,0.0001947551,0.00007181072,0.0002273548,0.0001602043,0.00007369533],"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.001431601,0.0001090504,0.00263824,0.000607801,0.00006478275,0.001396792,0.001898777,0.05916301,0.06448752,0.6145828,0.02014672,0.233473],"study_design_scores_gemma":[0.0001713414,0.0005887116,0.001564609,0.000215997,0.00007267822,0.002575791,0.001333438,0.4581993,0.09673941,0.2622383,0.1761209,0.000179541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1484605,0.000475994,0.7869186,0.001047459,0.0005762461,0.0001620724,0.000267808,0.001417366,0.06067405],"genre_scores_gemma":[0.5491922,0.0002310922,0.4287155,0.0001903349,0.00008642271,0.0001346957,0.0002764754,0.0004965568,0.02067664],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01284661,"threshold_uncertainty_score":0.0429762,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083976288","doi":"10.1007/s10288-007-0060-6","title":"A linear programming approach to highly precise clock synchronization over a packet network","year":2007,"lang":"en","type":"article","venue":"4OR","topic":"Network Time Synchronization Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Clock synchronization; Computer science; Network packet; Synchronization (alternating current); Clock drift; Real-time computing; Computer network; Parallel computing","authors":[{"name":"Renaud Sirdey","is_ca":false},{"name":"F. Maurice","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01082181854792762,"gpt":0.2429955719175654,"spread":0.2321737533696378,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00127096,0.0007818517,0.0007425893,0.000461971,0.0004537113,0.00115197,0.001186187,0.0008813415,0.003929578],"category_scores_gemma":[0.003072163,0.0006553793,0.0006322722,0.0009597263,0.000817542,0.001277245,0.001273736,0.002025271,0.0003734866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001019572,"about_ca_system_score_gemma":0.001468711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006265044,"about_ca_topic_score_gemma":0.004893366,"domain_scores_codex":[0.999271,0.0002958277,0.00002546708,0.0001156445,0.0002118747,0.00008013898],"domain_scores_gemma":[0.998714,0.0009885415,0.00007537868,0.0000450984,0.0001372549,0.00003971094],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002654723,0.00003290449,0.00008930525,0.00004503317,0.00002008953,0.00003524417,0.00004888356,0.8739756,0.00107137,0.1054421,0.001125504,0.01808738],"study_design_scores_gemma":[0.000003636776,0.00001161206,0.00001109104,0.000002570505,0.000003860298,0.000003277492,0.000004740958,0.9826592,0.0001748491,0.01668111,0.0004414276,0.000002578548],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001506898,0.00006066063,0.9967713,0.0001136025,0.00002000102,0.000009932501,0.00001501698,0.00004292823,0.001459739],"genre_scores_gemma":[0.3906611,0.0009511271,0.5831636,0.0003687623,0.0003273347,0.0003589155,0.000139281,0.0002276391,0.02380213],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006265044,"threshold_uncertainty_score":0.01314574,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4292074987","doi":"10.1007/s10288-022-00520-6","title":"A bilevel optimization model for the newsvendor problem with the focus theory of choice","year":2022,"lang":"en","type":"article","venue":"4OR","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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 Windsor","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Newsvendor model; Bilevel optimization; Focus (optics); Mathematical optimization; Economic order quantity; Minimax; Order (exchange); Perspective (graphical); Computer science; Upper and lower bounds; Optimization problem; Mathematical economics; Mathematics; Economics; Artificial intelligence","authors":[{"name":"Xide Zhu","is_ca":false},{"name":"Kevin Li","is_ca":true},{"name":"Peijun Guo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03215700315270644,"gpt":0.2129238591767938,"spread":0.1807668560240874,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00191387,0.001114619,0.002619398,0.0008427018,0.0007386766,0.003880049,0.001834043,0.004125584,0.0103103],"category_scores_gemma":[0.006575684,0.00103812,0.00115166,0.001574739,0.001861391,0.003965795,0.002200312,0.003138419,0.001040856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00215068,"about_ca_system_score_gemma":0.001713234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006185812,"about_ca_topic_score_gemma":0.00385863,"domain_scores_codex":[0.9990764,0.0004513148,0.00003484603,0.0001893489,0.0001141967,0.0001338578],"domain_scores_gemma":[0.9976246,0.00174363,0.0001832464,0.000070982,0.0001957024,0.0001818138],"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.0001175605,0.00007631881,0.000309813,0.0001276946,0.00007285309,0.0001967005,0.0001555753,0.4599336,0.0003373018,0.5262989,0.003556588,0.008817121],"study_design_scores_gemma":[0.00005792776,0.00004272788,0.00009287239,0.00002211345,0.00002394621,0.00003501852,0.00005144758,0.7962692,0.0000660784,0.2010911,0.002225316,0.00002215723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03577723,0.002132939,0.9191143,0.004749245,0.0001727093,0.00007505934,0.0005115419,0.0002119096,0.03725499],"genre_scores_gemma":[0.858548,0.002257723,0.07883862,0.0004155241,0.000260693,0.0002690797,0.0004363622,0.000129359,0.0588447],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0103103,"threshold_uncertainty_score":0.03449136,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2074959750","doi":"10.1007/s10288-004-0043-9","title":"Variations on the Roy-Gallai theorem","year":2005,"lang":"en","type":"article","venue":"4OR","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"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":"Generalization; Mathematics; Chromatic scale; Simple (philosophy); Combinatorics; Graph; Extension (predicate logic); Elementary proof; Discrete mathematics; Computer science; Mathematical analysis","authors":[{"name":"D. de Werra","is_ca":false},{"name":"Pierre Hansen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03277067882961263,"gpt":0.2873123825077866,"spread":0.254541703678174,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00354128,0.001248666,0.001550338,0.003800638,0.002262189,0.00353796,0.002466647,0.002100733,0.01811353],"category_scores_gemma":[0.009663516,0.0005193474,0.001665145,0.002684891,0.005312213,0.009250031,0.00538103,0.005382017,0.003887821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002692299,"about_ca_system_score_gemma":0.0008872578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00264295,"about_ca_topic_score_gemma":0.002055383,"domain_scores_codex":[0.9976819,0.0009677976,0.00008624924,0.0004587076,0.0006182031,0.0001871874],"domain_scores_gemma":[0.996738,0.00156409,0.0002523627,0.0006025475,0.0005279882,0.0003149252],"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.000007811961,0.000004458424,0.00003839717,0.0000230818,0.000004817681,0.00001885285,0.00006655858,0.0002208956,0.0001047052,0.994736,0.002304509,0.002469826],"study_design_scores_gemma":[0.000005918867,0.000005576012,0.00007588269,0.00001246077,0.00000630431,0.0000432393,0.00002459585,0.001177071,0.00009268632,0.9879102,0.01063675,0.000009475785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.04207828,0.01491443,0.2738656,0.02347106,0.003923781,0.00008244655,0.0008159998,0.000777581,0.6400708],"genre_scores_gemma":[0.6908184,0.01200007,0.1080289,0.007011445,0.006536813,0.0003290455,0.0006004467,0.001130801,0.173544],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01811353,"threshold_uncertainty_score":0.06059575,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075014621","doi":"10.1007/s10288-012-0208-x","title":"Bicriteria optimization in the newsvendor problem with uniformly distributed demand","year":2012,"lang":"en","type":"article","venue":"4OR","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Social Sciences and Humanities Research Council of Canada","keywords":"Newsvendor model; Mathematical optimization; Computer science; Key (lock); Simple (philosophy); Variable (mathematics); Profit (economics); Optimization problem; Mathematics; Economics","authors":[{"name":"F. J. Arcelus","is_ca":true},{"name":"Satyendra Kumar","is_ca":false},{"name":"G. Srinivasan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01635557901820086,"gpt":0.2077502825516955,"spread":0.1913947035334947,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004134818,0.001484494,0.003967805,0.001120339,0.0006432796,0.002998821,0.001790698,0.002978558,0.007957247],"category_scores_gemma":[0.01273617,0.001540538,0.0008819061,0.001397882,0.002414756,0.002941895,0.00160109,0.002529904,0.0009881509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002022811,"about_ca_system_score_gemma":0.001169154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004488585,"about_ca_topic_score_gemma":0.002718966,"domain_scores_codex":[0.9982205,0.001081528,0.00006779995,0.0002669998,0.0001521135,0.0002109998],"domain_scores_gemma":[0.99208,0.006356484,0.0005776354,0.0002654237,0.0004110476,0.000309388],"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.0004773838,0.00007831848,0.0003488513,0.0001805688,0.0001045763,0.0001719267,0.0000926786,0.8484869,0.0003579516,0.1367364,0.004773849,0.008190637],"study_design_scores_gemma":[0.0000897941,0.00005953394,0.0001425712,0.00002634896,0.00001857264,0.00003670678,0.00004839803,0.9225523,0.0001278844,0.07601716,0.0008565415,0.00002408265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1475145,0.003981116,0.8016257,0.005430617,0.0003544119,0.0001756346,0.0009926552,0.0005087195,0.03941668],"genre_scores_gemma":[0.9262711,0.001510375,0.04152434,0.0004263445,0.0001915526,0.0002191832,0.0004937721,0.0001971574,0.02916611],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007957247,"threshold_uncertainty_score":0.02661967,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4389131017","doi":"10.1007/s10288-023-00556-2","title":"A survey of attended home delivery and service problems with a focus on applications","year":2023,"lang":"en","type":"article","venue":"4OR","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Work (physics); Coronavirus disease 2019 (COVID-19); Service (business); Service delivery framework; Focus (optics); Pandemic; Engineering; Business; Marketing; Medicine","authors":[{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Manuel Iori","is_ca":false},{"name":"Dario Vezzali","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0240314354903449,"gpt":0.220609661804598,"spread":0.1965782263142531,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001164691,0.0003113814,0.0003707072,0.005107145,0.001169251,0.001217202,0.0008372798,0.001156255,0.009460732],"category_scores_gemma":[0.007164787,0.000303664,0.0006908769,0.007282697,0.0005992188,0.001599139,0.001150606,0.0009405746,0.00122426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001203383,"about_ca_system_score_gemma":0.002191655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01191808,"about_ca_topic_score_gemma":0.01660946,"domain_scores_codex":[0.9977326,0.0005250335,0.0003581256,0.0002122354,0.000741803,0.0004301296],"domain_scores_gemma":[0.9923404,0.003104576,0.001878465,0.0001675022,0.001574702,0.0009343059],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0002577507,0.0009586432,0.7608203,0.001498071,0.00008093583,0.001955235,0.009954054,0.0004196832,0.001112732,0.001866925,0.02293049,0.1981452],"study_design_scores_gemma":[0.00001130158,0.00054302,0.875877,0.0006257963,0.00007007075,0.004698797,0.03860445,0.0004684935,0.0004585963,0.000348729,0.07825455,0.00003909818],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9583839,0.0141569,0.001247068,0.003853668,0.0001104265,0.0001890137,0.002889963,0.00007398473,0.01909504],"genre_scores_gemma":[0.9217177,0.04016806,0.002813486,0.002555406,0.0002187164,0.0001974893,0.00554969,0.00009553574,0.0266838],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01191808,"threshold_uncertainty_score":0.03164923,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3175105319","doi":"10.1007/s10288-021-00486-x","title":"Measures of balance in combinatorial optimization","year":2021,"lang":"en","type":"article","venue":"4OR","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Balance (ability); Computer science; Measure (data warehouse); Balance problems; Risk analysis (engineering); Psychology; Data mining; Business","authors":[{"name":"Philippe Olivier","is_ca":true},{"name":"Andrea Lodi","is_ca":true},{"name":"Gilles Pesant","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0166743040082642,"gpt":0.2297974208121571,"spread":0.2131231168038929,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008477011,0.001630511,0.001701789,0.00770422,0.001329418,0.00470772,0.001618639,0.001605912,0.00773227],"category_scores_gemma":[0.03922605,0.0007301887,0.0008469074,0.007517302,0.003894384,0.01120965,0.002650914,0.002516248,0.000618137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002894337,"about_ca_system_score_gemma":0.0008682118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001246685,"about_ca_topic_score_gemma":0.0009454601,"domain_scores_codex":[0.9946122,0.002607519,0.0002414199,0.0005416151,0.001655871,0.0003413904],"domain_scores_gemma":[0.9820861,0.01258059,0.001715645,0.001304521,0.001476677,0.0008365343],"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.0001629831,0.00007169991,0.001724559,0.0001446915,0.00009391194,0.00002900884,0.0001377751,0.04427546,0.0007220512,0.9038051,0.002794191,0.04603876],"study_design_scores_gemma":[0.00001741564,0.00008280566,0.001052262,0.00006764114,0.00002829011,0.00004120004,0.00009213532,0.1031764,0.0004736031,0.8917128,0.003234064,0.00002133642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1101172,0.005338165,0.8235773,0.002708531,0.0003507656,0.0001406887,0.0009305885,0.0004000097,0.05643678],"genre_scores_gemma":[0.866935,0.002248733,0.1168259,0.0004218514,0.0006114532,0.0004268831,0.0008672139,0.0002800788,0.01138294],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008477011,"threshold_uncertainty_score":0.04483128,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1469087774","doi":"10.1007/s10288-015-0295-6","title":"A simple method to obtain the stochastic decomposition structure of the busy period in Geo/Geo/1/N vacation queue","year":2015,"lang":"en","type":"article","venue":"4OR","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"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":"Correctness; Simple (philosophy); Computer science; Queue; Reliability (semiconductor); Period (music); Mathematics; Mathematical optimization; Applied mathematics; Algorithm; Computer network","authors":[{"name":"Miaomiao Yu","is_ca":true},{"name":"Attahiru Sule Alfa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01383423744884959,"gpt":0.29374607956287,"spread":0.2799118421140204,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006313942,0.0006263219,0.0005603477,0.001170313,0.0005981583,0.0007006948,0.0008875479,0.0005356628,0.006308467],"category_scores_gemma":[0.001926312,0.000286211,0.0009097709,0.001042815,0.0004045954,0.0009643845,0.000772518,0.001368124,0.00114425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007390575,"about_ca_system_score_gemma":0.001662569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007005345,"about_ca_topic_score_gemma":0.009976555,"domain_scores_codex":[0.9997205,0.00004957799,0.0000189174,0.00006169632,0.0001019679,0.00004728166],"domain_scores_gemma":[0.9995311,0.0001364587,0.00004455389,0.00006293138,0.0001726035,0.00005223334],"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.000252808,0.000319901,0.004613759,0.0003672194,0.0001772998,0.0005441586,0.0004732499,0.1970763,0.05943279,0.4310808,0.01666964,0.2889921],"study_design_scores_gemma":[0.00003501871,0.00003544249,0.001602811,0.00002025704,0.00003470983,0.000202187,0.0000391184,0.9257423,0.003146222,0.06404882,0.005046318,0.00004684199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005840723,0.0001094333,0.991714,0.00009056305,0.00009581123,0.00006846627,0.000152719,0.0001768128,0.001751474],"genre_scores_gemma":[0.259244,0.0005836374,0.7243878,0.0002689982,0.0002598309,0.0004550673,0.0007069897,0.0002024806,0.01389122],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007005345,"threshold_uncertainty_score":0.02110392,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2768981582","doi":"10.1007/s10288-017-0362-2","title":"The inventory replenishment planning and staggering problem: a bi-objective approach","year":2017,"lang":"en","type":"article","venue":"4OR","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Université Laval","keywords":"Mathematical optimization; Pareto principle; Multi-objective optimization; Computer science; Decision maker; Population; Pareto optimal; Order (exchange); Space (punctuation); Operations research; Mathematics; Economics","authors":[{"name":"Fayez F. Boctor","is_ca":true},{"name":"Marie-Claude Bolduc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02579070386469375,"gpt":0.287191586310707,"spread":0.2614008824460133,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004797067,0.003065026,0.003552308,0.003933615,0.0008950317,0.004244426,0.003669949,0.003903294,0.006862787],"category_scores_gemma":[0.005279656,0.001776545,0.002077361,0.005119412,0.000969939,0.003525747,0.002719023,0.002861651,0.0008810591],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001546805,"about_ca_system_score_gemma":0.002613167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006450635,"about_ca_topic_score_gemma":0.005803564,"domain_scores_codex":[0.9970376,0.001325167,0.0001402454,0.0002969904,0.0009313041,0.0002686047],"domain_scores_gemma":[0.9981762,0.001040117,0.0001885144,0.00009996755,0.0003228608,0.0001723935],"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.00007428718,0.000186541,0.0003747795,0.0002871296,0.0001803778,0.00009729106,0.00002887598,0.9549751,0.0005770908,0.01384731,0.001381384,0.02798985],"study_design_scores_gemma":[0.000008366706,0.00003745077,0.00009813547,0.00001830925,0.00002272719,0.00001760414,0.000009865566,0.9954743,0.0001093386,0.003692821,0.0005030035,0.000008211126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01488626,0.00209492,0.9700732,0.0007577525,0.0001954812,0.0002380405,0.0005230274,0.0002034669,0.01102787],"genre_scores_gemma":[0.3490508,0.003440041,0.6247762,0.0005724163,0.0004035968,0.0009624918,0.0009090782,0.0003128133,0.01957255],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006862787,"threshold_uncertainty_score":0.02536964,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010203453","doi":"10.1007/s10288-014-0260-9","title":"Approximating the length of Chinese postman tours","year":2014,"lang":"en","type":"article","venue":"4OR","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Unit square; Combinatorics; Square (algebra); Simple (philosophy); Mathematics; Function (biology); Planar; Unit (ring theory); Arc length; Computer science; Discrete mathematics; Geometry; Arc (geometry)","authors":[{"name":"Nathalie Bostel","is_ca":false},{"name":"Philippe Castagliola","is_ca":false},{"name":"Pierre Dejax","is_ca":false},{"name":"André Langevin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007203520721262863,"gpt":0.2381229902906437,"spread":0.2309194695693808,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001489744,0.001075581,0.0007489599,0.0016867,0.0006587621,0.001203334,0.00193841,0.001295837,0.00680166],"category_scores_gemma":[0.007425737,0.0007496411,0.0007781205,0.001539675,0.001003941,0.00181456,0.001349994,0.001455646,0.0004981823],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003347012,"about_ca_system_score_gemma":0.002332639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01944232,"about_ca_topic_score_gemma":0.0234562,"domain_scores_codex":[0.9995589,0.0001399504,0.00001496621,0.00009875328,0.00009316912,0.00009417911],"domain_scores_gemma":[0.9972289,0.001876646,0.0002156972,0.0001607521,0.0003536471,0.000164319],"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.0001494232,0.00003147961,0.001474531,0.00009273643,0.00002355843,0.00004608007,0.00008334852,0.9359615,0.0006864525,0.03794826,0.00274344,0.02075901],"study_design_scores_gemma":[0.000003879348,0.00001145405,0.0001651427,0.000008283531,0.000003159903,0.000006643062,0.00001479942,0.992844,0.0001747181,0.006318259,0.0004461762,0.00000340309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1726056,0.0008927176,0.8098432,0.0007489678,0.0002193322,0.0001022763,0.0007267501,0.0003757401,0.01448532],"genre_scores_gemma":[0.748868,0.0007925897,0.2263874,0.000174872,0.0001307146,0.0002452317,0.001132561,0.0004261132,0.02184254],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01944232,"threshold_uncertainty_score":0.03865832,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}