{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015501205,0.0004023616,0.97515714,0.00032098818,0.00013797777,0.000051086892,0.000045161098,0.0001044232,0.00827976],"genre_scores_gemma":[0.45059785,0.00079776446,0.53369683,0.00021691639,0.00020930452,0.00027179156,0.00018366046,0.0004360638,0.013589698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997069,0.00012166772,0.00001002515,0.000049052458,0.00009099065,0.000021290467],"domain_scores_gemma":[0.9989905,0.0006790853,0.00007044095,0.00008568384,0.00012836247,0.000045989742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010369637,0.00078570633,0.0010196116,0.0012793605,0.00051735155,0.0012891042,0.0010900685,0.002061101,0.0030655349],"category_scores_gemma":[0.0048288186,0.00067268003,0.0009932895,0.001127898,0.0013848579,0.0014138073,0.0016630872,0.0014256462,0.0003678381],"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.000033570654,0.000028277063,0.0002835723,0.00006958741,0.000028420322,0.00003949679,0.00007473782,0.83056813,0.0010891923,0.13532363,0.0013704908,0.031090867],"study_design_scores_gemma":[0.0000058848796,0.000007555333,0.00003259572,0.00000424312,0.0000029389662,0.0000073563237,0.0000061290248,0.97952443,0.00010522801,0.01965964,0.0006398802,0.000004143291],"about_ca_topic_score_codex":0.005050537,"about_ca_topic_score_gemma":0.0032513335,"teacher_disagreement_score":0.005050537,"about_ca_system_score_codex":0.0011673538,"about_ca_system_score_gemma":0.001007764,"threshold_uncertainty_score":0.010255218},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010559322,0.0025895867,0.9032842,0.004797777,0.005884675,0.00026113619,0.00049840286,0.00052530825,0.07159963],"genre_scores_gemma":[0.21277921,0.005847272,0.6560984,0.0041721687,0.006039214,0.0007400298,0.0013410462,0.001966715,0.11101598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998511,0.00038760874,0.000091069036,0.00023125295,0.0006240984,0.00015495265],"domain_scores_gemma":[0.99869627,0.00072706037,0.000039144503,0.00026044034,0.00020055682,0.000076437995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015806389,0.0015120562,0.0018429997,0.0013540257,0.0015516263,0.0024472566,0.001766654,0.0011255575,0.013029023],"category_scores_gemma":[0.0051690154,0.00074829644,0.004153793,0.0016727399,0.002423437,0.004810515,0.005899329,0.008546064,0.0033499985],"study_design_candidate":"not_applicable","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.0001646865,0.00024119642,0.00018504374,0.00035492005,0.0000737917,0.00030663586,0.00040735758,0.014558586,0.003383025,0.84724545,0.026863268,0.10621604],"study_design_scores_gemma":[0.00003053335,0.000069608235,0.00015623707,0.000044815464,0.000038497266,0.00019110974,0.00007885518,0.02650952,0.0020866643,0.93043673,0.040323272,0.00003421377],"about_ca_topic_score_codex":0.0021789942,"about_ca_topic_score_gemma":0.0021189908,"teacher_disagreement_score":0.013029023,"about_ca_system_score_codex":0.0008312074,"about_ca_system_score_gemma":0.00110263,"threshold_uncertainty_score":0.043586373},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68336916,0.0017853288,0.27399752,0.0015247399,0.00013633344,0.00018689157,0.00028309156,0.00017610367,0.03854077],"genre_scores_gemma":[0.9765206,0.00065667415,0.016810233,0.00015285776,0.00008389552,0.000119137505,0.00020511277,0.000071239374,0.0053801388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996635,0.00007321766,0.000018871453,0.00008983428,0.00009099711,0.00006361989],"domain_scores_gemma":[0.9984648,0.00069393724,0.00027124546,0.00008786539,0.00027427773,0.00020788804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075650384,0.0012231312,0.0009855838,0.0030001483,0.0018836341,0.003232993,0.0013731192,0.0018777379,0.0030586235],"category_scores_gemma":[0.006724681,0.0010619046,0.001127965,0.0015264221,0.0036629967,0.0029796185,0.0039660037,0.0018156127,0.0003197982],"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.00013331462,0.000036309466,0.0007753377,0.00011902508,0.00006916911,0.00014066536,0.00050030893,0.021972667,0.0044230483,0.96113914,0.0010941321,0.009596749],"study_design_scores_gemma":[0.000039442246,0.00004680342,0.0009957267,0.0000393209,0.000033129083,0.00014351186,0.00021556362,0.11606233,0.0013758114,0.8795014,0.0015124569,0.000034519366],"about_ca_topic_score_codex":0.0014712253,"about_ca_topic_score_gemma":0.0010475941,"teacher_disagreement_score":0.003232993,"about_ca_system_score_codex":0.0012738998,"about_ca_system_score_gemma":0.00064471125,"threshold_uncertainty_score":0.010232091},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02381614,0.008747508,0.88064736,0.004928158,0.0008065071,0.00006781046,0.00020448281,0.000086241474,0.080695786],"genre_scores_gemma":[0.55713946,0.028916487,0.31873307,0.0041530738,0.0064322776,0.0007544902,0.0015583995,0.0005816021,0.08173109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973646,0.0014329411,0.00009829435,0.0003297692,0.0006220961,0.00015230168],"domain_scores_gemma":[0.98988664,0.007768923,0.000584822,0.00048899,0.00090711477,0.0003635615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004931242,0.0022098622,0.0022110792,0.0023049125,0.0015476362,0.0036340714,0.0023357314,0.002698562,0.006877935],"category_scores_gemma":[0.020774486,0.0012541518,0.0014623397,0.0054178988,0.0063527226,0.00771416,0.003316865,0.008195143,0.0009576803],"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.000024120354,0.000049923325,0.00017205201,0.0001093868,0.00002491216,0.0000628083,0.000106241154,0.022988547,0.00017782341,0.96088886,0.004695298,0.010700067],"study_design_scores_gemma":[0.0000072423672,0.000015273132,0.00012321616,0.000032120606,0.000008488036,0.000034409743,0.000028062994,0.066892095,0.00004845938,0.9290331,0.0037654862,0.000011900913],"about_ca_topic_score_codex":0.0035113117,"about_ca_topic_score_gemma":0.0030151543,"teacher_disagreement_score":0.006877935,"about_ca_system_score_codex":0.002092012,"about_ca_system_score_gemma":0.0012805235,"threshold_uncertainty_score":0.026079237},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0791078,0.0006867458,0.9072151,0.00022240645,0.000090328685,0.00013095455,0.00010621064,0.0005070115,0.011933433],"genre_scores_gemma":[0.8251715,0.00042475635,0.17003895,0.00010332797,0.00003711281,0.00029300514,0.00013352734,0.00015086109,0.0036469656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949837,0.00024966698,0.000013664471,0.00005527075,0.00011272125,0.00007023675],"domain_scores_gemma":[0.9992105,0.000502752,0.00009992207,0.000033106564,0.00012106194,0.000032659256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009523391,0.0009572132,0.0011319875,0.0011661751,0.00064729864,0.0011673749,0.00096023805,0.0010740535,0.0034785415],"category_scores_gemma":[0.0024634288,0.000959049,0.00085700804,0.0007739423,0.0009349073,0.0009700006,0.0007348225,0.0006805926,0.00035855456],"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.000017750051,0.000008118842,0.00008266243,0.000018501596,0.000008568176,0.000011052212,0.00001438219,0.99281055,0.00030122226,0.0012548863,0.00015107339,0.005321241],"study_design_scores_gemma":[0.000009802773,0.00002874238,0.000041009127,0.0000042205893,0.0000065152935,0.0000048793754,0.000010892432,0.9982566,0.00015945765,0.0012627708,0.00021239203,0.0000026846867],"about_ca_topic_score_codex":0.0063106082,"about_ca_topic_score_gemma":0.005588822,"teacher_disagreement_score":0.0063106082,"about_ca_system_score_codex":0.00096565875,"about_ca_system_score_gemma":0.0014001415,"threshold_uncertainty_score":0.012547731},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003496247,0.00008604619,0.99410653,0.0000572052,0.00003900628,0.000021426556,0.000013160784,0.00016187511,0.0020184028],"genre_scores_gemma":[0.09518225,0.00017863174,0.9011256,0.00007748358,0.000040336578,0.00022177887,0.000079689926,0.0002422125,0.0028519898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954176,0.00016751021,0.00002016042,0.000084776606,0.00014155702,0.00004427067],"domain_scores_gemma":[0.99935144,0.00038369925,0.00002502551,0.00006821219,0.0001474716,0.000024127216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014457295,0.0013100791,0.0013890662,0.0009785555,0.0008609138,0.0010619056,0.001404255,0.0018332483,0.0038786836],"category_scores_gemma":[0.003256725,0.00075592264,0.0011392843,0.0010901474,0.0012324924,0.001484362,0.0020719455,0.0015737219,0.0006450462],"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.00016353356,0.00006286961,0.00034096555,0.00014429667,0.00007469205,0.00006863134,0.00016783817,0.67280805,0.0038942646,0.16887681,0.0034731932,0.14992481],"study_design_scores_gemma":[0.000036063477,0.000045675934,0.000056103276,0.000012086019,0.000015675578,0.0000215891,0.0000119708375,0.97124434,0.00065311394,0.025668783,0.0022230865,0.000011661506],"about_ca_topic_score_codex":0.002455385,"about_ca_topic_score_gemma":0.002044019,"teacher_disagreement_score":0.0038786836,"about_ca_system_score_codex":0.0009024918,"about_ca_system_score_gemma":0.0012514992,"threshold_uncertainty_score":0.012975514},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030218408,0.00035335784,0.96259654,0.00033183154,0.000059246286,0.0000907646,0.00031545287,0.00025711377,0.005777297],"genre_scores_gemma":[0.51737064,0.0009047699,0.47136465,0.00019627012,0.00015569423,0.00039968223,0.0006700756,0.00035786204,0.008580433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999166,0.00042446592,0.000025899993,0.00010227569,0.00014151946,0.00013997333],"domain_scores_gemma":[0.9988123,0.00068701676,0.0001157475,0.00011248833,0.00017931905,0.00009318676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001844582,0.0012740145,0.0014479244,0.0014748183,0.0006990123,0.0016706008,0.0014536094,0.0009783664,0.004941447],"category_scores_gemma":[0.004568692,0.0010106363,0.0010656564,0.002203109,0.0013621321,0.0023784381,0.0013171366,0.0017567755,0.0005484398],"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.00011898333,0.00005071826,0.00015608667,0.000054947406,0.000028320374,0.000017379536,0.00005678475,0.9298301,0.0009564605,0.04522025,0.0018224007,0.021687675],"study_design_scores_gemma":[0.000016606064,0.000014458658,0.000057621575,0.000007498485,0.00000812884,0.0000062846134,0.000014239807,0.93349063,0.0002972075,0.06549918,0.00058139063,0.0000068292393],"about_ca_topic_score_codex":0.0064554685,"about_ca_topic_score_gemma":0.004418452,"teacher_disagreement_score":0.0064554685,"about_ca_system_score_codex":0.0015827527,"about_ca_system_score_gemma":0.0015878092,"threshold_uncertainty_score":0.016530752},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017095478,0.0019431829,0.94877934,0.0019055922,0.00026442716,0.00006453374,0.00014064019,0.0001228725,0.029683996],"genre_scores_gemma":[0.5269744,0.009280885,0.41563106,0.0017295909,0.0030002347,0.00071900367,0.0007001765,0.0008893841,0.04107526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989373,0.0004071382,0.00005707345,0.00016358188,0.00033975116,0.00009523056],"domain_scores_gemma":[0.9932417,0.005048199,0.00045868062,0.00037286806,0.0006631304,0.00021531906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039314874,0.0013303643,0.00096619636,0.0014939834,0.0012326703,0.002472075,0.0019664948,0.0016775132,0.007362368],"category_scores_gemma":[0.015280947,0.00075669243,0.0015917782,0.0023101862,0.0031592578,0.006055383,0.0025764094,0.0055049052,0.000694278],"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.00003955955,0.00004621849,0.00024453242,0.00013688068,0.000023414308,0.00007322594,0.00023597959,0.037907876,0.0018714858,0.9277884,0.003460181,0.028172227],"study_design_scores_gemma":[0.000024515843,0.000066094064,0.0003058231,0.000041000985,0.00002020584,0.000116648545,0.00007817891,0.41495177,0.0010039252,0.57798505,0.0053804526,0.000026368116],"about_ca_topic_score_codex":0.0019863446,"about_ca_topic_score_gemma":0.0018214145,"teacher_disagreement_score":0.007362368,"about_ca_system_score_codex":0.0013100179,"about_ca_system_score_gemma":0.0014789448,"threshold_uncertainty_score":0.024629593},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027873438,0.0011024036,0.95679134,0.00091839297,0.00030765476,0.0001426383,0.00011027312,0.00016152696,0.012592236],"genre_scores_gemma":[0.4604481,0.0016896421,0.5222361,0.0008164803,0.00038934773,0.00054334593,0.00044390612,0.0008694352,0.012563636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99592626,0.0020369098,0.0002340191,0.00048226342,0.00092230504,0.0003982635],"domain_scores_gemma":[0.97313243,0.020417819,0.0008492875,0.0013584201,0.0032879806,0.0009540167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015540095,0.0019018975,0.0028324595,0.0030859855,0.0015834958,0.0031129492,0.0038333992,0.0039161774,0.008102413],"category_scores_gemma":[0.052586876,0.001273309,0.0028598527,0.0022808262,0.007578131,0.006649023,0.0058450736,0.0076460945,0.0012237121],"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.00050211727,0.0001264046,0.0008004918,0.0004096454,0.000095828116,0.00020616602,0.00047423408,0.18840271,0.004490339,0.7706927,0.0036412857,0.030158054],"study_design_scores_gemma":[0.0000716298,0.0001727076,0.00028507863,0.00010654646,0.00002437007,0.000076005585,0.000078173805,0.8083875,0.002077509,0.18657725,0.0020787327,0.00006447122],"about_ca_topic_score_codex":0.0067364336,"about_ca_topic_score_gemma":0.0053526894,"teacher_disagreement_score":0.015540095,"about_ca_system_score_codex":0.002050204,"about_ca_system_score_gemma":0.0037530577,"threshold_uncertainty_score":0.08218485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021099593,0.00022951319,0.99257094,0.0004978134,0.00009143956,0.000017354023,0.000034337412,0.000038182035,0.00441054],"genre_scores_gemma":[0.13673703,0.0011356127,0.82286716,0.00078009744,0.00086700683,0.000321204,0.000253876,0.0003976162,0.036640476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988556,0.0005319312,0.000057414327,0.00019671115,0.00028304718,0.000075343654],"domain_scores_gemma":[0.99881566,0.0006416823,0.00008646946,0.00013718645,0.00020873101,0.00011032897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003403685,0.0010791374,0.0012884961,0.0008627155,0.0009471772,0.0020870098,0.0029525638,0.0020421068,0.007391117],"category_scores_gemma":[0.0060411366,0.00089189544,0.0012141499,0.001182031,0.0018136926,0.004827939,0.004119455,0.0032959871,0.0010925647],"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.00005951387,0.00006962623,0.00018231229,0.00010358618,0.000074317744,0.00009391203,0.000112328125,0.105951436,0.0020112328,0.8392683,0.0055346927,0.04653865],"study_design_scores_gemma":[0.000019985402,0.000032721888,0.000068007255,0.000016644197,0.000019193161,0.00005369484,0.000014311898,0.64711547,0.000459132,0.34680912,0.0053727725,0.000018990768],"about_ca_topic_score_codex":0.0020289922,"about_ca_topic_score_gemma":0.0027556103,"teacher_disagreement_score":0.007391117,"about_ca_system_score_codex":0.0013179403,"about_ca_system_score_gemma":0.002009665,"threshold_uncertainty_score":0.024725795},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02053808,0.0002047669,0.97570544,0.00013696127,0.000054339227,0.00009995161,0.000051414874,0.0005801698,0.002628978],"genre_scores_gemma":[0.210221,0.00017876217,0.7845681,0.00015025273,0.00007043473,0.0004366097,0.00022307031,0.00021652371,0.0039352817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945945,0.0002213003,0.000018920902,0.00009038752,0.00014752764,0.00006240949],"domain_scores_gemma":[0.99920964,0.00051056925,0.00006921658,0.00003423108,0.00013578184,0.000040538147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011179902,0.0008616668,0.0013454285,0.0007719303,0.00046166903,0.0007165065,0.0016159188,0.0011214083,0.0022818097],"category_scores_gemma":[0.0017809939,0.0006603867,0.00076434517,0.0009216123,0.0004294166,0.0006788303,0.00071059656,0.0008804036,0.00043207614],"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.000060138624,0.0000810535,0.00024601238,0.000057784193,0.000027105802,0.000041474977,0.000030243464,0.947655,0.0013387605,0.0028105532,0.0010908621,0.04656095],"study_design_scores_gemma":[0.000008990039,0.000021121083,0.000027827764,0.0000020720574,0.0000024987542,0.000004825927,0.0000032081207,0.99920875,0.00014595829,0.00030691733,0.00026577772,0.0000020686812],"about_ca_topic_score_codex":0.008895929,"about_ca_topic_score_gemma":0.00975909,"teacher_disagreement_score":0.008895929,"about_ca_system_score_codex":0.0007139682,"about_ca_system_score_gemma":0.0018812304,"threshold_uncertainty_score":0.017688334},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006785589,0.036050417,0.43408066,0.020553164,0.020671142,0.00024629728,0.005930943,0.008093154,0.46758878],"genre_scores_gemma":[0.047154512,0.018367717,0.15213066,0.0020357445,0.0037421207,0.00039627613,0.0127189765,0.0057906862,0.75766325],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885106,0.00023225085,0.00004988758,0.0002449745,0.00048824676,0.0001335843],"domain_scores_gemma":[0.9986368,0.00024480218,0.00004233868,0.0004143074,0.0004951746,0.0001665748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002814554,0.0026431796,0.002461872,0.00189161,0.0009405723,0.0037267385,0.0022262766,0.0019831613,0.07809878],"category_scores_gemma":[0.0027919314,0.0011171327,0.001557367,0.002086692,0.00086196855,0.0024471832,0.002683635,0.0031526377,0.04548367],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00020695776,0.00012568505,0.00021526913,0.00021578175,0.000062041276,0.00005894983,0.000037855185,0.0182156,0.0014075179,0.029044483,0.6676434,0.28276634],"study_design_scores_gemma":[0.00007909642,0.00010579548,0.0009702721,0.00028708074,0.0000730214,0.0001690515,0.00007392557,0.0535002,0.00414038,0.056659807,0.8838913,0.00005011279],"about_ca_topic_score_codex":0.0056413338,"about_ca_topic_score_gemma":0.010942105,"teacher_disagreement_score":0.07809878,"about_ca_system_score_codex":0.001665174,"about_ca_system_score_gemma":0.0027201972,"threshold_uncertainty_score":0.2612664},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32050717,0.0032356752,0.5852225,0.00194232,0.0006694029,0.0002137258,0.0013026732,0.0002860829,0.086620465],"genre_scores_gemma":[0.8242069,0.0017482594,0.14598918,0.0004017198,0.00031398566,0.00020870444,0.00086401,0.00018128702,0.026085982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995653,0.00017952407,0.000016437403,0.00009937671,0.00008089037,0.000058458118],"domain_scores_gemma":[0.9989479,0.00051444257,0.00017074187,0.00009977899,0.00009449516,0.00017261486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005345861,0.0008090957,0.0010555042,0.0009440032,0.0006643257,0.0015632608,0.0009586009,0.0012524059,0.005716863],"category_scores_gemma":[0.0033826258,0.0006459391,0.0005978916,0.0018614171,0.001421472,0.0019930843,0.0011777978,0.0011313229,0.00064181903],"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.0015486783,0.00012783165,0.0010664979,0.0005752065,0.000084084815,0.00061568216,0.00016247563,0.18585873,0.0063040922,0.71845275,0.016922591,0.06828134],"study_design_scores_gemma":[0.00013391288,0.0002142836,0.00110797,0.00006431114,0.00003158014,0.0006427205,0.00024401995,0.27809447,0.0036609434,0.70506,0.010685308,0.00006052943],"about_ca_topic_score_codex":0.0008155738,"about_ca_topic_score_gemma":0.0007716274,"teacher_disagreement_score":0.005716863,"about_ca_system_score_codex":0.00044403362,"about_ca_system_score_gemma":0.0005266382,"threshold_uncertainty_score":0.019124806},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33823964,0.00039553334,0.65157324,0.00020953674,0.00004540929,0.00019122382,0.00024521907,0.00042689234,0.0086732665],"genre_scores_gemma":[0.9448975,0.00021818248,0.05208562,0.000024168512,0.000013956322,0.00015981535,0.00022733086,0.00011101464,0.0022623541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998049,0.000091637834,0.0000096574795,0.000028045924,0.000043917564,0.00002185813],"domain_scores_gemma":[0.9994491,0.0002621546,0.000045953053,0.00003400674,0.0001907015,0.00001800739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068891986,0.00063791673,0.0008091612,0.00039215578,0.0004533484,0.0006128627,0.00048335973,0.00093624805,0.0011673043],"category_scores_gemma":[0.0014608527,0.0002799418,0.0007917876,0.00031985366,0.00027094554,0.0004836273,0.0003983059,0.0005356294,0.00015478433],"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.0000618568,0.00004463156,0.00056082505,0.00005257404,0.000013139261,0.000031386448,0.000020633675,0.98531705,0.004290815,0.0009456237,0.00018479132,0.008476706],"study_design_scores_gemma":[0.0000043869136,0.000037950933,0.00022169974,0.0000024396998,0.0000050234657,0.0000051664006,0.0000058528085,0.99818677,0.001336916,0.00010073441,0.00008965752,0.0000033592933],"about_ca_topic_score_codex":0.0074346615,"about_ca_topic_score_gemma":0.0028377618,"teacher_disagreement_score":0.0074346615,"about_ca_system_score_codex":0.00047504716,"about_ca_system_score_gemma":0.0010242723,"threshold_uncertainty_score":0.014782786},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010064022,0.0003676689,0.98477006,0.00017865292,0.00025752996,0.00008872091,0.000082815925,0.00042077052,0.0037697777],"genre_scores_gemma":[0.15353914,0.00028307943,0.83650047,0.00023365715,0.00021716916,0.00030326977,0.00047697703,0.00035766678,0.008088664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911326,0.0002901199,0.000042568896,0.0001625297,0.00028316127,0.00010839138],"domain_scores_gemma":[0.9987092,0.0006137651,0.000069221845,0.00013711049,0.0003892012,0.00008153853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012742007,0.001074338,0.0017822363,0.002147557,0.001241153,0.001388725,0.0028625913,0.0019534596,0.0073218043],"category_scores_gemma":[0.0035776703,0.00079431816,0.001356821,0.0020075582,0.00096979627,0.0014667783,0.0014827127,0.0014308281,0.0013128776],"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.00024826673,0.00016804576,0.0005361084,0.00016942482,0.00016505357,0.00006511049,0.00012345023,0.7427724,0.0027046732,0.024788233,0.010237766,0.21802144],"study_design_scores_gemma":[0.000029155975,0.000029886494,0.00010461399,0.000007299609,0.000016670469,0.00002490983,0.000019333564,0.9921332,0.0004249474,0.0057414672,0.0014546039,0.0000139378135],"about_ca_topic_score_codex":0.010696154,"about_ca_topic_score_gemma":0.011767485,"teacher_disagreement_score":0.010696154,"about_ca_system_score_codex":0.0017508718,"about_ca_system_score_gemma":0.002230928,"threshold_uncertainty_score":0.024493873},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012089083,0.00009811506,0.9953157,0.00006788912,0.0000844123,0.000019394065,0.000018741344,0.00009083269,0.00309607],"genre_scores_gemma":[0.10765602,0.00034763096,0.8829008,0.0001836471,0.00014403263,0.00018787241,0.00007010859,0.00024095268,0.008269008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995484,0.0001238143,0.000018203193,0.00004562138,0.00021907892,0.000044850738],"domain_scores_gemma":[0.9992441,0.00045066004,0.000029244127,0.00007910884,0.00016311764,0.000033809643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011121618,0.0006128898,0.001008565,0.00090687844,0.0007330543,0.00094012707,0.0012967255,0.0012284752,0.0059655546],"category_scores_gemma":[0.0036519575,0.0004808811,0.0008501415,0.00097085064,0.00094039046,0.0013140229,0.0013685023,0.001825387,0.0007544463],"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.00009958549,0.00012522067,0.00021848957,0.00021776845,0.000045315264,0.00009158231,0.0001341985,0.5066433,0.0037324873,0.25193042,0.0050907773,0.23167084],"study_design_scores_gemma":[0.000013217644,0.0000161566,0.00002939364,0.000012596375,0.000007842159,0.000021245878,0.000008480446,0.9577251,0.00035818553,0.03874882,0.0030523539,0.0000066266407],"about_ca_topic_score_codex":0.0043940987,"about_ca_topic_score_gemma":0.0053837197,"teacher_disagreement_score":0.0059655546,"about_ca_system_score_codex":0.0007729152,"about_ca_system_score_gemma":0.0013502982,"threshold_uncertainty_score":0.019956768},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004205407,0.00024507497,0.9942047,0.00027061437,0.0000305071,0.0000169204,0.000026306741,0.00009507651,0.00090538285],"genre_scores_gemma":[0.56210953,0.0012257142,0.42653534,0.0005518719,0.0006024401,0.00040155774,0.00038131073,0.00047829244,0.0077140676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980882,0.0011596095,0.000074310585,0.00018107629,0.00038756544,0.00010923573],"domain_scores_gemma":[0.9939633,0.0045850594,0.00047100094,0.0002837728,0.0005452759,0.00015159512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00448492,0.0014151077,0.0031521672,0.00160101,0.00050272996,0.0019502782,0.0024392782,0.0025641397,0.0025350172],"category_scores_gemma":[0.011314047,0.0014151569,0.0016696468,0.0014105801,0.0011181899,0.002535227,0.00196689,0.0021369988,0.00038823817],"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.000051064933,0.000037088757,0.00018157538,0.000063463034,0.00010904496,0.000057100307,0.000016498896,0.9676922,0.00049028883,0.019672556,0.0006685434,0.010960604],"study_design_scores_gemma":[0.0000047547073,0.0000080438285,0.000030015215,0.0000033610302,0.00000776313,0.0000065101603,8.5779e-7,0.99621814,0.000055448727,0.003572423,0.000088208355,0.000004447765],"about_ca_topic_score_codex":0.0020005761,"about_ca_topic_score_gemma":0.0016633968,"teacher_disagreement_score":0.00448492,"about_ca_system_score_codex":0.00085894484,"about_ca_system_score_gemma":0.0013738928,"threshold_uncertainty_score":0.023718834},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09376814,0.00022979613,0.9030164,0.00010240929,0.000046464407,0.00006389734,0.000046243025,0.00032282266,0.0024038546],"genre_scores_gemma":[0.662127,0.0002849314,0.33505934,0.00006196566,0.00004454238,0.00015389538,0.00015446442,0.00016601208,0.0019478529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778444,0.0007462885,0.000095205054,0.00052364456,0.0007313415,0.000119145545],"domain_scores_gemma":[0.99780303,0.0007298282,0.00035568106,0.0006494657,0.00036949472,0.00009253266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001658857,0.0012641781,0.0015510721,0.0017592743,0.00066964084,0.0017461185,0.0019411193,0.0016694784,0.0019253761],"category_scores_gemma":[0.010699378,0.0006769029,0.001229704,0.0018555922,0.0018957296,0.0026996646,0.0028708677,0.0009852279,0.0006426285],"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.00025595113,0.000036968504,0.0020210391,0.00013461552,0.00009454193,0.00027556164,0.00038680615,0.85699475,0.010410063,0.06776806,0.00068169256,0.06094005],"study_design_scores_gemma":[0.000010233879,0.00010640694,0.0003288134,0.000018145962,0.000013163539,0.00014940226,0.00007767492,0.9792605,0.0030617986,0.01435273,0.0025889655,0.000032166558],"about_ca_topic_score_codex":0.0019911372,"about_ca_topic_score_gemma":0.0010436419,"teacher_disagreement_score":0.0019911372,"about_ca_system_score_codex":0.00087958947,"about_ca_system_score_gemma":0.0004944628,"threshold_uncertainty_score":0.008772969},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15067704,0.002502616,0.69140655,0.005625916,0.00033269235,0.000077127035,0.0008157662,0.00032912256,0.1482332],"genre_scores_gemma":[0.8866185,0.0033849382,0.04431344,0.0008586678,0.0010937311,0.00023708362,0.0014264258,0.0011322909,0.06093497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857616,0.0005292463,0.00007858712,0.00027377778,0.0003181395,0.00022401634],"domain_scores_gemma":[0.993735,0.0031189155,0.00045022272,0.0007330193,0.0014386236,0.0005242046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023266342,0.0009491308,0.0014271847,0.0028932104,0.0018500297,0.0046387827,0.0013087341,0.001403376,0.012264683],"category_scores_gemma":[0.011888677,0.0007512953,0.0014606015,0.0021038793,0.0031586918,0.00847147,0.0029918943,0.003968542,0.001870319],"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.00004118965,0.000017850512,0.0003312653,0.00006734406,0.000017258822,0.00006572622,0.00015101893,0.0033852165,0.0014570802,0.98160326,0.0038817693,0.0089809345],"study_design_scores_gemma":[0.000007496152,0.000014454518,0.000484217,0.000022959433,0.000013892834,0.00014046275,0.00012415268,0.023216425,0.0007536373,0.970769,0.0044426518,0.000010590634],"about_ca_topic_score_codex":0.0011393896,"about_ca_topic_score_gemma":0.0008321429,"teacher_disagreement_score":0.012264683,"about_ca_system_score_codex":0.0016744918,"about_ca_system_score_gemma":0.0010302616,"threshold_uncertainty_score":0.041029394},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66507196,0.0011375413,0.26182607,0.0034717724,0.00048015316,0.000121048666,0.0006366938,0.00028967534,0.06696504],"genre_scores_gemma":[0.9687663,0.00032838478,0.024742614,0.0002511624,0.00018967428,0.00009271647,0.00036180145,0.000048310674,0.0052191955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860364,0.00019426935,0.000113178176,0.00035490075,0.00037787887,0.00035612553],"domain_scores_gemma":[0.98789716,0.0067578275,0.0011288321,0.00093595206,0.0017132827,0.00156701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016511597,0.00033572727,0.0015785829,0.0013047054,0.0025967157,0.0023320222,0.0015078887,0.002678326,0.0038044741],"category_scores_gemma":[0.015692737,0.0008105175,0.0010708822,0.0005959257,0.005254645,0.0035321536,0.0036620118,0.002333982,0.00045842127],"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.0003386106,0.00011609686,0.0052700564,0.00019672349,0.00005319673,0.0017215011,0.0006372334,0.0059917397,0.012560855,0.9559091,0.0038740255,0.013330784],"study_design_scores_gemma":[0.00010737666,0.0001542942,0.0030266624,0.00012581865,0.000052890533,0.0054239277,0.0010026656,0.06574184,0.010106613,0.9049684,0.009186147,0.00010335081],"about_ca_topic_score_codex":0.0007703996,"about_ca_topic_score_gemma":0.00079526677,"teacher_disagreement_score":0.0038044741,"about_ca_system_score_codex":0.0006022129,"about_ca_system_score_gemma":0.00090702757,"threshold_uncertainty_score":0.012727261},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022082508,0.00036740224,0.97012997,0.000105376304,0.00011011299,0.000053809097,0.000019498606,0.00018121333,0.006950123],"genre_scores_gemma":[0.38145828,0.00025814984,0.611039,0.000118836324,0.000084309366,0.00027953304,0.00006293492,0.00018925338,0.0065097343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976295,0.00009480579,0.0000084083385,0.000027366657,0.000093436596,0.000013000419],"domain_scores_gemma":[0.9993697,0.00041606097,0.00004988132,0.00004521253,0.000099367775,0.000019778809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068096566,0.000515179,0.00092962495,0.0006402929,0.00041717137,0.0006307816,0.0010347669,0.0009996236,0.002264737],"category_scores_gemma":[0.00216161,0.0004668385,0.0005224016,0.00056271575,0.0005957462,0.00086942257,0.0007840968,0.00068901305,0.00026411467],"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.00012093243,0.00008448622,0.00038024294,0.00009678913,0.00006681492,0.00005774172,0.00006079334,0.883984,0.0030236514,0.032333232,0.0013949078,0.07839645],"study_design_scores_gemma":[0.00000841282,0.000011848171,0.000029978002,0.0000019979132,0.00000311802,0.0000058140727,0.0000021621431,0.9977348,0.00015988108,0.0017964353,0.00024368423,0.000001945514],"about_ca_topic_score_codex":0.0024254275,"about_ca_topic_score_gemma":0.0035027992,"teacher_disagreement_score":0.0024254275,"about_ca_system_score_codex":0.00042972676,"about_ca_system_score_gemma":0.0005349988,"threshold_uncertainty_score":0.007576287},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37660956,0.017500626,0.53954965,0.0020196105,0.00052528235,0.00032870483,0.00071369344,0.0029695285,0.059783425],"genre_scores_gemma":[0.76835537,0.003917061,0.2219804,0.0002173429,0.00020832685,0.0002595465,0.0010469506,0.0009124953,0.0031025268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9853829,0.0070492015,0.0006465056,0.0006378692,0.005956616,0.00032684198],"domain_scores_gemma":[0.90431523,0.072239585,0.0021720498,0.008812008,0.011769918,0.000691217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016021343,0.00095699244,0.001103043,0.0066929273,0.0006682248,0.003526507,0.0014374864,0.0018503201,0.0036404897],"category_scores_gemma":[0.06745527,0.00032827083,0.0012757253,0.00519406,0.0015390539,0.0041379924,0.002008556,0.0011675934,0.00058668625],"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.0019996744,0.00053347414,0.010082525,0.0010944988,0.00050266704,0.000059153317,0.00040526962,0.24663907,0.0057395953,0.116636,0.0054116584,0.6108964],"study_design_scores_gemma":[0.00029719993,0.0028214816,0.016624337,0.00046395397,0.0005128611,0.00022941842,0.0006404253,0.8611844,0.0117131,0.08491189,0.020475112,0.0001258515],"about_ca_topic_score_codex":0.0019156055,"about_ca_topic_score_gemma":0.002148025,"teacher_disagreement_score":0.016021343,"about_ca_system_score_codex":0.0018493878,"about_ca_system_score_gemma":0.0017717209,"threshold_uncertainty_score":0.08472997},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032319337,0.00034296236,0.96039855,0.00028775772,0.000043966553,0.000056002875,0.00009311146,0.00025330434,0.0062049977],"genre_scores_gemma":[0.39267892,0.00026787483,0.6009447,0.00011944214,0.000056875568,0.0001928808,0.00023014293,0.00015950203,0.00534967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947673,0.00022436125,0.000019192914,0.00010165123,0.00010118619,0.00007692424],"domain_scores_gemma":[0.9986725,0.0010012534,0.00009558551,0.00006324912,0.000120665005,0.000046775367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010377375,0.00072890014,0.0014869708,0.0010988332,0.0007186942,0.0009769747,0.0017275795,0.0017200338,0.0044323676],"category_scores_gemma":[0.004707195,0.0007019325,0.00096816506,0.0013738379,0.0008221447,0.0017300015,0.0017737225,0.00088979723,0.0004358173],"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.0001531131,0.00006301632,0.00050171546,0.00009615772,0.000047806654,0.00004863064,0.000050617316,0.9292123,0.0007199508,0.022732664,0.002234011,0.044140067],"study_design_scores_gemma":[0.000021236765,0.000029278908,0.000047475893,0.0000056230247,0.0000060691814,0.000016835493,0.000018118917,0.98802966,0.0001913773,0.011144453,0.00048538455,0.000004389096],"about_ca_topic_score_codex":0.006971051,"about_ca_topic_score_gemma":0.0063381316,"teacher_disagreement_score":0.006971051,"about_ca_system_score_codex":0.0007666668,"about_ca_system_score_gemma":0.0014146765,"threshold_uncertainty_score":0.014827788},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01439979,0.001089849,0.9513258,0.0017284,0.0002064486,0.00016639457,0.0006307157,0.0001108652,0.030341657],"genre_scores_gemma":[0.55542254,0.006147579,0.39749467,0.0015238334,0.0008759293,0.0012520548,0.0027603018,0.0008511902,0.033671826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986993,0.0005202153,0.00009550669,0.00018083569,0.00032285045,0.0001812843],"domain_scores_gemma":[0.9944417,0.003535861,0.00036386884,0.00019229607,0.0012594619,0.00020683704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004027888,0.0017385266,0.0012554636,0.0015885351,0.00067567575,0.002785169,0.0011089642,0.0021624938,0.009574635],"category_scores_gemma":[0.013865754,0.0008289266,0.0009941075,0.0013314392,0.0018435972,0.0031356271,0.0023288713,0.003961751,0.0020979682],"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.00014530389,0.000084793326,0.00053198915,0.00036909356,0.00004114576,0.00024420768,0.00017411358,0.15807505,0.003924423,0.78896314,0.013242611,0.03420399],"study_design_scores_gemma":[0.00006375522,0.0001176489,0.0004839852,0.00013077319,0.000025804115,0.00020252288,0.00014145632,0.5878036,0.0017805052,0.40052757,0.008680287,0.000042086413],"about_ca_topic_score_codex":0.0033989989,"about_ca_topic_score_gemma":0.0022558942,"teacher_disagreement_score":0.009574635,"about_ca_system_score_codex":0.0013027039,"about_ca_system_score_gemma":0.0024278597,"threshold_uncertainty_score":0.032030284},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10505403,0.004067337,0.8318484,0.0024588027,0.0003863386,0.00010738799,0.00032154808,0.00016730944,0.05558874],"genre_scores_gemma":[0.79610246,0.0031124926,0.17235842,0.0002956473,0.0006225395,0.00022285759,0.0007273443,0.00042228083,0.026135929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992237,0.0003528118,0.000033344648,0.00009757451,0.00020205785,0.00009056861],"domain_scores_gemma":[0.99734527,0.0018458252,0.00027023707,0.0001273946,0.00021989112,0.00019145108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015106832,0.0010007961,0.0015360753,0.0021335708,0.001144651,0.002522356,0.0017270098,0.0018573675,0.004621595],"category_scores_gemma":[0.009664186,0.0010114614,0.0009372731,0.0011337552,0.0022928733,0.002587807,0.002811859,0.0034205497,0.00035346352],"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.000107893815,0.000048144986,0.0004445856,0.00018069106,0.00004490389,0.00014285241,0.00013813165,0.10017448,0.0010340441,0.8733527,0.004679849,0.019651685],"study_design_scores_gemma":[0.000017802171,0.000024418045,0.00023012537,0.000046856203,0.000014784509,0.00010084329,0.00007567882,0.3525453,0.00042515298,0.6435275,0.0029769435,0.000014541521],"about_ca_topic_score_codex":0.0010111497,"about_ca_topic_score_gemma":0.0012202262,"teacher_disagreement_score":0.004621595,"about_ca_system_score_codex":0.0010719544,"about_ca_system_score_gemma":0.00048362956,"threshold_uncertainty_score":0.015460789},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014598529,0.012363126,0.96795523,0.00228605,0.0013053606,0.000027609562,0.00013675058,0.00013731958,0.01432866],"genre_scores_gemma":[0.19519055,0.03031225,0.6406574,0.001817476,0.0054249023,0.0005737089,0.0007902846,0.0018116806,0.123421825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983317,0.0008314659,0.0000897924,0.0002143984,0.00045822453,0.00007455526],"domain_scores_gemma":[0.99670756,0.0020289624,0.00014275376,0.00037311585,0.000598029,0.000149675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039390502,0.0017763501,0.0033962443,0.0019036724,0.00091077475,0.0032916367,0.0020522948,0.00283466,0.006758731],"category_scores_gemma":[0.0084883,0.0015173322,0.0018959318,0.0026963777,0.003842429,0.0034627588,0.003293324,0.0073316265,0.0022231042],"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.000016204285,0.000023409975,0.00013801965,0.0002006034,0.00010329025,0.000034016226,0.00010403555,0.02372897,0.0005585176,0.92359066,0.013907085,0.03759522],"study_design_scores_gemma":[0.000013880969,0.0000144874875,0.00021150988,0.00008157225,0.000042923493,0.00006652154,0.00003204426,0.18534675,0.00031476133,0.7813481,0.032505024,0.000022360817],"about_ca_topic_score_codex":0.0051875915,"about_ca_topic_score_gemma":0.0046868934,"teacher_disagreement_score":0.006758731,"about_ca_system_score_codex":0.001962303,"about_ca_system_score_gemma":0.0019088454,"threshold_uncertainty_score":0.022610188},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008087569,0.0020804317,0.9725198,0.0008832462,0.00058409973,0.00006655133,0.0001580652,0.0012505507,0.014369688],"genre_scores_gemma":[0.2880514,0.0047391234,0.68925345,0.0017483969,0.0017165424,0.00053443626,0.0009125952,0.002480782,0.010563246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99050057,0.003551659,0.0006458529,0.0013349254,0.0033294947,0.0006373807],"domain_scores_gemma":[0.962482,0.02461042,0.0014360788,0.008329836,0.0025871666,0.0005545238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009352496,0.003227664,0.0031188843,0.0037857848,0.0013214974,0.004180876,0.0038533553,0.0020243283,0.014471106],"category_scores_gemma":[0.051994048,0.0016321082,0.003024644,0.0048855864,0.0044156653,0.010205528,0.008193526,0.009079433,0.005014025],"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.0010918553,0.0002313886,0.0008605292,0.0005645038,0.0001357788,0.00021966283,0.0005139964,0.101972185,0.007428615,0.57366186,0.019342903,0.2939767],"study_design_scores_gemma":[0.00010488508,0.0001678487,0.00023012122,0.00014401138,0.00009438942,0.00009424155,0.00007590011,0.35327935,0.0048965085,0.63016975,0.010697743,0.00004525719],"about_ca_topic_score_codex":0.0015845431,"about_ca_topic_score_gemma":0.0012692411,"teacher_disagreement_score":0.014471106,"about_ca_system_score_codex":0.0016679626,"about_ca_system_score_gemma":0.0018565216,"threshold_uncertainty_score":0.049461305},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063943095,0.000118501644,0.9886994,0.00011586258,0.00011433247,0.00034113374,0.00014019654,0.00063091004,0.003445434],"genre_scores_gemma":[0.14903586,0.000294637,0.8438289,0.0001386597,0.00007078952,0.0024366179,0.00030505966,0.0003898901,0.0034995403],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99499476,0.0020157944,0.00028993143,0.00042984073,0.0021078833,0.00016186561],"domain_scores_gemma":[0.996222,0.0013312886,0.00020695869,0.0010483107,0.0011281036,0.000063245374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004703624,0.0009936568,0.00071344,0.00080566085,0.0006777779,0.0009708502,0.0016679538,0.0010707541,0.011433081],"category_scores_gemma":[0.008847807,0.00046474682,0.0005558112,0.0010052775,0.0010049816,0.0013193256,0.0015179348,0.0015404072,0.0021267869],"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.0006075365,0.0013958988,0.0008927428,0.0013751988,0.00010432653,0.0001063144,0.00024483266,0.04157187,0.46378854,0.119492985,0.0058169332,0.3646029],"study_design_scores_gemma":[0.00037951846,0.0026375656,0.0022446325,0.00017029127,0.00008314694,0.00030538166,0.00020018463,0.46549723,0.43737087,0.03381909,0.05712654,0.00016566335],"about_ca_topic_score_codex":0.00030109193,"about_ca_topic_score_gemma":0.00030973548,"teacher_disagreement_score":0.011433081,"about_ca_system_score_codex":0.00041538902,"about_ca_system_score_gemma":0.000840191,"threshold_uncertainty_score":0.038247526},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2161723,0.001190439,0.7016481,0.0023623768,0.00011403162,0.00008345859,0.00030835054,0.00014292556,0.077977955],"genre_scores_gemma":[0.9363074,0.0007499095,0.052651264,0.0003728952,0.00014485484,0.00014386568,0.00016469478,0.00009238751,0.009372756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815947,0.00076763134,0.000102363236,0.00026243,0.00049000286,0.0002181451],"domain_scores_gemma":[0.98309326,0.012225612,0.0014592815,0.0009901924,0.001354173,0.00087740034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005769427,0.0007900876,0.0013003566,0.0015401198,0.0014506807,0.0034716919,0.0014897465,0.0011657431,0.007390211],"category_scores_gemma":[0.021146737,0.0008477831,0.0011205188,0.0014335574,0.0052972524,0.006878997,0.0034556463,0.0037972864,0.00043865023],"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.00003315878,0.000022462129,0.0002587446,0.00002539086,0.000014989855,0.000039206265,0.00006169447,0.007990904,0.00037046702,0.9876583,0.00047488135,0.0030498179],"study_design_scores_gemma":[0.000013941176,0.000020070525,0.00027893338,0.000013971256,0.0000067259325,0.00004672362,0.000040721672,0.030609641,0.00018100928,0.9682247,0.00055447133,0.00000903763],"about_ca_topic_score_codex":0.0013257975,"about_ca_topic_score_gemma":0.0011177182,"teacher_disagreement_score":0.007390211,"about_ca_system_score_codex":0.0012856115,"about_ca_system_score_gemma":0.0014446052,"threshold_uncertainty_score":0.030512035},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040158257,0.00043688325,0.94948554,0.0004424333,0.00011835574,0.00003834124,0.00006877554,0.00011918292,0.009132192],"genre_scores_gemma":[0.7728089,0.00048370846,0.20485994,0.00034137405,0.00018058065,0.0001905223,0.0003064252,0.00043118364,0.020397436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911124,0.00035026285,0.00002705415,0.00020573441,0.00022153166,0.000084213374],"domain_scores_gemma":[0.99840516,0.00089423795,0.00014955479,0.00013017186,0.0002710666,0.00014975875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003172404,0.0015833254,0.0017361483,0.00082341273,0.00030183402,0.002002122,0.0013605562,0.0020417667,0.0025448545],"category_scores_gemma":[0.0047199284,0.0005206373,0.00067621755,0.0004371308,0.0019190448,0.0020728912,0.0022801752,0.001698048,0.0004473069],"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.00035861228,0.00016932198,0.00074233656,0.00039658247,0.00010616452,0.00014739414,0.00016627932,0.66167223,0.016823284,0.26990688,0.0032031971,0.046307676],"study_design_scores_gemma":[0.000013680482,0.00012784447,0.00015598151,0.000017762746,0.000012036379,0.000047965546,0.000023325765,0.9755436,0.0018412685,0.021097457,0.0011035133,0.000015550526],"about_ca_topic_score_codex":0.00077452627,"about_ca_topic_score_gemma":0.0007090826,"teacher_disagreement_score":0.003172404,"about_ca_system_score_codex":0.0014311465,"about_ca_system_score_gemma":0.0010420459,"threshold_uncertainty_score":0.016777456},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064094015,0.00038170023,0.99043536,0.00031106645,0.000079593716,0.00003317042,0.00004146576,0.00008402436,0.002224306],"genre_scores_gemma":[0.36239046,0.0010751183,0.6237135,0.00048455314,0.0002531004,0.0004872199,0.00040870573,0.0007504791,0.0104368655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986255,0.0007612934,0.000050344555,0.00011575135,0.00034248302,0.00010461242],"domain_scores_gemma":[0.9979328,0.0012879793,0.00012303377,0.0001810355,0.00034235485,0.0001328612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038769064,0.0016077085,0.0018966177,0.0010091157,0.0004475129,0.0016717472,0.0016095686,0.0024813465,0.0031057277],"category_scores_gemma":[0.008803337,0.00072589616,0.000934361,0.0008396023,0.0016922905,0.0027538487,0.0029369576,0.003288927,0.00056469813],"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.00021945804,0.00012103315,0.00029308748,0.00044141943,0.00007906059,0.00011471237,0.00017198327,0.49354932,0.0054666516,0.4387815,0.005232638,0.055529192],"study_design_scores_gemma":[0.000012676278,0.000023212522,0.00004249001,0.000023069733,0.0000057684133,0.000019630295,0.0000118402595,0.942836,0.00037427494,0.05553186,0.0011112727,0.000007889224],"about_ca_topic_score_codex":0.0013361927,"about_ca_topic_score_gemma":0.0012202599,"teacher_disagreement_score":0.0038769064,"about_ca_system_score_codex":0.0012352931,"about_ca_system_score_gemma":0.001564026,"threshold_uncertainty_score":0.020503283},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2751854,0.001673212,0.70401853,0.0041284338,0.00031116977,0.00009306301,0.000144399,0.00023998671,0.01420575],"genre_scores_gemma":[0.9469271,0.0012462733,0.031841986,0.00056737644,0.0005060659,0.00014663044,0.00019075473,0.00008895164,0.01848486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998175,0.0010769931,0.00007757515,0.00022826233,0.00023942206,0.00020273266],"domain_scores_gemma":[0.9888892,0.0078926375,0.00088664115,0.000774857,0.00093687535,0.0006197939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068653054,0.000815258,0.0018273975,0.0015014783,0.00058046693,0.0031465804,0.0021676796,0.0025143428,0.0055136466],"category_scores_gemma":[0.018982835,0.0007350067,0.0018518311,0.0011160477,0.0018242021,0.004379111,0.0015005006,0.0022265392,0.00067390304],"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.00019050011,0.00008505371,0.0030314592,0.00009842167,0.00019602198,0.0002708415,0.00014509825,0.1292048,0.0013101568,0.84548926,0.0019484527,0.018029973],"study_design_scores_gemma":[0.00013848997,0.00009182647,0.0017953067,0.000020853238,0.00013787046,0.00011845809,0.00007697365,0.59081733,0.0004149296,0.405568,0.0007779143,0.00004209968],"about_ca_topic_score_codex":0.0006262189,"about_ca_topic_score_gemma":0.0004989875,"teacher_disagreement_score":0.0068653054,"about_ca_system_score_codex":0.0010823527,"about_ca_system_score_gemma":0.00057132577,"threshold_uncertainty_score":0.036307633},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74340045,0.0014511945,0.22988321,0.0003425706,0.000047358335,0.000050440434,0.00048277728,0.00026019677,0.02408185],"genre_scores_gemma":[0.9663302,0.00044380693,0.03153327,0.000018879979,0.000055997873,0.000049396836,0.00018693336,0.00008245453,0.0012990433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942374,0.00021645869,0.000036203484,0.00011699632,0.0001530366,0.000053514268],"domain_scores_gemma":[0.99466574,0.0038963107,0.0005545281,0.00021298011,0.0003194604,0.00035093425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008707519,0.0005353446,0.0007846869,0.0011285761,0.00046719486,0.0018873967,0.00094918004,0.0005946916,0.0013760548],"category_scores_gemma":[0.009450697,0.00058335747,0.00031392818,0.0009099377,0.0016392212,0.0014934827,0.0012783087,0.00055740436,0.00022096696],"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.0013998903,0.00015628361,0.017525993,0.0005093006,0.000071985894,0.0008825832,0.0010228278,0.36254808,0.033325642,0.46568504,0.0036472154,0.11322527],"study_design_scores_gemma":[0.00007018057,0.00020146601,0.0065476373,0.00006132255,0.000037139915,0.0012737842,0.00042134957,0.7029902,0.012600415,0.2716491,0.004106312,0.000041167536],"about_ca_topic_score_codex":0.0002669216,"about_ca_topic_score_gemma":0.00020623892,"teacher_disagreement_score":0.0018873967,"about_ca_system_score_codex":0.00040443984,"about_ca_system_score_gemma":0.00023797857,"threshold_uncertainty_score":0.0046049953},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021003857,0.0006359834,0.96678334,0.0011409718,0.00010829925,0.000034969147,0.00009771658,0.00008867192,0.010106156],"genre_scores_gemma":[0.87367725,0.001467125,0.105651975,0.00022551701,0.00021880193,0.00014379877,0.00017004971,0.0001872862,0.018258106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924123,0.00041028953,0.000024051778,0.00011255058,0.00009941586,0.00011246056],"domain_scores_gemma":[0.9982223,0.0012376211,0.00014023029,0.00007829757,0.00022371284,0.000097872246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020113804,0.0010448741,0.002426353,0.0008616015,0.0006001101,0.0031765124,0.0014671583,0.0024234902,0.0040659765],"category_scores_gemma":[0.006198839,0.00096908555,0.0012455152,0.0016878102,0.0012698161,0.0030615763,0.0015388634,0.0034921418,0.00041667875],"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.000025926221,0.000024675166,0.0001455147,0.00003223267,0.000023783432,0.000027940714,0.00001557284,0.9552623,0.000107326625,0.03877777,0.00042264606,0.0051343446],"study_design_scores_gemma":[0.000005121829,0.0000074806,0.000029121487,0.000006813145,0.000008573818,0.00000662054,0.0000072839202,0.97653174,0.000049863414,0.023047267,0.00029513965,0.0000049730415],"about_ca_topic_score_codex":0.0063212374,"about_ca_topic_score_gemma":0.0044780993,"teacher_disagreement_score":0.0063212374,"about_ca_system_score_codex":0.0016900935,"about_ca_system_score_gemma":0.0020504186,"threshold_uncertainty_score":0.013602078},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65201956,0.0011722015,0.29228908,0.006317817,0.00011399891,0.00011530387,0.0002637027,0.00025753852,0.047450844],"genre_scores_gemma":[0.98458904,0.00070507766,0.008530342,0.0001835872,0.00009694139,0.000051707444,0.00008491897,0.000040765553,0.005717623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992291,0.0003043806,0.00003265675,0.00013057145,0.00010915325,0.00019426482],"domain_scores_gemma":[0.99120986,0.0063845883,0.0009890308,0.000331323,0.000609233,0.00047600552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027031745,0.00073324854,0.0026177943,0.001103354,0.0010959608,0.003856523,0.0014328572,0.002364245,0.0056592617],"category_scores_gemma":[0.017282797,0.0009677403,0.0014396631,0.0010006193,0.003957153,0.00588145,0.0024344574,0.0031158272,0.00037941095],"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.00009258522,0.000064597494,0.0006873427,0.000071414244,0.0000483201,0.0002450055,0.00020434619,0.041169085,0.0007152518,0.9527402,0.0009721225,0.0029896484],"study_design_scores_gemma":[0.00006551881,0.000024310237,0.0003870987,0.000015812095,0.000019336263,0.00008127413,0.00007847485,0.10935002,0.00014164798,0.8894675,0.00035413934,0.000014980873],"about_ca_topic_score_codex":0.004240121,"about_ca_topic_score_gemma":0.0026528363,"teacher_disagreement_score":0.0056592617,"about_ca_system_score_codex":0.0019088119,"about_ca_system_score_gemma":0.0021540483,"threshold_uncertainty_score":0.018932104},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020789201,0.00032950687,0.99401987,0.000181543,0.000043755907,0.00004374581,0.0000654413,0.00003854411,0.0031987256],"genre_scores_gemma":[0.42080963,0.0035548685,0.54322237,0.00034416854,0.0004821933,0.0012693517,0.00080446026,0.00039854881,0.029114401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991146,0.0003498399,0.000030660216,0.00021831614,0.00019484943,0.00009185586],"domain_scores_gemma":[0.9989254,0.00046880363,0.00020588496,0.00011193024,0.0002031935,0.00008480646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019373066,0.0014233204,0.0019589402,0.001439252,0.0006255577,0.0020107306,0.0031097666,0.0034348397,0.0057772053],"category_scores_gemma":[0.0036054165,0.0010759112,0.0017035892,0.001634051,0.0016656306,0.0026002775,0.0036977879,0.0027249244,0.0012126063],"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.000028282813,0.00007304979,0.00026731618,0.00013044795,0.000039086342,0.00006811009,0.0000443205,0.8709961,0.00094066444,0.10977799,0.0023231609,0.0153115215],"study_design_scores_gemma":[0.000005391963,0.000023226765,0.000053960604,0.0000129931,0.0000102474605,0.000025901398,0.000018570818,0.98050576,0.00023202423,0.017333917,0.0017672344,0.000010679112],"about_ca_topic_score_codex":0.004278605,"about_ca_topic_score_gemma":0.0022830605,"teacher_disagreement_score":0.0057772053,"about_ca_system_score_codex":0.0009943377,"about_ca_system_score_gemma":0.0020596755,"threshold_uncertainty_score":0.019326687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11844572,0.008143954,0.841276,0.0029103705,0.00041825545,0.00013250686,0.0011899023,0.0011324696,0.026350869],"genre_scores_gemma":[0.5430486,0.0046368497,0.43898177,0.0006096989,0.0006240265,0.0003375071,0.00213962,0.00079584855,0.0088260295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970386,0.0009336972,0.00014426197,0.000388896,0.0010979982,0.0003964939],"domain_scores_gemma":[0.97761744,0.017421206,0.0010706477,0.0019971894,0.0013229842,0.0005704752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003594622,0.0018526996,0.0017825468,0.0028343997,0.00091827754,0.003750167,0.0032438198,0.0022649977,0.008558893],"category_scores_gemma":[0.034219667,0.0011877228,0.00145923,0.0029168606,0.0018571925,0.0059671216,0.0029623653,0.004462625,0.0016923775],"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.0014784468,0.00023526045,0.0033086406,0.00076272123,0.00017924943,0.00017753558,0.000443877,0.7008406,0.008057522,0.14617491,0.012828002,0.12551318],"study_design_scores_gemma":[0.00004837216,0.00011328504,0.00071112474,0.00013154384,0.000058912297,0.00012462721,0.00011202526,0.8862791,0.0021362684,0.10691555,0.0033404718,0.000028652668],"about_ca_topic_score_codex":0.0016119665,"about_ca_topic_score_gemma":0.004552281,"teacher_disagreement_score":0.008558893,"about_ca_system_score_codex":0.003546301,"about_ca_system_score_gemma":0.0016499566,"threshold_uncertainty_score":0.028632343},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070103146,0.0011932248,0.98326045,0.0013764814,0.00022843614,0.0000710169,0.000296002,0.0008004663,0.005763687],"genre_scores_gemma":[0.5617525,0.0027239153,0.41787216,0.0017818725,0.0012309809,0.0006935959,0.0014638472,0.0010443383,0.011436815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99446,0.0018437511,0.00028264514,0.0005866113,0.0020957561,0.0007313129],"domain_scores_gemma":[0.9552486,0.030969923,0.0017020288,0.007843764,0.003264953,0.0009706917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007833762,0.002268783,0.002622909,0.0022419067,0.0017736371,0.0057162615,0.002879591,0.002030817,0.010721827],"category_scores_gemma":[0.04173475,0.0010278892,0.0015386898,0.0039674374,0.0032629147,0.007927246,0.0062895413,0.0066071064,0.001984078],"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.0005907909,0.00018990655,0.0010500571,0.00032709056,0.00014073329,0.00011650467,0.00022459259,0.45952618,0.0030488702,0.40608662,0.019728621,0.10896993],"study_design_scores_gemma":[0.000014589696,0.000035721638,0.00012005993,0.000036571542,0.00002289737,0.000028896278,0.000018651324,0.8530219,0.0014801492,0.14355701,0.0016489858,0.000014540094],"about_ca_topic_score_codex":0.00226237,"about_ca_topic_score_gemma":0.0030743743,"teacher_disagreement_score":0.010721827,"about_ca_system_score_codex":0.0027266406,"about_ca_system_score_gemma":0.0031284853,"threshold_uncertainty_score":0.0414294},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007416723,0.0004912413,0.98167634,0.0001581467,0.00008243821,0.000040361556,0.00005069913,0.00007724371,0.010006782],"genre_scores_gemma":[0.34342307,0.0018470816,0.6376642,0.00026162333,0.0002549377,0.00033767475,0.00030907273,0.00016195278,0.015740389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962723,0.000080953425,0.000017660894,0.000044419987,0.00018204657,0.000047698795],"domain_scores_gemma":[0.99943143,0.00031715518,0.00003743045,0.000053471264,0.00013555655,0.000024921623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007415313,0.0007354887,0.0011496498,0.0007308512,0.00048056516,0.0011764696,0.0012332588,0.0012458189,0.0047913296],"category_scores_gemma":[0.0028431057,0.00055513164,0.0006902066,0.0010969297,0.0006101775,0.0011200368,0.0011422585,0.0014927477,0.0005834945],"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.000032494914,0.00006742858,0.00021436176,0.000159221,0.00002670016,0.00007438182,0.00005456123,0.88718957,0.00096678524,0.056949563,0.0018015032,0.052463487],"study_design_scores_gemma":[0.0000059547438,0.000011142509,0.000034542663,0.000008346476,0.0000035475903,0.00001740798,0.000010661559,0.9831849,0.000112368914,0.01574713,0.0008608917,0.0000031639522],"about_ca_topic_score_codex":0.004210469,"about_ca_topic_score_gemma":0.004510546,"teacher_disagreement_score":0.0047913296,"about_ca_system_score_codex":0.00055076013,"about_ca_system_score_gemma":0.0012562549,"threshold_uncertainty_score":0.016028583},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030636268,0.0001825904,0.99197936,0.00023067131,0.000044484965,0.000010405269,0.000016419914,0.00013308525,0.0043393206],"genre_scores_gemma":[0.31511754,0.0011332752,0.6634849,0.00064202084,0.00020823754,0.0002239577,0.0002461677,0.0010180459,0.017925963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993643,0.00024462774,0.000030548872,0.000102589765,0.00020593141,0.000051976924],"domain_scores_gemma":[0.99902296,0.00045019266,0.00006313389,0.00018478115,0.00020211823,0.00007684137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018682247,0.0015492471,0.0019970255,0.00095253653,0.0005742405,0.0021652828,0.0012610615,0.0017691077,0.004112813],"category_scores_gemma":[0.005460308,0.001151722,0.000950499,0.001042456,0.0019805338,0.0027072139,0.0061210115,0.0036396317,0.0013408458],"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.00007708622,0.000061642975,0.00025257788,0.00015798218,0.00008085017,0.00005053538,0.00018968225,0.5311445,0.0023823443,0.37438744,0.0038199297,0.0873954],"study_design_scores_gemma":[0.000008822169,0.000027779322,0.00003149395,0.00002190781,0.00000991888,0.000019672432,0.00002557809,0.7894809,0.00040826574,0.20602757,0.0039300816,0.000007944826],"about_ca_topic_score_codex":0.0011238797,"about_ca_topic_score_gemma":0.0013526549,"teacher_disagreement_score":0.004112813,"about_ca_system_score_codex":0.0006976078,"about_ca_system_score_gemma":0.00081822084,"threshold_uncertainty_score":0.013758719},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019549593,0.0013963634,0.93945974,0.0010800338,0.00042686868,0.00003497068,0.000052891035,0.000060092156,0.037939433],"genre_scores_gemma":[0.68078965,0.002590475,0.2886542,0.00094290625,0.0011033666,0.00024508339,0.0001224406,0.00026700317,0.025284812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991437,0.00045939477,0.000045448778,0.0000969291,0.00019740712,0.000057079797],"domain_scores_gemma":[0.9987105,0.00079335645,0.00010152701,0.000119851065,0.00019175062,0.000082935556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025508944,0.0008306678,0.001174708,0.0015757678,0.00096797507,0.0026779529,0.0013496341,0.0009818255,0.003900647],"category_scores_gemma":[0.0050034807,0.0005807896,0.0013171003,0.0013978081,0.003965601,0.0058719814,0.0030935116,0.0038541516,0.0003897153],"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.000008709053,0.000009408347,0.000026438478,0.000018443588,0.0000058186292,0.000014055076,0.000040476745,0.002620378,0.00015674451,0.99404633,0.00029581794,0.0027574538],"study_design_scores_gemma":[0.0000043099863,0.0000072145726,0.000016919965,0.0000072881103,0.0000039117326,0.000015388225,0.000014384649,0.02641431,0.00008383106,0.9724501,0.0009778778,0.0000044092753],"about_ca_topic_score_codex":0.00078685686,"about_ca_topic_score_gemma":0.00075379485,"teacher_disagreement_score":0.003900647,"about_ca_system_score_codex":0.0010266887,"about_ca_system_score_gemma":0.0007942497,"threshold_uncertainty_score":0.013490617},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045872163,0.001185137,0.7473002,0.059786305,0.003972611,0.0001751022,0.00075982016,0.00042011062,0.14052853],"genre_scores_gemma":[0.6879573,0.0021482944,0.19174373,0.01452581,0.004389179,0.0006362682,0.0015999305,0.0010375374,0.09596199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984366,0.0007222876,0.00006940625,0.00020557002,0.0004312347,0.00013486626],"domain_scores_gemma":[0.98621225,0.010516451,0.00055876793,0.00053231686,0.0014639657,0.00071630516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047496674,0.0014550706,0.0013441318,0.0016778606,0.0016067029,0.0022535631,0.00279523,0.0041407244,0.022613881],"category_scores_gemma":[0.035002686,0.00046647576,0.0017789927,0.0011213485,0.0045264675,0.0045853285,0.0036623704,0.0052045933,0.0013247138],"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.00016500999,0.000032498065,0.00025152118,0.00018702805,0.000029626079,0.0003724907,0.00018342322,0.01721684,0.0012809994,0.9549018,0.01697747,0.008401412],"study_design_scores_gemma":[0.000062994855,0.000076096825,0.00028565677,0.000069549904,0.000011979002,0.00013197056,0.00014812259,0.07083602,0.0006877349,0.9180808,0.009580785,0.00002827217],"about_ca_topic_score_codex":0.0018078439,"about_ca_topic_score_gemma":0.0010814097,"teacher_disagreement_score":0.022613881,"about_ca_system_score_codex":0.0008256642,"about_ca_system_score_gemma":0.00061615446,"threshold_uncertainty_score":0.07565099},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046480242,0.0013134438,0.9421914,0.00024109354,0.000093939554,0.000051551855,0.000081184095,0.00016418118,0.009382929],"genre_scores_gemma":[0.5794023,0.0020293032,0.41153076,0.0001232697,0.00013349458,0.0001628416,0.00026090673,0.00045562538,0.0059015388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667054,0.0020281847,0.00017747909,0.00026199804,0.00075317227,0.00010862547],"domain_scores_gemma":[0.9836376,0.012690124,0.000583068,0.0013823764,0.001349497,0.0003574118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006574796,0.00075747987,0.0014800662,0.0024943382,0.0008175436,0.0033367802,0.0012700551,0.001438827,0.0048059905],"category_scores_gemma":[0.03233295,0.00059926504,0.0009060075,0.0029928589,0.002510951,0.004192488,0.0025102585,0.0016143895,0.0005844705],"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.00028915206,0.000055927703,0.0009827762,0.00014934807,0.000041799725,0.00003163211,0.0003051676,0.13578923,0.00066673197,0.7282936,0.0009465686,0.1324481],"study_design_scores_gemma":[0.000015556465,0.00009426034,0.00035953408,0.000058557558,0.000021635573,0.000052789706,0.00011209246,0.6325312,0.00048601345,0.36381158,0.0024285603,0.000028214636],"about_ca_topic_score_codex":0.0015091505,"about_ca_topic_score_gemma":0.0019028435,"teacher_disagreement_score":0.006574796,"about_ca_system_score_codex":0.0011785086,"about_ca_system_score_gemma":0.0010871963,"threshold_uncertainty_score":0.034771264},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028694605,0.00013454272,0.99516124,0.00007683733,0.000076002725,0.000020920992,0.000012596273,0.00007720099,0.001571236],"genre_scores_gemma":[0.12270837,0.000412424,0.86912906,0.00012665472,0.00013032023,0.00019622652,0.000056992667,0.00015222734,0.0070876926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941874,0.0002245775,0.00001934212,0.00005749762,0.00024414065,0.000035848883],"domain_scores_gemma":[0.9993167,0.00038554778,0.000039084785,0.00006344039,0.00014951472,0.00004572901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015632667,0.0008829209,0.0016285635,0.0007856858,0.00075469114,0.0010262291,0.0014585402,0.0019897362,0.0028969296],"category_scores_gemma":[0.0033069032,0.0005930269,0.00083363854,0.0009259683,0.0013790401,0.0010427431,0.001883557,0.0025500208,0.00051347836],"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.00015160373,0.00012582363,0.00023180766,0.00028495266,0.000075835385,0.00015446403,0.00018044059,0.727278,0.0054680947,0.13428,0.0028982244,0.12887068],"study_design_scores_gemma":[0.000010530713,0.000029542902,0.00002642162,0.000011539139,0.000008822258,0.000020522753,0.000008330075,0.9848726,0.00053006114,0.0126362955,0.0018380564,0.000007275882],"about_ca_topic_score_codex":0.0025048398,"about_ca_topic_score_gemma":0.002679781,"teacher_disagreement_score":0.0028969296,"about_ca_system_score_codex":0.0005152183,"about_ca_system_score_gemma":0.0013138852,"threshold_uncertainty_score":0.009691238},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07299293,0.00031897446,0.9187588,0.00015825569,0.00003332509,0.000095202624,0.00005512034,0.00026838886,0.0073190583],"genre_scores_gemma":[0.7724019,0.0004217414,0.22109075,0.000056969304,0.000038039965,0.00024454793,0.00013954227,0.00029894922,0.005307435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973935,0.00013254613,0.000011070636,0.00003065441,0.000065302156,0.000021035281],"domain_scores_gemma":[0.99919766,0.00045704076,0.00004670081,0.000038988033,0.00024230544,0.000017346763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080388587,0.00050891656,0.0006803228,0.0005374608,0.00048866856,0.0007397781,0.00045398367,0.000751846,0.0017715076],"category_scores_gemma":[0.0021632274,0.0003161803,0.00063152774,0.00045100937,0.00034728687,0.0005288286,0.00040610015,0.0006468324,0.0002485349],"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.000049968512,0.00004833084,0.00050054886,0.00007758733,0.00001853768,0.000024769091,0.00003288715,0.95798993,0.004819706,0.0037468064,0.00037118734,0.032319725],"study_design_scores_gemma":[0.0000028846578,0.000014540336,0.00014466952,0.0000030237989,0.0000027228743,0.000004936934,0.0000049047876,0.99850696,0.0009000052,0.00024641404,0.00016628398,0.000002571066],"about_ca_topic_score_codex":0.0061518694,"about_ca_topic_score_gemma":0.0031993005,"teacher_disagreement_score":0.0061518694,"about_ca_system_score_codex":0.000546365,"about_ca_system_score_gemma":0.0011722969,"threshold_uncertainty_score":0.012232065},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047764365,0.0016655326,0.93677163,0.001915896,0.00017556526,0.000061391045,0.00013493406,0.00018153156,0.011329283],"genre_scores_gemma":[0.6887246,0.0034274731,0.2467386,0.0013189742,0.0007659084,0.00048993895,0.00089921657,0.00083120767,0.05680406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838424,0.0008073807,0.000091035945,0.00018770507,0.00041147263,0.00011824397],"domain_scores_gemma":[0.9932266,0.004250988,0.00046855054,0.00047363804,0.0009831742,0.00059701584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056871637,0.0015096642,0.0019365776,0.0019344102,0.00089194777,0.0028281142,0.0017777922,0.0026214486,0.002532991],"category_scores_gemma":[0.013415828,0.00096137734,0.0011621945,0.0013281128,0.0032670856,0.0036533284,0.003739479,0.0052366923,0.00044734613],"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.00018091919,0.00014052748,0.0005022869,0.00027548047,0.00007802318,0.00017275056,0.00028654293,0.10425344,0.00953769,0.8524627,0.0037898864,0.028319724],"study_design_scores_gemma":[0.000016398448,0.000053571075,0.00024576887,0.000036595553,0.000011247907,0.00006651311,0.00003794222,0.5407525,0.00073962257,0.4559911,0.0020302248,0.000018428202],"about_ca_topic_score_codex":0.002743229,"about_ca_topic_score_gemma":0.0022648985,"teacher_disagreement_score":0.0056871637,"about_ca_system_score_codex":0.0026109247,"about_ca_system_score_gemma":0.001768467,"threshold_uncertainty_score":0.030076921},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029525418,0.0020466042,0.9202509,0.0025071073,0.00043233804,0.00008933609,0.00022910749,0.00018255282,0.04473667],"genre_scores_gemma":[0.8225215,0.004152782,0.099774465,0.0015136226,0.0015496707,0.00066171767,0.0007800777,0.0009467113,0.068099365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990859,0.00035670752,0.000042917756,0.00015572678,0.0002659626,0.000092838876],"domain_scores_gemma":[0.9957021,0.0023269285,0.0002685986,0.0001675788,0.0012787553,0.00025604258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029925643,0.0021583503,0.0014038694,0.0023869413,0.0012599552,0.0024771057,0.0015263378,0.0015655309,0.008012009],"category_scores_gemma":[0.0077531743,0.00065410003,0.0015623665,0.00097555306,0.002774532,0.003757437,0.0041647707,0.004278499,0.0012212029],"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.00018708575,0.000059892995,0.0005168673,0.00024207508,0.00012578169,0.00014417408,0.00030162925,0.05958008,0.01166584,0.89544666,0.0056246375,0.026105288],"study_design_scores_gemma":[0.00002648042,0.000104995306,0.00032920504,0.00005193364,0.000039783074,0.00008249787,0.000103011465,0.45050797,0.0021962016,0.5419675,0.004555294,0.00003508989],"about_ca_topic_score_codex":0.0018907621,"about_ca_topic_score_gemma":0.0011656393,"teacher_disagreement_score":0.008012009,"about_ca_system_score_codex":0.001283882,"about_ca_system_score_gemma":0.0013809103,"threshold_uncertainty_score":0.026802778},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039056984,0.00010073241,0.99450207,0.00012602484,0.00006348758,0.000066034845,0.00004336283,0.00015629931,0.0010363334],"genre_scores_gemma":[0.07345555,0.00014758168,0.92183214,0.00014429184,0.000097461285,0.00030639215,0.00031955537,0.00022473987,0.0034722688],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988858,0.0004319688,0.000069807706,0.0001831237,0.00034344505,0.000085901476],"domain_scores_gemma":[0.9981351,0.0009399942,0.000059630805,0.00023553692,0.0004560558,0.00017364885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027587581,0.0012728815,0.001973591,0.00075194315,0.00066769175,0.0014622806,0.0028085716,0.0021178145,0.008982886],"category_scores_gemma":[0.005600312,0.0012714742,0.0013786363,0.0010101045,0.0011899809,0.0023870787,0.0040118992,0.005189573,0.0015057542],"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.00077676226,0.00048388174,0.00075782416,0.00048983097,0.00023367537,0.00019415427,0.00032109415,0.41095653,0.013906,0.14886077,0.010508645,0.4125108],"study_design_scores_gemma":[0.000042739703,0.000059067308,0.000046757643,0.000014185768,0.000008757537,0.000024110632,0.000013074451,0.98213863,0.0006816144,0.01598565,0.0009779503,0.0000075053695],"about_ca_topic_score_codex":0.0025119702,"about_ca_topic_score_gemma":0.0028041773,"teacher_disagreement_score":0.008982886,"about_ca_system_score_codex":0.0007469901,"about_ca_system_score_gemma":0.0022825936,"threshold_uncertainty_score":0.030050755},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033568893,0.00014532809,0.9631083,0.00013206604,0.00003941754,0.00006195492,0.00008608375,0.0005707177,0.002287192],"genre_scores_gemma":[0.37113777,0.000115665265,0.62479156,0.000054369757,0.000041637788,0.00022593136,0.00029539736,0.00016261994,0.0031750111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903834,0.00020259782,0.000041433414,0.0002462698,0.0003519956,0.00011935115],"domain_scores_gemma":[0.99835193,0.00084756414,0.00016523735,0.00021503301,0.0003117507,0.00010861361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008403507,0.00097101304,0.0016896294,0.0021933643,0.00079076184,0.001310416,0.0017233931,0.0024763225,0.004975868],"category_scores_gemma":[0.005647219,0.0008612859,0.0009643334,0.0017292104,0.000867778,0.0020393613,0.0030481422,0.0010178486,0.0011775246],"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.00096533063,0.00020817415,0.0033586859,0.00027137736,0.00011486387,0.00047650764,0.00033681226,0.6414464,0.020008676,0.023285802,0.0057552094,0.30377212],"study_design_scores_gemma":[0.000027415572,0.00014111002,0.0002054116,0.000014481643,0.000013356059,0.00011252052,0.00007157077,0.9865726,0.004591087,0.006846156,0.0013897889,0.000014399234],"about_ca_topic_score_codex":0.001460463,"about_ca_topic_score_gemma":0.0012908488,"teacher_disagreement_score":0.004975868,"about_ca_system_score_codex":0.00080421544,"about_ca_system_score_gemma":0.0008973932,"threshold_uncertainty_score":0.016645908},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028944956,0.00048757726,0.9646894,0.0003152722,0.00011989847,0.00011759478,0.00006199594,0.0018611966,0.0034021826],"genre_scores_gemma":[0.20331356,0.00016846658,0.792113,0.00017300213,0.00006288914,0.00025159758,0.0003264468,0.0004856937,0.0031054365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844426,0.0006024272,0.0000865721,0.0001981075,0.00051718333,0.00015150425],"domain_scores_gemma":[0.9944811,0.003788176,0.0001655106,0.00022190703,0.0011713748,0.00017193875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028576301,0.0015356423,0.001970224,0.0011634378,0.0008486543,0.0015978226,0.002185021,0.002584829,0.007975282],"category_scores_gemma":[0.011829892,0.0006815682,0.00091836817,0.0011782241,0.00085281,0.001822614,0.0014330224,0.0016660928,0.0019149429],"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.0005508565,0.00015457429,0.00064425427,0.00013619683,0.00008709102,0.000036153335,0.000056633446,0.8071999,0.0030026438,0.004026029,0.0029963935,0.18110923],"study_design_scores_gemma":[0.000017772285,0.000027091359,0.00005734404,0.0000030645544,0.000005746807,0.0000057097955,0.0000075623675,0.99885225,0.00040770575,0.000493233,0.00011937627,0.0000031135623],"about_ca_topic_score_codex":0.01158436,"about_ca_topic_score_gemma":0.014235817,"teacher_disagreement_score":0.01158436,"about_ca_system_score_codex":0.0018093737,"about_ca_system_score_gemma":0.0037492125,"threshold_uncertainty_score":0.026679993},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12243305,0.0012910469,0.83027565,0.0011927331,0.0007031826,0.00018658265,0.00045112052,0.0007203072,0.04274632],"genre_scores_gemma":[0.7959325,0.0016910966,0.18186273,0.0008593831,0.0003908979,0.00032501813,0.00085162587,0.00063832145,0.017448401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895537,0.00031305433,0.00006348147,0.00019604719,0.00023786908,0.00023421297],"domain_scores_gemma":[0.9934642,0.004089548,0.00054903893,0.0006616398,0.0008612038,0.0003743165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001562162,0.0014846241,0.0013278921,0.0011711373,0.0008472912,0.0013619998,0.0010289768,0.0017105687,0.012858335],"category_scores_gemma":[0.014537757,0.0007021169,0.0006439335,0.0017552034,0.0015496499,0.0032700577,0.0013149388,0.001757244,0.0010561836],"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.0007980189,0.00019669624,0.0007340538,0.0003453595,0.000074035124,0.00011845005,0.0001420956,0.48780715,0.0049149236,0.39201373,0.011911183,0.100944266],"study_design_scores_gemma":[0.000079852216,0.00028262858,0.0003989227,0.00007488491,0.000038039398,0.00013317901,0.0000698844,0.5708975,0.0025776918,0.42128333,0.0041315206,0.000032610005],"about_ca_topic_score_codex":0.0011089393,"about_ca_topic_score_gemma":0.0016018722,"teacher_disagreement_score":0.012858335,"about_ca_system_score_codex":0.0006920317,"about_ca_system_score_gemma":0.0021550027,"threshold_uncertainty_score":0.04301542},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023629826,0.00012960998,0.9952852,0.00010825426,0.00006160094,0.000066026994,0.00006196384,0.0008172509,0.0011072394],"genre_scores_gemma":[0.036422934,0.00009291076,0.9594899,0.00010625729,0.00006084312,0.00022609583,0.00035200754,0.00027278918,0.0029762567],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823356,0.00047800734,0.00011970498,0.00039974693,0.00063130737,0.00013770616],"domain_scores_gemma":[0.99818134,0.000697353,0.00010829493,0.00039651946,0.0005040192,0.000112511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017466473,0.0015517878,0.0020240692,0.0016999106,0.001994764,0.0018781448,0.0037572235,0.002556913,0.008198697],"category_scores_gemma":[0.0061856867,0.0011019506,0.0013555256,0.0022704438,0.0011520265,0.003003686,0.0043488415,0.0023836235,0.0044522732],"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.00063969125,0.00019278162,0.0005029016,0.00026288227,0.0001397244,0.000102165104,0.00025842956,0.18327475,0.010293711,0.05210717,0.018815666,0.7334101],"study_design_scores_gemma":[0.000091899004,0.00007187677,0.00023114888,0.000026040234,0.000028114726,0.00012442487,0.00006576299,0.92909086,0.004551529,0.05877347,0.006909534,0.000035409448],"about_ca_topic_score_codex":0.0028441765,"about_ca_topic_score_gemma":0.0049598985,"teacher_disagreement_score":0.008198697,"about_ca_system_score_codex":0.0013241671,"about_ca_system_score_gemma":0.0024459043,"threshold_uncertainty_score":0.027427435},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035200047,0.00019950651,0.9915455,0.000301755,0.0001250379,0.000029756657,0.000045162204,0.0003032182,0.003930004],"genre_scores_gemma":[0.15124013,0.00036103753,0.8423056,0.000313953,0.00018556124,0.00027236977,0.00023055708,0.00046000292,0.0046308734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904853,0.0004795235,0.000030176428,0.00007275437,0.00027734964,0.00009163552],"domain_scores_gemma":[0.9981536,0.001117372,0.00009371151,0.0002187532,0.0003031349,0.000113273345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016455929,0.0010160388,0.0011027319,0.0006095547,0.00060511526,0.0013740695,0.0013940816,0.0012294165,0.008430027],"category_scores_gemma":[0.00737808,0.00051195646,0.00048354268,0.0009957587,0.0011444325,0.0014175004,0.0016350057,0.003506058,0.0022225163],"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.00044196556,0.00022265174,0.0003218132,0.00028212208,0.00005018503,0.00010386171,0.00011762027,0.7054994,0.0046168603,0.111642785,0.012885173,0.16381559],"study_design_scores_gemma":[0.000027023878,0.000025829315,0.000021457941,0.000010761429,0.0000035099486,0.000009482123,0.00001215794,0.98040456,0.0004270485,0.01766742,0.0013859165,0.0000049083883],"about_ca_topic_score_codex":0.004039025,"about_ca_topic_score_gemma":0.0058640847,"teacher_disagreement_score":0.008430027,"about_ca_system_score_codex":0.00061955076,"about_ca_system_score_gemma":0.0017472229,"threshold_uncertainty_score":0.028201282},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004301213,0.0005375509,0.9907951,0.00086332014,0.00006862178,0.00009296159,0.00022470001,0.00007251693,0.003044108],"genre_scores_gemma":[0.18359903,0.0052452297,0.79050153,0.002077133,0.0011901496,0.0019469603,0.0019387206,0.0016635882,0.011837642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.981886,0.011736353,0.000861106,0.0020023338,0.002787074,0.0007270277],"domain_scores_gemma":[0.7894416,0.1874295,0.0049644317,0.008021142,0.008737146,0.001406232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03117651,0.0035992088,0.0042557325,0.0031373296,0.0024038944,0.004816735,0.005441933,0.003599828,0.0076015186],"category_scores_gemma":[0.13392499,0.002895386,0.0047712154,0.004217572,0.010051358,0.012496412,0.0067368457,0.011978642,0.0022274335],"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.00027583473,0.00013330496,0.0014959627,0.0005622072,0.00026906678,0.00076206547,0.0006558929,0.10856603,0.0031332555,0.8304025,0.008985447,0.0447584],"study_design_scores_gemma":[0.000043016807,0.00012766359,0.0007540392,0.00015079675,0.00009775992,0.00050303375,0.00012178631,0.35355926,0.0019602983,0.63838714,0.004190873,0.00010431937],"about_ca_topic_score_codex":0.004323602,"about_ca_topic_score_gemma":0.0038532636,"teacher_disagreement_score":0.03117651,"about_ca_system_score_codex":0.0029028293,"about_ca_system_score_gemma":0.005853098,"threshold_uncertainty_score":0.16487908},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09209937,0.00083776173,0.87162024,0.0019681067,0.00024409081,0.00020226288,0.00019593186,0.0001787478,0.03265354],"genre_scores_gemma":[0.93384737,0.0006070529,0.04038029,0.00033691083,0.00021194562,0.00022754476,0.000067035406,0.00009208557,0.024229791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999121,0.00043336756,0.000025710444,0.0001437804,0.0001377429,0.00013840523],"domain_scores_gemma":[0.99682814,0.0020724325,0.00035560035,0.00016568744,0.00034008658,0.0002381239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021471188,0.0016527215,0.003115894,0.0011604832,0.00076405203,0.0029912272,0.0034001009,0.0038156067,0.0060162656],"category_scores_gemma":[0.006843693,0.0014418509,0.0016219598,0.0008577617,0.0024346819,0.0035843705,0.002443532,0.0026262903,0.00032398177],"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.00010356804,0.00014149459,0.0003305065,0.00012846275,0.000108640066,0.0002190126,0.000060573617,0.8671577,0.0011543249,0.12504521,0.0012694704,0.0042809914],"study_design_scores_gemma":[0.000027399872,0.000031414977,0.00007123944,0.0000060831926,0.000024054998,0.000017396018,0.000013838412,0.9743493,0.00009138283,0.025119027,0.00023698268,0.0000117587515],"about_ca_topic_score_codex":0.005013592,"about_ca_topic_score_gemma":0.0036272628,"teacher_disagreement_score":0.0060162656,"about_ca_system_score_codex":0.0020051512,"about_ca_system_score_gemma":0.001991515,"threshold_uncertainty_score":0.020126402},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008097886,0.0069435723,0.9875563,0.00027145352,0.000120254525,0.000077623576,0.000060730144,0.0003822264,0.0037780793],"genre_scores_gemma":[0.039644748,0.019852713,0.93358326,0.00032596177,0.00044528267,0.00063874555,0.00040349754,0.00057393836,0.0045317654],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996443,0.0010356234,0.0003063528,0.00044192618,0.0016492235,0.00012385695],"domain_scores_gemma":[0.997472,0.0011540542,0.00018106894,0.0005317055,0.0005969719,0.00006422179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003971481,0.002490816,0.0037346217,0.004114278,0.00081554824,0.0037797436,0.003399676,0.0028305438,0.0038835946],"category_scores_gemma":[0.006563186,0.001294294,0.0034307856,0.0054770485,0.0017119168,0.0036338505,0.0026382543,0.0042674053,0.0026103896],"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.00007366251,0.0001465707,0.0008011771,0.0018566665,0.00025394437,0.00010341215,0.00026191623,0.16009627,0.006364935,0.33135206,0.008934222,0.48975518],"study_design_scores_gemma":[0.000043689593,0.0002894021,0.0006460665,0.0005405967,0.00009939956,0.00033395475,0.00010453906,0.6537436,0.004136764,0.26191863,0.07798925,0.00015403103],"about_ca_topic_score_codex":0.0007798282,"about_ca_topic_score_gemma":0.0007620844,"teacher_disagreement_score":0.004114278,"about_ca_system_score_codex":0.0006656382,"about_ca_system_score_gemma":0.00093846157,"threshold_uncertainty_score":0.021003485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2048132,0.002450762,0.74229276,0.0031496093,0.00036144382,0.000055963043,0.00021797852,0.00015996346,0.046498287],"genre_scores_gemma":[0.8970209,0.0017536094,0.06477607,0.00030605576,0.0005197066,0.00007625145,0.00017738463,0.00026663832,0.035103444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996896,0.00012682776,0.0000086975,0.000042301464,0.000081060374,0.000051579776],"domain_scores_gemma":[0.99913836,0.00035271756,0.00011386796,0.0000551199,0.00018398427,0.00015587597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011909911,0.0007241246,0.0009367602,0.0014444751,0.0010911729,0.0018585861,0.0013220136,0.0012140133,0.0039170166],"category_scores_gemma":[0.0034833646,0.00045729172,0.00080557104,0.0007776401,0.0023893837,0.002400713,0.0020752717,0.00204084,0.00046460237],"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.000011521182,0.000011235764,0.00013578424,0.000019347288,0.0000072598705,0.00002465931,0.000051271152,0.0108695,0.0007614039,0.98505753,0.0005980418,0.0024523372],"study_design_scores_gemma":[0.00000824693,0.000017018883,0.00021177485,0.000012449239,0.0000049155983,0.00003153843,0.000045128487,0.20884942,0.00017631671,0.7891135,0.0015163914,0.000013295997],"about_ca_topic_score_codex":0.0053067403,"about_ca_topic_score_gemma":0.0042840503,"teacher_disagreement_score":0.0053067403,"about_ca_system_score_codex":0.002099712,"about_ca_system_score_gemma":0.0016553608,"threshold_uncertainty_score":0.01523453},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017109675,0.00033454451,0.9788361,0.00020916651,0.00004437023,0.000053562788,0.00006911513,0.00040549145,0.0029379253],"genre_scores_gemma":[0.53583556,0.00032814464,0.4540847,0.00024266753,0.00007580751,0.00042243095,0.00036374334,0.00022521165,0.00842169],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995166,0.0001725322,0.000021021311,0.00010321221,0.00009616702,0.0000905328],"domain_scores_gemma":[0.9986148,0.0009242341,0.00010720562,0.000073881805,0.00019208218,0.00008771004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012517864,0.0006865328,0.0017909681,0.0008214156,0.00054614374,0.0008636486,0.0020781711,0.0014030634,0.0057192547],"category_scores_gemma":[0.0031082148,0.0005913523,0.00069579587,0.0011153283,0.00071842916,0.0013914633,0.0015839224,0.0013828278,0.000559545],"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.00015483978,0.00011105059,0.00032459697,0.00012347107,0.000038261114,0.000048469694,0.000045909223,0.93717015,0.0007953256,0.012085058,0.0030515478,0.046051368],"study_design_scores_gemma":[0.000022210192,0.000026756286,0.000035825047,0.000005021344,0.0000046639166,0.000008471834,0.000006917695,0.99768424,0.000106132335,0.0019321538,0.00016474305,0.0000028098264],"about_ca_topic_score_codex":0.008000787,"about_ca_topic_score_gemma":0.006279619,"teacher_disagreement_score":0.008000787,"about_ca_system_score_codex":0.0009548572,"about_ca_system_score_gemma":0.0018848743,"threshold_uncertainty_score":0.019132793},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050763628,0.00044438965,0.99181914,0.00020873582,0.00004215186,0.000017440156,0.000039244766,0.000087036606,0.0022654298],"genre_scores_gemma":[0.5425694,0.0014710467,0.44432792,0.00029973625,0.00029181497,0.0003528171,0.00063314714,0.0003440159,0.0097101405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988121,0.00056834676,0.00004575642,0.00015426498,0.0003072953,0.000112325135],"domain_scores_gemma":[0.99675983,0.0023284296,0.0002684182,0.00016290823,0.00037233494,0.00010800198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031252154,0.0013750907,0.0023153024,0.0010581667,0.00034426176,0.0018080325,0.001551254,0.0019060784,0.0033060058],"category_scores_gemma":[0.009608589,0.00077534077,0.0011836839,0.0010119447,0.0010345352,0.0015367606,0.0017705475,0.0021572043,0.00054025766],"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.00005479317,0.000027383956,0.00019866823,0.000090227586,0.00005579602,0.000044411212,0.000022643218,0.9588389,0.0004855927,0.028046858,0.0011517059,0.010983065],"study_design_scores_gemma":[0.0000032177745,0.0000063585435,0.000020904332,0.0000049065293,0.000004310065,0.000005330449,0.0000015335085,0.99609524,0.00004868191,0.0036606707,0.0001467352,0.000002114821],"about_ca_topic_score_codex":0.0056548547,"about_ca_topic_score_gemma":0.0026421114,"teacher_disagreement_score":0.0056548547,"about_ca_system_score_codex":0.0010852286,"about_ca_system_score_gemma":0.0015190019,"threshold_uncertainty_score":0.01652795},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4298459,0.0008251693,0.4268016,0.0012151602,0.00033313953,0.00007881533,0.00048669,0.00066216075,0.13975139],"genre_scores_gemma":[0.95529425,0.00038154048,0.030232515,0.00025620864,0.00018059101,0.00005993811,0.00023385596,0.0002397682,0.013121197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934965,0.00014920598,0.000017788056,0.00012008604,0.00021060629,0.00015262271],"domain_scores_gemma":[0.99936265,0.00018225821,0.000112295565,0.00009607869,0.00008923898,0.0001574024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064032036,0.00065376353,0.00089108595,0.001554994,0.0014325189,0.0021119888,0.0014650347,0.0011608236,0.010879151],"category_scores_gemma":[0.002003505,0.00050850585,0.0007542817,0.00065945624,0.0026817431,0.0021449917,0.0028912593,0.0018997767,0.0010769223],"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.000027369691,0.000017236152,0.00008052043,0.000018862416,0.0000062313684,0.000021362404,0.000049616763,0.010671622,0.0011071503,0.9824243,0.00077202154,0.0048036845],"study_design_scores_gemma":[0.000012834482,0.000037525864,0.00020621483,0.000015408916,0.000005686133,0.000043617747,0.00007887802,0.047779903,0.00041001095,0.9487797,0.002611044,0.000019081821],"about_ca_topic_score_codex":0.0016545982,"about_ca_topic_score_gemma":0.0024058656,"teacher_disagreement_score":0.010879151,"about_ca_system_score_codex":0.0008395195,"about_ca_system_score_gemma":0.00077763054,"threshold_uncertainty_score":0.036394417},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009174716,0.000121706,0.9977609,0.00004030395,0.00007465567,0.000011880309,0.000023269391,0.00006173321,0.0009880582],"genre_scores_gemma":[0.026705325,0.00032576808,0.9662796,0.00009889894,0.000112094436,0.00011491564,0.0001473122,0.00037068344,0.00584533],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995222,0.000170324,0.000027130867,0.00007166338,0.0001697629,0.00003889202],"domain_scores_gemma":[0.9991522,0.00040730677,0.000037345086,0.00011536968,0.00021289095,0.000074878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011167161,0.0012135429,0.0011205273,0.0009338457,0.00052840204,0.00075505185,0.0011023218,0.0012524275,0.006358317],"category_scores_gemma":[0.00260244,0.0007144269,0.0014759395,0.0009253518,0.0007992191,0.0014056253,0.0020255395,0.0030464253,0.0023541779],"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.00027803323,0.0002389997,0.00041238376,0.0005011567,0.0001327367,0.000162789,0.00019500298,0.16063148,0.030288758,0.22615784,0.019896442,0.5611044],"study_design_scores_gemma":[0.000029345507,0.00006514821,0.00012421055,0.00003369308,0.00003315674,0.00009353719,0.000022670394,0.92824,0.0024758587,0.057773788,0.011088471,0.00002009708],"about_ca_topic_score_codex":0.0012746127,"about_ca_topic_score_gemma":0.0019349322,"teacher_disagreement_score":0.006358317,"about_ca_system_score_codex":0.00033642864,"about_ca_system_score_gemma":0.00071624364,"threshold_uncertainty_score":0.021270692},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024934611,0.00019854016,0.99245065,0.00040358948,0.00003393669,0.000053797972,0.00003753892,0.00006088922,0.004267524],"genre_scores_gemma":[0.22581048,0.0011365094,0.75398713,0.00048727062,0.0003505394,0.0010372143,0.00027648432,0.00024716364,0.016667219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761593,0.0013464096,0.000095054726,0.00026409,0.00052415143,0.00015445099],"domain_scores_gemma":[0.9910136,0.0075731124,0.0002893194,0.0002291334,0.00072547904,0.0001693505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005773939,0.001856277,0.00313621,0.0030879562,0.0016525931,0.0031779518,0.0036153242,0.0038865895,0.009240688],"category_scores_gemma":[0.023406113,0.0021316055,0.0018533125,0.0028961569,0.0027733173,0.005179546,0.0035883358,0.003635106,0.0012023544],"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.00006596505,0.00013157958,0.00039716242,0.00014678456,0.00011654971,0.000046974394,0.000116128205,0.61520976,0.000340839,0.34173056,0.0036030654,0.038094673],"study_design_scores_gemma":[0.000024582594,0.000014330506,0.000044963832,0.000027426508,0.000018199442,0.000008910114,0.000013079246,0.9048113,0.00008446622,0.0943205,0.0006209638,0.00001115529],"about_ca_topic_score_codex":0.009825086,"about_ca_topic_score_gemma":0.010621212,"teacher_disagreement_score":0.009825086,"about_ca_system_score_codex":0.002708132,"about_ca_system_score_gemma":0.003752088,"threshold_uncertainty_score":0.030913174},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004659628,0.00023229318,0.9872227,0.00035941854,0.00004014361,0.000021125366,0.00003171263,0.00006764876,0.007365427],"genre_scores_gemma":[0.74408054,0.00089502527,0.23799421,0.00034652735,0.00053049106,0.00029862113,0.00013841774,0.00027853658,0.015437569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967609,0.0019686057,0.000106834064,0.00029834444,0.00066949445,0.00019591],"domain_scores_gemma":[0.9910295,0.0073190564,0.00032337153,0.000568529,0.0005262411,0.00023333599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043781567,0.0012592222,0.0015250042,0.0017538404,0.00067125453,0.0027260906,0.0029432143,0.0017004408,0.008598138],"category_scores_gemma":[0.014154875,0.00089731073,0.0023720958,0.0013246173,0.0031512144,0.004338747,0.0038678509,0.00333922,0.00065079326],"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.0000462613,0.00006986634,0.00023540434,0.000079638114,0.00007800943,0.000108035376,0.0001151911,0.20210806,0.0007737781,0.78080446,0.00115586,0.0144253755],"study_design_scores_gemma":[0.000011191249,0.000035038272,0.00009515194,0.000014530186,0.000020206377,0.00002092612,0.000014909796,0.68384695,0.00026352124,0.31477767,0.0008841398,0.000015822126],"about_ca_topic_score_codex":0.0016433704,"about_ca_topic_score_gemma":0.0011770765,"teacher_disagreement_score":0.008598138,"about_ca_system_score_codex":0.0019286742,"about_ca_system_score_gemma":0.00094728597,"threshold_uncertainty_score":0.028763652},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11595551,0.0012963964,0.8675556,0.0005235208,0.00031905004,0.00009424197,0.00014271945,0.0009177659,0.013195145],"genre_scores_gemma":[0.7611938,0.00054769183,0.23116226,0.00010517222,0.00008867562,0.00014805798,0.000109382774,0.0010225126,0.0056223874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967325,0.000121965204,0.0000199898,0.000029995997,0.00011961827,0.00003514896],"domain_scores_gemma":[0.9989705,0.0005973638,0.0001497454,0.00007062256,0.00016785154,0.000043977565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009921064,0.00084611936,0.0006805644,0.0005816835,0.0004411049,0.0007691709,0.00064033555,0.00085931894,0.0024617547],"category_scores_gemma":[0.0041642073,0.00069283776,0.0005708598,0.0006473304,0.0002963103,0.0013655436,0.0006796988,0.0010157349,0.00030363674],"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.000055313358,0.000029600134,0.00024346213,0.000028424585,0.0000131588395,0.000012884661,0.000020960793,0.9818017,0.0015189649,0.0016511667,0.00021768615,0.014406742],"study_design_scores_gemma":[0.000007418148,0.000041243253,0.00017036962,0.0000062951244,0.000015630842,0.000009605915,0.0000072958524,0.9961951,0.0017789089,0.00093040214,0.0008313286,0.0000064691194],"about_ca_topic_score_codex":0.0029777975,"about_ca_topic_score_gemma":0.0035528585,"teacher_disagreement_score":0.0029777975,"about_ca_system_score_codex":0.0008592412,"about_ca_system_score_gemma":0.0013562365,"threshold_uncertainty_score":0.008235395},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0150006,0.00023482055,0.9827916,0.00012393059,0.00011588619,0.0000398974,0.00003497046,0.000120352,0.0015380036],"genre_scores_gemma":[0.51324445,0.00044553677,0.47983456,0.00018789174,0.00016475697,0.00032869368,0.00024123682,0.00038616025,0.005166762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890673,0.00040474624,0.00007858136,0.00009079981,0.0004443187,0.000074826065],"domain_scores_gemma":[0.9944291,0.003450783,0.00028628396,0.00068456307,0.00093801867,0.00021121197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003764294,0.00082284457,0.0013108467,0.00090957753,0.0006843996,0.0013056644,0.0017705754,0.0020697962,0.0015317001],"category_scores_gemma":[0.014838876,0.00062586664,0.00075156416,0.0006386239,0.001070233,0.001883581,0.0026572784,0.0018657534,0.0003080184],"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.00007292684,0.000046855985,0.0004680398,0.000051954703,0.000025541498,0.000025284431,0.000046335896,0.957311,0.0012216986,0.020829681,0.0004963854,0.019404339],"study_design_scores_gemma":[0.0000021703702,0.000007810028,0.000020543019,0.0000028790266,0.0000018879715,0.0000027905442,0.0000019520678,0.9974269,0.00017621492,0.0022607627,0.00009396292,0.0000019530137],"about_ca_topic_score_codex":0.0037066436,"about_ca_topic_score_gemma":0.0042498847,"teacher_disagreement_score":0.003764294,"about_ca_system_score_codex":0.000923852,"about_ca_system_score_gemma":0.0012339818,"threshold_uncertainty_score":0.019907713},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11735546,0.00091141055,0.8673893,0.0017922238,0.000079290694,0.00018629344,0.00037199308,0.00034190578,0.011572095],"genre_scores_gemma":[0.9224389,0.00095311936,0.06928142,0.00034433388,0.00014884915,0.00029561875,0.00033619432,0.00018477942,0.0060166023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934837,0.002987837,0.00033824454,0.0010071355,0.0010779803,0.0011051088],"domain_scores_gemma":[0.936322,0.05134912,0.0040668203,0.0045058522,0.0019629293,0.0017933456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013689891,0.0025871329,0.006348802,0.0030312496,0.001491165,0.008200919,0.0054058307,0.00388467,0.006559512],"category_scores_gemma":[0.07741693,0.0016830916,0.0026326904,0.002978085,0.00642356,0.014708001,0.0058793603,0.0069448478,0.00072283775],"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.0005396241,0.00025676953,0.0008766435,0.00034266626,0.00017213686,0.00017617714,0.00024893292,0.21990414,0.0011721639,0.7606007,0.0018560985,0.013853971],"study_design_scores_gemma":[0.00008748658,0.00005332099,0.00013816281,0.00004107568,0.000035987894,0.00007101602,0.00005403175,0.33590558,0.00043551752,0.6628405,0.00031439785,0.00002283746],"about_ca_topic_score_codex":0.0014580284,"about_ca_topic_score_gemma":0.00082714896,"teacher_disagreement_score":0.013689891,"about_ca_system_score_codex":0.0035103876,"about_ca_system_score_gemma":0.00395795,"threshold_uncertainty_score":0.072399914},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00391498,0.000055088287,0.9947083,0.00012006459,0.000023999068,0.000020077363,0.000053122934,0.00013714095,0.0009671643],"genre_scores_gemma":[0.12353359,0.00030402545,0.86811113,0.000119778066,0.00008611548,0.00012018128,0.0004355464,0.00019262712,0.0070969337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944323,0.00015024349,0.000018612913,0.000093644325,0.0002473841,0.000046883622],"domain_scores_gemma":[0.99935144,0.00024858187,0.00006183209,0.00014016361,0.00015794557,0.00004002923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006484054,0.0008557588,0.0008790026,0.000523731,0.00036089373,0.0008577372,0.00091315346,0.000953118,0.0036930707],"category_scores_gemma":[0.0024268113,0.0003709207,0.00081250246,0.00061861024,0.0010299295,0.0011280333,0.0013551047,0.0018299705,0.001340759],"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.0003378271,0.00024475742,0.00058800436,0.00031520377,0.00009296086,0.00017663228,0.0002687104,0.35241923,0.06064099,0.096937336,0.0135468235,0.47443154],"study_design_scores_gemma":[0.000013267908,0.00006212133,0.00015737899,0.000008939481,0.00001018441,0.00010059478,0.000043096596,0.97473323,0.0077136015,0.014501129,0.0026423659,0.000014124801],"about_ca_topic_score_codex":0.0022835536,"about_ca_topic_score_gemma":0.003995789,"teacher_disagreement_score":0.0036930707,"about_ca_system_score_codex":0.00030578533,"about_ca_system_score_gemma":0.0011640105,"threshold_uncertainty_score":0.012354553},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018988918,0.005757719,0.10963805,0.0956671,0.7164041,0.0001341469,0.0054682265,0.006077215,0.058954548],"genre_scores_gemma":[0.062450994,0.0072037666,0.18869081,0.032664847,0.08349279,0.00034059334,0.0054449793,0.017048892,0.6026624],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962364,0.00080371066,0.00040559447,0.00059954525,0.0016933697,0.00026145868],"domain_scores_gemma":[0.9855547,0.002989331,0.0007484951,0.002611908,0.0075925835,0.0005029063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029520725,0.0025127528,0.0018574125,0.0032281366,0.002203351,0.0032064922,0.0040058238,0.0043559438,0.15636037],"category_scores_gemma":[0.048361864,0.0013144308,0.001812878,0.0030818426,0.0018087554,0.004872219,0.002452972,0.010015367,0.05069291],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00006974273,0.000017967956,0.0000741262,0.00018099809,0.000021146729,0.00016680082,0.00004079312,0.0017698696,0.0002823056,0.041326832,0.92948866,0.026560828],"study_design_scores_gemma":[0.00007533715,0.000022262207,0.0004749905,0.0002433126,0.000042434007,0.0005345562,0.00007771356,0.01353486,0.0019495225,0.061679505,0.92126584,0.00009960298],"about_ca_topic_score_codex":0.011646559,"about_ca_topic_score_gemma":0.016979204,"teacher_disagreement_score":0.15636037,"about_ca_system_score_codex":0.003279926,"about_ca_system_score_gemma":0.0033944629,"threshold_uncertainty_score":0.52307755},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026279371,0.0010545566,0.95037234,0.00073268096,0.00015914919,0.000100866695,0.00028092318,0.00032597824,0.02069404],"genre_scores_gemma":[0.7271041,0.0008775941,0.2555617,0.00040180987,0.00017406093,0.0004243379,0.00057519425,0.00048953167,0.014391718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951494,0.00020242983,0.000017267717,0.00007829869,0.00009154341,0.000095583695],"domain_scores_gemma":[0.99823016,0.0012374875,0.0001259032,0.0001083621,0.00018266925,0.00011545696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015248292,0.0014595371,0.0016353996,0.0008956779,0.00052548666,0.001591488,0.0016823794,0.0018089957,0.009530558],"category_scores_gemma":[0.006012161,0.0008316677,0.00092403905,0.0012426688,0.00093623425,0.0015796773,0.0021885578,0.0024054388,0.0006555636],"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.000060053404,0.000028633225,0.00011152927,0.00009829685,0.000021999589,0.000033206066,0.000025765052,0.96724665,0.0003204191,0.020657126,0.0016003745,0.00979593],"study_design_scores_gemma":[0.0000071320555,0.000026057365,0.000028530209,0.000010303751,0.000005511141,0.0000074117593,0.00001154247,0.99326044,0.00010301456,0.006042092,0.00049453945,0.0000033822785],"about_ca_topic_score_codex":0.004712251,"about_ca_topic_score_gemma":0.003645831,"teacher_disagreement_score":0.009530558,"about_ca_system_score_codex":0.0010890419,"about_ca_system_score_gemma":0.0012348896,"threshold_uncertainty_score":0.031882823},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026878251,0.00020176056,0.9954535,0.0001086869,0.00006587474,0.00005299609,0.000030159943,0.00029409648,0.0011051445],"genre_scores_gemma":[0.087860204,0.00025396293,0.9084973,0.0001744791,0.00011116541,0.00036485295,0.00021588197,0.00018783593,0.002334351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891126,0.00031083435,0.00005190265,0.00018579292,0.000447191,0.000093012546],"domain_scores_gemma":[0.9972754,0.0016789001,0.00013734156,0.00025252404,0.000515147,0.00014067913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021441989,0.0011562648,0.0018733124,0.0013261916,0.0009340379,0.0011909532,0.002759333,0.0023993899,0.005263855],"category_scores_gemma":[0.01045594,0.0007797606,0.00088589813,0.0018074465,0.0011020913,0.0017588959,0.0023371754,0.0023391184,0.0014479554],"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.00036803348,0.00015325073,0.00067768776,0.00024133072,0.00007347618,0.000076609984,0.00020480009,0.6940311,0.0040987018,0.039481275,0.008168845,0.25242484],"study_design_scores_gemma":[0.000038623708,0.000032591866,0.00008649044,0.000011256853,0.000006047996,0.000031223597,0.000015294332,0.98911893,0.00036969795,0.00924309,0.0010387235,0.000007983797],"about_ca_topic_score_codex":0.0060515874,"about_ca_topic_score_gemma":0.007410464,"teacher_disagreement_score":0.0060515874,"about_ca_system_score_codex":0.0014492713,"about_ca_system_score_gemma":0.002775816,"threshold_uncertainty_score":0.017609358},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008902666,0.00015090143,0.9874779,0.0001603553,0.00010463377,0.000048028753,0.000042471453,0.00022959588,0.002883357],"genre_scores_gemma":[0.0759359,0.00011125199,0.9138434,0.00012659693,0.00006722345,0.0001173474,0.00014412326,0.00025134656,0.009402809],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994758,0.0001796731,0.000027184695,0.000089764995,0.00014438503,0.00008326898],"domain_scores_gemma":[0.9990503,0.0003893332,0.000045423905,0.0001619623,0.00024029658,0.00011264762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021377658,0.00068488246,0.0013463559,0.0012060106,0.0012263948,0.0012079144,0.002226247,0.0022007392,0.008728226],"category_scores_gemma":[0.0039590592,0.00060625304,0.0010723022,0.00096614106,0.001232661,0.0018844177,0.0020585125,0.0022751724,0.0018602535],"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.0004463884,0.00023005503,0.001184994,0.00018793133,0.00008842352,0.00012704021,0.00020738202,0.25953233,0.0038892645,0.348693,0.013355737,0.37205747],"study_design_scores_gemma":[0.000048054415,0.000075076074,0.00015449483,0.000026322155,0.0000114815675,0.000042423082,0.000033377455,0.9278169,0.001179342,0.0635392,0.0070490805,0.000024175633],"about_ca_topic_score_codex":0.006515498,"about_ca_topic_score_gemma":0.007881691,"teacher_disagreement_score":0.008728226,"about_ca_system_score_codex":0.0011231407,"about_ca_system_score_gemma":0.0023560186,"threshold_uncertainty_score":0.029198885},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025322933,0.0008967372,0.9644661,0.00061003777,0.00007618502,0.00017863698,0.00004277278,0.000053884643,0.0083527295],"genre_scores_gemma":[0.5747766,0.002584893,0.4084165,0.0003209515,0.00018272334,0.00080993,0.00018628869,0.00022694879,0.0124952365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989139,0.0006898449,0.000040531097,0.000092887,0.00016561174,0.000097213466],"domain_scores_gemma":[0.99292326,0.006032437,0.00022855127,0.00008349505,0.0005639594,0.00016824181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005641526,0.0022899548,0.002766742,0.0028597098,0.0013706518,0.002474083,0.0017713947,0.0034644227,0.003449512],"category_scores_gemma":[0.016868725,0.0013049839,0.0017686741,0.0021161647,0.0026137787,0.0022468197,0.0035683482,0.0023441892,0.0003136541],"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.00007856485,0.00009436471,0.00029708204,0.0001780084,0.000052934764,0.00009171927,0.00013975558,0.93636006,0.0006487203,0.047986545,0.0008055774,0.013266742],"study_design_scores_gemma":[0.000010401123,0.0000323958,0.000047427893,0.000018987004,0.000008252736,0.000008375602,0.000025554633,0.983723,0.0001198778,0.015749108,0.00024901732,0.0000075790604],"about_ca_topic_score_codex":0.0049121557,"about_ca_topic_score_gemma":0.00318896,"teacher_disagreement_score":0.005641526,"about_ca_system_score_codex":0.0012051975,"about_ca_system_score_gemma":0.0018762999,"threshold_uncertainty_score":0.029835582},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021805704,0.00036734363,0.96848094,0.00070370204,0.00007084462,0.000056360648,0.000073147654,0.000047420883,0.008394494],"genre_scores_gemma":[0.8032152,0.0009058024,0.1794051,0.00041918224,0.00016789138,0.0003070868,0.00014411274,0.00006172681,0.015373883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854845,0.0008243674,0.000055538476,0.00014390248,0.00031851075,0.000109126864],"domain_scores_gemma":[0.9977685,0.0013960949,0.00024786431,0.0001390983,0.00030193708,0.00014656695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036458846,0.0009889393,0.0015766188,0.0011274371,0.0006190921,0.002123051,0.0029861333,0.002504248,0.0038953403],"category_scores_gemma":[0.0090574,0.00072277134,0.0011569875,0.0016000826,0.0013577039,0.0028298197,0.0016766238,0.0020818957,0.00039997572],"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.0000443025,0.00006745539,0.00051844167,0.00006520348,0.00006784792,0.000103155035,0.00006132828,0.8644364,0.00041866794,0.12082503,0.00079505227,0.012597142],"study_design_scores_gemma":[0.000007876891,0.000013875596,0.00005028474,0.000006120843,0.000007407555,0.000013163562,0.0000033518475,0.98696715,0.000029864465,0.012704551,0.00019163112,0.0000046832574],"about_ca_topic_score_codex":0.0027090658,"about_ca_topic_score_gemma":0.0027261958,"teacher_disagreement_score":0.0038953403,"about_ca_system_score_codex":0.0012441434,"about_ca_system_score_gemma":0.001043721,"threshold_uncertainty_score":0.019281507},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002584886,0.00006865714,0.99638486,0.00009531572,0.000011567786,0.000016192696,0.000029920688,0.00006548318,0.00074311893],"genre_scores_gemma":[0.34001943,0.0005304337,0.6519024,0.00020480694,0.00008550709,0.00020088317,0.00042283148,0.00011955503,0.0065141567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931395,0.00025966443,0.000030837047,0.00012095226,0.00021528683,0.000059287955],"domain_scores_gemma":[0.9990386,0.0004950188,0.00010846879,0.00013622432,0.00017270612,0.00004903229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001177122,0.0009530281,0.0009375321,0.00049947674,0.00035451425,0.0009923521,0.0010619906,0.0012850447,0.002216028],"category_scores_gemma":[0.0029307378,0.0003233939,0.00060348125,0.00081617443,0.0011874157,0.002093924,0.0013268668,0.0019727508,0.00059443887],"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.00011658964,0.000061673,0.00036572694,0.00014408932,0.000031530326,0.00011266767,0.000067630885,0.8525995,0.0048487997,0.08091772,0.0039397483,0.056794263],"study_design_scores_gemma":[0.0000024698606,0.000009226753,0.000021465778,0.0000027436342,9.540013e-7,0.00001608872,0.0000044802455,0.99399996,0.00052213104,0.0049636355,0.00045383672,0.0000030382093],"about_ca_topic_score_codex":0.003152329,"about_ca_topic_score_gemma":0.002798471,"teacher_disagreement_score":0.003152329,"about_ca_system_score_codex":0.0005709831,"about_ca_system_score_gemma":0.0012412464,"threshold_uncertainty_score":0.0074133873},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015850897,0.00008026303,0.9969817,0.000038431343,0.000036808655,0.000019161458,0.00001717812,0.000060045997,0.0011813379],"genre_scores_gemma":[0.12254303,0.00029238642,0.87073267,0.000113992974,0.000112443486,0.00035569258,0.00020183928,0.00033705647,0.0053108823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927145,0.00032754906,0.000034019507,0.00008594677,0.00021145193,0.00006954562],"domain_scores_gemma":[0.9987703,0.0006653805,0.00007754047,0.00010689661,0.00029151663,0.00008841991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024252983,0.001462855,0.001419912,0.00083802774,0.00049861526,0.0012037175,0.0011599046,0.0015561974,0.0050780657],"category_scores_gemma":[0.0037504933,0.00089948584,0.0016275777,0.00083481614,0.00082237966,0.0013650326,0.0024096016,0.0023564077,0.0011623717],"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.00012333243,0.00015388514,0.00036452286,0.00020368822,0.0001084776,0.000082805425,0.0000868045,0.84147954,0.004594911,0.049507942,0.0034035807,0.0998905],"study_design_scores_gemma":[0.0000043926552,0.000014997708,0.000017384675,0.000005543905,0.0000046108357,0.000004800042,0.0000032092391,0.99743456,0.00016979733,0.0018867379,0.00045138737,0.0000026713174],"about_ca_topic_score_codex":0.0024686675,"about_ca_topic_score_gemma":0.0027417736,"teacher_disagreement_score":0.0050780657,"about_ca_system_score_codex":0.0004715828,"about_ca_system_score_gemma":0.001461542,"threshold_uncertainty_score":0.01698786},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058442373,0.00034699147,0.9102747,0.00023211757,0.00008250479,0.00010645364,0.00030999488,0.0015095876,0.02869534],"genre_scores_gemma":[0.47921506,0.00032943016,0.51322454,0.00006188042,0.000050309238,0.00016252339,0.0005221915,0.0011682766,0.0052657104],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994843,0.00009920787,0.000026730866,0.00007175531,0.00025935896,0.0000586298],"domain_scores_gemma":[0.99577385,0.0030566093,0.00022891822,0.00032941843,0.0005109658,0.00010033386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000507579,0.0010351627,0.001188073,0.002514093,0.0012993502,0.002291932,0.0011474781,0.0006733702,0.013551628],"category_scores_gemma":[0.009048848,0.00065389124,0.0006186132,0.0016542982,0.0014383367,0.0026435154,0.0014764379,0.0013823024,0.0021554264],"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.00034646504,0.0001309823,0.0026256714,0.0006989778,0.000054184024,0.0005905947,0.0005967481,0.3452795,0.017757047,0.23152867,0.0086208815,0.39177018],"study_design_scores_gemma":[0.000043609303,0.000068252186,0.000486635,0.000079401514,0.000027572323,0.00013491347,0.00021040584,0.8090368,0.009590973,0.17272852,0.0075638467,0.000029053106],"about_ca_topic_score_codex":0.0025032288,"about_ca_topic_score_gemma":0.0056140865,"teacher_disagreement_score":0.013551628,"about_ca_system_score_codex":0.0007655542,"about_ca_system_score_gemma":0.0012205428,"threshold_uncertainty_score":0.045334697},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077238284,0.0028607412,0.8560477,0.017241625,0.00037206043,0.00007808486,0.0013458614,0.00022176669,0.04459395],"genre_scores_gemma":[0.88467556,0.0026865816,0.06471252,0.00090586866,0.00072607916,0.00024403897,0.0015593558,0.00025961717,0.044230316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876875,0.0005861485,0.00005094637,0.00027527878,0.00018292143,0.00013601127],"domain_scores_gemma":[0.98823893,0.009628339,0.0006787148,0.00042298302,0.00064642343,0.00038459362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030096278,0.0007841102,0.0017437978,0.0011802573,0.0008060706,0.002620506,0.0019047743,0.0029477614,0.010289059],"category_scores_gemma":[0.023858521,0.00093296927,0.0008069494,0.0015754123,0.0025875499,0.0048021968,0.0023417638,0.0031673398,0.0004841877],"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.00009264951,0.00005152131,0.0011374468,0.00014708933,0.00007990377,0.00016459044,0.00007184419,0.24104242,0.00022065065,0.7352298,0.010003597,0.011758436],"study_design_scores_gemma":[0.000027034486,0.000015362693,0.00037854392,0.00003194251,0.0000125629385,0.000061648236,0.000027956354,0.42209983,0.00011525548,0.57523125,0.0019824232,0.000016119999],"about_ca_topic_score_codex":0.006394644,"about_ca_topic_score_gemma":0.0037922915,"teacher_disagreement_score":0.010289059,"about_ca_system_score_codex":0.002025449,"about_ca_system_score_gemma":0.0020624872,"threshold_uncertainty_score":0.03442037},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1565126,0.0021598337,0.78595954,0.0020864268,0.0006712314,0.0001419813,0.00077018654,0.0017019559,0.049996275],"genre_scores_gemma":[0.8181174,0.001084718,0.15477794,0.0005919903,0.0005554031,0.00017192037,0.0016999226,0.00041288545,0.022587806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999218,0.00022095439,0.000052682604,0.0003126231,0.00012611653,0.000069685295],"domain_scores_gemma":[0.9962923,0.0021322314,0.00020444693,0.0007623499,0.00034338905,0.00026539023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001405326,0.00072512735,0.0009758808,0.0011202669,0.00093596434,0.0020106724,0.0011396728,0.0011701799,0.013246997],"category_scores_gemma":[0.011934573,0.00042463597,0.00076747406,0.00090125436,0.0016502363,0.00513007,0.0033458807,0.0028619368,0.0019838777],"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.00054486765,0.00016108714,0.003359588,0.00033990663,0.00009062449,0.00018693297,0.00046477304,0.054267354,0.0038302771,0.6661432,0.015967684,0.25464365],"study_design_scores_gemma":[0.00003874301,0.000084603795,0.00034139285,0.00005519762,0.000018648849,0.00007788568,0.00011762125,0.19483042,0.0005907437,0.79790664,0.005922586,0.000015511168],"about_ca_topic_score_codex":0.0005413074,"about_ca_topic_score_gemma":0.0009440828,"teacher_disagreement_score":0.013246997,"about_ca_system_score_codex":0.00058061775,"about_ca_system_score_gemma":0.00059662014,"threshold_uncertainty_score":0.044315577},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12468751,0.00046832947,0.8377427,0.0007012158,0.00022267694,0.00015547639,0.00010487253,0.00042279795,0.03549441],"genre_scores_gemma":[0.81328076,0.00017745631,0.18391462,0.00009179748,0.000022376631,0.00009215501,0.00015053716,0.00014494147,0.0021253198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982645,0.0007992656,0.000084865285,0.00010275313,0.0006200909,0.00012854152],"domain_scores_gemma":[0.9866976,0.009145872,0.00057515857,0.00096663024,0.00233052,0.00028418633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005763527,0.0007521614,0.0007885435,0.0016235961,0.0011491074,0.0020469187,0.0011132705,0.0018068184,0.0045391642],"category_scores_gemma":[0.033176046,0.00043389283,0.00065720157,0.0006883545,0.0023444647,0.0012697193,0.0022359309,0.0017093241,0.000403227],"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.0002722958,0.000126835,0.0018395687,0.0001873919,0.000035845125,0.00012902037,0.00011708963,0.8627089,0.004379261,0.0866729,0.0015195524,0.042011272],"study_design_scores_gemma":[0.000016130542,0.000032417403,0.00022475756,0.000029943361,0.0000037233694,0.000029409353,0.00002469111,0.98422396,0.0016120224,0.013325491,0.00046999758,0.000007473294],"about_ca_topic_score_codex":0.0025483367,"about_ca_topic_score_gemma":0.0022486055,"teacher_disagreement_score":0.005763527,"about_ca_system_score_codex":0.0009740244,"about_ca_system_score_gemma":0.0018572005,"threshold_uncertainty_score":0.030480802},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03633248,0.0011809038,0.9495678,0.0013668931,0.00019604492,0.00012331497,0.00029720395,0.0026610098,0.008274287],"genre_scores_gemma":[0.5624532,0.0009194614,0.42954198,0.00090810185,0.00018054697,0.0003279579,0.00086588855,0.00091723166,0.0038856112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9915725,0.003658331,0.00047485618,0.0013002526,0.0023271304,0.00066698587],"domain_scores_gemma":[0.97072953,0.022100331,0.0014446062,0.003116219,0.002252213,0.00035701366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059233652,0.0015719659,0.0013974181,0.0013316199,0.0009308117,0.0029067737,0.0029704692,0.002161965,0.0073100687],"category_scores_gemma":[0.038062703,0.0010807738,0.002842907,0.0010626247,0.0036311734,0.0039071944,0.004184741,0.004032359,0.0010774272],"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.00032157762,0.00016754291,0.0023881001,0.0008173129,0.00015644921,0.00037479386,0.000295362,0.712724,0.0052732164,0.19633475,0.0034770288,0.077669874],"study_design_scores_gemma":[0.000028286046,0.000034282275,0.000103535545,0.00007248012,0.000017130784,0.000054914,0.000030405652,0.9140067,0.0027415336,0.08042602,0.0024714647,0.000013281929],"about_ca_topic_score_codex":0.00388209,"about_ca_topic_score_gemma":0.0036600516,"teacher_disagreement_score":0.0073100687,"about_ca_system_score_codex":0.0022222616,"about_ca_system_score_gemma":0.0028688344,"threshold_uncertainty_score":0.031326115},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019469343,0.0003907806,0.99327,0.00034609178,0.00013046204,0.000018006102,0.000030391515,0.00004436978,0.0038229926],"genre_scores_gemma":[0.2265805,0.0013344337,0.7566307,0.00067654764,0.00057630736,0.00023894294,0.00023326362,0.00022229977,0.013507057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917006,0.0004458533,0.000034723504,0.00010454029,0.00020254996,0.000042197345],"domain_scores_gemma":[0.9987098,0.0007326438,0.000101410034,0.00011978642,0.00026716813,0.00006921726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027168542,0.0014519922,0.001956044,0.0007923994,0.00037947897,0.0020003372,0.002009033,0.0026981696,0.0032604018],"category_scores_gemma":[0.0058272257,0.000867306,0.00092653406,0.0012978214,0.0012398668,0.0020614376,0.0021159681,0.003113547,0.0006333004],"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.00006777218,0.000076169534,0.0002449248,0.00018630801,0.00011021513,0.00011891371,0.00003417107,0.7990498,0.001457504,0.14720967,0.003749457,0.04769507],"study_design_scores_gemma":[0.000008912131,0.000013180123,0.000025067402,0.000009780662,0.000009586977,0.000020719803,0.0000031723134,0.97605884,0.00013252512,0.023166597,0.00054698146,0.0000045715174],"about_ca_topic_score_codex":0.0012611108,"about_ca_topic_score_gemma":0.0011373742,"teacher_disagreement_score":0.0032604018,"about_ca_system_score_codex":0.00063236407,"about_ca_system_score_gemma":0.0013312211,"threshold_uncertainty_score":0.014368296},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003266828,0.00009612887,0.9953957,0.000052629886,0.00003817632,0.000022652093,0.0000164886,0.00006429662,0.0010471535],"genre_scores_gemma":[0.18701497,0.00038272934,0.8047732,0.00015111643,0.00010410406,0.0002664195,0.00014670892,0.00020986682,0.0069509125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997421,0.000091259004,0.00001242742,0.00003310384,0.000096101794,0.000025048525],"domain_scores_gemma":[0.99847454,0.0010784295,0.00008199897,0.0000716373,0.00022845433,0.000064993845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011048618,0.000969647,0.0010557978,0.00096200174,0.0004883173,0.00085743,0.0011314352,0.0014705362,0.0032679571],"category_scores_gemma":[0.003946751,0.00058663846,0.000759258,0.0006792759,0.0013783356,0.0010066183,0.0014371778,0.0022126734,0.0006500581],"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.00018125404,0.00009441274,0.0005667385,0.00027941575,0.00007021862,0.00015723225,0.00016962751,0.82492113,0.010299439,0.082421176,0.0038342583,0.077005155],"study_design_scores_gemma":[0.0000037274863,0.000012346405,0.000023398432,0.000004571526,0.0000019932947,0.000007617622,0.0000046516725,0.99671376,0.00028618035,0.002560235,0.00037787022,0.0000035951339],"about_ca_topic_score_codex":0.0040346156,"about_ca_topic_score_gemma":0.0063403966,"teacher_disagreement_score":0.0040346156,"about_ca_system_score_codex":0.000653723,"about_ca_system_score_gemma":0.0015339807,"threshold_uncertainty_score":0.010932386},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20857051,0.011310444,0.7194717,0.0031914732,0.00039770085,0.00010417011,0.0008330157,0.0004954015,0.055625666],"genre_scores_gemma":[0.89015245,0.00491145,0.095898256,0.00048915815,0.0007843379,0.0002368256,0.0005509428,0.0004873845,0.006489251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976922,0.00083018874,0.0000848723,0.00045139977,0.0005235929,0.00041775574],"domain_scores_gemma":[0.972376,0.02234047,0.0014458976,0.0012969036,0.0010697868,0.0014708531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004491921,0.0025774732,0.0028013692,0.0034586245,0.001058919,0.0043613277,0.0035648104,0.0014875103,0.0046003135],"category_scores_gemma":[0.032281365,0.0016561861,0.0013913282,0.0023664595,0.0054921806,0.007268109,0.0045916247,0.005649484,0.0005575901],"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.0009687017,0.00014192377,0.0035646926,0.00075982476,0.000165157,0.00037126924,0.0005957109,0.22050293,0.010508351,0.7124945,0.005544183,0.044382848],"study_design_scores_gemma":[0.00004443785,0.00012588449,0.001653062,0.00021264603,0.00006898032,0.00020431004,0.00019264889,0.32772702,0.0030627775,0.6629726,0.0036879117,0.00004766244],"about_ca_topic_score_codex":0.001031596,"about_ca_topic_score_gemma":0.001075108,"teacher_disagreement_score":0.0046003135,"about_ca_system_score_codex":0.0018741372,"about_ca_system_score_gemma":0.0009157678,"threshold_uncertainty_score":0.023755848},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050368556,0.000096814285,0.9984829,0.000033642613,0.000023557213,0.00001233376,0.000028361737,0.0003202869,0.0004984904],"genre_scores_gemma":[0.19770381,0.0005446337,0.7941333,0.00019988204,0.00015147547,0.0003035548,0.00042733017,0.0012404391,0.005295597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986155,0.00054510555,0.000053373376,0.00017886957,0.00048458128,0.00012250736],"domain_scores_gemma":[0.99803215,0.0009847403,0.000115695584,0.00032668703,0.00041742527,0.0001233028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025036905,0.0014588431,0.0019793324,0.00063239987,0.00046944479,0.0014490278,0.0028077464,0.0017374157,0.004959491],"category_scores_gemma":[0.00754044,0.0007820164,0.0012194559,0.0007945449,0.0010420647,0.0019950506,0.0027830456,0.00316862,0.0018534475],"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.00034050073,0.00006660341,0.00018559299,0.00022360566,0.00006854883,0.00008558599,0.00007955019,0.79944617,0.004234849,0.076478094,0.008314854,0.11047605],"study_design_scores_gemma":[0.000011394467,0.000027225704,0.00001170599,0.0000056722547,0.0000050515214,0.000010852072,0.0000033149704,0.9891755,0.0005893272,0.008838915,0.0013156141,0.000005361806],"about_ca_topic_score_codex":0.0038152873,"about_ca_topic_score_gemma":0.0031915272,"teacher_disagreement_score":0.004959491,"about_ca_system_score_codex":0.000689399,"about_ca_system_score_gemma":0.0017740028,"threshold_uncertainty_score":0.016591132},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004064196,0.0007677816,0.9880392,0.0007899101,0.0001674093,0.000026639236,0.000040644973,0.000021590049,0.0060826205],"genre_scores_gemma":[0.35820898,0.0029964154,0.6198575,0.000586484,0.0009972614,0.00041499196,0.00019806834,0.00015899098,0.0165814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815863,0.0012230026,0.000061137296,0.00013841495,0.00030414964,0.00011461309],"domain_scores_gemma":[0.9972128,0.001995113,0.00014472514,0.00013496417,0.00034191832,0.00017057605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037799068,0.0013621126,0.001767511,0.0017938388,0.0007915994,0.0030653176,0.0022308857,0.0016307357,0.004154545],"category_scores_gemma":[0.006930806,0.00091850373,0.001338558,0.002354291,0.0019815161,0.0034691358,0.0030287593,0.0044613155,0.0004407577],"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.00011159938,0.00015784391,0.00033852196,0.00023173865,0.0000946941,0.00009388473,0.00012816524,0.23530948,0.00081383274,0.72641075,0.0043970193,0.031912483],"study_design_scores_gemma":[0.00003585938,0.000036633697,0.00006749453,0.000044351258,0.000021840813,0.00004990899,0.00003130417,0.69416726,0.00016814207,0.3022321,0.0031290043,0.000016118249],"about_ca_topic_score_codex":0.0012778973,"about_ca_topic_score_gemma":0.0015559456,"teacher_disagreement_score":0.004154545,"about_ca_system_score_codex":0.0016166391,"about_ca_system_score_gemma":0.0015714294,"threshold_uncertainty_score":0.019990265},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068272516,0.0005614643,0.9091274,0.0003461967,0.00008738406,0.00007338643,0.00027104045,0.00033318967,0.020927299],"genre_scores_gemma":[0.62359476,0.00040895518,0.36341295,0.00014444522,0.000069585454,0.00024796,0.00046162642,0.00042580508,0.011233844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956554,0.00015746485,0.000013554726,0.00006886015,0.00012751392,0.00006700711],"domain_scores_gemma":[0.9992415,0.0004967062,0.0000578333,0.000070105685,0.000090300964,0.000043521348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092622376,0.0012196138,0.0013643014,0.00079937524,0.00049547787,0.00095116446,0.0009985684,0.0016574977,0.0054805484],"category_scores_gemma":[0.0029835934,0.00072171853,0.0008909727,0.0010210925,0.0008677205,0.001058745,0.0015156918,0.0008525293,0.0006080849],"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.000044416865,0.00001516376,0.00009847417,0.0000492534,0.000012114742,0.0000268826,0.000024474108,0.9800182,0.00061638135,0.009778008,0.00090956327,0.008407005],"study_design_scores_gemma":[0.0000053830418,0.000013922446,0.00004114798,0.0000040237605,0.0000027104004,0.000009588772,0.000009079818,0.9951525,0.00015293069,0.004307783,0.00029808778,0.0000029083621],"about_ca_topic_score_codex":0.007167721,"about_ca_topic_score_gemma":0.004133044,"teacher_disagreement_score":0.007167721,"about_ca_system_score_codex":0.0011735964,"about_ca_system_score_gemma":0.0008638181,"threshold_uncertainty_score":0.01833427},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032388978,0.00032709006,0.99256563,0.00014562966,0.000083407846,0.000034190478,0.000023661696,0.00011496514,0.0034664858],"genre_scores_gemma":[0.20589824,0.0007662238,0.78529525,0.00042111718,0.00016193315,0.00031529256,0.00018821478,0.00044275718,0.006510965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819773,0.000868539,0.00007313263,0.00007507706,0.0006596088,0.00012587858],"domain_scores_gemma":[0.9976769,0.0013253548,0.00012846035,0.00013245334,0.00064133527,0.000095600284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047787814,0.0016927128,0.0019159521,0.0011385509,0.00059517956,0.0014167589,0.0015304885,0.002022625,0.0026862181],"category_scores_gemma":[0.00787696,0.0006078725,0.0010064427,0.00125291,0.00082138786,0.0014523413,0.0020243542,0.002079374,0.00081856945],"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.00011408235,0.00017555607,0.0003854453,0.00023391083,0.00007285272,0.00008227285,0.00006225317,0.8652583,0.0030821469,0.042130627,0.003158911,0.085243605],"study_design_scores_gemma":[0.0000032640232,0.000012289476,0.000021310387,0.000008964118,0.000002937513,0.000008534798,0.000003319727,0.9967526,0.00021549614,0.0025458196,0.0004219654,0.000003490596],"about_ca_topic_score_codex":0.004402969,"about_ca_topic_score_gemma":0.006894906,"teacher_disagreement_score":0.0047787814,"about_ca_system_score_codex":0.00067484204,"about_ca_system_score_gemma":0.0017662866,"threshold_uncertainty_score":0.025272965},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0139233535,0.00021729269,0.98420346,0.00016828382,0.000037260357,0.00002852185,0.00006400919,0.00042819494,0.00092958024],"genre_scores_gemma":[0.45847848,0.00032871144,0.5355429,0.00023877292,0.00010656432,0.0002540154,0.00043438125,0.00044369276,0.0041724346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990752,0.00036687113,0.00004370187,0.00021532306,0.00018986831,0.00010911427],"domain_scores_gemma":[0.9959085,0.003061171,0.00027920978,0.0002052698,0.000348775,0.0001970419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002144909,0.0013843378,0.002497102,0.0010989598,0.00054771284,0.0024726924,0.0022882484,0.002633125,0.0042056395],"category_scores_gemma":[0.008264505,0.0014195978,0.0012093311,0.0013580607,0.0013931493,0.0029706513,0.0022731058,0.0038479061,0.00090231595],"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.00011000034,0.000096714946,0.0004156127,0.000099346325,0.00003265233,0.00004894362,0.00003622103,0.9421347,0.0010255384,0.01030211,0.0011040719,0.04459411],"study_design_scores_gemma":[0.0000031500501,0.000011232476,0.000007875377,0.0000037168943,0.0000017618016,0.0000035402916,0.0000035152812,0.9978248,0.000094467265,0.0019694858,0.000074876785,0.0000016844385],"about_ca_topic_score_codex":0.0036103122,"about_ca_topic_score_gemma":0.003457665,"teacher_disagreement_score":0.0042056395,"about_ca_system_score_codex":0.0011984264,"about_ca_system_score_gemma":0.001301804,"threshold_uncertainty_score":0.014069259},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06982936,0.00017329234,0.9137311,0.00032149898,0.00010613807,0.0004470873,0.0007211324,0.0034143156,0.011256041],"genre_scores_gemma":[0.29571697,0.00011412938,0.694582,0.0002428517,0.000075601485,0.0005310904,0.0026131938,0.0015356168,0.0045886426],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99514174,0.0012855431,0.00036837292,0.0010286464,0.001704579,0.0004711254],"domain_scores_gemma":[0.982678,0.010654016,0.00095941947,0.002113177,0.0030463024,0.0005490827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030293453,0.0018330179,0.0015383514,0.002784066,0.0014507336,0.0038325093,0.0024928404,0.0017321851,0.017895652],"category_scores_gemma":[0.028001634,0.0011670864,0.0022525298,0.002014623,0.0022041574,0.005290362,0.0035959168,0.0024956116,0.003413079],"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.0016929272,0.0010446153,0.013329537,0.00061455753,0.0004911919,0.0005652355,0.00061835477,0.27794638,0.012306677,0.24080203,0.02525892,0.42532948],"study_design_scores_gemma":[0.00012527667,0.00020983155,0.0006053526,0.0000568938,0.000047567213,0.0001668379,0.00014535895,0.87437296,0.008820134,0.11137716,0.0040286216,0.000044051758],"about_ca_topic_score_codex":0.005016045,"about_ca_topic_score_gemma":0.0045146397,"teacher_disagreement_score":0.017895652,"about_ca_system_score_codex":0.0014802389,"about_ca_system_score_gemma":0.002788266,"threshold_uncertainty_score":0.059866905},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003941085,0.0006330528,0.0050355266,0.01878966,0.9669862,0.000056494606,0.0014779838,0.0012785712,0.0053483895],"genre_scores_gemma":[0.09174412,0.0068158917,0.04131621,0.037764613,0.39833313,0.0006457796,0.007758321,0.0077112964,0.40791067],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9940778,0.0008787718,0.0011484984,0.0009024198,0.0024440666,0.0005484865],"domain_scores_gemma":[0.9362813,0.012773901,0.001843102,0.005594241,0.040904053,0.0026033283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032036952,0.002044816,0.0027183276,0.0047348407,0.0033635183,0.0043304963,0.0048162094,0.00664901,0.21814999],"category_scores_gemma":[0.092506394,0.0011411264,0.002043389,0.003406539,0.0031921172,0.0036515843,0.002969029,0.007963154,0.07078629],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00009639367,0.000014463098,0.00010931035,0.00029961963,0.000024681683,0.0002837724,0.00004758177,0.0004810091,0.00019106506,0.0045326133,0.9790653,0.014854189],"study_design_scores_gemma":[0.0001401704,0.00007285974,0.0013212712,0.00035637847,0.000042530497,0.0009425852,0.00014243984,0.0039325673,0.0017467861,0.013236188,0.97795117,0.00011487298],"about_ca_topic_score_codex":0.006840722,"about_ca_topic_score_gemma":0.00806979,"teacher_disagreement_score":0.21814999,"about_ca_system_score_codex":0.0036390023,"about_ca_system_score_gemma":0.0046334,"threshold_uncertainty_score":0.7297844},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03466903,0.00042612036,0.9520418,0.00030322978,0.00015862798,0.00014000901,0.000060676448,0.0003564927,0.01184399],"genre_scores_gemma":[0.6375605,0.00039958852,0.34932423,0.00021310685,0.00017376697,0.00042689,0.00015959596,0.00009652743,0.011645859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928254,0.0002975756,0.000030852163,0.000102241785,0.0001905096,0.000096335774],"domain_scores_gemma":[0.99927527,0.00031872917,0.000067551686,0.000116416464,0.00017165316,0.00005041566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011832443,0.00067622325,0.0010545423,0.00065854087,0.00043574895,0.0010462835,0.0011619781,0.0009798971,0.0034839804],"category_scores_gemma":[0.0032589578,0.00042731847,0.00052597874,0.0010555333,0.0003481997,0.0010527711,0.0009952693,0.00081821816,0.0007666094],"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.00020706882,0.00019834012,0.0007077338,0.00006441298,0.0000915013,0.00010385518,0.00002440869,0.8486913,0.0022316745,0.025025584,0.0033742345,0.11928001],"study_design_scores_gemma":[0.000027903572,0.00006299235,0.000095746946,0.0000036990011,0.000013866011,0.000033836306,0.0000046041923,0.9905828,0.00045341367,0.007956785,0.000761074,0.00000323841],"about_ca_topic_score_codex":0.0008423253,"about_ca_topic_score_gemma":0.00083129335,"teacher_disagreement_score":0.0034839804,"about_ca_system_score_codex":0.0004970469,"about_ca_system_score_gemma":0.0009321265,"threshold_uncertainty_score":0.011655092},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007448141,0.00096432626,0.9854908,0.0005897502,0.00022995433,0.000023032468,0.000044957418,0.000040723426,0.005168279],"genre_scores_gemma":[0.5541778,0.0022676769,0.4210872,0.0006186961,0.00042023679,0.00023141906,0.0003009599,0.00032708043,0.02056886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908686,0.00058575557,0.000033782922,0.000083596635,0.00015628606,0.00005374526],"domain_scores_gemma":[0.99763227,0.0015953949,0.00015821854,0.00020942149,0.00028322297,0.0001216091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002247505,0.0009012755,0.0011209681,0.0005985609,0.00049576745,0.0015180035,0.00084670924,0.0009696148,0.0019856752],"category_scores_gemma":[0.0062400643,0.00057147496,0.00090344675,0.0005779455,0.00216096,0.0020360453,0.00244752,0.0031814142,0.00026789345],"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.00013369009,0.00006814853,0.00056248636,0.00024523473,0.00005503636,0.00005833769,0.00016165276,0.35609132,0.0034559688,0.60953534,0.0027575742,0.026875162],"study_design_scores_gemma":[0.0000085930515,0.000023577959,0.000050075025,0.000022714568,0.000006759625,0.000016013826,0.000023418337,0.83664036,0.00043797444,0.16072595,0.002035709,0.000008910537],"about_ca_topic_score_codex":0.0023735361,"about_ca_topic_score_gemma":0.0022799312,"teacher_disagreement_score":0.0023735361,"about_ca_system_score_codex":0.00078850513,"about_ca_system_score_gemma":0.0010279288,"threshold_uncertainty_score":0.01188606},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11004255,0.0034471762,0.8628239,0.004177507,0.00032494473,0.00035792834,0.0010394742,0.00047950537,0.017306957],"genre_scores_gemma":[0.63397616,0.0024450861,0.34987715,0.00078290113,0.00068205013,0.0005302969,0.0014715481,0.00047208153,0.009762685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981522,0.0006066596,0.00006561253,0.00039159236,0.00043998382,0.000343931],"domain_scores_gemma":[0.98221934,0.014700461,0.0010360603,0.000662067,0.0007302495,0.000651852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038246836,0.0021332023,0.0030485333,0.0021347913,0.0012124701,0.00454715,0.0051417667,0.004275725,0.008719335],"category_scores_gemma":[0.024501765,0.0013318374,0.0019445784,0.0040876814,0.001801004,0.008078615,0.0029864814,0.0043081623,0.0006423542],"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.0007776478,0.00045492031,0.0022824537,0.0006427417,0.0001638287,0.00024859124,0.00020160081,0.83219856,0.0016702953,0.09299884,0.013374008,0.05498647],"study_design_scores_gemma":[0.000035499368,0.00003989296,0.00019725473,0.000032226817,0.00002611443,0.000082327664,0.000056705274,0.9562773,0.00022521829,0.042467102,0.000551312,0.00000901014],"about_ca_topic_score_codex":0.0046437914,"about_ca_topic_score_gemma":0.004860673,"teacher_disagreement_score":0.008719335,"about_ca_system_score_codex":0.0032915415,"about_ca_system_score_gemma":0.00293425,"threshold_uncertainty_score":0.029169023},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019882677,0.0005438811,0.97466403,0.0005194562,0.0000952133,0.00008585757,0.000050138005,0.00010557954,0.004053162],"genre_scores_gemma":[0.5576172,0.0015256825,0.42165154,0.0005825167,0.000394952,0.0008183096,0.000355194,0.0006742513,0.016380304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935548,0.0043597,0.00024576293,0.00059385,0.0008669839,0.00037885134],"domain_scores_gemma":[0.96911645,0.024174836,0.0012751477,0.0017561488,0.0024323938,0.0012449593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016296973,0.0034629658,0.0032572714,0.0025883855,0.0010870524,0.003050711,0.004082157,0.004420808,0.0041900417],"category_scores_gemma":[0.06070603,0.0019494143,0.002603122,0.0017947057,0.0063276356,0.005811766,0.0111683,0.0062627792,0.0008904104],"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.0007351154,0.00016152192,0.0008071061,0.0004596849,0.00022841869,0.0001659371,0.0004041333,0.6631858,0.0031175688,0.2984458,0.0021028805,0.030186024],"study_design_scores_gemma":[0.000046862453,0.00015903333,0.00014087303,0.000045873683,0.000028718494,0.000061034476,0.00004836741,0.90491253,0.00078550976,0.09300383,0.00073847605,0.000028861818],"about_ca_topic_score_codex":0.0018110133,"about_ca_topic_score_gemma":0.0011359103,"teacher_disagreement_score":0.016296973,"about_ca_system_score_codex":0.0015330599,"about_ca_system_score_gemma":0.003084595,"threshold_uncertainty_score":0.08618766},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026766436,0.00045235065,0.9563136,0.0009581123,0.00020843948,0.00008595751,0.00028823328,0.0001676373,0.014759191],"genre_scores_gemma":[0.6185718,0.00257925,0.3266731,0.0013708641,0.0005766341,0.00070800754,0.00088496733,0.00073228095,0.047902927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982382,0.0008925694,0.000082439066,0.0002145049,0.00040210775,0.00017012662],"domain_scores_gemma":[0.9971276,0.0013748938,0.00034331036,0.0002978406,0.0003518411,0.00050459895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024725324,0.0011588467,0.001044885,0.001169063,0.0007561618,0.0033459186,0.0012495939,0.0010780483,0.009705634],"category_scores_gemma":[0.007510958,0.0009962028,0.000846838,0.0013713157,0.0031143303,0.0056867753,0.0048879865,0.0041653616,0.0013181538],"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.00006188482,0.000036564456,0.00012106353,0.00007506117,0.000021602613,0.000034777266,0.00010246866,0.0092115225,0.0010158552,0.974607,0.0017767445,0.012935426],"study_design_scores_gemma":[0.000013864405,0.000030733492,0.00007623243,0.000017971191,0.000005578291,0.00002987717,0.000055993525,0.0517378,0.00041964697,0.9456153,0.0019831902,0.000013770189],"about_ca_topic_score_codex":0.00073458545,"about_ca_topic_score_gemma":0.00065538427,"teacher_disagreement_score":0.009705634,"about_ca_system_score_codex":0.00079321384,"about_ca_system_score_gemma":0.0012494101,"threshold_uncertainty_score":0.032468557},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006961013,0.0006649378,0.97711724,0.00059798337,0.00013845951,0.000029986488,0.000111304355,0.000045052846,0.014334038],"genre_scores_gemma":[0.29718763,0.003371584,0.6423264,0.00068795367,0.00079430145,0.00040429976,0.0008734708,0.00071248435,0.05364193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986545,0.0006418425,0.00005607924,0.00019870767,0.00031437434,0.00013448889],"domain_scores_gemma":[0.9967231,0.0019628615,0.0002528002,0.00044169437,0.00042639353,0.00019309211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003556723,0.002133652,0.0016869643,0.00138768,0.0007669313,0.002815076,0.0025499845,0.0027284033,0.0065206676],"category_scores_gemma":[0.015051831,0.0012414384,0.001789671,0.0016523603,0.0030477075,0.0053780903,0.0035383082,0.006236331,0.0012294978],"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.00007391971,0.00006127505,0.00015459677,0.0001690091,0.000025226473,0.00007149202,0.00016138976,0.18204933,0.0013172971,0.78544545,0.004594665,0.0258763],"study_design_scores_gemma":[0.000020822952,0.00003511778,0.000080459795,0.000046741145,0.000012835955,0.00007555277,0.000059212987,0.59783536,0.0005323734,0.39385983,0.0074221226,0.000019459001],"about_ca_topic_score_codex":0.0019063288,"about_ca_topic_score_gemma":0.0022408979,"teacher_disagreement_score":0.0065206676,"about_ca_system_score_codex":0.0012326767,"about_ca_system_score_gemma":0.001427447,"threshold_uncertainty_score":0.02181375},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27124444,0.0012650653,0.60707825,0.0010445113,0.0005010249,0.00026831104,0.0008346628,0.0010670059,0.11669676],"genre_scores_gemma":[0.86139125,0.0004950298,0.113411166,0.00013457579,0.00011967205,0.00019158405,0.0004983077,0.00036035723,0.023398107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996306,0.00007813303,0.000018734161,0.00007620177,0.00014465093,0.00005167707],"domain_scores_gemma":[0.99905974,0.0004372711,0.0001187001,0.00017299216,0.00012099925,0.000090285226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025125194,0.0006554867,0.00066085707,0.0009045346,0.00072944316,0.0015305927,0.0006811542,0.00076802174,0.009410046],"category_scores_gemma":[0.0024471472,0.0007107855,0.0004615381,0.0007639039,0.0011115458,0.0013245385,0.0017610413,0.0008764317,0.0012253193],"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.00049045583,0.00022999954,0.0049607847,0.0007426728,0.00008637437,0.002161468,0.00038514056,0.2933132,0.04415065,0.508137,0.014292463,0.13104981],"study_design_scores_gemma":[0.00010219786,0.00020809309,0.0035002236,0.00006437184,0.000064707034,0.0020182957,0.00034810073,0.7092718,0.018236853,0.22841674,0.03771352,0.00005517053],"about_ca_topic_score_codex":0.0005383324,"about_ca_topic_score_gemma":0.000724292,"teacher_disagreement_score":0.009410046,"about_ca_system_score_codex":0.00025343263,"about_ca_system_score_gemma":0.0003187298,"threshold_uncertainty_score":0.031479776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006964684,0.0000955554,0.997647,0.00008573213,0.00006543295,0.000025339517,0.000032186606,0.00008735962,0.0012648884],"genre_scores_gemma":[0.025321659,0.00027755435,0.96624625,0.00018285817,0.00009289595,0.00021183942,0.00019814589,0.00019120637,0.007277579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995546,0.00014305972,0.000023832508,0.000056332115,0.0001959307,0.000026346768],"domain_scores_gemma":[0.99947923,0.0002536192,0.000032681502,0.000059757025,0.00013390435,0.00004086696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011430514,0.0011162179,0.0011816645,0.00056249136,0.000484813,0.00080874725,0.0016298759,0.002058858,0.0060757766],"category_scores_gemma":[0.0023625293,0.0004998494,0.00076512346,0.00079689856,0.0008033063,0.0011233332,0.0021121176,0.0023779415,0.0026003208],"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.00029607056,0.0002473406,0.00045528158,0.00055129913,0.00012388869,0.00027386137,0.0002527566,0.47443068,0.026155435,0.14122649,0.020714555,0.33527243],"study_design_scores_gemma":[0.0000122609445,0.000043522206,0.00003921968,0.000015049638,0.000006230663,0.000047602858,0.000010827739,0.98836666,0.0012113537,0.005854772,0.0043793297,0.0000131438155],"about_ca_topic_score_codex":0.0018673696,"about_ca_topic_score_gemma":0.0034938399,"teacher_disagreement_score":0.0060757766,"about_ca_system_score_codex":0.00035090747,"about_ca_system_score_gemma":0.0015569666,"threshold_uncertainty_score":0.020325482},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010796195,0.00073318795,0.96039987,0.0012856913,0.0002138194,0.00013898202,0.00020610342,0.0000757306,0.026150484],"genre_scores_gemma":[0.6740161,0.0015246117,0.26866433,0.001224737,0.00047945933,0.0013009859,0.00058099575,0.000490989,0.051717788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990978,0.00049330154,0.000029147692,0.000114961884,0.0001640009,0.00010077271],"domain_scores_gemma":[0.99771464,0.0016098879,0.00013018036,0.00008142393,0.00034777474,0.00011603153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004522505,0.0022145219,0.0022672024,0.0010352057,0.0007808045,0.0021726172,0.0021884264,0.0032023583,0.006741879],"category_scores_gemma":[0.006694411,0.0012330255,0.0018172199,0.001179811,0.0021620123,0.0023079673,0.003290611,0.0028275938,0.000611257],"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.000031339496,0.00003108446,0.00011113157,0.000101796315,0.000032040673,0.000045052457,0.000020779591,0.94232637,0.0003095579,0.051560793,0.0013004814,0.004129641],"study_design_scores_gemma":[0.0000075063135,0.000015505282,0.00003052261,0.000008499321,0.0000054668053,0.0000040658056,0.000008070929,0.986639,0.0000731438,0.01276959,0.00043578775,0.0000028871466],"about_ca_topic_score_codex":0.0058712247,"about_ca_topic_score_gemma":0.0053218994,"teacher_disagreement_score":0.006741879,"about_ca_system_score_codex":0.0016814923,"about_ca_system_score_gemma":0.0026936017,"threshold_uncertainty_score":0.023917556},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076012914,0.00014410485,0.98944783,0.00013409408,0.000015151314,0.000021570371,0.000022909397,0.000056462417,0.0025565699],"genre_scores_gemma":[0.6726411,0.0005158982,0.32137638,0.00023123623,0.00006171641,0.0002796542,0.00015986766,0.00023550098,0.0044986056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979113,0.00091279676,0.000113793205,0.0003375217,0.0004653395,0.00025919167],"domain_scores_gemma":[0.99531096,0.0031066553,0.0005020496,0.00037310756,0.00053611863,0.00017126036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045998027,0.0012724167,0.0021338847,0.0010388468,0.00056136743,0.00397441,0.0011942374,0.0014829717,0.0046949643],"category_scores_gemma":[0.014246178,0.0007923372,0.0013569716,0.0009915167,0.0021104398,0.002702448,0.0033419903,0.002989159,0.00069266907],"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.00006575061,0.00004868388,0.0002672068,0.0001304365,0.000048818387,0.00007267788,0.00007495583,0.84592944,0.0023632688,0.13615902,0.0006386073,0.014201144],"study_design_scores_gemma":[0.000006838603,0.00002891349,0.00003588137,0.000020161782,0.0000056335225,0.000014635746,0.000014668875,0.9518801,0.0006786036,0.04680849,0.0004992034,0.000006849216],"about_ca_topic_score_codex":0.0010682538,"about_ca_topic_score_gemma":0.00064115116,"teacher_disagreement_score":0.0046949643,"about_ca_system_score_codex":0.0012939243,"about_ca_system_score_gemma":0.0014257582,"threshold_uncertainty_score":0.024326384},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007167369,0.00041488354,0.9842755,0.00026897082,0.00007594366,0.000038079044,0.00011590454,0.000100004334,0.0075432975],"genre_scores_gemma":[0.4418116,0.0020457006,0.5291111,0.00046743848,0.00040397525,0.00034816694,0.00062753446,0.00047294534,0.024711467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986039,0.00065997755,0.000043899294,0.000148523,0.00036603023,0.00017762757],"domain_scores_gemma":[0.99820566,0.0010541477,0.00012188701,0.00019186601,0.0002596821,0.00016682333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018519352,0.0014081126,0.0017320268,0.001461078,0.0006268047,0.0018426987,0.0017008957,0.0014584555,0.0060403747],"category_scores_gemma":[0.0046176,0.001035995,0.0019661665,0.0018154711,0.001103168,0.0017823704,0.0023436619,0.0018409096,0.0007545703],"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.000083664505,0.00007245816,0.0003350085,0.00015162867,0.000080296326,0.00007574615,0.000077606266,0.7329118,0.0020961568,0.22383888,0.0060921726,0.03418457],"study_design_scores_gemma":[0.000005080868,0.000013737642,0.00006143383,0.000014227228,0.000012296014,0.000027723474,0.000012295567,0.9532597,0.000218083,0.045305375,0.0010639211,0.0000061127266],"about_ca_topic_score_codex":0.0027383508,"about_ca_topic_score_gemma":0.0027523702,"teacher_disagreement_score":0.0060403747,"about_ca_system_score_codex":0.0016287054,"about_ca_system_score_gemma":0.0012546583,"threshold_uncertainty_score":0.020207047},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009884452,0.0005194134,0.9854833,0.000677105,0.00006436365,0.000081147315,0.00011225307,0.0005968232,0.0025811202],"genre_scores_gemma":[0.33352798,0.0007514528,0.65236145,0.00088311255,0.00039908238,0.0007984419,0.0011965537,0.00077466865,0.009307242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784446,0.001155299,0.00009856022,0.0003476056,0.00036949848,0.00018450282],"domain_scores_gemma":[0.9935482,0.0053130104,0.0002652303,0.00033361817,0.00034927076,0.00019073201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036367623,0.0023428781,0.0035510408,0.0012247622,0.0006425168,0.0022536863,0.0029778457,0.0045758337,0.0078043155],"category_scores_gemma":[0.016929088,0.0021813263,0.0011499418,0.0016562057,0.0019070448,0.0045676203,0.002624888,0.005897358,0.0022104008],"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.0005387354,0.0002901304,0.00041271525,0.00025152852,0.00007266431,0.00007519126,0.00008488452,0.78045005,0.0015152368,0.046071324,0.011159849,0.15907766],"study_design_scores_gemma":[0.000030213743,0.000042564385,0.00004058026,0.000016347505,0.00000455681,0.000011534508,0.000007768697,0.97736394,0.00018573955,0.021998614,0.0002930991,0.0000050690237],"about_ca_topic_score_codex":0.002002443,"about_ca_topic_score_gemma":0.0019184493,"teacher_disagreement_score":0.0078043155,"about_ca_system_score_codex":0.0012627972,"about_ca_system_score_gemma":0.0016774222,"threshold_uncertainty_score":0.026108027},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006247306,0.000041544037,0.9920922,0.00005053347,0.000036376725,0.000031001513,0.000022388447,0.00051301287,0.00096572057],"genre_scores_gemma":[0.17321007,0.000060508948,0.8229807,0.000064103384,0.000036174606,0.0001214952,0.00017999734,0.0002829553,0.003063916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996592,0.000070293354,0.0000199076,0.00006624087,0.0001350327,0.000049345424],"domain_scores_gemma":[0.9989134,0.0005269842,0.00006812763,0.00013366783,0.00027557294,0.00008226009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086810254,0.0009602165,0.0008914223,0.0007475171,0.00050842954,0.0011712131,0.0012970497,0.0010232013,0.007952393],"category_scores_gemma":[0.0042436155,0.00054044515,0.0005521454,0.00088178896,0.0006804441,0.0012285572,0.0018287706,0.0016608941,0.0016580328],"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.0005539851,0.00021571247,0.001060513,0.00016102188,0.00007284209,0.00015768607,0.00013439545,0.50421524,0.012967359,0.047773723,0.0053486456,0.4273388],"study_design_scores_gemma":[0.000026384494,0.000027917562,0.00007205512,0.0000033311753,0.000005494506,0.000016286747,0.000011044384,0.9938006,0.001418694,0.0040314607,0.0005812389,0.000005506812],"about_ca_topic_score_codex":0.004214467,"about_ca_topic_score_gemma":0.0061485497,"teacher_disagreement_score":0.007952393,"about_ca_system_score_codex":0.00094531954,"about_ca_system_score_gemma":0.0019480184,"threshold_uncertainty_score":0.0266034},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029482301,0.000090945345,0.9949121,0.00007168672,0.000034148732,0.000019857232,0.000017770515,0.00017946197,0.0017258436],"genre_scores_gemma":[0.20905514,0.0002501521,0.7838143,0.00016925106,0.000074344054,0.0004138444,0.00019831395,0.00042757962,0.005597083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950945,0.00021286373,0.00001994182,0.00008660762,0.00011772706,0.000053482225],"domain_scores_gemma":[0.9986645,0.00088439934,0.00008578364,0.00007865841,0.00023462536,0.00005200318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018622067,0.0016202804,0.0017037927,0.0008905478,0.00066030497,0.001352479,0.0013472723,0.0015235143,0.004903572],"category_scores_gemma":[0.0036644377,0.0007540632,0.0010067765,0.00089417933,0.0009964462,0.0015847937,0.0017322353,0.002087731,0.0008073678],"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.00008687512,0.00005196394,0.0001779143,0.00008659611,0.000036713955,0.000032869277,0.000046955047,0.926985,0.00085684593,0.024094675,0.001460599,0.04608288],"study_design_scores_gemma":[0.000009874739,0.000025824005,0.000017425222,0.0000064866185,0.0000043887726,0.00000620177,0.000005023362,0.99404705,0.00019415775,0.005341335,0.00033912063,0.0000031516686],"about_ca_topic_score_codex":0.0024768997,"about_ca_topic_score_gemma":0.0031905642,"teacher_disagreement_score":0.004903572,"about_ca_system_score_codex":0.00082477566,"about_ca_system_score_gemma":0.0016852748,"threshold_uncertainty_score":0.016404152},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018691622,0.00003366003,0.99706393,0.000023798122,0.00001601025,0.000013646133,0.00001307606,0.00014984295,0.00081683893],"genre_scores_gemma":[0.17199843,0.0002466437,0.82213837,0.00015469198,0.000069962734,0.00022199913,0.00018239584,0.00068592624,0.004301622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889755,0.00025543425,0.00007173507,0.00023514184,0.00043686046,0.00010326778],"domain_scores_gemma":[0.9980813,0.0009806751,0.00024696314,0.00035132354,0.00022822415,0.00011150807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021505244,0.0010937132,0.0011691672,0.0010276977,0.00070148986,0.00121978,0.0017617013,0.0009701614,0.004107875],"category_scores_gemma":[0.006125527,0.0008527653,0.0018086926,0.00058204454,0.0016985759,0.0018385901,0.0033706243,0.0039164973,0.0010592293],"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.000116484945,0.000094307296,0.00061275833,0.00018432538,0.000062636325,0.00014202339,0.00046122234,0.67748445,0.017920068,0.2217382,0.0016306926,0.07955285],"study_design_scores_gemma":[0.000014926069,0.000057062596,0.0000932167,0.000025984671,0.000012969601,0.00003540436,0.000022031296,0.96414685,0.0034292638,0.027458316,0.004679829,0.000024132623],"about_ca_topic_score_codex":0.0019354396,"about_ca_topic_score_gemma":0.0019213213,"teacher_disagreement_score":0.004107875,"about_ca_system_score_codex":0.00083260733,"about_ca_system_score_gemma":0.0012086793,"threshold_uncertainty_score":0.013742149},"labels":[],"label_agreement":null}]}