{"meta":{"query_hash":"b7145a54d347","filters":{"venue":"Journal of Global Optimization"},"cohort_total":105,"direct_labels_cover":0,"predictions_cover":105,"exported":105,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/b7145a54d347","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Global+Optimization"},"results":[{"id":"W1485502543","doi":"10.1007/s10898-016-0467-8","title":"Geodesic and contour optimization using conformal mapping","year":2016,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Geodesic; Mathematics; Local optimum; Conformal map; Curse of dimensionality; Differentiable function; Function (biology); Jump; Mathematical optimization; Algorithm; Mathematical analysis","score_opus":0.02831613189250692,"score_gpt":0.28467594396953333,"score_spread":0.2563598120770264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485502543","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014713629,0.00015470355,0.99642026,0.0009293904,0.00037783443,0.00013821508,0.0000048844026,0.000032139793,0.00047118415],"genre_scores_gemma":[0.0749232,0.00030908384,0.9244711,0.00011998678,0.00011496009,9.605392e-7,0.0000010686213,0.000009279625,0.000050351147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980877,0.00015250575,0.00068249763,0.00020146722,0.0006006565,0.00027516115],"domain_scores_gemma":[0.99777067,0.00010146236,0.00065070833,0.00021450373,0.0010446805,0.0002179711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078931195,0.0001507956,0.00026601125,0.00018791133,0.0001311759,0.00027580833,0.00044816243,0.000089666486,0.000070988586],"category_scores_gemma":[0.00053465046,0.00010826294,0.00006357467,0.00061727053,0.00007440724,0.0020881454,0.00015648027,0.00008616761,0.000003008448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019363693,0.000025808096,0.0009683262,0.000008135626,0.000031197436,0.00001521039,0.00003645977,0.9843761,0.00006934124,0.0034387233,0.00010681222,0.010904569],"study_design_scores_gemma":[0.0012132357,0.00009489556,0.00061866816,0.00008678258,0.000014666384,0.00035327475,0.000020739704,0.9970997,0.000031206593,0.0001946739,0.00013509222,0.00013705519],"about_ca_topic_score_codex":0.000005637293,"about_ca_topic_score_gemma":3.619555e-7,"teacher_disagreement_score":0.07345184,"about_ca_system_score_codex":0.0002640262,"about_ca_system_score_gemma":0.0002847804,"threshold_uncertainty_score":0.44148347},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05982993377738271,"score_gpt":0.3607467880512986,"score_spread":0.3009168542739159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505732277","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03274729,0.00005864707,0.96525574,0.00045321166,0.00007639576,0.00035896967,0.000008688764,0.000021467662,0.0010196065],"genre_scores_gemma":[0.39361125,0.00010565049,0.6061625,0.000012182595,0.000047836358,0.000002071991,0.000002204727,0.000011904627,0.000044412463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984813,0.00012422931,0.00057424314,0.00012674126,0.0005485308,0.00014498652],"domain_scores_gemma":[0.9982212,0.000088628745,0.00069728045,0.00014030357,0.00074748474,0.00010509874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034377532,0.00011993455,0.00027809842,0.00008042575,0.000052311025,0.0000349722,0.00008734306,0.00007349253,0.00009217844],"category_scores_gemma":[0.0005420053,0.00009079806,0.00004601478,0.0004577879,0.0002208427,0.0002887548,0.000016540944,0.00014915709,0.0000012562466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005091212,0.0011720343,0.00066304,0.00016291827,0.00012320303,0.000019493587,0.0005952192,0.92986685,0.00009516707,0.008867906,0.00020421606,0.057720855],"study_design_scores_gemma":[0.003666525,0.0028323778,0.00016587487,0.00052377296,0.00012124808,0.0007458676,0.00060958375,0.9861423,0.00046052304,0.0043894835,0.000060736096,0.00028171987],"about_ca_topic_score_codex":0.0000018607045,"about_ca_topic_score_gemma":0.0000016961942,"teacher_disagreement_score":0.36086395,"about_ca_system_score_codex":0.00014715883,"about_ca_system_score_gemma":0.000057922778,"threshold_uncertainty_score":0.37026373},"labels":[],"label_agreement":null},{"id":"W1525262501","doi":"10.1023/a:1008376609592","title":"The Generic Stability and Existence of Essentially Connected Components of Solutions for Nonlinear Complementarity Problems","year":2000,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Nonlinear Differential Equations Analysis","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Australian Research Council; Universidad Surcolombiana","keywords":"Mathematics; Nonlinear complementarity problem; Mixed complementarity problem; Lipschitz continuity; Complementarity (molecular biology); Complementarity theory; Differentiable function; Banach space; Solution set; Nonlinear system; Applied mathematics; Pure mathematics; Set (abstract data type); Computer science","score_opus":0.08493903555344615,"score_gpt":0.3187951041841977,"score_spread":0.23385606863075156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525262501","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5465839,0.000083590814,0.45256183,0.00022489887,0.000045697972,0.0002626255,0.0001892523,0.000004303922,0.00004392686],"genre_scores_gemma":[0.73046654,0.00016038585,0.26925763,0.0000061734245,0.000033795583,0.0000027938695,0.000059618727,0.0000061892506,0.0000068748095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850917,0.000117532116,0.0008775663,0.000085003114,0.00028130805,0.00012943418],"domain_scores_gemma":[0.9978186,0.00024368272,0.00081867975,0.0001532138,0.00092133717,0.00004451771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006436457,0.00008495161,0.0002918422,0.000029782137,0.00015927867,0.000024599567,0.00014968081,0.000037029673,0.000097211174],"category_scores_gemma":[0.00026776272,0.00006314439,0.00012726504,0.0002614743,0.00012770886,0.00011366862,0.000031208972,0.000051490817,1.2597236e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026990643,0.008823547,0.028335877,0.0016895114,0.003963955,0.0000027052286,0.0016944711,0.84022444,0.029434798,0.06364972,0.0006709642,0.018810928],"study_design_scores_gemma":[0.0018711654,0.0003331582,0.0040590265,0.00009937129,0.000668107,0.000013171038,0.00025285716,0.9759278,0.0006363795,0.015839167,0.00017018229,0.00012961253],"about_ca_topic_score_codex":0.00006662449,"about_ca_topic_score_gemma":0.00026601218,"teacher_disagreement_score":0.18388267,"about_ca_system_score_codex":0.00007270044,"about_ca_system_score_gemma":0.000076225726,"threshold_uncertainty_score":0.25749534},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01776061782903075,"score_gpt":0.3325683721105566,"score_spread":0.31480775428152585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549791526","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034419012,0.00015927908,0.9932499,0.00043763427,0.00008417278,0.00053572556,0.00001743586,0.000049715327,0.0020242303],"genre_scores_gemma":[0.0321202,0.0005030433,0.96691114,0.00009396052,0.000088249115,0.000010360598,0.000013023028,0.000036979374,0.00022306872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789333,0.00016974784,0.0007126672,0.00020629277,0.0007471355,0.0002708159],"domain_scores_gemma":[0.9981384,0.00020005005,0.0004900561,0.00015375635,0.0008334114,0.00018432438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000514227,0.00020533326,0.00035814333,0.000112393274,0.00017476403,0.00016823765,0.00014957567,0.00011550854,0.0005223536],"category_scores_gemma":[0.00053971104,0.00017886239,0.000073984695,0.00059677305,0.00009341521,0.0006484823,0.000023567523,0.00021948914,0.000004212012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003222683,0.00014306416,0.00006329432,0.00003764547,0.00005467686,0.000014394275,0.000185094,0.980352,0.0000012220142,0.003274034,0.00027118396,0.015281145],"study_design_scores_gemma":[0.002428594,0.001430254,0.000031020612,0.0003448621,0.00010428436,0.00022043288,0.00021209386,0.983952,0.00003702317,0.010719183,0.0002420315,0.0002782111],"about_ca_topic_score_codex":0.0000021307615,"about_ca_topic_score_gemma":0.0000020980733,"teacher_disagreement_score":0.028678298,"about_ca_system_score_codex":0.0003578758,"about_ca_system_score_gemma":0.00013666664,"threshold_uncertainty_score":0.7293797},"labels":[],"label_agreement":null},{"id":"W1554092380","doi":"10.1023/a:1021953714975","title":"Near-optimal design of Global Positioning System (GPS) networks using the Tabu Search technique","year":2003,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"European Commission","keywords":"Tabu search; Global Positioning System; Flexibility (engineering); Schedule; Mathematical optimization; Heuristic; Computer science; Mathematics","score_opus":0.01881942778388785,"score_gpt":0.28006170985629253,"score_spread":0.2612422820724047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554092380","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063879597,0.0004827528,0.9915925,0.000019481562,0.00035829638,0.00034400882,0.000007449332,0.000086840024,0.00072068826],"genre_scores_gemma":[0.46141183,0.000026913182,0.53847176,0.000009316543,0.000058254358,0.0000019811366,0.0000011540267,0.000017789902,0.0000010086463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759895,0.00066492485,0.000842866,0.00012850172,0.00045200126,0.00031278963],"domain_scores_gemma":[0.99853677,0.000107123706,0.00041520558,0.00020715852,0.0006260983,0.000107621636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00208411,0.00020422398,0.0003489905,0.000043859363,0.00020766184,0.00013964156,0.0002647077,0.00019504674,0.00001737238],"category_scores_gemma":[0.00016124715,0.00017486764,0.00012673365,0.0011833722,0.00007437867,0.00034271248,0.00002850261,0.00027302824,6.218609e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039245853,0.000020121162,0.0014054053,0.000035742734,0.000076712706,0.000009452424,0.000033179113,0.9963685,0.00023430667,0.0015268321,0.000055590135,0.00019487963],"study_design_scores_gemma":[0.0004000523,0.000083616746,0.0001350159,0.0002274306,0.0000957429,0.0008121104,0.00016497534,0.99736524,0.00054241985,0.000019017933,0.00000765822,0.00014673772],"about_ca_topic_score_codex":0.000007908292,"about_ca_topic_score_gemma":2.3804873e-7,"teacher_disagreement_score":0.45502388,"about_ca_system_score_codex":0.0010008862,"about_ca_system_score_gemma":0.0002124435,"threshold_uncertainty_score":0.7130896},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008889216610178687,"score_gpt":0.25238375936124974,"score_spread":0.24349454275107105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575565646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006504724,0.000051087452,0.9912415,0.00016847812,0.00015975536,0.00025864685,0.00033950096,0.000060100007,0.0012161897],"genre_scores_gemma":[0.51422375,0.000025226269,0.48524818,0.000045971035,0.0001567556,0.000012355635,0.0002604027,0.000012665273,0.0000147063765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988408,0.000025264713,0.0005710783,0.00012248442,0.00030849132,0.00013188717],"domain_scores_gemma":[0.9986872,0.000028812796,0.00020461126,0.0001219435,0.00084475195,0.00011266679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015536898,0.00013875125,0.0001907332,0.000044593686,0.00010383839,0.000049536855,0.000110872206,0.000095896125,0.00054935226],"category_scores_gemma":[0.000021814776,0.00013348082,0.00007928161,0.00038573612,0.00006591054,0.0005138366,0.0000027399547,0.00006360795,0.000002646822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085445085,0.00010153275,0.00040985786,0.000007668741,0.00006541736,3.6295333e-7,0.000019066434,0.98484904,0.00001782488,0.0013883077,0.00048562273,0.012569856],"study_design_scores_gemma":[0.0013480673,0.00017495753,0.0007000372,0.000024141957,0.000078758196,0.00006521151,0.00004987497,0.9969201,0.000020841477,0.00023047107,0.00026023682,0.00012729657],"about_ca_topic_score_codex":0.000002835431,"about_ca_topic_score_gemma":0.000005588784,"teacher_disagreement_score":0.50771904,"about_ca_system_score_codex":0.00023555435,"about_ca_system_score_gemma":0.0002127836,"threshold_uncertainty_score":0.6015022},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01915627088536034,"score_gpt":0.2574983124426431,"score_spread":0.23834204155728275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606362855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054888357,0.00078020606,0.9921173,0.0011541026,0.00026533278,0.00006509959,0.000008370043,0.000012660053,0.00010808031],"genre_scores_gemma":[0.73690605,0.0007357566,0.26203668,0.00019833914,0.00009852202,4.872562e-7,0.000016029557,0.0000028061954,0.000005305678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990258,0.0000974412,0.00036690012,0.00014304904,0.00024826048,0.00011851002],"domain_scores_gemma":[0.9991141,0.000031626463,0.0003885447,0.00021037838,0.00016202548,0.00009334158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003446168,0.00008428564,0.00017555556,0.000024156432,0.000054621494,0.000072278766,0.00040613452,0.00005663853,0.000009892291],"category_scores_gemma":[0.000014073855,0.000075112126,0.000033453038,0.00021279191,0.000029398134,0.00080599496,0.00007621456,0.00007161966,2.0406729e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041610172,0.000050349376,0.0006815026,0.0000015525118,0.000035790858,0.000003681235,0.0000117173895,0.9040798,0.000016235083,0.0008412576,0.0038456495,0.09039086],"study_design_scores_gemma":[0.00090774347,0.0000999723,0.0002971963,0.000022651311,0.000031550586,0.00010375415,0.0000053481517,0.99790645,0.000005161632,0.00014476197,0.00040766684,0.00006777129],"about_ca_topic_score_codex":0.0000065373165,"about_ca_topic_score_gemma":0.0000037200507,"teacher_disagreement_score":0.73141724,"about_ca_system_score_codex":0.00006921168,"about_ca_system_score_gemma":0.000039609535,"threshold_uncertainty_score":0.30629835},"labels":[],"label_agreement":null},{"id":"W1643070418","doi":"10.1023/a:1020300717650","title":"Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems","year":2002,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Convex hull; Complementarity (molecular biology); Euclidean space; Linear complementarity problem; Regular polygon; Lift (data mining); Compact space; Mathematical optimization; Convex set; Quadratic equation; Complementarity theory; Hull; Subderivative; Convex polytope; Convex optimization; Combinatorics; Pure mathematics; Geometry; Computer science","score_opus":0.06810240993240227,"score_gpt":0.36597795573933334,"score_spread":0.2978755458069311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1643070418","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04908147,0.0035740603,0.9420658,0.001680526,0.00054884463,0.0009978792,0.000019674293,0.00006562,0.0019661514],"genre_scores_gemma":[0.38773257,0.0013575125,0.6103094,0.00005011329,0.00007939012,0.0000068260306,0.0000038933204,0.000032121883,0.00042813714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803144,0.0002820627,0.00084542105,0.00014900579,0.0005232346,0.00016881229],"domain_scores_gemma":[0.9976907,0.00016105617,0.0012268509,0.00013442343,0.0006852091,0.0001017873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059337716,0.00015025392,0.0003530496,0.0001441385,0.00008886764,0.000047377496,0.00013842141,0.00012470817,0.00014742263],"category_scores_gemma":[0.0015106078,0.00011954763,0.00007301115,0.00042654574,0.00013096056,0.0007753798,0.000045557714,0.00021163507,0.000002751915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014396672,0.00046142715,0.00038570515,0.00017944763,0.00017321549,0.000008992368,0.00095525355,0.9771908,0.00075791834,0.0131799,0.0003310891,0.006232263],"study_design_scores_gemma":[0.0022932212,0.00077485177,0.00013656111,0.0004664098,0.00008616044,0.0001483591,0.00044160525,0.9786032,0.0021708135,0.0146161085,0.00005293804,0.00020979735],"about_ca_topic_score_codex":0.0000022261777,"about_ca_topic_score_gemma":3.9184198e-7,"teacher_disagreement_score":0.3386511,"about_ca_system_score_codex":0.00026567536,"about_ca_system_score_gemma":0.000041452673,"threshold_uncertainty_score":0.48750108},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02642004899376784,"score_gpt":0.2788745590008693,"score_spread":0.2524545100071015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1901524206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008978668,0.000065372784,0.9890353,0.0011974245,0.00040686232,0.0002119276,0.000016301745,0.0000069666116,0.00008117582],"genre_scores_gemma":[0.7877489,0.000042371903,0.21192846,0.00020219819,0.000039693376,0.0000029064747,0.000006551817,0.0000037945665,0.000025184398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988141,0.00009367245,0.0005087167,0.00014533178,0.00033305096,0.00010511425],"domain_scores_gemma":[0.99824905,0.00012390965,0.00069835444,0.00013699003,0.0007187323,0.00007298867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007663554,0.00009283222,0.00020657116,0.00007914358,0.000057546404,0.000090640104,0.00026493912,0.000056505727,0.00000704843],"category_scores_gemma":[0.0003879797,0.00006729158,0.000078485784,0.00052106817,0.000043252952,0.0006436966,0.000058268408,0.00007185358,4.6091478e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002077389,0.00007551655,0.014971572,0.000010466426,0.000019894225,4.463722e-7,0.00021545085,0.9762071,0.000004765933,0.007504723,0.00015529823,0.0008139932],"study_design_scores_gemma":[0.0010911865,0.00018768942,0.0046563926,0.000058153157,0.000021045824,0.00000910553,0.00004963264,0.9867103,0.000043174776,0.0070546186,0.000047255515,0.00007143908],"about_ca_topic_score_codex":0.00002217953,"about_ca_topic_score_gemma":0.000014653925,"teacher_disagreement_score":0.77877015,"about_ca_system_score_codex":0.00014018074,"about_ca_system_score_gemma":0.00015400867,"threshold_uncertainty_score":0.2744071},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05188978761513707,"score_gpt":0.33284879822323504,"score_spread":0.28095901060809797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965468942","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035830075,0.00012792477,0.9904181,0.0014883459,0.000110469235,0.00035065095,0.0000038534945,0.000029680881,0.0071126977],"genre_scores_gemma":[0.007320197,0.000106200525,0.9914454,0.00018345621,0.00034387922,0.0000036948848,0.0000025056963,0.000021039297,0.000573578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828726,0.000098561024,0.0005320116,0.0001317133,0.0007128288,0.00023761096],"domain_scores_gemma":[0.9984589,0.00008409513,0.0003739749,0.00020129414,0.00065657153,0.00022513859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046494804,0.00013210291,0.00023073627,0.00008300699,0.00019553682,0.00005352538,0.00038592308,0.00006566456,0.000045714947],"category_scores_gemma":[0.0006246684,0.000089513014,0.000101395635,0.0009457144,0.000028516875,0.00033089594,0.0000662593,0.00020235793,0.000010184815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057979167,0.000086608336,0.00012057625,0.000009861842,0.00003226848,0.0000079206475,0.00036761077,0.9757482,0.0000026964872,0.0036916547,0.018116834,0.0017577811],"study_design_scores_gemma":[0.003523803,0.0005445738,0.0004602924,0.00016689225,0.00014153225,0.003119016,0.0007539309,0.96135926,0.000086478816,0.017464977,0.011799119,0.00058014755],"about_ca_topic_score_codex":0.0000083607965,"about_ca_topic_score_gemma":0.0000030274598,"teacher_disagreement_score":0.014388972,"about_ca_system_score_codex":0.00024187165,"about_ca_system_score_gemma":0.00026887562,"threshold_uncertainty_score":0.36502346},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013758311413257963,"score_gpt":0.2672620278749107,"score_spread":0.25350371646165276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965868850","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016785635,0.000034881523,0.98235303,0.00015900332,0.00021911398,0.0002634073,0.000002345764,0.00002885065,0.0001537298],"genre_scores_gemma":[0.240834,0.00002131616,0.7589744,0.000030356465,0.00011510467,0.000008223794,0.0000036855135,0.000011242282,0.000001721211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993956,0.000022943083,0.00031032896,0.000100945246,0.000052576892,0.00011760051],"domain_scores_gemma":[0.99962866,0.000031306474,0.0001341764,0.000075470445,0.00008775613,0.000042640393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007747988,0.00008675397,0.00017670418,0.000060108996,0.000030303989,0.000079341866,0.0000936637,0.00004280923,0.0000029318246],"category_scores_gemma":[0.00019765727,0.00008486573,0.000025476184,0.00009959803,0.0000047638177,0.00023485914,0.000015687263,0.00006345013,1.0016184e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006861989,0.000035758967,0.00076123,0.00004507397,0.0000082062925,3.8638342e-7,0.00000935048,0.9866133,0.000034578057,0.00041774884,0.00009055831,0.011915193],"study_design_scores_gemma":[0.00056859176,0.00020793869,0.000060119026,0.00015880786,0.000017973014,0.000020005435,0.0000099677,0.9972028,0.00050146395,0.00043585926,0.0007306861,0.0000857583],"about_ca_topic_score_codex":0.0000041190897,"about_ca_topic_score_gemma":0.0000022759707,"teacher_disagreement_score":0.22404838,"about_ca_system_score_codex":0.00013653979,"about_ca_system_score_gemma":0.000026185326,"threshold_uncertainty_score":0.34607238},"labels":[],"label_agreement":null},{"id":"W1972086869","doi":"10.1007/s10898-014-0219-6","title":"Global optimization workshop 2012","year":2014,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Eleventh; Global optimization; Series (stratigraphy); Mathematics; Optimization problem; Multi-objective optimization; Mathematics education; Mathematical optimization; Operations research","score_opus":0.007093836224354693,"score_gpt":0.23169526621186076,"score_spread":0.22460142998750607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972086869","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009526921,0.00058386056,0.99017566,0.0002757373,0.0017656223,0.00008316688,0.00001026601,0.000171847,0.0059811505],"genre_scores_gemma":[0.13414189,0.0003576662,0.86454207,0.00018046534,0.0006608805,0.0000021076598,0.000029262452,0.000032209577,0.000053446547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848276,0.00007071597,0.00065106037,0.00013534933,0.00039870176,0.0002613946],"domain_scores_gemma":[0.99883604,0.000039949773,0.0002793739,0.00018072639,0.00046061218,0.00020332665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037035317,0.00021346984,0.00029571712,0.000075388765,0.000077852266,0.00013497236,0.0002426803,0.00018894345,0.0001924915],"category_scores_gemma":[0.00024026773,0.00020799006,0.00012906984,0.00083525165,0.000032096854,0.0007268332,0.00002283185,0.00013735646,0.000014660922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024806339,0.00003364057,0.00071718625,0.000011007077,0.000046451318,0.000002556441,0.000016590957,0.9918382,9.0939324e-7,0.00047280933,0.0025832965,0.0042525134],"study_design_scores_gemma":[0.0007979287,0.000059374448,0.00026792922,0.00005585605,0.00006114,0.00009792301,0.000041742598,0.99759054,0.000008295627,0.0001285623,0.00068600714,0.00020471896],"about_ca_topic_score_codex":0.0000017734386,"about_ca_topic_score_gemma":0.0000031803324,"teacher_disagreement_score":0.1331892,"about_ca_system_score_codex":0.00036192255,"about_ca_system_score_gemma":0.000051603198,"threshold_uncertainty_score":0.84815884},"labels":[],"label_agreement":null},{"id":"W1972546074","doi":"10.1007/s10898-010-9572-2","title":"The small hexagon and heptagon with maximum sum of distances between vertices","year":2010,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Combinatorics; Euclidean geometry; Polygon (computer graphics); Euclidean distance; Quadratic equation; Geometry","score_opus":0.0062024863561351016,"score_gpt":0.20360904081886025,"score_spread":0.19740655446272515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972546074","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5657944,0.0010578604,0.42813212,0.0005814409,0.0008169839,0.00015781389,0.000018792853,0.0000489425,0.0033916605],"genre_scores_gemma":[0.9702143,0.00045197573,0.0292223,0.000008920067,0.00007757753,5.305263e-7,0.00000287189,0.000009764206,0.000011767442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994047,0.000017368036,0.00028403095,0.00004932539,0.00014402223,0.000100516416],"domain_scores_gemma":[0.99945897,0.000049944967,0.00018967286,0.00007785334,0.00016521536,0.0000583259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019528597,0.00008329523,0.00013720115,0.000023636938,0.00006193713,0.00007162511,0.00010824176,0.000052463674,0.000007860967],"category_scores_gemma":[0.000032818825,0.00005307455,0.000026551952,0.00016765401,0.00006221147,0.00018390667,0.000009400085,0.00012449232,2.8577705e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042715896,0.000009973859,0.03810312,0.00003074377,0.000053949418,9.4918846e-7,0.000072581686,0.95662665,0.00008659591,0.00041229514,0.00008134307,0.004479097],"study_design_scores_gemma":[0.004814635,0.0013549626,0.10397803,0.00057714194,0.0005853113,0.00022518449,0.0007079908,0.85962415,0.0038257053,0.0019982955,0.021355072,0.0009535257],"about_ca_topic_score_codex":0.0000047707645,"about_ca_topic_score_gemma":0.00007205406,"teacher_disagreement_score":0.4044199,"about_ca_system_score_codex":0.000019732017,"about_ca_system_score_gemma":0.000023832523,"threshold_uncertainty_score":0.21643172},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05462665995559051,"score_gpt":0.32868066321367984,"score_spread":0.2740540032580893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975120567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10143121,0.0005487922,0.8956747,0.00022591239,0.00089769595,0.0006833529,0.000052208517,0.000023554197,0.00046259293],"genre_scores_gemma":[0.6250717,0.00014681407,0.37449977,0.00003321541,0.00014163177,0.000032814347,0.00004353702,0.00001979921,0.000010707585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976924,0.00020593112,0.0010386723,0.000110643,0.0007025072,0.00024986558],"domain_scores_gemma":[0.9972564,0.00021206606,0.0007634506,0.00021654875,0.0014710625,0.00008049857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033837375,0.00018573743,0.00039195296,0.00011631679,0.000099247656,0.000017988206,0.0002169924,0.00013366899,0.00009190519],"category_scores_gemma":[0.00043577186,0.00015305004,0.00012926734,0.00047572362,0.000060293532,0.0008127513,0.000044666733,0.00015334315,5.3460076e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008318443,0.00010046522,0.0006244375,0.000079026984,0.00014839206,4.2794518e-8,0.00041397015,0.9935969,0.00025263257,0.00035968507,0.0007684379,0.0035728267],"study_design_scores_gemma":[0.0012974221,0.00020252488,0.0017958413,0.000057309848,0.00037782182,0.000013837937,0.00008966999,0.9944767,0.0012844837,0.00018080106,0.00009015844,0.00013347542],"about_ca_topic_score_codex":0.0000030662882,"about_ca_topic_score_gemma":0.0000014970392,"teacher_disagreement_score":0.5236405,"about_ca_system_score_codex":0.0005464179,"about_ca_system_score_gemma":0.00022334007,"threshold_uncertainty_score":0.62412},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017943512726862853,"score_gpt":0.23951911107322008,"score_spread":0.22157559834635723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980552542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009988928,0.00003415395,0.9902114,0.0031957962,0.001049672,0.00013096075,0.0000011099122,0.000024482177,0.0043535046],"genre_scores_gemma":[0.8990286,0.000037745605,0.095996544,0.0022113204,0.0022161575,0.000003766253,0.000023304097,0.000018369792,0.00046418837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992006,0.000006956406,0.00037846647,0.00009148193,0.00019361574,0.0001289111],"domain_scores_gemma":[0.9993574,0.000009415562,0.00021561046,0.00009091637,0.00030706532,0.000019614625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003721013,0.000088010565,0.00013530764,0.00007067964,0.000077289296,0.00013333562,0.00016116555,0.000029961999,0.0001689917],"category_scores_gemma":[0.00027545993,0.00008153807,0.00009108767,0.00024297845,0.000007484186,0.0006467033,0.00003869872,0.000037490965,0.000023380959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057085825,0.000024962195,0.00041541,0.000072675226,0.000021306396,3.2426502e-7,0.000007242163,0.95626986,0.0000037279765,0.00944906,0.023736153,0.009942208],"study_design_scores_gemma":[0.00074145565,0.000027953096,0.0013803962,0.000029740744,0.00007808383,0.000001843433,0.00003554005,0.91901195,0.0000016968557,0.0014470041,0.077148505,0.000095802025],"about_ca_topic_score_codex":0.0000886387,"about_ca_topic_score_gemma":0.00008338768,"teacher_disagreement_score":0.8980297,"about_ca_system_score_codex":0.00007288298,"about_ca_system_score_gemma":0.00002314922,"threshold_uncertainty_score":0.3325026},"labels":[],"label_agreement":null},{"id":"W1981955289","doi":"10.1023/b:jogo.0000035028.40292.36","title":"An Exact Method for Fractional Goal Programming","year":2004,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Polytechnique Montréal","funders":"","keywords":"Mathematics; Quadratic programming; Fractional programming; Mathematical optimization; Goal programming; Sequential quadratic programming; Heuristic; Quadratic equation; Quadratically constrained quadratic program; Linear-fractional programming; Linear programming; Field (mathematics); Nonlinear programming; Nonlinear system","score_opus":0.010637421346521701,"score_gpt":0.3041844384937457,"score_spread":0.29354701714722403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981955289","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041292742,0.00006898844,0.99832433,0.00015189988,0.000348603,0.00019073494,0.000005036436,0.00009771252,0.0003997587],"genre_scores_gemma":[0.09187178,0.00001730447,0.9078322,0.00004854822,0.00019002592,0.0000066055272,0.00001164009,0.000018426197,0.000003436492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912393,0.00001788763,0.00040806946,0.000078136414,0.00020564189,0.00016634497],"domain_scores_gemma":[0.99933994,0.00003478513,0.00015000369,0.000073913914,0.0002673103,0.00013404904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031099902,0.000111108726,0.00017804913,0.00005071824,0.00006135723,0.00009759442,0.000106694504,0.000083616294,0.000031455038],"category_scores_gemma":[0.00010739458,0.00010237508,0.00010382627,0.00021677212,0.000013158852,0.00058761577,0.000005176495,0.00009358332,0.0000019018279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024537765,0.000093780116,0.000020628851,0.00002955577,0.00003528446,0.0000019281308,0.000035580564,0.97524637,0.00005214157,0.0044277096,0.00007457656,0.019957928],"study_design_scores_gemma":[0.0010876607,0.00024229758,0.00003253679,0.00004164402,0.00005646964,0.00011305952,0.000089466994,0.99306875,0.00015297435,0.0027881712,0.0021891082,0.0001378318],"about_ca_topic_score_codex":0.0000014979922,"about_ca_topic_score_gemma":0.0000013928968,"teacher_disagreement_score":0.09145886,"about_ca_system_score_codex":0.00024196762,"about_ca_system_score_gemma":0.000053474778,"threshold_uncertainty_score":0.41747347},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06337797441665845,"score_gpt":0.35943060676135935,"score_spread":0.2960526323447009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987434446","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040967152,0.00030996208,0.98740155,0.00043066707,0.0006354965,0.00030486615,0.00001717366,0.00004913905,0.006754445],"genre_scores_gemma":[0.47522154,0.00024633473,0.5234007,0.00044504294,0.00031093846,0.00000770612,0.00006034748,0.000026597361,0.0002807876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99466866,0.0004134515,0.0017919193,0.00034365786,0.0022707665,0.00051151984],"domain_scores_gemma":[0.9946614,0.00013052765,0.0022589394,0.00033864978,0.0021905827,0.0004199271],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0034357372,0.0003232098,0.0005787962,0.0005237131,0.00026233788,0.00038117354,0.00051864446,0.00026672482,0.0005321922],"category_scores_gemma":[0.0006552889,0.00025378983,0.0003337131,0.0026611872,0.000074613745,0.0024039396,0.000050935698,0.00022700567,0.00001204164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032849194,0.00037752022,0.008056637,0.0000034122531,0.000046781737,9.933382e-7,0.00007101328,0.9834029,0.000009859445,0.0020606732,0.003878764,0.0017629364],"study_design_scores_gemma":[0.0015703161,0.0001282403,0.00061347726,0.000014463736,0.0001310342,0.00010264762,0.00019520373,0.9957291,0.000026854284,0.0007875334,0.00043776137,0.0002633659],"about_ca_topic_score_codex":0.000019638968,"about_ca_topic_score_gemma":0.0000023164505,"teacher_disagreement_score":0.47112483,"about_ca_system_score_codex":0.0006515683,"about_ca_system_score_gemma":0.0005797638,"threshold_uncertainty_score":0.9999914},"labels":[],"label_agreement":null},{"id":"W1988220009","doi":"10.1007/s10898-010-9623-8","title":"Geometric fit of a point set by generalized circles","year":2010,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Unit circle; Norm (philosophy); Combinatorics; Scaling; Set (abstract data type); Circumference; Finite set; Point (geometry); Plane (geometry); Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.006188047130667235,"score_gpt":0.24861229360679407,"score_spread":0.24242424647612684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988220009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11122939,0.00033437487,0.8878036,0.00009135347,0.0001276697,0.000042549,0.0000203802,0.0000519577,0.00029873563],"genre_scores_gemma":[0.7665564,0.00028237473,0.2330659,0.000026692518,0.000046055833,8.0095765e-7,0.0000057419406,0.000009906623,0.0000061194764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916273,0.000014413274,0.00044461887,0.00005749068,0.00021630095,0.000104472005],"domain_scores_gemma":[0.9993484,0.000020521331,0.00025022926,0.000100568766,0.00020872803,0.000071567694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013164963,0.00008861755,0.00024930158,0.00012098705,0.000014854907,0.0000142119325,0.00014269199,0.00007293912,0.0000933589],"category_scores_gemma":[0.00013233758,0.0000793951,0.00011004295,0.0008337504,0.000023133985,0.00023472347,0.000014657186,0.00013928891,0.0000011651384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013546219,0.00003434919,0.00070771255,0.000011009829,0.00005703577,0.000002264986,0.000006832811,0.97804314,0.011623796,0.000067278255,0.0051751304,0.004257933],"study_design_scores_gemma":[0.0014356463,0.0003319754,0.0019058285,0.000060336624,0.00023820394,0.00016069548,0.000033895292,0.939572,0.048092417,0.0023335891,0.005361711,0.00047371842],"about_ca_topic_score_codex":0.0000070073756,"about_ca_topic_score_gemma":0.0000018336364,"teacher_disagreement_score":0.655327,"about_ca_system_score_codex":0.00007591309,"about_ca_system_score_gemma":0.000011552451,"threshold_uncertainty_score":0.32376382},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01030778035003522,"score_gpt":0.23725384335320743,"score_spread":0.22694606300317222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991964874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00587014,0.00002481616,0.98844415,0.0019249275,0.00024582428,0.00004528707,0.0000022472113,0.0000115781395,0.0034310443],"genre_scores_gemma":[0.7877443,0.000017725655,0.2119755,0.00013390894,0.000057626585,7.8997465e-7,0.0000026140474,0.000001714321,0.000065846354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905765,0.00003257303,0.00046018,0.00007911426,0.0002938487,0.00007661702],"domain_scores_gemma":[0.9984444,0.000032570664,0.00046443727,0.00012276294,0.0008560852,0.00007977015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014043515,0.00006153426,0.00014907256,0.00005906291,0.000044482054,0.000070784525,0.00026587705,0.000048771883,0.00043456463],"category_scores_gemma":[0.0001004859,0.000050348433,0.00011286238,0.00047977924,0.000022991608,0.0008522626,0.000035122786,0.000059271893,0.000018290055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000530762,0.00011789009,0.008614507,0.000004567128,0.000050169434,0.0000011014224,0.000033087024,0.96233076,0.00005442228,0.025627337,0.0015345564,0.0016263239],"study_design_scores_gemma":[0.00039257793,0.00008592939,0.12879722,0.000012938216,0.000026948715,0.000026374813,0.000036505488,0.8681374,0.000054556393,0.0021935473,0.00015624116,0.000079773396],"about_ca_topic_score_codex":0.000030608695,"about_ca_topic_score_gemma":0.0000020464452,"teacher_disagreement_score":0.7818741,"about_ca_system_score_codex":0.00007104201,"about_ca_system_score_gemma":0.00009833816,"threshold_uncertainty_score":0.4758178},"labels":[],"label_agreement":null},{"id":"W1994393126","doi":"10.1007/s10898-008-9296-8","title":"The non-existence of a regular exceptional family of elements. A necessary and sufficient condition. Applications to complementarity theory","year":2008,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Complementarity (molecular biology); Mathematics; Complementarity theory; Mathematical economics; Mathematical optimization","score_opus":0.014932456409318614,"score_gpt":0.2737755095552268,"score_spread":0.25884305314590816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994393126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0138991065,0.000130293,0.9844063,0.0009394288,0.000058037956,0.00018097638,0.00003675918,0.0000054076545,0.00034369068],"genre_scores_gemma":[0.6767851,0.00021566616,0.32264638,0.00026950528,0.000030968586,0.000007757181,0.00001683969,0.0000028140028,0.000024950194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984058,0.00009672645,0.00072393555,0.00013342802,0.0005363083,0.000103769285],"domain_scores_gemma":[0.9978252,0.000104411876,0.00077828567,0.00018782984,0.001019817,0.00008447662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006352578,0.00008599729,0.00018893326,0.00009148884,0.0002461409,0.000035308763,0.00041301252,0.000028436622,0.00002293016],"category_scores_gemma":[0.00005843176,0.00006658962,0.00008568092,0.0007766496,0.00011370464,0.00031908695,0.00010682991,0.000052581658,0.0000010298057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063370404,0.00028043706,0.0074422145,0.000012434114,0.000119858356,0.0000013450157,0.00026821962,0.7627856,0.00017327374,0.22676842,0.001001554,0.001083283],"study_design_scores_gemma":[0.0017076512,0.000535283,0.18201435,0.000069563146,0.00013659209,0.000115643954,0.0006582577,0.8003732,0.0001800864,0.012267939,0.0016789713,0.0002624535],"about_ca_topic_score_codex":0.000012691932,"about_ca_topic_score_gemma":0.0000035402352,"teacher_disagreement_score":0.662886,"about_ca_system_score_codex":0.0000854802,"about_ca_system_score_gemma":0.00015498862,"threshold_uncertainty_score":0.2715446},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021690053764088987,"score_gpt":0.29792047765924756,"score_spread":0.27623042389515856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994895518","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012433433,0.00042367203,0.9842018,0.00059501914,0.00042883345,0.00033509792,0.000012338836,0.000062158215,0.013816747],"genre_scores_gemma":[0.05963765,0.0006130883,0.93920547,0.00017927765,0.0001937348,0.0000020227328,0.0000082247225,0.000022747608,0.00013779706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99600273,0.00040295676,0.0009508406,0.0004527295,0.0015637592,0.0006269968],"domain_scores_gemma":[0.99622357,0.00033550576,0.00037014438,0.00042165723,0.0022602566,0.00038887197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032864604,0.00026631894,0.0004570952,0.0002856858,0.00028332198,0.000488432,0.00086276984,0.00018689712,0.00013959367],"category_scores_gemma":[0.00056510535,0.00024177576,0.000096293,0.0025361574,0.00013299494,0.0022297131,0.00035393497,0.00039840007,0.000007668465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011846253,0.00015232661,0.0004820714,0.000015401703,0.000079076206,0.000048502417,0.00021219488,0.9687564,0.000009066946,0.02451492,0.00026320145,0.0053484277],"study_design_scores_gemma":[0.0011586917,0.00045569733,0.00048606243,0.00005698383,0.000031999243,0.00023296941,0.00012150031,0.9965358,0.00013570546,0.0004399988,0.000116213676,0.00022841622],"about_ca_topic_score_codex":0.0000564047,"about_ca_topic_score_gemma":0.0000028773181,"teacher_disagreement_score":0.05951332,"about_ca_system_score_codex":0.00045743425,"about_ca_system_score_gemma":0.0006523264,"threshold_uncertainty_score":0.985933},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05312631796310618,"score_gpt":0.42537118337361673,"score_spread":0.37224486541051055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999777494","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007604213,0.00024354768,0.99721915,0.00041991955,0.00014595415,0.00055042934,0.000119455115,0.000029174258,0.0005119383],"genre_scores_gemma":[0.016783372,0.00021689307,0.982685,0.00004737653,0.00016520295,0.000010794683,0.000028121183,0.000017825854,0.00004539346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977674,0.00011654572,0.0010014212,0.00020690303,0.0006533833,0.00025434088],"domain_scores_gemma":[0.9956742,0.0002679861,0.0011590937,0.00016842024,0.0025611764,0.00016911785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005591136,0.00021279218,0.0005805862,0.00009052487,0.000117180236,0.00006496029,0.00021688738,0.00013370595,0.00006345239],"category_scores_gemma":[0.00079210685,0.00019553474,0.00011747333,0.00064873655,0.000110071785,0.00075681956,0.00006917932,0.00013104676,3.5547686e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010202674,0.0002456477,0.0010485303,0.000055482902,0.00010257317,0.0000014447962,0.00006502911,0.98813874,0.0000031071572,0.005121177,0.000655664,0.0044606067],"study_design_scores_gemma":[0.0022360797,0.00040214235,0.00041314383,0.00008380537,0.000100912366,0.0000759475,0.0001694162,0.9926581,0.000046255474,0.0034427824,0.00019943947,0.00017201524],"about_ca_topic_score_codex":0.0000019154893,"about_ca_topic_score_gemma":0.000005378766,"teacher_disagreement_score":0.01602295,"about_ca_system_score_codex":0.00064374466,"about_ca_system_score_gemma":0.00033279718,"threshold_uncertainty_score":0.7973676},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008999484427241255,"score_gpt":0.20188148086656374,"score_spread":0.1928819964393225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001516627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010177732,0.00064892386,0.9278541,0.021151425,0.0008628119,0.0004316347,0.0000083598525,0.000051808533,0.038813155],"genre_scores_gemma":[0.99045163,0.00020220356,0.006513413,0.0021978326,0.0004913804,0.000002722731,0.00002114667,0.000008474563,0.00011118182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915713,0.000024537212,0.00030271866,0.000095463874,0.0002671856,0.00015296639],"domain_scores_gemma":[0.99944514,0.000019877105,0.00019216363,0.00008559866,0.0002369664,0.000020271907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070182997,0.000088298926,0.00011714415,0.00003738775,0.00015903429,0.00021774504,0.00016630694,0.000033555832,0.000115109266],"category_scores_gemma":[0.00018447221,0.00006246811,0.000029809744,0.00040482194,0.00003526668,0.0007371723,0.000045620454,0.000078792,0.000010342315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009827848,0.00018173952,0.05268235,0.00023955271,0.00012792513,0.0000022025406,0.000101791695,0.68240476,0.000042486743,0.124355696,0.11946571,0.020297509],"study_design_scores_gemma":[0.0009045457,0.000035985853,0.004199376,0.000059797974,0.00009138396,0.000005665244,0.00025048252,0.9150081,0.000002244304,0.0041726273,0.07511671,0.00015307115],"about_ca_topic_score_codex":0.00016358554,"about_ca_topic_score_gemma":0.000020392645,"teacher_disagreement_score":0.9802739,"about_ca_system_score_codex":0.000049708986,"about_ca_system_score_gemma":0.000021662378,"threshold_uncertainty_score":0.2547376},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Mathematical optimization; Regular polygon; Convex optimization; Geometry","score_opus":0.017203713330258077,"score_gpt":0.27941692351173286,"score_spread":0.2622132101814748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002055553","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000949565,0.00006688747,0.9864968,0.011674153,0.00037169893,0.0003123934,0.00006683251,0.000060328264,0.00085592724],"genre_scores_gemma":[0.18849382,0.00007922309,0.8097472,0.0012542868,0.00022810753,0.00001116406,0.0000794048,0.000010866965,0.00009591591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798816,0.00011813467,0.00090533664,0.00027061522,0.00047386647,0.00024386264],"domain_scores_gemma":[0.9967311,0.000109911176,0.00097314426,0.0002381385,0.0017533523,0.00019436519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059430185,0.00019456404,0.00034121258,0.00015097931,0.00022656388,0.0002561419,0.0004765559,0.00013317086,0.00036246155],"category_scores_gemma":[0.00023886103,0.00018433125,0.00024792337,0.0008391667,0.00008777075,0.0018472087,0.000053265576,0.000109226996,0.000010347691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020406787,0.00016285162,0.000119577315,0.000009415449,0.00010180381,9.3549716e-7,0.000044296634,0.9118053,0.000015562091,0.085295886,0.0020626846,0.00036131055],"study_design_scores_gemma":[0.0014206494,0.000119971206,0.00040580338,0.000032263604,0.000101967016,0.000071091956,0.00003506188,0.99573886,0.000025689347,0.0010576678,0.0007926697,0.0001982826],"about_ca_topic_score_codex":0.0000045743873,"about_ca_topic_score_gemma":0.000004262524,"teacher_disagreement_score":0.18839885,"about_ca_system_score_codex":0.0004065582,"about_ca_system_score_gemma":0.00036596856,"threshold_uncertainty_score":0.75168097},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009376869784567364,"score_gpt":0.23537802414068654,"score_spread":0.22600115435611917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002285779","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002375325,0.0002699571,0.994694,0.0012309318,0.0005579142,0.00012051207,0.0000045092115,0.000019399722,0.00072744815],"genre_scores_gemma":[0.43980157,0.000009172181,0.55956686,0.00013369987,0.00036364485,0.0000027173508,0.0000105959325,0.000003234631,0.000108475855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991795,0.000026659225,0.00035316887,0.00010066621,0.00022667434,0.00011332021],"domain_scores_gemma":[0.99901193,0.000039264974,0.00032057535,0.000078537676,0.00050420174,0.000045480276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023896349,0.000070600334,0.000114233706,0.00006327617,0.00007868997,0.000120342425,0.00021244158,0.000040286737,0.000007037004],"category_scores_gemma":[0.00004379816,0.000063904474,0.00008332209,0.00039157187,0.000011323211,0.0005973676,0.000022910317,0.00003632909,0.0000016632579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011341105,0.00005706804,0.00027728901,0.0000049850187,0.000007987781,0.0000014664671,0.0000090902,0.94524765,0.00012358687,0.048421793,0.0029724843,0.002865253],"study_design_scores_gemma":[0.0007272386,0.00019467775,0.0016606373,0.000016346594,0.000014173984,0.00012499934,0.0000037557122,0.9818587,0.00021634079,0.011197956,0.0038912222,0.00009399408],"about_ca_topic_score_codex":0.0000047181,"about_ca_topic_score_gemma":0.0000034632021,"teacher_disagreement_score":0.43742627,"about_ca_system_score_codex":0.00008766773,"about_ca_system_score_gemma":0.00013563594,"threshold_uncertainty_score":0.26059487},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008219625034438783,"score_gpt":0.30675417566594093,"score_spread":0.29853455063150214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007576447","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018350492,0.00008632988,0.99541456,0.0018116897,0.00017398849,0.00003841377,0.0000033910496,0.000016004089,0.0022721062],"genre_scores_gemma":[0.10924281,0.000015890622,0.8904071,0.00019295624,0.000066817265,9.629186e-7,0.000015616699,0.000002594706,0.00005526736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998287,0.00023715217,0.0007653728,0.00015986175,0.00042013856,0.00013048158],"domain_scores_gemma":[0.99841905,0.00009877286,0.00064419094,0.00015003659,0.00063030765,0.00005764115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008868584,0.000100770354,0.00030140116,0.00044659682,0.000050229755,0.00014955235,0.0003791091,0.000070038666,0.00013087822],"category_scores_gemma":[0.00009789326,0.000091504044,0.00021914943,0.00437513,0.0000140681595,0.0008344694,0.000044066976,0.00007968814,0.0000032079847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065696663,0.00009016,0.020280765,8.72846e-7,0.00012071564,0.0000040726372,0.000012607362,0.865949,0.0000053111094,0.112869024,0.00017593423,0.00048499383],"study_design_scores_gemma":[0.00042314295,0.000020725689,0.05356712,0.000003402035,0.00013542554,0.000018379205,0.0000051874517,0.9400091,0.00000918395,0.005566478,0.0001542706,0.00008756365],"about_ca_topic_score_codex":0.0000691993,"about_ca_topic_score_gemma":0.000026936765,"teacher_disagreement_score":0.10905931,"about_ca_system_score_codex":0.00024033696,"about_ca_system_score_gemma":0.0001607337,"threshold_uncertainty_score":0.37314266},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007847256506081365,"score_gpt":0.2730848919841986,"score_spread":0.26523763547811724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010355238","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009319535,0.0001843753,0.99672127,0.001670074,0.0002578011,0.000028609411,0.0000044836574,0.000018319397,0.0001831315],"genre_scores_gemma":[0.14193773,0.000016762475,0.85785705,0.00012880868,0.000048905535,3.5346162e-7,0.0000014533008,0.0000023052362,0.000006628974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908644,0.000053596283,0.00037019738,0.00011237107,0.0002550074,0.00012238894],"domain_scores_gemma":[0.9992636,0.000021289745,0.00030834498,0.000117424475,0.0001895311,0.00009985118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027895294,0.000075711956,0.00018953044,0.0000776293,0.00007100588,0.00017829376,0.0003406524,0.000038876577,0.000009576534],"category_scores_gemma":[0.0000569797,0.00006282721,0.0001926211,0.0014196517,0.000019397117,0.00073523796,0.000027082318,0.00008515556,0.0000010273575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005865827,0.00008168219,0.00035589017,0.0000018945387,0.000123786,0.0000061388237,0.00005911117,0.93596524,0.00012207105,0.0032239314,0.000050017996,0.06000435],"study_design_scores_gemma":[0.0006549509,0.00023937889,0.0007789405,0.000013806466,0.00019936785,0.000045554487,0.000018839837,0.99262667,0.00016434661,0.004858814,0.00026730428,0.00013205335],"about_ca_topic_score_codex":0.000032669668,"about_ca_topic_score_gemma":0.000002540634,"teacher_disagreement_score":0.14100578,"about_ca_system_score_codex":0.00014801924,"about_ca_system_score_gemma":0.00008016139,"threshold_uncertainty_score":0.25620192},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09512033817134276,"score_gpt":0.41913846528555154,"score_spread":0.3240181271142088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021601290","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008555923,0.00021395716,0.9970936,0.00013697085,0.001067607,0.00035569334,0.000008274096,0.00008967541,0.00017859043],"genre_scores_gemma":[0.012530423,0.000030782736,0.9871235,0.00018053308,0.00007544477,0.000008376967,0.000005888873,0.000024204353,0.000020868241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966507,0.0016180591,0.00077162887,0.00037218825,0.00028962025,0.0002978116],"domain_scores_gemma":[0.996714,0.0003687977,0.0009913543,0.00040312106,0.0013008792,0.00022186311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027925048,0.00023485957,0.00039855187,0.0001412109,0.0001647279,0.0000991649,0.0008133389,0.0001654262,0.000056612735],"category_scores_gemma":[0.0009168217,0.00022586554,0.00015579294,0.0007355941,0.00007372097,0.002492047,0.00009118057,0.00012304557,0.0000013477587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010337126,0.00027336346,0.000057100424,0.0000028678064,0.00003515154,0.000007744018,0.0006826948,0.990315,0.0024390675,0.002560806,0.000031788553,0.0025606954],"study_design_scores_gemma":[0.0015108828,0.0012973794,0.00012738802,0.000011515057,0.000027921633,0.00019775105,0.000254233,0.9747539,0.020811623,0.0007052987,0.00006889735,0.00023322327],"about_ca_topic_score_codex":0.000005097842,"about_ca_topic_score_gemma":4.7101196e-7,"teacher_disagreement_score":0.018372556,"about_ca_system_score_codex":0.00042685005,"about_ca_system_score_gemma":0.0002404446,"threshold_uncertainty_score":0.92105293},"labels":[],"label_agreement":null},{"id":"W2022188885","doi":"10.1007/s10898-003-2687-y","title":"Full Nuclear Cones and a Relation Between Strong Optimization and Pareto Efficiency","year":2005,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Vector optimization; Hausdorff space; Cone (formal languages); Pareto principle; Regular polygon; Relation (database); Hausdorff distance; Locally convex topological vector space; Mathematical optimization; Convex optimization; Type (biology); Conic optimization; Optimization problem; Pareto efficiency; Convex analysis; Pure mathematics; Mathematical analysis; Algorithm; Geometry; Computer science; Multi-swarm optimization","score_opus":0.009020491527263932,"score_gpt":0.23627175372726295,"score_spread":0.22725126219999903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022188885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008160594,0.00021044571,0.9873695,0.0035819842,0.000077398254,0.00008198175,0.0000047028097,0.00003375809,0.00047963308],"genre_scores_gemma":[0.5779853,0.00019463876,0.4215909,0.000100876736,0.00010650109,4.2524744e-7,0.0000067535207,0.000005226874,0.000009416993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986804,0.000090284906,0.00053942826,0.00019918333,0.00035387004,0.00013683736],"domain_scores_gemma":[0.99870145,0.000056185614,0.00055554876,0.000118222735,0.00042978322,0.00013881504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003129992,0.00012990517,0.00022200203,0.00013606549,0.0001773001,0.00027142875,0.00019457769,0.00009080346,0.000029256626],"category_scores_gemma":[0.00011555574,0.00011880264,0.000053803422,0.00056367123,0.000039556588,0.0016656073,0.00007749069,0.00009152599,0.0000024192777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001635257,0.000031268486,0.004821468,0.000003992452,0.00003222751,0.0000010534769,0.00011483402,0.9734415,0.0000041472563,0.019135531,0.000047714813,0.0023499564],"study_design_scores_gemma":[0.00066362607,0.00016267477,0.0057089343,0.000017923661,0.00006522658,0.00006728581,0.000033731536,0.99282265,0.0000025246645,0.000155408,0.0001793685,0.00012065876],"about_ca_topic_score_codex":0.0000043387113,"about_ca_topic_score_gemma":0.000001920815,"teacher_disagreement_score":0.5698247,"about_ca_system_score_codex":0.00011946609,"about_ca_system_score_gemma":0.00006140542,"threshold_uncertainty_score":0.48446313},"labels":[],"label_agreement":null},{"id":"W2024351153","doi":"10.1007/s10898-014-0168-0","title":"Global minimization of the difference of strictly non-positive valued affine ICR functions","year":2014,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Graduate University of Advanced Technology; Centre de Recherches Mathématiques","keywords":"Mathematics; Affine transformation; Convexity; Subderivative; Class (philosophy); Pure mathematics; Convex function; Minification; Applied mathematics; Regular polygon; Mathematical optimization; Convex optimization; Geometry; Artificial intelligence; Computer science","score_opus":0.005639903238360897,"score_gpt":0.22042256933659607,"score_spread":0.21478266609823518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024351153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004120336,0.000023610939,0.9922458,0.0008624639,0.00042873205,0.00010106513,0.000032397467,0.000010138954,0.002175464],"genre_scores_gemma":[0.8552843,0.00002214525,0.14439568,0.00014835403,0.00006986319,9.269059e-7,0.000010144179,0.0000036499416,0.0000649576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811417,0.00019826961,0.00077705976,0.00015892922,0.0006271456,0.00012442276],"domain_scores_gemma":[0.9965278,0.000075120166,0.0014387856,0.00027376757,0.0016090996,0.00007544307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003021338,0.00013311765,0.00030384646,0.00009510421,0.00010411401,0.000057273628,0.0006227642,0.000081711216,0.000032720283],"category_scores_gemma":[0.00037285316,0.000096499665,0.00021894342,0.0022040107,0.000054601645,0.0004441335,0.00011515673,0.000067593275,0.0000011551689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029518933,0.00016078613,0.013465378,0.000007387612,0.0000772028,2.0950624e-7,0.000046941517,0.9640701,0.000040744733,0.020284943,0.00024517655,0.0015716072],"study_design_scores_gemma":[0.00062540977,0.00015034601,0.13059431,0.000046816593,0.00011293437,0.000014053507,0.000017572971,0.8674857,0.00015052593,0.0007004412,0.000019327663,0.000082533435],"about_ca_topic_score_codex":0.00003496572,"about_ca_topic_score_gemma":0.000010612488,"teacher_disagreement_score":0.8511639,"about_ca_system_score_codex":0.00016718738,"about_ca_system_score_gemma":0.00022618475,"threshold_uncertainty_score":0.39351422},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018048592877442118,"score_gpt":0.24717980431963135,"score_spread":0.22913121144218923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024983730","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000075232245,0.000059130598,0.99509805,0.002825447,0.000774248,0.00055202097,0.00010227885,0.00006584797,0.00044776892],"genre_scores_gemma":[0.11830759,0.000014436627,0.8792491,0.00033780243,0.00066570716,0.00006843125,0.00074955745,0.000017892971,0.0005894677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977074,0.00014287488,0.0011138207,0.0002841008,0.0005137158,0.00023806712],"domain_scores_gemma":[0.9954205,0.00028877505,0.0012937314,0.00018218502,0.00272086,0.00009393266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093538413,0.00020515418,0.00034126677,0.00023467549,0.00034226614,0.00030108436,0.00028528922,0.00014481459,0.00007542269],"category_scores_gemma":[0.00035415983,0.00019213549,0.00031956087,0.0008842042,0.000036092337,0.0014418181,0.00002896166,0.000070392365,0.0000022105041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014559305,0.00017009967,0.00034445565,0.000024896783,0.00010841282,2.3016865e-7,0.000024383771,0.8306722,0.000069108944,0.16528963,0.002624071,0.0005268933],"study_design_scores_gemma":[0.002474936,0.00030874508,0.00095222855,0.000022907983,0.00019344335,0.000030457597,0.000025103804,0.96223783,0.000014390387,0.031950522,0.0015903129,0.00019911458],"about_ca_topic_score_codex":0.000024523531,"about_ca_topic_score_gemma":0.000015687523,"teacher_disagreement_score":0.1333391,"about_ca_system_score_codex":0.00028882571,"about_ca_system_score_gemma":0.00038356395,"threshold_uncertainty_score":0.78350574},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020246209681050998,"score_gpt":0.2501269094010178,"score_spread":0.22988069971996677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032696538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029748647,0.000635242,0.9683749,0.00010582741,0.00009726893,0.00010110521,0.000011181968,0.000005014589,0.00092078536],"genre_scores_gemma":[0.9701949,0.00006373525,0.029607058,0.000044311208,0.00005331506,0.0000072493285,0.0000020987034,0.0000071155537,0.000020258653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948007,0.0000033883543,0.00031027326,0.00009693679,0.000017877031,0.00009148312],"domain_scores_gemma":[0.9993947,0.000030461497,0.000405357,0.00003511613,0.00009481086,0.000039547067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021067007,0.00006867084,0.00017512718,0.000052708867,0.00008107542,0.000050368355,0.000042703585,0.000036971895,0.0000127775975],"category_scores_gemma":[0.00015093142,0.000060492064,0.00003464752,0.00015031549,0.000017789598,0.00018515528,0.000004759126,0.000045378776,7.912631e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057767982,0.000036519134,0.011833827,0.000011329416,0.000025591868,2.6932577e-7,0.000023157005,0.010528567,0.0000074994364,0.9769751,0.000034643268,0.0004657722],"study_design_scores_gemma":[0.0027025028,0.00093917846,0.018031199,0.00015025845,0.000103975086,0.00028882604,0.00032201115,0.048658155,0.00038895814,0.9253645,0.002592241,0.00045819092],"about_ca_topic_score_codex":0.000002073532,"about_ca_topic_score_gemma":0.0000043815303,"teacher_disagreement_score":0.9404462,"about_ca_system_score_codex":0.00008260288,"about_ca_system_score_gemma":0.000020681624,"threshold_uncertainty_score":0.24667947},"labels":[],"label_agreement":null},{"id":"W2035084369","doi":"10.1007/s10898-011-9780-4","title":"Maximal perimeter, diameter and area of equilateral unit-width convex polygons","year":2011,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Agence Nationale de la Recherche","keywords":"Equilateral triangle; Mathematics; Perimeter; Regular polygon; Combinatorics; Maximization; Unit (ring theory); Geometry; Mathematical optimization","score_opus":0.03473081697179394,"score_gpt":0.24398814327124557,"score_spread":0.20925732629945162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035084369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14702342,0.00017423404,0.8515993,0.00010521565,0.00037885088,0.00004528505,0.000004224556,0.000008350687,0.0006611378],"genre_scores_gemma":[0.6881655,0.00002887558,0.3116697,0.00007989012,0.000036512836,3.1744915e-7,0.0000016271923,0.0000023102734,0.000015261456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991319,0.00005813041,0.00037303023,0.00010845246,0.0002212749,0.00010722351],"domain_scores_gemma":[0.9990823,0.000026564767,0.0003493103,0.000103939805,0.00035100072,0.00008683966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021190415,0.00008874354,0.00016794667,0.00010533219,0.000041000712,0.000051680614,0.00021081066,0.000046349312,0.000036611866],"category_scores_gemma":[0.00003773038,0.00007701035,0.00006115698,0.00034803955,0.000039049373,0.0006994894,0.000057827117,0.000057970883,9.1817134e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007281482,0.0010755318,0.05981042,0.00008893425,0.00044540563,0.00010903117,0.0030899611,0.79187703,0.006025501,0.05940501,0.0014291018,0.07591593],"study_design_scores_gemma":[0.0017225245,0.0014654509,0.054839514,0.00007720249,0.000078084486,0.00068841025,0.00004476075,0.9263208,0.0067590484,0.0075150104,0.00017711711,0.00031206614],"about_ca_topic_score_codex":0.000008163844,"about_ca_topic_score_gemma":9.981642e-7,"teacher_disagreement_score":0.54114205,"about_ca_system_score_codex":0.000029834351,"about_ca_system_score_gemma":0.00008671771,"threshold_uncertainty_score":0.31403908},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0663816637887262,"score_gpt":0.23880604564851274,"score_spread":0.17242438185978654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037658347","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6599829,0.0008875618,0.23791564,0.015601629,0.0016755044,0.0014206676,0.00031629333,0.00006391028,0.08213589],"genre_scores_gemma":[0.9844222,0.00007966581,0.014613873,0.00058587384,0.0002025134,0.00001272405,0.00000838273,0.0000144623245,0.00006028201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990301,0.000019063096,0.0005747493,0.00013558571,0.000047440615,0.00019305118],"domain_scores_gemma":[0.9988682,0.000041370975,0.0007721255,0.0001608449,0.00006989789,0.00008751769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003291274,0.0001190567,0.0002395972,0.00008521201,0.00007970163,0.00014350968,0.00019267392,0.00009198762,0.0002367051],"category_scores_gemma":[0.00017452387,0.000091391514,0.000117880925,0.00019842203,0.000025387852,0.00021016672,0.000022175393,0.00012791812,0.000026386042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011822875,0.00064067845,0.10588796,0.00007125542,0.000111415866,0.000002743566,0.00056094624,0.8604347,0.000016476612,0.021006046,0.0048360913,0.006313423],"study_design_scores_gemma":[0.00051491585,0.00014659412,0.0048831687,0.00003252955,0.0000071321083,0.000011067912,0.00012652435,0.9895821,0.00001718086,0.002294958,0.0022191969,0.00016458938],"about_ca_topic_score_codex":0.00013709442,"about_ca_topic_score_gemma":0.0000020932132,"teacher_disagreement_score":0.32443932,"about_ca_system_score_codex":0.0002899186,"about_ca_system_score_gemma":0.000026652631,"threshold_uncertainty_score":0.3726838},"labels":[],"label_agreement":null},{"id":"W2040914581","doi":"10.1007/s10898-004-1322-x","title":"Asset Pricing under Progressive Taxes and Existence of General Equilibrium","year":2005,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Arbitrage; Asset (computer security); Clearance; Monotone polygon; General equilibrium theory; Economics; Mathematical economics; Financial market; Incomplete markets; Regular polygon; Set (abstract data type); Mathematics; Econometrics; Microeconomics; Financial economics; Finance","score_opus":0.018572121342666267,"score_gpt":0.24974258897925453,"score_spread":0.23117046763658827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040914581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052880805,0.0028896502,0.94157517,0.00092300004,0.000082111765,0.000078645535,0.000056297995,0.000004172222,0.0015101329],"genre_scores_gemma":[0.8414995,0.00010618442,0.15808006,0.00010401289,0.00017402993,0.0000025803208,0.000003822273,0.0000053719573,0.000024413042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992255,0.0000024809542,0.00052899704,0.00010100397,0.000043779422,0.00009824587],"domain_scores_gemma":[0.9988315,0.00001380437,0.00088536396,0.000069126734,0.00015374264,0.000046440215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015129802,0.000066502056,0.0002127735,0.000049967428,0.000032037213,0.00003009623,0.00010018666,0.000049336635,0.000016043592],"category_scores_gemma":[0.00008622983,0.00006707993,0.000043757085,0.00022486885,0.000043604952,0.00029011437,0.000028048074,0.00005050869,0.000002481113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032767824,0.00010043658,0.005039555,0.000024110985,0.00003205759,0.0000011062111,0.000074542746,0.2687152,0.00005985077,0.7238723,0.00012531289,0.0019227705],"study_design_scores_gemma":[0.0023024925,0.00070052076,0.05190717,0.0001911056,0.00007801951,0.0002962405,0.00019998502,0.61562747,0.0003199707,0.3252828,0.002547862,0.00054638006],"about_ca_topic_score_codex":0.00001517734,"about_ca_topic_score_gemma":0.000001926205,"teacher_disagreement_score":0.78861874,"about_ca_system_score_codex":0.000076620876,"about_ca_system_score_gemma":0.0000367113,"threshold_uncertainty_score":0.273544},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Crew; Mathematical optimization; Nonlinear system; Mathematics; Pairing; Interval (graph theory); Relaxation (psychology); Engineering","score_opus":0.03915311288015694,"score_gpt":0.27883241837956735,"score_spread":0.2396793054994104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043131887","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028529398,0.0003688258,0.99445885,0.0004645526,0.0002575041,0.00007540132,9.866228e-7,0.00006426494,0.0014566673],"genre_scores_gemma":[0.09169588,0.00038032976,0.9077361,0.000044778182,0.00010385504,0.0000015278519,9.764207e-7,0.000016535163,0.000020000265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880826,0.0002962289,0.0004527746,0.000084798754,0.00017240363,0.00018555055],"domain_scores_gemma":[0.99915534,0.00021239088,0.00022300682,0.00010602705,0.00022629318,0.00007694287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021768922,0.00011243438,0.00018786143,0.000040512783,0.00015430173,0.000079831596,0.00013203107,0.00009687433,0.0000030508577],"category_scores_gemma":[0.000498585,0.00008739976,0.00004952214,0.00020926236,0.00004342032,0.0002599466,0.000030603,0.0001543278,6.4116796e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000146179,0.0000049324353,0.00029793096,0.0000144500245,0.000023819799,3.2978565e-7,0.000039176874,0.98513263,0.000099957106,0.0022323832,0.000269684,0.011870101],"study_design_scores_gemma":[0.000316113,0.000043303316,0.00025387647,0.000027590499,0.000038226557,0.00007213365,0.000017096892,0.99747896,0.00004297044,0.0014530156,0.00016975543,0.00008694203],"about_ca_topic_score_codex":0.0000021167907,"about_ca_topic_score_gemma":0.0000043914742,"teacher_disagreement_score":0.08884294,"about_ca_system_score_codex":0.00013437241,"about_ca_system_score_gemma":0.000028975446,"threshold_uncertainty_score":0.35640588},"labels":[],"label_agreement":null},{"id":"W2047041799","doi":"10.1007/s10898-005-4207-8","title":"Approximations and Lower Bounds for the Length of Minimal Euclidean Steiner Trees","year":2006,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Mathematics; Upper and lower bounds; Combinatorics; Conjecture; Euclidean space; Euclidean geometry; Tree (set theory); Discrete mathematics; Space (punctuation); Topology (electrical circuits); Mathematical analysis; Geometry; Computer science","score_opus":0.00582047564380004,"score_gpt":0.2107929045233077,"score_spread":0.20497242887950767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047041799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02012637,0.00080438517,0.9773295,0.00015054112,0.00012116104,0.00012999156,0.000018920327,0.000029475765,0.0012896671],"genre_scores_gemma":[0.9137946,0.000119819226,0.08591913,0.000010537831,0.0001170385,0.0000031060695,0.0000031282102,0.000008548181,0.000024109057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994879,0.000009289892,0.00029264792,0.000036268335,0.00010076034,0.00007316983],"domain_scores_gemma":[0.999622,0.000046852867,0.00012144515,0.000057317782,0.00013379652,0.000018594406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014889057,0.000066000575,0.000116783645,0.000032558008,0.000037920538,0.00003260727,0.000069576075,0.000044593213,0.000006165167],"category_scores_gemma":[0.000025183526,0.00004627747,0.0000574445,0.000108064705,0.000028622862,0.0001714432,0.000006035507,0.000040953637,9.133147e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003792551,0.000044207736,0.0007536155,0.000026631431,0.00005128859,8.921888e-7,0.000031424053,0.9843182,0.00067101687,0.0029802418,0.0072592143,0.0038253544],"study_design_scores_gemma":[0.0007805291,0.00033353054,0.0043177377,0.000055580895,0.0001435192,0.000053989734,0.000077003075,0.98855054,0.0012611178,0.0015997369,0.0026894652,0.00013726176],"about_ca_topic_score_codex":0.0000049502114,"about_ca_topic_score_gemma":0.000006521983,"teacher_disagreement_score":0.89366823,"about_ca_system_score_codex":0.000037394326,"about_ca_system_score_gemma":0.000013016767,"threshold_uncertainty_score":0.18871404},"labels":[],"label_agreement":null},{"id":"W2050975551","doi":"10.1007/s10898-014-0149-3","title":"Column generation bounds for numerical microaggregation","year":2014,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Column generation; Column (typography); Heuristic; Upper and lower bounds; Confidentiality; Value (mathematics); Work (physics); Mathematical optimization; Combinatorics; Statistics; Computer science","score_opus":0.01961145949859944,"score_gpt":0.27178395616713447,"score_spread":0.25217249666853503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050975551","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019076081,0.00007368287,0.98466015,0.012253096,0.0007677176,0.000115063754,0.000005940787,0.00007725803,0.00013948085],"genre_scores_gemma":[0.14879008,0.000024733665,0.85072494,0.00022130267,0.00021223047,0.0000032635883,0.000013066713,0.0000047377102,0.0000056618724],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989508,0.000065649445,0.00039797844,0.00016751842,0.0002639987,0.00015408233],"domain_scores_gemma":[0.99788916,0.00005817741,0.0005271791,0.0010222524,0.00045139855,0.00005184535],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00057346467,0.00008930898,0.00015479256,0.000060009374,0.00010985537,0.00025055616,0.0042871046,0.00010146141,0.0000038446137],"category_scores_gemma":[0.008918842,0.00008523971,0.00006870719,0.00040000494,0.00002701902,0.0010736965,0.001966505,0.000079787045,0.0000023449986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057380174,0.00017405988,0.0017119643,0.000022848706,0.00006133854,0.0000033904969,0.000027670949,0.40506172,0.001273305,0.02460422,0.4637856,0.10321651],"study_design_scores_gemma":[0.0004523856,0.00023049687,0.00018149924,0.000014938018,0.0000115042485,0.000055541546,0.0000022930367,0.9716466,0.00070018094,0.023147454,0.0034691533,0.000087925706],"about_ca_topic_score_codex":0.000003532175,"about_ca_topic_score_gemma":0.000001773194,"teacher_disagreement_score":0.5665849,"about_ca_system_score_codex":0.0002440949,"about_ca_system_score_gemma":0.00008724772,"threshold_uncertainty_score":0.99942946},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.015973272061729608,"score_gpt":0.23259356394478178,"score_spread":0.21662029188305218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052697378","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070220674,0.00012252254,0.9953811,0.00007220801,0.00033157947,0.00023179819,0.00002430463,0.000044817672,0.0030894272],"genre_scores_gemma":[0.34187105,0.000119043296,0.6577025,0.000030257383,0.00017646755,0.0000049464957,0.00004651651,0.000024699837,0.00002451922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988914,0.000036755457,0.00059985905,0.000091024915,0.00021558299,0.0001653682],"domain_scores_gemma":[0.99898624,0.000031948846,0.0003544334,0.000111294496,0.00044016537,0.00007590629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004348592,0.00013217286,0.00026926515,0.00008393372,0.000038936312,0.000034733708,0.00013509867,0.0001237342,0.00001523366],"category_scores_gemma":[0.000104174156,0.00012028868,0.00012329093,0.0003085792,0.000025764157,0.00026276006,0.00001091076,0.00009151571,9.904708e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003027165,0.000066421126,0.00023819048,0.00016672022,0.00004577835,7.952785e-8,0.00005337359,0.9959371,0.00014691465,0.00045306937,0.0009828861,0.0018791577],"study_design_scores_gemma":[0.00097530603,0.00019360997,0.00008079893,0.00006869784,0.00004565384,0.000020191288,0.000014062222,0.9964446,0.00016642884,0.00013092294,0.0017402779,0.00011946287],"about_ca_topic_score_codex":0.0000021271067,"about_ca_topic_score_gemma":0.0000011540162,"teacher_disagreement_score":0.34116885,"about_ca_system_score_codex":0.000114391805,"about_ca_system_score_gemma":0.000041719853,"threshold_uncertainty_score":0.490523},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Science Foundation","keywords":"Bilevel optimization; Mathematical optimization; Mathematics; Optimization problem; Global optimization","score_opus":0.007580607459892368,"score_gpt":0.2645765146161052,"score_spread":0.25699590715621284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052741439","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012872762,0.00014450283,0.98703367,0.0086899195,0.00047570272,0.0000938985,0.000013304819,0.00007340112,0.0033468776],"genre_scores_gemma":[0.21847181,0.00017726867,0.77995276,0.0012480784,0.00009040917,7.040827e-7,0.000019314828,0.000004472652,0.000035205332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978532,0.000111553054,0.00079962215,0.0002548994,0.0007410596,0.00023962872],"domain_scores_gemma":[0.9975339,0.0000178409,0.0008063226,0.0002723089,0.0011723414,0.00019725566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003926555,0.00020340715,0.00031754022,0.00013035387,0.00013872248,0.0003299634,0.00075377146,0.00012741474,0.00009481274],"category_scores_gemma":[0.00019903929,0.0001805842,0.0002225894,0.0020423997,0.000022401713,0.0017158402,0.00006157891,0.00010274733,0.000009618542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023489458,0.00014070768,0.0002753218,0.0000020442953,0.000043071403,0.000008896985,0.000020296035,0.95683813,0.0000027690776,0.030624704,0.000523298,0.011497258],"study_design_scores_gemma":[0.0007006032,0.00020978424,0.0052229734,0.000021115158,0.000055715704,0.0001384913,0.000009465789,0.9882883,0.000004672071,0.0050217737,0.00014299378,0.000184148],"about_ca_topic_score_codex":0.0000069294138,"about_ca_topic_score_gemma":0.0000024731035,"teacher_disagreement_score":0.21834308,"about_ca_system_score_codex":0.0006320207,"about_ca_system_score_gemma":0.00038097106,"threshold_uncertainty_score":0.736401},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06516242544786878,"score_gpt":0.4082980049243089,"score_spread":0.34313557947644013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054567731","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11520233,0.0001422653,0.8836099,0.0005633267,0.00003755148,0.00019263935,0.00002999098,0.000011009245,0.00021102683],"genre_scores_gemma":[0.21294534,0.00010398953,0.78677315,0.00010719174,0.00003727882,9.041302e-7,0.000006462815,0.000010233648,0.000015482125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998426,0.0003510852,0.0005569697,0.00012371664,0.00036326196,0.00017893672],"domain_scores_gemma":[0.99886537,0.00022869464,0.000386498,0.00009589869,0.00031257202,0.00011098824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008976172,0.00011479302,0.00023995014,0.00008542346,0.000104902196,0.00003865384,0.00011906218,0.000062865605,0.00012763223],"category_scores_gemma":[0.0009526245,0.00010599747,0.000040839594,0.00036509155,0.000100290694,0.0006491638,0.00008194818,0.00017336037,5.1358e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002023123,0.0004522903,0.014228719,0.000030585445,0.00005957973,0.000006138319,0.0004543957,0.97353303,0.0002234922,0.0072106305,0.0007791456,0.0028196927],"study_design_scores_gemma":[0.00273143,0.000075478616,0.001153842,0.00009522009,0.000033999808,0.000046656984,0.00089870335,0.9760826,0.00026346085,0.018272484,0.00017223076,0.00017386813],"about_ca_topic_score_codex":0.000012702463,"about_ca_topic_score_gemma":0.000015568137,"teacher_disagreement_score":0.09774301,"about_ca_system_score_codex":0.00050450343,"about_ca_system_score_gemma":0.0000760215,"threshold_uncertainty_score":0.43224514},"labels":[],"label_agreement":null},{"id":"W2056349109","doi":"10.1007/s10898-010-9586-9","title":"Remarks on solutions to a nonconvex quadratic programming test problem","year":2010,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Quadratic programming; Mathematical optimization; Quadratic equation; Selection (genetic algorithm); Sequential quadratic programming; Test (biology); Optimization problem; Artificial intelligence; Computer science","score_opus":0.027216482384094128,"score_gpt":0.35534658734124475,"score_spread":0.3281301049571506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056349109","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015908062,0.00001236,0.9918419,0.0025482178,0.00034156485,0.0006523106,0.000010682966,0.000060071703,0.002942079],"genre_scores_gemma":[0.040637977,0.0000135009095,0.9586912,0.00014410421,0.0002446045,0.000018748859,0.000004332756,0.000030606374,0.00021493723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978256,0.00007515826,0.00077143917,0.0001952532,0.00074879715,0.00038374346],"domain_scores_gemma":[0.9972432,0.0003634648,0.000553514,0.0002592408,0.0012602983,0.0003202597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083989545,0.00018630986,0.00030246266,0.00017988522,0.00020197128,0.0001414998,0.00031604277,0.00014044397,0.00015690537],"category_scores_gemma":[0.0047540176,0.0001620174,0.00011356388,0.00095738855,0.000058149377,0.0004139693,0.00007165669,0.00048710083,0.000025500383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013101664,0.0010049923,0.00060012843,0.000060594997,0.00005794666,0.000035712845,0.00021946043,0.95733494,0.00034669816,0.021618487,0.00440272,0.014187331],"study_design_scores_gemma":[0.0050420077,0.0042303237,0.00062324665,0.0008521977,0.00024260837,0.0011078505,0.00070048164,0.9338697,0.0006177589,0.04358987,0.007887705,0.0012361994],"about_ca_topic_score_codex":0.0000032099376,"about_ca_topic_score_gemma":0.00003726566,"teacher_disagreement_score":0.03904717,"about_ca_system_score_codex":0.00030901027,"about_ca_system_score_gemma":0.00028604883,"threshold_uncertainty_score":0.66068774},"labels":[],"label_agreement":null},{"id":"W2065013830","doi":"10.1007/s10898-006-9045-9","title":"Comparison Between Baumann and Admissible Simplex Forms in Interval Analysis","year":2006,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Simplex; Bounding overwatch; Combinatorics; Upper and lower bounds; Interval (graph theory); Simplex algorithm; Regular polygon; Linear programming; Discrete mathematics; Mathematical optimization; Mathematical analysis; Geometry","score_opus":0.021915825753188636,"score_gpt":0.3418294468815145,"score_spread":0.3199136211283259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065013830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03743194,0.00016332607,0.9614864,0.0004718555,0.00006228991,0.000034370943,0.000002258896,0.000009339584,0.00033823913],"genre_scores_gemma":[0.5254799,0.000007894397,0.47442797,0.000027302429,0.000048321384,2.0702778e-7,0.0000016234148,0.0000015297836,0.0000052119963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988908,0.00007966283,0.0005402745,0.00012385628,0.00022228222,0.00014311136],"domain_scores_gemma":[0.9993013,0.00005150166,0.00035613924,0.00009636001,0.00010594421,0.00008873065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040918653,0.0000838277,0.0003473801,0.0001436213,0.000034939072,0.0001366713,0.00025283368,0.000044933106,0.0000079084175],"category_scores_gemma":[0.00003619762,0.00006525025,0.00009390299,0.0012673794,0.000017928556,0.00054942217,0.000072414085,0.000093767776,4.5807994e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000116066,0.000088881105,0.4354396,0.000005079543,0.000071856266,0.000010971454,0.000029840327,0.47682714,0.0000052242453,0.0019448294,0.00015733087,0.08540767],"study_design_scores_gemma":[0.0003484897,0.000140155,0.20086953,0.000013707558,0.00006232952,0.000008989478,0.000012254443,0.79375184,0.00002520386,0.004417184,0.00026789823,0.000082419596],"about_ca_topic_score_codex":0.0000723209,"about_ca_topic_score_gemma":0.000016190794,"teacher_disagreement_score":0.488048,"about_ca_system_score_codex":0.000089981826,"about_ca_system_score_gemma":0.000030086714,"threshold_uncertainty_score":0.2660828},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.023416166599430736,"score_gpt":0.3095328237218821,"score_spread":0.2861166571224514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079646161","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006374249,0.000045275894,0.9968643,0.0018066284,0.0002733381,0.00017838457,0.000004844409,0.000045318895,0.00014447358],"genre_scores_gemma":[0.06506451,0.000034796674,0.9341482,0.0004072505,0.0002654012,0.000008079323,0.000031874803,0.0000074595464,0.000032450647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984364,0.00010520756,0.00058903923,0.0002069566,0.00048530515,0.00017712053],"domain_scores_gemma":[0.9976349,0.000051246327,0.0006855362,0.00016626193,0.0013082932,0.00015378883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060552463,0.00013237316,0.0002488598,0.00011927309,0.00023782565,0.00017289509,0.00040656672,0.00007815122,0.00004231677],"category_scores_gemma":[0.00014821581,0.0001135684,0.00020649095,0.0006772949,0.000018252835,0.0019565136,0.00003240617,0.00008497088,0.0000015704949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006221611,0.00025017466,0.0013156687,0.0000037462112,0.000072327544,0.00000497626,0.0000748912,0.974984,0.00004575258,0.020080298,0.00044138872,0.0026645472],"study_design_scores_gemma":[0.00095487834,0.00029400646,0.001049513,0.000009058302,0.00003887266,0.0002951099,0.000012375086,0.9953681,0.000042646505,0.0013929497,0.00041301583,0.00012946338],"about_ca_topic_score_codex":0.000013999675,"about_ca_topic_score_gemma":0.0000025237414,"teacher_disagreement_score":0.06442709,"about_ca_system_score_codex":0.00019119873,"about_ca_system_score_gemma":0.00030928227,"threshold_uncertainty_score":0.4631185},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02558329019184007,"score_gpt":0.3012648757875383,"score_spread":0.2756815855956982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082247794","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006409613,0.0003975236,0.995796,0.00042482628,0.0015677351,0.00067860674,0.000043126707,0.00009132601,0.00035985443],"genre_scores_gemma":[0.043649253,0.00026295191,0.95511484,0.00013334185,0.0006696319,0.00004075754,0.00007780773,0.000038539965,0.00001289126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998064,0.00019382112,0.0009688495,0.00012867273,0.00035362222,0.00029102727],"domain_scores_gemma":[0.99794817,0.0003333614,0.0006613614,0.00021257924,0.0007409049,0.000103630664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014196376,0.00022209503,0.00040142878,0.00013485043,0.000094787894,0.000052898173,0.0002484845,0.00017053388,0.0001279541],"category_scores_gemma":[0.00020824598,0.00018033414,0.0001550183,0.0005434769,0.00006088035,0.00077916106,0.00004735263,0.00017861696,7.8956054e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005399537,0.000080645026,0.0003854307,0.00006173849,0.00013815328,3.1971945e-7,0.00015927078,0.9908,0.000051303767,0.000463698,0.0031823523,0.004623082],"study_design_scores_gemma":[0.00060979975,0.00020801138,0.00049006735,0.000051940282,0.00016401558,0.000042605498,0.000056321504,0.9962454,0.0006918567,0.000087340995,0.0011794805,0.00017320432],"about_ca_topic_score_codex":0.0000034077539,"about_ca_topic_score_gemma":7.799402e-7,"teacher_disagreement_score":0.043008294,"about_ca_system_score_codex":0.00044401377,"about_ca_system_score_gemma":0.000087932036,"threshold_uncertainty_score":0.7353813},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0055216888782681165,"score_gpt":0.22232140390186328,"score_spread":0.21679971502359516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087914194","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037466033,0.00007878839,0.99517107,0.0025387597,0.0006022094,0.00013064375,0.0000071156605,0.000041560186,0.0010552217],"genre_scores_gemma":[0.19192389,0.000015837406,0.80671436,0.00035760607,0.0003924569,0.0000037097882,0.000038926526,0.000009673505,0.00054353714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986271,0.000053568376,0.0006082081,0.00017345783,0.0003784595,0.00015918892],"domain_scores_gemma":[0.9977833,0.000034262826,0.0007417147,0.00016065425,0.0012175811,0.00006247523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036538317,0.00012157196,0.000216739,0.00011999869,0.00012677528,0.00021453248,0.00036621816,0.00008771919,0.00002485294],"category_scores_gemma":[0.00013650593,0.000111921305,0.00018677603,0.0008592805,0.000023579863,0.0009251776,0.000035652098,0.00005235696,0.0000029645216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025448246,0.000084671046,0.00029368247,0.0000044884146,0.00003137966,0.0000019148558,0.000015513799,0.82466805,0.0000759305,0.1709114,0.003618781,0.0002687237],"study_design_scores_gemma":[0.00085710635,0.00010971266,0.0014464427,0.000019867646,0.000054420234,0.000036238573,0.000007024312,0.9887062,0.00007990486,0.006913331,0.0016334627,0.00013629663],"about_ca_topic_score_codex":0.0000101710175,"about_ca_topic_score_gemma":0.000002550941,"teacher_disagreement_score":0.19154923,"about_ca_system_score_codex":0.000198576,"about_ca_system_score_gemma":0.00013569545,"threshold_uncertainty_score":0.45640182},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023149396058827276,"score_gpt":0.2857274072162192,"score_spread":0.26257801115739193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088855121","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016568237,0.0000948843,0.9704823,0.02758462,0.0004438075,0.00016749963,0.0001294728,0.000027614837,0.0009041344],"genre_scores_gemma":[0.4213256,0.000036445777,0.57738733,0.00068535923,0.0005026707,0.000005075303,0.000025079862,0.0000033641898,0.000029050683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979175,0.00019759394,0.0008848284,0.00021204608,0.0006152854,0.00017276606],"domain_scores_gemma":[0.9968565,0.00039608896,0.0008469599,0.00029054857,0.0015043302,0.000105543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019611411,0.00012956721,0.00020595998,0.00003462048,0.00022246203,0.00023487178,0.00066492753,0.00007576338,0.000045447992],"category_scores_gemma":[0.0013486659,0.00009101034,0.0002178757,0.0009510891,0.000029904635,0.0010432453,0.00007664057,0.00007039268,0.0000042881397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015699146,0.00012281052,0.001222339,0.0000026446355,0.00007481151,2.0382848e-7,0.000040689818,0.8899126,9.1164327e-7,0.10473624,0.0024277796,0.0013019863],"study_design_scores_gemma":[0.0011420491,0.00008069861,0.022872405,0.0000056859935,0.000058547317,0.000016879965,0.000017243998,0.9704631,0.000004866311,0.0018717194,0.0033668212,0.00009998012],"about_ca_topic_score_codex":0.000017441309,"about_ca_topic_score_gemma":0.000039458333,"teacher_disagreement_score":0.42115992,"about_ca_system_score_codex":0.0005568539,"about_ca_system_score_gemma":0.00037802002,"threshold_uncertainty_score":0.3711294},"labels":[],"label_agreement":null},{"id":"W2096911290","doi":"10.1007/s10898-015-0397-x","title":"A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces","year":2015,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de Goiás; University of British Columbia; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Variational inequality; Hilbert space; Subgradient method; Monotone polygon; Hyperplane; Monotonic function; Sequence (biology); Projection (relational algebra); Solution set; Strongly monotone; Projection method; Applied mathematics; Pure mathematics; Set (abstract data type); Dykstra's projection algorithm; Mathematical analysis; Mathematical optimization; Algorithm; Combinatorics","score_opus":0.028997157491633094,"score_gpt":0.2842935387154878,"score_spread":0.2552963812238547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096911290","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024431283,0.00009245656,0.99535406,0.0031598788,0.00052216556,0.00011691424,0.000008296826,0.000022400138,0.00047952047],"genre_scores_gemma":[0.022153242,0.000023311708,0.9771685,0.0002816504,0.00024675447,0.000006363859,0.00001961024,0.0000056738572,0.00009489719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984125,0.00014541003,0.00066003046,0.00016157531,0.0004729331,0.00014756393],"domain_scores_gemma":[0.9978264,0.00012210762,0.00064882013,0.000102443904,0.0012016683,0.00009858887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014472397,0.00010836432,0.00021577817,0.00021247532,0.000066005996,0.00021515499,0.00026497955,0.00007915498,0.000008622966],"category_scores_gemma":[0.00065236754,0.000099661534,0.00010173531,0.0010138036,0.000012578096,0.0014078724,0.000045585144,0.000076721946,0.000001885445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022657638,0.00008094408,0.0020659675,0.0000038939847,0.00003318535,0.0000018584801,0.00029595278,0.9287182,9.308051e-7,0.06286894,0.0005789515,0.0053284965],"study_design_scores_gemma":[0.0010988284,0.000120846875,0.0008317699,0.000022717226,0.000020470265,0.000038403985,0.00016934087,0.99030304,0.0000046002483,0.006720719,0.0005634314,0.00010583305],"about_ca_topic_score_codex":0.00006393412,"about_ca_topic_score_gemma":0.000014586639,"teacher_disagreement_score":0.061584815,"about_ca_system_score_codex":0.00043673514,"about_ca_system_score_gemma":0.00041293874,"threshold_uncertainty_score":0.40640795},"labels":[],"label_agreement":null},{"id":"W2097555437","doi":"10.1007/s10898-014-0239-2","title":"Locating a median line with partial coverage distance","year":2014,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Combinatorics; Line (geometry); Norm (philosophy); Dominating set; Enumeration; Finite set; Line segment; Point (geometry); Set (abstract data type); Mathematical analysis; Geometry; Graph","score_opus":0.005792925663033304,"score_gpt":0.2259134742240741,"score_spread":0.2201205485610408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097555437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00489603,0.00005552134,0.99286735,0.0012532491,0.00032598586,0.000043270426,0.000001089541,0.000016790438,0.0005407076],"genre_scores_gemma":[0.7010577,0.00000792767,0.29847103,0.0002020202,0.00024440148,5.718596e-7,0.0000032056562,0.0000022076615,0.000010948983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908596,0.000063385894,0.0002867534,0.00010954746,0.00034917632,0.0001051933],"domain_scores_gemma":[0.9990324,0.00004479268,0.00035579398,0.00010691603,0.0003730867,0.0000870468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032830547,0.00007542757,0.00011745755,0.000039448252,0.000074876225,0.00012226518,0.00021808737,0.000028558085,0.0000061032174],"category_scores_gemma":[0.0001277314,0.000059863753,0.00003310526,0.0005039372,0.000015529316,0.0006274794,0.000025737083,0.00006414847,0.0000022965135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026278607,0.000031562897,0.00057277764,0.000004102191,0.000007997129,0.0000042992046,0.000035093897,0.9654019,0.000012454255,0.01404015,0.00009718286,0.019766236],"study_design_scores_gemma":[0.00055495946,0.00030473692,0.00050618727,0.00002802477,0.000009505666,0.00009471383,0.0000038701596,0.9958455,0.00014873382,0.0011645214,0.0012614868,0.00007776432],"about_ca_topic_score_codex":0.0000019532097,"about_ca_topic_score_gemma":0.000005954138,"teacher_disagreement_score":0.6961616,"about_ca_system_score_codex":0.000078214594,"about_ca_system_score_gemma":0.00011832109,"threshold_uncertainty_score":0.24411729},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025646263397429522,"score_gpt":0.3237365574687904,"score_spread":0.29809029407136084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100485099","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05785542,0.000085004554,0.9408269,0.00039443132,0.00065305847,0.00011818261,0.0000073329707,0.000012374723,0.000047316298],"genre_scores_gemma":[0.18185572,0.000011209147,0.81791645,0.000105945706,0.00009647794,0.0000028695458,0.000002824164,0.000004225236,0.0000042452107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907345,0.000040004285,0.0003821788,0.00011643235,0.00026801473,0.00011992771],"domain_scores_gemma":[0.998783,0.00010385652,0.00045012214,0.00010638498,0.0004873357,0.000069309644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005128926,0.000082233084,0.00015938823,0.000063701526,0.00008414069,0.00011412015,0.00020906677,0.00007035468,0.000009504819],"category_scores_gemma":[0.00016321176,0.00007089291,0.000076844306,0.0001709083,0.000025759038,0.0005262004,0.000042018288,0.0000871774,5.405203e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008779019,0.00010681737,0.0004503176,0.00005914167,0.00002843912,0.0000028766538,0.00014569671,0.2850116,0.0107216425,0.00019101363,0.00034266047,0.702852],"study_design_scores_gemma":[0.0010629485,0.0003008075,0.0002687588,0.000101213205,0.00001944791,0.000033799726,0.000017305485,0.99488086,0.002567136,0.00060882606,0.00006203132,0.000076856064],"about_ca_topic_score_codex":0.0000065803347,"about_ca_topic_score_gemma":0.0000063288753,"teacher_disagreement_score":0.70986927,"about_ca_system_score_codex":0.000025735148,"about_ca_system_score_gemma":0.00011788611,"threshold_uncertainty_score":0.28909287},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.006722708713548566,"score_gpt":0.22668076712831112,"score_spread":0.21995805841476254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105046377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31821746,0.00080806436,0.6723541,0.00016094283,0.0009309594,0.00019740153,0.000009749713,0.00013778887,0.0071835658],"genre_scores_gemma":[0.86271286,0.00021699327,0.13684852,0.000047368954,0.00011105387,0.0000017186137,0.000005261543,0.000025496016,0.00003075346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987045,0.000066031964,0.00057603675,0.000104028884,0.00032265327,0.0002267844],"domain_scores_gemma":[0.9993131,0.00002773524,0.00027378963,0.00010977896,0.00018252201,0.00009308116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033556542,0.00016202549,0.00028968378,0.00011419794,0.00003451549,0.00006587804,0.00017290594,0.00012032387,0.00007219978],"category_scores_gemma":[0.00021605314,0.0001599895,0.00007489696,0.000599469,0.000019466388,0.0005319693,0.000009742296,0.00015260518,0.00001655595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012245961,0.000031625557,0.012075139,0.000013275666,0.000019688187,0.000026384396,0.000029239938,0.9868906,0.00012558978,0.000118137476,0.0005782093,0.00007984837],"study_design_scores_gemma":[0.0010681166,0.000090582595,0.005437273,0.00016506086,0.00004834456,0.00028028653,0.0001385043,0.99135834,0.0005783737,0.00008133797,0.00046591426,0.00028784573],"about_ca_topic_score_codex":0.0000021992537,"about_ca_topic_score_gemma":0.000003977004,"teacher_disagreement_score":0.5444954,"about_ca_system_score_codex":0.0004286495,"about_ca_system_score_gemma":0.00006765309,"threshold_uncertainty_score":0.65241826},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.027345270433135983,"score_gpt":0.3021882505185445,"score_spread":0.2748429800854085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105120842","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071501045,0.000054952536,0.9981276,0.000079550075,0.0005453239,0.00016264769,0.0000066410475,0.00004016172,0.00026813353],"genre_scores_gemma":[0.028098047,0.0000118400785,0.97168714,0.000044092332,0.00013016515,0.000004187258,0.0000013050393,0.00000980187,0.000013451725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867666,0.00005669664,0.00038746433,0.0001952741,0.0003938799,0.00029002604],"domain_scores_gemma":[0.99869835,0.00002424841,0.00028869693,0.00025374437,0.0005546594,0.00018032448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004898872,0.000116536925,0.00017443778,0.000090156995,0.00009814673,0.00011519393,0.00079552055,0.00005860815,0.000011593196],"category_scores_gemma":[0.000051740608,0.00010627619,0.00008397487,0.0003604007,0.000029311273,0.0007619506,0.00013639317,0.00010207092,0.0000023530758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039645944,0.00011263644,0.000032584812,0.0000063312636,0.000013210095,0.00002282734,0.00012527598,0.85196054,0.000021300151,0.00043143737,0.000023376313,0.14721084],"study_design_scores_gemma":[0.0006766836,0.0005888333,0.00039546864,0.000023239356,0.0000067818632,0.00022971828,0.000035314584,0.9973371,0.00016638821,0.00035898146,0.000069928414,0.00011154614],"about_ca_topic_score_codex":0.000006231558,"about_ca_topic_score_gemma":0.000001031921,"teacher_disagreement_score":0.14709929,"about_ca_system_score_codex":0.0002594272,"about_ca_system_score_gemma":0.00010471941,"threshold_uncertainty_score":0.43338174},"labels":[],"label_agreement":null},{"id":"W2112767856","doi":"10.1007/s10898-014-0148-4","title":"Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems","year":2014,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McGill University; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Branch and bound; Integer (computer science); Bounding overwatch; Relaxation (psychology); Norm (philosophy); Upper and lower bounds; Tree (set theory); Mathematical optimization; Combinatorics; Discrete mathematics; Algorithm; Computer science","score_opus":0.012743016755149045,"score_gpt":0.24718801793251077,"score_spread":0.23444500117736172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112767856","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011010038,0.00010919966,0.99681264,0.0007046311,0.00030063215,0.00032009918,0.0000056864947,0.000017761382,0.0006283165],"genre_scores_gemma":[0.42564628,0.000050145725,0.57365084,0.00013191762,0.00040083582,0.00002627654,0.0000102421845,0.000007510856,0.000075935015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992404,0.00007422375,0.00030221057,0.00012400384,0.0001415213,0.000117657684],"domain_scores_gemma":[0.9988076,0.0002679334,0.00045606116,0.00011221488,0.000313645,0.000042534262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010916446,0.00007994314,0.00012364665,0.000030169578,0.00024470096,0.00024971995,0.00026049995,0.000049991664,0.0000024336061],"category_scores_gemma":[0.0002304928,0.00005492245,0.000072963136,0.00014388651,0.000032679625,0.00074080506,0.000027954,0.00006737469,3.0428157e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046711782,0.00003276489,0.00012457455,0.000042868465,0.000028047561,4.3448814e-8,0.00021649033,0.8346738,0.000007587635,0.14895737,0.00021804076,0.015651656],"study_design_scores_gemma":[0.0006371909,0.00022457054,0.00053119246,0.00003202386,0.000036777168,0.00004060697,0.00004684257,0.97539705,0.000022884864,0.022562126,0.00039779078,0.00007093521],"about_ca_topic_score_codex":0.0000033666752,"about_ca_topic_score_gemma":0.0000013046039,"teacher_disagreement_score":0.4245453,"about_ca_system_score_codex":0.000049851904,"about_ca_system_score_gemma":0.00003861184,"threshold_uncertainty_score":0.24080552},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.17334731870348868,"score_gpt":0.410255208144609,"score_spread":0.2369078894411203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115983461","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009532046,0.00010175304,0.98908764,0.0003365447,0.00020584786,0.00043199325,0.00006679877,0.0000095340265,0.00022785384],"genre_scores_gemma":[0.33125934,0.000017092509,0.6685673,0.00009084537,0.000035282857,0.000008053976,6.111689e-7,0.000007431313,0.000014084761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986131,0.0003561004,0.0005322704,0.00009453291,0.0002818007,0.00012216798],"domain_scores_gemma":[0.9978808,0.00042932128,0.000981915,0.00015802476,0.00050468685,0.00004525841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009324867,0.000114337185,0.0003096582,0.000020570293,0.00015217585,0.000017758997,0.00021488324,0.00006239591,0.000015386284],"category_scores_gemma":[0.0017730618,0.000055778848,0.00014029487,0.00011792892,0.00012261301,0.00020438242,0.000029433546,0.00013323038,2.7054352e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017468368,0.0005894986,0.00073574553,0.00028681516,0.00017765407,8.943168e-7,0.00086752465,0.11731343,0.00025445828,0.872193,0.0023119645,0.0035221924],"study_design_scores_gemma":[0.00097061537,0.00054267806,0.0006405087,0.00030737845,0.0003159284,0.000022332864,0.00047866238,0.20070551,0.0033308507,0.7924899,0.00006369495,0.0001319761],"about_ca_topic_score_codex":0.000011572596,"about_ca_topic_score_gemma":0.000006045309,"teacher_disagreement_score":0.32172728,"about_ca_system_score_codex":0.000075388554,"about_ca_system_score_gemma":0.00006767384,"threshold_uncertainty_score":0.22745954},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.033877502786391935,"score_gpt":0.36451989184276096,"score_spread":0.330642389056369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149760726","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71624887,0.00003740075,0.27968448,0.0002199655,0.00025226286,0.00026779904,0.000008890984,0.000011694899,0.0032686316],"genre_scores_gemma":[0.93684775,0.0000066391444,0.06282807,0.000086209926,0.00012858877,0.0000072640237,0.0000026095158,0.000006180576,0.00008666722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751645,0.0002911091,0.001055708,0.00021730282,0.00074735517,0.00017206883],"domain_scores_gemma":[0.99772483,0.00024521415,0.00087212824,0.00034455667,0.0006528679,0.00016040212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034853823,0.00011913028,0.00039856165,0.00016479677,0.000078497804,0.00023282216,0.00060191524,0.000115334056,0.00017919573],"category_scores_gemma":[0.0022729458,0.000085186024,0.000119443575,0.0008311374,0.00008181967,0.00091605977,0.00004110631,0.00029477384,0.000011937681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006796499,0.0005484709,0.012718845,0.0000024033507,0.000018223425,0.00000544422,0.00058593176,0.96855456,0.0014334266,0.009837913,0.00018286653,0.005432292],"study_design_scores_gemma":[0.008781761,0.00025745854,0.03017679,0.000020889074,0.00004404731,0.00018435613,0.0019686983,0.94503975,0.0001157032,0.011481897,0.0016669338,0.0002617053],"about_ca_topic_score_codex":0.0000069560456,"about_ca_topic_score_gemma":0.000037188624,"teacher_disagreement_score":0.22059889,"about_ca_system_score_codex":0.00007513544,"about_ca_system_score_gemma":0.00017951068,"threshold_uncertainty_score":0.34737852},"labels":[],"label_agreement":null},{"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02457143740247184,"score_gpt":0.3308629553278328,"score_spread":0.3062915179253609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151238122","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063177064,0.00013101898,0.9960013,0.00088605506,0.0006548419,0.00035571074,0.000018672745,0.00007067596,0.001249946],"genre_scores_gemma":[0.04555365,0.00007953651,0.95396715,0.00028865278,0.000059857717,0.0000074405243,0.0000051655115,0.000014667119,0.000023849754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966089,0.00093764317,0.0010405692,0.0003772885,0.00071997073,0.00031562647],"domain_scores_gemma":[0.9957034,0.0003464802,0.0016194197,0.00047777465,0.001639762,0.00021316604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015710375,0.00029729074,0.0004971764,0.00018103518,0.00012874439,0.0001368847,0.000799797,0.00016421718,0.000058674435],"category_scores_gemma":[0.0012712596,0.000279374,0.00020774324,0.0024048998,0.00009403945,0.00144994,0.00010396445,0.00016637548,0.0000033008673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010033245,0.00027235833,0.0017793087,0.0000059958834,0.000036289006,0.00002719645,0.000021548525,0.988131,0.000028613458,0.0007740325,0.000105692685,0.007814653],"study_design_scores_gemma":[0.0019355369,0.00066085655,0.0018635779,0.00007772101,0.000032704807,0.00013388103,0.000035304838,0.99417436,0.00019487602,0.00016635857,0.00048533763,0.00023950038],"about_ca_topic_score_codex":0.000008947962,"about_ca_topic_score_gemma":0.0000018877187,"teacher_disagreement_score":0.04492188,"about_ca_system_score_codex":0.00095687225,"about_ca_system_score_gemma":0.0005603045,"threshold_uncertainty_score":0.99996585},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Lemma (botany); Pure mathematics; Discrete mathematics; Combinatorics","score_opus":0.02405172828966571,"score_gpt":0.30415340798696977,"score_spread":0.28010167969730404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156395865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020927759,0.000039410712,0.9773687,0.0008922028,0.00027330877,0.00024495018,0.000043676795,0.0000050478147,0.00020490286],"genre_scores_gemma":[0.89802873,0.0000059923655,0.10174892,0.00005444903,0.00012482356,0.0000029094344,0.0000066249895,0.00000633267,0.000021206926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998652,0.00007891219,0.0007341826,0.00007786421,0.000348801,0.00010825514],"domain_scores_gemma":[0.99786586,0.00030337131,0.001165179,0.00017215697,0.0004569991,0.00003641119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005630606,0.00009162803,0.0002963014,0.0000640749,0.00014658929,0.000034993605,0.00023272027,0.00006131682,0.00003213171],"category_scores_gemma":[0.00061829394,0.000048233793,0.0003690699,0.00078037457,0.00004731249,0.00012985987,0.000027876818,0.000062372696,3.236386e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003258433,0.000070189155,0.00031754884,0.000008688397,0.00037447683,1.3162904e-7,0.000100613484,0.789296,0.00010340598,0.20941542,0.000026706584,0.00025427988],"study_design_scores_gemma":[0.0012131948,0.00007657374,0.006291723,0.00008155276,0.0014594084,0.000020386251,0.00024329447,0.54548174,0.00007129831,0.4448802,0.000059542723,0.000121116485],"about_ca_topic_score_codex":0.000016590655,"about_ca_topic_score_gemma":0.00002329587,"teacher_disagreement_score":0.877101,"about_ca_system_score_codex":0.00021251437,"about_ca_system_score_gemma":0.00009142106,"threshold_uncertainty_score":0.1966917},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.030173873706497926,"score_gpt":0.25338587927780737,"score_spread":0.22321200557130944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294719872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030016992,0.000041115636,0.9937351,0.0013551026,0.00023538107,0.00031973288,0.000011123802,0.000029590477,0.0012711994],"genre_scores_gemma":[0.78795284,0.000024858688,0.21024741,0.00058429985,0.0006228237,0.000010896913,0.00019266758,0.000016666036,0.0003475243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988652,0.000016963084,0.000360768,0.00013569814,0.00045576124,0.00016562224],"domain_scores_gemma":[0.9972622,0.0000066141383,0.00018522359,0.00010272351,0.0024070716,0.000036163085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006942213,0.0001177193,0.00015966276,0.000102407634,0.00009050159,0.00010079454,0.00016512396,0.000046539266,0.000042403324],"category_scores_gemma":[0.00005937029,0.00009673395,0.000052194922,0.00057290547,0.000059797352,0.0013575156,0.00004382184,0.00007027893,0.000021579344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021737846,0.00009960338,0.00087932084,0.000080264996,0.000037279664,0.0000018354805,0.000038219718,0.9790648,3.3919468e-7,0.001607933,0.002844543,0.015128447],"study_design_scores_gemma":[0.0014013667,0.00012757869,0.00042796147,0.000031029194,0.000070366565,0.0000046934792,0.0014874759,0.98425245,0.000004146771,0.00021361609,0.01185385,0.00012548322],"about_ca_topic_score_codex":0.00035034504,"about_ca_topic_score_gemma":0.00010363188,"teacher_disagreement_score":0.78495115,"about_ca_system_score_codex":0.0002682813,"about_ca_system_score_gemma":0.00016764403,"threshold_uncertainty_score":0.3944696},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07599725735112603,"score_gpt":0.32296229761482476,"score_spread":0.24696504026369873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396268331","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003972564,0.00015144696,0.99179596,0.0036452576,0.0010082246,0.00096420717,0.00009760429,0.00006787724,0.00187215],"genre_scores_gemma":[0.060121436,0.0010178108,0.93768203,0.00019963969,0.00048343948,0.000034718716,0.00006540439,0.0000413327,0.00035416664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994365,0.00032005028,0.0026572605,0.00055916404,0.0016502416,0.00044828423],"domain_scores_gemma":[0.99024546,0.00041135526,0.0037481794,0.00044752212,0.0048754825,0.0002719755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035889214,0.00036440088,0.0006974011,0.0004708377,0.00029849846,0.00044032175,0.00060972007,0.00030246988,0.00037031886],"category_scores_gemma":[0.003819137,0.00024200334,0.00035984884,0.0017028955,0.00015349852,0.0028893445,0.000065300876,0.00011261878,0.0000132994155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000310085,0.00012801767,0.00068983214,0.000009113653,0.00004367458,0.000002571006,0.00006628374,0.972838,0.000069852365,0.0022878523,0.0030867972,0.020467918],"study_design_scores_gemma":[0.0028579652,0.0004317289,0.00012469565,0.00014226399,0.00009061236,0.00011139413,0.00012682838,0.99160075,0.00021667386,0.0031116798,0.0008577072,0.0003277238],"about_ca_topic_score_codex":0.000003997789,"about_ca_topic_score_gemma":0.0000035368664,"teacher_disagreement_score":0.05972418,"about_ca_system_score_codex":0.00047774738,"about_ca_system_score_gemma":0.0004421776,"threshold_uncertainty_score":0.986861},"labels":[],"label_agreement":null},{"id":"W2460667336","doi":"10.1007/s10898-016-0448-y","title":"Universal rigidity of bar frameworks via the geometry of spectrahedra","year":2016,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Rigidity (electromagnetism); Geometry; Bar (unit); Pure mathematics; Structural engineering","score_opus":0.003312986122665342,"score_gpt":0.19276720046083787,"score_spread":0.18945421433817253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2460667336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14550985,0.00021165355,0.8532496,0.00022561321,0.0002741663,0.000039244755,0.000012001122,0.00001016319,0.00046768537],"genre_scores_gemma":[0.9782262,0.0004361363,0.021208007,0.00001126258,0.000102905,1.04458294e-7,0.0000016305092,0.0000065274103,0.000007214265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913013,0.000030777694,0.00043716977,0.000054336404,0.00025211624,0.000095440555],"domain_scores_gemma":[0.9991345,0.000051016195,0.00035027938,0.00011734282,0.0003045307,0.00004234747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014719716,0.00009029303,0.00022274842,0.00006444379,0.000025094992,0.000010244026,0.00017239864,0.00012142674,0.00024825233],"category_scores_gemma":[0.000073609604,0.000049535887,0.00013930272,0.00045286966,0.000051679253,0.00026426665,0.000014957389,0.00010953424,9.745587e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028141361,0.000010814211,0.002795403,0.00000896146,0.00010125247,0.0000011338993,0.00001886015,0.99282795,0.0006351906,0.0007059068,0.00024585286,0.0026205257],"study_design_scores_gemma":[0.0011995939,0.00022097032,0.02788315,0.0002090368,0.00035881883,0.00006244388,0.00011409249,0.9608983,0.0064848503,0.0021393672,0.00019457172,0.00023484771],"about_ca_topic_score_codex":0.000008290725,"about_ca_topic_score_gemma":0.0000023644773,"teacher_disagreement_score":0.83271635,"about_ca_system_score_codex":0.00012832253,"about_ca_system_score_gemma":0.00002210618,"threshold_uncertainty_score":0.27181888},"labels":[],"label_agreement":null},{"id":"W25085825","doi":"10.1023/a:1008328726430","title":"A Decomposition Method for Global and Local Quadratic Minimization","year":2000,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Maxima and minima; Mathematics; Dimension (graph theory); Mathematical optimization; Decomposition; Linear programming; Decomposition method (queueing theory); Quadratic programming; Quadratic equation; Applied mathematics; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.02473843642493805,"score_gpt":0.4079432596196537,"score_spread":0.38320482319471566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25085825","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014903825,0.00014900626,0.99640024,0.0006430813,0.000105537205,0.0004137981,0.000033958102,0.00003178976,0.00073221436],"genre_scores_gemma":[0.010509007,0.00018371874,0.988913,0.00012836188,0.00011870427,0.000010156338,0.00002108755,0.00001883653,0.0000971071],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998232,0.00017812137,0.000734293,0.00019154076,0.00042872087,0.00023530929],"domain_scores_gemma":[0.9982778,0.0002430576,0.00042558898,0.00012932738,0.00075354485,0.00017069507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004998717,0.00017318089,0.00033969598,0.00005767019,0.00013883434,0.00009505205,0.00014362589,0.00013329575,0.00020032049],"category_scores_gemma":[0.0004453015,0.00016094395,0.000105854626,0.00050541945,0.00006310657,0.0005847186,0.00002034015,0.00009332052,0.0000021339165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040447278,0.0001502599,0.00017688685,0.000052368418,0.00005688653,0.0000053977196,0.00004970567,0.92016757,0.000004948588,0.008662635,0.000886592,0.0693823],"study_design_scores_gemma":[0.0018776937,0.00033309546,0.00015276254,0.000066434855,0.0001015792,0.00033287998,0.00009211994,0.9576825,0.000034136625,0.038777668,0.00039373524,0.00015540223],"about_ca_topic_score_codex":0.0000036256667,"about_ca_topic_score_gemma":0.0000072533912,"teacher_disagreement_score":0.069226906,"about_ca_system_score_codex":0.0004508712,"about_ca_system_score_gemma":0.000136941,"threshold_uncertainty_score":0.6563104},"labels":[],"label_agreement":null},{"id":"W2550845292","doi":"10.1007/s10898-018-0688-0","title":"A Bayesian optimization approach to find Nash equilibria","year":2018,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Booth University College","funders":"Universiteit Leiden; National Science Foundation","keywords":"Bayesian probability; Nash equilibrium; Mathematical economics; Computer science; Economics; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.06602853053884729,"score_gpt":0.4121978716972752,"score_spread":0.3461693411584279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550845292","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017571403,0.000055778815,0.9881338,0.00083511695,0.00064842775,0.00025584592,0.000015903086,0.000019816,0.008278212],"genre_scores_gemma":[0.14816046,0.000015963125,0.85016674,0.0002491813,0.0008343351,0.000003165518,0.00000554548,0.000018348084,0.0005462545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99536836,0.0002685364,0.0011401519,0.0003787138,0.0024630667,0.00038117493],"domain_scores_gemma":[0.99508053,0.00018876872,0.0007359305,0.0004211876,0.0031819965,0.0003915749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023889896,0.00018111101,0.0003864865,0.0003713878,0.00019526713,0.00048344818,0.0010186228,0.00013216326,0.000508823],"category_scores_gemma":[0.0048339,0.00013826907,0.0001449006,0.0029938938,0.00013867133,0.001371672,0.00020242172,0.00017163638,0.00007085613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020415673,0.0000991506,0.000447414,0.0000016610917,0.000017805924,0.000005063113,0.000106948406,0.98605335,0.00003169144,0.00012892293,0.0065676942,0.0063361228],"study_design_scores_gemma":[0.0006752184,0.00048625682,0.00072996906,0.000020744088,0.000013086065,0.0001299094,0.00017833147,0.99504733,0.000064612796,0.0013666624,0.0011362197,0.00015168454],"about_ca_topic_score_codex":0.0000044289663,"about_ca_topic_score_gemma":0.0000024923122,"teacher_disagreement_score":0.14640331,"about_ca_system_score_codex":0.0003688764,"about_ca_system_score_gemma":0.00030346768,"threshold_uncertainty_score":0.57869786},"labels":[],"label_agreement":null},{"id":"W2606820485","doi":"10.1007/s10898-017-0581-2","title":"A Utility Theory Based Interactive Approach to Robustness in Linear Optimization","year":2017,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Robust optimization; Robustness (evolution); Linear programming; Probabilistic logic; Decision maker; Flexibility (engineering); Convex optimization; Optimization problem","score_opus":0.06205060786525529,"score_gpt":0.38402882627284857,"score_spread":0.3219782184075933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606820485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010374179,0.000029008226,0.9758708,0.0005531998,0.00086928904,0.0002907971,0.000014827226,0.000012864499,0.0119850235],"genre_scores_gemma":[0.60945606,0.000069455404,0.39004633,0.00016358918,0.0001342735,0.0000037369487,0.000009859048,0.000011821289,0.00010483624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635935,0.0005412711,0.0012987419,0.0003750179,0.0011771541,0.00024847148],"domain_scores_gemma":[0.9954025,0.00033554714,0.001942991,0.00070597156,0.0013964276,0.00021657416],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0043980437,0.00020613139,0.00047591983,0.0003760725,0.00028260617,0.00062084006,0.0011531875,0.00016441807,0.00015657724],"category_scores_gemma":[0.009664451,0.00016129199,0.00017678703,0.0009030703,0.00009071408,0.0020083303,0.00012007517,0.00021749403,0.000008353893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007406966,0.00025250978,0.018279554,0.0000020669993,0.0000127266485,0.000008222201,0.00011369669,0.97031915,7.639742e-7,0.00037456278,0.0004199814,0.0094760675],"study_design_scores_gemma":[0.001048094,0.00010368774,0.015251761,0.00004150837,0.000024122293,0.00002332329,0.00023921637,0.98208165,0.000021190344,0.0006305717,0.00037621154,0.00015866596],"about_ca_topic_score_codex":0.000025181744,"about_ca_topic_score_gemma":0.00001686087,"teacher_disagreement_score":0.59908193,"about_ca_system_score_codex":0.00020303058,"about_ca_system_score_gemma":0.00031927737,"threshold_uncertainty_score":0.99867755},"labels":[],"label_agreement":null},{"id":"W2608489707","doi":"10.1007/s10898-017-0527-8","title":"Incorporation of delivery times in stereotactic radiosurgery treatment optimization","year":2017,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Health Sciences Centre; Sunnybrook Health Science Centre; Princess Margaret Cancer Centre; University of Toronto","funders":"","keywords":"Radiosurgery; Duration (music); Mathematical optimization; Computer science; Radiation therapy; Mathematics; Medical physics; Medicine; Surgery; Physics","score_opus":0.011018531486713518,"score_gpt":0.281193778395709,"score_spread":0.2701752469089955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608489707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059723917,0.00012198679,0.9383341,0.00015231835,0.00017058577,0.00016048616,0.000013695656,0.000008439316,0.001314438],"genre_scores_gemma":[0.81931126,0.0001622724,0.18036848,0.0000073081733,0.00010972076,0.0000026271039,0.00000957417,0.000008843791,0.0000199311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991197,0.000050926672,0.0004942818,0.00009005273,0.00014892781,0.00009608436],"domain_scores_gemma":[0.9980131,0.000025398187,0.0015064885,0.00019221051,0.00022355528,0.000039275354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014756816,0.00011410844,0.0002707866,0.00008152822,0.00007288338,0.000054710392,0.00013761604,0.000043175223,0.000097642514],"category_scores_gemma":[0.000021009844,0.000100624915,0.00009583041,0.00009765426,0.00004037419,0.0009573005,0.000013892299,0.000052205523,2.1137474e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009959827,0.00013452492,0.17849815,0.000003544174,0.000054336975,0.0000034880798,0.00002664605,0.8134381,0.000060400147,0.00048759175,0.000038472754,0.0071551413],"study_design_scores_gemma":[0.004926712,0.0011452702,0.031718936,0.0004073298,0.00017719924,0.00003861455,0.000103048165,0.9537257,0.004732651,0.002257541,0.00029295284,0.00047401988],"about_ca_topic_score_codex":0.00007915842,"about_ca_topic_score_gemma":0.0000027024034,"teacher_disagreement_score":0.75958735,"about_ca_system_score_codex":0.00027135017,"about_ca_system_score_gemma":0.00011722827,"threshold_uncertainty_score":0.4103365},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03303527240385088,"score_gpt":0.32753132144494923,"score_spread":0.29449604904109833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761472785","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010639909,0.000086607826,0.99656236,0.0007123133,0.00029182353,0.00027556473,0.000013978122,0.000017192122,0.0009761573],"genre_scores_gemma":[0.36761507,0.000033607073,0.63227314,0.000024568344,0.000026249476,0.000003462722,0.0000017361137,0.0000075713,0.000014573196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985812,0.000098544304,0.00051187543,0.00021964558,0.00036155744,0.00022717948],"domain_scores_gemma":[0.99703676,0.00015950022,0.0009407116,0.00032801495,0.0014560819,0.00007895009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006174704,0.00014346356,0.00033486105,0.00017412966,0.00017499067,0.00013363472,0.0007648171,0.00006517163,0.000004546671],"category_scores_gemma":[0.00065444026,0.00013523294,0.00010253257,0.0003983856,0.00008178558,0.0012795259,0.00010667736,0.00009846432,5.1548324e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013086162,0.00010266864,0.0023769285,0.000015135856,0.000023951476,0.000008913058,0.00008626233,0.99010164,0.000028977283,0.0019385177,0.000018675495,0.0051674633],"study_design_scores_gemma":[0.0018388756,0.0002614592,0.002765779,0.00012707998,0.000012720347,0.000010315097,0.000077578254,0.99303395,0.0010908855,0.00064392143,0.00001203618,0.00012539784],"about_ca_topic_score_codex":0.000033978857,"about_ca_topic_score_gemma":0.00003936321,"teacher_disagreement_score":0.3665511,"about_ca_system_score_codex":0.00026207807,"about_ca_system_score_gemma":0.00027057622,"threshold_uncertainty_score":0.5514639},"labels":[],"label_agreement":null},{"id":"W2768645618","doi":"10.1007/s10898-017-0586-x","title":"Approximate efficiency and strategy-proofness for moneyless mechanisms on single-dipped policy domain","year":2017,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Zhejiang University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Domain (mathematical analysis); Mathematical economics; Mathematical optimization; Mathematical analysis","score_opus":0.07594721394231203,"score_gpt":0.3938576645638984,"score_spread":0.3179104506215864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768645618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038147524,0.000027165303,0.95627487,0.0025969471,0.00022226575,0.00024212048,0.000035769754,0.000010955668,0.00244236],"genre_scores_gemma":[0.96130836,0.0000129160135,0.038254116,0.00009954531,0.00018013972,0.0000070482824,0.0000017096547,0.0000073294477,0.00012885942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839425,0.000085606756,0.00059340755,0.00022020248,0.0005415948,0.00016491064],"domain_scores_gemma":[0.9973995,0.0001556893,0.0013757267,0.00037472806,0.0005645189,0.00012980142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016799582,0.00011940504,0.00023989938,0.00011516378,0.0007335251,0.00067531166,0.0006195195,0.00008299728,0.000021152957],"category_scores_gemma":[0.0014122737,0.000086918946,0.00009678355,0.00025608257,0.0001258639,0.00058501,0.00005993838,0.00007279121,0.000004864077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032596747,0.00022336852,0.00009220272,0.000005281735,0.000017195212,0.0000021905573,0.000073849784,0.36361465,0.00063298404,0.6075411,0.00027086455,0.02720034],"study_design_scores_gemma":[0.0014801065,0.000594487,0.00082263444,0.000041085594,0.00002861669,0.00008977262,0.0006388274,0.09989214,0.0010517413,0.8947346,0.000448492,0.00017745365],"about_ca_topic_score_codex":0.0000030116207,"about_ca_topic_score_gemma":0.0000019033465,"teacher_disagreement_score":0.9231608,"about_ca_system_score_codex":0.00009054543,"about_ca_system_score_gemma":0.00010542271,"threshold_uncertainty_score":0.6512046},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.016098218260028923,"score_gpt":0.26614184618651243,"score_spread":0.2500436279264835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769009861","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5973136,0.000118453165,0.40083715,0.00010422218,0.0007679267,0.00009156651,0.0000054509796,0.00009058712,0.000671016],"genre_scores_gemma":[0.93332994,0.00023921118,0.06616557,0.000007801186,0.00023868307,1.4580819e-7,0.0000029884347,0.000013357813,0.0000022855406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994107,0.000017617283,0.0002597087,0.00006928816,0.00015045577,0.000092248665],"domain_scores_gemma":[0.99934506,0.000003436445,0.0002920013,0.000119494754,0.0001933662,0.000046626847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007860185,0.00009424454,0.00015294741,0.0000510944,0.00020864977,0.00018086589,0.00009855422,0.00008224856,0.000013219402],"category_scores_gemma":[0.000037039394,0.000096971526,0.000042131447,0.00005474037,0.00004118984,0.00057715597,0.00002324049,0.000077290286,7.487803e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044342385,0.000014675595,0.00034751554,0.000010236309,0.000023665429,0.000005009017,0.000040672316,0.9912003,0.0046569314,0.00015683765,0.00053852826,0.0029612316],"study_design_scores_gemma":[0.0004037533,0.000057572484,0.002708338,0.00012784291,0.000053405893,0.0002769775,0.000033543045,0.9945163,0.0011689854,0.0002098989,0.00032125163,0.00012209346],"about_ca_topic_score_codex":0.000014874908,"about_ca_topic_score_gemma":0.0000014486563,"teacher_disagreement_score":0.33601636,"about_ca_system_score_codex":0.0001347101,"about_ca_system_score_gemma":0.000012850783,"threshold_uncertainty_score":0.3954384},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03579917435867024,"score_gpt":0.38492927748450695,"score_spread":0.3491301031258367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790720375","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054461784,0.000018899327,0.9876654,0.0006569939,0.00070695597,0.00021243829,0.000014126993,0.00004757312,0.0052314224],"genre_scores_gemma":[0.06279916,0.00004682302,0.9348181,0.00015215822,0.00047874372,0.0000059959975,0.0000053269923,0.000026238367,0.0016674779],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984508,0.00007933558,0.00059687864,0.00014063812,0.0004959549,0.00023637174],"domain_scores_gemma":[0.99703807,0.00011828545,0.00046800813,0.0002137243,0.0019486044,0.0002133366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002906558,0.0001278375,0.00022729745,0.0001633177,0.00023053812,0.00007936961,0.00023924636,0.00008253074,0.00064707483],"category_scores_gemma":[0.0019907968,0.00011540846,0.00009006615,0.001163321,0.00006666846,0.00046014463,0.00006482911,0.00015436347,0.000059534388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016420429,0.00041397908,0.0025063467,0.000015907119,0.00010539459,0.0000077710665,0.00025837356,0.93110913,0.0000842121,0.016625471,0.046053812,0.0026553718],"study_design_scores_gemma":[0.003308185,0.0021679646,0.0029517387,0.00033271033,0.00026397366,0.00050282816,0.00079641276,0.9166441,0.0009917457,0.056243636,0.01501164,0.00078505237],"about_ca_topic_score_codex":0.000004660271,"about_ca_topic_score_gemma":0.000017395645,"teacher_disagreement_score":0.057352986,"about_ca_system_score_codex":0.0004187118,"about_ca_system_score_gemma":0.00016003833,"threshold_uncertainty_score":0.7085016},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.018627814204502404,"score_gpt":0.3480092862410984,"score_spread":0.329381472036596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791867344","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002967236,0.000098927776,0.99260765,0.000798248,0.00021782746,0.00033645643,0.000062659565,0.000050349074,0.0028606462],"genre_scores_gemma":[0.119136006,0.00021404625,0.88026845,0.000055197484,0.00016279084,0.0000045035213,0.000022533399,0.000032783635,0.000103670594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714375,0.0001642229,0.0010919007,0.00024321415,0.001027738,0.00032919264],"domain_scores_gemma":[0.9937586,0.00012332846,0.0016862857,0.0003635288,0.0038621866,0.0002060488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050168036,0.00024162327,0.0004661293,0.00021841675,0.00016920258,0.00006760434,0.00039056744,0.00017025696,0.00021668898],"category_scores_gemma":[0.001517745,0.0002114071,0.00012743507,0.0024489707,0.00030454487,0.0008826137,0.00007697145,0.00015605486,0.0000049499554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034327895,0.00026732657,0.0015483476,0.00003421049,0.000110816945,0.000009529264,0.00006597035,0.99049747,0.000007293272,0.0054069506,0.0005417099,0.0011671033],"study_design_scores_gemma":[0.0022162728,0.00089134614,0.0007325193,0.0002076129,0.00014326151,0.00028633015,0.00018649775,0.9876943,0.000042560387,0.0072457767,0.00010167285,0.0002518072],"about_ca_topic_score_codex":0.000009431851,"about_ca_topic_score_gemma":0.000028570692,"teacher_disagreement_score":0.11616877,"about_ca_system_score_codex":0.0009742414,"about_ca_system_score_gemma":0.00070233183,"threshold_uncertainty_score":0.86209315},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0290985115856251,"score_gpt":0.31785168437011047,"score_spread":0.28875317278448537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792821451","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018915397,0.0000825817,0.9972866,0.0014817134,0.0005658559,0.00031772375,0.000008652609,0.000013607426,0.00005407835],"genre_scores_gemma":[0.04581221,0.000010460074,0.95379215,0.00012058824,0.00022722509,0.0000079568545,4.958748e-7,0.000008266016,0.000020667014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986214,0.00008314684,0.00043348366,0.00014626129,0.00048376186,0.00023196227],"domain_scores_gemma":[0.9979709,0.00020628014,0.0005539366,0.00032389455,0.00089235464,0.000052627474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069972826,0.00010434856,0.00015588425,0.000047984813,0.00021833937,0.0000990923,0.0009510341,0.00005281977,0.000003982409],"category_scores_gemma":[0.00021026294,0.00006123064,0.0001445935,0.00053762534,0.0001270411,0.00041457464,0.00021297704,0.00011214476,6.555917e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040844378,0.000043537846,0.000060408547,0.00001519068,0.00002943633,5.364577e-7,0.00008030775,0.8507505,0.00014057885,0.00005466896,0.00016603204,0.14861794],"study_design_scores_gemma":[0.000598244,0.00036576475,0.00044501293,0.000083171886,0.000016663962,0.000037471764,0.000014054108,0.9968691,0.00078563,0.00033568472,0.00038254762,0.00006665386],"about_ca_topic_score_codex":0.000010248173,"about_ca_topic_score_gemma":0.0000080177215,"teacher_disagreement_score":0.14855129,"about_ca_system_score_codex":0.00022968173,"about_ca_system_score_gemma":0.00020340832,"threshold_uncertainty_score":0.24969131},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.004747195214022939,"score_gpt":0.22935964236106712,"score_spread":0.22461244714704418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798508703","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038083998,0.00021728888,0.99531054,0.002948105,0.000508202,0.00012696045,0.0000048251636,0.000011131886,0.0004921282],"genre_scores_gemma":[0.015905155,0.00033433625,0.9827884,0.00041724465,0.00017048893,0.0000031238167,0.0000066757516,0.0000050406975,0.0003695683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918926,0.00003379675,0.00031392105,0.00010748496,0.00024317049,0.00011234815],"domain_scores_gemma":[0.99890316,0.0001083917,0.00035236543,0.00012430406,0.00045019423,0.00006156156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038803968,0.000074872165,0.0001361873,0.000039420887,0.0001353513,0.0002722264,0.00028739165,0.00004148394,0.000009783865],"category_scores_gemma":[0.000049976996,0.000049072096,0.0000790601,0.00033228938,0.00001407642,0.0005402968,0.000046588004,0.0000498259,0.0000032527155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005183656,0.000054595857,0.0012519764,0.0000060929465,0.000108297056,0.0000013882352,0.00005977291,0.8785232,0.0000057145453,0.060253885,0.0013184943,0.058364782],"study_design_scores_gemma":[0.00078319135,0.00013202301,0.00042297613,0.00000811257,0.00002473686,0.00006410588,0.00001941345,0.98959446,0.0000041168537,0.0010198485,0.007864469,0.00006253671],"about_ca_topic_score_codex":0.000004607781,"about_ca_topic_score_gemma":0.0000018636715,"teacher_disagreement_score":0.1110713,"about_ca_system_score_codex":0.000060900384,"about_ca_system_score_gemma":0.00008318665,"threshold_uncertainty_score":0.26250857},"labels":[],"label_agreement":null},{"id":"W2806450235","doi":"10.1007/s10898-019-00750-9","title":"On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems","year":2019,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Thales (Canada)","funders":"","keywords":"Minimum-cost flow problem; Flow network; Extension (predicate logic); Pareto principle; Flow (mathematics); Pareto optimal; Function (biology); Nash equilibrium","score_opus":0.008113083000218386,"score_gpt":0.23630392138608317,"score_spread":0.2281908383858648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806450235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028469717,0.000018493618,0.96984327,0.0006395391,0.00022689407,0.0006503021,0.000012160994,0.000024641893,0.00011495515],"genre_scores_gemma":[0.76374763,0.0000056309254,0.23595403,0.00018905711,0.00002336938,0.000018140772,0.000026631014,0.0000087972185,0.000026715887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980901,0.0000870465,0.00067483063,0.00030399903,0.0006442906,0.00019973677],"domain_scores_gemma":[0.9984277,0.00004773348,0.00056469324,0.00021500542,0.0006091765,0.0001356768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045903167,0.00016928717,0.00028310248,0.00025202538,0.00005639229,0.00017313396,0.00034189277,0.00007942542,0.0000149172165],"category_scores_gemma":[0.000033345128,0.00013994152,0.00006940699,0.0013760858,0.000008374767,0.00047208898,0.000014339414,0.000112082475,0.00003703768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102251455,0.00021113282,0.0055811782,0.000015273325,0.00002848169,0.0000039675065,0.00026092224,0.9901222,0.000037955542,0.0033505387,0.000038988863,0.00024711585],"study_design_scores_gemma":[0.0013860431,0.0002505406,0.0073721292,0.00014246601,0.00002154399,0.00001441921,0.000059471167,0.9905083,0.000011634308,0.000012109207,0.000058023346,0.00016332824],"about_ca_topic_score_codex":0.000027095284,"about_ca_topic_score_gemma":0.000027235381,"teacher_disagreement_score":0.7352779,"about_ca_system_score_codex":0.00039416927,"about_ca_system_score_gemma":0.00012344816,"threshold_uncertainty_score":0.57066494},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04571095833041305,"score_gpt":0.28495084844442164,"score_spread":0.2392398901140086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944554922","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072958076,0.00017084331,0.99645543,0.00032968965,0.0008442341,0.0009987913,0.000030804196,0.000114995346,0.0003256043],"genre_scores_gemma":[0.0892136,0.0000395397,0.9099233,0.00030128603,0.00015705609,0.00001794006,0.000031312065,0.00002801156,0.0002879517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972521,0.00013887329,0.00092261855,0.0005984903,0.0006948336,0.00039305212],"domain_scores_gemma":[0.9952457,0.00021212082,0.001305302,0.0003475057,0.0025845414,0.00030482243],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032543295,0.00036554315,0.00047857128,0.00030440398,0.0001951618,0.0002006369,0.000706983,0.00023345146,0.00009270479],"category_scores_gemma":[0.00063176226,0.0003488804,0.00021451814,0.001336199,0.0000647502,0.002040876,0.000091712725,0.00023505848,0.000006043527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018773027,0.00023854269,0.00093910785,0.000021281385,0.00006293065,0.0000010413331,0.0000825839,0.9936068,0.000030872907,0.0036738128,0.00044640774,0.0007088959],"study_design_scores_gemma":[0.0033834053,0.00060501,0.0010097327,0.00009066122,0.00006293608,0.000051651925,0.000058080357,0.99084854,0.00006846532,0.003430931,0.00002874481,0.00036185054],"about_ca_topic_score_codex":0.000017774566,"about_ca_topic_score_gemma":0.000008690998,"teacher_disagreement_score":0.08848402,"about_ca_system_score_codex":0.001238397,"about_ca_system_score_gemma":0.0024931147,"threshold_uncertainty_score":0.99989635},"labels":[],"label_agreement":null},{"id":"W2949272583","doi":"10.1007/s10898-021-01031-0","title":"Low-rank matrix recovery with Ky Fan 2-k-norm","year":2021,"lang":"en","type":"preprint","venue":"Journal of Global Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Alan Turing Institute","keywords":"Mathematics; Rank (graph theory); Norm (philosophy); Regular polygon; Matrix (chemical analysis); Matrix norm; Low-rank approximation; Mathematical optimization; Matrix completion; Combinatorics; Applied mathematics; Algorithm; Pure mathematics; Geometry; Physics; Materials science; Eigenvalues and eigenvectors","score_opus":0.006562845079908549,"score_gpt":0.22858388847026265,"score_spread":0.2220210433903541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949272583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05559941,0.0016948724,0.9381021,0.00009319448,0.0012138119,0.00013875733,0.000020195128,0.00019307274,0.002944536],"genre_scores_gemma":[0.72284895,0.0026610931,0.27383408,0.00006351199,0.0004506753,0.0000025406898,0.00005816996,0.000055121025,0.000025872743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988079,0.00003723458,0.00049505674,0.00015259316,0.00033553742,0.00017168114],"domain_scores_gemma":[0.99874276,0.000016161099,0.00038400557,0.0002674357,0.0005051017,0.00008453916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011307459,0.00025374867,0.00043903128,0.000090314534,0.000030944808,0.00021207669,0.0002338813,0.00027141164,0.0000486364],"category_scores_gemma":[0.000029219573,0.00022788938,0.00017883704,0.00021152943,0.000020090236,0.0002374901,0.0000987024,0.00046806003,0.0000013560349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056126246,0.000029191186,0.000139685,0.00005670224,0.00019238885,0.00013918601,0.00002205536,0.99522096,0.00010774104,0.000018985333,0.0024524902,0.0015645127],"study_design_scores_gemma":[0.0014044467,0.0005469409,0.001110875,0.006729578,0.0007385669,0.0017213888,0.00018750451,0.9722498,0.011696015,0.0011708838,0.0010699398,0.0013740581],"about_ca_topic_score_codex":0.000014973665,"about_ca_topic_score_gemma":0.000012273066,"teacher_disagreement_score":0.6672495,"about_ca_system_score_codex":0.0003854006,"about_ca_system_score_gemma":0.0001612159,"threshold_uncertainty_score":0.9293059},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.009939009430692343,"score_gpt":0.2805451406456261,"score_spread":0.2706061312149337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963548325","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023862908,0.00020011685,0.99416196,0.00014380571,0.0010545179,0.0006465455,0.000053085212,0.000091322116,0.0012623377],"genre_scores_gemma":[0.13857938,0.00014467858,0.8608066,0.000065565,0.00013426671,0.000012855577,0.00020165651,0.000031492,0.00002349829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802816,0.00006645663,0.0010939501,0.00019147136,0.00037861257,0.00024132594],"domain_scores_gemma":[0.99757946,0.00003247975,0.00067523815,0.00016620615,0.0014218547,0.00012476127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042134002,0.00025493582,0.0004928288,0.000108388784,0.000047234676,0.000092639544,0.00019504761,0.0002275799,0.00007458505],"category_scores_gemma":[0.000118118194,0.00023612514,0.00025487246,0.0005813458,0.00002592287,0.0008108895,0.000021154521,0.00013812492,0.0000047302465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016848063,0.00015320299,0.0008793836,0.00013807643,0.00010343844,8.795908e-7,0.000049122482,0.99222666,0.00017586436,0.00058164616,0.0003605372,0.005162681],"study_design_scores_gemma":[0.0017961091,0.00045246584,0.00012677275,0.00021536178,0.00010283646,0.00006624361,0.00009369346,0.9953457,0.0011623151,0.000100760444,0.00031815734,0.00021958757],"about_ca_topic_score_codex":0.000010737167,"about_ca_topic_score_gemma":0.000012297366,"teacher_disagreement_score":0.1361931,"about_ca_system_score_codex":0.0005385334,"about_ca_system_score_gemma":0.00013777049,"threshold_uncertainty_score":0.9628904},"labels":[],"label_agreement":null},{"id":"W2971445446","doi":"10.1007/s10898-020-00908-w","title":"Using symbolic calculations to determine largest small polygons","year":2020,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Polygon (computer graphics); Combinatorics; Degree (music); Polynomial; Integer (computer science); Diagonal; Conjecture; Unit (ring theory); Symmetry (geometry); Degree of a polynomial; Convex polygon; Axial symmetry; Geometry; Regular polygon; Mathematical analysis","score_opus":0.16071173012698114,"score_gpt":0.36362059734093904,"score_spread":0.2029088672139579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971445446","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08926929,0.00002249185,0.90722096,0.0022601862,0.000054413435,0.00018633739,0.000023775518,0.000021650922,0.00094088406],"genre_scores_gemma":[0.32861423,0.000005546938,0.67078966,0.00037823457,0.00017849097,0.0000020828927,0.0000021127398,0.000013606472,0.000016031545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902767,0.0000275644,0.0005256107,0.000092941424,0.00019383058,0.00013237116],"domain_scores_gemma":[0.99891865,0.00005852872,0.00038107875,0.00012649146,0.0002859004,0.00022937632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001394976,0.00010441905,0.00022870081,0.00003946524,0.000087895016,0.000053214608,0.00016728569,0.00005152852,0.00006378555],"category_scores_gemma":[0.00046652835,0.00009403983,0.00009808981,0.00046811384,0.000011494327,0.00009254004,0.000042445743,0.00007652963,0.0000075519306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038290927,0.00037056726,0.0014848444,0.00010519033,0.00011074098,0.000015952,0.0007267833,0.9324896,0.0018083986,0.05379771,0.008608141,0.00044381764],"study_design_scores_gemma":[0.00071911205,0.00016529535,0.00036751738,0.00013622388,0.0002930368,0.00018860662,0.00014504435,0.9913277,0.00046222296,0.003846481,0.0020653966,0.00028335187],"about_ca_topic_score_codex":0.0000053139506,"about_ca_topic_score_gemma":0.000006486157,"teacher_disagreement_score":0.23934494,"about_ca_system_score_codex":0.000087978726,"about_ca_system_score_gemma":0.000080796315,"threshold_uncertainty_score":0.38348332},"labels":[],"label_agreement":null},{"id":"W2980493098","doi":"10.1007/s10898-020-00962-4","title":"The conditional p-dispersion problem","year":2020,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Cardinality (data modeling); Combinatorics; Mathematics; Leverage (statistics); Scalability; Set (abstract data type); Discrete mathematics; Algorithm; Binary logarithm; Computer science; Data mining; Statistics","score_opus":0.01610913550507839,"score_gpt":0.2198873222414269,"score_spread":0.2037781867363485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980493098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016419834,0.00047444738,0.75055766,0.18288332,0.001688472,0.0005519968,0.0000125612505,0.00010505268,0.047306664],"genre_scores_gemma":[0.98852813,0.000113070346,0.0035612187,0.006674075,0.0010184648,0.0000020840318,0.000029130366,0.0000066295543,0.000067206456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920624,0.000008725885,0.0003200794,0.00006994214,0.00030315493,0.00009182904],"domain_scores_gemma":[0.9993787,0.0000062950303,0.00018111899,0.000050893184,0.0003665808,0.000016440941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000222547,0.000065554086,0.00007676232,0.000019912815,0.00017460178,0.00015682913,0.00017385636,0.000021567666,0.00025767833],"category_scores_gemma":[0.00012689274,0.00004538911,0.000068949936,0.00035335106,0.00002600389,0.00072980614,0.000047526788,0.00005601073,0.00007312386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074677395,0.000029892748,0.0017423158,0.000026116235,0.00002527668,0.0000019998151,0.000010773144,0.8892298,0.0000061653236,0.045533627,0.06160392,0.0017154404],"study_design_scores_gemma":[0.0006788535,0.000037364265,0.004274229,0.000017479617,0.00005974855,0.0000035847763,0.0002911584,0.67918813,0.000002532999,0.0022985393,0.3130297,0.00011869071],"about_ca_topic_score_codex":0.000016709622,"about_ca_topic_score_gemma":0.0000103275415,"teacher_disagreement_score":0.9721083,"about_ca_system_score_codex":0.000045962293,"about_ca_system_score_gemma":0.000022347296,"threshold_uncertainty_score":0.28213972},"labels":[],"label_agreement":null},{"id":"W2980693811","doi":"10.1007/s10898-020-00973-1","title":"Learning chordal extensions","year":2021,"lang":"en","type":"preprint","venue":"Journal of Global Optimization","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Chordal graph; Extension (predicate logic); Graph; Imitation; Exploit; Block (permutation group theory); Mathematical optimization; Optimization problem; Theoretical computer science; Mathematics; Algorithm; Combinatorics","score_opus":0.008315659150930637,"score_gpt":0.26428914247964763,"score_spread":0.255973483328717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980693811","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006399255,0.00079555897,0.9875501,0.001609956,0.0024133336,0.000050727696,0.0000012683346,0.00006128582,0.0011185372],"genre_scores_gemma":[0.23095529,0.0004174948,0.76772666,0.00017032905,0.00055548374,9.950184e-7,0.000014198653,0.000011399544,0.00014817018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982092,0.00026818356,0.0005447339,0.0002699842,0.0005215167,0.00018643207],"domain_scores_gemma":[0.9977351,0.0000407558,0.00096868566,0.0002972459,0.0008175356,0.00014070667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049499964,0.0001868291,0.00036776526,0.000082528015,0.00012664638,0.00055464084,0.0007404701,0.00018780517,0.000035179757],"category_scores_gemma":[0.00047189047,0.00017016537,0.0002524958,0.00037445777,0.000018221312,0.0003597934,0.00074689306,0.0011001442,0.0000033204637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039254596,0.0000452363,0.0008147179,0.000014033948,0.000040936364,0.00010988267,0.000104264844,0.9830193,0.000004241201,0.00037650674,0.00032905804,0.01513788],"study_design_scores_gemma":[0.00024470635,0.00012040704,0.001570577,0.00025132668,0.000033760614,0.0004004757,0.000046239562,0.9962159,0.000006153674,0.0003234579,0.00061357033,0.00017342527],"about_ca_topic_score_codex":0.000020313371,"about_ca_topic_score_gemma":0.0000012571714,"teacher_disagreement_score":0.22455603,"about_ca_system_score_codex":0.00017464833,"about_ca_system_score_gemma":0.00047451336,"threshold_uncertainty_score":0.69391423},"labels":[],"label_agreement":null},{"id":"W3015993571","doi":"10.1007/s10898-022-01127-1","title":"Numerical certification of Pareto optimality for biobjective nonlinear problems","year":2022,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Parameterized complexity; Set (abstract data type); Pareto principle; Mathematical optimization; Class (philosophy); Mathematics; Polygon (computer graphics); Regular polygon; Computer science; Algorithm","score_opus":0.019277783038109963,"score_gpt":0.2869851079830246,"score_spread":0.26770732494491467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015993571","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037706623,0.00011607129,0.99765587,0.0006068814,0.0005097133,0.00045499578,0.000061788,0.00003390756,0.00018369373],"genre_scores_gemma":[0.15760945,0.000020787496,0.8421575,0.00007917713,0.00005918761,0.000031048996,0.000018909006,0.000010986819,0.000012967843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998044,0.00017399158,0.0007814679,0.00026591492,0.0005430991,0.00019149353],"domain_scores_gemma":[0.99676925,0.00009204579,0.0013628157,0.00025972648,0.0014228789,0.00009328268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059498387,0.00014302638,0.00030662387,0.00011524765,0.00020188688,0.00004712951,0.0006075345,0.000048143007,0.000022390497],"category_scores_gemma":[0.0003156515,0.00014220162,0.00016261925,0.0011501563,0.000045079058,0.0007998661,0.0001335202,0.00014719633,5.898177e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010483109,0.00030396314,0.00034504308,0.000013044636,0.00003725907,0.0000017187446,0.00020101316,0.99428797,0.00006720517,0.0018617082,0.00013115566,0.0026451044],"study_design_scores_gemma":[0.0009888713,0.000627854,0.0005275108,0.000011761232,0.000021843081,0.00007878952,0.00012432244,0.99574816,0.00044207778,0.00087897194,0.00040939145,0.00014041559],"about_ca_topic_score_codex":0.0000092680175,"about_ca_topic_score_gemma":5.7602466e-7,"teacher_disagreement_score":0.15723237,"about_ca_system_score_codex":0.00062365155,"about_ca_system_score_gemma":0.00028466512,"threshold_uncertainty_score":0.57988137},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008913140916029237,"score_gpt":0.25727068776575346,"score_spread":0.24835754684972422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033072407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00217987,0.00050171645,0.9950491,0.0015615924,0.00030315237,0.00004323424,2.6367334e-7,0.000012148998,0.00034890304],"genre_scores_gemma":[0.8189388,0.00016563557,0.180678,0.00011947821,0.00009412353,2.2381273e-7,7.2093576e-7,0.0000026146345,4.2127706e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908566,0.000094340234,0.00041517726,0.00009886918,0.00021766766,0.000088251894],"domain_scores_gemma":[0.9990797,0.000033081673,0.00058745075,0.00008850495,0.00015920559,0.000052054602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002061863,0.00006245042,0.00015545309,0.000032618926,0.00002120097,0.000027215181,0.00039580456,0.000041998574,0.000004461172],"category_scores_gemma":[0.0002838814,0.000058497997,0.00004381062,0.0006771223,0.000017979946,0.0011540048,0.000056400495,0.0001469021,3.3072226e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004199199,0.00001362561,0.006269638,0.000004622392,0.0000023372356,0.000005711693,0.000079034486,0.9738975,0.0000061619494,0.0028849423,0.000021394746,0.01677304],"study_design_scores_gemma":[0.00035533606,0.000113489004,0.0026153815,0.000020529773,0.000004370511,0.000011185919,0.00002077995,0.9966025,0.000007676261,0.00011802093,0.00008313691,0.000047594403],"about_ca_topic_score_codex":0.0000023792238,"about_ca_topic_score_gemma":8.686982e-7,"teacher_disagreement_score":0.81675893,"about_ca_system_score_codex":0.00006567222,"about_ca_system_score_gemma":0.00003947336,"threshold_uncertainty_score":0.2385479},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.06904678787804504,"score_gpt":0.3482783259159813,"score_spread":0.27923153803793627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036119246","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013566902,0.0003786451,0.97830385,0.0010437947,0.000577945,0.00024839552,0.000058609094,0.000059833797,0.0057620006],"genre_scores_gemma":[0.28496972,0.0019486899,0.7109031,0.0010543766,0.0009321125,0.000003248306,0.00008517035,0.000029877121,0.00007373943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99419445,0.00079546025,0.0020698088,0.0005247842,0.0020894278,0.00032606022],"domain_scores_gemma":[0.99366254,0.00010463294,0.0028652865,0.00047070463,0.0021823482,0.0007144625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024519574,0.00030547119,0.0007022616,0.00018789027,0.00028149335,0.0006269694,0.0010104364,0.00024595385,0.0007918344],"category_scores_gemma":[0.0027223933,0.00023918087,0.00032616768,0.0026205417,0.00008957788,0.0023963347,0.00010013771,0.0003097692,0.000023292516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032744644,0.00016855399,0.02484667,0.0000021101894,0.000045316327,0.000016179309,0.00017528232,0.9598369,0.000002417893,0.0008416669,0.00976618,0.0039713057],"study_design_scores_gemma":[0.0014364125,0.00039740177,0.0018946955,0.000006458023,0.00012662067,0.00011694467,0.00025930488,0.99092686,0.000015769645,0.0008594614,0.00369396,0.00026608628],"about_ca_topic_score_codex":0.000023376937,"about_ca_topic_score_gemma":0.0000026884063,"teacher_disagreement_score":0.2714028,"about_ca_system_score_codex":0.00013706414,"about_ca_system_score_gemma":0.0003711388,"threshold_uncertainty_score":0.9753513},"labels":[],"label_agreement":null},{"id":"W3047692571","doi":"10.1007/s10898-022-01151-1","title":"An adaptive high order method for finding third-order critical points of nonconvex optimization","year":2022,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Chen; Saddle point; Degenerate energy levels; Order (exchange); Saddle; Applied mathematics; Mathematical optimization","score_opus":0.01743535683543204,"score_gpt":0.3069647303921053,"score_spread":0.2895293735566733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047692571","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014731308,0.00011246171,0.99708235,0.0001854432,0.00051428674,0.0001630055,0.00004159251,0.00008124633,0.00034650444],"genre_scores_gemma":[0.29470748,0.000022926835,0.70507264,0.00007442916,0.000080370795,0.0000054116936,0.000014037666,0.000020168103,0.0000025230452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880475,0.00012761283,0.00048225702,0.00011829357,0.00030142334,0.00016564825],"domain_scores_gemma":[0.9986126,0.00011591203,0.00023668802,0.00013096843,0.0008362961,0.00006755829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039363946,0.00013430654,0.00028489638,0.00011295236,0.00011245043,0.000032445965,0.00018548971,0.00007620025,0.000099568],"category_scores_gemma":[0.00018554082,0.00014003363,0.00008220507,0.00045542914,0.000023961094,0.00035605681,0.000035969984,0.0001617331,1.8290844e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013521286,0.00007169728,0.000036593457,0.000010395888,0.000056019144,0.000005012357,0.00006283683,0.99505067,0.00036246402,0.0024560913,0.0009320359,0.0008209857],"study_design_scores_gemma":[0.00050675665,0.0006060504,0.000041293024,0.00003981578,0.00008579774,0.000065438864,0.00018153437,0.9952391,0.0016944497,0.0012988163,0.00010271305,0.00013824806],"about_ca_topic_score_codex":0.0000118531825,"about_ca_topic_score_gemma":0.0000010808737,"teacher_disagreement_score":0.29323435,"about_ca_system_score_codex":0.00022103713,"about_ca_system_score_gemma":0.000073825395,"threshold_uncertainty_score":0.5710406},"labels":[],"label_agreement":null},{"id":"W3092123050","doi":"10.1007/s10898-022-01181-9","title":"Tight bounds on the maximal perimeter and the maximal width of convex small polygons","year":2022,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Perimeter; Combinatorics; Regular polygon; Polygon (computer graphics); Convex polygon; Conjecture; Star-shaped polygon; Rectilinear polygon; Polygon covering; Convex set; Convex optimization; Geometry; Simple polygon","score_opus":0.03574903865755232,"score_gpt":0.2709224115293784,"score_spread":0.23517337287182608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092123050","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78444636,0.0028188287,0.16670519,0.021224383,0.001115251,0.00073272956,0.00020108852,0.000033202457,0.02272295],"genre_scores_gemma":[0.9888027,0.000090277164,0.010151087,0.0005499995,0.00009477512,0.000005325856,0.0000020453779,0.00001054156,0.00029330072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986493,0.00020624795,0.0004912814,0.00007878599,0.0004327972,0.0001415925],"domain_scores_gemma":[0.998479,0.00047339752,0.00064929697,0.00014025431,0.00022095292,0.00003710057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012148021,0.0001091959,0.00027059877,0.00007215426,0.0002466637,0.00006920088,0.00024981113,0.000033137905,0.0003304556],"category_scores_gemma":[0.0006030353,0.00005845943,0.00012247066,0.00042052256,0.0001389321,0.00010202685,0.000108551096,0.00020052739,5.472215e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026244223,0.0004534466,0.0011920353,0.00013495843,0.00040273645,0.000021249105,0.0021905566,0.033472393,0.000022982635,0.951582,0.006489221,0.0014140046],"study_design_scores_gemma":[0.020239644,0.0077366913,0.0040373164,0.00038238105,0.0017479701,0.0035398803,0.019063732,0.1611282,0.0010915948,0.75895745,0.020767445,0.0013076804],"about_ca_topic_score_codex":0.000016912758,"about_ca_topic_score_gemma":0.0000018428316,"teacher_disagreement_score":0.20435627,"about_ca_system_score_codex":0.00008530454,"about_ca_system_score_gemma":0.00010262633,"threshold_uncertainty_score":0.3618257},"labels":[],"label_agreement":null},{"id":"W3123799354","doi":"10.1007/s10898-022-01245-w","title":"TREGO: a trust-region framework for efficient global optimization","year":2022,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Global optimization; Python (programming language); Computer science; Benchmark (surveying); Mathematical optimization; Id, ego and super-ego; Trust region; Convergence (economics); Optimization problem; Dimension (graph theory); Algorithm; Mathematics; Geography; Psychology; Economics; Social psychology","score_opus":0.0386669940503243,"score_gpt":0.36914418414564043,"score_spread":0.3304771900953161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123799354","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079739746,0.00022807292,0.9951761,0.0013314605,0.0008889049,0.00085918483,0.00012238548,0.00007870054,0.00051779],"genre_scores_gemma":[0.021439614,0.000075430136,0.97772396,0.00019673622,0.00029037448,0.00006750564,0.000040352148,0.000048593647,0.00011743609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658436,0.0002844959,0.0010908425,0.00032699073,0.0012487494,0.00046453765],"domain_scores_gemma":[0.99651945,0.0003372044,0.001348298,0.00033354806,0.0012295186,0.00023200027],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082117674,0.00028008688,0.0004922328,0.00015665416,0.00053584966,0.00011764992,0.00053631025,0.00015422038,0.00035297265],"category_scores_gemma":[0.0023415096,0.00028002792,0.00031227194,0.0016613833,0.00007209245,0.00033709223,0.00018373106,0.0003483708,0.0000016801858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005807691,0.00045600627,0.0002548673,0.00003475728,0.00007553209,0.000021167738,0.000082097366,0.9497946,6.8015527e-7,0.04490935,0.0021369501,0.0016532376],"study_design_scores_gemma":[0.0020966805,0.00057956233,0.000026441125,0.000050206778,0.0001079817,0.00037977373,0.00044299653,0.9622341,0.000007683726,0.03311134,0.00070537784,0.00025788092],"about_ca_topic_score_codex":0.000002784204,"about_ca_topic_score_gemma":8.794087e-7,"teacher_disagreement_score":0.020642217,"about_ca_system_score_codex":0.002164479,"about_ca_system_score_gemma":0.0003996512,"threshold_uncertainty_score":0.9999652},"labels":[],"label_agreement":null},{"id":"W3124539807","doi":"10.1007/s10898-020-00988-8","title":"A dual approach to multi-dimensional assignment problems","year":2021,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"General Dynamics (Canada); McMaster University","funders":"","keywords":"Lagrangian relaxation; Duality gap; Mathematics; Mathematical optimization; Dual (grammatical number); Relaxation (psychology); Constraint (computer-aided design); Augmented Lagrangian method; Duality (order theory); Strong duality; Representation (politics); Lagrangian; Binary number; Algorithm; Applied mathematics; Optimization problem; Discrete mathematics","score_opus":0.08871062890158506,"score_gpt":0.3664096391047545,"score_spread":0.27769901020316945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124539807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007895748,0.00008223038,0.9865847,0.0019694017,0.00031538834,0.000116450436,0.000015350754,0.000009436053,0.0030112653],"genre_scores_gemma":[0.5459802,0.000007080448,0.45196238,0.0006666921,0.00018542292,0.000007353064,0.000007421241,0.0000064298006,0.0011769955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768645,0.00019306083,0.0007423132,0.00021950869,0.0010319208,0.00012674669],"domain_scores_gemma":[0.9977603,0.00010386188,0.00048199514,0.00021350352,0.001248827,0.0001915028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013619504,0.00008972237,0.00019982374,0.00006899506,0.00014128131,0.00015818118,0.00022649282,0.000057637662,0.0002670478],"category_scores_gemma":[0.00095899863,0.000067126435,0.000118894124,0.0011093506,0.000031897325,0.00031690087,0.000081129845,0.00009441307,0.0000709715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025078158,0.00033253082,0.0003135271,9.288213e-7,0.000017006252,0.0000044393482,0.00009279336,0.9848641,0.00020111441,0.0068503562,0.0057150642,0.0015830324],"study_design_scores_gemma":[0.004310682,0.0005328878,0.011945761,0.00011285964,0.00016117535,0.0034148535,0.0046892376,0.8796133,0.001954115,0.0433442,0.04913676,0.00078420783],"about_ca_topic_score_codex":8.96652e-7,"about_ca_topic_score_gemma":0.000001064984,"teacher_disagreement_score":0.53808445,"about_ca_system_score_codex":0.00013759435,"about_ca_system_score_gemma":0.00020659104,"threshold_uncertainty_score":0.29239863},"labels":[],"label_agreement":null},{"id":"W3154160203","doi":"10.1007/s10898-021-01007-0","title":"Global exact optimization for covering a rectangle with 6 circles","year":2021,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Rectangle; Mathematics; RADIUS; Nonlinear programming; Global optimization; Focus (optics); Function (biology); Combinatorics; Mathematical optimization; Nonlinear system; Geometry; Computer science","score_opus":0.005279676976581772,"score_gpt":0.23646753768158368,"score_spread":0.2311878607050019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154160203","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037088012,0.00048012362,0.9944712,0.00010579323,0.00011472209,0.00009394634,0.000023230801,0.00011763527,0.00088456104],"genre_scores_gemma":[0.27315608,0.00029613066,0.72635895,0.000049284463,0.00009099142,0.0000047348794,0.000020303078,0.000017928258,0.000005599931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908924,0.000022240889,0.00037861758,0.000117869036,0.00022546241,0.00016656572],"domain_scores_gemma":[0.9990772,0.000027558564,0.00019931507,0.00011167138,0.0005008789,0.00008336873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008878642,0.00013573433,0.0002724075,0.00003234891,0.000047150195,0.000060886432,0.00010205969,0.00007127544,0.00003431956],"category_scores_gemma":[0.00012045418,0.0001249854,0.00011160538,0.0007484633,0.000017822022,0.00045901653,0.000015203577,0.00006073073,3.980429e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060847466,0.00003309649,0.0007895354,0.000023323166,0.000094248244,0.000016304537,0.000005944245,0.9947127,0.000078097575,0.00013744862,0.0003422862,0.003706181],"study_design_scores_gemma":[0.00059537066,0.00017362543,0.00025251668,0.00009526169,0.00012411049,0.00019969288,0.000041994066,0.9964871,0.0008445998,0.0004350576,0.0005675144,0.0001831976],"about_ca_topic_score_codex":0.0000019445818,"about_ca_topic_score_gemma":0.000007925725,"teacher_disagreement_score":0.26944727,"about_ca_system_score_codex":0.0005320463,"about_ca_system_score_gemma":0.000062298874,"threshold_uncertainty_score":0.5096756},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011906402326560034,"score_gpt":0.2696545108687438,"score_spread":0.2577481085421838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162664130","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040625755,0.00068128353,0.9961787,0.00079241965,0.0008536095,0.000694045,0.000028873314,0.000092885704,0.00027194445],"genre_scores_gemma":[0.030510372,0.00044431927,0.96839327,0.0002945165,0.00015580512,0.000031713815,0.00008656644,0.00003998321,0.00004344206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687374,0.00021093158,0.0012092931,0.000679165,0.00061732164,0.00040954092],"domain_scores_gemma":[0.9911081,0.00037711154,0.0018140331,0.00030026285,0.0061993585,0.00020111006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006120827,0.00039728492,0.00059359113,0.000211551,0.00043790607,0.000511449,0.00042567574,0.00018754818,0.000023730066],"category_scores_gemma":[0.0015913706,0.00041236347,0.00018252854,0.0012901303,0.00009408558,0.0032166494,0.00021614786,0.00023983004,0.0000011548733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007527634,0.00013474023,0.00024642103,0.000042632008,0.00008225209,0.00002701714,0.00060900813,0.9894968,0.000062195875,0.005604344,0.00006436047,0.003554913],"study_design_scores_gemma":[0.0026388478,0.0002849164,0.00021965454,0.00027231287,0.000059092832,0.00048848655,0.00045392555,0.99379903,0.0004110954,0.0009502833,0.00003051228,0.0003918647],"about_ca_topic_score_codex":0.0000056190484,"about_ca_topic_score_gemma":0.0000076506185,"teacher_disagreement_score":0.030104114,"about_ca_system_score_codex":0.0006736686,"about_ca_system_score_gemma":0.00057317154,"threshold_uncertainty_score":0.9998328},"labels":[],"label_agreement":null},{"id":"W3164052965","doi":"10.1007/s10898-021-01034-x","title":"Learning discontinuous piecewise affine fitting functions using mixed integer programming over lattice","year":2021,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Affine transformation; Piecewise; Algorithm; Piecewise linear function; Mathematical optimization; Applied mathematics; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.01204275087267372,"score_gpt":0.282496674970011,"score_spread":0.2704539240973373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164052965","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012200484,0.00035412397,0.98578775,0.00030043357,0.00074289413,0.000044956963,5.751679e-7,0.000047157326,0.0005216225],"genre_scores_gemma":[0.26925337,0.000023011271,0.7303953,0.00007846237,0.00011957559,4.1710558e-7,0.0000019495665,0.000008144691,0.0001197367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868333,0.00013815647,0.00046027114,0.00018897458,0.00030859423,0.00022066553],"domain_scores_gemma":[0.99858606,0.000065051696,0.0005131915,0.00014663138,0.0005861467,0.00010290946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003466007,0.00012041261,0.0001989455,0.000064551015,0.0002104987,0.00035350563,0.00019256219,0.000041743348,0.000034137593],"category_scores_gemma":[0.0008994257,0.000110859626,0.00011532574,0.0008143992,0.000020145051,0.001559111,0.00012782478,0.00024929794,0.0000023342993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008257774,0.000058704376,0.0033688373,0.000006614431,0.000024776586,0.00006445688,0.00010087239,0.91611105,0.00031199984,0.00091009296,0.000050646402,0.078983694],"study_design_scores_gemma":[0.0005657833,0.00006805739,0.00058201124,0.00017282482,0.000035164678,0.0005116813,0.0004518147,0.99393666,0.00014130792,0.00012658579,0.0032683788,0.00013975122],"about_ca_topic_score_codex":0.00000346662,"about_ca_topic_score_gemma":0.00000234091,"teacher_disagreement_score":0.2570529,"about_ca_system_score_codex":0.00019091522,"about_ca_system_score_gemma":0.00017713859,"threshold_uncertainty_score":0.45207244},"labels":[],"label_agreement":null},{"id":"W3204625658","doi":"10.1007/s10898-021-01092-1","title":"A modified simplex partition algorithm to test copositivity","year":2021,"lang":"lv","type":"article","venue":"Journal of Global Optimization","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Algorithm; Artificial intelligence; Computer science","score_opus":0.013537403692048278,"score_gpt":0.2680999470426928,"score_spread":0.25456254335064454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204625658","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027936664,0.00039862568,0.9901621,0.0036474038,0.0015865186,0.00015533771,0.00012536772,0.000028757539,0.0011022568],"genre_scores_gemma":[0.3753713,0.0002237146,0.6218659,0.0012170897,0.0010343437,0.0000026772234,0.000020182437,0.000017414188,0.00024735113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731636,0.00039470373,0.000862331,0.00034779607,0.0006932275,0.0003856088],"domain_scores_gemma":[0.9968371,0.00019080144,0.00069714925,0.00034919052,0.0015096345,0.00041612796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008791566,0.00024823466,0.0004451269,0.000080483755,0.00021986249,0.0005778643,0.0004808308,0.00015772707,0.00014738707],"category_scores_gemma":[0.00061715953,0.00025182625,0.00023541831,0.0014878521,0.000037667385,0.0011031175,0.00023060729,0.00023886019,0.000044004548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005271334,0.0007924617,0.00009424725,0.00002616145,0.00006771241,0.00052057346,0.00016096962,0.9120289,0.00010726262,0.008859729,0.0017113738,0.07557791],"study_design_scores_gemma":[0.0009886392,0.0007332702,0.00047389837,0.00021510321,0.000100798825,0.0009841764,0.00006308103,0.98972267,0.001065362,0.0038628264,0.0014897288,0.00030042382],"about_ca_topic_score_codex":0.000010883227,"about_ca_topic_score_gemma":0.00000623282,"teacher_disagreement_score":0.37257764,"about_ca_system_score_codex":0.00039956832,"about_ca_system_score_gemma":0.0006257453,"threshold_uncertainty_score":0.9999934},"labels":[],"label_agreement":null},{"id":"W4220871667","doi":"10.1007/s10898-022-01150-2","title":"Correction to: Numerical certification of Pareto optimality for biobjective nonlinear problems","year":2022,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Mathematical Biology Tumor Growth","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Pareto principle; Mathematical optimization; Mathematical economics; Pareto optimal; Nonlinear system; Multi-objective optimization; Applied mathematics","score_opus":0.038230699864779984,"score_gpt":0.3274886206640622,"score_spread":0.2892579207992822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220871667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02933902,0.000021928563,0.96779484,0.00062754826,0.00080978597,0.0006434602,0.00008941779,0.000022906079,0.0006511189],"genre_scores_gemma":[0.6180614,0.0000029945966,0.38166282,0.00006331344,0.000087227556,0.000046491157,0.000018023864,0.000014340801,0.000043348864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983358,0.0001751543,0.0008400279,0.00015202425,0.00034513965,0.0001519037],"domain_scores_gemma":[0.99776936,0.00035238787,0.0009864392,0.0001526336,0.00065400876,0.00008519742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094917306,0.000116251125,0.00036041037,0.000073406314,0.00011351087,0.000013556504,0.0002036022,0.00004738359,0.00009625898],"category_scores_gemma":[0.0022490525,0.00010298186,0.00015562485,0.0005204312,0.00003270182,0.00011083474,0.0000643251,0.00014458103,0.0000011299121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013803559,0.001791899,0.002723227,0.0002302064,0.00019402585,0.00000311952,0.00079095346,0.94896394,0.0008572116,0.020636685,0.02130665,0.0011217277],"study_design_scores_gemma":[0.0018023782,0.0040870663,0.0014422127,0.00014053668,0.00032339408,0.0003500929,0.00110214,0.93326354,0.0024953492,0.053788014,0.00081582257,0.00038942497],"about_ca_topic_score_codex":0.000007591808,"about_ca_topic_score_gemma":0.0000018960448,"teacher_disagreement_score":0.5887224,"about_ca_system_score_codex":0.00042834302,"about_ca_system_score_gemma":0.00012107244,"threshold_uncertainty_score":0.41994783},"labels":[],"label_agreement":null},{"id":"W4225134652","doi":"10.1007/s10898-022-01162-y","title":"Parallel algorithm portfolios with adaptive resource allocation strategy","year":2022,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"European Social Fund","keywords":"Resource allocation; Mathematical optimization; Process (computing); Algorithm; Computer science; Swarm intelligence; Mathematics; Particle swarm optimization","score_opus":0.01724348718280352,"score_gpt":0.2643682714715833,"score_spread":0.2471247842887798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225134652","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007587449,0.00019909494,0.99571323,0.0010238938,0.000175316,0.00023422862,0.000013182821,0.000042931268,0.0025222441],"genre_scores_gemma":[0.027362645,0.000048455255,0.9719697,0.00023112992,0.00009865308,0.000015233014,0.000016681119,0.000014890481,0.00024261668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685913,0.00040458448,0.00061861635,0.00027990714,0.0015511009,0.00028666964],"domain_scores_gemma":[0.99769074,0.000058610152,0.00081329996,0.00034197842,0.00089225185,0.0002031196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009717269,0.00016818657,0.00026490836,0.00019826807,0.00029958534,0.00020458506,0.0009930955,0.000045017925,0.00018220232],"category_scores_gemma":[0.000078629324,0.00014817358,0.00007919079,0.0017067271,0.00004978902,0.00084031385,0.00024552678,0.0003238212,0.0000041843605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009117118,0.00014541468,0.00006784234,0.0000022650986,0.00005563867,0.00010207441,0.00005751152,0.96921957,0.0000012738353,0.006464346,0.001883985,0.021908931],"study_design_scores_gemma":[0.0010673573,0.0011162737,0.00027643883,0.000009944044,0.00002285955,0.0007960215,0.0002297593,0.9943706,0.0000066960547,0.0003902649,0.0015500938,0.00016371452],"about_ca_topic_score_codex":0.000013499278,"about_ca_topic_score_gemma":0.000001017875,"teacher_disagreement_score":0.02728677,"about_ca_system_score_codex":0.00050750875,"about_ca_system_score_gemma":0.0006900015,"threshold_uncertainty_score":0.60423434},"labels":[],"label_agreement":null},{"id":"W4281980926","doi":"10.1007/s10898-022-01179-3","title":"Discretization and global optimization for mixed integer bilinear programming","year":2022,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Discretization; Mathematics; Bilinear interpolation; Discretization of continuous features; Integer programming; Mathematical optimization; Global optimization; Integer (computer science); Linear programming; Applied mathematics; Computer science; Mathematical analysis; Discretization error","score_opus":0.02840875571746555,"score_gpt":0.3570433572984689,"score_spread":0.3286346015810034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281980926","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012044472,0.00021329924,0.9960971,0.0008943318,0.00043423587,0.0008388964,0.00011283895,0.000059009475,0.00014587889],"genre_scores_gemma":[0.025640298,0.00010973191,0.97372407,0.00007617248,0.00016901852,0.00006216697,0.000108411135,0.00003927421,0.00007086474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748856,0.00023231484,0.00089361676,0.00027513245,0.00078807044,0.000322286],"domain_scores_gemma":[0.9973906,0.0001842914,0.00092063344,0.00018551188,0.0011470624,0.00017186714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096478406,0.0002183301,0.00037087203,0.00012644702,0.00041894498,0.00014526137,0.0002685563,0.000091995804,0.00016548595],"category_scores_gemma":[0.0017363417,0.00021104932,0.00013529403,0.0011119182,0.00008127122,0.00064094213,0.00018421486,0.00020624542,4.0511077e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003012539,0.00020380595,0.00063761155,0.000051841787,0.0000583839,0.000005144028,0.00007083854,0.9831442,0.000002493504,0.0082869055,0.0007993093,0.0064382176],"study_design_scores_gemma":[0.0018824636,0.0005250164,0.000032400716,0.00003310426,0.000092240174,0.00019434719,0.0006088501,0.9890271,0.000011292756,0.0060802787,0.0013011482,0.00021176814],"about_ca_topic_score_codex":0.0000036042074,"about_ca_topic_score_gemma":0.0000040236055,"teacher_disagreement_score":0.02443585,"about_ca_system_score_codex":0.0008979564,"about_ca_system_score_gemma":0.00023888778,"threshold_uncertainty_score":0.8606342},"labels":[],"label_agreement":null},{"id":"W4282936435","doi":"10.1007/s10898-022-01183-7","title":"A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis","year":2022,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Mathematics; Hypergraph; Combinatorics; Maximum cut; Vertex (graph theory); Disjoint sets; Semidefinite programming; Discrete mathematics; Mathematical optimization; Graph","score_opus":0.007454803762989175,"score_gpt":0.21333503972465478,"score_spread":0.2058802359616656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4282936435","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018966869,0.00018775623,0.9793101,0.0009097468,0.00009492492,0.00009857612,0.0000089039295,0.000029441306,0.00039367483],"genre_scores_gemma":[0.40315744,0.00005620999,0.5965714,0.00015968166,0.000026194395,0.000005644384,0.0000099814615,0.0000039033457,0.00000957527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878436,0.00010467933,0.0003113916,0.00017077371,0.00049415574,0.00013461421],"domain_scores_gemma":[0.999057,0.000023146495,0.00043898524,0.0001665881,0.0002409839,0.0000732807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035407176,0.000099268414,0.00021165921,0.00024869226,0.00023899287,0.00015361114,0.00036358007,0.000023388477,0.000016590038],"category_scores_gemma":[0.0000126711875,0.00008416277,0.000089470384,0.0032034456,0.000036946916,0.000579061,0.00014139696,0.00013941912,1.6741832e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005617525,0.000112455404,0.015137792,0.000007733992,0.0002355881,0.000018536937,0.00013586633,0.96674263,0.00000460664,0.011094877,0.00011623813,0.0063374895],"study_design_scores_gemma":[0.00065991416,0.0004493099,0.00786359,0.000011059477,0.00017062464,0.00035416285,0.000067747584,0.98296833,0.000006486243,0.0070565757,0.00026044826,0.00013174656],"about_ca_topic_score_codex":0.000009048821,"about_ca_topic_score_gemma":0.000005314353,"teacher_disagreement_score":0.38419056,"about_ca_system_score_codex":0.0001053429,"about_ca_system_score_gemma":0.00007129562,"threshold_uncertainty_score":0.3432058},"labels":[],"label_agreement":null},{"id":"W4303045027","doi":"10.1007/s10898-022-01241-0","title":"Weak and strong convergence of generalized proximal point algorithms with relaxed parameters","year":2022,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Monotone polygon; Algorithm; Equivalence (formal languages); Strongly monotone; Monotonic function; Convergence (economics); Sequence (biology); Regularization (linguistics); Operator (biology); Applied mathematics; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.010195142235017409,"score_gpt":0.22969302159073107,"score_spread":0.21949787935571366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4303045027","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011504388,0.0000972934,0.9866899,0.0013075699,0.00013911203,0.00008717614,0.000009362139,0.000010964883,0.00015422743],"genre_scores_gemma":[0.3574272,0.000046736506,0.64237255,0.00009933882,0.000013673457,0.0000027720068,0.00000495315,0.000003614899,0.000029134228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986583,0.00013509743,0.0004343999,0.00014561706,0.0005210402,0.00010552555],"domain_scores_gemma":[0.9986903,0.000027024236,0.0006996417,0.00012202557,0.00038250798,0.000078471065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036136422,0.00009037044,0.00021036301,0.000093678704,0.00011807725,0.000055899054,0.0002832432,0.00002211455,0.0000683363],"category_scores_gemma":[0.000038253893,0.00007491819,0.0000656382,0.00074585684,0.000032920194,0.0005574968,0.000110919034,0.000088521105,2.2242638e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006713108,0.0000670511,0.0038222622,0.0000036674562,0.00007442901,0.0000046111973,0.00007738589,0.97689444,0.000014836364,0.01847033,0.00011577117,0.0003880697],"study_design_scores_gemma":[0.0009568467,0.0003992025,0.0016189531,0.00000846477,0.000050661856,0.00013363842,0.00010493227,0.9962085,0.00003794923,0.00033451815,0.000056492503,0.00008984641],"about_ca_topic_score_codex":0.000020771611,"about_ca_topic_score_gemma":0.0000015026765,"teacher_disagreement_score":0.34592283,"about_ca_system_score_codex":0.00013094241,"about_ca_system_score_gemma":0.00017314195,"threshold_uncertainty_score":0.3055075},"labels":[],"label_agreement":null},{"id":"W4307820629","doi":"10.1007/s10898-022-01247-8","title":"Projections onto hyperbolas or bilinear constraint sets in Hilbert spaces","year":2022,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Hyperbola; Bilinear interpolation; Hilbert space; Constraint (computer-aided design); Space (punctuation); Pure mathematics; Mathematical analysis; Geometry; Computer science","score_opus":0.012174143496306362,"score_gpt":0.27517118676509045,"score_spread":0.2629970432687841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307820629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03728315,0.0002506703,0.9488248,0.009552257,0.0015166639,0.000207169,0.000010772486,0.0000654187,0.0022890684],"genre_scores_gemma":[0.52373916,0.00004927098,0.47535217,0.00044450356,0.00014000964,0.0000061705277,0.0000035909354,0.00000790182,0.00025722088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889517,0.00017195969,0.0003269469,0.0001311823,0.00033766023,0.00013707402],"domain_scores_gemma":[0.9993983,0.000040484665,0.00027466784,0.00011517612,0.00011093974,0.0000604576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047244263,0.00008029166,0.00014774696,0.00008638644,0.00014874933,0.000107994936,0.0003363354,0.00002476175,0.000088522625],"category_scores_gemma":[0.00014374038,0.00006422199,0.000056496843,0.0008044977,0.000019359006,0.00033229945,0.00011475837,0.00024748963,0.0000016035544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003855655,0.00012241963,0.003429593,0.0000028887566,0.000010400401,0.000050794402,0.00019423464,0.9879819,0.000004716318,0.001157126,0.0006291468,0.0063782344],"study_design_scores_gemma":[0.0006447728,0.00053463667,0.0010110219,0.000016112464,0.000006593909,0.0010146444,0.00023158905,0.9910348,0.0000048202874,0.00015852116,0.0052492153,0.00009327066],"about_ca_topic_score_codex":0.00009940136,"about_ca_topic_score_gemma":0.000037841703,"teacher_disagreement_score":0.486456,"about_ca_system_score_codex":0.00028087408,"about_ca_system_score_gemma":0.00034696018,"threshold_uncertainty_score":0.26188967},"labels":[],"label_agreement":null},{"id":"W4362736486","doi":"10.1007/s10898-023-01281-0","title":"General convex relaxations of implicit functions and inverse functions","year":2023,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; McMaster University","keywords":"Mathematics; Relaxation (psychology); Monotonic function; Convex function; Convex analysis; Implicit function theorem; Applied mathematics; Uniqueness; Subderivative; Proper convex function; Mathematical optimization; Regular polygon; Convex optimization; Mathematical analysis","score_opus":0.03839066513758016,"score_gpt":0.347258696766238,"score_spread":0.30886803162865784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362736486","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028236287,0.000050943403,0.9681309,0.00086588576,0.00036600514,0.00021757068,0.00008635476,0.000066828405,0.00197926],"genre_scores_gemma":[0.1025173,0.00094325095,0.88924944,0.00012910375,0.00047150144,0.000024607316,0.000117483614,0.00007793936,0.006469364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984884,0.000090420246,0.00067144545,0.00013382919,0.0004253291,0.00019055684],"domain_scores_gemma":[0.9978258,0.00019546728,0.00061555504,0.00017556261,0.0010423829,0.00014521506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041057897,0.00012017939,0.0002747291,0.00025961376,0.00016144659,0.00003402915,0.00011586993,0.00009901106,0.00016844507],"category_scores_gemma":[0.0012387915,0.00011271381,0.0000977102,0.00148799,0.00010120814,0.00045431277,0.000067453744,0.00016382657,0.000014636033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049136393,0.00008643154,0.0022289567,0.000029534001,0.000091386486,0.000005920744,0.00008087882,0.9736815,0.00012008628,0.00757886,0.015080133,0.00096714334],"study_design_scores_gemma":[0.001866629,0.0003307748,0.0033287727,0.000063123,0.0001775419,0.00019642271,0.0011034824,0.97804654,0.000056107874,0.013410588,0.0012036441,0.00021636335],"about_ca_topic_score_codex":0.000007925046,"about_ca_topic_score_gemma":0.000011475176,"teacher_disagreement_score":0.07888141,"about_ca_system_score_codex":0.00016506501,"about_ca_system_score_gemma":0.00014929404,"threshold_uncertainty_score":0.45963356},"labels":[],"label_agreement":null},{"id":"W4387121580","doi":"10.1007/s10898-023-01329-1","title":"Small polygons with large area","year":2023,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Polygon (computer graphics); Combinatorics; Upper and lower bounds; Regular polygon; Unit (ring theory); Rectilinear polygon; Term (time); Geometry; Simple polygon; Mathematical analysis; Computer science","score_opus":0.018819072385228588,"score_gpt":0.23867149863511988,"score_spread":0.2198524262498913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387121580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018190317,0.00005585726,0.9791628,0.0014399609,0.00033170742,0.000046092602,0.0000037382842,0.000050884206,0.0007186259],"genre_scores_gemma":[0.6687601,0.00004979907,0.33051723,0.0003307852,0.00016772142,0.0000013263738,0.000015116635,0.0000050522494,0.0001528516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923694,0.000035083456,0.00021916252,0.00009857222,0.00027344332,0.0001367747],"domain_scores_gemma":[0.99923456,0.00003087268,0.00021104868,0.00010197207,0.00034591818,0.00007565377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002830761,0.000068697555,0.00009832712,0.00011137045,0.000083885025,0.000106130756,0.00024061876,0.000030978517,0.000010331544],"category_scores_gemma":[0.000051341536,0.000054368506,0.000044478158,0.0014441934,0.000007889034,0.0004476507,0.000048430436,0.00005569098,0.00001156485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001544872,0.000035045377,0.0010039872,0.0000022382344,0.000016807939,0.000025411939,0.000039665745,0.9829437,0.00001606323,0.011722238,0.0017364532,0.0024429166],"study_design_scores_gemma":[0.0006268796,0.00022549291,0.006896271,0.000024273415,0.000012525458,0.00020537566,0.000024208743,0.9889992,0.00006575241,0.0010671766,0.0017588597,0.00009400921],"about_ca_topic_score_codex":0.000001232163,"about_ca_topic_score_gemma":0.0000055755886,"teacher_disagreement_score":0.6505698,"about_ca_system_score_codex":0.000064721906,"about_ca_system_score_gemma":0.00015512922,"threshold_uncertainty_score":0.22170833},"labels":[],"label_agreement":null},{"id":"W4389833084","doi":"10.1007/s10898-023-01348-y","title":"A Bregman inertial forward-reflected-backward method for nonconvex minimization","year":2023,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bregman divergence; Inertial frame of reference; Mathematics; Convergence (economics); Function (biology); Minification; Applied mathematics; Sequence (biology); Property (philosophy); Work (physics); Mathematical optimization; Rate of convergence; Divergence (linguistics); Computer science; Key (lock)","score_opus":0.014961971923397004,"score_gpt":0.2998619709775416,"score_spread":0.2848999990541446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389833084","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050367084,0.000081810445,0.99277467,0.00024085944,0.0006258821,0.00016748748,0.0000134731345,0.0003668128,0.0006922877],"genre_scores_gemma":[0.28917715,0.00021600453,0.70981836,0.00013192798,0.00052573706,0.000008782852,0.00004639731,0.000045441677,0.000030218489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990885,0.000036266603,0.00040783698,0.00009284618,0.00019177406,0.00018274212],"domain_scores_gemma":[0.99920857,0.000053740077,0.00017466658,0.00010394326,0.00039126733,0.000067832014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001948252,0.00012914208,0.00023166076,0.00013082761,0.000048947786,0.000052071646,0.00013310212,0.00011264886,0.00001092782],"category_scores_gemma":[0.000116038274,0.00012315977,0.00012900333,0.0005927594,0.000011419566,0.0002303658,0.00001806001,0.0000794031,0.000003696602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055516375,0.000011351096,0.00007546729,0.000013702696,0.000059688642,0.000005544229,0.00004053474,0.9606068,0.0014282718,0.00013899668,0.032051604,0.0055125193],"study_design_scores_gemma":[0.0005840295,0.00013939355,0.00022233397,0.00006298782,0.000067510584,0.000050291914,0.00002397761,0.99025345,0.0045763566,0.0006243331,0.0032628966,0.00013241108],"about_ca_topic_score_codex":0.0000037403763,"about_ca_topic_score_gemma":0.000004140866,"teacher_disagreement_score":0.28414044,"about_ca_system_score_codex":0.00013919694,"about_ca_system_score_gemma":0.00004202603,"threshold_uncertainty_score":0.502231},"labels":[],"label_agreement":null},{"id":"W4391227173","doi":"10.1007/s10898-023-01363-z","title":"A strong P-formulation for global optimization of industrial water-using and treatment networks","year":2024,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Process Optimization and Integration","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Mathematical optimization; Global optimization","score_opus":0.024327849253640906,"score_gpt":0.2680743699953053,"score_spread":0.24374652074166442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391227173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009779867,0.0007731728,0.9880565,0.000057270165,0.0007447713,0.00025527124,0.000034330817,0.00005644675,0.00024240007],"genre_scores_gemma":[0.9155958,0.00051026966,0.08344764,0.000007871437,0.00031204,0.000004553605,0.0000970665,0.000018952142,0.000005781783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897385,0.000022357259,0.0005851324,0.00010733937,0.00015798547,0.00015331393],"domain_scores_gemma":[0.99942183,0.000020043888,0.00014091033,0.00005784845,0.00029188214,0.00006749579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001614808,0.0001594312,0.00023483468,0.00008105567,0.00005141156,0.00012517876,0.00005617019,0.00016383757,0.000018690454],"category_scores_gemma":[0.000034280394,0.00012334387,0.000090133435,0.00030453698,0.000014766623,0.00077150034,0.000008964751,0.00006150705,1.5090583e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008971782,0.00002321499,0.0002840767,0.000030171692,0.00009171652,9.185846e-7,0.000050437855,0.99028,0.000038357954,0.0012781891,0.00007291662,0.007760311],"study_design_scores_gemma":[0.00091471063,0.00025905404,0.000014971462,0.00014489096,0.00014378723,0.000035591194,0.000040950992,0.99781096,0.00031068033,0.00008826772,0.00012639357,0.00010973748],"about_ca_topic_score_codex":0.000006452841,"about_ca_topic_score_gemma":0.0000041273966,"teacher_disagreement_score":0.90581596,"about_ca_system_score_codex":0.0006072633,"about_ca_system_score_gemma":0.000077581695,"threshold_uncertainty_score":0.5029817},"labels":[],"label_agreement":null},{"id":"W4401134013","doi":"10.1007/s10898-024-01422-z","title":"Robust bilevel optimization for near-optimal lower-level solutions","year":2024,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Bilevel optimization; Mathematical optimization; Mathematics; Robustness (evolution); Robust optimization; Heuristic; Optimization problem; Constraint (computer-aided design); Regular polygon; Upper and lower bounds; Convex optimization; Duality (order theory)","score_opus":0.15662085209633478,"score_gpt":0.3719881802762845,"score_spread":0.21536732817994972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401134013","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011065007,0.0012015065,0.9897679,0.0022481643,0.0038663556,0.0003887726,0.00025338505,0.00007602698,0.0010913581],"genre_scores_gemma":[0.08928784,0.00095311855,0.90781915,0.00024366363,0.00082427193,0.0000142383815,0.000076174736,0.00004561247,0.000735903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99563086,0.00017294608,0.0018109968,0.0004689476,0.0014737768,0.00044248026],"domain_scores_gemma":[0.9953871,0.00051372446,0.0009021395,0.00036282922,0.0025748,0.00025942287],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002968053,0.00028750673,0.00048232562,0.00038225087,0.00044308807,0.0015563767,0.00064254325,0.00025712058,0.0005061839],"category_scores_gemma":[0.0023308622,0.0002258,0.0004949467,0.0024213635,0.00012708873,0.0022174136,0.000084413594,0.00021071399,0.000045372584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017612397,0.00009974003,0.00025725266,0.000007713542,0.00006290577,0.000015218832,0.00007776266,0.9412065,0.00000468754,0.002866331,0.035050366,0.020175373],"study_design_scores_gemma":[0.00070358877,0.0003546543,0.00026488162,0.00007890534,0.00013504383,0.00019210522,0.00010603922,0.9788789,0.000009101132,0.0017896651,0.017244989,0.00024208892],"about_ca_topic_score_codex":0.00001026076,"about_ca_topic_score_gemma":0.000007653452,"teacher_disagreement_score":0.08818134,"about_ca_system_score_codex":0.00036657316,"about_ca_system_score_gemma":0.00088757067,"threshold_uncertainty_score":0.9994801},"labels":[],"label_agreement":null},{"id":"W4408156600","doi":"10.1007/s10898-025-01472-x","title":"Stochastic red-blue set covering: a decomposition approach","year":2025,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Decomposition; Set (abstract data type); Mathematical optimization; Computer science; Ecology","score_opus":0.008097414824323117,"score_gpt":0.25256140725978055,"score_spread":0.24446399243545744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408156600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020303812,0.00023434794,0.9878797,0.0001291072,0.0006648738,0.000102672995,0.0000086018335,0.000079463025,0.008870854],"genre_scores_gemma":[0.885892,0.00009627445,0.11372294,0.00010606706,0.00007929295,0.0000026539735,0.00003114901,0.00001447892,0.00005516906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992108,0.000028660568,0.00039388696,0.000078067846,0.00016054534,0.00012804037],"domain_scores_gemma":[0.99951386,0.00001775374,0.00012832343,0.000092109105,0.00018810286,0.00005982299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015182383,0.00011629405,0.00018004981,0.00010666079,0.000051588482,0.00008035679,0.000119111675,0.00008955989,0.000026231612],"category_scores_gemma":[0.00003929134,0.00011680662,0.00007122094,0.00050292,0.000014626212,0.00025598082,0.000015121324,0.00012030279,0.0000023177042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029730407,0.000027802227,0.0001422217,0.000039355935,0.000057589732,0.0000014943049,0.000044299384,0.9951451,0.000030866853,0.00078780204,0.0032965809,0.00039720174],"study_design_scores_gemma":[0.00060835516,0.000038107355,0.00019294504,0.00010467178,0.00005007435,0.000054844608,0.000035694753,0.998089,0.000037670783,0.00015517748,0.00053176464,0.000101701684],"about_ca_topic_score_codex":0.0000012106487,"about_ca_topic_score_gemma":5.6635247e-7,"teacher_disagreement_score":0.8838616,"about_ca_system_score_codex":0.00025076495,"about_ca_system_score_gemma":0.000050403873,"threshold_uncertainty_score":0.47632357},"labels":[],"label_agreement":null},{"id":"W4409120969","doi":"10.1007/s10898-025-01483-8","title":"Support vector machines with the hard-margin loss: optimal training via combinatorial Benders’ cuts","year":2025,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Margin (machine learning); Mathematical optimization; Benders' decomposition; Training (meteorology); Combinatorial optimization; Support vector machine; Combinatorics; Applied mathematics; Algorithm; Artificial intelligence; Machine learning; Computer science","score_opus":0.010075420650805862,"score_gpt":0.24275097177985316,"score_spread":0.2326755511290473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409120969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010234867,0.00007879245,0.98000896,0.006462123,0.0014634449,0.00012102052,0.000004570175,0.00003190605,0.0015943184],"genre_scores_gemma":[0.9081845,0.000040115174,0.090604894,0.0008119299,0.00021662583,0.0000042229726,0.0000074953023,0.000007285275,0.00012288168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988806,0.00008960075,0.00031415524,0.00015020272,0.00038515334,0.00018028938],"domain_scores_gemma":[0.9990332,0.00005046065,0.0003220123,0.00014961508,0.00037549302,0.00006922759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034193246,0.0001288082,0.0001901693,0.00006792882,0.00017218135,0.00021045159,0.0004946897,0.00006724247,0.000041757852],"category_scores_gemma":[0.00005059659,0.00008087355,0.00008278514,0.0005093289,0.00003645028,0.0008129815,0.00006994367,0.00016474415,0.0000050226827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005007407,0.00024900842,0.001565533,0.00003214816,0.00023102651,0.00010887166,0.001104092,0.9303621,0.00029790305,0.016672054,0.030327165,0.018549366],"study_design_scores_gemma":[0.0050517954,0.0010706187,0.0037769754,0.00034122905,0.0001660136,0.0005088518,0.00047894707,0.97885567,0.0008244054,0.0023878773,0.006116787,0.00042085839],"about_ca_topic_score_codex":0.0000042280176,"about_ca_topic_score_gemma":0.0000019708098,"teacher_disagreement_score":0.8979497,"about_ca_system_score_codex":0.000097275304,"about_ca_system_score_gemma":0.00026706365,"threshold_uncertainty_score":0.32979277},"labels":[],"label_agreement":null},{"id":"W4410734459","doi":"10.1007/s10898-025-01503-7","title":"A linear-time algorithm to compute the conjugate of nonconvex bivariate piecewise linear-quadratic functions","year":2025,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bivariate analysis; Piecewise linear function; Quadratic equation; Applied mathematics; Conjugate gradient method; Piecewise; Piecewise linear manifold; Linear programming; Mathematical optimization; Algorithm; Mathematical analysis; Statistics","score_opus":0.019510155178864126,"score_gpt":0.3542534389129457,"score_spread":0.3347432837340816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410734459","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005188322,0.00011821133,0.9941042,0.0029237936,0.0005040475,0.0005525182,0.000062053405,0.000039471775,0.0011768935],"genre_scores_gemma":[0.0026764025,0.00010640638,0.9951027,0.0004131747,0.00021720037,0.000010160293,0.00001305225,0.000027309876,0.001433581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973402,0.00025483358,0.0012317046,0.0002062433,0.00067355885,0.00029343474],"domain_scores_gemma":[0.99595016,0.0004992132,0.0007996471,0.00038730394,0.0021927871,0.00017089242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009157725,0.00022577557,0.00054440566,0.00023654019,0.00019770958,0.00006619245,0.00048671468,0.00012600515,0.00015537927],"category_scores_gemma":[0.0014208292,0.00016866579,0.00019682516,0.0019646427,0.000116040785,0.00033570142,0.00017102456,0.00030695152,0.000030877985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001307194,0.0002347434,0.000054010445,0.00004002108,0.00020467574,0.000008754676,0.00009759604,0.9866779,0.000049088423,0.0021661501,0.0034756486,0.006860718],"study_design_scores_gemma":[0.0013415095,0.0002757105,0.00007755457,0.00019265985,0.00015619207,0.00003448656,0.00010439815,0.9922769,0.00015632094,0.00395821,0.0012818297,0.00014424349],"about_ca_topic_score_codex":0.000010221685,"about_ca_topic_score_gemma":0.0000038768962,"teacher_disagreement_score":0.0067164744,"about_ca_system_score_codex":0.00029008975,"about_ca_system_score_gemma":0.00049025164,"threshold_uncertainty_score":0.68779916},"labels":[],"label_agreement":null},{"id":"W4415163885","doi":"10.1007/s10898-025-01547-9","title":"Global optimization algorithm for mixed-integer nonlinear programs with trigonometric functions","year":2025,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Tellabs (Canada)","funders":"","keywords":"Trigonometric functions; Relaxation (psychology); Nonlinear system; Differentiable function; Nonlinear programming; Variable (mathematics); Domain (mathematical analysis); Function (biology); Sequence (biology)","score_opus":0.02355425099976231,"score_gpt":0.3442385037937763,"score_spread":0.32068425279401397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415163885","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000100791505,0.00023727167,0.99550813,0.0005601997,0.00067513797,0.0011564594,0.00014009293,0.000105438696,0.0015164522],"genre_scores_gemma":[0.0010446473,0.000121349,0.9975897,0.000079514204,0.00022777842,0.00006180701,0.00012764179,0.000036775935,0.0007107522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972007,0.00012682134,0.0011186582,0.00036295733,0.0007238561,0.00046699203],"domain_scores_gemma":[0.99488163,0.0002467484,0.0009159763,0.00032366128,0.0034160197,0.00021594667],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006680904,0.0003351358,0.0005856046,0.0004403881,0.00027133824,0.00022823349,0.00039262383,0.00022509925,0.000070788854],"category_scores_gemma":[0.0011607631,0.00027823995,0.00025312242,0.0048888642,0.000117776945,0.0008023254,0.0000730017,0.00021841533,0.0000026910188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031172976,0.00058798457,0.00071059307,0.000053805074,0.00024814904,0.000006429822,0.000009018254,0.93860173,1.4943794e-7,0.0019425022,0.00231968,0.05520823],"study_design_scores_gemma":[0.0036033283,0.00072787836,0.00005607226,0.00016389074,0.0002768006,0.000100390615,0.00021004614,0.9907065,0.0000085554675,0.0019691295,0.0019193968,0.00025803217],"about_ca_topic_score_codex":0.0000056027206,"about_ca_topic_score_gemma":0.000012577354,"teacher_disagreement_score":0.054950196,"about_ca_system_score_codex":0.0012423228,"about_ca_system_score_gemma":0.000697659,"threshold_uncertainty_score":0.999967},"labels":[],"label_agreement":null},{"id":"W4417520195","doi":"10.1007/s10898-025-01579-1","title":"A kinematic smoothing method for tightening convex relaxations of ordinary differential equations","year":2025,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; McMaster University","keywords":"Ode; Ordinary differential equation; Regular polygon; Smoothing; Kinematics; Parametric statistics; Relaxation (psychology); Numerical analysis","score_opus":0.03904311108766726,"score_gpt":0.4234424510741223,"score_spread":0.38439933998645504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417520195","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023958574,0.000120724326,0.99726963,0.0007502685,0.00030362923,0.000493572,0.000026456899,0.000025833808,0.00077028124],"genre_scores_gemma":[0.017983839,0.000032319113,0.9815075,0.00003755599,0.00006546383,0.00001886013,0.000015613847,0.00001740328,0.00032144855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979092,0.00018718098,0.0011395855,0.00014281571,0.00042912897,0.00019207678],"domain_scores_gemma":[0.99532396,0.0014586092,0.0011903933,0.0001939229,0.001760375,0.00007274378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070612336,0.0001462628,0.00046615113,0.00028422903,0.00016503475,0.000049904207,0.00024918604,0.00011626999,0.00010241043],"category_scores_gemma":[0.005924536,0.00013216792,0.00020261719,0.0009040091,0.000049636135,0.00040125253,0.00006358551,0.00016776769,5.316163e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011768562,0.00019798089,0.00006296832,0.00021027478,0.00017753484,0.0000015553175,0.00013515881,0.89669484,0.00018779666,0.09848144,0.00077509216,0.002957704],"study_design_scores_gemma":[0.001466015,0.00012940406,0.00004309366,0.00027430826,0.0002238988,0.000014316072,0.0001848327,0.9496252,0.00019411831,0.047657233,0.00008830374,0.000099308876],"about_ca_topic_score_codex":0.0000035574005,"about_ca_topic_score_gemma":0.0000022714848,"teacher_disagreement_score":0.05293036,"about_ca_system_score_codex":0.0002692475,"about_ca_system_score_gemma":0.0002760101,"threshold_uncertainty_score":0.70926505},"labels":[],"label_agreement":null}]}