{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":25,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":25,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"381b769beff3","filters":{"venue":"Top"}},"results":[{"id":"W2082772228","doi":"10.1007/s11750-007-0009-0","title":"Static pickup and delivery problems: a classification scheme and survey","year":2007,"lang":"en","type":"article","venue":"Top","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":698,"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":"Pickup; Scheme (mathematics); Computer science; Vehicle routing problem; Class (philosophy); Classification scheme; Routing (electronic design automation); Field (mathematics); Operations research; Mathematical optimization; Artificial intelligence; Data science; Computer network; Mathematics","authors":[{"name":"Gerardo Berbeglia","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Irina Gribkovskaia","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04328352270591027,"gpt":0.2781970216619149,"spread":0.2349134989560046,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001720403,0.001719556,0.002199367,0.004572636,0.0009548308,0.003098194,0.002864777,0.002036686,0.002811786],"category_scores_gemma":[0.002747904,0.0008342261,0.002016211,0.008736901,0.001280136,0.004663416,0.001497338,0.002074168,0.001162388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009122725,"about_ca_system_score_gemma":0.001255642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001827293,"about_ca_topic_score_gemma":0.001841101,"domain_scores_codex":[0.998473,0.0002239024,0.0001421542,0.0004126121,0.0006025203,0.000145828],"domain_scores_gemma":[0.9981939,0.0009195559,0.0002332397,0.0001376791,0.0004157427,0.00009985088],"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.00009838361,0.0006001611,0.005860186,0.003159273,0.0001810109,0.0001889155,0.0002064837,0.05890815,0.00149568,0.0891289,0.02634109,0.8138318],"study_design_scores_gemma":[0.00006195868,0.0007916961,0.00902904,0.0015903,0.0003849045,0.003322335,0.001047626,0.5006545,0.003166365,0.2025061,0.2772492,0.0001959554],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.02602584,0.2756274,0.6511909,0.003877621,0.0009138039,0.0003262002,0.0006116644,0.0003228284,0.04110382],"genre_scores_gemma":[0.1977803,0.5082449,0.2548769,0.001371157,0.004898686,0.0004570435,0.002475266,0.000287235,0.02960849],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.004572636,"threshold_uncertainty_score":0.009406388,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2626188202","doi":"10.1007/s11750-017-0451-6","title":"On learning and branching: a survey","year":2017,"lang":"en","type":"article","venue":"Top","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":174,"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":"Computer science; Integer programming; Artificial intelligence; Branching (polymer chemistry); Heuristic; Machine learning; Field (mathematics); Branch and bound; Variable (mathematics); Computational learning theory; Mathematical optimization; Theoretical computer science; Active learning (machine learning); Algorithm; Mathematics","authors":[{"name":"Andrea Lodi","is_ca":true},{"name":"Giulia Zarpellon","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01682463045290404,"gpt":0.2971222359018433,"spread":0.2802976054489392,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004182342,0.001974576,0.004471516,0.004327898,0.001947443,0.007631264,0.00361677,0.002860167,0.01365822],"category_scores_gemma":[0.01402655,0.001490597,0.001851895,0.01440863,0.003641752,0.01540475,0.004254254,0.006183392,0.005151115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002939692,"about_ca_system_score_gemma":0.003384621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003547651,"about_ca_topic_score_gemma":0.003028014,"domain_scores_codex":[0.9971571,0.0007058427,0.0002183914,0.0006857795,0.0009692444,0.000263644],"domain_scores_gemma":[0.9884413,0.008725218,0.0003079345,0.001145113,0.0009977891,0.0003826678],"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.0001274732,0.0002179513,0.002971446,0.002671805,0.0001072246,0.00007634316,0.0002139351,0.01175048,0.0003646535,0.3565806,0.03494106,0.5899771],"study_design_scores_gemma":[0.0000489636,0.000130969,0.001309886,0.00100069,0.0001151802,0.000538503,0.0002087748,0.03665902,0.0006745448,0.7973435,0.1619077,0.00006224491],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.007563489,0.5649549,0.3722674,0.008646648,0.001294303,0.00008890792,0.0008131784,0.0009126234,0.04345861],"genre_scores_gemma":[0.1067484,0.6345876,0.2292341,0.003940454,0.009996878,0.0002679935,0.00206996,0.0007707404,0.01238384],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.01365822,"threshold_uncertainty_score":0.04569131,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064073889","doi":"10.1007/bf02579017","title":"Tabu Search heuristics for the Vehicle Routing Problem with Time Windows","year":2002,"lang":"en","type":"article","venue":"Top","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":108,"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":"Vehicle routing problem; Tabu search; Heuristics; Benchmark (surveying); Mathematical optimization; Computer science; Set (abstract data type); Point (geometry); Routing (electronic design automation); Interval (graph theory); Metaheuristic; Mathematics","authors":[{"name":"Olli Bräysy","is_ca":false},{"name":"Michel Gendreau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02423384446332382,"gpt":0.2493872648064071,"spread":0.2251534203430833,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001336902,0.0009381589,0.00109014,0.001334852,0.0007360255,0.001274258,0.001426236,0.001324821,0.006596752],"category_scores_gemma":[0.003967226,0.0009328249,0.0008989062,0.00269316,0.0007723862,0.001770745,0.0007444155,0.001754336,0.0009817741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00131747,"about_ca_system_score_gemma":0.001751408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009562253,"about_ca_topic_score_gemma":0.009118099,"domain_scores_codex":[0.9993045,0.0003963859,0.00002331059,0.00006464965,0.0001037846,0.0001073741],"domain_scores_gemma":[0.9981686,0.001488302,0.0001016724,0.00008538112,0.0001061782,0.00004999057],"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.0001298136,0.0000823825,0.0001957634,0.0001239948,0.00005568095,0.00002876056,0.00005830713,0.885099,0.0004097166,0.02005853,0.005349405,0.08840861],"study_design_scores_gemma":[0.00004495853,0.00003186493,0.00007731655,0.00001998292,0.00001767942,0.00001133694,0.00002183017,0.9823182,0.0002262396,0.01536719,0.001856289,0.000007079039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0286471,0.004076081,0.95313,0.0004379457,0.0002221108,0.0001684316,0.0003525345,0.001331251,0.01163448],"genre_scores_gemma":[0.3018455,0.002391837,0.6848224,0.0002712701,0.0001540935,0.0005501301,0.0005877214,0.0006118024,0.00876527],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009562253,"threshold_uncertainty_score":0.02206832,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029570945","doi":"10.1007/s11750-011-0188-6","title":"A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times","year":2011,"lang":"en","type":"article","venue":"Top","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":55,"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":"National University of Defense Technology","keywords":"Heuristics; Vehicle routing problem; Heuristic; Variable neighborhood search; Mathematical optimization; Variable (mathematics); Computer science; Routing (electronic design automation); Local search (optimization); Service (business); Mathematics; Metaheuristic","authors":[{"name":"Hongtao Lei","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"Bo Guo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03343292112571488,"gpt":0.2456308317566986,"spread":0.2121979106309837,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008303307,0.0005297569,0.001263028,0.0006580346,0.0004500015,0.0007214679,0.001459405,0.001186359,0.002770436],"category_scores_gemma":[0.002062212,0.0004710592,0.0006498205,0.0008458574,0.0005468425,0.000938323,0.0008531652,0.0007500552,0.0002603036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000939865,"about_ca_system_score_gemma":0.001314645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007113496,"about_ca_topic_score_gemma":0.00690274,"domain_scores_codex":[0.9995748,0.0001911665,0.00001146883,0.00005476005,0.0001137733,0.0000540002],"domain_scores_gemma":[0.9993811,0.0003756572,0.00005650052,0.0000394526,0.0001014829,0.00004585747],"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.00006492038,0.00004359325,0.0001631012,0.00003333996,0.00002303259,0.00002842655,0.00002430292,0.9621239,0.000481278,0.009108674,0.001308028,0.02659748],"study_design_scores_gemma":[0.000009797707,0.00001317923,0.00002537237,0.000002743215,0.000003165697,0.000004604512,0.000003752012,0.9982061,0.00005054548,0.001434695,0.0002440608,0.000002022847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04190881,0.0006024078,0.9519478,0.0002574341,0.0001612854,0.00008751138,0.0000723378,0.0002569589,0.004705531],"genre_scores_gemma":[0.5394343,0.0004328814,0.4530517,0.0001947847,0.000118191,0.0002986989,0.0002325393,0.0001854044,0.006051505],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007113496,"threshold_uncertainty_score":0.01414418,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092214701","doi":"10.1007/bf02578926","title":"Performance analysis of a call center with interactive voice response units","year":2004,"lang":"en","type":"article","venue":"Top","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Center (category theory); Interactive voice response; Speech recognition; Telecommunications","authors":[{"name":"Raj Srinivasan","is_ca":true},{"name":"J. Talim","is_ca":true},{"name":"Jinting Wang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01060196318350674,"gpt":0.2342903321682049,"spread":0.2236883689846981,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00193543,0.0009257262,0.001174954,0.0008311567,0.001462312,0.001779874,0.001319776,0.001243588,0.003839531],"category_scores_gemma":[0.00395999,0.0003714554,0.0004263927,0.001377001,0.001061945,0.00110542,0.000782155,0.0009002622,0.0003919777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00357799,"about_ca_system_score_gemma":0.002090981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02525204,"about_ca_topic_score_gemma":0.007789693,"domain_scores_codex":[0.9979194,0.0007001103,0.00005381861,0.0002622893,0.0004439545,0.0006205094],"domain_scores_gemma":[0.9935588,0.004166623,0.0002676529,0.0002321387,0.00124284,0.0005320097],"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.004625966,0.0004851058,0.007040665,0.00009318745,0.0001363234,0.0003074918,0.0001771189,0.9360628,0.02386269,0.006003039,0.001927808,0.01927779],"study_design_scores_gemma":[0.00002382602,0.0003473131,0.001726387,0.000001424875,0.00003997881,0.00002655329,0.00005589802,0.9941778,0.003201192,0.000299159,0.00008467615,0.00001574744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9617918,0.0002437619,0.03183251,0.0003176394,0.00004977993,0.0000468309,0.0001294632,0.0007048862,0.004883373],"genre_scores_gemma":[0.9975166,0.00002326081,0.001730086,0.00001610856,0.00001581308,0.000007184276,0.00003818665,0.00002212128,0.0006305863],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02525204,"threshold_uncertainty_score":0.05021012,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053637459","doi":"10.1007/s11750-007-0015-2","title":"Rejoinder on: Static pickup and delivery problems: a classification scheme and survey","year":2007,"lang":"en","type":"article","venue":"Top","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":25,"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":"Scheme (mathematics); Pickup; Computer science; Classification scheme; Mathematical optimization; Operations research; Artificial intelligence; Machine learning; Mathematics","authors":[{"name":"Gerardo Berbeglia","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Irina Gribkovskaia","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03547897311900935,"gpt":0.242627689282041,"spread":0.2071487161630317,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002875898,0.001103786,0.002501327,0.004362345,0.001374885,0.004211484,0.002904409,0.00290566,0.007931279],"category_scores_gemma":[0.009437128,0.0003419462,0.001355104,0.009706515,0.00174926,0.007170358,0.002842908,0.004231592,0.004808465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001302059,"about_ca_system_score_gemma":0.001688675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003166101,"about_ca_topic_score_gemma":0.003375586,"domain_scores_codex":[0.9978397,0.0002922514,0.0002259035,0.0006660789,0.0008060335,0.0001700623],"domain_scores_gemma":[0.9918737,0.002804159,0.0004590568,0.001037498,0.003337379,0.0004882875],"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.0002688436,0.0003386172,0.008325592,0.001359305,0.0001106326,0.0002352256,0.0006160085,0.008431261,0.001814809,0.1209812,0.2727452,0.5847734],"study_design_scores_gemma":[0.00008075689,0.0005189879,0.009615592,0.0007714449,0.0001606165,0.001723561,0.0008962246,0.02664464,0.002922004,0.1831426,0.7733788,0.0001448168],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"commentary","genre_scores_codex":[0.07719006,0.2747777,0.4198267,0.09794721,0.01424422,0.0004752772,0.003931872,0.001067273,0.1105396],"genre_scores_gemma":[0.3739104,0.1941001,0.2254664,0.02684796,0.02965959,0.000619528,0.01489242,0.001270811,0.1332328],"genre_candidate":"commentary","genre_consensus":null,"teacher_disagreement_score":0.007931279,"threshold_uncertainty_score":0.02653283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070102492","doi":"10.1007/s11750-007-0018-z","title":"Nonhomogeneous geometric distributions with relations to birth and death processes","year":2007,"lang":"en","type":"article","venue":"Top","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Birth–death process; Queueing theory; Limiting; Geometric distribution; Applied mathematics; Random variable; Computer science; Mathematics; Probability distribution; Statistics; Demography; Population","authors":[{"name":"Marvin Mandelbaum","is_ca":true},{"name":"Myron Hlynka","is_ca":true},{"name":"Percy H. Brill","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02262526529466951,"gpt":0.2960162065460238,"spread":0.2733909412513543,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003061205,0.001261217,0.001901459,0.003708949,0.001722649,0.004216945,0.002201527,0.002177177,0.009863999],"category_scores_gemma":[0.01720678,0.0009649934,0.001128604,0.003007132,0.005552389,0.005567214,0.003023152,0.003758017,0.001075711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002108,"about_ca_system_score_gemma":0.001147121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001718729,"about_ca_topic_score_gemma":0.001535055,"domain_scores_codex":[0.9985793,0.0004868285,0.000066163,0.0003565134,0.0003016586,0.0002096117],"domain_scores_gemma":[0.9799649,0.01297112,0.003634043,0.001023064,0.001160728,0.001246187],"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.0000162972,0.00001643101,0.000283237,0.00001992134,0.000008307438,0.00009040556,0.0001104949,0.004431608,0.0002301366,0.99208,0.0004940617,0.002219119],"study_design_scores_gemma":[0.00001918278,0.00001992141,0.0003510012,0.00001127473,0.0000126148,0.0001707794,0.00008583126,0.04893994,0.0001769958,0.9491166,0.001076262,0.00001950433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2213195,0.002305813,0.7488779,0.003638661,0.0004253279,0.0001331868,0.0005270884,0.0003254035,0.02244711],"genre_scores_gemma":[0.9255586,0.002770629,0.03150131,0.0006932555,0.001173695,0.000216739,0.0003743168,0.0001622266,0.03754916],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009863999,"threshold_uncertainty_score":0.03299838,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3019304728","doi":"10.1007/s11750-020-00556-z","title":"Integrated cross-dock door assignment and truck scheduling with handling times","year":2020,"lang":"en","type":"article","venue":"Top","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Truck; DOCK; Doors; Computer science; Scheduling (production processes); Metaheuristic; Job shop scheduling; Material handling; Operations research; Mathematical optimization; Engineering; Automotive engineering; Algorithm; Industrial engineering; Routing (electronic design automation); Computer network; Mathematics; Operating system; Marine engineering","authors":[{"name":"Sayed Ibrahim Sayed","is_ca":true},{"name":"Ivan Contreras","is_ca":true},{"name":"Juan A. Dı́az","is_ca":false},{"name":"Dolores E. Luna","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01178055512020151,"gpt":0.220412502604642,"spread":0.2086319474844405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001994108,0.001577128,0.002033625,0.001032039,0.0006278732,0.001996279,0.002382372,0.001293051,0.006239272],"category_scores_gemma":[0.003475515,0.001229144,0.001373057,0.002558194,0.0005072322,0.002115845,0.001490513,0.002019474,0.0009789696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001306517,"about_ca_system_score_gemma":0.003822872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01080581,"about_ca_topic_score_gemma":0.01265147,"domain_scores_codex":[0.9984508,0.0004821959,0.00005130729,0.0002812573,0.0003548183,0.0003796048],"domain_scores_gemma":[0.9990897,0.0003250792,0.0001439707,0.0001087148,0.0001859133,0.0001465827],"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.0003670812,0.0002661582,0.0005373487,0.00005002538,0.000051065,0.00002621296,0.00001895956,0.9624676,0.001664823,0.002040651,0.000615687,0.03189442],"study_design_scores_gemma":[0.00001763223,0.00008543578,0.000253042,0.000002537147,0.00001630751,0.000005834278,0.000006919384,0.9978887,0.0005280547,0.000910801,0.0002794077,0.000005281388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07852993,0.0003887597,0.9124562,0.000188967,0.000234752,0.0001720143,0.0002860818,0.0007400885,0.007003212],"genre_scores_gemma":[0.7796156,0.0002144267,0.2097642,0.00007122009,0.0001219605,0.0001655481,0.0003588082,0.0002331185,0.00945527],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01080581,"threshold_uncertainty_score":0.02148587,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997272816","doi":"10.1007/s11750-015-0383-y","title":"An optimization model for aggregation of prescribed burn units","year":2015,"lang":"en","type":"article","venue":"Top","topic":"Fire effects on ecosystems","field":"Environmental Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"Fogarty International Center; Bushfire Cooperative Research Centre","keywords":"Computer science; Environmental science; Prescribed burn; Integer programming; Reduction (mathematics); Burn units; Firefighting; Operations research; Environmental resource management; Engineering; Mathematics; Ecology; Geography; Algorithm","authors":[{"name":"James P. Minas","is_ca":true},{"name":"John Hearne","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03052559114115289,"gpt":0.2477234362386516,"spread":0.2171978450974987,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001642434,0.001318763,0.002756633,0.0008607797,0.001045088,0.002259492,0.00251576,0.003175213,0.004937346],"category_scores_gemma":[0.003803388,0.001302816,0.00141032,0.001714881,0.001335382,0.001814653,0.001569418,0.001745616,0.000404857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002797879,"about_ca_system_score_gemma":0.001838481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03996482,"about_ca_topic_score_gemma":0.01857899,"domain_scores_codex":[0.9993858,0.00022706,0.00002990444,0.0001348317,0.00007816756,0.0001442029],"domain_scores_gemma":[0.9984632,0.0009094599,0.0001765633,0.0000636014,0.0001850131,0.0002022689],"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.00001276708,0.000007712244,0.0001077675,0.000007222156,0.00001020955,0.00001247715,0.000006794183,0.9965888,0.00006348382,0.002022302,0.0001899886,0.0009704877],"study_design_scores_gemma":[0.000004122912,0.000004060549,0.0000408934,0.000001651035,0.00000381053,0.000002153323,0.000002912551,0.9987819,0.00001804264,0.001043632,0.00009510929,0.000001840504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1076898,0.0008965787,0.8753475,0.0008686811,0.0001838081,0.0001396327,0.0008480699,0.000334446,0.01369151],"genre_scores_gemma":[0.8448185,0.0005926826,0.1310092,0.0002459996,0.00012619,0.0003903321,0.0006405613,0.0002363243,0.02194016],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03996482,"threshold_uncertainty_score":0.07946444,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3143150125","doi":"10.1007/s11750-021-00599-w","title":"Less is more: discrete starting solutions in the planar p-median problem","year":2021,"lang":"en","type":"article","venue":"Top","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":13,"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; Royal Ottawa Mental Health Centre","funders":"","keywords":"Planar; Fraction (chemistry); Context (archaeology); Mathematical optimization; Heuristic; Space (punctuation); Function (biology); Mathematics; Computer science; Quality (philosophy); Algorithm","authors":[{"name":"Paweł Kalczyński","is_ca":false},{"name":"Jack Brimberg","is_ca":true},{"name":"Zvi Drezner","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04703577719182994,"gpt":0.2531011366591965,"spread":0.2060653594673665,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001691088,0.0009930965,0.001915669,0.0009043989,0.001229387,0.002546685,0.001925743,0.002338163,0.01031509],"category_scores_gemma":[0.0110839,0.0007048569,0.001255812,0.001516843,0.001475312,0.002725172,0.003054979,0.003007993,0.0006829339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00125739,"about_ca_system_score_gemma":0.001534054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004134239,"about_ca_topic_score_gemma":0.003723909,"domain_scores_codex":[0.999268,0.0003382801,0.00002208471,0.0001166232,0.0001290643,0.0001260521],"domain_scores_gemma":[0.9958928,0.003122878,0.0002591274,0.0001701914,0.0002009361,0.0003539748],"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.0005200239,0.0001815861,0.0006203173,0.0003096918,0.00008558775,0.0001392156,0.0002468026,0.5248392,0.0007284303,0.4175697,0.01436366,0.04039579],"study_design_scores_gemma":[0.0001271118,0.0001181021,0.0001641537,0.00006048461,0.00002511718,0.00004955104,0.0001725783,0.5460486,0.0002522832,0.4494932,0.003466519,0.0000224047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09964575,0.001693009,0.8502107,0.003927801,0.0003136387,0.0001485284,0.0006334992,0.0003590282,0.04306807],"genre_scores_gemma":[0.6929632,0.001639398,0.2815666,0.0007546145,0.0002723887,0.0003165627,0.0009930949,0.0003563493,0.02113787],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01031509,"threshold_uncertainty_score":0.03450739,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4210677236","doi":"10.1007/s11750-021-00621-1","title":"A robust optimization approach for the unrelated parallel machine scheduling problem","year":2022,"lang":"en","type":"article","venue":"Top","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"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":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Job shop scheduling; Mathematical optimization; Robust optimization; Scheduling (production processes); Optimization problem; Algorithm; Schedule; Mathematics","authors":[{"name":"Jonathan De La Vega","is_ca":false},{"name":"Alfredo Moreno","is_ca":true},{"name":"Reinaldo Morábito","is_ca":false},{"name":"Pedro Munari","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.022118782462847,"gpt":0.2124286741142084,"spread":0.1903098916513614,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00179609,0.001330125,0.001643397,0.000943114,0.0004987529,0.001151849,0.001835021,0.001453688,0.004337894],"category_scores_gemma":[0.004998365,0.0007843202,0.001229136,0.001090949,0.0008657595,0.001364389,0.001570256,0.00199498,0.0008964707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009488649,"about_ca_system_score_gemma":0.001386299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003211915,"about_ca_topic_score_gemma":0.002410705,"domain_scores_codex":[0.9989545,0.0003525802,0.00004163745,0.0002106369,0.0003604048,0.00008021398],"domain_scores_gemma":[0.9987105,0.0007530092,0.0001511228,0.0001158009,0.0002098122,0.00005977704],"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.00005010937,0.00004109262,0.0000677725,0.0000872543,0.00004969419,0.00005419107,0.00001896874,0.9230106,0.001847613,0.04475623,0.001850962,0.0281655],"study_design_scores_gemma":[0.000004690366,0.00001361154,0.00001913621,0.000003381754,0.000005686048,0.00000733057,0.00000162372,0.9905979,0.0001732609,0.008618092,0.00055147,0.000003786049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001171355,0.0001700771,0.9966891,0.0001127791,0.0000461441,0.00001560656,0.00002423541,0.00008823146,0.001682455],"genre_scores_gemma":[0.2414746,0.00091284,0.7453685,0.0003308141,0.000568097,0.0002571243,0.0003768195,0.0005117048,0.01019945],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004337894,"threshold_uncertainty_score":0.01451176,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4224271542","doi":"10.1007/s11750-022-00632-6","title":"Analysis of the selective traveling salesman problem with time-dependent profits","year":2022,"lang":"en","type":"article","venue":"Top","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Junta de Andalucía; European Regional Development Fund; Ministerio de Ciencia, Innovación y Universidades","keywords":"Travelling salesman problem; Solver; Profit (economics); Mathematical optimization; Computer science; Time horizon; Graph; Piecewise; Mathematics; Combinatorics; Operations research; Economics","authors":[{"name":"Eva Barrena","is_ca":false},{"name":"David Canca","is_ca":false},{"name":"Leandro C. Coelho","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007919825672221409,"gpt":0.2220018549562671,"spread":0.2140820292840457,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001041028,0.0007171394,0.0005973951,0.0005424811,0.0003986183,0.0007971119,0.001195124,0.0007061525,0.003889022],"category_scores_gemma":[0.00284695,0.0003785283,0.0007337239,0.0008310984,0.0006894551,0.001157042,0.0007419951,0.0006997118,0.0001641326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001238518,"about_ca_system_score_gemma":0.001309053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006865553,"about_ca_topic_score_gemma":0.00485068,"domain_scores_codex":[0.9995273,0.0001590727,0.0000169384,0.00007035919,0.0001007711,0.0001254721],"domain_scores_gemma":[0.9983457,0.00121615,0.0001600852,0.00006160091,0.0001288575,0.00008749946],"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.0000405774,0.00002861464,0.0004808102,0.00005384437,0.00002500955,0.00009825338,0.00002453586,0.9804673,0.0004808506,0.01226175,0.0005592309,0.005479326],"study_design_scores_gemma":[0.00000806856,0.00002419443,0.0001748273,0.000004566068,0.000007856834,0.00003047062,0.00002675731,0.9929721,0.0002106468,0.006150363,0.0003875223,0.000002594059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3853734,0.0008537528,0.5953319,0.0008511838,0.00006840024,0.0002026,0.0005517504,0.0002417937,0.01652515],"genre_scores_gemma":[0.9234157,0.0004576623,0.07181604,0.00006718888,0.00004055968,0.0001278537,0.0003318768,0.0000783319,0.003664867],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006865553,"threshold_uncertainty_score":0.01365119,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983527657","doi":"10.1007/s11750-012-0248-6","title":"Locating an axis-parallel rectangle on a Manhattan plane","year":2012,"lang":"en","type":"article","venue":"Top","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada; Group for Research in Decision Analysis","funders":"","keywords":"Rectangle; Plane (geometry); Computer science; Geometry; Computer graphics (images); Mathematics; Combinatorics","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.02860715197565399,"gpt":0.2774770682526244,"spread":0.2488699162769704,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006915475,0.001046776,0.0009100019,0.001197649,0.0008940085,0.001430062,0.00167549,0.001243828,0.005747303],"category_scores_gemma":[0.002924487,0.0007885428,0.0006962605,0.001207162,0.0007205905,0.001255007,0.002374298,0.0009655158,0.002675241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006740264,"about_ca_system_score_gemma":0.0009642504,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002844885,"about_ca_topic_score_gemma":0.003261467,"domain_scores_codex":[0.9990784,0.0002119986,0.00003887379,0.0001799159,0.0003587235,0.0001321012],"domain_scores_gemma":[0.99926,0.0002629379,0.0000735343,0.0001670263,0.000177637,0.00005891676],"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.001658389,0.0003051557,0.007522226,0.0006068231,0.0001183399,0.001907123,0.001008993,0.384606,0.107166,0.1120947,0.01897373,0.3640324],"study_design_scores_gemma":[0.00007502958,0.0002095295,0.001073141,0.00005645756,0.00003016804,0.0005600279,0.0003609855,0.9296029,0.03717344,0.01525117,0.01556251,0.00004464581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04267592,0.0001751868,0.9455155,0.0001981466,0.00009829956,0.0001580571,0.0002170542,0.001298743,0.009663024],"genre_scores_gemma":[0.2093336,0.0001853857,0.7847786,0.00004865245,0.00002292363,0.00009971027,0.0004080938,0.0003689303,0.004754129],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005747303,"threshold_uncertainty_score":0.01922661,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4289890653","doi":"10.1007/s11750-022-00638-0","title":"The robust multi-plant capacitated lot-sizing problem","year":2022,"lang":"en","type":"article","venue":"Top","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":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Sizing; Mathematical optimization; Robust optimization; Computer science; Duality (order theory); Integer programming; Production (economics); Mathematics","authors":[{"name":"Aura Jalal","is_ca":false},{"name":"Aldair Alvarez","is_ca":true},{"name":"Cesar Alvarez-Cruz","is_ca":false},{"name":"Jonathan De La Vega","is_ca":false},{"name":"Alfredo Moreno","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03978123903138762,"gpt":0.2059229303042696,"spread":0.166141691272882,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001347514,0.001227454,0.001727241,0.0006378389,0.0004239846,0.001746245,0.001670686,0.00209321,0.004382657],"category_scores_gemma":[0.003666854,0.0009261576,0.000796544,0.001068988,0.0009308751,0.001448792,0.001038716,0.001182058,0.0004309371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001287776,"about_ca_system_score_gemma":0.001604756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004230904,"about_ca_topic_score_gemma":0.002915086,"domain_scores_codex":[0.9993116,0.0002576261,0.00002376277,0.0001732676,0.0001400923,0.00009374035],"domain_scores_gemma":[0.9986211,0.0008906741,0.0001861266,0.00009282834,0.0001077193,0.0001015617],"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.00007727039,0.0000213002,0.0001017417,0.00008995472,0.0000300667,0.00005160337,0.0000104051,0.9845828,0.0008956596,0.005662274,0.0008199962,0.007657016],"study_design_scores_gemma":[0.00001354868,0.00003369093,0.00008304348,0.000005571796,0.00000733057,0.00001616129,0.000005162878,0.9936579,0.000294447,0.005617106,0.0002602935,0.000005802118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04680216,0.000765631,0.9409124,0.0008163128,0.00009343131,0.00009869481,0.0005858222,0.0003963077,0.009529235],"genre_scores_gemma":[0.8837101,0.0004675541,0.1061056,0.0001666248,0.0001169956,0.0001419097,0.0004466963,0.0001754694,0.008668836],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004382657,"threshold_uncertainty_score":0.01466149,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053246538","doi":"10.1007/bf02579086","title":"Location and sizing of facilities on a line","year":2001,"lang":"en","type":"article","venue":"Top","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","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 Prince Edward Island","funders":"","keywords":"Sizing; Computer science; Facility location problem; Line (geometry); Process (computing); Mathematical optimization; Operations research; Dynamic programming; Decision process; Location-allocation; Algorithm; Management science; Mathematics; Economics","authors":[{"name":"Jack Brimberg","is_ca":true},{"name":"Abraham Mehrez","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01883895153642078,"gpt":0.2281545366980059,"spread":0.2093155851615851,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003836146,0.001109875,0.001044752,0.0009784889,0.0005405938,0.001677585,0.0009587074,0.0008444199,0.006462996],"category_scores_gemma":[0.001640798,0.0007296079,0.0005371146,0.001282709,0.0005103671,0.001144148,0.0005991583,0.0005881865,0.0008467347],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008879944,"about_ca_system_score_gemma":0.0007681231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006599812,"about_ca_topic_score_gemma":0.007752242,"domain_scores_codex":[0.9996436,0.0000855688,0.00001450056,0.00009221458,0.00008751191,0.00007658569],"domain_scores_gemma":[0.9994636,0.000162167,0.0001563932,0.00006427678,0.00008707338,0.00006640664],"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.000311698,0.00007012866,0.002481905,0.00007422273,0.00003460712,0.0001144862,0.00003383364,0.9612349,0.007797754,0.003377028,0.0009615551,0.0235079],"study_design_scores_gemma":[0.00003654094,0.0002423161,0.002745641,0.000008078842,0.00002597073,0.00005353747,0.00006602099,0.9885308,0.004102117,0.003234118,0.0009381015,0.00001673263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6292533,0.0002571804,0.3474168,0.0003011292,0.0001014059,0.0002661226,0.001550016,0.0009120273,0.01994204],"genre_scores_gemma":[0.923094,0.0001013194,0.07005674,0.00001834957,0.00002363748,0.00006642173,0.0004656325,0.0000580009,0.006115833],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006599812,"threshold_uncertainty_score":0.02162087,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3004178692","doi":"10.1007/s11750-020-00539-0","title":"Sharing pollution permits under welfare upper bounds","year":2020,"lang":"en","type":"article","venue":"Top","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Upper and lower bounds; Production (economics); Welfare; Mathematical optimization; Mathematical economics; Shapley value; Computer science; Economics; Game theory; Microeconomics; Mathematics","authors":[{"name":"Jin Li","is_ca":false},{"name":"Sang-Chul Suh","is_ca":true},{"name":"Yuntong Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05322114604604006,"gpt":0.2280521492269449,"spread":0.1748310031809048,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007733997,0.001162808,0.003802696,0.001524619,0.002141923,0.009520961,0.002856552,0.003780494,0.01141527],"category_scores_gemma":[0.03141908,0.0009722817,0.001468956,0.001589432,0.005044577,0.008764224,0.004235743,0.004534414,0.0006487685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00356637,"about_ca_system_score_gemma":0.002412647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004240502,"about_ca_topic_score_gemma":0.003018365,"domain_scores_codex":[0.9911163,0.003706005,0.0003551094,0.001134494,0.001312458,0.00237567],"domain_scores_gemma":[0.9677385,0.02297628,0.002424846,0.004025256,0.001585755,0.001249358],"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.0001926828,0.00009009037,0.0008187655,0.0001121535,0.00008177842,0.00009726147,0.00013099,0.06480718,0.0007712686,0.9174679,0.002464462,0.01296553],"study_design_scores_gemma":[0.00003318147,0.000035359,0.0003051402,0.00002487646,0.00002894846,0.00003039967,0.00009927426,0.07473691,0.0003785219,0.9228758,0.001432262,0.00001940317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2591842,0.001052812,0.6083124,0.006270741,0.0002679119,0.0001770523,0.0008476673,0.0005140005,0.1233733],"genre_scores_gemma":[0.9838209,0.0002246529,0.006658071,0.0004004233,0.000112778,0.00009558406,0.00006505648,0.00004983717,0.008572572],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01141527,"threshold_uncertainty_score":0.04090178,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2942743594","doi":"10.1007/s11750-019-00509-1","title":"A 2-class maintenance model with dynamic server behavior","year":2019,"lang":"en","type":"article","venue":"Top","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polling system; Computer science; Queue; Polling; Bernoulli's principle; Function (biology); Mathematical optimization; Mathematics; Computer network; Engineering","authors":[{"name":"Kevin Granville","is_ca":true},{"name":"Steve Drekic","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006847424993105401,"gpt":0.2147827240944064,"spread":0.207935299101301,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002281015,0.00116683,0.001780371,0.001141749,0.00112107,0.003716562,0.004700977,0.003637241,0.007435502],"category_scores_gemma":[0.004441707,0.001039558,0.001200804,0.001607414,0.001334347,0.004382362,0.001435333,0.002269855,0.001429714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003550582,"about_ca_system_score_gemma":0.002190032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01809472,"about_ca_topic_score_gemma":0.01150762,"domain_scores_codex":[0.9980471,0.000409221,0.00007714148,0.0005970604,0.0003256853,0.000543888],"domain_scores_gemma":[0.9970171,0.001404135,0.000376909,0.0003359164,0.0005428253,0.0003231604],"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.0003889226,0.0002959049,0.002292089,0.00009120134,0.00007671651,0.0005220871,0.0002494449,0.9100796,0.002494681,0.06562287,0.003392691,0.0144937],"study_design_scores_gemma":[0.00001994812,0.00002258575,0.0001931762,0.000003429954,0.00001709524,0.00003739234,0.00001396738,0.9938881,0.0001180648,0.00537313,0.0003027805,0.00001048178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.273027,0.0006111661,0.7047926,0.002591537,0.0003243446,0.0002373642,0.00138639,0.001442182,0.01558741],"genre_scores_gemma":[0.9552395,0.0002429723,0.02317077,0.0002156709,0.0001643422,0.0001464955,0.0003272801,0.0001392508,0.02035377],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01809472,"threshold_uncertainty_score":0.03597879,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400005792","doi":"10.1007/s11750-024-00678-8","title":"Gaining insight into crew rostering instances through ML-based sequential assignment","year":2024,"lang":"en","type":"article","venue":"Top","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Crew; Operations research; Mathematical optimization; Mathematics; Aeronautics; Engineering","authors":[{"name":"Philippe Racette","is_ca":true},{"name":"Frédéric Quesnel","is_ca":true},{"name":"Andrea Lodi","is_ca":true},{"name":"François Soumis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2028994966871165,"gpt":0.4339951749443921,"spread":0.2310956782572756,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00118891,0.0008628301,0.0008660441,0.00104448,0.0005874388,0.001454774,0.001436836,0.0007865783,0.01018222],"category_scores_gemma":[0.007685502,0.0006394095,0.0007890858,0.001264645,0.0005623788,0.002255377,0.00130051,0.001521933,0.0008896387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009859251,"about_ca_system_score_gemma":0.001893993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006797828,"about_ca_topic_score_gemma":0.01161704,"domain_scores_codex":[0.9992181,0.0002644604,0.00002749404,0.0001635834,0.000204632,0.0001216576],"domain_scores_gemma":[0.9963124,0.002627272,0.0002762389,0.0002855548,0.0003626689,0.0001358],"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.0002009169,0.0001803672,0.00116683,0.0001696681,0.00002974181,0.00006021446,0.0001144013,0.8843116,0.002436913,0.01216831,0.00335119,0.0958099],"study_design_scores_gemma":[0.000008264925,0.0000219925,0.0001228512,0.000007809694,0.000004766359,0.000008071167,0.00002880152,0.9920993,0.0004326963,0.006694677,0.0005682254,0.000002586494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05021106,0.0001683771,0.9400388,0.0003957369,0.00004605081,0.0001069377,0.0004262174,0.0009613931,0.007645507],"genre_scores_gemma":[0.4802414,0.0001625772,0.5138103,0.0002045121,0.00007359331,0.0001595132,0.0009426504,0.0004062145,0.003999299],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01018222,"threshold_uncertainty_score":0.03406298,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005484777","doi":"10.1007/bf02578956","title":"On self-regular IPMs","year":2004,"lang":"en","type":"article","venue":"Top","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"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":"Mathematics; Duality gap; Conic section; Duality (order theory); Conic optimization; Dual (grammatical number); Mathematical optimization; Semidefinite programming; Interior point method; Optimization problem; Point (geometry); Discrete mathematics; Convex optimization; Subderivative","authors":[{"name":"Maziar Salahi","is_ca":true},{"name":"Renata Sotirov","is_ca":true},{"name":"Tamás Terlaky","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03151550688129424,"gpt":0.3562669717050758,"spread":0.3247514648237816,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001075333,0.000659608,0.0009646004,0.001228736,0.001194647,0.001795048,0.001245301,0.001069396,0.01175244],"category_scores_gemma":[0.008354628,0.0004027026,0.0007252109,0.0009860285,0.001870973,0.003550712,0.003517667,0.002612373,0.001405848],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007954627,"about_ca_system_score_gemma":0.000502346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005617373,"about_ca_topic_score_gemma":0.000543608,"domain_scores_codex":[0.9993522,0.0001928647,0.00002863273,0.0001198336,0.0002048541,0.0001016872],"domain_scores_gemma":[0.9977313,0.001047957,0.0002320396,0.0004280681,0.0002894352,0.0002712704],"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.00004874483,0.0000232307,0.000277196,0.00005544856,0.0000133775,0.0000587154,0.00008177356,0.01099484,0.0004610523,0.9707381,0.005071383,0.01217623],"study_design_scores_gemma":[0.000008945642,0.00001681915,0.0001248802,0.00001173259,0.000006407072,0.00006242502,0.00002916258,0.05681073,0.0002801409,0.9398485,0.00279501,0.000005341616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1548308,0.001266128,0.7354748,0.003065569,0.0004913516,0.00007747637,0.0004428147,0.001113829,0.1032372],"genre_scores_gemma":[0.8500853,0.001044748,0.08208533,0.001188991,0.0006977652,0.0001473011,0.0005933411,0.0007470548,0.06341009],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01175244,"threshold_uncertainty_score":0.03931576,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2750960109","doi":"10.1007/s11750-017-0459-y","title":"Rejoinder on: Continuous approximation models in freight distribution management","year":2017,"lang":"en","type":"article","venue":"Top","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science; Distribution (mathematics); Operations research; Mathematical optimization; Mathematics","authors":[{"name":"Anna Franceschetti","is_ca":true},{"name":"Ola Jabali","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02932625531412885,"gpt":0.2087014729923287,"spread":0.1793752176781999,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007617583,0.001243431,0.0029168,0.001598334,0.002299696,0.006164935,0.005454231,0.01635396,0.01503489],"category_scores_gemma":[0.04215573,0.0005982663,0.001292758,0.002117993,0.005215782,0.01505785,0.006002483,0.01978053,0.005882915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00258659,"about_ca_system_score_gemma":0.002794887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00706327,"about_ca_topic_score_gemma":0.005877148,"domain_scores_codex":[0.9948315,0.002162469,0.0002978689,0.000989582,0.00147757,0.0002410523],"domain_scores_gemma":[0.9516063,0.03256359,0.0009437524,0.003697726,0.009792162,0.001396463],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001662439,0.00009218842,0.0004352889,0.0002397143,0.00006164626,0.0001310214,0.0002307104,0.006947266,0.0002111555,0.2112129,0.7497577,0.03051423],"study_design_scores_gemma":[0.0001090814,0.00005288965,0.0003241169,0.0004591952,0.00005628334,0.0001400814,0.000362187,0.03412864,0.0006047837,0.6195812,0.3440452,0.0001363503],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"commentary","genre_gemma":"commentary","genre_scores_codex":[0.003196779,0.0159678,0.06296111,0.8490906,0.05563945,0.00003647486,0.0004386827,0.0003652337,0.01230381],"genre_scores_gemma":[0.1854421,0.03808413,0.1077541,0.3197766,0.2170939,0.0004626112,0.0009789809,0.002186454,0.1282211],"genre_candidate":"commentary","genre_consensus":"commentary","teacher_disagreement_score":0.01635396,"threshold_uncertainty_score":0.05029672,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006474481","doi":"10.1007/s11750-013-0276-x","title":"Comments on: Multicriteria decision systems for financial problems","year":2013,"lang":"en","type":"article","venue":"Top","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Laurentian University","funders":"","keywords":"Computer science; Mathematical economics; Management science; Economics","authors":[{"name":"Belaı̈d Aouni","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08747867990037758,"gpt":0.374426833849148,"spread":0.2869481539487705,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007286214,0.001746846,0.002129971,0.002047268,0.003566772,0.004280805,0.004146708,0.03246241,0.03305874],"category_scores_gemma":[0.0637293,0.0009535672,0.002128958,0.002293642,0.002732871,0.005064737,0.002589197,0.02747685,0.01643042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005115282,"about_ca_system_score_gemma":0.004310746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02282452,"about_ca_topic_score_gemma":0.02123183,"domain_scores_codex":[0.994402,0.001474529,0.001024581,0.0006977085,0.001922049,0.0004792327],"domain_scores_gemma":[0.9531361,0.02455112,0.002108681,0.001271282,0.01703792,0.001894774],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001695445,0.000004595108,0.00004930525,0.00004092381,0.000004542323,0.00005422543,0.00003470113,0.00005436078,0.00003914504,0.0006498256,0.9977781,0.0012732],"study_design_scores_gemma":[0.00005945189,0.00002156661,0.001120392,0.000284336,0.00002633285,0.0001807708,0.0002129294,0.0008714016,0.000180401,0.005402118,0.9915593,0.00008090941],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"commentary","genre_gemma":"commentary","genre_scores_codex":[0.000163468,0.001677512,0.0006944196,0.8972749,0.09737334,0.00003557904,0.000360141,0.00008548629,0.002335256],"genre_scores_gemma":[0.003121881,0.002025621,0.001412636,0.8307568,0.1445528,0.000100368,0.0001981314,0.0001600496,0.01767176],"genre_candidate":"commentary","genre_consensus":"commentary","teacher_disagreement_score":0.03305874,"threshold_uncertainty_score":0.1105925,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3029444715","doi":"10.1007/s11750-020-00569-8","title":"Stability of utility functions and apportionment rules in location models","year":2020,"lang":"en","type":"article","venue":"Top","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Apportionment; Expected utility hypothesis; Utility theory; Process (computing); Stability (learning theory); Computer science; Operations research; Mathematical economics; Mathematical optimization; Economics; Mathematics; Machine learning","authors":[{"name":"H. A. Eiselt","is_ca":true},{"name":"Vladimir Marianov","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06143634744202692,"gpt":0.2376720738271291,"spread":0.1762357263851022,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006215997,0.001135256,0.003422748,0.002083695,0.001892316,0.006043771,0.00348664,0.003091262,0.006149121],"category_scores_gemma":[0.04444147,0.001883361,0.002385681,0.002077834,0.004273586,0.007659203,0.002749414,0.004272924,0.0006924209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004050341,"about_ca_system_score_gemma":0.001684765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01883638,"about_ca_topic_score_gemma":0.008845942,"domain_scores_codex":[0.9976044,0.001356065,0.0001046624,0.0003722357,0.000227438,0.000335224],"domain_scores_gemma":[0.9682108,0.02633032,0.002089057,0.001140479,0.001225126,0.001004188],"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.0001266948,0.00006822005,0.00163845,0.00006148596,0.00007448399,0.0001186015,0.0003278787,0.3848987,0.0002731533,0.6057586,0.002096022,0.004557714],"study_design_scores_gemma":[0.00001588729,0.0000146916,0.000248212,0.00001353633,0.00001488715,0.0000240933,0.00005564916,0.7489365,0.00005670525,0.2503409,0.0002600243,0.00001896904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2664104,0.001488648,0.7081591,0.004173885,0.00009728481,0.0001033622,0.0007214182,0.0003831712,0.01846268],"genre_scores_gemma":[0.9757091,0.0007713963,0.01404762,0.0001577876,0.00007818329,0.00009975077,0.0003188888,0.0001662728,0.008651094],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01883638,"threshold_uncertainty_score":0.03745347,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2079045924","doi":"10.1007/s11750-011-0184-x","title":"Comments on: Light tail asymptotics in multidimensional reflecting processes for queueing networks","year":2011,"lang":"en","type":"article","venue":"Top","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Queueing theory; Statistical physics; Computer science; Applied mathematics; Mathematics; Mathematical economics; Physics; Computer network","authors":[{"name":"Yiqiang Q. Zhao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04618520478188533,"gpt":0.2826010092351892,"spread":0.2364158044533039,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008930109,0.00182435,0.002070002,0.002569258,0.004123113,0.003031166,0.006530402,0.02249807,0.02915994],"category_scores_gemma":[0.08991901,0.0009746806,0.002156639,0.00272445,0.005890189,0.008838984,0.003073886,0.02022404,0.01124117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006355209,"about_ca_system_score_gemma":0.003272248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03612331,"about_ca_topic_score_gemma":0.01342642,"domain_scores_codex":[0.9911698,0.001884725,0.001151314,0.00144775,0.003597745,0.0007486069],"domain_scores_gemma":[0.9345827,0.04030546,0.003124634,0.002462163,0.01816329,0.001361706],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008255531,0.0000235334,0.000256904,0.000155011,0.00002083103,0.0003718691,0.0003336032,0.0005547398,0.0003128661,0.02421433,0.9695488,0.004125066],"study_design_scores_gemma":[0.000145472,0.00006777411,0.004158234,0.0007151461,0.000100798,0.0007829178,0.0008879251,0.01119755,0.001618913,0.1627641,0.8170599,0.000501297],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"commentary","genre_gemma":"commentary","genre_scores_codex":[0.00107336,0.001762972,0.00441624,0.9346637,0.05051531,0.000046862,0.0006907391,0.0003226319,0.006508229],"genre_scores_gemma":[0.0397908,0.003675038,0.006794065,0.7542138,0.1623158,0.0002285249,0.0003983957,0.0007066795,0.03187694],"genre_candidate":"commentary","genre_consensus":"commentary","teacher_disagreement_score":0.03612331,"threshold_uncertainty_score":0.09754968,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2790139429","doi":"10.1007/s11750-018-0468-5","title":"Comments on: Disruption management in vehicle routing and scheduling for road freight transport: a review","year":2018,"lang":"en","type":"review","venue":"Top","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Vehicle routing problem; Computer science; Scheduling (production processes); Transport engineering; Operations research; Routing (electronic design automation); Operations management; Computer network; Engineering","authors":[{"name":"Michel Gendreau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0571982485782732,"gpt":0.3558061633112891,"spread":0.2986079147330159,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002923244,0.0008929617,0.001548777,0.002851071,0.0006011085,0.002315511,0.001704746,0.003604351,0.02864601],"category_scores_gemma":[0.01535142,0.0003409913,0.001236098,0.003701241,0.0008215068,0.00472926,0.001439164,0.003883705,0.01316762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009934016,"about_ca_system_score_gemma":0.003986607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002199803,"about_ca_topic_score_gemma":0.005721359,"domain_scores_codex":[0.9985777,0.0002468584,0.0002396724,0.0001882837,0.0006367872,0.0001107807],"domain_scores_gemma":[0.9877686,0.004444941,0.001357497,0.0002005018,0.005648703,0.0005796334],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004933198,0.0000177055,0.00008498364,0.005752634,0.00003804152,0.00005857558,0.00003580892,0.0001167577,0.000192092,0.001586779,0.8945401,0.09752711],"study_design_scores_gemma":[0.00001859737,0.00003204254,0.0003619451,0.003599423,0.00006270832,0.000110391,0.0000542449,0.00004412157,0.00009262468,0.001657196,0.9939473,0.00001938965],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"review","genre_gemma":"commentary","genre_scores_codex":[0.0002970701,0.6583299,0.001509202,0.175524,0.1539862,0.00008340136,0.001242703,0.0001601918,0.008867312],"genre_scores_gemma":[0.002645452,0.7206709,0.001475512,0.157501,0.09268248,0.00009540265,0.0009035337,0.0001101271,0.02391564],"genre_candidate":"commentary","genre_consensus":null,"teacher_disagreement_score":0.02864601,"threshold_uncertainty_score":0.0958305,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2626465488","doi":"10.1007/s11750-017-0452-5","title":"Rejoinder on: On learning and branching: a survey","year":2017,"lang":"en","type":"article","venue":"Top","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Branching (polymer chemistry); Computer science; Mathematical economics; Mathematics; Chemistry","authors":[{"name":"Andrea Lodi","is_ca":true},{"name":"Giulia Zarpellon","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.062619957460186,"gpt":0.3566546196720717,"spread":0.2940346622118857,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003903744,0.001818299,0.003399865,0.002869406,0.001562083,0.006207967,0.004430605,0.00292776,0.013187],"category_scores_gemma":[0.01451806,0.0009297547,0.001534016,0.008966528,0.002850146,0.009970298,0.004167948,0.006313437,0.004667537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002057299,"about_ca_system_score_gemma":0.002776864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003116398,"about_ca_topic_score_gemma":0.003264756,"domain_scores_codex":[0.9973182,0.0007915945,0.0001763467,0.0006200815,0.000866097,0.0002277043],"domain_scores_gemma":[0.9917215,0.00579688,0.0002446569,0.001103334,0.0008292477,0.0003045301],"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.0001463711,0.0001957106,0.001183862,0.001541821,0.00008992303,0.00005511251,0.000342102,0.02652934,0.0005491102,0.2222328,0.03786782,0.7092661],"study_design_scores_gemma":[0.00007453006,0.0001955605,0.0006639935,0.001444412,0.000156485,0.0003921085,0.0003022812,0.1125238,0.001890443,0.5781503,0.3041348,0.00007132941],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"commentary","genre_scores_codex":[0.007930438,0.2508193,0.6777102,0.009391351,0.001898302,0.00012143,0.0003503648,0.001294373,0.05048418],"genre_scores_gemma":[0.1271717,0.2045265,0.6242567,0.005273104,0.006893762,0.000330634,0.001463191,0.002277618,0.02780687],"genre_candidate":"commentary","genre_consensus":null,"teacher_disagreement_score":0.013187,"threshold_uncertainty_score":0.04411489,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}