{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":105,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":105,"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":"b7145a54d347","filters":{"venue":"Journal of Global Optimization"}},"results":[{"id":"W2151238122","doi":"10.1023/a:1012771025575","title":"A Taxonomy of Global Optimization Methods Based on Response Surfaces","year":2001,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":2137,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Waterloo; RAND Corporation","keywords":"Mathematics; Simple (philosophy); Mathematical optimization; Theme (computing); Management science; Algorithm; Computer science; Epistemology; Engineering","authors":[{"name":"Donald R. Jones","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02457143740247184,"gpt":0.3308629553278328,"spread":0.3062915179253609,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003971481,0.002490816,0.003734622,0.004114278,0.0008155482,0.003779744,0.003399676,0.002830544,0.003883595],"category_scores_gemma":[0.006563186,0.001294294,0.003430786,0.005477048,0.001711917,0.00363385,0.002638254,0.004267405,0.00261039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006656382,"about_ca_system_score_gemma":0.0009384616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007798282,"about_ca_topic_score_gemma":0.0007620844,"domain_scores_codex":[0.996443,0.001035623,0.0003063528,0.0004419262,0.001649224,0.000123857],"domain_scores_gemma":[0.997472,0.001154054,0.0001810689,0.0005317055,0.0005969719,0.00006422179],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007366251,0.0001465707,0.0008011771,0.001856667,0.0002539444,0.0001034122,0.0002619162,0.1600963,0.006364935,0.3313521,0.008934222,0.4897552],"study_design_scores_gemma":[0.00004368959,0.0002894021,0.0006460665,0.0005405967,0.00009939956,0.0003339548,0.0001045391,0.6537436,0.004136764,0.2619186,0.07798925,0.000154031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008097886,0.006943572,0.9875563,0.0002714535,0.0001202545,0.00007762358,0.00006073014,0.0003822264,0.003778079],"genre_scores_gemma":[0.03964475,0.01985271,0.9335833,0.0003259618,0.0004452827,0.0006387456,0.0004034975,0.0005739384,0.004531765],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004114278,"threshold_uncertainty_score":0.02100348,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1549791526","doi":"10.1023/a:1026583532263","title":"On Copositive Programming and Standard Quadratic Optimization Problems","year":2000,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":197,"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; Orthant; Positive-definite matrix; Semidefinite programming; Conic optimization; Cone (formal languages); Quadratically constrained quadratic program; Affine transformation; Scaling; Simplex; Relaxation (psychology); Combinatorics; Matrix (chemical analysis); Quadratic programming; Applied mathematics; Mathematical optimization; Convex optimization; Regular polygon; Pure mathematics; Algorithm; Convex set; Geometry","authors":[{"name":"Immanuel M. Bomze","is_ca":false},{"name":"Mirjam Dür","is_ca":false},{"name":"Etienne de Klerk","is_ca":false},{"name":"C. Roos","is_ca":false},{"name":"A.J. Quist","is_ca":false},{"name":"Tamás Terlaky","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01776061782903075,"gpt":0.3325683721105566,"spread":0.3148077542815259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004931242,0.002209862,0.002211079,0.002304913,0.001547636,0.003634071,0.002335731,0.002698562,0.006877935],"category_scores_gemma":[0.02077449,0.001254152,0.00146234,0.005417899,0.006352723,0.00771416,0.003316865,0.008195143,0.0009576803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002092012,"about_ca_system_score_gemma":0.001280523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003511312,"about_ca_topic_score_gemma":0.003015154,"domain_scores_codex":[0.9973646,0.001432941,0.00009829435,0.0003297692,0.0006220961,0.0001523017],"domain_scores_gemma":[0.9898866,0.007768923,0.000584822,0.00048899,0.0009071148,0.0003635615],"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.00002412035,0.00004992332,0.000172052,0.0001093868,0.00002491216,0.0000628083,0.0001062412,0.02298855,0.0001778234,0.9608889,0.004695298,0.01070007],"study_design_scores_gemma":[0.000007242367,0.00001527313,0.0001232162,0.00003212061,0.000008488036,0.00003440974,0.00002806299,0.06689209,0.00004845938,0.9290331,0.003765486,0.00001190091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02381614,0.008747508,0.8806474,0.004928158,0.0008065071,0.00006781046,0.0002044828,0.00008624147,0.08069579],"genre_scores_gemma":[0.5571395,0.02891649,0.3187331,0.004153074,0.006432278,0.0007544902,0.0015584,0.0005816021,0.08173109],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006877935,"threshold_uncertainty_score":0.02607924,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994895518","doi":"10.1007/s10898-007-9234-1","title":"Nonsmooth optimization through Mesh Adaptive Direct Search and Variable Neighborhood Search","year":2007,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":185,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Air Force Office of Scientific Research","keywords":"Mathematics; Variable neighborhood search; Mathematical optimization; Metaheuristic; Convergence (economics); Local search (optimization); Variable (mathematics); Guided Local Search; Algorithm","authors":[{"name":"Charles Audet","is_ca":true},{"name":"Vincent Béchard","is_ca":true},{"name":"Sébastien Le Digabel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02169005376408899,"gpt":0.2979204776592476,"spread":0.2762304238951586,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006809657,0.000515179,0.0009296249,0.0006402929,0.0004171714,0.0006307816,0.001034767,0.0009996236,0.002264737],"category_scores_gemma":[0.00216161,0.0004668385,0.0005224016,0.0005627158,0.0005957462,0.0008694226,0.0007840968,0.000689013,0.0002641147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004297268,"about_ca_system_score_gemma":0.0005349988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002425428,"about_ca_topic_score_gemma":0.003502799,"domain_scores_codex":[0.999763,0.00009480579,0.000008408339,0.00002736666,0.0000934366,0.00001300042],"domain_scores_gemma":[0.9993697,0.000416061,0.00004988132,0.00004521253,0.00009936777,0.00001977881],"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.0001209324,0.00008448622,0.0003802429,0.00009678913,0.00006681492,0.00005774172,0.00006079334,0.883984,0.003023651,0.03233323,0.001394908,0.07839645],"study_design_scores_gemma":[0.00000841282,0.00001184817,0.000029978,0.000001997913,0.00000311802,0.000005814073,0.000002162143,0.9977348,0.0001598811,0.001796435,0.0002436842,0.000001945514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02208251,0.0003674022,0.97013,0.0001053763,0.000110113,0.0000538091,0.00001949861,0.0001812133,0.006950123],"genre_scores_gemma":[0.3814583,0.0002581498,0.611039,0.0001188363,0.00008430937,0.000279533,0.00006293492,0.0001892534,0.006509734],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002425428,"threshold_uncertainty_score":0.007576287,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088855121","doi":"10.1007/s10898-004-2692-9","title":"Global Stability Results for the Weak Vector Variational Inequality","year":2005,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Variational inequality; Stability (learning theory); Euclidean space; Applied mathematics; Euclidean geometry; Inequality; Solution set; Set (abstract data type); Vector optimization; Mathematical analysis; Vector space; Space (punctuation); Mathematical optimization; Pure mathematics; Optimization problem; Geometry","authors":[{"name":"Yonghong Cheng","is_ca":false},{"name":"Dexiang Zhu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02314939605882728,"gpt":0.2857274072162192,"spread":0.2625780111573919,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002992564,0.00215835,0.001403869,0.002386941,0.001259955,0.002477106,0.001526338,0.001565531,0.008012009],"category_scores_gemma":[0.007753174,0.0006541,0.001562366,0.0009755531,0.002774532,0.003757437,0.004164771,0.004278499,0.001221203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001283882,"about_ca_system_score_gemma":0.00138091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001890762,"about_ca_topic_score_gemma":0.001165639,"domain_scores_codex":[0.9990859,0.0003567075,0.00004291776,0.0001557268,0.0002659626,0.00009283888],"domain_scores_gemma":[0.9957021,0.002326929,0.0002685986,0.0001675788,0.001278755,0.0002560426],"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.0001870858,0.00005989299,0.0005168673,0.0002420751,0.0001257817,0.0001441741,0.0003016292,0.05958008,0.01166584,0.8954467,0.005624637,0.02610529],"study_design_scores_gemma":[0.00002648042,0.0001049953,0.000329205,0.00005193364,0.00003978307,0.00008249787,0.0001030115,0.450508,0.002196202,0.5419675,0.004555294,0.00003508989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02952542,0.002046604,0.9202509,0.002507107,0.000432338,0.00008933609,0.0002291075,0.0001825528,0.04473667],"genre_scores_gemma":[0.8225215,0.004152782,0.09977446,0.001513623,0.001549671,0.0006617177,0.0007800777,0.0009467113,0.06809936],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008012009,"threshold_uncertainty_score":0.02680278,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965868850","doi":"10.1007/s10898-014-0185-z","title":"A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines","year":2014,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Mining Techniques and Economics","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; AngloGold Ashanti","keywords":"Mathematical optimization; Open-pit mining; Benchmark (surveying); Linear programming; Scheduling (production processes); Descent (aeronautics); Computer science; Schedule; Variable (mathematics); Production planning; Mathematics; Production (economics); Engineering","authors":[{"name":"Amina Lamghari","is_ca":true},{"name":"Roussos Dimitrakopoulos","is_ca":true},{"name":"Jacques A. Ferland","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01375831141325796,"gpt":0.2672620278749107,"spread":0.2535037164616528,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00111799,0.0008616668,0.001345429,0.0007719303,0.000461669,0.0007165065,0.001615919,0.001121408,0.00228181],"category_scores_gemma":[0.001780994,0.0006603867,0.0007643452,0.0009216123,0.0004294166,0.0006788303,0.0007105966,0.0008804036,0.0004320761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007139682,"about_ca_system_score_gemma":0.00188123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008895929,"about_ca_topic_score_gemma":0.00975909,"domain_scores_codex":[0.9994594,0.0002213003,0.0000189209,0.00009038752,0.0001475276,0.00006240949],"domain_scores_gemma":[0.9992096,0.0005105693,0.00006921658,0.00003423108,0.0001357818,0.00004053815],"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.00006013862,0.0000810535,0.0002460124,0.00005778419,0.0000271058,0.00004147498,0.00003024346,0.947655,0.00133876,0.002810553,0.001090862,0.04656095],"study_design_scores_gemma":[0.000008990039,0.00002112108,0.00002782776,0.000002072057,0.000002498754,0.000004825927,0.000003208121,0.9992087,0.0001459583,0.0003069173,0.0002657777,0.000002068681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02053808,0.0002047669,0.9757054,0.0001369613,0.00005433923,0.00009995161,0.00005141487,0.0005801698,0.002628978],"genre_scores_gemma":[0.210221,0.0001787622,0.7845681,0.0001502527,0.00007043473,0.0004366097,0.0002230703,0.0002165237,0.003935282],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008895929,"threshold_uncertainty_score":0.01768833,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021601290","doi":"10.1007/s10898-011-9732-z","title":"An experimental methodology for response surface optimization methods","year":2011,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Mathematical optimization; Gaussian process; Global optimization; Gaussian; Set (abstract data type); Function (biology); Dimension (graph theory); Test functions for optimization; Scaling; Surface (topology); Optimization problem; Algorithm; Computer science; Multi-swarm optimization","authors":[{"name":"Daniel J. Lizotte","is_ca":false},{"name":"Russell Greiner","is_ca":true},{"name":"Dale Schuurmans","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09512033817134276,"gpt":0.4191384652855515,"spread":0.3240181271142088,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004703624,0.0009936568,0.00071344,0.0008056608,0.0006777779,0.0009708502,0.001667954,0.001070754,0.01143308],"category_scores_gemma":[0.008847807,0.0004647468,0.0005558112,0.001005278,0.001004982,0.001319326,0.001517935,0.001540407,0.002126787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000415389,"about_ca_system_score_gemma":0.000840191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003010919,"about_ca_topic_score_gemma":0.0003097355,"domain_scores_codex":[0.9949948,0.002015794,0.0002899314,0.0004298407,0.002107883,0.0001618656],"domain_scores_gemma":[0.996222,0.001331289,0.0002069587,0.001048311,0.001128104,0.00006324537],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006075365,0.001395899,0.0008927428,0.001375199,0.0001043265,0.0001063144,0.0002448327,0.04157187,0.4637885,0.119493,0.005816933,0.3646029],"study_design_scores_gemma":[0.0003795185,0.002637566,0.002244632,0.0001702913,0.00008314694,0.0003053817,0.0002001846,0.4654972,0.4373709,0.03381909,0.05712654,0.0001656634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006394309,0.0001185016,0.9886994,0.0001158626,0.0001143325,0.0003411337,0.0001401965,0.00063091,0.003445434],"genre_scores_gemma":[0.1490359,0.000294637,0.8438289,0.0001386597,0.00007078952,0.002436618,0.0003050597,0.0003898901,0.00349954],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01143308,"threshold_uncertainty_score":0.03824753,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999777494","doi":"10.1007/s10898-004-9971-3","title":"Comparative Assessment of Algorithms and Software for Global Optimization","year":2005,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Solver; Computer science; Software; Implementation; Stochastic programming; Mathematical optimization; Theoretical computer science; Algorithm; Software engineering; Programming language; Mathematics","authors":[{"name":"Charoenchai Khompatraporn","is_ca":false},{"name":"János D. Pintér","is_ca":true},{"name":"Zelda B. Zabinsky","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05312631796310618,"gpt":0.4253711833736167,"spread":0.3722448654105106,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01602134,0.0009569924,0.001103043,0.006692927,0.0006682248,0.003526507,0.001437486,0.00185032,0.00364049],"category_scores_gemma":[0.06745527,0.0003282708,0.001275725,0.00519406,0.001539054,0.004137992,0.002008556,0.001167593,0.0005866862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001849388,"about_ca_system_score_gemma":0.001771721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001915606,"about_ca_topic_score_gemma":0.002148025,"domain_scores_codex":[0.9853829,0.007049202,0.0006465056,0.0006378692,0.005956616,0.000326842],"domain_scores_gemma":[0.9043152,0.07223959,0.00217205,0.008812008,0.01176992,0.000691217],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001999674,0.0005334741,0.01008253,0.001094499,0.000502667,0.00005915332,0.0004052696,0.2466391,0.005739595,0.116636,0.005411658,0.6108964],"study_design_scores_gemma":[0.0002971999,0.002821482,0.01662434,0.000463954,0.0005128611,0.0002294184,0.0006404253,0.8611844,0.0117131,0.08491189,0.02047511,0.0001258515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3766096,0.01750063,0.5395496,0.00201961,0.0005252823,0.0003287048,0.0007136934,0.002969529,0.05978343],"genre_scores_gemma":[0.7683554,0.003917061,0.2219804,0.0002173429,0.0002083268,0.0002595465,0.001046951,0.0009124953,0.003102527],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01602134,"threshold_uncertainty_score":0.08472997,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2002285779","doi":"10.1007/s10898-006-9065-5","title":"Extremal problems for convex polygons","year":2006,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Polytechnique Montréal","funders":"","keywords":"Mathematics; Regular polygon; Polygon (computer graphics); Combinatorics; Convex polygon; Perimeter; Series (stratigraphy); Linear programming; Mathematical optimization; Discrete mathematics; Geometry; Computer science","authors":[{"name":"Charles Audet","is_ca":true},{"name":"Pierre Hansen","is_ca":true},{"name":"Frédéric Messine","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009376869784567364,"gpt":0.2353780241406865,"spread":0.2260011543561192,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001510683,0.001000796,0.001536075,0.002133571,0.001144651,0.002522356,0.00172701,0.001857367,0.004621595],"category_scores_gemma":[0.009664186,0.001011461,0.0009372731,0.001133755,0.002292873,0.002587807,0.002811859,0.00342055,0.0003534635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001071954,"about_ca_system_score_gemma":0.0004836296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00101115,"about_ca_topic_score_gemma":0.001220226,"domain_scores_codex":[0.9992237,0.0003528118,0.00003334465,0.00009757451,0.0002020579,0.00009056861],"domain_scores_gemma":[0.9973453,0.001845825,0.0002702371,0.0001273946,0.0002198911,0.0001914511],"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.0001078938,0.00004814499,0.0004445856,0.0001806911,0.00004490389,0.0001428524,0.0001381317,0.1001745,0.001034044,0.8733527,0.004679849,0.01965168],"study_design_scores_gemma":[0.00001780217,0.00002441804,0.0002301254,0.0000468562,0.00001478451,0.0001008433,0.00007567882,0.3525453,0.000425153,0.6435275,0.002976944,0.00001454152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.105054,0.004067337,0.8318484,0.002458803,0.0003863386,0.000107388,0.0003215481,0.0001673094,0.05558874],"genre_scores_gemma":[0.7961025,0.003112493,0.1723584,0.0002956473,0.0006225395,0.0002228576,0.0007273443,0.0004222808,0.02613593],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004621595,"threshold_uncertainty_score":0.01546079,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1606362855","doi":"10.1023/a:1011280023547","title":"Capacity and flow assignment of data networks by generalized Benders decomposition","year":2001,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Mathematics; Decomposition; Mathematical optimization; Flow network; Network topology; Benders' decomposition; Multi-commodity flow problem; Decomposition method (queueing theory); Flow (mathematics); Integer (computer science); Regular polygon; Measure (data warehouse); Function (biology); Integer programming; Quality of service; Computer science; Discrete mathematics; Computer network","authors":[{"name":"Philippe Mahey","is_ca":false},{"name":"Abdelhamid Benchakroun","is_ca":true},{"name":"Florence Boyer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01915627088536034,"gpt":0.2574983124426431,"spread":0.2383420415572828,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001844582,0.001274014,0.001447924,0.001474818,0.0006990123,0.001670601,0.001453609,0.0009783664,0.004941447],"category_scores_gemma":[0.004568692,0.001010636,0.001065656,0.002203109,0.001362132,0.002378438,0.001317137,0.001756776,0.0005484398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001582753,"about_ca_system_score_gemma":0.001587809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006455468,"about_ca_topic_score_gemma":0.004418452,"domain_scores_codex":[0.999166,0.0004244659,0.00002589999,0.0001022757,0.0001415195,0.0001399733],"domain_scores_gemma":[0.9988123,0.0006870168,0.0001157475,0.0001124883,0.000179319,0.00009318676],"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.0001189833,0.00005071826,0.0001560867,0.00005494741,0.00002832037,0.00001737954,0.00005678475,0.9298301,0.0009564605,0.04522025,0.001822401,0.02168768],"study_design_scores_gemma":[0.00001660606,0.00001445866,0.00005762158,0.000007498485,0.00000812884,0.000006284613,0.00001423981,0.9334906,0.0002972075,0.06549918,0.0005813906,0.000006829239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03021841,0.0003533578,0.9625965,0.0003318315,0.00005924629,0.0000907646,0.0003154529,0.0002571138,0.005777297],"genre_scores_gemma":[0.5173706,0.0009047699,0.4713646,0.0001962701,0.0001556942,0.0003996822,0.0006700756,0.000357862,0.008580433],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006455468,"threshold_uncertainty_score":0.01653075,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2761472785","doi":"10.1007/s10898-017-0574-1","title":"Order-based error for managing ensembles of surrogates in mesh adaptive direct search","year":2017,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Benchmark (surveying); Surrogate model; Mathematical optimization; Global optimization; Computer science; Mathematics; Machine learning; Algorithm","authors":[{"name":"Charles Audet","is_ca":true},{"name":"Michael Kokkolaras","is_ca":true},{"name":"Sébastien Le Digabel","is_ca":true},{"name":"Bastien Talgorn","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03303527240385088,"gpt":0.3275313214449492,"spread":0.2944960490410983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003764294,0.0008228446,0.001310847,0.0009095775,0.0006843996,0.001305664,0.001770575,0.002069796,0.0015317],"category_scores_gemma":[0.01483888,0.0006258666,0.0007515642,0.0006386239,0.001070233,0.001883581,0.002657278,0.001865753,0.0003080184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000923852,"about_ca_system_score_gemma":0.001233982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003706644,"about_ca_topic_score_gemma":0.004249885,"domain_scores_codex":[0.9989067,0.0004047462,0.00007858136,0.00009079981,0.0004443187,0.00007482606],"domain_scores_gemma":[0.9944291,0.003450783,0.000286284,0.0006845631,0.0009380187,0.000211212],"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.00007292684,0.00004685598,0.0004680398,0.0000519547,0.0000255415,0.00002528443,0.0000463359,0.957311,0.001221699,0.02082968,0.0004963854,0.01940434],"study_design_scores_gemma":[0.00000217037,0.000007810028,0.00002054302,0.000002879027,0.000001887972,0.000002790544,0.000001952068,0.9974269,0.0001762149,0.002260763,0.00009396292,0.000001953014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0150006,0.0002348205,0.9827916,0.0001239306,0.0001158862,0.0000398974,0.00003497046,0.000120352,0.001538004],"genre_scores_gemma":[0.5132445,0.0004455368,0.4798346,0.0001878917,0.000164757,0.0003286937,0.0002412368,0.0003861602,0.005166762],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003764294,"threshold_uncertainty_score":0.01990771,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052741439","doi":"10.1007/s10898-008-9395-6","title":"Towards global bilevel dynamic optimization","year":2009,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"National Science Foundation","keywords":"Bilevel optimization; Mathematical optimization; Mathematics; Optimization problem; Global optimization","authors":[{"name":"Alexander Mitsos","is_ca":false},{"name":"Benoît Chachuat","is_ca":true},{"name":"Paul I. Barton","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007580607459892368,"gpt":0.2645765146161052,"spread":0.2569959071562128,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001868225,0.001549247,0.001997025,0.0009525365,0.0005742405,0.002165283,0.001261062,0.001769108,0.004112813],"category_scores_gemma":[0.005460308,0.001151722,0.000950499,0.001042456,0.001980534,0.002707214,0.006121011,0.003639632,0.001340846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006976078,"about_ca_system_score_gemma":0.0008182208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00112388,"about_ca_topic_score_gemma":0.001352655,"domain_scores_codex":[0.9993643,0.0002446277,0.00003054887,0.0001025898,0.0002059314,0.00005197692],"domain_scores_gemma":[0.999023,0.0004501927,0.00006313389,0.0001847812,0.0002021182,0.00007684137],"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.00007708622,0.00006164298,0.0002525779,0.0001579822,0.00008085017,0.00005053538,0.0001896823,0.5311445,0.002382344,0.3743874,0.00381993,0.0873954],"study_design_scores_gemma":[0.000008822169,0.00002777932,0.00003149395,0.00002190781,0.00000991888,0.00001967243,0.00002557809,0.7894809,0.0004082657,0.2060276,0.003930082,0.000007944826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003063627,0.0001825904,0.9919794,0.0002306713,0.00004448496,0.00001040527,0.00001641991,0.0001330853,0.004339321],"genre_scores_gemma":[0.3151175,0.001133275,0.6634849,0.0006420208,0.0002082375,0.0002239577,0.0002461677,0.001018046,0.01792596],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004112813,"threshold_uncertainty_score":0.01375872,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2396268331","doi":"10.1007/s10898-016-0438-0","title":"Robust optimization approximation for joint chance constrained optimization problem","year":2016,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Bounding overwatch; Robust optimization; Optimization problem; Mathematics; Convexity; Constrained optimization; Probabilistic logic; Constraint (computer-aided design); Continuous optimization; Computer science; Multi-swarm optimization; Artificial intelligence","authors":[{"name":"Yuan Yuan","is_ca":true},{"name":"Zukui Li","is_ca":true},{"name":"Biao Huang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07599725735112603,"gpt":0.3229622976148248,"spread":0.2469650402636987,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003125215,0.001375091,0.002315302,0.001058167,0.0003442618,0.001808033,0.001551254,0.001906078,0.003306006],"category_scores_gemma":[0.009608589,0.0007753408,0.001183684,0.001011945,0.001034535,0.001536761,0.001770547,0.002157204,0.0005402577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001085229,"about_ca_system_score_gemma":0.001519002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005654855,"about_ca_topic_score_gemma":0.002642111,"domain_scores_codex":[0.9988121,0.0005683468,0.00004575642,0.000154265,0.0003072953,0.0001123251],"domain_scores_gemma":[0.9967598,0.00232843,0.0002684182,0.0001629082,0.0003723349,0.000108002],"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.00005479317,0.00002738396,0.0001986682,0.00009022759,0.00005579602,0.00004441121,0.00002264322,0.9588389,0.0004855927,0.02804686,0.001151706,0.01098306],"study_design_scores_gemma":[0.000003217775,0.000006358543,0.00002090433,0.000004906529,0.000004310065,0.000005330449,0.000001533508,0.9960952,0.00004868191,0.003660671,0.0001467352,0.000002114821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005076363,0.0004443896,0.9918191,0.0002087358,0.00004215186,0.00001744016,0.00003924477,0.00008703661,0.00226543],"genre_scores_gemma":[0.5425694,0.001471047,0.4443279,0.0002997362,0.000291815,0.0003528171,0.0006331471,0.0003440159,0.009710141],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005654855,"threshold_uncertainty_score":0.01652795,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3033072407","doi":"10.1007/s10898-020-00949-1","title":"Advances in verification of ReLU neural networks","year":2020,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"MNIST database; Artificial neural network; Solver; Computer science; Deep neural networks; Artificial intelligence; Set (abstract data type); Integer programming; Theoretical computer science; Machine learning; Algorithm; Programming language","authors":[{"name":"Ansgar Rössig","is_ca":false},{"name":"Milena Petković","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008913140916029237,"gpt":0.2572706877657535,"spread":0.2483575468497242,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005923365,0.001571966,0.001397418,0.00133162,0.0009308117,0.002906774,0.002970469,0.002161965,0.007310069],"category_scores_gemma":[0.0380627,0.001080774,0.002842907,0.001062625,0.003631173,0.003907194,0.004184741,0.004032359,0.001077427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002222262,"about_ca_system_score_gemma":0.002868834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00388209,"about_ca_topic_score_gemma":0.003660052,"domain_scores_codex":[0.9915725,0.003658331,0.0004748562,0.001300253,0.00232713,0.0006669859],"domain_scores_gemma":[0.9707295,0.02210033,0.001444606,0.003116219,0.002252213,0.0003570137],"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.0003215776,0.0001675429,0.0023881,0.0008173129,0.0001564492,0.0003747939,0.000295362,0.712724,0.005273216,0.1963347,0.003477029,0.07766987],"study_design_scores_gemma":[0.00002828605,0.00003428228,0.0001035355,0.00007248012,0.00001713078,0.000054914,0.00003040565,0.9140067,0.002741534,0.08042602,0.002471465,0.00001328193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03633248,0.001180904,0.9495678,0.001366893,0.0001960449,0.000123315,0.000297204,0.00266101,0.008274287],"genre_scores_gemma":[0.5624532,0.0009194614,0.429542,0.0009081019,0.000180547,0.0003279579,0.0008658885,0.0009172317,0.003885611],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007310069,"threshold_uncertainty_score":0.03132612,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2944554922","doi":"10.1007/s10898-019-00782-1","title":"Preference-based evolutionary multi-objective optimization for portfolio selection: a new credibilistic model under investor preferences","year":2019,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Ministerio de Economía y Competitividad; Concordia University","keywords":"Selection (genetic algorithm); Preference; Mathematics; Portfolio; Mathematical optimization; Multi-objective optimization; Portfolio optimization; Econometrics; Machine learning; Computer science; Statistics; Business; Finance","authors":[{"name":"Ana Belén Mirete Ruíz","is_ca":false},{"name":"Rubén Saborido","is_ca":true},{"name":"José D. Bermúdez","is_ca":false},{"name":"Mariano Luque","is_ca":false},{"name":"Enriqueta Vercher","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04571095833041305,"gpt":0.2849508484444216,"spread":0.2392398901140086,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003645885,0.0009889393,0.001576619,0.001127437,0.0006190921,0.002123051,0.002986133,0.002504248,0.00389534],"category_scores_gemma":[0.0090574,0.0007227713,0.001156988,0.001600083,0.001357704,0.00282982,0.001676624,0.002081896,0.0003999757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001244143,"about_ca_system_score_gemma":0.001043721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002709066,"about_ca_topic_score_gemma":0.002726196,"domain_scores_codex":[0.9985484,0.0008243674,0.00005553848,0.0001439025,0.0003185107,0.0001091269],"domain_scores_gemma":[0.9977685,0.001396095,0.0002478643,0.0001390983,0.0003019371,0.0001465669],"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.0000443025,0.00006745539,0.0005184417,0.00006520348,0.00006784792,0.000103155,0.00006132828,0.8644364,0.0004186679,0.120825,0.0007950523,0.01259714],"study_design_scores_gemma":[0.000007876891,0.0000138756,0.00005028474,0.000006120843,0.000007407555,0.00001316356,0.000003351847,0.9869671,0.00002986446,0.01270455,0.0001916311,0.000004683257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0218057,0.0003673436,0.9684809,0.000703702,0.00007084462,0.00005636065,0.00007314765,0.00004742088,0.008394494],"genre_scores_gemma":[0.8032152,0.0009058024,0.1794051,0.0004191822,0.0001678914,0.0003070868,0.0001441127,0.00006172681,0.01537388],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00389534,"threshold_uncertainty_score":0.01928151,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965468942","doi":"10.1007/s10898-008-9371-1","title":"A new Lagrangean approach to the pooling problem","year":2008,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Heuristics; Mathematical optimization; Benchmark (surveying); Pooling; Relaxation (psychology); Nonlinear system; Upper and lower bounds; Set (abstract data type); Bilinear interpolation; Function (biology); Nonlinear programming; Applied mathematics; Computer science; Statistics; Artificial intelligence","authors":[{"name":"Hossa Almutairi","is_ca":true},{"name":"Samir Elhedhli","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05188978761513707,"gpt":0.332848798223235,"spread":0.280959010608098,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003403685,0.001079137,0.001288496,0.0008627155,0.0009471772,0.00208701,0.002952564,0.002042107,0.007391117],"category_scores_gemma":[0.006041137,0.0008918954,0.00121415,0.001182031,0.001813693,0.004827939,0.004119455,0.003295987,0.001092565],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00131794,"about_ca_system_score_gemma":0.002009665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002028992,"about_ca_topic_score_gemma":0.00275561,"domain_scores_codex":[0.9988556,0.0005319312,0.00005741433,0.0001967111,0.0002830472,0.00007534365],"domain_scores_gemma":[0.9988157,0.0006416823,0.00008646946,0.0001371864,0.000208731,0.000110329],"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.00005951387,0.00006962623,0.0001823123,0.0001035862,0.00007431774,0.00009391203,0.0001123281,0.1059514,0.002011233,0.8392683,0.005534693,0.04653865],"study_design_scores_gemma":[0.0000199854,0.00003272189,0.00006800726,0.0000166442,0.00001919316,0.00005369484,0.0000143119,0.6471155,0.000459132,0.3468091,0.005372772,0.00001899077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002109959,0.0002295132,0.9925709,0.0004978134,0.00009143956,0.00001735402,0.00003433741,0.00003818204,0.00441054],"genre_scores_gemma":[0.136737,0.001135613,0.8228672,0.0007800974,0.0008670068,0.000321204,0.000253876,0.0003976162,0.03664048],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007391117,"threshold_uncertainty_score":0.02472579,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087914194","doi":"10.1007/s10898-005-3839-z","title":"Lower Semicontinuous Regularization for Vector-Valued Mappings","year":2006,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"Conseil Régional du Limousin","keywords":"Mathematics; Regularization (linguistics); Scalar (mathematics); Limit (mathematics); Pure mathematics; Lattice (music); Vector space; Upper and lower bounds; Mathematical analysis; Geometry; Computer science","authors":[{"name":"Mohamed Mansour","is_ca":false},{"name":"Abdelmoutalib Metrane","is_ca":true},{"name":"Michel Théra","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005521688878268117,"gpt":0.2223214039018633,"spread":0.2167997150235952,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005687164,0.001509664,0.001936578,0.00193441,0.0008919478,0.002828114,0.001777792,0.002621449,0.002532991],"category_scores_gemma":[0.01341583,0.0009613773,0.001162195,0.001328113,0.003267086,0.003653328,0.003739479,0.005236692,0.0004473461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002610925,"about_ca_system_score_gemma":0.001768467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002743229,"about_ca_topic_score_gemma":0.002264899,"domain_scores_codex":[0.9983842,0.0008073807,0.00009103594,0.0001877051,0.0004114726,0.000118244],"domain_scores_gemma":[0.9932266,0.004250988,0.0004685505,0.000473638,0.0009831742,0.0005970158],"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.0001809192,0.0001405275,0.0005022869,0.0002754805,0.00007802318,0.0001727506,0.0002865429,0.1042534,0.00953769,0.8524627,0.003789886,0.02831972],"study_design_scores_gemma":[0.00001639845,0.00005357108,0.0002457689,0.00003659555,0.00001124791,0.00006651311,0.00003794222,0.5407525,0.0007396226,0.4559911,0.002030225,0.0000184282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04776436,0.001665533,0.9367716,0.001915896,0.0001755653,0.00006139105,0.0001349341,0.0001815316,0.01132928],"genre_scores_gemma":[0.6887246,0.003427473,0.2467386,0.001318974,0.0007659084,0.0004899389,0.0008992166,0.0008312077,0.05680406],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005687164,"threshold_uncertainty_score":0.03007692,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1901524206","doi":"10.1007/s10898-015-0373-5","title":"On Slater’s condition and finite convergence of the Douglas–Rachford algorithm for solving convex feasibility problems in Euclidean spaces","year":2015,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Convergence (economics); Euclidean geometry; Context (archaeology); Projection (relational algebra); Constraint (computer-aided design); Regular polygon; Mathematical optimization; Applied mathematics; Euclidean space; Algorithm; Convex optimization; Mathematical analysis; Geometry","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Minh N. Dao","is_ca":true},{"name":"Dominikus Noll","is_ca":false},{"name":"Hung M. Phan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02642004899376784,"gpt":0.2788745590008693,"spread":0.2524545100071015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0155401,0.001901897,0.00283246,0.003085986,0.001583496,0.003112949,0.003833399,0.003916177,0.008102413],"category_scores_gemma":[0.05258688,0.001273309,0.002859853,0.002280826,0.007578131,0.006649023,0.005845074,0.007646095,0.001223712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002050204,"about_ca_system_score_gemma":0.003753058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006736434,"about_ca_topic_score_gemma":0.005352689,"domain_scores_codex":[0.9959263,0.00203691,0.0002340191,0.0004822634,0.000922305,0.0003982635],"domain_scores_gemma":[0.9731324,0.02041782,0.0008492875,0.00135842,0.003287981,0.0009540167],"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.0005021173,0.0001264046,0.0008004918,0.0004096454,0.00009582812,0.000206166,0.0004742341,0.1884027,0.004490339,0.7706927,0.003641286,0.03015805],"study_design_scores_gemma":[0.0000716298,0.0001727076,0.0002850786,0.0001065465,0.00002437007,0.00007600558,0.00007817381,0.8083875,0.002077509,0.1865772,0.002078733,0.00006447122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02787344,0.001102404,0.9567913,0.000918393,0.0003076548,0.0001426383,0.0001102731,0.000161527,0.01259224],"genre_scores_gemma":[0.4604481,0.001689642,0.5222361,0.0008164803,0.0003893477,0.0005433459,0.0004439061,0.0008694352,0.01256364],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0155401,"threshold_uncertainty_score":0.08218485,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2079646161","doi":"10.1007/s10898-007-9270-x","title":"An inexact proximal point method for solving generalized fractional programs","year":2008,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":22,"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","funders":"","keywords":"Mathematics; Mathematical optimization; Regularization (linguistics); Rate of convergence; Parametric statistics; Convergence (economics); Applied mathematics; Regular polygon; Term (time); Computer science; Key (lock)","authors":[{"name":"Jean Jacques Strodiot","is_ca":false},{"name":"Jean-Pierre Crouzeix","is_ca":false},{"name":"Jacques A. Ferland","is_ca":true},{"name":"Van Hien Nguyen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02341616659943074,"gpt":0.3095328237218821,"spread":0.2861166571224514,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001563267,0.0008829209,0.001628564,0.0007856858,0.0007546911,0.001026229,0.00145854,0.001989736,0.00289693],"category_scores_gemma":[0.003306903,0.0005930269,0.0008336385,0.0009259683,0.00137904,0.001042743,0.001883557,0.002550021,0.0005134784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005152183,"about_ca_system_score_gemma":0.001313885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00250484,"about_ca_topic_score_gemma":0.002679781,"domain_scores_codex":[0.9994187,0.0002245775,0.00001934212,0.00005749762,0.0002441407,0.00003584888],"domain_scores_gemma":[0.9993167,0.0003855478,0.00003908479,0.00006344039,0.0001495147,0.00004572901],"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.0001516037,0.0001258236,0.0002318077,0.0002849527,0.00007583539,0.000154464,0.0001804406,0.727278,0.005468095,0.13428,0.002898224,0.1288707],"study_design_scores_gemma":[0.00001053071,0.0000295429,0.00002642162,0.00001153914,0.000008822258,0.00002052275,0.000008330075,0.9848726,0.0005300611,0.0126363,0.001838056,0.000007275882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00286946,0.0001345427,0.9951612,0.00007683733,0.00007600273,0.00002092099,0.00001259627,0.00007720099,0.001571236],"genre_scores_gemma":[0.1227084,0.000412424,0.8691291,0.0001266547,0.0001303202,0.0001962265,0.00005699267,0.0001522273,0.007087693],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00289693,"threshold_uncertainty_score":0.009691238,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2082247794","doi":"10.1007/s10898-012-9946-8","title":"Optimization methodology assessment for the inlet velocity profile of a hydraulic turbine draft tube: part I—computer optimization techniques","year":2012,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Cavitation Phenomena in Pumps","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Polytechnique Montréal","keywords":"Draft tube; Inlet; Computational fluid dynamics; Tube (container); Turbine; Flow (mathematics); Fluent; Range (aeronautics); Hull; Mechanical engineering; Mechanics; Engineering; Simulation; Marine engineering; Aerospace engineering; Physics","authors":[{"name":"Sergio Galván","is_ca":false},{"name":"Carlos Rubio","is_ca":false},{"name":"Jesús Pacheco","is_ca":false},{"name":"Crisanto Mendoza","is_ca":false},{"name":"Miguel Toledo Velázquez","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02558329019184007,"gpt":0.3012648757875383,"spread":0.2756815855956982,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008038859,0.0005089166,0.0006803228,0.0005374608,0.0004886686,0.0007397781,0.0004539837,0.000751846,0.001771508],"category_scores_gemma":[0.002163227,0.0003161803,0.0006315277,0.0004510094,0.0003472869,0.0005288286,0.0004061002,0.0006468324,0.0002485349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000546365,"about_ca_system_score_gemma":0.001172297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006151869,"about_ca_topic_score_gemma":0.0031993,"domain_scores_codex":[0.9997393,0.0001325461,0.00001107064,0.00003065441,0.00006530216,0.00002103528],"domain_scores_gemma":[0.9991977,0.0004570408,0.00004670081,0.00003898803,0.0002423054,0.00001734676],"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.00004996851,0.00004833084,0.0005005489,0.00007758733,0.00001853768,0.00002476909,0.00003288715,0.9579899,0.004819706,0.003746806,0.0003711873,0.03231972],"study_design_scores_gemma":[0.000002884658,0.00001454034,0.0001446695,0.000003023799,0.000002722874,0.000004936934,0.000004904788,0.998507,0.0009000052,0.000246414,0.000166284,0.000002571066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07299293,0.0003189745,0.9187588,0.0001582557,0.00003332509,0.00009520262,0.00005512034,0.0002683889,0.007319058],"genre_scores_gemma":[0.7724019,0.0004217414,0.2210907,0.0000569693,0.00003803997,0.0002445479,0.0001395423,0.0002989492,0.005307435],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006151869,"threshold_uncertainty_score":0.01223207,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007576447","doi":"10.1007/s10898-005-3835-3","title":"Variational Methods in Convex Analysis","year":2006,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Subderivative; Mathematics; Convex analysis; Proper convex function; Parallels; Variational analysis; Regular polygon; Convex set; Convex conjugate; Convex combination; Convex optimization; Mathematical optimization; Applied mathematics; Geometry","authors":[{"name":"Jonathan M. Borwein","is_ca":true},{"name":"Qiji Jim Zhu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008219625034438783,"gpt":0.3067541756659409,"spread":0.2985345506315021,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00393905,0.00177635,0.003396244,0.001903672,0.0009107747,0.003291637,0.002052295,0.00283466,0.006758731],"category_scores_gemma":[0.0084883,0.001517332,0.001895932,0.002696378,0.003842429,0.003462759,0.003293324,0.007331626,0.002223104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001962303,"about_ca_system_score_gemma":0.001908845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005187592,"about_ca_topic_score_gemma":0.004686893,"domain_scores_codex":[0.9983317,0.0008314659,0.0000897924,0.0002143984,0.0004582245,0.00007455526],"domain_scores_gemma":[0.9967076,0.002028962,0.0001427538,0.0003731159,0.000598029,0.000149675],"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.00001620429,0.00002340998,0.0001380196,0.0002006034,0.0001032903,0.00003401623,0.0001040355,0.02372897,0.0005585176,0.9235907,0.01390709,0.03759522],"study_design_scores_gemma":[0.00001388097,0.00001448749,0.0002115099,0.00008157225,0.00004292349,0.00006652154,0.00003204426,0.1853468,0.0003147613,0.7813481,0.03250502,0.00002236082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001459853,0.01236313,0.9679552,0.00228605,0.001305361,0.00002760956,0.0001367506,0.0001373196,0.01432866],"genre_scores_gemma":[0.1951905,0.03031225,0.6406574,0.001817476,0.005424902,0.0005737089,0.0007902846,0.001811681,0.1234218],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006758731,"threshold_uncertainty_score":0.02261019,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2002055553","doi":"10.1007/s10898-004-8318-4","title":"Optimality Conditions for D.C. Vector Optimization Problems Under Reverse Convex Constraints","year":2005,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Mathematical optimization; Regular polygon; Convex optimization; Geometry","authors":[{"name":"Nazih Abderrazzak Gadhi","is_ca":false},{"name":"Mohamed Laghdir","is_ca":false},{"name":"Abdelmoutalib Metrane","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01720371333025808,"gpt":0.2794169235117329,"spread":0.2622132101814748,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004027888,0.001738527,0.001255464,0.001588535,0.0006756758,0.002785169,0.001108964,0.002162494,0.009574635],"category_scores_gemma":[0.01386575,0.0008289266,0.0009941075,0.001331439,0.001843597,0.003135627,0.002328871,0.003961751,0.002097968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001302704,"about_ca_system_score_gemma":0.00242786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003398999,"about_ca_topic_score_gemma":0.002255894,"domain_scores_codex":[0.9986993,0.0005202153,0.00009550669,0.0001808357,0.0003228505,0.0001812843],"domain_scores_gemma":[0.9944417,0.003535861,0.0003638688,0.0001922961,0.001259462,0.000206837],"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.0001453039,0.00008479333,0.0005319891,0.0003690936,0.00004114576,0.0002442077,0.0001741136,0.158075,0.003924423,0.7889631,0.01324261,0.03420399],"study_design_scores_gemma":[0.00006375522,0.0001176489,0.0004839852,0.0001307732,0.00002580411,0.0002025229,0.0001414563,0.5878036,0.001780505,0.4005276,0.008680287,0.00004208641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01439979,0.001089849,0.9513258,0.0017284,0.0002064486,0.0001663946,0.0006307157,0.0001108652,0.03034166],"genre_scores_gemma":[0.5554225,0.006147579,0.3974947,0.001523833,0.0008759293,0.001252055,0.002760302,0.0008511902,0.03367183],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009574635,"threshold_uncertainty_score":0.03203028,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043131887","doi":"10.1007/s10898-014-0222-y","title":"The robust crew pairing problem: model and solution methodology","year":2014,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Crew; Mathematical optimization; Nonlinear system; Mathematics; Pairing; Interval (graph theory); Relaxation (psychology); Engineering","authors":[{"name":"Da Lu","is_ca":true},{"name":"Fatma Gzara","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03915311288015694,"gpt":0.2788324183795673,"spread":0.2396793054994104,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001937307,0.00142332,0.00195894,0.001439252,0.0006255577,0.002010731,0.003109767,0.00343484,0.005777205],"category_scores_gemma":[0.003605417,0.001075911,0.001703589,0.001634051,0.001665631,0.002600278,0.003697788,0.002724924,0.001212606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009943377,"about_ca_system_score_gemma":0.002059676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004278605,"about_ca_topic_score_gemma":0.00228306,"domain_scores_codex":[0.9991146,0.0003498399,0.00003066022,0.0002183161,0.0001948494,0.00009185586],"domain_scores_gemma":[0.9989254,0.0004688036,0.000205885,0.0001119302,0.0002031935,0.00008480646],"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.00002828281,0.00007304979,0.0002673162,0.000130448,0.00003908634,0.00006811009,0.0000443205,0.8709961,0.0009406644,0.109778,0.002323161,0.01531152],"study_design_scores_gemma":[0.000005391963,0.00002322676,0.0000539606,0.0000129931,0.00001024746,0.0000259014,0.00001857082,0.9805058,0.0002320242,0.01733392,0.001767234,0.00001067911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00207892,0.0003295069,0.9940199,0.000181543,0.00004375591,0.00004374581,0.0000654413,0.00003854411,0.003198726],"genre_scores_gemma":[0.4208096,0.003554869,0.5432224,0.0003441685,0.0004821933,0.001269352,0.0008044603,0.0003985488,0.0291144],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005777205,"threshold_uncertainty_score":0.01932669,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2294719872","doi":"10.1007/s10898-015-0394-0","title":"Local search algorithm for universal facility location problem with linear penalties","year":2015,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Facility location problem; 1-center problem; Mathematical optimization; Mathematics; Set (abstract data type); Location model; Total cost; Computer science; Algorithm; Operations research","authors":[{"name":"Yicheng Xu","is_ca":false},{"name":"Dachuan Xu","is_ca":false},{"name":"Donglei Du","is_ca":true},{"name":"Chenchen Wu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03017387370649793,"gpt":0.2533858792778074,"spread":0.2232120055713094,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001251786,0.0006865328,0.001790968,0.0008214156,0.0005461437,0.0008636486,0.002078171,0.001403063,0.005719255],"category_scores_gemma":[0.003108215,0.0005913523,0.0006957959,0.001115328,0.0007184292,0.001391463,0.001583922,0.001382828,0.000559545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009548572,"about_ca_system_score_gemma":0.001884874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008000787,"about_ca_topic_score_gemma":0.006279619,"domain_scores_codex":[0.9995166,0.0001725322,0.00002102131,0.0001032122,0.00009616702,0.0000905328],"domain_scores_gemma":[0.9986148,0.0009242341,0.0001072056,0.00007388181,0.0001920822,0.00008771004],"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.0001548398,0.0001110506,0.000324597,0.0001234711,0.00003826111,0.00004846969,0.00004590922,0.9371701,0.0007953256,0.01208506,0.003051548,0.04605137],"study_design_scores_gemma":[0.00002221019,0.00002675629,0.00003582505,0.000005021344,0.000004663917,0.000008471834,0.000006917695,0.9976842,0.0001061323,0.001932154,0.000164743,0.000002809826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01710968,0.0003345445,0.9788361,0.0002091665,0.00004437023,0.00005356279,0.00006911513,0.0004054914,0.002937925],"genre_scores_gemma":[0.5358356,0.0003281446,0.4540847,0.0002426675,0.00007580751,0.000422431,0.0003637433,0.0002252117,0.00842169],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008000787,"threshold_uncertainty_score":0.01913279,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105046377","doi":"10.1023/a:1024847308982","title":"Cyclic Just-In-Time Sequences Are Optimal","year":2003,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Assembly Line Balancing 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":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Sequence (biology); Concatenation (mathematics); Product (mathematics); Integer (computer science); Production (economics); Discrete mathematics; Computer science; Geometry","authors":[{"name":"Wiesław Kubiak","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006722708713548566,"gpt":0.2266807671283111,"spread":0.2199580584147625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001562162,0.001484624,0.001327892,0.001171137,0.0008472912,0.001362,0.001028977,0.001710569,0.01285833],"category_scores_gemma":[0.01453776,0.0007021169,0.0006439335,0.001755203,0.00154965,0.003270058,0.001314939,0.001757244,0.001056184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006920317,"about_ca_system_score_gemma":0.002155003,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001108939,"about_ca_topic_score_gemma":0.001601872,"domain_scores_codex":[0.9989554,0.0003130543,0.00006348147,0.0001960472,0.0002378691,0.000234213],"domain_scores_gemma":[0.9934642,0.004089548,0.0005490389,0.0006616398,0.0008612038,0.0003743165],"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.0007980189,0.0001966962,0.0007340538,0.0003453595,0.00007403512,0.0001184501,0.0001420956,0.4878072,0.004914924,0.3920137,0.01191118,0.1009443],"study_design_scores_gemma":[0.00007985222,0.0002826286,0.0003989227,0.00007488491,0.0000380394,0.000133179,0.0000698844,0.5708975,0.002577692,0.4212833,0.004131521,0.00003261001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1224331,0.001291047,0.8302757,0.001192733,0.0007031826,0.0001865826,0.0004511205,0.0007203072,0.04274632],"genre_scores_gemma":[0.7959325,0.001691097,0.1818627,0.0008593831,0.0003908979,0.0003250181,0.0008516259,0.0006383214,0.0174484],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01285833,"threshold_uncertainty_score":0.04301542,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3036119246","doi":"10.1007/s10898-020-00915-x","title":"Generalized risk parity portfolio optimization: an ADMM approach","year":2020,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Portfolio optimization; Mathematics; Mathematical optimization; Portfolio; Optimization problem; Coherent risk measure; Convex optimization; Risk measure; Regular polygon; Economics; Finance","authors":[{"name":"Giorgio Costa","is_ca":true},{"name":"Roy H. Kwon","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06904678787804504,"gpt":0.3482783259159813,"spread":0.2792315380379363,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002716854,0.001451992,0.001956044,0.0007923994,0.000379479,0.002000337,0.002009033,0.00269817,0.003260402],"category_scores_gemma":[0.005827226,0.000867306,0.0009265341,0.001297821,0.001239867,0.002061438,0.002115968,0.003113547,0.0006333004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006323641,"about_ca_system_score_gemma":0.001331221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001261111,"about_ca_topic_score_gemma":0.001137374,"domain_scores_codex":[0.9991701,0.0004458533,0.0000347235,0.0001045403,0.00020255,0.00004219735],"domain_scores_gemma":[0.9987098,0.0007326438,0.00010141,0.0001197864,0.0002671681,0.00006921726],"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.00006777218,0.00007616953,0.0002449248,0.000186308,0.0001102151,0.0001189137,0.00003417107,0.7990498,0.001457504,0.1472097,0.003749457,0.04769507],"study_design_scores_gemma":[0.000008912131,0.00001318012,0.0000250674,0.000009780662,0.000009586977,0.0000207198,0.000003172313,0.9760588,0.0001325251,0.0231666,0.0005469815,0.000004571517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001946934,0.0003907806,0.99327,0.0003460918,0.000130462,0.0000180061,0.00003039151,0.00004436978,0.003822993],"genre_scores_gemma":[0.2265805,0.001334434,0.7566307,0.0006765476,0.0005763074,0.0002389429,0.0002332636,0.0002222998,0.01350706],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003260402,"threshold_uncertainty_score":0.0143683,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2792821451","doi":"10.1007/s10898-018-0634-1","title":"A sampling-based exact algorithm for the solution of the minimax diameter clustering problem","year":2018,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal; Polytechnique Montréal","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Cluster analysis; Minimax; Heuristic; Mathematical optimization; Algorithm; Set (abstract data type); Sampling (signal processing); Computer science; Statistics","authors":[{"name":"Daniel Aloise","is_ca":true},{"name":"Claudio Contardo","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0290985115856251,"gpt":0.3178516843701105,"spread":0.2887531727844854,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002144199,0.001156265,0.001873312,0.001326192,0.0009340379,0.001190953,0.002759333,0.00239939,0.005263855],"category_scores_gemma":[0.01045594,0.0007797606,0.0008858981,0.001807446,0.001102091,0.001758896,0.002337175,0.002339118,0.001447955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001449271,"about_ca_system_score_gemma":0.002775816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006051587,"about_ca_topic_score_gemma":0.007410464,"domain_scores_codex":[0.9989113,0.0003108344,0.00005190265,0.0001857929,0.000447191,0.00009301255],"domain_scores_gemma":[0.9972754,0.0016789,0.0001373416,0.000252524,0.000515147,0.0001406791],"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.0003680335,0.0001532507,0.0006776878,0.0002413307,0.00007347618,0.00007660998,0.0002048001,0.6940311,0.004098702,0.03948127,0.008168845,0.2524248],"study_design_scores_gemma":[0.00003862371,0.00003259187,0.00008649044,0.00001125685,0.000006047996,0.0000312236,0.00001529433,0.9891189,0.000369698,0.00924309,0.001038724,0.000007983797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002687825,0.0002017606,0.9954535,0.0001086869,0.00006587474,0.00005299609,0.00003015994,0.0002940965,0.001105145],"genre_scores_gemma":[0.0878602,0.0002539629,0.9084973,0.0001744791,0.0001111654,0.000364853,0.000215882,0.0001878359,0.002334351],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006051587,"threshold_uncertainty_score":0.01760936,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001516627","doi":"10.1007/s10898-014-0183-1","title":"Solving the planar p-median problem by variable neighborhood and concentric searches","year":2014,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":16,"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":"Agence Nationale de la Recherche","keywords":"Mathematics; Concentric; Planar; Heuristic; Variable (mathematics); Mathematical optimization; Variable neighborhood search; Plane (geometry); Decomposition; Optimization problem; Algorithm; Metaheuristic; Geometry; Computer science; Mathematical analysis","authors":[{"name":"Zvi Drezner","is_ca":false},{"name":"Jack Brimberg","is_ca":true},{"name":"Nenad Mladenović","is_ca":false},{"name":"Saı̈d Salhi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008999484427241255,"gpt":0.2018814808665637,"spread":0.1928819964393225,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001037737,0.0007289001,0.001486971,0.001098833,0.0007186942,0.0009769747,0.00172758,0.001720034,0.004432368],"category_scores_gemma":[0.004707195,0.0007019325,0.0009681651,0.001373838,0.0008221447,0.001730002,0.001773722,0.0008897972,0.0004358173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007666668,"about_ca_system_score_gemma":0.001414677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006971051,"about_ca_topic_score_gemma":0.006338132,"domain_scores_codex":[0.9994767,0.0002243613,0.00001919291,0.0001016512,0.0001011862,0.00007692424],"domain_scores_gemma":[0.9986725,0.001001253,0.00009558551,0.00006324912,0.000120665,0.00004677537],"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.0001531131,0.00006301632,0.0005017155,0.00009615772,0.00004780665,0.00004863064,0.00005061732,0.9292123,0.0007199508,0.02273266,0.002234011,0.04414007],"study_design_scores_gemma":[0.00002123676,0.00002927891,0.00004747589,0.000005623025,0.000006069181,0.00001683549,0.00001811892,0.9880297,0.0001913773,0.01114445,0.0004853845,0.000004389096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03231934,0.0003429624,0.9603986,0.0002877577,0.00004396655,0.00005600287,0.00009311146,0.0002533043,0.006204998],"genre_scores_gemma":[0.3926789,0.0002678748,0.6009447,0.0001194421,0.00005687557,0.0001928808,0.0002301429,0.000159502,0.00534967],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006971051,"threshold_uncertainty_score":0.01482779,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2769009861","doi":"10.1007/s10898-017-0590-1","title":"Low-rank matrix completion using nuclear norm minimization and facial reduction","year":2017,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":16,"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":"Matrix completion; Mathematics; Mathematical optimization; Semidefinite programming; Low-rank approximation; Matrix norm; Norm (philosophy); Rank (graph theory); Embedding; Minification; Matrix (chemical analysis); Linear programming; Algorithm; Computer science; Artificial intelligence; Combinatorics","authors":[{"name":"Shimeng Huang","is_ca":true},{"name":"Henry Wolkowicz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01609821826002892,"gpt":0.2661418461865124,"spread":0.2500436279264835,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006484054,0.0008557588,0.0008790026,0.000523731,0.0003608937,0.0008577372,0.0009131535,0.000953118,0.003693071],"category_scores_gemma":[0.002426811,0.0003709207,0.0008125025,0.0006186102,0.001029929,0.001128033,0.001355105,0.001829971,0.001340759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003057853,"about_ca_system_score_gemma":0.00116401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002283554,"about_ca_topic_score_gemma":0.003995789,"domain_scores_codex":[0.9994432,0.0001502435,0.00001861291,0.00009364432,0.0002473841,0.00004688362],"domain_scores_gemma":[0.9993514,0.0002485819,0.00006183209,0.0001401636,0.0001579456,0.00004002923],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003378271,0.0002447574,0.0005880044,0.0003152038,0.00009296086,0.0001766323,0.0002687104,0.3524192,0.06064099,0.09693734,0.01354682,0.4744315],"study_design_scores_gemma":[0.00001326791,0.00006212133,0.000157379,0.000008939481,0.00001018441,0.0001005948,0.0000430966,0.9747332,0.007713601,0.01450113,0.002642366,0.0000141248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00391498,0.00005508829,0.9947083,0.0001200646,0.00002399907,0.00002007736,0.00005312293,0.0001371409,0.0009671643],"genre_scores_gemma":[0.1235336,0.0003040255,0.8681111,0.0001197781,0.00008611548,0.0001201813,0.0004355464,0.0001926271,0.007096934],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003693071,"threshold_uncertainty_score":0.01235455,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1987434446","doi":"10.1007/s10898-012-9969-1","title":"Portfolio selection under model uncertainty: a penalized moment-based optimization approach","year":2012,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Ambiguity; Portfolio; Portfolio optimization; Moment (physics); Mathematical optimization; Flexibility (engineering); Realization (probability); Mathematics; Econometrics; Range (aeronautics); Robust optimization; Selection (genetic algorithm); Computer science; Project portfolio management; Downside risk; Artificial intelligence; Economics; Finance; Statistics; Project management","authors":[{"name":"Jonathan Y. Li","is_ca":true},{"name":"Roy H. Kwon","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06337797441665845,"gpt":0.3594306067613594,"spread":0.2960526323447009,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00448492,0.001415108,0.003152167,0.00160101,0.00050273,0.001950278,0.002439278,0.00256414,0.002535017],"category_scores_gemma":[0.01131405,0.001415157,0.001669647,0.00141058,0.00111819,0.002535227,0.00196689,0.002136999,0.0003882382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008589448,"about_ca_system_score_gemma":0.001373893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002000576,"about_ca_topic_score_gemma":0.001663397,"domain_scores_codex":[0.9980882,0.00115961,0.00007431058,0.0001810763,0.0003875654,0.0001092357],"domain_scores_gemma":[0.9939633,0.004585059,0.0004710009,0.0002837728,0.0005452759,0.0001515951],"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.00005106493,0.00003708876,0.0001815754,0.00006346303,0.000109045,0.00005710031,0.0000164989,0.9676922,0.0004902888,0.01967256,0.0006685434,0.0109606],"study_design_scores_gemma":[0.000004754707,0.000008043829,0.00003001522,0.00000336103,0.00000776313,0.00000651016,8.5779e-7,0.9962181,0.00005544873,0.003572423,0.00008820836,0.000004447765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004205407,0.000245075,0.9942047,0.0002706144,0.0000305071,0.0000169204,0.00002630674,0.00009507651,0.0009053829],"genre_scores_gemma":[0.5621095,0.001225714,0.4265353,0.0005518719,0.0006024401,0.0004015577,0.0003813107,0.0004782924,0.007714068],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00448492,"threshold_uncertainty_score":0.02371883,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156395865","doi":"10.1023/b:jogo.0000026448.63457.51","title":"Variational Analysis of the Abscissa Mapping for Polynomials via the Gauss-Lucas Theorem","year":2004,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Lemma (botany); Pure mathematics; Discrete mathematics; Combinatorics","authors":[{"name":"James V. Burke","is_ca":false},{"name":"Adrian S. Lewis","is_ca":true},{"name":"Michael L. Overton","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02405172828966571,"gpt":0.3041534079869698,"spread":0.280101679697304,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001190991,0.0007241246,0.0009367602,0.001444475,0.001091173,0.001858586,0.001322014,0.001214013,0.003917017],"category_scores_gemma":[0.003483365,0.0004572917,0.000805571,0.0007776401,0.002389384,0.002400713,0.002075272,0.00204084,0.0004646024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002099712,"about_ca_system_score_gemma":0.001655361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00530674,"about_ca_topic_score_gemma":0.00428405,"domain_scores_codex":[0.9996896,0.0001268278,0.0000086975,0.00004230146,0.00008106037,0.00005157978],"domain_scores_gemma":[0.9991384,0.0003527176,0.000113868,0.0000551199,0.0001839843,0.000155876],"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.00001152118,0.00001123576,0.0001357842,0.00001934729,0.00000725987,0.00002465931,0.00005127115,0.0108695,0.0007614039,0.9850575,0.0005980418,0.002452337],"study_design_scores_gemma":[0.00000824693,0.00001701888,0.0002117749,0.00001244924,0.000004915598,0.00003153843,0.00004512849,0.2088494,0.0001763167,0.7891135,0.001516391,0.000013296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2048132,0.002450762,0.7422928,0.003149609,0.0003614438,0.00005596304,0.0002179785,0.0001599635,0.04649829],"genre_scores_gemma":[0.8970209,0.001753609,0.06477607,0.0003060558,0.0005197066,0.00007625145,0.0001773846,0.0002666383,0.03510344],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00530674,"threshold_uncertainty_score":0.01523453,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991964874","doi":"10.1007/s10898-013-0037-2","title":"Abstract convexity of topical functions","year":2013,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Graduate University of Advanced Technology; Indian Council of Agricultural Research; Centre de Recherches Mathématiques","keywords":"Convexity; Mathematics; Subderivative; Characterization (materials science); Homogeneous; Set (abstract data type); Space (punctuation); Polarity (international relations); Pure mathematics; Convex function; Regular polygon; Applied mathematics; Combinatorics; Convex optimization; Geometry; Computer science","authors":[{"name":"H. Mohebi","is_ca":false},{"name":"M. Samet","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01030778035003522,"gpt":0.2372538433532074,"spread":0.2269460630031722,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002326634,0.0009491308,0.001427185,0.00289321,0.00185003,0.004638783,0.001308734,0.001403376,0.01226468],"category_scores_gemma":[0.01188868,0.0007512953,0.001460601,0.002103879,0.003158692,0.00847147,0.002991894,0.003968542,0.001870319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001674492,"about_ca_system_score_gemma":0.001030262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00113939,"about_ca_topic_score_gemma":0.0008321429,"domain_scores_codex":[0.9985762,0.0005292463,0.00007858712,0.0002737778,0.0003181395,0.0002240163],"domain_scores_gemma":[0.993735,0.003118915,0.0004502227,0.0007330193,0.001438624,0.0005242046],"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.00004118965,0.00001785051,0.0003312653,0.00006734406,0.00001725882,0.00006572622,0.0001510189,0.003385216,0.00145708,0.9816033,0.003881769,0.008980935],"study_design_scores_gemma":[0.000007496152,0.00001445452,0.000484217,0.00002295943,0.00001389283,0.0001404628,0.0001241527,0.02321642,0.0007536373,0.970769,0.004442652,0.00001059063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.150677,0.002502616,0.6914065,0.005625916,0.0003326923,0.00007712704,0.0008157662,0.0003291226,0.1482332],"genre_scores_gemma":[0.8866185,0.003384938,0.04431344,0.0008586678,0.001093731,0.0002370836,0.001426426,0.001132291,0.06093497],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01226468,"threshold_uncertainty_score":0.04102939,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3162664130","doi":"10.1007/s10898-021-01019-w","title":"Integrating $$\\varepsilon $$-dominance and RBF surrogate optimization for solving computationally expensive many-objective optimization problems","year":2021,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer 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":"University of Guelph","funders":"National Research Foundation Singapore","keywords":"Mathematical optimization; Surrogate model; Optimization problem; Mathematics; Function (biology); Multi-objective optimization; Evolutionary algorithm; Computer science","authors":[{"name":"Wenyu Wang","is_ca":false},{"name":"Taimoor Akhtar","is_ca":true},{"name":"Christine A. Shoemaker","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01190640232656003,"gpt":0.2696545108687438,"spread":0.2577481085421838,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004778781,0.001692713,0.001915952,0.001138551,0.0005951796,0.001416759,0.001530488,0.002022625,0.002686218],"category_scores_gemma":[0.00787696,0.0006078725,0.001006443,0.00125291,0.0008213879,0.001452341,0.002024354,0.002079374,0.0008185694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000674842,"about_ca_system_score_gemma":0.001766287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004402969,"about_ca_topic_score_gemma":0.006894906,"domain_scores_codex":[0.9981977,0.000868539,0.00007313263,0.00007507706,0.0006596088,0.0001258786],"domain_scores_gemma":[0.9976769,0.001325355,0.0001284603,0.0001324533,0.0006413353,0.00009560028],"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.0001140824,0.0001755561,0.0003854453,0.0002339108,0.00007285272,0.00008227285,0.00006225317,0.8652583,0.003082147,0.04213063,0.003158911,0.08524361],"study_design_scores_gemma":[0.000003264023,0.00001228948,0.00002131039,0.000008964118,0.000002937513,0.000008534798,0.000003319727,0.9967526,0.0002154961,0.00254582,0.0004219654,0.000003490596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003238898,0.0003270901,0.9925656,0.0001456297,0.00008340785,0.00003419048,0.0000236617,0.0001149651,0.003466486],"genre_scores_gemma":[0.2058982,0.0007662238,0.7852952,0.0004211172,0.0001619331,0.0003152926,0.0001882148,0.0004427572,0.006510965],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004778781,"threshold_uncertainty_score":0.02527297,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052697378","doi":"10.1007/s10898-014-0189-8","title":"Exact solution approach for a class of nonlinear bilevel knapsack problems","year":2014,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Air Force Office of Scientific Research; National Science Foundation; Division of Civil, Mechanical and Manufacturing Innovation; U.S. Air Force; Natural Sciences and Engineering Research Council of Canada; U.S. Department of Defense","keywords":"Knapsack problem; Mathematics; Continuous knapsack problem; Mathematical optimization; Constraint (computer-aided design); Nonlinear system; Class (philosophy); Binary number; Function (biology); Integer (computer science); Change-making problem; Quadratic equation; Computer science; Artificial intelligence; Arithmetic","authors":[{"name":"Behdad Beheshti","is_ca":false},{"name":"Osman Y. Özaltın","is_ca":false},{"name":"M. Hosein Zare","is_ca":false},{"name":"Oleg A. Prokopyev","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01597327206172961,"gpt":0.2325935639447818,"spread":0.2166202918830522,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007415313,0.0007354887,0.00114965,0.0007308512,0.0004805652,0.00117647,0.001233259,0.001245819,0.00479133],"category_scores_gemma":[0.002843106,0.0005551316,0.0006902066,0.00109693,0.0006101775,0.001120037,0.001142259,0.001492748,0.0005834945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005507601,"about_ca_system_score_gemma":0.001256255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004210469,"about_ca_topic_score_gemma":0.004510546,"domain_scores_codex":[0.9996272,0.00008095342,0.00001766089,0.00004441999,0.0001820466,0.0000476988],"domain_scores_gemma":[0.9994314,0.0003171552,0.00003743045,0.00005347126,0.0001355565,0.00002492162],"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.00003249491,0.00006742858,0.0002143618,0.000159221,0.00002670016,0.00007438182,0.00005456123,0.8871896,0.0009667852,0.05694956,0.001801503,0.05246349],"study_design_scores_gemma":[0.000005954744,0.00001114251,0.00003454266,0.000008346476,0.00000354759,0.00001740798,0.00001066156,0.9831849,0.0001123689,0.01574713,0.0008608917,0.000003163952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007416723,0.0004912413,0.9816763,0.0001581467,0.00008243821,0.00004036156,0.00005069913,0.00007724371,0.01000678],"genre_scores_gemma":[0.3434231,0.001847082,0.6376642,0.0002616233,0.0002549377,0.0003376747,0.0003090727,0.0001619528,0.01574039],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00479133,"threshold_uncertainty_score":0.01602858,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980552542","doi":"10.1007/s10898-014-0175-1","title":"New heuristic for harmonic means clustering","year":2014,"lang":"en","type":"article","venue":"Journal of Global Optimization","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"Agence Nationale de la Recherche","keywords":"Degeneracy (biology); Heuristic; Cluster analysis; Heuristics; Degenerate energy levels; Mathematics; Consistent heuristic; Mathematical optimization; Harmonic; Algorithm; Computer science; Incremental heuristic search; Search algorithm; Beam search; Statistics","authors":[{"name":"Emilio Carrizosa","is_ca":false},{"name":"Abdulrahman Alguwaizani","is_ca":false},{"name":"Pierre Hansen","is_ca":true},{"name":"Nenad Mladenović","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01794351272686285,"gpt":0.2395191110732201,"spread":0.2215755983463572,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001274201,0.001074338,0.001782236,0.002147557,0.001241153,0.001388725,0.002862591,0.00195346,0.007321804],"category_scores_gemma":[0.00357767,0.0007943182,0.001356821,0.002007558,0.0009697963,0.001466778,0.001482713,0.001430828,0.001312878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001750872,"about_ca_system_score_gemma":0.002230928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01069615,"about_ca_topic_score_gemma":0.01176749,"domain_scores_codex":[0.9991133,0.0002901199,0.0000425689,0.0001625297,0.0002831613,0.0001083914],"domain_scores_gemma":[0.9987092,0.0006137651,0.00006922185,0.0001371105,0.0003892012,0.00008153853],"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.0002482667,0.0001680458,0.0005361084,0.0001694248,0.0001650536,0.00006511049,0.0001234502,0.7427724,0.002704673,0.02478823,0.01023777,0.2180214],"study_design_scores_gemma":[0.00002915598,0.00002988649,0.000104614,0.000007299609,0.00001667047,0.00002490983,0.00001933356,0.9921332,0.0004249474,0.005741467,0.001454604,0.00001393781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01006402,0.0003676689,0.9847701,0.0001786529,0.00025753,0.00008872091,0.00008281592,0.0004207705,0.003769778],"genre_scores_gemma":[0.1535391,0.0002830794,0.8365005,0.0002336571,0.0002171692,0.0003032698,0.000476977,0.0003576668,0.008088664],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01069615,"threshold_uncertainty_score":0.02449387,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2791867344","doi":"10.1007/s10898-018-0612-7","title":"Global optimization of MIQCPs with dynamic piecewise relaxations","year":2018,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Fundação para a Ciência e a Tecnologia; Ontario Research Foundation","keywords":"Mathematics; Mathematical optimization; Global optimization; Piecewise; Bilinear interpolation; Benchmark (surveying); Relaxation (psychology); Integer programming; Integer (computer science); Optimization problem; Branch and price; Nonlinear programming; Branch and bound; Nonlinear system; Computer science","authors":[{"name":"Pedro A. Castillo Castillo","is_ca":true},{"name":"Vladimir Mahalec","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0186278142045024,"gpt":0.3480092862410984,"spread":0.329381472036596,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001524829,0.001459537,0.0016354,0.0008956779,0.0005254867,0.001591488,0.001682379,0.001808996,0.009530558],"category_scores_gemma":[0.006012161,0.0008316677,0.0009240391,0.001242669,0.0009362343,0.001579677,0.002188558,0.002405439,0.0006555636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001089042,"about_ca_system_score_gemma":0.00123489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004712251,"about_ca_topic_score_gemma":0.003645831,"domain_scores_codex":[0.9995149,0.0002024298,0.00001726772,0.00007829869,0.00009154341,0.00009558369],"domain_scores_gemma":[0.9982302,0.001237488,0.0001259032,0.0001083621,0.0001826692,0.000115457],"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.0000600534,0.00002863323,0.0001115293,0.00009829685,0.00002199959,0.00003320607,0.00002576505,0.9672467,0.0003204191,0.02065713,0.001600374,0.00979593],"study_design_scores_gemma":[0.000007132056,0.00002605737,0.00002853021,0.00001030375,0.000005511141,0.000007411759,0.00001154247,0.9932604,0.0001030146,0.006042092,0.0004945394,0.000003382278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02627937,0.001054557,0.9503723,0.000732681,0.0001591492,0.0001008667,0.0002809232,0.0003259782,0.02069404],"genre_scores_gemma":[0.7271041,0.0008775941,0.2555617,0.0004018099,0.0001740609,0.0004243379,0.0005751943,0.0004895317,0.01439172],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009530558,"threshold_uncertainty_score":0.03188282,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032696538","doi":"10.1023/b:jogo.0000006719.64826.55","title":"Portfolio Selection Theory with Different Interest Rates for Borrowing and Leading","year":2003,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"National Natural Science Foundation of China","keywords":"Portfolio; Selection (genetic algorithm); Interest rate; Efficient frontier; Mathematics; Modern portfolio theory; Frontier; Econometrics; Economics; Financial economics; Monetary economics; Computer science; Artificial intelligence; Geography","authors":[{"name":"Shunming Zhang","is_ca":true},{"name":"Shouyang Wang","is_ca":false},{"name":"Xiaotie Deng","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.020246209681051,"gpt":0.2501269094010178,"spread":0.2298806997199668,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006865305,0.000815258,0.001827398,0.001501478,0.0005804669,0.00314658,0.00216768,0.002514343,0.005513647],"category_scores_gemma":[0.01898284,0.0007350067,0.001851831,0.001116048,0.001824202,0.004379111,0.001500501,0.002226539,0.000673903],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001082353,"about_ca_system_score_gemma":0.0005713258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006262189,"about_ca_topic_score_gemma":0.0004989875,"domain_scores_codex":[0.998175,0.001076993,0.00007757515,0.0002282623,0.0002394221,0.0002027327],"domain_scores_gemma":[0.9888892,0.007892638,0.0008866412,0.000774857,0.0009368754,0.0006197939],"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.0001905001,0.00008505371,0.003031459,0.00009842167,0.000196022,0.0002708415,0.0001450983,0.1292048,0.001310157,0.8454893,0.001948453,0.01802997],"study_design_scores_gemma":[0.00013849,0.00009182647,0.001795307,0.00002085324,0.0001378705,0.0001184581,0.00007697365,0.5908173,0.0004149296,0.405568,0.0007779143,0.00004209968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2751854,0.001673212,0.7040185,0.004128434,0.0003111698,0.00009306301,0.000144399,0.0002399867,0.01420575],"genre_scores_gemma":[0.9469271,0.001246273,0.03184199,0.0005673764,0.0005060659,0.0001466304,0.0001907547,0.00008895164,0.01848486],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006865305,"threshold_uncertainty_score":0.03630763,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010355238","doi":"10.1023/b:jogo.0000042114.11969.bb","title":"Improving Interval Analysis Bounds by Translations","year":2004,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":12,"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":"Mathematics; Univariate; Interval (graph theory); Interval arithmetic; Simple (philosophy); Polynomial; Translation (biology); Multivariate statistics; Global optimization; Applied mathematics; Variable (mathematics); Branch and bound; Mathematical optimization; Statistics; Combinatorics; Mathematical analysis","authors":[{"name":"Emilio Carrizosa","is_ca":false},{"name":"Pierre Hansen","is_ca":true},{"name":"Frédéric Messine","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007847256506081365,"gpt":0.2730848919841986,"spread":0.2652376354781172,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009352496,0.003227664,0.003118884,0.003785785,0.001321497,0.004180876,0.003853355,0.002024328,0.01447111],"category_scores_gemma":[0.05199405,0.001632108,0.003024644,0.004885586,0.004415665,0.01020553,0.008193526,0.009079433,0.005014025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001667963,"about_ca_system_score_gemma":0.001856522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001584543,"about_ca_topic_score_gemma":0.001269241,"domain_scores_codex":[0.9905006,0.003551659,0.0006458529,0.001334925,0.003329495,0.0006373807],"domain_scores_gemma":[0.962482,0.02461042,0.001436079,0.008329836,0.002587167,0.0005545238],"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.001091855,0.0002313886,0.0008605292,0.0005645038,0.0001357788,0.0002196628,0.0005139964,0.1019722,0.007428615,0.5736619,0.0193429,0.2939767],"study_design_scores_gemma":[0.0001048851,0.0001678487,0.0002301212,0.0001440114,0.00009438942,0.00009424155,0.00007590011,0.3532794,0.004896509,0.6301697,0.01069774,0.00004525719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008087569,0.002080432,0.9725198,0.0008832462,0.0005840997,0.00006655133,0.0001580652,0.001250551,0.01436969],"genre_scores_gemma":[0.2880514,0.004739123,0.6892534,0.001748397,0.001716542,0.0005344363,0.0009125952,0.002480782,0.01056325],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01447111,"threshold_uncertainty_score":0.04946131,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975120567","doi":"10.1007/s10898-012-0011-4","title":"Optimization methodology assessment for the inlet velocity profile of a hydraulic turbine draft tube: part II—performance evaluation of draft tube model","year":2012,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Cavitation Phenomena in Pumps","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Polytechnique Montréal","keywords":"Draft tube; Computational fluid dynamics; Inlet; Hull; Grid; Computer science; Tube (container); Turbine; Simulation; Mathematical optimization; Mechanical engineering; Marine engineering; Mathematics; Engineering; Aerospace engineering","authors":[{"name":"Carlos Rubio","is_ca":false},{"name":"Jesús Pacheco","is_ca":false},{"name":"Gildardo Solorio","is_ca":false},{"name":"Carbajal Georgina","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05462665995559051,"gpt":0.3286806632136798,"spread":0.2740540032580893,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006889199,0.0006379167,0.0008091612,0.0003921558,0.0004533484,0.0006128627,0.0004833597,0.000936248,0.001167304],"category_scores_gemma":[0.001460853,0.0002799418,0.0007917876,0.0003198537,0.0002709455,0.0004836273,0.0003983059,0.0005356294,0.0001547843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004750472,"about_ca_system_score_gemma":0.001024272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007434662,"about_ca_topic_score_gemma":0.002837762,"domain_scores_codex":[0.9998049,0.00009163783,0.000009657479,0.00002804592,0.00004391756,0.00002185813],"domain_scores_gemma":[0.9994491,0.0002621546,0.00004595305,0.00003400674,0.0001907015,0.00001800739],"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.0000618568,0.00004463156,0.0005608251,0.00005257404,0.00001313926,0.00003138645,0.00002063368,0.9853171,0.004290815,0.0009456237,0.0001847913,0.008476706],"study_design_scores_gemma":[0.000004386914,0.00003795093,0.0002216997,0.0000024397,0.000005023466,0.000005166401,0.000005852808,0.9981868,0.001336916,0.0001007344,0.00008965752,0.000003359293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3382396,0.0003955333,0.6515732,0.0002095367,0.00004540929,0.0001912238,0.0002452191,0.0004268923,0.008673267],"genre_scores_gemma":[0.9448975,0.0002181825,0.05208562,0.00002416851,0.00001395632,0.0001598153,0.0002273309,0.0001110146,0.002262354],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007434662,"threshold_uncertainty_score":0.01478279,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037658347","doi":"10.1007/s10898-013-0068-8","title":"Carbon tax based on the emission factor: a bilevel programming approach","year":2013,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Bilevel optimization; Mathematics; Factor (programming language); Carbon tax; Mathematical optimization; Econometrics; Mathematical economics; Optimization problem; Greenhouse gas; Computer science; Programming language","authors":[{"name":"Hossa Almutairi","is_ca":true},{"name":"Samir Elhedhli","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0663816637887262,"gpt":0.2388060456485127,"spread":0.1724243818597865,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00201138,0.001044874,0.002426353,0.0008616015,0.0006001101,0.003176512,0.001467158,0.00242349,0.004065976],"category_scores_gemma":[0.006198839,0.0009690856,0.001245515,0.00168781,0.001269816,0.003061576,0.001538863,0.003492142,0.0004166788],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001690094,"about_ca_system_score_gemma":0.002050419,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006321237,"about_ca_topic_score_gemma":0.004478099,"domain_scores_codex":[0.9992412,0.0004102895,0.00002405178,0.0001125506,0.00009941586,0.0001124606],"domain_scores_gemma":[0.9982223,0.001237621,0.0001402303,0.00007829757,0.0002237128,0.00009787225],"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.00002592622,0.00002467517,0.0001455147,0.00003223267,0.00002378343,0.00002794071,0.00001557284,0.9552623,0.0001073266,0.03877777,0.0004226461,0.005134345],"study_design_scores_gemma":[0.000005121829,0.0000074806,0.00002912149,0.000006813145,0.000008573818,0.00000662054,0.00000728392,0.9765317,0.00004986341,0.02304727,0.0002951396,0.000004973042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02100386,0.0006359834,0.9667833,0.001140972,0.0001082993,0.00003496915,0.00009771658,0.00008867192,0.01010616],"genre_scores_gemma":[0.8736773,0.001467125,0.105652,0.000225517,0.0002188019,0.0001437988,0.0001700497,0.0001872862,0.01825811],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006321237,"threshold_uncertainty_score":0.01360208,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024983730","doi":"10.1007/s10898-006-9038-8","title":"Exact Penalty Functions for Constrained Minimization Problems via Regularized Gap Function for Variational Inequalities","year":2006,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":11,"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; Penalty method; Differentiable function; Variational inequality; Minification; Stationary point; Function (biology); Convex function; Mathematical optimization; Order (exchange); Applied mathematics; Space (punctuation); Regular polygon; Mathematical analysis; Computer science","authors":[{"name":"Wu Li","is_ca":false},{"name":"Jiming Peng","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01804859287744212,"gpt":0.2471798043196314,"spread":0.2291312114421892,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003876906,0.001607709,0.001896618,0.001009116,0.0004475129,0.001671747,0.001609569,0.002481346,0.003105728],"category_scores_gemma":[0.008803337,0.0007258962,0.000934361,0.0008396023,0.001692291,0.002753849,0.002936958,0.003288927,0.0005646981],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001235293,"about_ca_system_score_gemma":0.001564026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001336193,"about_ca_topic_score_gemma":0.00122026,"domain_scores_codex":[0.9986255,0.0007612934,0.00005034456,0.0001157513,0.000342483,0.0001046124],"domain_scores_gemma":[0.9979328,0.001287979,0.0001230338,0.0001810355,0.0003423548,0.0001328612],"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.000219458,0.0001210331,0.0002930875,0.0004414194,0.00007906059,0.0001147124,0.0001719833,0.4935493,0.005466652,0.4387815,0.005232638,0.05552919],"study_design_scores_gemma":[0.00001267628,0.00002321252,0.00004249001,0.00002306973,0.000005768413,0.0000196303,0.00001184026,0.942836,0.0003742749,0.05553186,0.001111273,0.000007889224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006409402,0.0003817002,0.9904354,0.0003110665,0.00007959372,0.00003317042,0.00004146576,0.00008402436,0.002224306],"genre_scores_gemma":[0.3623905,0.001075118,0.6237135,0.0004845531,0.0002531004,0.0004872199,0.0004087057,0.0007504791,0.01043687],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003876906,"threshold_uncertainty_score":0.02050328,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115983461","doi":"10.1007/s10898-011-9785-z","title":"On some convexity properties of the Least Squares Method for pairwise comparisons matrices without the reciprocity condition","year":2011,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":11,"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":"Mathematics; Pairwise comparison; Convexity; Reciprocity (cultural anthropology); Mathematical optimization; Relaxation (psychology); Least-squares function approximation; Extreme point; Applied mathematics; Regular polygon; Non-linear least squares; Optimization problem; Explained sum of squares; Combinatorics; Statistics; Geometry","authors":[{"name":"János Fülöp","is_ca":false},{"name":"Waldemar W. Koczkodaj","is_ca":true},{"name":"Stanisław J. Szarek","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1733473187034887,"gpt":0.410255208144609,"spread":0.2369078894411203,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03117651,0.003599209,0.004255733,0.00313733,0.002403894,0.004816735,0.005441933,0.003599828,0.007601519],"category_scores_gemma":[0.133925,0.002895386,0.004771215,0.004217572,0.01005136,0.01249641,0.006736846,0.01197864,0.002227433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002902829,"about_ca_system_score_gemma":0.005853098,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004323602,"about_ca_topic_score_gemma":0.003853264,"domain_scores_codex":[0.981886,0.01173635,0.000861106,0.002002334,0.002787074,0.0007270277],"domain_scores_gemma":[0.7894416,0.1874295,0.004964432,0.008021142,0.008737146,0.001406232],"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.0002758347,0.000133305,0.001495963,0.0005622072,0.0002690668,0.0007620655,0.0006558929,0.108566,0.003133256,0.8304025,0.008985447,0.0447584],"study_design_scores_gemma":[0.00004301681,0.0001276636,0.0007540392,0.0001507968,0.00009775992,0.0005030337,0.0001217863,0.3535593,0.001960298,0.6383871,0.004190873,0.0001043194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004301213,0.0005375509,0.9907951,0.0008633201,0.00006862178,0.00009296159,0.0002247,0.00007251693,0.003044108],"genre_scores_gemma":[0.183599,0.00524523,0.7905015,0.002077133,0.00119015,0.00194696,0.001938721,0.001663588,0.01183764],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03117651,"threshold_uncertainty_score":0.1648791,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2790720375","doi":"10.1007/s10898-017-0601-2","title":"Corrections to: Differentiable McCormick relaxations","year":2018,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":10,"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":"Differentiable function; Mathematics; Regular polygon; Watson; Applied mathematics; Mathematical economics; Pure mathematics; Combinatorics; Geometry; Computer science","authors":[{"name":"Kamil A. Khan","is_ca":true},{"name":"Matthew E. Wilhelm","is_ca":false},{"name":"Matthew D. Stuber","is_ca":false},{"name":"Huiyi Cao","is_ca":true},{"name":"Harry A. J. Watson","is_ca":false},{"name":"Paul I. Barton","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03579917435867024,"gpt":0.3849292774845069,"spread":0.3491301031258367,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002952073,0.002512753,0.001857413,0.003228137,0.002203351,0.003206492,0.004005824,0.004355944,0.1563604],"category_scores_gemma":[0.04836186,0.001314431,0.001812878,0.003081843,0.001808755,0.004872219,0.002452972,0.01001537,0.05069291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003279926,"about_ca_system_score_gemma":0.003394463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01164656,"about_ca_topic_score_gemma":0.0169792,"domain_scores_codex":[0.9962364,0.0008037107,0.0004055945,0.0005995453,0.00169337,0.0002614587],"domain_scores_gemma":[0.9855547,0.002989331,0.0007484951,0.002611908,0.007592584,0.0005029063],"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.00006974273,0.00001796796,0.0000741262,0.0001809981,0.00002114673,0.0001668008,0.00004079312,0.00176987,0.0002823056,0.04132683,0.9294887,0.02656083],"study_design_scores_gemma":[0.00007533715,0.00002226221,0.0004749905,0.0002433126,0.00004243401,0.0005345562,0.00007771356,0.01353486,0.001949523,0.0616795,0.9212658,0.00009960298],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"other","genre_scores_codex":[0.001898892,0.005757719,0.1096381,0.0956671,0.7164041,0.0001341469,0.005468227,0.006077215,0.05895455],"genre_scores_gemma":[0.06245099,0.007203767,0.1886908,0.03266485,0.08349279,0.0003405933,0.005444979,0.01704889,0.6026624],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.1563604,"threshold_uncertainty_score":0.5230775,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2798508703","doi":"10.1007/s10898-019-00744-7","title":"The Douglas–Rachford algorithm for a hyperplane and a doubleton","year":2019,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","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":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Hyperplane; Regular polygon; Characterization (materials science); Simple (philosophy); Set (abstract data type); Focus (optics); Convex set","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.004747195214022939,"gpt":0.2293596423610671,"spread":0.2246124471470442,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002137766,0.0006848825,0.001346356,0.001206011,0.001226395,0.001207914,0.002226247,0.002200739,0.008728226],"category_scores_gemma":[0.003959059,0.000606253,0.001072302,0.0009661411,0.001232661,0.001884418,0.002058513,0.002275172,0.001860254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001123141,"about_ca_system_score_gemma":0.002356019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006515498,"about_ca_topic_score_gemma":0.007881691,"domain_scores_codex":[0.9994758,0.0001796731,0.00002718469,0.000089765,0.000144385,0.00008326898],"domain_scores_gemma":[0.9990503,0.0003893332,0.00004542391,0.0001619623,0.0002402966,0.0001126476],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004463884,0.000230055,0.001184994,0.0001879313,0.00008842352,0.0001270402,0.000207382,0.2595323,0.003889265,0.348693,0.01335574,0.3720575],"study_design_scores_gemma":[0.00004805441,0.00007507607,0.0001544948,0.00002632216,0.00001148157,0.00004242308,0.00003337746,0.9278169,0.001179342,0.0635392,0.00704908,0.00002417563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008902666,0.0001509014,0.9874779,0.0001603553,0.0001046338,0.00004802875,0.00004247145,0.0002295959,0.002883357],"genre_scores_gemma":[0.0759359,0.000111252,0.9138434,0.0001265969,0.00006722345,0.0001173474,0.0001441233,0.0002513466,0.009402809],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008728226,"threshold_uncertainty_score":0.02919888,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100485099","doi":"10.1007/s10898-010-9571-3","title":"Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering","year":2010,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":10,"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":"Mathematics; Convex hull; Combinatorics; Centroid; Cluster analysis; Least-squares function approximation; Triangle inequality; Set (abstract data type); Explained sum of squares; Data point; Algorithm; Regular polygon; Statistics; Geometry; Computer science","authors":[{"name":"Daniel Aloise","is_ca":false},{"name":"Pierre Hansen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02564626339742952,"gpt":0.3237365574687904,"spread":0.2980902940713608,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00285763,0.001535642,0.001970224,0.001163438,0.0008486543,0.001597823,0.002185021,0.002584829,0.007975282],"category_scores_gemma":[0.01182989,0.0006815682,0.0009183682,0.001178224,0.00085281,0.001822614,0.001433022,0.001666093,0.001914943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001809374,"about_ca_system_score_gemma":0.003749212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01158436,"about_ca_topic_score_gemma":0.01423582,"domain_scores_codex":[0.9984443,0.0006024272,0.0000865721,0.0001981075,0.0005171833,0.0001515043],"domain_scores_gemma":[0.9944811,0.003788176,0.0001655106,0.000221907,0.001171375,0.0001719388],"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.0005508565,0.0001545743,0.0006442543,0.0001361968,0.00008709102,0.00003615333,0.00005663345,0.8071999,0.003002644,0.004026029,0.002996393,0.1811092],"study_design_scores_gemma":[0.00001777228,0.00002709136,0.00005734404,0.000003064554,0.000005746807,0.000005709795,0.000007562368,0.9988523,0.0004077058,0.000493233,0.0001193763,0.000003113562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02894496,0.0004875773,0.9646894,0.0003152722,0.0001198985,0.0001175948,0.00006199594,0.001861197,0.003402183],"genre_scores_gemma":[0.2033136,0.0001684666,0.792113,0.0001730021,0.00006288914,0.0002515976,0.0003264468,0.0004856937,0.003105436],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01158436,"threshold_uncertainty_score":0.02667999,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149760726","doi":"10.1007/s10898-010-9585-x","title":"Controlled predatory pricing in a multiperiod Stackelberg game: an MPEC approach","year":2010,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Stackelberg competition; Oligopoly; Predatory pricing; Order (exchange); Competitor analysis; Microeconomics; Production (economics); Economics; Incentive; Linearization; Mathematical optimization; Mathematical economics; Cournot competition; Mathematics; Monopoly; Nonlinear system","authors":[{"name":"Joe Naoum‐Sawaya","is_ca":true},{"name":"Samir Elhedhli","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03387750278639193,"gpt":0.364519891842761,"spread":0.330642389056369,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002147119,0.001652722,0.003115894,0.001160483,0.000764052,0.002991227,0.003400101,0.003815607,0.006016266],"category_scores_gemma":[0.006843693,0.001441851,0.00162196,0.0008577617,0.002434682,0.00358437,0.002443532,0.00262629,0.0003239818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002005151,"about_ca_system_score_gemma":0.001991515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005013592,"about_ca_topic_score_gemma":0.003627263,"domain_scores_codex":[0.999121,0.0004333676,0.00002571044,0.0001437804,0.0001377429,0.0001384052],"domain_scores_gemma":[0.9968281,0.002072433,0.0003556004,0.0001656874,0.0003400866,0.0002381239],"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.000103568,0.0001414946,0.0003305065,0.0001284628,0.0001086401,0.0002190126,0.00006057362,0.8671577,0.001154325,0.1250452,0.00126947,0.004280991],"study_design_scores_gemma":[0.00002739987,0.00003141498,0.00007123944,0.000006083193,0.000024055,0.00001739602,0.00001383841,0.9743493,0.00009138283,0.02511903,0.0002369827,0.00001175875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09209937,0.0008377617,0.8716202,0.001968107,0.0002440908,0.0002022629,0.0001959319,0.0001787478,0.03265354],"genre_scores_gemma":[0.9338474,0.0006070529,0.04038029,0.0003369108,0.0002119456,0.0002275448,0.00006703541,0.00009208557,0.02422979],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006016266,"threshold_uncertainty_score":0.0201264,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105120842","doi":"10.1007/s10898-011-9691-4","title":"An efficient algorithm for maximal margin clustering","year":2011,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Clustering Algorithms Research","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":"University of Alberta","funders":"Air Force Office of Scientific Research; National Institutes of Health; National Science Foundation","keywords":"Margin (machine learning); Cluster analysis; Mathematics; Curse of dimensionality; Dimensionality reduction; Convergence (economics); Algorithm; Extension (predicate logic); Computational complexity theory; Computer science; Artificial intelligence; Machine learning; Statistics","authors":[{"name":"Jiming Peng","is_ca":false},{"name":"Lopamudra Mukherjee","is_ca":false},{"name":"Vikas Singh","is_ca":false},{"name":"Dale Schuurmans","is_ca":true},{"name":"Linli Xu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02734527043313598,"gpt":0.3021882505185445,"spread":0.2748429800854085,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001746647,0.001551788,0.002024069,0.001699911,0.001994764,0.001878145,0.003757223,0.002556913,0.008198697],"category_scores_gemma":[0.006185687,0.001101951,0.001355526,0.002270444,0.001152026,0.003003686,0.004348841,0.002383624,0.004452273],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001324167,"about_ca_system_score_gemma":0.002445904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002844176,"about_ca_topic_score_gemma":0.004959899,"domain_scores_codex":[0.9982336,0.0004780073,0.000119705,0.0003997469,0.0006313074,0.0001377062],"domain_scores_gemma":[0.9981813,0.000697353,0.0001082949,0.0003965195,0.0005040192,0.000112511],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006396913,0.0001927816,0.0005029016,0.0002628823,0.0001397244,0.0001021651,0.0002584296,0.1832747,0.01029371,0.05210717,0.01881567,0.7334101],"study_design_scores_gemma":[0.000091899,0.00007187677,0.0002311489,0.00002604023,0.00002811473,0.0001244249,0.00006576299,0.9290909,0.004551529,0.05877347,0.006909534,0.00003540945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002362983,0.00012961,0.9952852,0.0001082543,0.00006160094,0.00006602699,0.00006196384,0.0008172509,0.001107239],"genre_scores_gemma":[0.03642293,0.00009291076,0.9594899,0.0001062573,0.00006084312,0.0002260958,0.0003520075,0.0002727892,0.002976257],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008198697,"threshold_uncertainty_score":0.02742743,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1505732277","doi":"10.1023/a:1013838625301","title":"A note on reduction of quadratic and bilinear programs with equality constraints","year":2002,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":9,"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; University of Prince Edward Island","funders":"","keywords":"Mathematics; Bilinear interpolation; Mathematical optimization; Graph; Reduction (mathematics); Quadratic equation; Discrete mathematics; Statistics","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.05982993377738271,"gpt":0.3607467880512986,"spread":0.3009168542739159,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001580639,0.001512056,0.001843,0.001354026,0.001551626,0.002447257,0.001766654,0.001125557,0.01302902],"category_scores_gemma":[0.005169015,0.0007482964,0.004153793,0.00167274,0.002423437,0.004810515,0.005899329,0.008546064,0.003349999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008312074,"about_ca_system_score_gemma":0.00110263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002178994,"about_ca_topic_score_gemma":0.002118991,"domain_scores_codex":[0.998511,0.0003876087,0.00009106904,0.000231253,0.0006240984,0.0001549526],"domain_scores_gemma":[0.9986963,0.0007270604,0.0000391445,0.0002604403,0.0002005568,0.00007643799],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001646865,0.0002411964,0.0001850437,0.00035492,0.0000737917,0.0003066359,0.0004073576,0.01455859,0.003383025,0.8472455,0.02686327,0.106216],"study_design_scores_gemma":[0.00003053335,0.00006960824,0.0001562371,0.00004481546,0.00003849727,0.0001911097,0.00007885518,0.02650952,0.002086664,0.9304367,0.04032327,0.00003421377],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01055932,0.002589587,0.9032842,0.004797777,0.005884675,0.0002611362,0.0004984029,0.0005253082,0.07159963],"genre_scores_gemma":[0.2127792,0.005847272,0.6560984,0.004172169,0.006039214,0.0007400298,0.001341046,0.001966715,0.111016],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01302902,"threshold_uncertainty_score":0.04358637,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963548325","doi":"10.1007/s10898-019-00786-x","title":"A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs","year":2019,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Process Optimization and Integration","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Decomposition; Benders' decomposition; Mathematics; Nonlinear system; Decomposition method (queueing theory); Integer (computer science); Lagrangian relaxation; Global optimization; Nonlinear programming; Integer programming; Optimization problem; Computer science","authors":[{"name":"Emmanuel Ogbe","is_ca":true},{"name":"Xiang Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009939009430692343,"gpt":0.2805451406456261,"spread":0.2706061312149337,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002425298,0.001462855,0.001419912,0.0008380277,0.0004986153,0.001203718,0.001159905,0.001556197,0.005078066],"category_scores_gemma":[0.003750493,0.0008994858,0.001627578,0.0008348161,0.0008223797,0.001365033,0.002409602,0.002356408,0.001162372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004715828,"about_ca_system_score_gemma":0.001461542,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002468667,"about_ca_topic_score_gemma":0.002741774,"domain_scores_codex":[0.9992715,0.0003275491,0.00003401951,0.00008594677,0.0002114519,0.00006954562],"domain_scores_gemma":[0.9987703,0.0006653805,0.00007754047,0.0001068966,0.0002915166,0.00008841991],"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.0001233324,0.0001538851,0.0003645229,0.0002036882,0.0001084776,0.00008280543,0.0000868045,0.8414795,0.004594911,0.04950794,0.003403581,0.0998905],"study_design_scores_gemma":[0.000004392655,0.00001499771,0.00001738467,0.000005543905,0.000004610836,0.000004800042,0.000003209239,0.9974346,0.0001697973,0.001886738,0.0004513874,0.000002671317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00158509,0.00008026303,0.9969817,0.00003843134,0.00003680865,0.00001916146,0.00001717812,0.000060046,0.001181338],"genre_scores_gemma":[0.122543,0.0002923864,0.8707327,0.000113993,0.0001124435,0.0003556926,0.0002018393,0.0003370565,0.005310882],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005078066,"threshold_uncertainty_score":0.01698786,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1575565646","doi":"10.1023/a:1008318925663","title":"An Algorithm of Global Optimization for Rational Functions with Rational Constraints","year":2000,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Simulation and Modeling Applications","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"National Science Foundation","keywords":"Mathematics; Nonlinear programming; Mathematical optimization; Nonlinear system; Reliability (semiconductor); Rational function; Algorithm; Pure mathematics","authors":[{"name":"Weiwu Fang","is_ca":false},{"name":"Tianjiao Wu","is_ca":false},{"name":"Jianping Chen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008889216610178687,"gpt":0.2523837593612497,"spread":0.243494542751071,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00144573,0.001310079,0.001389066,0.0009785555,0.0008609138,0.001061906,0.001404255,0.001833248,0.003878684],"category_scores_gemma":[0.003256725,0.0007559226,0.001139284,0.001090147,0.001232492,0.001484362,0.002071945,0.001573722,0.0006450462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009024918,"about_ca_system_score_gemma":0.001251499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002455385,"about_ca_topic_score_gemma":0.002044019,"domain_scores_codex":[0.9995418,0.0001675102,0.00002016042,0.00008477661,0.000141557,0.00004427067],"domain_scores_gemma":[0.9993514,0.0003836993,0.00002502551,0.00006821219,0.0001474716,0.00002412722],"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.0001635336,0.00006286961,0.0003409655,0.0001442967,0.00007469205,0.00006863134,0.0001678382,0.6728081,0.003894265,0.1688768,0.003473193,0.1499248],"study_design_scores_gemma":[0.00003606348,0.00004567593,0.00005610328,0.00001208602,0.00001567558,0.0000215891,0.00001197084,0.9712443,0.0006531139,0.02566878,0.002223087,0.00001166151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003496247,0.00008604619,0.9941065,0.0000572052,0.00003900628,0.00002142656,0.00001316078,0.0001618751,0.002018403],"genre_scores_gemma":[0.09518225,0.0001786317,0.9011256,0.00007748358,0.00004033658,0.0002217789,0.00007968993,0.0002422125,0.00285199],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003878684,"threshold_uncertainty_score":0.01297551,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2054567731","doi":"10.1007/s10898-004-0867-z","title":"Duality in Multivalued Complementarity Theory by Using Inversions and Scalar Derivatives","year":2005,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"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":"Mathematics; Infinitesimal; Complementarity (molecular biology); Duality (order theory); Scalar (mathematics); Pure mathematics; Mathematical economics; Mathematical analysis; Geometry","authors":[{"name":"G. Isac","is_ca":true},{"name":"S. Z. Németh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06516242544786878,"gpt":0.4082980049243089,"spread":0.3431355794764401,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002550894,0.0008306678,0.001174708,0.001575768,0.0009679751,0.002677953,0.001349634,0.0009818255,0.003900647],"category_scores_gemma":[0.005003481,0.0005807896,0.0013171,0.001397808,0.003965601,0.005871981,0.003093512,0.003854152,0.0003897153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001026689,"about_ca_system_score_gemma":0.0007942497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007868569,"about_ca_topic_score_gemma":0.0007537949,"domain_scores_codex":[0.9991437,0.0004593948,0.00004544878,0.0000969291,0.0001974071,0.0000570798],"domain_scores_gemma":[0.9987105,0.0007933564,0.000101527,0.0001198511,0.0001917506,0.00008293556],"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.000008709053,0.000009408347,0.00002643848,0.00001844359,0.000005818629,0.00001405508,0.00004047675,0.002620378,0.0001567445,0.9940463,0.0002958179,0.002757454],"study_design_scores_gemma":[0.000004309986,0.000007214573,0.00001691996,0.00000728811,0.000003911733,0.00001538822,0.00001438465,0.02641431,0.00008383106,0.9724501,0.0009778778,0.000004409275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01954959,0.001396363,0.9394597,0.001080034,0.0004268687,0.00003497068,0.00005289104,0.00006009216,0.03793943],"genre_scores_gemma":[0.6807896,0.002590475,0.2886542,0.0009429062,0.001103367,0.0002450834,0.0001224406,0.0002670032,0.02528481],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003900647,"threshold_uncertainty_score":0.01349062,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}